Home
last modified time | relevance | path

Searched refs:__stack (Results 1 – 21 of 21) sorted by relevance

/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/profile/impl/
Dprofiler_node.h58 __stack_t __stack = new __stack_npt(__depth); in __get_stack() local
59 __builtin_memcpy(&(*__stack)[0], &__buffer[0], in __get_stack()
61 return __stack; in __get_stack()
68 __size(__stack_t __stack) in __size() argument
70 if (!__stack) in __size()
73 return __stack->size(); in __size()
78 __write(FILE* __f, __stack_t __stack) in __write() argument
80 if (!__stack) in __write()
84 for (__it = __stack->begin(); __it != __stack->end(); ++__it) in __write()
128 __object_info_base(__stack_t __stack) in __object_info_base() argument
[all …]
Dprofiler_list_to_slist.h46 __list2slist_info(__stack_t __stack) in __list2slist_info() argument
47 : __object_info_base(__stack), _M_rewind(false), _M_operations(0) { } in __list2slist_info()
138 __insert(const __object_t __obj, __stack_t __stack) in __insert() argument
139 { __add_object(__obj, __list2slist_info(__stack)); } in __insert()
Dprofiler_hash_func.h51 __hashfunc_info(__stack_t __stack) in __hashfunc_info() argument
52 : __object_info_base(__stack), _M_longest_chain(0), in __hashfunc_info()
117 __insert(__object_t __obj, __stack_t __stack) in __insert() argument
118 { __add_object(__obj, __hashfunc_info(__stack)); } in __insert()
Dprofiler_container_size.h59 __container_size_info(__stack_t __stack, std::size_t __num) in __container_size_info() argument
60 : __object_info_base(__stack), _M_init(__num), _M_max(__num), in __container_size_info()
175 __insert(const __object_t __obj, __stack_t __stack, std::size_t __num) in __insert() argument
176 { __add_object(__obj, __container_size_info(__stack, __num)); } in __insert()
Dprofiler_trace.h280 const __stack_t& __stack = __info.__stack(); in __retire_object() local
282 = __stack_table.find(__stack); in __retire_object()
290 += (sizeof(__instruction_address_t) * __size(__stack) in __retire_object()
291 + sizeof(__stack) + sizeof(__stack_info)); in __retire_object()
292 __stack_table.insert(make_pair(__stack, in __retire_object()
300 delete __stack; in __retire_object() local
Dprofiler_list_to_vector.h50 __list2vector_info(__stack_t __stack) in __list2vector_info() argument
51 : __object_info_base(__stack), _M_shift_count(0), _M_iterate(0), in __list2vector_info()
173 __insert(__object_t __obj, __stack_t __stack) in __insert() argument
174 { __add_object(__obj, __list2vector_info(__stack)); } in __insert()
Dprofiler_vector_to_list.h48 __vector2list_info(__stack_t __stack) in __vector2list_info() argument
49 : __object_info_base(__stack), _M_shift_count(0), _M_iterate(0), in __vector2list_info()
170 __insert(__object_t __obj, __stack_t __stack) in __insert() argument
171 { __add_object(__obj, __vector2list_info(__stack)); } in __insert()
Dprofiler_map_to_unordered_map.h74 __map2umap_info(__stack_t __stack) in __map2umap_info() argument
75 : __object_info_base(__stack), _M_insert(0), _M_erase(0), _M_find(0), in __map2umap_info()
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/bits/
Dregex_grep_matcher.tcc126 _StateStack __stack; in _M_e_closure() local
127 __stack.push(__i); in _M_e_closure()
128 return this->_M_e_closure(__stack, __s); in _M_e_closure()
135 _StateStack __stack; in _M_e_closure() local
137 __stack.push(*__i); in _M_e_closure()
138 return this->_M_e_closure(__stack, __s); in _M_e_closure()
142 _M_e_closure(_StateStack& __stack, const _StateSet& __s) in _M_e_closure() argument
145 while (!__stack.empty()) in _M_e_closure()
147 _StateIdT __t = __stack.top(); __stack.pop(); in _M_e_closure()
155 __add_visited_state(__state._M_next, __stack, __e); in _M_e_closure()
[all …]
Dregex_grep_matcher.h120 _M_e_closure(_StateStack& __stack, const _StateSet& __s); in _GLIBCXX_VISIBILITY()
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/profile/impl/
Dprofiler_node.h72 __size(__stack_t __stack) in __size() argument
74 if (!__stack) in __size()
77 return __stack->size(); in __size()
82 __write(FILE* __f, __stack_t __stack) in __write() argument
84 if (!__stack) in __write()
88 for (__it = __stack->begin(); __it != __stack->end(); ++__it) in __write()
130 __object_info_base(__stack_t __stack) in __object_info_base() argument
131 : _M_stack(__stack), _M_valid(true) { } in __object_info_base()
146 __stack() const in __stack() function
Dprofiler_trace.h206 __object_info* __add_object(__stack_t __stack);
228 __add_object(__stack_t __stack) in __add_object() argument
231 if (!__stack) in __add_object()
238 delete __stack; in __add_object() local
242 __object_info* __ret = new(std::nothrow) __object_info(__stack); in __add_object()
245 delete __stack; in __add_object() local
264 __stack_t __stack = __info.__stack(); in __retire_object() local
266 = __stack_table.find(__stack); in __retire_object()
274 += (sizeof(__instruction_address_t) * __size(__stack) in __retire_object()
275 + sizeof(__stack) + sizeof(__stack_info)); in __retire_object()
[all …]
Dprofiler_container_size.h46 __container_size_info(__stack_t __stack) in __container_size_info() argument
47 : __object_info_base(__stack), _M_init(0), _M_max(0), in __container_size_info()
167 __insert(__stack_t __stack, std::size_t __num) in __insert() argument
169 __container_size_info* __ret = __add_object(__stack); in __insert()
Dprofiler_list_to_slist.h43 __list2slist_info(__stack_t __stack) in __list2slist_info() argument
44 : __object_info_base(__stack), _M_rewind(false), _M_operations(0) { } in __list2slist_info()
Dprofiler_hash_func.h44 __hashfunc_info(__stack_t __stack) in __hashfunc_info() argument
45 : __object_info_base(__stack), _M_longest_chain(0), in __hashfunc_info()
Dprofiler_vector_to_list.h44 __vector2list_info(__stack_t __stack) in __vector2list_info() argument
45 : __object_info_base(__stack), _M_shift_count(0), _M_iterate(0), in __vector2list_info()
Dprofiler_list_to_vector.h46 __list2vector_info(__stack_t __stack) in __list2vector_info() argument
47 : __object_info_base(__stack), _M_shift_count(0), _M_iterate(0), in __list2vector_info()
Dprofiler_map_to_unordered_map.h70 __map2umap_info(__stack_t __stack) in __map2umap_info() argument
71 : __object_info_base(__stack), _M_insert(0), _M_erase(0), _M_find(0), in __map2umap_info()
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/bits/
Dregex_automaton.tcc198 std::stack<_StateIdT> __stack; in _M_clone() local
199 __stack.push(_M_start); in _M_clone()
200 while (!__stack.empty()) in _M_clone()
202 auto __u = __stack.top(); in _M_clone()
203 __stack.pop(); in _M_clone()
211 __stack.push(__dup._M_alt); in _M_clone()
216 __stack.push(__dup._M_next); in _M_clone()
Dregex_compiler.tcc273 std::stack<_StateIdT> __stack; in _M_quantifier() local
279 __stack.push(__alt); in _M_quantifier()
283 while (!__stack.empty()) in _M_quantifier()
285 auto& __tmp = (*_M_nfa)[__stack.top()]; in _M_quantifier()
286 __stack.pop(); in _M_quantifier()
/dragonfly/contrib/binutils-2.27/ld/
HDld.texinfo3586 PROVIDE (__stack = .);
3588 ASSERT ((__stack > (_end + __stack_size)), "Error: No room left for the stack");
3600 PROVIDE (__stack = .);
3601 ASSERT ((__stack > (_end + __stack_size)), "Error: No room left for the stack");