Lines Matching refs:child
60 * Is CHILD already numbered?
63 is_numbered (Sym *child)
65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
70 * Is CHILD already busy?
73 is_busy (Sym *child)
75 if (child->cg.top_order == DFN_NAN)
84 * CHILD is part of a cycle. Find the top caller into this cycle
90 find_cycle (Sym *child)
100 if (child == head)
104 if (child->cg.cyc.head != child && child->cg.cyc.head == head)
141 print_name (child);
174 child = dfn_stack[cycle_index].sym;
175 if (child->cg.cyc.head == child)
181 tail->cg.cyc.next = child;
182 child->cg.cyc.head = head;
184 print_name (child);
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next)
198 else if (child->cg.cyc.head != head /* firewall */ )
300 cg_dfn (arc->child);
