/macosx-10.10/libstdcxx-104.1/src/ |
H A D | bitmap_allocator.cc | 59 iterator __tmp = __lower_bound(__free_list.begin(), __free_list.end(), 62 if (__tmp == __free_list.end() || !_M_should_i_give(**__tmp, __sz)) 96 size_t* __ret = *__tmp; 97 _M_get_free_list().erase(__tmp);
|
H A D | list.cc | 104 _List_node_base* const __tmp = this->_M_prev; local 107 __first->_M_prev = __tmp; 114 _List_node_base* __tmp = this; local 117 std::swap(__tmp->_M_next, __tmp->_M_prev); 118 __tmp = __tmp->_M_prev; // Old next node is now prev. 120 while (__tmp != this);
|
H A D | ctype.cc | 58 const locale::_Impl* __tmp = __loc._M_impl; local 59 return static_cast<const ctype<char>&>(*(__tmp->_M_facets[__i])); 68 const locale::_Impl* __tmp = __loc._M_impl; local 69 return static_cast<const ctype<wchar_t>&>(*(__tmp->_M_facets[__i]));
|
H A D | mt_allocator.cc | 91 _Block_address* __tmp = __bin._M_address->_M_next; local 93 __bin._M_address = __tmp; 221 _Block_address* __tmp = __bin._M_address->_M_next; local 223 __bin._M_address = __tmp; 238 _Block_address* __tmp = __bin._M_address->_M_next; local 240 __bin._M_address = __tmp; 299 _Block_record* __tmp = __first; local 303 __tmp = __tmp->_M_next; 304 __bin._M_first[__thread_id] = __tmp 585 __gthread_mutex_t __tmp = __GTHREAD_MUTEX_INIT; local 777 __gthread_mutex_t __tmp = __GTHREAD_MUTEX_INIT; local [all...] |
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/bits/ |
H A D | stl_raw_storage_iter.h | 102 raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this; local 104 return __tmp;
|
H A D | time_members.h | 66 char* __tmp = new char[__len]; local 67 std::memcpy(__tmp, __s, __len); 68 _M_name_timepunct = __tmp;
|
H A D | stl_list.h | 149 _Self __tmp = *this; local 151 return __tmp; 164 _Self __tmp = *this; local 166 return __tmp; 231 _Self __tmp = *this; local 233 return __tmp; 246 _Self __tmp = *this; local 248 return __tmp; 704 iterator __tmp = end(); local 705 --__tmp; 716 const_iterator __tmp = end(); local 1161 _Node* __tmp = _M_create_node(__x); local [all...] |
H A D | stl_numeric.h | 291 _ValueType __tmp = *__first; local 292 *++__result = __tmp - __value; 293 __value = __tmp; 330 _ValueType __tmp = *__first; local 331 *++__result = __binary_op(__tmp, __value); 332 __value = __tmp;
|
H A D | stl_bvector.h | 213 iterator __tmp = *this; local 215 return __tmp; 228 iterator __tmp = *this; local 230 return __tmp; 250 iterator __tmp = *this; local 251 return __tmp += __i; 257 iterator __tmp = *this; local 258 return __tmp -= __i; 299 const_iterator __tmp = *this; local 301 return __tmp; 314 const_iterator __tmp = *this; local 336 const_iterator __tmp = *this; local 343 const_iterator __tmp = *this; local 698 bool __tmp = __x; local [all...] |
H A D | stl_algobase.h | 98 _Tp __tmp = __a; local 100 __b = __tmp; 115 _ValueType1 __tmp = *__a; local 117 *__b = __tmp; 564 const _Tp __tmp = __value; local 566 *__first = __tmp; 599 const unsigned char __tmp = __c; local 600 std::memset(__first, __tmp, __last - __first); 607 const signed char __tmp = __c; local 608 std::memset(__first, static_cast<unsigned char>(__tmp), __las 615 const char __tmp = __c; local 639 const _Tp __tmp = __value; local [all...] |
H A D | stream_iterator.h | 103 istream_iterator __tmp = *this; local 105 return __tmp;
|
H A D | stl_deque.h | 157 _Self __tmp = *this; local 159 return __tmp; 177 _Self __tmp = *this; local 179 return __tmp; 204 _Self __tmp = *this; local 205 return __tmp += __n; 215 _Self __tmp = *this; local 216 return __tmp -= __n; 1004 iterator __tmp = end(); local 1005 --__tmp; 1016 const_iterator __tmp = end(); local [all...] |
H A D | stl_tree.h | 192 _Self __tmp = *this; local 194 return __tmp; 207 _Self __tmp = *this; local 209 return __tmp; 267 _Self __tmp = *this; local 269 return __tmp; 282 _Self __tmp = *this; local 284 return __tmp; 378 _Link_type __tmp = _M_get_node(); local 380 { get_allocator().construct(&__tmp 392 _Link_type __tmp = _M_create_node(__x->_M_value_field); local [all...] |
H A D | stl_iterator.h | 155 _Iterator __tmp = current; local 156 return *--__tmp; 188 reverse_iterator __tmp = *this; local 190 return __tmp; 213 reverse_iterator __tmp = *this; local 215 return __tmp;
|
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/ext/ |
H A D | concurrence.h | 122 __gthread_mutex_t __tmp = __GTHREAD_MUTEX_INIT; local 123 _M_mutex = __tmp; 169 __gthread_recursive_mutex_t __tmp = __GTHREAD_RECURSIVE_MUTEX_INIT; local 170 _M_mutex = __tmp;
|
H A D | hashtable.h | 658 iterator __tmp = *this; local 660 return __tmp; 686 const_iterator __tmp = *this; local 688 return __tmp; 757 _Node* __tmp = _M_new_node(__obj); 758 __tmp->_M_next = __first; 759 _M_buckets[__n] = __tmp; 761 return pair<iterator, bool>(iterator(__tmp, this), true); 775 _Node* __tmp = _M_new_node(__obj); local 776 __tmp 782 _Node* __tmp = _M_new_node(__obj); local [all...] |
H A D | sso_string_base.h | 462 _CharT* __tmp = _M_create(__new_capacity, __capacity); local 464 _M_data(__tmp); 490 _CharT* __tmp = _M_create(__res, __capacity); local 491 _S_copy(__tmp, _M_data(), _M_length() + 1); 493 _M_data(__tmp);
|
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/backward/ |
H A D | defalloc.h | 70 _Tp* __tmp = (_Tp*)(::operator new((size_t)(__size * sizeof(_Tp)))); local 71 if (__tmp == 0) { 75 return __tmp;
|
/macosx-10.10/BerkeleyDB-21/db/dbinc/ |
H A D | clock.h | 119 db_timespec __tmp; \ 120 DB_TIMEOUT_TO_TIMESPEC(t, &__tmp); \ 121 timespecadd((vvp), &__tmp); \
|
/macosx-10.10/xnu-2782.1.97/bsd/nfs/ |
H A D | xdr_subs.h | 419 uint32_t __tmp; \ 421 __tmp = txdr_unsigned(VAL); \ 422 (E) = xb_add_bytes((XB), (void*)&__tmp, XDRWORD, 0); \ 476 uint32_t __tmp; \ 478 (E) = xb_get_bytes((XB), (char*)&__tmp, XDRWORD, 0); \ 480 (LVAL) = fxdr_unsigned(uint32_t, __tmp); \ 486 uint64_t __tmp; \ 488 (E) = xb_get_bytes((XB), (char*)&__tmp, 2 * XDRWORD, 0); \ 490 fxdr_hyper(&__tmp, &(LVAL)); \
|
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/tr1/ |
H A D | boost_shared_ptr.h | 313 _Sp_counted_base<_Lp>* __tmp = __r._M_pi; local 314 if (__tmp != _M_pi) 316 if (__tmp != 0) 317 __tmp->_M_add_ref_copy(); 320 _M_pi = __tmp; 328 _Sp_counted_base<_Lp>* __tmp = __r._M_pi; local 330 _M_pi = __tmp; 390 _Sp_counted_base<_Lp>* __tmp = __r._M_pi; local 391 if (__tmp != 0) 392 __tmp 402 _Sp_counted_base<_Lp>* __tmp = __r._M_pi; local 414 _Sp_counted_base<_Lp>* __tmp = __r._M_pi; local 593 _Tp1* __tmp = __r.get(); local [all...] |
/macosx-10.10/OpenSSH-189/openssh/openbsd-compat/ |
H A D | sys-tree.h | 191 struct type *__tmp; \ 199 __tmp = SPLAY_RIGHT((head)->sph_root, field); \ 202 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \ 212 struct type __node, *__left, *__right, *__tmp; \ 220 __tmp = SPLAY_LEFT((head)->sph_root, field); \ 221 if (__tmp == NULL) \ 223 if ((cmp)(elm, __tmp) < 0){ \ 224 SPLAY_ROTATE_RIGHT(head, __tmp, field); \ 230 __tmp = SPLAY_RIGHT((head)->sph_root, field); \ 231 if (__tmp [all...] |
/macosx-10.10/xnu-2782.1.97/libkern/libkern/ |
H A D | tree.h | 213 struct type *__tmp; \ 221 __tmp = SPLAY_RIGHT((head)->sph_root, field); \ 224 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \ 234 struct type __node, *__left, *__right, *__tmp; \ 242 __tmp = SPLAY_LEFT((head)->sph_root, field); \ 243 if (__tmp == NULL) \ 245 if ((cmp)(elm, __tmp) < 0){ \ 246 SPLAY_ROTATE_RIGHT(head, __tmp, field); \ 252 __tmp = SPLAY_RIGHT((head)->sph_root, field); \ 253 if (__tmp [all...] |
/macosx-10.10/llvmCore-3425.0.34/include/llvm/ADT/ |
H A D | STLExtras.h | 107 _Self operator++(int) { _Self __tmp = *this; ++current; return __tmp; } local 108 _Self operator--(int) { _Self __tmp = *this; --current; return __tmp; } local
|
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/debug/ |
H A D | safe_iterator.h | 224 _Safe_iterator __tmp(*this); 226 return __tmp; 254 _Safe_iterator __tmp(*this); 256 return __tmp; 284 _Safe_iterator __tmp(*this); 285 __tmp += __n; 286 return __tmp; 302 _Safe_iterator __tmp(*this); 303 __tmp -= __n; 304 return __tmp; [all...] |