Lines Matching defs:stack
32 #include <stack>
73 using std::stack;
257 /// Convenience typedef for a stack containing the scopes up to the
260 typedef stack<scope_decl*> scope_stack_type;
1538 /// A class that implements a stack of @ref expr_result, to be used in
1614 expr_result_stack_type stack;
1623 stack.push_front(expr_result(true));
1629 stack.clear();
1630 stack.push_front(expr_result(true));
1656 expr_result r = stack.front();
1657 stack.pop_front();
1663 {stack.push_front(v);}
5409 /// This encapsulates the stack of aggregates being compared at any
5424 // The stack of types that are being compared. The top of the
5425 // stack is the back of the vector.
5438 /// Add a pair of types being compared to the stack of aggregates
5449 /// Erase a pair of types being compared from the stack of
5454 /// @return true iff @p was found and erased from the stack.
5475 /// Test if a pair of type DIEs is part of the stack of type DIEs
5480 /// @return true iff @p was found in the stack of types being
5495 /// words, the pair T appears in the comparison stack BEFORE the
5499 /// appear in the comparison stack AFTER a given comparison pair.
7613 /// value onto the DEVM stack, false otherwise.
7777 /// non-constant value onto the DEVM stack, false otherwise.
7883 /// manipulation of the stack of the DWARF Expression Virtual Machine
7903 /// DEVM stack, false otherwise.
7917 v = ctxt.stack.front();
7922 v = ctxt.stack.front();
7927 ABG_ASSERT(ctxt.stack.size() > 1);
7928 v = ctxt.stack[1];
7939 ABG_ASSERT(ctxt.stack.size() > 1);
7940 v = ctxt.stack[1];
7941 ctxt.stack.erase(ctxt.stack.begin() + 1);
7946 ABG_ASSERT(ctxt.stack.size() > 2);
7947 v = ctxt.stack[2];
7948 ctxt.stack.erase(ctxt.stack.begin() + 2);
7954 ABG_ASSERT(ctxt.stack.size() > 0);
7962 ABG_ASSERT(ctxt.stack.size() > 1);
7976 ABG_ASSERT(ctxt.stack.size() > 0);
8049 ABG_ASSERT(ctxt.stack.size() > 1);
8132 if (ctxt.stack.front().is_const())
8133 ctxt.accum = ctxt.stack.front();
8224 if (ctxt.stack.front().is_const())
8225 ctxt.accum = ctxt.stack.front();
10380 /// @param comparison_stack the stack of pair of type DIEs being
10433 // more than once in the comparison stack, so if we were to
10519 //iff {l,r} is on the top of the stack. If it's not, then it means
10521 //and thus hasn't been pushed to the stack yet gain.