Home
last modified time | relevance | path

Searched refs:__tmp (Results 1 – 25 of 170) sorted by relevance

1234567

/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/bits/
H A Dregex_automaton.h247 _StateT __tmp(_S_opcode_alternative); in _GLIBCXX_VISIBILITY()
250 __tmp._M_next = __next; in _GLIBCXX_VISIBILITY()
251 __tmp._M_alt = __alt; in _GLIBCXX_VISIBILITY()
252 return _M_insert_state(std::move(__tmp)); in _GLIBCXX_VISIBILITY()
258 _StateT __tmp(_S_opcode_repeat); in _GLIBCXX_VISIBILITY()
261 __tmp._M_next = __next; in _GLIBCXX_VISIBILITY()
262 __tmp._M_alt = __alt; in _GLIBCXX_VISIBILITY()
263 __tmp._M_neg = __neg; in _GLIBCXX_VISIBILITY()
264 return _M_insert_state(std::move(__tmp)); in _GLIBCXX_VISIBILITY()
270 _StateT __tmp(_S_opcode_match); in _GLIBCXX_VISIBILITY()
[all …]
H A Dlist.tcc73 _Node* __tmp = static_cast<_Node*>(__cur); in _M_clear() local
74 __cur = __tmp->_M_next; in _M_clear()
75 _Tp* __val = __tmp->_M_valptr(); in _M_clear()
81 _M_put_node(__tmp); in _M_clear()
92 _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...); in emplace() local
93 __tmp->_M_hook(__position._M_const_cast()._M_node); in emplace()
95 return iterator(__tmp); in emplace()
108 _Node* __tmp = _M_create_node(__x); in insert() local
109 __tmp->_M_hook(__position._M_const_cast()._M_node); in insert()
111 return iterator(__tmp); in insert()
[all …]
H A Dforward_list.tcc223 _Node_base* __tmp = const_cast<_Node_base*>(__pos._M_node); in _M_splice_after() local
231 return iterator(__tmp->_M_transfer_after(__b, __end)); in _M_splice_after()
233 return iterator(__tmp); in _M_splice_after()
248 _Node_base* __tmp = const_cast<_Node_base*>(__pos._M_node); in splice_after() local
249 __tmp->_M_transfer_after(const_cast<_Node_base*>(__i._M_node), in splice_after()
260 forward_list __tmp(__n, __val, get_allocator()); in insert_after() local
261 return _M_splice_after(__pos, __tmp.before_begin(), __tmp.end()); in insert_after()
274 forward_list __tmp(__first, __last, get_allocator()); in insert_after() local
275 if (!__tmp.empty()) in insert_after()
276 return _M_splice_after(__pos, __tmp.before_begin(), __tmp.end()); in insert_after()
[all …]
H A Dstl_bvector.h116 bool __tmp = __x; in _GLIBCXX_VISIBILITY() local
118 __y = __tmp; in _GLIBCXX_VISIBILITY()
124 bool __tmp = __x; in _GLIBCXX_VISIBILITY() local
126 __y = __tmp; in _GLIBCXX_VISIBILITY()
132 bool __tmp = __x; in _GLIBCXX_VISIBILITY() local
134 __y = __tmp; in _GLIBCXX_VISIBILITY()
245 iterator __tmp = *this; in _GLIBCXX_VISIBILITY() member
247 return __tmp; in _GLIBCXX_VISIBILITY()
260 iterator __tmp = *this; in _GLIBCXX_VISIBILITY() member
262 return __tmp; in _GLIBCXX_VISIBILITY()
[all …]
H A Duniform_int_dist.h264 __uctype __tmp; // wraparound control in _GLIBCXX_VISIBILITY() local
268 __tmp = (__uerngrange * operator() in _GLIBCXX_VISIBILITY()
270 __ret = __tmp + (__uctype(__urng()) - __urngmin); in _GLIBCXX_VISIBILITY()
272 while (__ret > __urange || __ret < __tmp); in _GLIBCXX_VISIBILITY()
348 __uctype __tmp; // wraparound control in _GLIBCXX_VISIBILITY() local
354 __tmp = (__uerngrange * operator() in _GLIBCXX_VISIBILITY()
356 __ret = __tmp + (__uctype(__urng()) - __urngmin); in _GLIBCXX_VISIBILITY()
358 while (__ret > __urange || __ret < __tmp); in _GLIBCXX_VISIBILITY()
/dflybsd-src/contrib/gcc-4.7/libstdc++-v3/src/c++98/
H A Dctype.cc69 char __tmp[sizeof(_M_narrow)]; in _M_narrow_init() local
71 __tmp[__i] = __i; in _M_narrow_init()
72 do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow); in _M_narrow_init()
75 if (__builtin_memcmp(__tmp, _M_narrow, sizeof(_M_narrow))) in _M_narrow_init()
82 do_narrow(__tmp, __tmp + 1, 1, &__c); in _M_narrow_init()
92 char __tmp[sizeof(_M_widen)]; in _M_widen_init() local
94 __tmp[__i] = __i; in _M_widen_init()
95 do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen); in _M_widen_init()
99 if (__builtin_memcmp(__tmp, _M_widen, sizeof(_M_widen))) in _M_widen_init()
H A Dcompatibility-list-2.cc73 _List_node_base* const __tmp = this->_M_prev; in _M_transfer() local
76 __first->_M_prev = __tmp; in _M_transfer()
83 _List_node_base* __tmp = this; in _M_reverse() local
86 std::swap(__tmp->_M_next, __tmp->_M_prev); in _M_reverse()
89 __tmp = __tmp->_M_prev; in _M_reverse()
91 while (__tmp != this); in _M_reverse()
H A Dlist.cc105 _List_node_base* const __tmp = this->_M_prev; in _M_transfer() local
108 __first->_M_prev = __tmp; in _M_transfer()
115 _List_node_base* __tmp = this; in _M_reverse() local
118 std::swap(__tmp->_M_next, __tmp->_M_prev); in _M_reverse()
121 __tmp = __tmp->_M_prev; in _M_reverse()
123 while (__tmp != this); in _M_reverse()
H A Dcompatibility-list.cc105 _List_node_base* const __tmp = this->_M_prev; in transfer() local
108 __first->_M_prev = __tmp; in transfer()
115 _List_node_base* __tmp = this; in reverse() local
118 std::swap(__tmp->_M_next, __tmp->_M_prev); in reverse()
121 __tmp = __tmp->_M_prev; in reverse()
123 while (__tmp != this); in reverse()
H A Dbitmap_allocator.cc60 iterator __tmp = __lower_bound(__free_list.begin(), __free_list.end(), in _M_get() local
63 if (__tmp == __free_list.end() || !_M_should_i_give(**__tmp, __sz)) in _M_get()
97 size_t* __ret = *__tmp; in _M_get()
98 _M_get_free_list().erase(__tmp); in _M_get()
H A Dmt_allocator.cc101 _Block_address* __tmp = __bin._M_address->_M_next; in _M_destroy() local
103 __bin._M_address = __tmp; in _M_destroy()
231 _Block_address* __tmp = __bin._M_address->_M_next; in _M_destroy() local
233 __bin._M_address = __tmp; in _M_destroy()
248 _Block_address* __tmp = __bin._M_address->_M_next; in _M_destroy() local
250 __bin._M_address = __tmp; in _M_destroy()
309 _Block_record* __tmp = __first; in _M_reclaim_block() local
313 __tmp = __tmp->_M_next; in _M_reclaim_block()
314 __bin._M_first[__thread_id] = __tmp->_M_next; in _M_reclaim_block()
318 __tmp->_M_next = __bin._M_first[0]; in _M_reclaim_block()
[all …]
/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/src/c++11/
H A Dctype.cc68 char __tmp[sizeof(_M_narrow)]; in _M_narrow_init() local
70 __tmp[__i] = __i; in _M_narrow_init()
71 do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow); in _M_narrow_init()
74 if (__builtin_memcmp(__tmp, _M_narrow, sizeof(_M_narrow))) in _M_narrow_init()
81 do_narrow(__tmp, __tmp + 1, 1, &__c); in _M_narrow_init()
91 char __tmp[sizeof(_M_widen)]; in _M_widen_init() local
93 __tmp[__i] = __i; in _M_widen_init()
94 do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen); in _M_widen_init()
98 if (__builtin_memcmp(__tmp, _M_widen, sizeof(_M_widen))) in _M_widen_init()
/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/src/c++98/
H A Dlist-aux-2.cc73 _List_node_base* const __tmp = this->_M_prev; in _M_transfer() local
76 __first->_M_prev = __tmp; in _M_transfer()
83 _List_node_base* __tmp = this; in _M_reverse() local
86 std::swap(__tmp->_M_next, __tmp->_M_prev); in _M_reverse()
89 __tmp = __tmp->_M_prev; in _M_reverse()
91 while (__tmp != this); in _M_reverse()
H A Dlist.cc105 _List_node_base* const __tmp = this->_M_prev; in _M_transfer() local
108 __first->_M_prev = __tmp; in _M_transfer()
115 _List_node_base* __tmp = this; in _M_reverse() local
118 std::swap(__tmp->_M_next, __tmp->_M_prev); in _M_reverse()
121 __tmp = __tmp->_M_prev; in _M_reverse()
123 while (__tmp != this); in _M_reverse()
H A Dlist-aux.cc105 _List_node_base* const __tmp = this->_M_prev; in transfer() local
108 __first->_M_prev = __tmp; in transfer()
115 _List_node_base* __tmp = this; in reverse() local
118 std::swap(__tmp->_M_next, __tmp->_M_prev); in reverse()
121 __tmp = __tmp->_M_prev; in reverse()
123 while (__tmp != this); in reverse()
H A Dbitmap_allocator.cc57 iterator __tmp = __lower_bound(__free_list.begin(), __free_list.end(), in _M_get() local
60 if (__tmp == __free_list.end() || !_M_should_i_give(**__tmp, __sz)) in _M_get()
94 size_t* __ret = *__tmp; in _M_get()
95 _M_get_free_list().erase(__tmp); in _M_get()
H A Dmt_allocator.cc107 _Block_address* __tmp = __bin._M_address->_M_next; in _M_destroy() local
109 __bin._M_address = __tmp; in _M_destroy()
237 _Block_address* __tmp = __bin._M_address->_M_next; in _M_destroy() local
239 __bin._M_address = __tmp; in _M_destroy()
254 _Block_address* __tmp = __bin._M_address->_M_next; in _M_destroy() local
256 __bin._M_address = __tmp; in _M_destroy()
315 _Block_record* __tmp = __first; in _M_reclaim_block() local
319 __tmp = __tmp->_M_next; in _M_reclaim_block()
320 __bin._M_first[__thread_id] = __tmp->_M_next; in _M_reclaim_block()
324 __tmp->_M_next = __bin._M_first[0]; in _M_reclaim_block()
[all …]
/dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/bits/
H A Dlist.tcc73 _Node* __tmp = __cur; in _M_clear() local
76 _M_get_Node_allocator().destroy(__tmp); in _M_clear()
78 _M_get_Tp_allocator().destroy(std::__addressof(__tmp->_M_data)); in _M_clear()
80 _M_put_node(__tmp); in _M_clear()
91 _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...); in emplace() local
92 __tmp->_M_hook(__position._M_node); in emplace()
93 return iterator(__tmp); in emplace()
102 _Node* __tmp = _M_create_node(__x); in insert() local
103 __tmp->_M_hook(__position._M_node); in insert()
104 return iterator(__tmp); in insert()
[all …]
H A Dforward_list.tcc231 _Node_base* __tmp = const_cast<_Node_base*>(__pos._M_node); in _M_splice_after() local
239 return iterator(__tmp->_M_transfer_after(__b, __end)); in _M_splice_after()
241 return iterator(__tmp); in _M_splice_after()
256 _Node_base* __tmp = const_cast<_Node_base*>(__pos._M_node); in splice_after() local
257 __tmp->_M_transfer_after(const_cast<_Node_base*>(__i._M_node), in splice_after()
268 forward_list __tmp(__n, __val, get_allocator()); in insert_after() local
269 return _M_splice_after(__pos, __tmp.before_begin(), __tmp.end()); in insert_after()
282 forward_list __tmp(__first, __last, get_allocator()); in insert_after() local
283 if (!__tmp.empty()) in insert_after()
284 return _M_splice_after(__pos, __tmp.before_begin(), __tmp.end()); in insert_after()
[all …]
H A Dstl_list.h163 _Self __tmp = *this; in _GLIBCXX_VISIBILITY() member
165 return __tmp; in _GLIBCXX_VISIBILITY()
178 _Self __tmp = *this; in _GLIBCXX_VISIBILITY() member
180 return __tmp; in _GLIBCXX_VISIBILITY()
243 _Self __tmp = *this; in _GLIBCXX_VISIBILITY() member
245 return __tmp; in _GLIBCXX_VISIBILITY()
258 _Self __tmp = *this; in _GLIBCXX_VISIBILITY() member
260 return __tmp; in _GLIBCXX_VISIBILITY()
926 iterator __tmp = end(); in _GLIBCXX_VISIBILITY() local
927 --__tmp; in _GLIBCXX_VISIBILITY()
[all …]
/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/config/cpu/i486/opt/bits/
H A Dopt_random.h140 __uctype __tmp; in _GLIBCXX_VISIBILITY() local
146 __tmp = __uctype(__urng()) - __urngmin; in _GLIBCXX_VISIBILITY()
147 while (__tmp >= __past); in _GLIBCXX_VISIBILITY()
148 __v1 = __tmp / __scaling; in _GLIBCXX_VISIBILITY()
151 __tmp = __v1; in _GLIBCXX_VISIBILITY()
156 while (__v1 > __maskval || __v1 < __tmp); in _GLIBCXX_VISIBILITY()
162 __tmp = __uctype(__urng()) - __urngmin; in _GLIBCXX_VISIBILITY()
163 while (__tmp >= __past); in _GLIBCXX_VISIBILITY()
164 __v2 = __tmp / __scaling; in _GLIBCXX_VISIBILITY()
167 __tmp = __v2; in _GLIBCXX_VISIBILITY()
[all …]
/dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/profile/
H A Diterator_tracker.h100 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
102 return __tmp; in _GLIBCXX_VISIBILITY()
117 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
119 return __tmp; in _GLIBCXX_VISIBILITY()
148 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
149 __tmp += __n; in _GLIBCXX_VISIBILITY()
150 return __tmp; in _GLIBCXX_VISIBILITY()
163 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
164 __tmp -= __n; in _GLIBCXX_VISIBILITY()
165 return __tmp; in _GLIBCXX_VISIBILITY()
/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/profile/
H A Diterator_tracker.h100 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
102 return __tmp; in _GLIBCXX_VISIBILITY()
117 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
119 return __tmp; in _GLIBCXX_VISIBILITY()
149 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
150 __tmp += __n; in _GLIBCXX_VISIBILITY()
151 return __tmp; in _GLIBCXX_VISIBILITY()
164 __iterator_tracker __tmp(*this); in _GLIBCXX_VISIBILITY()
165 __tmp -= __n; in _GLIBCXX_VISIBILITY()
166 return __tmp; in _GLIBCXX_VISIBILITY()
/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/backward/
H A Dhashtable.h672 iterator __tmp = *this; in _GLIBCXX_VISIBILITY()
674 return __tmp; in _GLIBCXX_VISIBILITY()
700 const_iterator __tmp = *this; in _GLIBCXX_VISIBILITY()
702 return __tmp; in _GLIBCXX_VISIBILITY()
771 _Node* __tmp = _M_new_node(__obj); in _GLIBCXX_VISIBILITY()
772 __tmp->_M_next = __first; in _GLIBCXX_VISIBILITY()
773 _M_buckets[__n] = __tmp; in _GLIBCXX_VISIBILITY()
775 return pair<iterator, bool>(iterator(__tmp, this), true); in _GLIBCXX_VISIBILITY()
789 _Node* __tmp = _M_new_node(__obj); in _GLIBCXX_VISIBILITY()
790 __tmp->_M_next = __cur->_M_next; in _GLIBCXX_VISIBILITY()
[all …]
/dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/backward/
H A Dhashtable.h673 iterator __tmp = *this; in _GLIBCXX_VISIBILITY()
675 return __tmp; in _GLIBCXX_VISIBILITY()
701 const_iterator __tmp = *this; in _GLIBCXX_VISIBILITY()
703 return __tmp; in _GLIBCXX_VISIBILITY()
772 _Node* __tmp = _M_new_node(__obj); in _GLIBCXX_VISIBILITY()
773 __tmp->_M_next = __first; in _GLIBCXX_VISIBILITY()
774 _M_buckets[__n] = __tmp; in _GLIBCXX_VISIBILITY()
776 return pair<iterator, bool>(iterator(__tmp, this), true); in _GLIBCXX_VISIBILITY()
790 _Node* __tmp = _M_new_node(__obj); in _GLIBCXX_VISIBILITY()
791 __tmp->_M_next = __cur->_M_next; in _GLIBCXX_VISIBILITY()
[all …]

1234567