Searched refs:cnext (Results 1 – 8 of 8) sorted by relevance
191 for ( tailp = cycleheadp ; tailp -> cnext ; tailp = tailp -> cnext ) { in dfn_findcycle()223 tailp -> cnext = childp; in dfn_findcycle()234 for ( tailp = childp ; tailp->cnext ; tailp = tailp->cnext ) { in dfn_findcycle()235 tailp -> cnext -> cyclehead = cycleheadp; in dfn_findcycle()239 printname( tailp -> cnext ); in dfn_findcycle()294 for ( memberp = parentp ; memberp ; memberp = memberp -> cnext ) { in dfn_post_visit()
139 parentp -> cnext = 0; in doarcs()186 parentp -> cnext = 0; in doarcs()364 if ( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) { in cyclelink()382 if ( !( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) ) { in cyclelink()401 cyclenlp -> cnext = nlp; /* pointer to next member of cycle */ in cyclelink()414 for ( memberp = nlp ; memberp ; memberp = memberp -> cnext ) { in cyclelink()462 for (nlp = cyclenl[ cycleno ] . cnext; nlp; nlp = nlp -> cnext) { in cycleanalyze()487 for ( nlp = cyclenl[ cycleno ] . cnext ; nlp ; nlp = nlp -> cnext ) { in cycleanalyze()763 for ( childp = cyclenlp -> cnext ; childp ; childp = childp -> cnext ) { in cycletime()921 for ( memp = headp -> cnext ; memp ; memp = memp -> cnext ) { in inheritflags()[all …]
484 for ( memberp = cyclep -> cnext ; memberp ; memberp = memberp -> cnext ) { in printmembers()511 todo = cyclep -> cnext; in sortmembers()512 cyclep -> cnext = 0; in sortmembers()514 todo = doing -> cnext; in sortmembers()515 for (prev = cyclep; prev -> cnext; prev = prev -> cnext) in sortmembers()516 if (membercmp(doing, prev->cnext ) == GREATERTHAN) in sortmembers()518 doing -> cnext = prev -> cnext; in sortmembers()519 prev -> cnext = doing; in sortmembers()
118 struct nl *cnext; /* pointer to next member of cycle */ member
190 temp = cp->cnext; /* avoids freeing then using */ in freesymtab()210 for (p = tp->tab[h]; p != NULL; prev = p, p = p->cnext) in freeelem()213 tp->tab[h] = p->cnext; in freeelem()215 prev->cnext = p->cnext; in freeelem()248 p->cnext = tp->tab[h]; in setsymtab()275 op = cp->cnext; in rehash()277 cp->cnext = np[nh]; in rehash()292 for (p = tp->tab[h]; p != NULL; p = p->cnext) in lookup()
107 struct Cell *cnext; /* ptr to next if chained */ member
932 a->cnext = tmps; in tfree()945 tmps[i-1].cnext = &tmps[i]; in gettemp()946 tmps[i-1].cnext = NULL; in gettemp()949 tmps = x->cnext; in gettemp()1962 ncp = cp->cnext; in instat()
121 bsect(int b, int rpos, int cpos, int cnext) in bsect() argument169 move(rpos + cnext, cpos - bct); in bsect()