| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /external/stlport/stlport/stl/ |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /external/clang/test/CodeGen/ |
| linux-arm-atomic.c | 8 _Atomic_word exchange_and_add(volatile _Atomic_word *__mem, int __val) {
9 return __atomic_fetch_add(__mem, __val, __ATOMIC_ACQ_REL);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| move.h | 102 #define _GLIBCXX_MOVE(__val) std::move(__val)
103 #define _GLIBCXX_FORWARD(_Tp, __val) std::forward<_Tp>(__val)
105 #define _GLIBCXX_MOVE(__val) (__val)
106 #define _GLIBCXX_FORWARD(_Tp, __val) (__val)
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| move.h | 102 #define _GLIBCXX_MOVE(__val) std::move(__val)
103 #define _GLIBCXX_FORWARD(_Tp, __val) std::forward<_Tp>(__val)
105 #define _GLIBCXX_MOVE(__val) (__val)
106 #define _GLIBCXX_FORWARD(_Tp, __val) (__val)
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| move.h | 102 #define _GLIBCXX_MOVE(__val) std::move(__val)
103 #define _GLIBCXX_FORWARD(_Tp, __val) std::forward<_Tp>(__val)
105 #define _GLIBCXX_MOVE(__val) (__val)
106 #define _GLIBCXX_FORWARD(_Tp, __val) (__val)
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| move.h | 102 #define _GLIBCXX_MOVE(__val) std::move(__val)
103 #define _GLIBCXX_FORWARD(_Tp, __val) std::forward<_Tp>(__val)
105 #define _GLIBCXX_MOVE(__val) (__val)
106 #define _GLIBCXX_FORWARD(_Tp, __val) (__val)
|
| /bionic/libc/kernel/arch-arm/asm/ |
| cacheflush.h | 96 #define cache_is_vivt() ({ unsigned int __val = read_cpuid(CPUID_CACHETYPE); (!__cacheid_present(__val)) || __cacheid_vivt(__val); })
97 #define cache_is_vipt() ({ unsigned int __val = read_cpuid(CPUID_CACHETYPE); __cacheid_present(__val) && __cacheid_vipt(__val); })
99 #define cache_is_vipt_nonaliasing() ({ unsigned int __val = read_cpuid(CPUID_CACHETYPE); __cacheid_present(__val) && __cacheid_vipt_nonaliasing(__val); })
100 #define cache_is_vipt_aliasing() ({ unsigned int __val = read_cpuid(CPUID_CACHETYPE); __cacheid_present(__val) && __cacheid_vipt_aliasing(__val); }
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| functional_hash.h | 41 operator()(_Tp __val) const;
57 hash<_Tp>::operator()(_Tp __val) const \
58 { return static_cast<size_t>(__val); }
133 hash<float>::operator()(float __val) const
138 if (__val != 0.0f)
139 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
140 sizeof(__val));
147 hash<double>::operator()(double __val) const
152 if (__val != 0.0)
153 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
[all...] |
