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 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299
|
/* $Id: pend.c,v 1.3 2009/06/03 01:10:51 ellson Exp $ $Revision: 1.3 $ */
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
#include <cghdr.h>
static char DRName[] = "_AG_pending";
typedef struct symlist_s {
Agsym_t *sym;
struct symlist_s *link;
} symlist_t;
/* this record describes one pending callback on one object */
typedef struct {
Dtlink_t link;
unsigned long key; /* universal key for main or sub-object */
Agraph_t *g;
Agobj_t *obj;
symlist_t *symlist; /* attributes involved */
} pending_cb_t;
typedef struct {
Agrec_t h;
struct {
Dict_t *g, *n, *e;
} ins, mod, del;
} pendingset_t;
static void free_symlist(pending_cb_t * pcb)
{
symlist_t *s, *t;
for (s = pcb->symlist; s; s = t) {
t = s->link;
agfree(pcb->g, s);
}
}
static void freef(Dict_t * dict, void *ptr, Dtdisc_t * disc)
{
pending_cb_t *pcb;
NOTUSED(dict);
NOTUSED(disc);
pcb = ptr;
free_symlist(pcb);
agfree(pcb->g, pcb);
}
static Dtdisc_t Disc = {
offsetof(pending_cb_t, key), /* sort by 'key' */
sizeof(unsigned long),
0, /* link offset */
NIL(Dtmake_f),
freef,
NIL(Dtcompar_f),
NIL(Dthash_f)
};
static Dict_t *dictof(pendingset_t * ds, Agobj_t * obj, int kind)
{
Dict_t **dict_ref = NIL(Dict_t **);
dict_ref = 0;
switch (AGTYPE(obj)) {
case AGRAPH:
switch (kind) {
case CB_INITIALIZE:
dict_ref = &(ds->ins.g);
break;
case CB_UPDATE:
dict_ref = &(ds->mod.g);
break;
case CB_DELETION:
dict_ref = &(ds->del.g);
break;
default:
break;
}
break;
case AGNODE:
switch (kind) {
case CB_INITIALIZE:
dict_ref = &(ds->ins.n);
break;
case CB_UPDATE:
dict_ref = &(ds->mod.n);
break;
case CB_DELETION:
dict_ref = &(ds->del.n);
break;
default:
break;
}
break;
case AGEDGE:
switch (kind) {
case CB_INITIALIZE:
dict_ref = &(ds->ins.e);
break;
case CB_UPDATE:
dict_ref = &(ds->mod.e);
break;
case CB_DELETION:
dict_ref = &(ds->del.e);
break;
default:
break;
}
break;
default:
break;
}
if (dict_ref == 0)
agerr(AGERR, "pend dictof a bad object");
if (*dict_ref == NIL(Dict_t *))
*dict_ref = agdtopen(agraphof(obj), &Disc, Dttree);
return *dict_ref;
}
static unsigned long genkey(Agobj_t * obj)
{
return obj->tag.id;
}
static pending_cb_t *lookup(Dict_t * dict, Agobj_t * obj)
{
pending_cb_t key, *rv;
key.key = genkey(obj);
rv = (pending_cb_t *) dtsearch(dict, &key);
return rv;
}
static void record_sym(Agobj_t * obj, pending_cb_t * handle,
Agsym_t * optsym)
{
symlist_t *sym, *nsym, *psym;
psym = NIL(symlist_t *);
for (sym = handle->symlist; sym; psym = sym, sym = sym->link) {
if (sym->sym == optsym)
break;
if (sym == NIL(symlist_t *)) {
nsym = agalloc(agraphof(obj), sizeof(symlist_t));
nsym->sym = optsym;
if (psym)
psym->link = nsym;
else
handle->symlist = nsym;
}
/* else we already have a callback registered */
}
}
static pending_cb_t *insert(Dict_t * dict, Agraph_t * g, Agobj_t * obj,
Agsym_t * optsym)
{
pending_cb_t *handle;
handle = agalloc(agraphof(obj), sizeof(pending_cb_t));
handle->obj = obj;
handle->key = genkey(obj);
handle->g = g;
if (optsym) {
handle->symlist =
(symlist_t *) agalloc(handle->g, sizeof(symlist_t));
handle->symlist->sym = optsym;
}
dtinsert(dict, handle);
return handle;
}
static void purge(Dict_t * dict, Agobj_t * obj)
{
pending_cb_t *handle;
if ((handle = lookup(dict, obj))) {
dtdelete(dict, handle);
}
}
void agrecord_callback(Agraph_t * g, Agobj_t * obj, int kind,
Agsym_t * optsym)
{
pendingset_t *pending;
Dict_t *dict;
pending_cb_t *handle;
pending =
(pendingset_t *) agbindrec(g, DRName, sizeof(pendingset_t), FALSE);
switch (kind) {
case CB_INITIALIZE:
assert(lookup(dictof(pending, obj, CB_UPDATE), obj) == 0);
assert(lookup(dictof(pending, obj, CB_DELETION), obj) == 0);
dict = dictof(pending, obj, CB_INITIALIZE);
handle = lookup(dict, obj);
if (handle == 0)
handle = insert(dict, g, obj, optsym);
break;
case CB_UPDATE:
if (lookup(dictof(pending, obj, CB_INITIALIZE), obj))
break;
if (lookup(dictof(pending, obj, CB_DELETION), obj))
break;
dict = dictof(pending, obj, CB_UPDATE);
handle = lookup(dict, obj);
if (handle == 0)
handle = insert(dict, g, obj, optsym);
record_sym(obj, handle, optsym);
break;
case CB_DELETION:
purge(dictof(pending, obj, CB_INITIALIZE), obj);
purge(dictof(pending, obj, CB_UPDATE), obj);
dict = dictof(pending, obj, CB_DELETION);
handle = lookup(dict, obj);
if (handle == 0)
handle = insert(dict, g, obj, optsym);
break;
default:
agerr(AGERR,"agrecord_callback of a bad object");
}
}
static void cb(Dict_t * dict, int callback_kind)
{
pending_cb_t *pcb;
Agraph_t *g;
symlist_t *psym;
Agcbstack_t *stack;
if (dict)
while ((pcb = (pending_cb_t *) dtfirst(dict))) {
g = pcb->g;
stack = g->clos->cb;
switch (callback_kind) {
case CB_INITIALIZE:
aginitcb(g, pcb->obj, stack);
break;
case CB_UPDATE:
for (psym = pcb->symlist; psym; psym = psym->link)
agupdcb(g, pcb->obj, psym->sym, stack);
break;
case CB_DELETION:
agdelcb(g, pcb->obj, stack);
break;
}
dtdelete(dict, pcb);
}
}
static void agrelease_callbacks(Agraph_t * g)
{
pendingset_t *pending;
if (NOT(g->clos->callbacks_enabled)) {
g->clos->callbacks_enabled = TRUE;
pending =
(pendingset_t *) agbindrec(g, DRName, sizeof(pendingset_t),
FALSE);
/* this destroys objects in the opposite of their order of creation */
cb(pending->ins.g, CB_INITIALIZE);
cb(pending->ins.n, CB_INITIALIZE);
cb(pending->ins.e, CB_INITIALIZE);
cb(pending->mod.g, CB_UPDATE);
cb(pending->mod.n, CB_UPDATE);
cb(pending->mod.e, CB_UPDATE);
cb(pending->del.e, CB_DELETION);
cb(pending->del.n, CB_DELETION);
cb(pending->del.g, CB_DELETION);
}
}
int agcallbacks(Agraph_t * g, int flag)
{
if (flag && NOT(g->clos->callbacks_enabled))
agrelease_callbacks(g);
if (g->clos->callbacks_enabled) {
g->clos->callbacks_enabled = flag;
return TRUE;
}
g->clos->callbacks_enabled = flag;
return FALSE;
}
|