Searched refs:toporder (Results 1 – 4 of 4) sorted by relevance
138 parentp->toporder = DFN_BUSY; in dfn_pre_visit()155 return (childp->toporder != DFN_NAN && childp->toporder != DFN_BUSY); in dfn_numbered()164 if (childp->toporder == DFN_NAN) in dfn_busy()338 memberp->toporder = dfn_counter; in dfn_post_visit()
107 return ((*npp1)->toporder - (*npp2)->toporder); in topcmp()139 if (parentp->toporder <= childp->toporder) { in timepropagate()145 if (parentp->toporder <= childp->toporder) { in timepropagate()302 cyclenlp->toporder = DFN_NAN; /* graph call chain */ in cyclelink()600 parentp->toporder = DFN_NAN; in doarcs()625 if (parentp->toporder == DFN_NAN) { in doarcs()655 (void) printf("%d:", topsortnlp[ index ]->toporder); in doarcs()
247 int toporder; /* graph call chain top-sort order */ member
510 (void) printf("{%d} ", selfp->toporder); in printname()