| /ast/src/lib/libvgraph/ |
| H A D | grfold.c | 10 /* return the representative to 'nd' */
11 Grnode_t* _grfind(Grnode_t* nd) argument
16 for(fold = nd; fold != fold->fold; fold = fold->fold)
19 for(f = nd; f != fold; ) /* path compression */
20 { f = nd->fold; nd->fold = fold; }
28 Grnode_t *nd; local
37 for(nd = list; nd; nd
[all...] |
| H A D | graph.c | 73 Grnode_t node, *nd; local
82 nd = dtsearch(gr->nodes, &node);
85 { if(nd)
86 { for(e = nd->oedge; e; e = enext)
90 for(e = nd->iedge; e; e = enext)
94 dtdelete(gr->nodes, nd);
99 if(type == 0 || nd) /* finding only or inserting an existing node */
100 return nd;
105 if(!(nd = (Grnode_t*)calloc(1, sz)) )
108 nd
112 (*gr->disc->eventf)(gr, GR_NODE|GR_OPENING, nd, gr->disc); local
121 Grnode_t *nd; local
207 Grnode_t *nd; local
[all...] |
| H A D | grbranching.c | 70 static int prnode(Grnode_t* nd) argument
72 if(!nd)
76 PRINT(Fd,"node = %d", (int)nd->label); PRINT(Fd,"(%d), ", grfind(nd)->label);
77 PRINT(Fd,"link = %d, ", nd->link ? (int)nd->link->label : -1);
78 PRINT(Fd,"mark = %d\n", (int)BRNODE(nd)->mark);
94 { Grnode_t *nd; local
96 for(nd = (Grnode_t*)dtflatten(gr->nodes); nd; n
[all...] |
| /ast/src/lib/libast/misc/ |
| H A D | ftwalk.c | 62 int nd; local
95 nd = 0;
101 dd[nd++] = x;
102 if (nd >= elementsof(dd))
108 while (nd > 0)
109 dd[--nd]->info |= FTS_DD;
119 nd = 0;
130 dd[nd++] = x;
131 if (nd >= elementsof(dd))
151 while (nd >
[all...] |
| /ast/src/lib/libvcodex/Vchuff/ |
| H A D | vchtrie.c | 58 Node_t nd; local
117 if(bldtrie(trie,clen,bits,&nd,len,sort+k,m-k,lev+1) < 0 )
125 node[s] = nd.node; /* base of next level table */
126 size[s] = nd.size; /* #bits needed to index it */
|
| /ast/src/cmd/3d/ |
| H A D | fs.c | 72 int nd; local
79 if (!(np = getmount(MNTNAM, NiL)) || (nd = fsfd(np->fs)) < 0)
81 else if (!(np->fs->flags & FS_LOCK) && WRITE(nd, MNTFD, sizeof(MNTFD) - 1) == sizeof(MNTFD) - 1)
84 if (!cssend(&cs, nd, &fd, 1) && (n = READ(nd, buf, sizeof(buf))) > 1)
|
| /ast/src/cmd/codexlib/zip/ |
| H A D | deflate.c | 435 ulg nd; /* number of distance codes */ local
456 nd = 1 + GETBITS(5); /* number of distance codes */
462 if (nl > 288 || nd > 32)
464 if (nl > 286 || nd > 30)
497 n = nl + nd;
570 i = huff(ll + nl, nd, 0, cpdist, cpdext, &td, &bd, state->vm);
|
| /ast/src/lib/libvcodex/ |
| H A D | vcsfxsort.c | 367 Grnode_t *hd, *tl, *nd; local
402 for(nd = (Grnode_t*)dtfirst(gr->nodes); nd; nd = (Grnode_t*)dtnext(gr->nodes,nd))
403 { if(!nd->iedge) /* no incoming edge, hence a root */
405 (hd = tl = nd)->link = NIL(Grnode_t*);
406 else (tl = tl->link = nd)->link = NIL(Grnode_t*);
409 for(nd = hd; nd; n
486 Grnode_t *tl, *hd, *nd; local
[all...] |
| /ast/src/cmd/ksh93/sh/ |
| H A D | nvtype.c | 854 int i,j,k,m,n,nd=0,nref=0,iref=0,inherit=0; local
879 nd++;
913 nd = dp->ndisc;
932 if(nd)
933 nd++;
935 pp = newof(NiL, Namtype_t, 1, nnodes*NV_MINSZ + offset + size + (nnodes+nd)*sizeof(char*) + iref*sizeof(struct Namref)+k);
952 help = &pp->names[nd];
954 cp = (char*)&pp->names[nd+nnodes];
956 mnodes = newof(NiL, Namval_t*, nd+1, 0);
957 nd
[all...] |
| /ast/src/cmd/std/ |
| H A D | ps.c | 1469 Dtdisc_t nd; local
1493 memset(&nd, 0, sizeof(nd));
1494 nd.key = offsetof(Ps_t, pid);
1495 nd.size = sizeof(Pss_id_t);
1496 nd.link = offsetof(Ps_t, hashed);
1527 if (!(state.keys = dtopen(&kd, Dtset)) || !(state.bypid = dtopen(&nd, Dtset)) || !(state.byorder = dtopen(&sd, Dtset)))
|