1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
/*
* cook - file construction tool
* Copyright (C) 1997 Peter Miller;
* All rights reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
*
* MANIFEST: functions to manipulate graph files
*/
#include <graph/file.h>
#include <graph/recipe_list.h>
#include <mem.h>
#include <str.h>
#include <trace.h>
/*
* NAME
* graph_file_new
*
* SYNOPSIS
* graph_file_ty *graph_file_new(string_ty *);
*
* DESCRIPTION
* The graph_file_new function is used to allocate a new graph file
* instance in dynamic memory.
*
* RETURNS
* graph_file_ty *
*
* CAVEAT
* Use graph_file_delete when you are done with it.
*/
graph_file_ty *
graph_file_new(fn)
string_ty *fn;
{
graph_file_ty *gfp;
trace(("graph_file_new(fn = \"%s\")\n{\n"/*}*/, fn->str_text));
gfp = mem_alloc(sizeof(graph_file_ty));
gfp->reference_count = 1;
gfp->filename = str_copy(fn);
gfp->input = graph_recipe_list_nrc_new();
gfp->output = graph_recipe_list_nrc_new();
gfp->pending = 0;
gfp->previous_backtrack = 0;
gfp->previous_error = 0;
gfp->primary_target = 0;
trace(("return %08lX;\n", (long)gfp));
trace((/*{*/"}\n"));
return gfp;
}
/*
* NAME
* graph_file_delete
*
* SYNOPSIS
* void graph_file_delete(graph_file_ty *);
*
* DESCRIPTION
* The graph_file_delete function is used to release the resources
* held by a grapg file instance in dynamic memory.
*/
void
graph_file_delete(gfp)
graph_file_ty *gfp;
{
trace(("graph_file_delete(gfp = %08lX)\n{\n"/*}*/, gfp));
assert(gfp);
assert(gfp->reference_count > 0);
gfp->reference_count--;
if (gfp->reference_count > 0)
{
trace((/*{*/"}\n"));
return;
}
trace_string(gfp->filename->str_text);
str_free(gfp->filename);
gfp->filename = 0;
graph_recipe_list_nrc_delete(gfp->input);
gfp->input = 0;
graph_recipe_list_nrc_delete(gfp->output);
gfp->output = 0;
mem_free(gfp);
trace((/*{*/"}\n"));
}
/*
* NAME
* graph_file_copy
*
* SYNOPSIS
* graph_file_ty *graph_file_copy(graph_file_ty *);
*
* DESCRIPTION
* The graph_file_copy function is used to copy a graph file
* instance in dynamic memory.
*
* RETURNS
* graph_file_ty *
*
* CAVEAT
* It actually uses reference counting, it's not as bad as it
* sounds.
*/
graph_file_ty *
graph_file_copy(gfp)
graph_file_ty *gfp;
{
assert(gfp);
assert(gfp->reference_count > 0);
gfp->reference_count++;
return gfp;
}
|