Lines Matching refs:stack
108 // Traversing the dominator tree we keep a stack (implemented as a singly
336 // Allocate the stack.
337 HBoundsCheckEliminationState* stack =
341 stack[0].block_ = entry;
342 stack[0].bb_data_list_ = PreProcessBlock(entry);
343 stack[0].index_ = 0;
346 // Implement depth-first traversal with a stack.
349 HBoundsCheckEliminationState* state = &stack[current];
356 stack[next].block_ = child;
357 stack[next].bb_data_list_ = PreProcessBlock(child);
358 stack[next].index_ = 0;
