| /ast/src/lib/libvgraph/ |
| H A D | grbranching.c | 96 for(nd = (Grnode_t*)dtflatten(gr->nodes); nd; nd = (Grnode_t*)dtlink(gr->nodes,nd) )
113 for(w = 0, n = (Grnode_t*)dtflatten(gr->nodes); n; w += 1, n = (Grnode_t*)dtlink(gr->nodes,n) )
137 for(n = (Grnode_t*)dtflatten(gr->nodes); n; n = (Grnode_t*)dtlink(gr->nodes,n) )
216 /* move the remaining branching edges to their real nodes */
218 for(n = (Grnode_t*)dtflatten(gr->nodes); n; n = (Grnode_t*)dtlink(gr->nodes,n) )
247 for(n = (Grnode_t*)dtflatten(gr->nodes);
[all...] |
| H A D | graph.c | 9 static int nodecmp(Dt_t* nodes, Void_t* one, Void_t* two, Dtdisc_t* disc) argument
19 static void nodefree(Dt_t* nodes, Void_t* node, Dtdisc_t* disc) argument
70 /* function to find/create/delete nodes */
82 nd = dtsearch(gr->nodes, &node);
94 dtdelete(gr->nodes, nd);
114 return (Grnode_t*)dtinsert(gr->nodes, nd);
204 /* restore a graph after manipulation of nodes and edges */
210 for(nd = (Grnode_t*)dtflatten(gr->nodes); nd; nd = (Grnode_t*)dtlink(gr,nd))
236 if(gr->nodes)
237 dtclose(gr->nodes);
[all...] |
| H A D | vgraph.h | 51 Dtdisc_t nddc; /* CDT discipline for nodes */
52 Dt_t* nodes; /* set of nodes */ member in struct:_graph_s
132 /* return the representative node for a collapsed set of nodes */
|
| /ast/src/cmd/ksh93/sh/ |
| H A D | nvtype.c | 90 char *nodes; member in struct:Namtype
278 static Namval_t *findref(void *nodes, int n) argument
280 Namval_t *tp,*np = nv_namptr(nodes,n);
286 np = nv_namptr(nodes,i);
291 return(nv_namptr(pp->nodes,n-i-1));
299 Namval_t *nq = nv_namptr(dp->nodes,i);
308 nq->nvalue.nrp->np = findref(dp->nodes,i);
310 nq->nvalue.nrp->np = nv_namptr(pp->childfun.ttype->nodes,i);
321 Namval_t *np = nv_namptr(pp->nodes,i);
341 Namval_t *nr = nv_namptr( pp->childfun.ttype->nodes,
851 nv_mktype(Namval_t **nodes, int numnodes) argument
[all...] |
| H A D | name.c | 83 Namval_t **nodes; member in struct:sh_type
227 name = (sp->nodes[0])->nvname;
240 nv_delete(sp->nodes[0],root,NV_NOFREE);
242 errormsg(SH_DICT,ERROR_exit(1),e_redef,sp->nodes[0]->nvname);
247 if(np == sp->nodes[i])
252 sp->nodes[i-1] = sp->nodes[i];
263 sp->nodes = (Namval_t**)realloc(sp->nodes,sizeof(Namval_t*)*sp->maxnodes);
265 sp->nodes[s
[all...] |
| H A D | init.c | 1706 char *nodes; member in struct:Stats
1718 return(nv_namptr(sp->nodes,sp->current));
1734 nq = nv_namptr(sp->nodes,i);
1782 sp->nodes = (char*)(sp+1);
1787 np = nv_namptr(sp->nodes,i);
|
| /ast/src/cmd/mam/ |
| H A D | mamdag.sh | 63 print draw nodes as Box ';'
|
| /ast/src/cmd/kshlib/open/ |
| H A D | open.c | 244 Namval_t *nq,**nodes = (Namval_t**)(dcp+1); local
247 if(!(nq=nodes[n]))
249 nodes[n] = nq = sh_newnode(fp,np);
260 Namval_t *np, **nodes= (Namval_t**)(sp+1); local
272 if(!(np=nodes[i]) && out)
|
| /ast/src/cmd/ksh93/tests/ |
| H A D | comvar.sh | 276 unset nodes
277 typeset -A nodes
278 nodes[0]+=( integer x=5)
279 [[ ${nodes[0].x} == 5 ]] || err_exit '${nodes[0].x} should be 5'
543 compound -a nodes=(
547 expected='typeset -C x=(typeset -C -a nodes=([4]=());)'
|
| H A D | nameref.sh | 502 compound -A x.nodes
503 nameref node=treename.nodes[4]
|
| /ast/src/cmd/kshlib/dss/ |
| H A D | dss.c | 77 char *nodes; member in struct:Namtype
458 if(!dp->hdr.nodes)
462 if(!(dp->hdr.nodes = (char*)calloc(dp->hdr.numnodes,NV_MINSZ)))
464 np = nv_namptr(dp->hdr.nodes,0);
472 if(mp!=dp->hdr.np && pp && pp->hdr.fun.disc==&parent_disc && pp->hdr.nodes)
473 mp = nv_namptr(pp->hdr.nodes,0);
482 return(np?np:nv_namptr(dp->hdr.nodes,0));
483 np = nv_namptr(dp->hdr.nodes,vp->header.index+1);
526 dp->nodes = 0;
616 if(dp->hdr.nodes)
[all...] |
| /ast/src/lib/libvcodex/ |
| H A D | vcsfxsort.c | 401 hd = tl = NIL(Grnode_t*); /* first build the list of root nodes */
402 for(nd = (Grnode_t*)dtfirst(gr->nodes); nd; nd = (Grnode_t*)dtnext(gr->nodes,nd))
508 hd = tl = NIL(Grnode_t*); /* first build the list of root nodes */
509 for(nd = (Grnode_t*)dtfirst(gr->nodes); nd; nd = (Grnode_t*)dtnext(gr->nodes,nd))
|