| /haiku-buildtools/legacy/gcc/libstdc++/std/ |
| H A D | valarray_array.h | 202 for (_Tp* __q=__b._M_data; __q<__b._M_data+__n; ++__p, ++__q) \
203 *__p _Op##= *__q; \
220 _Tp* __q (__b._M_data); \
221 for (_Tp* __p=__a._M_data; __p<__a._M_data+__s*__n; __p+=__s, ++__q) \
222 *__p _Op##= *__q; \
230 _Tp* __q (__b._M_data); \
231 for (_Tp* __p=__a._M_data; __p<__a._M_data+__n; ++__p, __q+=__s) \
232 *__p _Op##= *__q; \
[all...] |
| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| H A D | stl_bvector.h | 415 unsigned int* __q = _M_bit_alloc(__n); local
416 _M_end_of_storage = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
417 _M_start = iterator(__q, 0);
428 unsigned int* __q = _M_bit_alloc(__len); local
429 iterator __i = copy(begin(), __position, iterator(__q, 0));
433 _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
434 _M_start = iterator(__q, 0);
482 unsigned int* __q = _M_bit_alloc(__len); local
483 iterator __i = copy(begin(), __position, iterator(__q, 0));
487 _M_end_of_storage = __q
665 unsigned int* __q = _M_bit_alloc(__n); local
731 unsigned int* __q = _M_bit_alloc(__len); local
752 unsigned int* __q = _M_bit_alloc(__len); local
772 unsigned int* __q = _M_bit_alloc(__len); local
[all...] |
| H A D | stl_rope.h | 1291 static _Cstrptr _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) { argument
1294 (unsigned long)__q);
1297 (unsigned long)__q);
1301 static _Cstrptr _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) { argument
1303 (LPLONG)__p, (LONG)__q);
1310 static _Cstrptr _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) { argument
1313 *__p = __q;
1318 static _Cstrptr _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) { argument
1320 *__p = __q;
2140 void replace(const iterator& __p, const iterator& __q, argument
2143 replace(const iterator& __p, const iterator& __q, _CharT __c) argument
2145 replace(const iterator& __p, const iterator& __q, const _CharT* __c_string) argument
2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument
2151 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument
2154 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument
2157 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument
2179 erase(const iterator& __p, const iterator& __q) argument
[all...] |
| H A D | pthread_alloc | 150 __obj *__q = (__obj *)__p;
164 __q -> __free_list_link = *__my_free_list;
165 *__my_free_list = __q;
|
| H A D | stl_alloc.h | 438 _Obj* __q = (_Obj*)__p; local
451 __q -> _M_free_list_link = *__my_free_list;
452 *__my_free_list = __q;
|
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | valarray_array.h | 541 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \
542 *__p _Op##= *__q; \
560 _Tp* __q(__b._M_data); \
562 __p += __s, ++__q) \
563 *__p _Op##= *__q; \
571 _Tp* __q(__b._M_data); \
573 ++__p, __q += __s) \
574 *__p _Op##= *__q; \
[all...] |
| H A D | stl_queue.h | 249 swap(queue& __q)
250 noexcept(noexcept(swap(c, __q.c)))
253 swap(c, __q.c);
|
| H A D | random.h | 268 * generator engine seeded from the seed sequence @p __q.
270 * @param __q the seed sequence.
276 linear_congruential_engine(_Sseq& __q)
277 { seed(__q); }
291 * sequence using values from the seed sequence @p __q.
293 * @param __q the seed sequence.
297 seed(_Sseq& __q);
500 * engine seeded from the seed sequence @p __q.
502 * @param __q the seed sequence.
508 mersenne_twister_engine(_Sseq& __q)
[all...] |
| H A D | stl_bvector.h | 1076 _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
1078 iterator(__q, 0));
1084 _Bit_pointer __q = this->_M_allocate(__n);
1085 this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
1086 this->_M_impl._M_start = iterator(std::__addressof(*__q), 0);
|
| H A D | locale_facets.h | 2182 const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); local
2183 if (__q)
2185 __ret = __q - __zero;
|
| H A D | boost_concept_check.h | 735 __c.erase(__p, __q);
747 typename _Sequence::iterator __p, __q;
|
| H A D | stl_algo.h | 1367 _RandomAccessIterator __q = __p + __k; local
1370 std::iter_swap(__p, __q);
1372 ++__q;
1390 _RandomAccessIterator __q = __p + __n; local
1391 __p = __q - __k;
1395 --__q;
1396 std::iter_swap(__p, __q);
|
| /haiku-buildtools/gcc/libstdc++-v3/include/ext/ |
| H A D | pool_allocator.h | 268 _Obj* __q = reinterpret_cast<_Obj*>(__p); local
271 __q ->_M_free_list_link = *__free_list;
272 *__free_list = __q;
|
| /haiku-buildtools/gcc/gmp/mpn/generic/ |
| H A D | get_str.c | 117 mp_limb_t __q = (n) / (d); \
119 (q) = __q; \
125 mp_limb_t __q = (n) / (d); \
126 mp_limb_t __r = (n) - __q*(d); \
127 (q) = __q; \
|
| /haiku-buildtools/gcc/gmp/ |
| H A D | longlong.h | 1168 } __x, __q; \
1171 : "=r" (__q.__ll) : "r" (__x.__ll), "r" (d)); \
1172 (r) = (n0) - __q.__l * (d); (q) = __q.__l; })
1557 USItype __q; \
1559 : "=r" (__q) : "r" (n1), "r" (n0), "r" (d)); \
1560 (r) = (n0) - __q * (d); \
1561 (q) = __q; \
1582 USItype __q; \
1584 : "=r" (__q)
[all...] |
| /haiku-buildtools/gcc/mpfr/src/ |
| H A D | mpfr-longlong.h | 1011 } __x, __q; \
1014 : "=r" (__q.__ll) : "r" (__x.__ll), "r" (d)); \
1015 (r) = (n0) - __q.__l * (d); (q) = __q.__l; })
1402 USItype __q; \
1404 : "=r" (__q) : "r" (n1), "r" (n0), "r" (d)); \
1405 (r) = (n0) - __q * (d); \
1406 (q) = __q; \
1427 USItype __q; \
1429 : "=r" (__q)
[all...] |
| /haiku-buildtools/gcc/include/ |
| H A D | longlong.h | 793 USItype __q; \
796 : "=r" (__q) \
799 (r) = (n0) - __q * (d); (q) = __q; })
1181 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1186 : "=&r" ((USItype) (__q)), \
1199 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1201 : "=&r" ((USItype) (__q)), \
1324 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1349 : "=&r" ((USItype) (__q)), \
[all...] |
| /haiku-buildtools/binutils/include/ |
| H A D | longlong.h | 793 USItype __q; \
796 : "=r" (__q) \
799 (r) = (n0) - __q * (d); (q) = __q; })
1209 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1214 : "=&r" ((USItype) (__q)), \
1227 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1229 : "=&r" ((USItype) (__q)), \
1352 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1377 : "=&r" ((USItype) (__q)), \
[all...] |
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | longlong.h | 613 USItype __q; \
616 : "=r" (__q) \
619 (r) = (n0) - __q * (d); (q) = __q; })
|
| /haiku-buildtools/gcc/gcc/config/arm/ |
| H A D | mmintrin.h | 1083 __m64 __q; member in union:__anon395
1094 return __u.__q;
|
| /haiku-buildtools/gcc/gcc/config/aarch64/ |
| H A D | arm_neon.h | 434 #define __aarch64_vdup_lane_any(__size, __q, __a, __b) \
435 vdup##__q##_n_##__size (__aarch64_vget_lane_any (__a, __b))
|