Searched refs:top_order (Results 1 – 4 of 4) sorted by relevance
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()226 parent->cg.top_order = DFN_BUSY; in pre_visit()254 member->cg.top_order = dfn_counter; in post_visit()
159 return left->cg.top_order - right->cg.top_order; in cmp_topo()190 if (parent->cg.top_order <= child->cg.top_order) in propagate_time()198 if (parent->cg.top_order <= child->cg.top_order) in propagate_time()312 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */ in cycle_link()621 parent->cg.top_order = DFN_NAN; in cg_assemble()633 if (parent->cg.top_order == DFN_NAN) in cg_assemble()651 printf ("%d:", top_sorted_syms[sym_index]->cg.top_order); in cg_assemble()
80 int top_order; /* Graph call chain top-sort order. */ member
92 DBG (DFNDEBUG, printf ("{%d} ", self->cg.top_order)); in print_name_only()