Searched refs:dfn_stack (Results 1 – 5 of 5) sorted by relevance
53 DFN_Stack *dfn_stack = NULL; variable99 head = dfn_stack[cycle_top].sym; in find_cycle()174 child = dfn_stack[index].sym; in find_cycle()220 dfn_stack = xrealloc (dfn_stack, dfn_maxdepth * sizeof *dfn_stack); in pre_visit()223 dfn_stack[dfn_depth].sym = parent; in pre_visit()224 dfn_stack[dfn_depth].cycle_top = dfn_depth; in pre_visit()
811 (dfn_stack): Define as pointer rather than array.812 (pre_visit): Reallocate dfn_stack as needed.
53 DFN_Stack *dfn_stack = NULL; variable102 head = dfn_stack[cycle_top].sym;177 child = dfn_stack[index].sym;224 dfn_stack = xrealloc (dfn_stack, dfn_maxdepth * sizeof *dfn_stack);227 dfn_stack[dfn_depth].sym = parent;228 dfn_stack[dfn_depth].cycle_top = dfn_depth;
43 dfntype dfn_stack[ DFN_DEPTH ]; variable112 dfn_stack[ dfn_depth ].nlentryp = parentp; in dfn_pre_visit()113 dfn_stack[ dfn_depth ].cycletop = dfn_depth; in dfn_pre_visit()159 cycleheadp = dfn_stack[ cycletop ].nlentryp; in dfn_findcycle()217 childp = dfn_stack[ index ].nlentryp; in dfn_findcycle()