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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
|
/*
This software may only be used by you under license from AT&T Corp.
("AT&T"). A copy of AT&T's Source Code Agreement is available at
AT&T's Internet website having the URL:
<http://www.research.att.com/sw/tools/graphviz/license/source.html>
If you received this software without first entering into a license
with AT&T, you have an infringing copy of this software and cannot use
it without violating AT&T's intellectual property rights.
*/
#pragma prototyped
#define EXTERN
#include <aghdr.h>
#ifdef DMALLOC
#include "dmalloc.h"
#endif
const char AgraphVersion[] = VERSION;
/*
* this code sets up the resource management discipline
* and returns a new main graph struct.
*/
static Agclos_t *agclos(Agdisc_t *proto)
{
Agmemdisc_t *memdisc;
void *memclosure;
Agclos_t *rv;
/* establish an allocation arena */
memdisc = ((proto && proto->mem)? proto->mem : &AgMemDisc);
memclosure = memdisc->open();
rv = memdisc->alloc(memclosure, sizeof(Agclos_t));
rv->disc.mem = memdisc;
rv->state.mem = memclosure;
rv->disc.id = ((proto && proto->id)? proto->id : &AgIdDisc);
rv->disc.io = ((proto && proto->io)? proto->io : &AgIoDisc);
rv->callbacks_enabled = TRUE;
return rv;
}
/*
* Open a new main graph with the given descriptor (directed, strict, etc.)
*/
Agraph_t * agopen(char *name, Agdesc_t desc, Agdisc_t *arg_disc)
{
Agraph_t *g;
Agclos_t *clos;
unsigned long gid;
clos = agclos(arg_disc);
g = clos->disc.mem->alloc(clos->state.mem, sizeof(Agraph_t));
AGTYPE(g) = AGRAPH;
g->clos = clos;
g->desc = desc;
g->desc.maingraph = TRUE;
g->root = g;
g->clos->state.id = g->clos->disc.id->open(g);
if (agmapnametoid(g, AGRAPH, name, &gid, TRUE))
AGID(g) = gid;
/* else AGID(g) = 0 because we have no alternatives */
return agopen1(g);
}
/*
* initialize dictionaries, set seq, invoke init method of new graph
*/
Agraph_t *agopen1(Agraph_t *g)
{
Agraph_t *par;
g->n_seq = agdtopen(g,&Ag_obj_seq_disc,Dttree);
g->n_id = agdtopen(g,&Ag_obj_id_disc,Dttree);
g->e_seq = agdtopen(g,&Ag_obj_seq_disc,Dttree);
g->e_id = agdtopen(g,&Ag_edge_disc,Dttree);
g->g_dict = agdtopen(g,&Ag_obj_id_disc,Dttree);
par = agparent(g);
if (par) {
AGSEQ(g) = agnextseq(par, AGRAPH);
dtinsert(par->g_dict,g);
} /* else AGSEQ=0 */
if (g->desc.has_attrs) agraphattr_init(g,FALSE);
agmethod_init(g,g);
return g;
}
/*
* Close a graph or subgraph, freeing its storage.
*/
int agclose(Agraph_t *g)
{
Agraph_t *subg,*next_subg,*par;
Agnode_t *n,*next_n;
agflatten(g,FALSE);
par = agparent(g);
if ((par == NILgraph) && (AGDISC(g,mem)->close)) {
/* free entire heap */
agmethod_delete(g,g); /* invoke user callbacks */
agfreeid(g, AGRAPH, AGID(g));
AGDISC(g,mem)->close(AGCLOS(g,mem)); /* whoosh */
return SUCCESS;
}
for (subg = agfstsubg(g); subg; subg = next_subg) {
next_subg = agnxtsubg(subg);
agclose(subg);
}
for (n = agfstnode(g); n; n = next_n) {
next_n = agnxtnode(n);
agdelnode(n);
}
aginternalmapclose(g);
agmethod_delete(g,g);
assert(dtsize(g->n_id) == 0);
agdtclose(g,g->n_id);
assert(dtsize(g->n_seq) == 0);
agdtclose(g,g->n_seq);
assert(dtsize(g->e_id) == 0);
agdtclose(g,g->e_id);
assert(dtsize(g->e_seq) == 0);
agdtclose(g,g->e_seq);
assert(dtsize(g->g_dict) == 0);
agdtclose(g,g->g_dict);
if (g->desc.has_attrs) agraphattr_delete(g);
agrecclose((Agobj_t*)g);
agfreeid(g, AGRAPH, AGID(g));
if (par) {agdelsubg(par,g); agfree(par,g);}
else {
Agmemdisc_t *memdisc;
void *memclos, *clos;
while (g->clos->cb)
agpopdisc(g,g->clos->cb->f);
AGDISC(g,id)->close(AGCLOS(g,id));
agstrclose(g);
memdisc = AGDISC(g,mem);
memclos = AGCLOS(g,mem);
clos = g->clos;
memdisc->free(memclos,g);
memdisc->free(memclos,clos);
}
return SUCCESS;
}
unsigned long agnextseq(Agraph_t *g, int objtype) { return ++(g->clos->seq[objtype]);}
int agnnodes(Agraph_t *g)
{
return dtsize(g->n_id);
}
int agnedges(Agraph_t *g)
{
Agnode_t *n;
int rv = 0;
for (n = agfstnode(g); n; n = agnxtnode(n))
rv += agdegree(n,FALSE,TRUE); /* must use OUT to get self-arcs */
return rv;
}
int agisflattened(Agraph_t *g)
{
return g->desc.flatlock;
}
int agisdirected(Agraph_t *g)
{
return g->desc.directed;
}
int agisundirected(Agraph_t *g)
{
return NOT(agisdirected(g));
}
int agisstrict(Agraph_t *g)
{
return g->desc.strict;
}
int agdegree(Agnode_t *n, int want_in, int want_out)
{
Agedge_t *e;
int rv = 0;
if (want_in) for (e = agfstin(n); e; e = agnxtin(e)) rv++;
if (want_out) for (e = agfstout(n); e; e = agnxtout(e)) rv++;
return rv;
}
/* directed, strict, flatlock, maingraph */
Agdesc_t Agdirected = {1, 0, 0, 1};
Agdesc_t Agstrictdirected = {1, 1, 0, 1};
Agdesc_t Agundirected = {0, 0, 0, 1};
Agdesc_t Agstrictundirected = {0, 1, 0, 1};
Agdisc_t AgDefaultDisc = {&AgMemDisc, &AgIdDisc, &AgIoDisc};
|
