Searched refs:oedge (Results 1 - 5 of 5) sorted by relevance

/ast/src/lib/libvgraph/
H A Dgrfold.c29 Gredge_t *ed, *enext, *oedge, *iedge; local
41 oedge = iedge = NIL(Gredge_t*);
43 { ed = nd->oedge; nd->oedge = NIL(Gredge_t*);
47 { ed->onext = oedge; oedge = ed; }
57 fold->oedge = oedge;
H A Dgraph.c86 { for(e = nd->oedge; e; e = enext)
137 { for(pe = NIL(Gredge_t*), e = ed->tail->oedge; e; pe = e, e = e->onext)
141 else ed->tail->oedge->onext = e->onext;
171 ed->onext = edge.tail->oedge; edge.tail->oedge = ed;
211 { nd->oedge = nd->iedge = NIL(Gredge_t*);
216 { ed->onext = ed->tail->oedge; ed->tail->oedge = ed;
H A Dvgraph.h20 Gredge_t* oedge; /* list of outgoing edges */ member in struct:_grnode_s
38 Gredge_t* onext; /* link for node->oedge */
147 #define gradjacent(n) ((n)->elist = (n)->oedge)
H A Dgrbranching.c115 n->oedge = NIL(Gredge_t*); /* wipe the out-edges */
251 e->onext = e->tail->oedge; e->tail->oedge = e;
/ast/src/lib/libvcodex/
H A Dvcsfxsort.c410 { for(e = nd->oedge; e; e = e->onext)
517 { for(e = nd->oedge; e; e = e->onext)

Completed in 15 milliseconds