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
|
/*
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
/* Lefteris Koutsofios - AT&T Bell Laboratories */
#include "common.h"
#include "mem.h"
#include "code.h"
#include "tbl.h"
#include "str.h"
#include "display.h"
typedef struct dnode_t {
Ttype_t ttype;
Tobj ko, vo;
char *path;
} dnode_t;
typedef struct seennode_t {
Tobj vo;
char *path;
} seennode_t;
static seennode_t *seenp;
static int seeni, seenn;
#define SEENINCR 100
#define SEENSIZE sizeof (seennode_t)
static int indent, afternl;
static void update (dnode_t *);
static int cmp (const void *, const void *);
static seennode_t *findseen (dnode_t *);
static void add2seen (dnode_t *);
static void pr (char *);
void Dinit (void) {
seenp = Marrayalloc ((long) SEENINCR * SEENSIZE);
seeni = 0;
seenn = SEENINCR;
}
void Dterm (void) {
Marrayfree (seenp);
seeni = seenn = 0;
}
void Dtrace (Tobj to, int offset) {
dnode_t dnode;
char *s;
int i;
indent = offset - 2;
afternl = TRUE;
if (Tgettype (to) != T_TABLE) {
pr ((s = Ssfull (NULL, to))), free (s);
return;
}
seeni = 0;
dnode.vo = to;
dnode.path = "";
update (&dnode);
for (i = 0; i < seeni; i++)
free (seenp[i].path), seenp[i].path = NULL;
}
static void update (dnode_t *pnode) {
Tkvindex_t tkvi;
dnode_t *list, *cnode;
seennode_t *seennode;
char *s;
long i, n;
indent += 2;
n = ((Ttable_t *) pnode->vo)->n;
if (!(list = malloc (n * sizeof (dnode_t))))
panic (POS, "update", "list malloc failed");
for (cnode = &list[0], Tgetfirst (pnode->vo, &tkvi); tkvi.kvp;
cnode++, Tgetnext (&tkvi)) {
cnode->ko = tkvi.kvp->ko;
cnode->vo = tkvi.kvp->vo;
cnode->ttype = Tgettype (cnode->vo);
}
qsort ((char *) list, n, sizeof (dnode_t), cmp);
for (i = 0, cnode = &list[0]; i < n; i++, cnode++) {
cnode->path = Spath (pnode->path, cnode->ko);
seennode = findseen (cnode);
if (seennode) {
pr ((s = Sseen (cnode->ko, seennode->path))), free (s);
} else {
add2seen (cnode);
if (cnode->ttype == T_TABLE) {
pr ((s = Stfull (cnode->ko))), free (s);
update (cnode);
pr ("];");
} else {
pr ((s = Ssfull (cnode->ko, cnode->vo))), free (s);
}
}
}
free (list);
indent -= 2;
}
static int cmp (const void *a, const void *b) {
Ttype_t atype, btype;
dnode_t *anode, *bnode;
double d1, d2;
anode = (dnode_t *) a, bnode = (dnode_t *) b;
atype = Tgettype (anode->ko), btype = Tgettype (bnode->ko);
if (atype != btype)
return (atype - btype);
if (atype == T_STRING)
return Strcmp (Tgetstring (anode->ko), Tgetstring (bnode->ko));
if (atype == T_INTEGER)
d1 = Tgetinteger (anode->ko), d2 = Tgetinteger (bnode->ko);
else if (atype == T_REAL)
d1 = Tgetreal (anode->ko), d2 = Tgetreal (bnode->ko);
if (d1 < d2)
return -1;
else if (d1 > d2)
return 1;
else
return 0; /* but this should never happen since keys are unique */
}
static seennode_t *findseen (dnode_t *cnode) {
int i;
for (i = 0; i < seeni; i++)
if (seenp[i].vo == cnode->vo)
return &seenp[i];
return NULL;
}
static void add2seen (dnode_t *cnode) {
if (seeni >= seenn) {
seenp = Marraygrow (seenp, (long) (seenn + SEENINCR) * SEENSIZE);
seenn += SEENINCR;
}
seenp[seeni].vo = cnode->vo;
seenp[seeni++].path = cnode->path;
}
static void pr (char *s) {
char *s1;
int i;
for (s1 = s; *s1; s1++) {
if (afternl) {
for (i = 0; i < indent; i++)
putchar (' ');
afternl = FALSE;
}
if (*s1 == '\n')
afternl = TRUE;
putchar ((*s1)); /* HACK: to keep proto happy */
}
putchar ('\n');
afternl = TRUE;
}
|
