Searched refs:top_order (Results 1 - 12 of 12) sorted by relevance

/netbsd-current/external/gpl3/binutils/dist/gprof/
H A Dcg_dfn.c65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
75 if (child->cg.top_order == DFN_NAN)
226 parent->cg.top_order = DFN_BUSY;
254 member->cg.top_order = dfn_counter;
257 printf ("-> cg.top_order = %d\n", dfn_counter));
H A Dsymtab.h81 int top_order; /* Graph call chain top-sort order. */
80 int top_order; /* Graph call chain top-sort order. */ member in struct:sym::__anon619
H A Dutils.c91 DBG (DFNDEBUG, printf ("{%d} ", self->cg.top_order));
H A Dcg_arcs.c160 return left->cg.top_order - right->cg.top_order;
191 if (parent->cg.top_order <= child->cg.top_order)
199 if (parent->cg.top_order <= child->cg.top_order)
313 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */
622 parent->cg.top_order = DFN_NAN;
638 if (parent->cg.top_order == DFN_NAN)
656 printf ("%d:", top_sorted_syms[sym_index]->cg.top_order);
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gprof/
H A Dcg_dfn.c65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
75 if (child->cg.top_order == DFN_NAN)
226 parent->cg.top_order = DFN_BUSY;
254 member->cg.top_order = dfn_counter;
257 printf ("-> cg.top_order = %d\n", dfn_counter));
H A Dsymtab.h81 int top_order; /* Graph call chain top-sort order. */
80 int top_order; /* Graph call chain top-sort order. */ member in struct:sym::__anon1739
H A Dutils.c89 DBG (DFNDEBUG, printf ("{%d} ", self->cg.top_order));
H A Dcg_arcs.c159 return left->cg.top_order - right->cg.top_order;
190 if (parent->cg.top_order <= child->cg.top_order)
198 if (parent->cg.top_order <= child->cg.top_order)
312 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */
621 parent->cg.top_order = DFN_NAN;
633 if (parent->cg.top_order == DFN_NAN)
651 printf ("%d:", top_sorted_syms[sym_index]->cg.top_order);
[all...]
/netbsd-current/external/gpl3/binutils.old/dist/gprof/
H A Dcg_dfn.c65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
75 if (child->cg.top_order == DFN_NAN)
226 parent->cg.top_order = DFN_BUSY;
254 member->cg.top_order = dfn_counter;
257 printf ("-> cg.top_order = %d\n", dfn_counter));
H A Dsymtab.h81 int top_order; /* Graph call chain top-sort order. */
80 int top_order; /* Graph call chain top-sort order. */ member in struct:sym::__anon633
H A Dutils.c91 DBG (DFNDEBUG, printf ("{%d} ", self->cg.top_order));
H A Dcg_arcs.c159 return left->cg.top_order - right->cg.top_order;
190 if (parent->cg.top_order <= child->cg.top_order)
198 if (parent->cg.top_order <= child->cg.top_order)
312 cyc->cg.top_order = DFN_NAN; /* graph call chain top-sort order */
621 parent->cg.top_order = DFN_NAN;
633 if (parent->cg.top_order == DFN_NAN)
651 printf ("%d:", top_sorted_syms[sym_index]->cg.top_order);
[all...]

Completed in 98 milliseconds