Searched refs:cnext (Results 1 – 9 of 9) sorted by relevance
25 struct BKT *cnext; /* next free/lru bucket */ member39 struct BKT *cnext; /* next free/lru bucket */ member86 (bp)->cprev->cnext = (bp)->cnext; \87 (bp)->cnext->cprev = (bp)->cprev; \90 (bp)->cnext = (dp)->cnext; \92 (dp)->cnext->cprev = (bp); \93 (dp)->cnext = (bp); \
175 for ( tailp = cycleheadp ; tailp -> cnext ; tailp = tailp -> cnext ) {207 tailp -> cnext = childp;218 for ( tailp = childp ; tailp->cnext ; tailp = tailp->cnext ) {219 tailp -> cnext -> cyclehead = cycleheadp;223 printname( tailp -> cnext );281 for ( memberp = parentp ; memberp ; memberp = memberp -> cnext ) {
463 for ( memberp = cyclep -> cnext ; memberp ; memberp = memberp -> cnext ) {492 todo = cyclep -> cnext;493 cyclep -> cnext = 0;494 for ( (doing = todo)&&(todo = doing -> cnext);496 (doing = todo )&&(todo = doing -> cnext )){497 for ( prev = cyclep ; prev -> cnext ; prev = prev -> cnext ) {498 if ( membercmp( doing , prev -> cnext ) == GREATERTHAN ) {502 doing -> cnext = prev -> cnext;503 prev -> cnext = doing;
115 parentp -> cnext = 0; in doarcs()162 parentp -> cnext = 0; in doarcs()341 if ( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) { in cyclelink()361 if ( !( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) ) { in cyclelink()380 cyclenlp -> cnext = nlp; /* pointer to next member of cycle */ in cyclelink()401 for ( memberp = nlp ; memberp ; memberp = memberp -> cnext ) { in cyclelink()440 for (nlp = cyclenl[ cycleno ] . cnext; nlp; nlp = nlp -> cnext) { in cycleanalyze()465 for ( nlp = cyclenl[ cycleno ] . cnext ; nlp ; nlp = nlp -> cnext ) { in cycleanalyze()740 for ( childp = cyclenlp -> cnext ; childp ; childp = childp -> cnext ) { in cycletime()897 for ( memp = headp -> cnext ; memp ; memp = memp -> cnext ) {[all …]
117 struct nl *cnext; /* pointer to next member of cycle */ member
172 temp = cp->cnext; /* avoids freeing then using */ in freesymtab()188 for (p = tp->tab[h]; p != NULL; prev = p, p = p->cnext) in freeelem()191 tp->tab[h] = p->cnext; in freeelem()193 prev->cnext = p->cnext; in freeelem()224 p->cnext = tp->tab[h]; in setsymtab()251 op = cp->cnext; in rehash()253 cp->cnext = np[nh]; in rehash()268 for (p = tp->tab[h]; p != NULL; prev = p, p = p->cnext) in lookup()
591 a->cnext = tmps; in tfree()604 tmps[i-1].cnext = &tmps[i]; in gettemp()605 tmps[i-1].cnext = 0; in gettemp()608 tmps = x->cnext; in gettemp()1280 ncp = cp->cnext; in instat()
68 mp->free.cnext = mp->free.cprev = (BKT *)&mp->free;69 mp->lru.cnext = mp->lru.cprev = (BKT *)&mp->lru;72 mp->hashtable[entry].cnext = mp->hashtable[entry].cprev =248 for (b = mp->lru.cnext; b != (BKT *)&mp->lru; b = b->cnext) {463 for (b = mp->lru.cnext; b != (BKT *)&mp->lru; b = b->cnext) {
165 bsect (b,rpos,cpos,cnext) in bsect() argument169 int cnext; /* direction of position */220 curmove (curr+cnext,curc-bct); /* reposition cursor */