Home
last modified time | relevance | path

Searched refs:__q (Results 1 – 25 of 74) sorted by relevance

123

/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Dvalarray_array.tcc70 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; in __valarray_copy() local
71 ++__q, ++__ok, ++__p) in __valarray_copy()
78 *__q = *__p; in __valarray_copy()
93 _Tp* __q (__b._M_data); in __valarray_copy() local
96 ++__p, ++__ok, ++__q) in __valarray_copy()
101 ++__q; in __valarray_copy()
103 *__q = *__p; in __valarray_copy()
118 _Tp* __q (__b._M_data); in __valarray_copy() local
122 ++__srcok, ++__p, ++__dstok, ++__q, ++__i) in __valarray_copy()
132 ++__q; in __valarray_copy()
[all …]
H A Dforward_list.tcc440 _Node* __q = __p; in sort() local
445 __q = static_cast<_Node*>(__q->_M_next); in sort()
446 if (!__q) in sort()
454 while (__psize > 0 || (__qsize > 0 && __q)) in sort()
461 __e = __q; in sort()
462 __q = static_cast<_Node*>(__q->_M_next); in sort()
465 else if (__qsize == 0 || !__q) in sort()
472 else if (!__comp(*__q->_M_valptr(), *__p->_M_valptr())) in sort()
482 __e = __q; in sort()
483 __q = static_cast<_Node*>(__q->_M_next); in sort()
[all …]
H A Dvalarray_array.h525 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \ in _GLIBCXX_VISIBILITY()
526 *__p _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
544 _Tp* __q(__b._M_data); \ in _GLIBCXX_VISIBILITY()
546 __p += __s, ++__q) \ in _GLIBCXX_VISIBILITY()
547 *__p _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
555 _Tp* __q(__b._M_data); \ in _GLIBCXX_VISIBILITY()
557 ++__p, __q += __s) \ in _GLIBCXX_VISIBILITY()
558 *__p _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
576 _Tp* __q(__b._M_data); \ in _GLIBCXX_VISIBILITY()
578 ++__j, ++__q) \ in _GLIBCXX_VISIBILITY()
[all …]
H A Dlocale_classes.tcc194 const _CharT* __q = __two.c_str(); in do_compare() local
202 const int __res = _M_compare(__p, __q); in do_compare()
207 __q += char_traits<_CharT>::length(__q); in do_compare()
208 if (__p == __pend && __q == __qend) in do_compare()
212 else if (__q == __qend) in do_compare()
216 __q++; in do_compare()
H A Dstl_queue.h191 queue(const queue& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
192 : c(__q.c, __a) { } in _GLIBCXX_VISIBILITY()
195 queue(queue&& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
196 : c(std::move(__q.c), __a) { } in _GLIBCXX_VISIBILITY()
326 swap(queue& __q) in _GLIBCXX_VISIBILITY()
334 swap(c, __q.c); in _GLIBCXX_VISIBILITY()
592 priority_queue(const priority_queue& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
593 : c(__q.c, __a), comp(__q.comp) { } in _GLIBCXX_VISIBILITY()
596 priority_queue(priority_queue&& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
597 : c(std::move(__q.c), __a), comp(std::move(__q.comp)) { } in _GLIBCXX_VISIBILITY()
H A Dvector.tcc843 _Bit_pointer __q = this->_M_allocate(__n); in _M_reallocate() local
844 iterator __start(std::__addressof(*__q), 0); in _M_reallocate()
849 this->_M_impl._M_end_of_storage = __q + _S_nword(__n); in _M_reallocate()
871 _Bit_pointer __q = this->_M_allocate(__len); in _M_fill_insert() local
872 iterator __start(std::__addressof(*__q), 0); in _M_fill_insert()
878 this->_M_impl._M_end_of_storage = __q + _S_nword(__len); in _M_fill_insert()
907 _Bit_pointer __q = this->_M_allocate(__len); in _M_insert_range() local
908 iterator __start(std::__addressof(*__q), 0); in _M_insert_range()
913 this->_M_impl._M_end_of_storage = __q + _S_nword(__len); in _M_insert_range()
937 _Bit_pointer __q = this->_M_allocate(__len); in _M_insert_aux() local
[all …]
H A Dstl_stack.h197 stack(const stack& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
198 : c(__q.c, __a) { } in _GLIBCXX_VISIBILITY()
201 stack(stack&& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
202 : c(std::move(__q.c), __a) { } in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Dvalarray_array.tcc70 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; in __valarray_copy() local
71 ++__q, ++__ok, ++__p) in __valarray_copy()
78 *__q = *__p; in __valarray_copy()
93 _Tp* __q (__b._M_data); in __valarray_copy() local
96 ++__p, ++__ok, ++__q) in __valarray_copy()
101 ++__q; in __valarray_copy()
103 *__q = *__p; in __valarray_copy()
118 _Tp* __q (__b._M_data); in __valarray_copy() local
122 ++__srcok, ++__p, ++__dstok, ++__q, ++__i) in __valarray_copy()
132 ++__q; in __valarray_copy()
[all …]
H A Dforward_list.tcc445 _Node* __q = __p; in sort() local
450 __q = static_cast<_Node*>(__q->_M_next); in sort()
451 if (!__q) in sort()
459 while (__psize > 0 || (__qsize > 0 && __q)) in sort()
466 __e = __q; in sort()
467 __q = static_cast<_Node*>(__q->_M_next); in sort()
470 else if (__qsize == 0 || !__q) in sort()
477 else if (!__comp(*__q->_M_valptr(), *__p->_M_valptr())) in sort()
487 __e = __q; in sort()
488 __q = static_cast<_Node*>(__q->_M_next); in sort()
[all …]
H A Dvalarray_array.h525 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \ in _GLIBCXX_VISIBILITY()
526 *__p _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
544 _Tp* __q(__b._M_data); \ in _GLIBCXX_VISIBILITY()
546 __p += __s, ++__q) \ in _GLIBCXX_VISIBILITY()
547 *__p _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
555 _Tp* __q(__b._M_data); \ in _GLIBCXX_VISIBILITY()
557 ++__p, __q += __s) \ in _GLIBCXX_VISIBILITY()
558 *__p _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
576 _Tp* __q(__b._M_data); \ in _GLIBCXX_VISIBILITY()
578 ++__j, ++__q) \ in _GLIBCXX_VISIBILITY()
[all …]
H A Dlocale_classes.tcc171 const _CharT* __q = __two.c_str(); in do_compare() local
179 const int __res = _M_compare(__p, __q); in do_compare()
184 __q += char_traits<_CharT>::length(__q); in do_compare()
185 if (__p == __pend && __q == __qend) in do_compare()
189 else if (__q == __qend) in do_compare()
193 __q++; in do_compare()
H A Dstl_queue.h191 queue(const queue& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
192 : c(__q.c, __a) { } in _GLIBCXX_VISIBILITY()
195 queue(queue&& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
196 : c(std::move(__q.c), __a) { } in _GLIBCXX_VISIBILITY()
306 swap(queue& __q) in _GLIBCXX_VISIBILITY()
314 swap(c, __q.c); in _GLIBCXX_VISIBILITY()
550 priority_queue(const priority_queue& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
551 : c(__q.c, __a), comp(__q.comp) { } in _GLIBCXX_VISIBILITY()
554 priority_queue(priority_queue&& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
555 : c(std::move(__q.c), __a), comp(std::move(__q.comp)) { } in _GLIBCXX_VISIBILITY()
H A Dvector.tcc813 _Bit_pointer __q = this->_M_allocate(__n); in _M_reallocate() local
814 iterator __start(std::__addressof(*__q), 0); in _M_reallocate()
819 this->_M_impl._M_end_of_storage = __q + _S_nword(__n); in _M_reallocate()
840 _Bit_pointer __q = this->_M_allocate(__len); in _M_fill_insert() local
841 iterator __start(std::__addressof(*__q), 0); in _M_fill_insert()
847 this->_M_impl._M_end_of_storage = __q + _S_nword(__len); in _M_fill_insert()
875 _Bit_pointer __q = this->_M_allocate(__len); in _M_insert_range() local
876 iterator __start(std::__addressof(*__q), 0); in _M_insert_range()
881 this->_M_impl._M_end_of_storage = __q + _S_nword(__len); in _M_insert_range()
904 _Bit_pointer __q = this->_M_allocate(__len); in _M_insert_aux() local
[all …]
H A Dstl_stack.h187 stack(const stack& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
188 : c(__q.c, __a) { } in _GLIBCXX_VISIBILITY()
191 stack(stack&& __q, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
192 : c(std::move(__q.c), __a) { } in _GLIBCXX_VISIBILITY()
/netbsd-src/external/lgpl3/gmp/dist/mpz/
H A Doddfac_1.c142 mp_limb_t __q, __prime; \
146 __q = (N); \
148 __q /= __prime; \
149 __exp += __q & 1; \
150 } while (__q >= __prime); \
152 for (__q = __prime; --__exp; __q *= __prime); \
153 FACTOR_LIST_STORE(__q, PR, MAX_PR, VEC, I); \
159 mp_limb_t __q, __prime; \
162 __q = (N); \
164 __q /= __prime; \
[all …]
/netbsd-src/external/apache2/llvm/dist/libcxx/include/
H A Dqueue227 queue(const queue& __q) : c(__q.c) {}
230 queue& operator=(const queue& __q) {c = __q.c; return *this;}
234 queue(queue&& __q)
236 : c(_VSTD::move(__q.c)) {}
239 queue& operator=(queue&& __q)
241 {c = _VSTD::move(__q.c); return *this;}
257 queue(const queue& __q, const _Alloc& __a,
259 : c(__q.c, __a) {}
273 queue(queue&& __q, const _Alloc& __a,
275 : c(_VSTD::move(__q.c), __a) {}
[all …]
H A Dstack132 stack(const stack& __q) : c(__q.c) {}
135 stack& operator=(const stack& __q) {c = __q.c; return *this;}
140 stack(stack&& __q)
142 : c(_VSTD::move(__q.c)) {}
145 stack& operator=(stack&& __q)
147 {c = _VSTD::move(__q.c); return *this;}
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
H A Dbessel_function.tcc241 _Tp __q = _Tp(1) / (__e * __numeric_constants<_Tp>::__pi() * __gammi); in __bessel_jn() local
248 _Tp __sum = __ff + __r * __q; in __bessel_jn()
252 __ff = (__i * __ff + __p + __q) / (__i * __i - __mu2); in __bessel_jn()
255 __q /= _Tp(__i) + __mu; in __bessel_jn()
256 const _Tp __del = __c * (__ff + __r * __q); in __bessel_jn()
274 _Tp __q = _Tp(1); in __bessel_jn() local
278 _Tp __fact = __a * __xi / (__p * __p + __q * __q); in __bessel_jn()
279 _Tp __cr = __br + __q * __fact; in __bessel_jn()
286 _Tp __temp = __p * __dlr - __q * __dli; in __bessel_jn()
287 __q = __p * __dli + __q * __dlr; in __bessel_jn()
[all …]
H A Dmodified_bessel_func.tcc173 _Tp __q = _Tp(1) / (_Tp(2) * __e * __gammi); in __bessel_ik() local
180 __ff = (__i * __ff + __p + __q) / (__i * __i - __mu2); in __bessel_ik()
183 __q /= __i + __mu; in __bessel_ik()
206 _Tp __q = __c = __a1; in __bessel_ik() local
208 _Tp __s = _Tp(1) + __q * __delh; in __bessel_ik()
217 __q += __c * __qnew; in __bessel_ik()
222 const _Tp __dels = __q * __delh; in __bessel_ik()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/
H A Dbessel_function.tcc241 _Tp __q = _Tp(1) / (__e * __numeric_constants<_Tp>::__pi() * __gammi); in __bessel_jn() local
248 _Tp __sum = __ff + __r * __q; in __bessel_jn()
252 __ff = (__i * __ff + __p + __q) / (__i * __i - __mu2); in __bessel_jn()
255 __q /= _Tp(__i) + __mu; in __bessel_jn()
256 const _Tp __del = __c * (__ff + __r * __q); in __bessel_jn()
274 _Tp __q = _Tp(1); in __bessel_jn() local
278 _Tp __fact = __a * __xi / (__p * __p + __q * __q); in __bessel_jn()
279 _Tp __cr = __br + __q * __fact; in __bessel_jn()
286 _Tp __temp = __p * __dlr - __q * __dli; in __bessel_jn()
287 __q = __p * __dli + __q * __dlr; in __bessel_jn()
[all …]
H A Dmodified_bessel_func.tcc173 _Tp __q = _Tp(1) / (_Tp(2) * __e * __gammi); in __bessel_ik() local
180 __ff = (__i * __ff + __p + __q) / (__i * __i - __mu2); in __bessel_ik()
183 __q /= __i + __mu; in __bessel_ik()
206 _Tp __q = __c = __a1; in __bessel_ik() local
208 _Tp __s = _Tp(1) + __q * __delh; in __bessel_ik()
217 __q += __c * __qnew; in __bessel_ik()
222 const _Tp __dels = __q * __delh; in __bessel_ik()
/netbsd-src/external/lgpl3/gmp/dist/mpn/generic/
H A Dget_str.c126 mp_limb_t __q = (n) / (d); \
128 (q) = __q; \
134 mp_limb_t __q = (n) / (d); \
135 mp_limb_t __r = (n) - __q*(d); \
136 (q) = __q; \
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
H A Dpool_allocator.h286 _Obj* __q = reinterpret_cast<_Obj*>(__p); in _GLIBCXX_VISIBILITY() local
289 __q ->_M_free_list_link = *__free_list; in _GLIBCXX_VISIBILITY()
290 *__free_list = __q; in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
H A Dpool_allocator.h286 _Obj* __q = reinterpret_cast<_Obj*>(__p); in _GLIBCXX_VISIBILITY() local
289 __q ->_M_free_list_link = *__free_list; in _GLIBCXX_VISIBILITY()
290 *__free_list = __q; in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/c_global/
H A Dcstdlib214 { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }

123