Searched refs:DFN_NAN (Results 1 – 9 of 9) sorted by relevance
53 dfn_counter = DFN_NAN; in dfn_init()131 return ( childp -> toporder != DFN_NAN && childp -> toporder != DFN_BUSY ); in dfn_numbered()141 if ( childp -> toporder == DFN_NAN ) { in dfn_busy()
136 parentp -> toporder = DFN_NAN; in doarcs()151 if ( parentp -> toporder == DFN_NAN ) { in doarcs()183 parentp -> toporder = DFN_NAN; in doarcs()398 cyclenlp -> toporder = DFN_NAN; /* graph call chain top-sort order */ in cyclelink()
155 #define DFN_NAN 0 macro
56 int dfn_counter = DFN_NAN;65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY; in is_numbered()75 if (child->cg.top_order == DFN_NAN) in is_busy()
9 #define DFN_NAN 0 macro
312 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */ in cycle_link()624 parent->cg.top_order = DFN_NAN; in cg_assemble()639 if (parent->cg.top_order == DFN_NAN) in cg_assemble()
56 int dfn_counter = DFN_NAN;66 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;77 if (child->cg.top_order == DFN_NAN)
320 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */ in cycle_link()636 parent->cg.top_order = DFN_NAN; in cg_assemble()651 if (parent->cg.top_order == DFN_NAN) in cg_assemble()