HomeSort by: relevance | last modified time | path
    Searched defs:in_stack_memory (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gdb.old/dist/gdb/dwarf2/
expr.h 67 bool in_stack_memory; member in struct:dwarf_expr_piece::__anon189::__anon190
106 : value (value_), in_stack_memory (in_stack_memory_)
115 bool in_stack_memory; member in struct:dwarf_stack_value
126 void push_address (CORE_ADDR value, bool in_stack_memory);
209 void push (struct value *value, bool in_stack_memory);
expr.c 302 p->v.mem.in_stack_memory,
316 p->v.mem.in_stack_memory,
732 dwarf_expr_context::push (struct value *value, bool in_stack_memory)
734 this->m_stack.emplace_back (value, in_stack_memory);
740 dwarf_expr_context::push_address (CORE_ADDR value, bool in_stack_memory)
742 push (value_from_ulongest (address_type (), value), in_stack_memory);
993 bool in_stack_memory = this->fetch_in_stack_memory (0); local
1017 if (in_stack_memory)
1179 /* Retrieve the in_stack_memory flag of the N'th item on the stack. */
1188 return this->m_stack[this->m_stack.size () - (1 + n)].in_stack_memory;
1525 bool in_stack_memory = false; local
    [all...]
  /src/external/gpl3/gdb/dist/gdb/dwarf2/
expr.h 71 bool in_stack_memory; member in struct:dwarf_expr_piece::__anon262::__anon263
110 : value (value_), in_stack_memory (in_stack_memory_)
119 bool in_stack_memory; member in struct:dwarf_stack_value
130 void push_address (CORE_ADDR value, bool in_stack_memory);
213 void push (struct value *value, bool in_stack_memory);
expr.c 321 p->v.mem.in_stack_memory,
335 p->v.mem.in_stack_memory,
750 dwarf_expr_context::push (struct value *value, bool in_stack_memory)
752 this->m_stack.emplace_back (value, in_stack_memory);
758 dwarf_expr_context::push_address (CORE_ADDR value, bool in_stack_memory)
760 push (value_from_ulongest (address_type (), value), in_stack_memory);
1039 bool in_stack_memory = this->fetch_in_stack_memory (0); local
1063 if (in_stack_memory)
1226 /* Retrieve the in_stack_memory flag of the N'th item on the stack. */
1235 return this->m_stack[this->m_stack.size () - (1 + n)].in_stack_memory;
1595 bool in_stack_memory = false; local
    [all...]

Completed in 20 milliseconds