Home
last modified time | relevance | path

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

123

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/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.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()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/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.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()
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A Dqueue234 queue(const queue& __q) : c(__q.c) {}
237 queue& operator=(const queue& __q) {c = __q.c; return *this;}
241 queue(queue&& __q)
243 : c(_VSTD::move(__q.c)) {}
246 queue& operator=(queue&& __q)
248 {c = _VSTD::move(__q.c); return *this;}
265 queue(const queue& __q, const _Alloc& __a,
268 : c(__q.c, __a) {}
284 queue(queue&& __q, const _Alloc& __a,
287 : c(_VSTD::move(__q.c), __a) {}
[all …]
H A Dstack133 stack(const stack& __q) : c(__q.c) {}
136 stack& operator=(const stack& __q) {c = __q.c; return *this;}
141 stack(stack&& __q)
143 : c(_VSTD::move(__q.c)) {}
146 stack& operator=(stack&& __q)
148 {c = _VSTD::move(__q.c); return *this;}
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A Dqueue234 queue(const queue& __q) : c(__q.c) {}
237 queue& operator=(const queue& __q) {c = __q.c; return *this;}
241 queue(queue&& __q)
243 : c(_VSTD::move(__q.c)) {}
246 queue& operator=(queue&& __q)
248 {c = _VSTD::move(__q.c); return *this;}
265 queue(const queue& __q, const _Alloc& __a,
268 : c(__q.c, __a) {}
284 queue(queue&& __q, const _Alloc& __a,
287 : c(_VSTD::move(__q.c), __a) {}
[all …]
H A Dstack133 stack(const stack& __q) : c(__q.c) {}
136 stack& operator=(const stack& __q) {c = __q.c; return *this;}
141 stack(stack&& __q)
143 : c(_VSTD::move(__q.c)) {}
146 stack& operator=(stack&& __q)
148 {c = _VSTD::move(__q.c); return *this;}
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/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()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/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()
/OK3568_Linux_fs/kernel/drivers/net/ethernet/brocade/bna/
H A Dbfi_reg.h371 #define CPE_Q_NUM(__fn, __q) (((__fn) << 2) + (__q)) argument
372 #define RME_Q_NUM(__fn, __q) (((__fn) << 2) + (__q)) argument
/OK3568_Linux_fs/kernel/drivers/scsi/bfa/
H A Dbfi_reg.h374 #define CPE_Q_NUM(__fn, __q) (((__fn) << 2) + (__q)) argument
375 #define RME_Q_NUM(__fn, __q) (((__fn) << 2) + (__q)) argument
/OK3568_Linux_fs/kernel/arch/sparc/include/asm/
H A Dupa.h107 #define upa_writeq(__q, __addr) (_upa_writeq((__q), (unsigned long)(__addr))) argument

123