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
|
/**
* @file
* @ingroup cgraph_core
*/
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-v10.html
*
* Contributors: Details at https://graphviz.org
*************************************************************************/
#include <cgraph/cghdr.h>
#include <stdbool.h>
#include <stdlib.h>
#include <util/alloc.h>
typedef struct IMapEntry_s {
Dtlink_t namedict_link;
Dtlink_t iddict_link;
IDTYPE id;
char *str;
} IMapEntry_t;
static int idcmpf(void *arg_p0, void *arg_p1) {
IMapEntry_t *p0 = arg_p0;
IMapEntry_t *p1 = arg_p1;
if (p0->id > p1->id)
{
return 1;
}
else if (p0->id < p1->id)
{
return -1;
}
else
{
return 0;
}
}
/* note, OK to compare pointers into shared string pool
* but can't probe with an arbitrary string pointer
*/
static int namecmpf(void *arg_p0, void *arg_p1) {
IMapEntry_t *p0 = arg_p0;
IMapEntry_t *p1 = arg_p1;
if (p0->str > p1->str)
{
return 1;
}
else if (p0->str < p1->str)
{
return -1;
}
else
{
return 0;
}
}
static Dtdisc_t LookupByName = {
0, /* object ptr is passed as key */
0, /* size (ignored) */
offsetof(IMapEntry_t, namedict_link),
NULL,
NULL,
namecmpf,
};
static Dtdisc_t LookupById = {
0, /* object ptr is passed as key */
0, /* size (ignored) */
offsetof(IMapEntry_t, iddict_link),
NULL,
NULL,
idcmpf,
};
bool aginternalmaplookup(Agraph_t *g, int objtype, char *str, IDTYPE *result) {
Dict_t *d;
IMapEntry_t *sym, template;
char *search_str;
if (objtype == AGINEDGE)
objtype = AGEDGE;
if ((d = g->clos->lookup_by_name[objtype])) {
if ((search_str = agstrbind(g, str))) {
template.str = search_str;
sym = dtsearch(d, &template);
if (sym) {
*result = sym->id;
return true;
}
}
}
return false;
}
/* caller GUARANTEES that this is a new entry */
void aginternalmapinsert(Agraph_t * g, int objtype, char *str,
IDTYPE id)
{
Dict_t *d_name_to_id, *d_id_to_name;
IMapEntry_t *ent = gv_alloc(sizeof(IMapEntry_t));
ent->id = id;
ent->str = agstrdup(g, str);
if (objtype == AGINEDGE)
objtype = AGEDGE;
if ((d_name_to_id = g->clos->lookup_by_name[objtype]) == NULL)
d_name_to_id = g->clos->lookup_by_name[objtype] =
agdtopen(&LookupByName, Dttree);
if ((d_id_to_name = g->clos->lookup_by_id[objtype]) == NULL)
d_id_to_name = g->clos->lookup_by_id[objtype] =
agdtopen(&LookupById, Dttree);
dtinsert(d_name_to_id, ent);
dtinsert(d_id_to_name, ent);
}
static IMapEntry_t *find_isym(Agraph_t * g, int objtype, IDTYPE id)
{
Dict_t *d;
IMapEntry_t *isym, itemplate;
if (objtype == AGINEDGE)
objtype = AGEDGE;
if ((d = g->clos->lookup_by_id[objtype])) {
itemplate.id = id;
isym = dtsearch(d, &itemplate);
} else
isym = NULL;
return isym;
}
char *aginternalmapprint(Agraph_t * g, int objtype, IDTYPE id)
{
IMapEntry_t *isym;
if ((isym = find_isym(g, objtype, id)))
return isym->str;
return NULL;
}
int aginternalmapdelete(Agraph_t * g, int objtype, IDTYPE id)
{
IMapEntry_t *isym;
if (objtype == AGINEDGE)
objtype = AGEDGE;
if ((isym = find_isym(g, objtype, id))) {
dtdelete(g->clos->lookup_by_name[objtype], isym);
dtdelete(g->clos->lookup_by_id[objtype], isym);
agstrfree(g, isym->str, false);
free(isym);
return true;
}
return false;
}
void aginternalmapclearlocalnames(Agraph_t * g)
{
int i;
IMapEntry_t *sym, *nxt;
Dict_t **d_name;
d_name = g->clos->lookup_by_name;
for (i = 0; i < 3; i++) {
if (d_name[i]) {
for (sym = dtfirst(d_name[i]); sym; sym = nxt) {
nxt = dtnext(d_name[i], sym);
if (sym->str[0] == LOCALNAMEPREFIX)
aginternalmapdelete(g, i, sym->id);
}
}
}
}
static void closeit(Dict_t ** d)
{
int i;
for (i = 0; i < 3; i++) {
if (d[i]) {
dtclose(d[i]);
d[i] = NULL;
}
}
}
void aginternalmapclose(Agraph_t * g)
{
closeit(g->clos->lookup_by_name);
closeit(g->clos->lookup_by_id);
}
|
