Searched refs:cnext (Results 1 – 9 of 9) sorted by relevance
199 for ( tailp = cycleheadp ; tailp -> cnext ; tailp = tailp -> cnext ) { in dfn_findcycle()231 tailp -> cnext = childp; in dfn_findcycle()242 for ( tailp = childp ; tailp->cnext ; tailp = tailp->cnext ) { in dfn_findcycle()243 tailp -> cnext -> cyclehead = cycleheadp; in dfn_findcycle()247 printname( tailp -> cnext ); in dfn_findcycle()305 for ( memberp = parentp ; memberp ; memberp = memberp -> cnext ) { in dfn_post_visit()
149 parentp -> cnext = 0; in doarcs()193 parentp -> cnext = 0; in doarcs()372 if ( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) { in cyclelink()390 if ( !( nlp -> cyclehead == nlp && nlp -> cnext != 0 ) ) { in cyclelink()409 cyclenlp -> cnext = nlp; /* pointer to next member of cycle */ in cyclelink()422 for ( memberp = nlp ; memberp ; memberp = memberp -> cnext ) { in cyclelink()430 for ( memberp = nlp ; memberp ; memberp = memberp -> cnext ) { in cyclelink()470 for (nlp = cyclenl[ cycleno ] . cnext; nlp; nlp = nlp -> cnext) { in cycleanalyze()493 for ( nlp = cyclenl[ cycleno ] . cnext ; nlp ; nlp = nlp -> cnext ) { in cycleanalyze()770 for ( childp = cyclenlp -> cnext ; childp ; childp = childp -> cnext ) { in cycletime()[all …]
521 for ( memberp = cyclep -> cnext ; memberp ; memberp = memberp -> cnext ) { in printmembers()550 todo = cyclep -> cnext; in sortmembers()551 cyclep -> cnext = 0; in sortmembers()552 for ( (doing = todo)&&(todo = doing -> cnext); in sortmembers()554 (doing = todo )&&(todo = doing -> cnext )){ in sortmembers()555 for ( prev = cyclep ; prev -> cnext ; prev = prev -> cnext ) { in sortmembers()556 if ( membercmp( doing , prev -> cnext ) == GREATERTHAN ) { in sortmembers()560 doing -> cnext = prev -> cnext; in sortmembers()561 prev -> cnext = doing; in sortmembers()
144 struct nl *cnext; /* pointer to next member of cycle */ member
199 temp = cp->cnext; /* avoids freeing then using */ in freesymtab()219 for (p = tp->tab[h]; p != NULL; prev = p, p = p->cnext) in freeelem()222 tp->tab[h] = p->cnext; in freeelem()224 prev->cnext = p->cnext; in freeelem()257 p->cnext = tp->tab[h]; in setsymtab()284 op = cp->cnext; in rehash()286 cp->cnext = np[nh]; in rehash()301 for (p = tp->tab[h]; p != NULL; p = p->cnext) in lookup()
101 struct Cell *cnext; /* ptr to next if chained */ member
696 a->cnext = tmps; in tfree()709 tmps[i-1].cnext = &tmps[i]; in gettemp()710 tmps[i-1].cnext = NULL; in gettemp()713 tmps = x->cnext; in gettemp()1506 ncp = cp->cnext; in instat()
36 unsigned char c = l[0], carry = c >> 7, cnext; in make_kn() local39 for (i = 0; i < bl - 1; i++, c = cnext) in make_kn()40 k1[i] = (c << 1) | ((cnext = l[i + 1]) >> 7); in make_kn()
7 CN-EXT iso2022-cnext