| /external/syslinux/com32/include/sys/i386/ |
| bitops.h | 49 unsigned char __r; local
51 : "=qm" (__r)
53 return __r;
|
| /external/syslinux/com32/include/sys/x86_64/ |
| bitops.h | 50 unsigned char __r; local
52 : "=qm" (__r)
54 return __r;
|
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _auto_ptr.h | 37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { }
88 template<class _Tp1> auto_ptr(auto_ptr<_Tp1>& __r) _STLP_NOTHROW {
89 _Tp* __conversionCheck = __r.release();
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()); }
102 _Self& operator=(_Self& __r) _STLP_NOTHROW {
103 reset(__r.release())
[all...] |
| _rope.c | 59 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos)
60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
61 _M_root_rope(__r) { _RopeRep::_S_ref(this->_M_root); }
64 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos):
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
66 _M_root_rope(&__r) {
68 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*this);
71 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*__x);
378 _RopeLeaf* __r, const _CharT* __iter, size_t __len) {
379 size_t __old_len = __r->_M_size._M_data
1239 const _RopeLeaf* __r = __STATIC_CAST(const _RopeLeaf*, __right); local
1254 const _RopeLeaf* __r = __STATIC_CAST(const _RopeLeaf*, __right); local
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/ |
| _auto_ptr.h | 37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { }
88 template<class _Tp1> auto_ptr(auto_ptr<_Tp1>& __r) _STLP_NOTHROW {
89 _Tp* __conversionCheck = __r.release();
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()); }
102 _Self& operator=(_Self& __r) _STLP_NOTHROW {
103 reset(__r.release())
[all...] |
| _rope.c | 59 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos)
60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
61 _M_root_rope(__r) { _RopeRep::_S_ref(this->_M_root); }
64 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos):
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
66 _M_root_rope(&__r) {
68 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*this);
71 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*__x);
378 _RopeLeaf* __r, const _CharT* __iter, size_t __len) {
379 size_t __old_len = __r->_M_size._M_data
1239 const _RopeLeaf* __r = __STATIC_CAST(const _RopeLeaf*, __right); local
1254 const _RopeLeaf* __r = __STATIC_CAST(const _RopeLeaf*, __right); local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/ |
| _auto_ptr.h | 37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { }
88 template<class _Tp1> auto_ptr(auto_ptr<_Tp1>& __r) _STLP_NOTHROW {
89 _Tp* __conversionCheck = __r.release();
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()); }
102 _Self& operator=(_Self& __r) _STLP_NOTHROW {
103 reset(__r.release())
[all...] |
| _rope.c | 59 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos)
60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
61 _M_root_rope(__r) { _RopeRep::_S_ref(this->_M_root); }
64 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos):
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
66 _M_root_rope(&__r) {
68 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*this);
71 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*__x);
378 _RopeLeaf* __r, const _CharT* __iter, size_t __len) {
379 size_t __old_len = __r->_M_size._M_data
1239 const _RopeLeaf* __r = __STATIC_CAST(const _RopeLeaf*, __right); local
1254 const _RopeLeaf* __r = __STATIC_CAST(const _RopeLeaf*, __right); local
[all...] |
| /external/clang/test/PCH/ |
| cxx-variadic-templates.h | 16 shared_ptr<_Tp> __r; local
17 return __r;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| shared_ptr.h | 329 __shared_count(std::auto_ptr<_Tp>& __r)
331 _Sp_deleter<_Tp>, _Lp >(__r.get(), _Sp_deleter<_Tp>()))
332 { __r.release(); }
334 // Throw bad_weak_ptr when __r._M_get_use_count() == 0.
336 __shared_count(const __weak_count<_Lp>& __r);
344 __shared_count(const __shared_count& __r)
345 : _M_pi(__r._M_pi) // nothrow
352 operator=(const __shared_count& __r) // nothrow
354 _Sp_counted_base<_Lp>* __tmp = __r._M_pi;
367 _M_swap(__shared_count& __r) // nothro
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| shared_ptr.h | 329 __shared_count(std::auto_ptr<_Tp>& __r)
331 _Sp_deleter<_Tp>, _Lp >(__r.get(), _Sp_deleter<_Tp>()))
332 { __r.release(); }
334 // Throw bad_weak_ptr when __r._M_get_use_count() == 0.
336 __shared_count(const __weak_count<_Lp>& __r);
344 __shared_count(const __shared_count& __r)
345 : _M_pi(__r._M_pi) // nothrow
352 operator=(const __shared_count& __r) // nothrow
354 _Sp_counted_base<_Lp>* __tmp = __r._M_pi;
367 _M_swap(__shared_count& __r) // nothro
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| shared_ptr.h | 329 __shared_count(std::auto_ptr<_Tp>& __r)
331 _Sp_deleter<_Tp>, _Lp >(__r.get(), _Sp_deleter<_Tp>()))
332 { __r.release(); }
334 // Throw bad_weak_ptr when __r._M_get_use_count() == 0.
336 __shared_count(const __weak_count<_Lp>& __r);
344 __shared_count(const __shared_count& __r)
345 : _M_pi(__r._M_pi) // nothrow
352 operator=(const __shared_count& __r) // nothrow
354 _Sp_counted_base<_Lp>* __tmp = __r._M_pi;
367 _M_swap(__shared_count& __r) // nothro
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| shared_ptr.h | 329 __shared_count(std::auto_ptr<_Tp>& __r)
331 _Sp_deleter<_Tp>, _Lp >(__r.get(), _Sp_deleter<_Tp>()))
332 { __r.release(); }
334 // Throw bad_weak_ptr when __r._M_get_use_count() == 0.
336 __shared_count(const __weak_count<_Lp>& __r);
344 __shared_count(const __shared_count& __r)
345 : _M_pi(__r._M_pi) // nothrow
352 operator=(const __shared_count& __r) // nothrow
354 _Sp_counted_base<_Lp>* __tmp = __r._M_pi;
367 _M_swap(__shared_count& __r) // nothro
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| shared_ptr.h | 329 __shared_count(std::auto_ptr<_Tp>& __r)
331 _Sp_deleter<_Tp>, _Lp >(__r.get(), _Sp_deleter<_Tp>()))
332 { __r.release(); }
334 // Throw bad_weak_ptr when __r._M_get_use_count() == 0.
336 __shared_count(const __weak_count<_Lp>& __r);
344 __shared_count(const __shared_count& __r)
345 : _M_pi(__r._M_pi) // nothrow
352 operator=(const __shared_count& __r) // nothrow
354 _Sp_counted_base<_Lp>* __tmp = __r._M_pi;
367 _M_swap(__shared_count& __r) // nothro
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| shared_ptr.h | 329 __shared_count(std::auto_ptr<_Tp>& __r)
331 _Sp_deleter<_Tp>, _Lp >(__r.get(), _Sp_deleter<_Tp>()))
332 { __r.release(); }
334 // Throw bad_weak_ptr when __r._M_get_use_count() == 0.
336 __shared_count(const __weak_count<_Lp>& __r);
344 __shared_count(const __shared_count& __r)
345 : _M_pi(__r._M_pi) // nothrow
352 operator=(const __shared_count& __r) // nothrow
354 _Sp_counted_base<_Lp>* __tmp = __r._M_pi;
367 _M_swap(__shared_count& __r) // nothro
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| shared_ptr.h | 191 * and shares ownership with @a __r.
192 * @param __r A %shared_ptr.
193 * @param __p A pointer that will remain valid while @a *__r is valid.
194 * @post get() == __p && use_count() == __r.use_count()
206 shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) noexcept
207 : __shared_ptr<_Tp>(__r, __p) { }
210 * @brief If @a __r is empty, constructs an empty %shared_ptr;
212 * with @a __r.
213 * @param __r A %shared_ptr.
214 * @post get() == __r.get() && use_count() == __r.use_count(
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| shared_ptr.h | 191 * and shares ownership with @a __r.
192 * @param __r A %shared_ptr.
193 * @param __p A pointer that will remain valid while @a *__r is valid.
194 * @post get() == __p && use_count() == __r.use_count()
206 shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) noexcept
207 : __shared_ptr<_Tp>(__r, __p) { }
210 * @brief If @a __r is empty, constructs an empty %shared_ptr;
212 * with @a __r.
213 * @param __r A %shared_ptr.
214 * @post get() == __r.get() && use_count() == __r.use_count(
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| shared_ptr.h | 191 * and shares ownership with @a __r.
192 * @param __r A %shared_ptr.
193 * @param __p A pointer that will remain valid while @a *__r is valid.
194 * @post get() == __p && use_count() == __r.use_count()
206 shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) noexcept
207 : __shared_ptr<_Tp>(__r, __p) { }
210 * @brief If @a __r is empty, constructs an empty %shared_ptr;
212 * with @a __r.
213 * @param __r A %shared_ptr.
214 * @post get() == __r.get() && use_count() == __r.use_count(
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| shared_ptr.h | 191 * and shares ownership with @a __r.
192 * @param __r A %shared_ptr.
193 * @param __p A pointer that will remain valid while @a *__r is valid.
194 * @post get() == __p && use_count() == __r.use_count()
206 shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) noexcept
207 : __shared_ptr<_Tp>(__r, __p) { }
210 * @brief If @a __r is empty, constructs an empty %shared_ptr;
212 * with @a __r.
213 * @param __r A %shared_ptr.
214 * @post get() == __r.get() && use_count() == __r.use_count(
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| shared_ptr.h | 191 * and shares ownership with @a __r.
192 * @param __r A %shared_ptr.
193 * @param __p A pointer that will remain valid while @a *__r is valid.
194 * @post get() == __p && use_count() == __r.use_count()
206 shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) noexcept
207 : __shared_ptr<_Tp>(__r, __p) { }
210 * @brief If @a __r is empty, constructs an empty %shared_ptr;
212 * with @a __r.
213 * @param __r A %shared_ptr.
214 * @post get() == __r.get() && use_count() == __r.use_count(
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| shared_ptr.h | 191 * and shares ownership with @a __r.
192 * @param __r A %shared_ptr.
193 * @param __p A pointer that will remain valid while @a *__r is valid.
194 * @post get() == __p && use_count() == __r.use_count()
206 shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) noexcept
207 : __shared_ptr<_Tp>(__r, __p) { }
210 * @brief If @a __r is empty, constructs an empty %shared_ptr;
212 * with @a __r.
213 * @param __r A %shared_ptr.
214 * @post get() == __r.get() && use_count() == __r.use_count(
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/ |
| ropeimpl.h | 317 _Rope_iterator(rope<_CharT, _Alloc>& __r, size_t __pos)
318 : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),
319 _M_root_rope(&__r)
428 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
430 size_t __old_len = __r->_M_size;
435 uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
441 __r->_M_get_allocator());
446 __r->_M_get_allocator());
457 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter,
460 if (__r->_M_ref_count > 1
1441 _RopeLeaf* __r = (_RopeLeaf*) __right; local
1462 _RopeLeaf* __r = (_RopeLeaf*) __right; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/ |
| ropeimpl.h | 317 _Rope_iterator(rope<_CharT, _Alloc>& __r, size_t __pos)
318 : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),
319 _M_root_rope(&__r)
428 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
430 size_t __old_len = __r->_M_size;
435 uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
441 __r->_M_get_allocator());
446 __r->_M_get_allocator());
457 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter,
460 if (__r->_M_ref_count > 1
1441 _RopeLeaf* __r = (_RopeLeaf*) __right; local
1462 _RopeLeaf* __r = (_RopeLeaf*) __right; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/ |
| ropeimpl.h | 317 _Rope_iterator(rope<_CharT, _Alloc>& __r, size_t __pos)
318 : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),
319 _M_root_rope(&__r)
428 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
430 size_t __old_len = __r->_M_size;
435 uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
441 __r->_M_get_allocator());
446 __r->_M_get_allocator());
457 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter,
460 if (__r->_M_ref_count > 1
1441 _RopeLeaf* __r = (_RopeLeaf*) __right; local
1462 _RopeLeaf* __r = (_RopeLeaf*) __right; local
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/ |
| ropeimpl.h | 317 _Rope_iterator(rope<_CharT, _Alloc>& __r, size_t __pos)
318 : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),
319 _M_root_rope(&__r)
428 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
430 size_t __old_len = __r->_M_size;
435 uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
441 __r->_M_get_allocator());
446 __r->_M_get_allocator());
457 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter,
460 if (__r->_M_ref_count > 1
1441 _RopeLeaf* __r = (_RopeLeaf*) __right; local
1462 _RopeLeaf* __r = (_RopeLeaf*) __right; local
[all...] |
