/external/clang/test/CodeGen/ |
H A D | linux-arm-atomic.c | 8 _Atomic_word exchange_and_add(volatile _Atomic_word *__mem, int __val) { argument 9 return __atomic_fetch_add(__mem, __val, __ATOMIC_ACQ_REL);
|
/external/stlport/test/unit/ |
H A D | iota.h | 8 void __iota(_It __first, _It __last, _Tp __val) { argument 10 iota(__first, __last, __val); 13 *__first++ = __val++;
|
H A D | limits_test.cpp | 111 bool test_signed_integral_limits(const _Tp &__val) { argument 112 return test_integral_limits(__val, false, true); 115 bool test_unsigned_integral_limits(const _Tp &__val) { argument 116 return test_integral_limits(__val, false, false);
|
H A D | stack_allocator.h | 138 void construct(pointer __p, const_reference __val) { new(__p) _Tp(__val); } argument
|
/external/stlport/stlport/stl/ |
H A D | _carray.h | 37 _CArray (const _Tp& __val) { argument 39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); local
|
H A D | _ctraits_fns.h | 45 typename _Traits::char_type __val; member in struct:_Eq_char_bound 46 _Eq_char_bound(typename _Traits::char_type __c) : __val(__c) {} 48 { return _Traits::eq(__x, __val); } 55 typename _Traits::char_type __val; member in struct:_Neq_char_bound 56 _Neq_char_bound(typename _Traits::char_type __c) : __val(__c) {} 58 { return !_Traits::eq(__x, __val); } 64 typename _Traits::int_type __val; member in struct:_Eq_int_bound 66 _Eq_int_bound(typename _Traits::int_type __c) : __val(__c) {} 68 { return _Traits::eq_int_type(_Traits::to_int_type(__x), __val); }
|
H A D | _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); 54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __val, _Distance*) argument 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __val, _Compare __comp, _Distance*) argument
|
H A D | _numeric.c | 46 _Tp __val = *__first; local 48 __val = __binary_op(__val, *__first); 49 *++__result = __val; 63 _Tp __val = *__first; local 66 *++__result = __binary_op(__tmp, __val); 67 __val = __tmp;
|
H A D | _heap.c | 43 _Distance __holeIndex, _Distance __topIndex, _Tp __val) 46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { 51 *(__first + __holeIndex) = __val; 77 _Distance __topIndex, _Tp __val, _Compare __comp) 80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) { 81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) 86 *(__first + __holeIndex) = __val; 112 _Distance __len, _Tp __val) { 126 __push_heap(__first, __holeIndex, __topIndex, __val); 147 _Distance __len, _Tp __val, _Compar 42 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __val) argument 76 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __val, _Compare __comp) argument 111 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __val) argument 146 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __val, _Compare __comp) argument [all...] |
H A D | _numeric.h | 174 void iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __val) { argument 177 *__first++ = __val++;
|
H A D | _construct.h | 118 inline void _Copy_Construct_aux(_Tp* __p, const _Tp& __val, const __false_type&) { argument 119 new(__p) _Tp(__val); 123 inline void _Copy_Construct_aux(_Tp* __p, const _Tp& __val, const __true_type&) { argument 126 *__p = __val; 130 inline void _Copy_Construct(_Tp* __p, const _Tp& __val) { argument 134 _Copy_Construct_aux(__p, __val, _Is_POD(__p)._Answer()); 138 inline void _Param_Construct_aux(_T1* __p, const _T2& __val, const __false_type&) { argument 139 new(__p) _T1(__val); 143 inline void _Param_Construct_aux(_T1* __p, const _T2& __val, const __true_type&) { argument 146 *__p = _T1(__val); 150 _Param_Construct(_T1* __p, const _T2& __val) argument 158 _Move_Construct_Aux(_T1* __p, _T2& __val, const __false_type& ) argument 167 _Move_Construct_Aux(_T1* __p, _T2& __val, const __true_type& ) argument 174 _Move_Construct(_T1* __p, _T2& __val) argument 274 construct(_T1* __p, const _T2& __val) argument [all...] |
H A D | _list.c | 124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { argument 127 *__i = __val; 129 insert(end(), __n, __val); local
|
H A D | _slist.c | 91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { argument 95 __STATIC_CAST(_Node*, __node)->_M_data = __val; 100 _M_insert_after_fill(__prev, __n, __val); 119 void slist<_Tp,_Alloc>::remove(const _Tp& __val) { argument 122 if (__STATIC_CAST(_Node*, __cur->_M_next)->_M_data == __val)
|
H A D | _stream_iterator.h | 180 _Self& operator=(const _TpP& __val) { argument 181 *_M_stream << __val; local
|
H A D | _uninitialized.h | 266 const unsigned char& __val) { 267 unsigned char __tmp = __val; 272 const signed char& __val) { 273 signed char __tmp = __val; 277 inline void uninitialized_fill(char* __first, char* __last, const char& __val) { argument 278 char __tmp = __val; 329 inline _ForwardIter __uinit_aux_aux(_ForwardIter __first, _Size __n, const _Tp& __val, argument 331 { return __uninitialized_fill_n(__first, __n, __val); } 334 inline _ForwardIter __uinit_aux_aux(_ForwardIter __first, _Size __n, const _Tp& /* __val */, 346 inline _ForwardIter __uinit_aux(_ForwardIter __first, _Size __n, const _Tp& __val, argument 265 uninitialized_fill(unsigned char* __first, unsigned char* __last, const unsigned char& __val) argument 271 uninitialized_fill(signed char* __first, signed char* __last, const signed char& __val) argument 351 __uninitialized_init(_ForwardIter __first, _Size __n, const _Tp& __val) argument [all...] |
H A D | _vector.c | 210 void vector<_Tp, _Alloc>::_M_fill_assign(size_t __n, const _Tp& __val) { argument 212 vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator()); 215 fill(begin(), end(), __val); local 216 this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_finish, __n - size(), __val); 218 erase(_STLP_PRIV __fill_n(begin(), __n, __val), end());
|
H A D | _algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { argument 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 130 _Integer __count, const _Tp& __val); 133 _Integer __count, const _Tp& __val, _BinaryPred __binary_pred); 239 remove_copy(_InputIter __first, _InputIter __last,_OutputIter __result, const _Tp& __val) { argument 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { argument 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); 481 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument 491 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 507 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument 517 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 535 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument 545 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 553 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument 564 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument [all...] |
H A D | _algobase.c | 113 const _Tp& __val, 118 if (*__first == __val) return __first; 121 if (*__first == __val) return __first; 124 if (*__first == __val) return __first; 127 if (*__first == __val) return __first; 133 if (*__first == __val) return __first; 136 if (*__first == __val) return __first; 139 if (*__first == __val) return __first; 148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) { argument 149 void *res = memchr(__first, __val, __las 112 __find(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, const random_access_iterator_tag &) argument 153 __find(const char* __first, const char* __last, char __val, const random_access_iterator_tag &) argument 195 __find(_InputIter __first, _InputIter __last, const _Tp& __val, const input_iterator_tag &) argument 221 find(_InputIter __first, _InputIter __last, const _Tp& __val) argument 453 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare1 __comp1, _Compare2 _STLP_UNUSED(__comp2), _Distance*) argument [all...] |
H A D | _algobase.h | 411 void __fill_fwd(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { argument 413 *__first = __val; 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, argument 419 _STLP_PRIV __fill_fwd(__first, __last, __val); 425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, argument 427 _STLP_PRIV __fill_fwd(__first, __last, __val); 432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, argument 434 _STLP_PRIV __fill_fwd(__first, __last, __val); 440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, argument 443 *__first = __val; 449 fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument 457 fill(unsigned char* __first, unsigned char* __last, const unsigned char& __val) argument 463 fill(signed char* __first, signed char* __last, const signed char& __val) argument 469 fill(char* __first, char* __last, const char& __val) argument 478 __fill_n(_OutputIter __first, _Size __n, const _Tp& __val) argument 487 __fill_n(unsigned char* __first, _Size __n, const unsigned char& __val) argument 494 __fill_n(signed char* __first, _Size __n, const signed char& __val) argument 501 __fill_n(char* __first, _Size __n, const char& __val) argument 511 fill_n(_OutputIter __first, _Size __n, const _Tp& __val) argument 656 count(_InputIter __first, _InputIter __last, const _Tp& __val) argument [all...] |
H A D | _iterator.h | 177 _Self& operator=(const typename _Container::value_type& __val) { argument 178 container->push_back(__val); 206 _Self& operator=(const typename _Container::value_type& __val) { argument 207 container->push_front(__val); 238 _Self& operator=(const typename _Container::value_type& __val) { argument 239 _M_iter = container->insert(_M_iter, __val);
|
H A D | _pthread_alloc.h | 158 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } argument 341 void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } argument
|
H A D | _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) { argument 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) { argument 411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_ke 350 _M_insert(_Rb_tree_node_base * __parent, const _Value& __val, _Rb_tree_node_base * __on_left, _Rb_tree_node_base * __on_right) argument 432 insert_unique(iterator __position, const _Value& __val) argument 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | 2007-09-10-RecursiveTypeResolution.cpp | 34 const _Tp & __val) 33 find(_InputIterator __last, const _Tp & __val) argument
|
/external/stlport/stlport/stl/debug/ |
H A D | _list.h | 334 void assign(size_type __n, const _Tp& __val) { argument 336 _M_non_dbg_impl.assign(__n, __val);
|
/external/stlport/stlport/stl/pointers/ |
H A D | _vector.h | 110 explicit vector(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type), 112 vector(size_type __n, const value_type& __val, 115 : _M_impl(__n, cast_traits::to_storage_type_cref(__val), 154 void assign(size_type __n, const value_type& __val) argument 155 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
|