Searched refs:cnext (Results 1 – 9 of 9) 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()297 for ( memberp = parentp ; memberp ; memberp = memberp -> cnext ) { in dfn_post_visit()
141 parentp -> cnext = 0; in doarcs()185 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()485 for ( nlp = cyclenl[ cycleno ] . cnext ; nlp ; nlp = nlp -> cnext ) { in cycleanalyze()762 for ( childp = cyclenlp -> cnext ; childp ; childp = childp -> cnext ) { in cycletime()920 for ( memp = headp -> cnext ; memp ; memp = memp -> cnext ) { in inheritflags()[all …]
513 for ( memberp = cyclep -> cnext ; memberp ; memberp = memberp -> cnext ) { in printmembers()542 todo = cyclep -> cnext; in sortmembers()543 cyclep -> cnext = 0; in sortmembers()544 for ( (doing = todo)&&(todo = doing -> cnext); in sortmembers()546 (doing = todo )&&(todo = doing -> cnext )){ in sortmembers()547 for ( prev = cyclep ; prev -> cnext ; prev = prev -> cnext ) { in sortmembers()548 if ( membercmp( doing , prev -> cnext ) == GREATERTHAN ) { in sortmembers()552 doing -> cnext = prev -> cnext; in sortmembers()553 prev -> cnext = doing; in sortmembers()
131 struct nl *cnext; /* pointer to next member of cycle */ member
187 temp = cp->cnext; /* avoids freeing then using */ in freesymtab()207 for (p = tp->tab[h]; p != NULL; prev = p, p = p->cnext) in freeelem()210 tp->tab[h] = p->cnext; in freeelem()212 prev->cnext = p->cnext; in freeelem()245 p->cnext = tp->tab[h]; in setsymtab()272 op = cp->cnext; in rehash()274 cp->cnext = np[nh]; in rehash()289 for (p = tp->tab[h]; p != NULL; p = p->cnext) in lookup()
105 struct Cell *cnext; /* ptr to next if chained */ member
933 a->cnext = tmps; in tfree()946 tmps[i-1].cnext = &tmps[i]; in gettemp()947 tmps[i-1].cnext = NULL; in gettemp()950 tmps = x->cnext; in gettemp()1960 ncp = cp->cnext; in instat()
42 unsigned char c = l[0], carry = c >> 7, cnext; in make_kn() local45 for (i = 0; i < bl - 1; i++, c = cnext) in make_kn()46 k1[i] = (c << 1) | ((cnext = l[i + 1]) >> 7); in make_kn()
6 CN-EXT iso2022-cnext