Lines Matching refs:parent
209 * Prepare for visiting the children of PARENT. Push a parent onto
213 pre_visit (Sym *parent)
224 dfn_stack[dfn_depth].sym = parent;
226 parent->cg.top_order = DFN_BUSY;
228 print_name (parent);
234 * Done with visiting node PARENT. Pop PARENT off dfn_stack
235 * and number functions if PARENT is head of a cycle.
238 post_visit (Sym *parent)
243 print_name (parent);
249 if (parent->cg.cyc.head == parent)
252 for (member = parent; member; member = member->cg.cyc.next)
269 * Given this PARENT, depth first number its children.
272 cg_dfn (Sym *parent)
277 print_name (parent);
282 if (is_numbered (parent))
289 if (is_busy (parent))
291 find_cycle (parent);
294 pre_visit (parent);
298 for (arc = parent->cg.children; arc; arc = arc->next_child)
302 post_visit (parent);