Home
last modified time | relevance | path

Searched refs:__r (Results 1 – 25 of 42) sorted by relevance

12

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_rope.c59 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos) in _Rope_iterator() argument
60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos), in _Rope_iterator()
61 _M_root_rope(__r) { _RopeRep::_S_ref(this->_M_root); } in _Rope_iterator()
64 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos): in _Rope_iterator() argument
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos), in _Rope_iterator()
66 _M_root_rope(&__r) { in _Rope_iterator()
68 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*this); in _Rope_iterator()
71 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*__x); in _Rope_iterator()
378 _RopeLeaf* __r, const _CharT* __iter, size_t __len) { in _S_leaf_concat_char_iter() argument
379 size_t __old_len = __r->_M_size._M_data; in _S_leaf_concat_char_iter()
[all …]
D_auto_ptr.h37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { } in auto_ptr_ref() argument
88 template<class _Tp1> auto_ptr(auto_ptr<_Tp1>& __r) _STLP_NOTHROW { in auto_ptr() argument
89 _Tp* __conversionCheck = __r.release(); in auto_ptr()
93 template<class _Tp1> auto_ptr<_Tp>& operator=(auto_ptr<_Tp1>& __r) _STLP_NOTHROW {
94 _Tp* __conversionCheck = __r.release();
100 auto_ptr(_Self& __r) _STLP_NOTHROW { this->__set(__r.release()); } in auto_ptr() argument
102 _Self& operator=(_Self& __r) _STLP_NOTHROW {
103 reset(__r.release());
109 auto_ptr(auto_ptr_ref<_Tp> __r) _STLP_NOTHROW in auto_ptr() argument
110 { this->__set(__r.release()); } in auto_ptr()
[all …]
D_complex.h123 value_type __r = _M_re * __z._M_re - _M_im * __z._M_im; member
125 _M_re = __r;
131 value_type __r; member
133 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i);
134 _M_re = __r;
153 value_type __r = _M_re * __z._M_re - _M_im * __z._M_im; member
155 _M_re = __r;
161 value_type __r; member
163 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i);
164 _M_re = __r;
[all …]
D_rope.h503 _Rope_RopeConcatenation(_RopeRep* __l, _RopeRep* __r, allocator_type __a)
505 (max)(__l->_M_depth, __r->_M_depth) + 1, false,
506 … __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
664 _Rope_char_ref_proxy(_My_rope* __r, size_t __p) :
665 _M_pos(__p), _M_current_valid(false), _M_root(__r) {}
672 _Rope_char_ref_proxy(_My_rope* __r, size_t __p, _CharT __c)
673 : _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) {}
900 _Rope_const_iterator(const rope<_CharT,_Alloc>& __r, size_t __pos) :
901 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos) {}
982 _Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos);
[all …]
D_function_adaptors.h523 _Ret operator()(_Tp& __r) const { return (__r.*_M_f)(); }
533 _Ret operator()(const _Tp& __r) const { return (__r.*_M_f)(); }
564 _Ret operator()(_Tp& __r, _Arg __x) const { return (__r.*_M_f)(__x); }
574 _Ret operator()(const _Tp& __r, _Arg __x) const { return (__r.*_M_f)(__x); }
630 void operator()(_Tp& __r) const { (__r.*_M_f)(); }
640 void operator()(const _Tp& __r) const { (__r.*_M_f)(); }
672 void operator()(_Tp& __r, _Arg __x) const { (__r.*_M_f)(__x); }
683 void operator()(const _Tp& __r, _Arg __x) const { (__r.*_M_f)(__x); }
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__std_stream133 codecvt_base::result __r;
137 __r = __cv_->in(*__st_, __extbuf, __extbuf + __nread, __enxt,
139 switch (__r)
161 } while (__r == _VSTD::codecvt_base::partial);
276 codecvt_base::result __r;
283 __r = __cv_->out(*__st_, pbase, pptr, __e,
289 if (__r == codecvt_base::noconv)
294 else if (__r == codecvt_base::ok || __r == codecvt_base::partial)
299 if (__r == codecvt_base::partial)
306 } while (__r == codecvt_base::partial);
[all …]
Dmemory894 __nat, element_type>::type& __r)
895 {return pointer::pointer_to(__r);}
916 __nat, element_type>::type& __r) _NOEXCEPT
917 {return _VSTD::addressof(__r);}
1825 pair<_Tp*, ptrdiff_t> __r(0, 0);
1833 __r.first = static_cast<_Tp*>(::operator new(__n * sizeof(_Tp), nothrow));
1834 if (__r.first)
1836 __r.second = __n;
1841 return __r;
3072 _Size __r;
[all …]
Ddeque181 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r,
189 _OutputIterator __r);
196 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r);
203 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r,
211 _OutputIterator __r);
218 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r);
225 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r,
233 _OutputIterator __r);
240 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r);
247 __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2> __r,
[all …]
Dios444 fmtflags __r = __fmtflags_;
446 return __r;
453 fmtflags __r = __fmtflags_;
455 return __r;
469 fmtflags __r = __fmtflags_;
472 return __r;
488 streamsize __r = __precision_;
490 return __r;
506 streamsize __r = __width_;
508 return __r;
[all …]
Drandom1685 const result_type __r = __m % __a;
1687 const result_type __t1 = __r * (__x / __q);
1703 const result_type __r = __m % __a;
1705 const result_type __t1 = __r * (__x / __q);
1747 const result_type __r = __m % __a;
1749 const result_type __t1 = __r * (__x / __q);
1767 const result_type __r = __m % __a;
1769 const result_type __t1 = __r * (__x / __q);
2011 template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
2053 template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
[all …]
Dbitset370 unsigned long long __r = __first_[0];
372 … __r |= static_cast<unsigned long long>(__first_[__i]) << (sizeof(__storage_type) * CHAR_BIT);
373 return __r;
924 basic_string<_CharT, _Traits, _Allocator> __r(_Size, __zero);
928 __r[_Size - 1 - __i] = __one;
930 return __r;
1017 bitset __r = *this;
1018 __r <<= __pos;
1019 return __r;
1027 bitset __r = *this;
[all …]
Dvalarray2569 result_type __r = __n ? __expr_[0] : result_type();
2571 __r += __expr_[__i];
2572 return __r;
2579 result_type __r = __n ? (*this)[0] : result_type();
2583 if (__x < __r)
2584 __r = __x;
2586 return __r;
2593 result_type __r = __n ? (*this)[0] : result_type();
2597 if (__r < __x)
2598 __r = __x;
[all …]
Dforward_list1093 __node_pointer const __r = __p.__ptr_;
1099 __h->__next_ = __r->__next_;
1100 __r->__next_ = __h.release();
1101 return iterator(__r->__next_);
1110 __node_pointer const __r = __p.__ptr_;
1115 __h->__next_ = __r->__next_;
1116 __r->__next_ = __h.release();
1117 return iterator(__r->__next_);
1126 __node_pointer const __r = __p.__ptr_;
1131 __h->__next_ = __r->__next_;
[all …]
Dstring587 char_type* __r = __s1;
600 return __r;
609 char_type* __r = __s1;
612 return __r;
620 char_type* __r = __s;
623 return __r;
831 char_type* __r = __s1;
844 return __r;
852 char_type* __r = __s1;
855 return __r;
[all …]
D__hash_table1827 pair<iterator, bool> __r = __node_insert_unique(__h.get());
1828 if (__r.second)
1830 return __r;
1839 iterator __r = __node_insert_multi(__h.get());
1841 return __r;
1856 iterator __r = __node_insert_multi(__p, __h.get());
1858 return __r;
1869 pair<iterator, bool> __r = __node_insert_unique(__h.get());
1870 if (__r.second)
1872 return __r;
[all …]
Dfstream607 codecvt_base::result __r;
618 __r = __cv_->in(__st_, __extbuf_, __extbufend_, __extbufnext_,
621 if (__r == codecvt_base::noconv)
691 codecvt_base::result __r;
699 __r = __cv_->out(__st_, this->pbase(), this->pptr(), __e,
703 if (__r == codecvt_base::noconv)
709 else if (__r == codecvt_base::ok || __r == codecvt_base::partial)
714 if (__r == codecvt_base::partial)
722 } while (__r == codecvt_base::partial);
813 pos_type __r = ftell(__file_);
[all …]
D__tree1744 __node_pointer __r = static_cast<__node_pointer>(__child);
1749 __r = __h.release();
1752 return pair<iterator, bool>(iterator(__r), __inserted);
1763 __node_pointer __r = static_cast<__node_pointer>(__child);
1767 __r = __h.release();
1769 return iterator(__r);
1805 pair<iterator, bool> __r = __node_insert_unique(__h.get());
1806 if (__r.second)
1808 return __r;
1817 iterator __r = __node_insert_unique(__p, __h.get());
[all …]
Dlist1371 iterator __r(__p.__ptr_, this);
1373 iterator __r(__p.__ptr_);
1385 __r = iterator(__hold.get(), this);
1387 __r = iterator(__hold.get());
1390 iterator __e = __r;
1423 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
1426 return __r;
1439 iterator __r(__p.__ptr_, this);
1441 iterator __r(__p.__ptr_);
1453 __r = iterator(__hold.get(), this);
[all …]
Dlocale1853 int __r = __ct.narrow(__c, 0) - '0';
1859 return __r;
1860 __r = __r * 10 + __ct.narrow(__c, 0) - '0';
1864 return __r;
1883 virtual const string_type& __r() const;
2574 virtual const string_type& __r() const {return this->__r_;}
3864 codecvt_base::result __r = codecvt_base::ok;
3874 __r = __cvtptr_->in(__st, __frm, __frm_end, __frm_nxt,
3879 __r = codecvt_base::error;
3881 else if (__r == codecvt_base::noconv)
[all …]
Dmutex332 int __r = 0;
336 __r = try_lock(__l1, __l2, __l3...);
337 if (__r == -1)
340 ++__r;
342 return __r;
D__locale1219 result __r = ok;
1221 while (__wb < __we && __r != error)
1227 __r = do_out(__mb, (const char16_t*)__wb, (const char16_t*)__we, __wn,
1229 if (__r == codecvt_base::error || __wn == (const char16_t*)__wb)
1253 result __r = ok;
1255 while (__wb < __we && __r != error)
1261 __r = do_out(__mb, (const char32_t*)__wb, (const char32_t*)__we, __wn,
1263 if (__r == codecvt_base::error || __wn == (const char32_t*)__wb)
1309 result __r = ok;
1311 while (__nb < __ne && __r != error)
[all …]
Dvector892 pointer __r = __v.__begin_;
901 return __r;
1672 iterator __r = __make_iter(__p);
1674 return __r;
1688 iterator __r = __make_iter(__p);
1691 return __r;
2988 iterator __r;
2994 __r = __const_iterator_cast(__position);
3001 __r = _VSTD::copy(cbegin(), __position, __v.begin());
3005 *__r = __x;
[all …]
Dregex1084 locale __r = __loc_;
1087 return __r;
1147 string_type __r;
1150 __r = __get_collation_name(__s.c_str());
1151 if (__r.empty() && __s.size() <= 2)
1153 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1154 if (__r.size() == 1 || __r.size() == 12)
1155 __r = __s;
1157 __r.clear();
1160 return __r;
[all …]
/ndk/sources/cxx-stl/stlport/src/
Dallocators.cpp321 _Obj *__r; in _M_allocate() local
328 if ( (__r = *__my_free_list) != 0 ) { in _M_allocate()
329 *__my_free_list = __r->_M_next; in _M_allocate()
331 __r = _S_refill(__n); in _M_allocate()
337 return __r; in _M_allocate()
486 _Obj* __r = _S_free_list[_S_FREELIST_INDEX(__n)].pop(); in _M_allocate() local
487 if (__r == 0) in _M_allocate()
488 { __r = _S_refill(__n); } in _M_allocate()
493 return __r; in _M_allocate()
1006 void *__r = __a->_M_refill(__n); in allocate() local
[all …]
/ndk/sources/android/support/src/msun/
Dmath_private.h361 volatile __typeof(a) __ia, __ib, __r, __vw; \
374 __r = __ia - __vw; \
375 __r += __ib; \
376 assert(__vw == (a) && __r == (b)); \

12