Searched refs:toporder (Results 1 – 4 of 4) sorted by relevance
114 parentp -> toporder = DFN_BUSY; in dfn_pre_visit()131 return ( childp -> toporder != DFN_NAN && childp -> toporder != DFN_BUSY ); in dfn_numbered()141 if ( childp -> toporder == DFN_NAN ) { in dfn_busy()298 memberp -> toporder = dfn_counter; in dfn_post_visit()
107 return (*npp1) -> toporder - (*npp2) -> toporder; in topcmp()138 parentp -> toporder = DFN_NAN; in doarcs()150 if ( parentp -> toporder == DFN_NAN ) { in doarcs()182 parentp -> toporder = DFN_NAN; in doarcs()208 printf( "%d:" , topsortnlp[ index ] -> toporder ); in doarcs()291 if ( parentp -> toporder <= childp -> toporder ) { in timepropagate()296 if ( parentp -> toporder <= childp -> toporder ) { in timepropagate()398 cyclenlp -> toporder = DFN_NAN; /* graph call chain top-sort order */ in cyclelink()
127 int toporder; /* graph call chain top-sort order */ member
381 printf( "{%d} " , selfp -> toporder ); in printname()