Searched defs:__x (Results 1 - 25 of 87) sorted by relevance

1234

/external/clang/test/CodeGen/
H A D2010-01-18-Inlined-Debug.c5 static inline int foo(double __x) { return __x; } argument
/external/stlport/stlport/stl/
H A D_stdexcept_base.c42 __Named_exception::__Named_exception(const __Named_exception& __x) { argument
43 size_t __size = strlen(__x._M_name) + 1;
58 strncpy(_M_name, __x._M_name, __size - 1);
61 strncpy_s(_M_name, __size, __x._M_name, __size - 1);
65 __Named_exception& __Named_exception::operator = (const __Named_exception& __x) {
66 size_t __size = strlen(__x._M_name) + 1;
81 strncpy(_M_name, __x._M_name, __size - 1);
84 strncpy_s(_M_name, __size, __x._M_name, __size - 1);
H A D_relops_cont.h7 inline bool _STLP_CALL operator==(const _STLP_TEMPLATE_CONTAINER& __x, argument
9 return __x.size() == __y.size() &&
10 equal(__x.begin(), __x.end(), __y.begin());
15 inline bool _STLP_CALL operator<(const _STLP_TEMPLATE_CONTAINER& __x, argument
17 return lexicographical_compare(__x.begin(), __x.end(),
25 inline void _STLP_CALL swap(_STLP_TEMPLATE_CONTAINER& __x, argument
27 __x.swap(__y);
H A D_ctraits_fns.h37 bool operator()(const typename _Traits::char_type& __x, argument
39 { return _Traits::eq(__x, __y); }
47 bool operator()(const typename _Traits::char_type& __x) const
48 { return _Traits::eq(__x, __val); }
57 bool operator()(const typename _Traits::char_type& __x) const
58 { return !_Traits::eq(__x, __val); }
67 bool operator()(const typename _Traits::char_type& __x) const
68 { return _Traits::eq_int_type(_Traits::to_int_type(__x), __val); }
77 bool operator()(const typename _Traits::char_type& __x,
79 { return _Traits::lt(__x, __
[all...]
H A D_cstdlib.h113 inline int abs(int __x) { return _STLP_VENDOR_CSTD::abs(__x); } argument
114 inline _STLP_VENDOR_CSTD::div_t div(int __x, int __y) { return _STLP_VENDOR_CSTD::div(__x, __y); } argument
131 inline long abs(long __x) { return _STLP_VENDOR_CSTD::labs(__x); } argument
137 inline _STLP_VENDOR_CSTD::ldiv_t div(long __x, long __y) { return _STLP_VENDOR_CSTD::ldiv(__x, __y); } argument
151 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return _STLP_VENDOR_CSTD::llabs(__x); } argument
152 div(_STLP_LONG_LONG __x, _STLP_LONG_LONG __y) argument
154 abs(_STLP_LONG_LONG __x) argument
155 div(_STLP_LONG_LONG __x, _STLP_LONG_LONG __y) argument
158 abs(_STLP_LONG_LONG __x) argument
[all...]
H A D_ios.c57 basic_ios<_CharT, _Traits>::copyfmt(const basic_ios<_CharT, _Traits>& __x) { argument
59 _M_copy_state(__x); // Inherited from ios_base.
60 _M_cached_ctype = __x._M_cached_ctype;
61 _M_fill = __x._M_fill;
62 _M_tied_ostream = __x._M_tied_ostream;
64 this->_M_set_exception_mask(__x.exceptions());
H A D_raw_storage_iter.h53 explicit raw_storage_iterator(_ForwardIterator __x) : _M_iter(__x) {} argument
H A D_numeric.c74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr) { argument
81 __x = __opr(__x, __x);
83 _Tp __result = __x;
87 __x = __opr(__x, __x);
89 __result = __opr(__result, __x);
95 _STLP_MPWFIX_CATCH_ACTION(__x
[all...]
H A D_string_operators.h80 operator+(const basic_string<_CharT,_Traits,_Alloc>& __x, argument
87 _Str __result = _Str(_Reserve_t(), __x.size() + __n, __x.get_allocator());
89 _Str __result(_Reserve_t(), __x.size() + __n, __x.get_allocator());
91 __result.append(__x);
98 operator+(const basic_string<_CharT,_Traits,_Alloc>& __x, argument
103 _Str __result = _Str(_Reserve_t(), __x.size() + 1, __x.get_allocator());
105 _Str __result(_Reserve_t(), __x
287 operator ==(const basic_string<_CharT,_Traits,_Alloc>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
295 operator ==(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
302 operator ==(const basic_string<_CharT,_Traits,_Alloc>& __x, const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __y) argument
320 operator ==(const basic_string<_CharT,_Traits,_Alloc>& __x, const _CharT* __s) argument
339 operator ==(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const _CharT* __s) argument
351 operator <(const basic_string<_CharT,_Traits,_Alloc>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
360 operator <(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
368 operator <(const basic_string<_CharT,_Traits,_Alloc>& __x, const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __y) argument
387 operator <(const basic_string<_CharT,_Traits,_Alloc>& __x, const _CharT* __s) argument
408 operator <(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const _CharT* __s) argument
425 operator !=(const basic_string<_CharT,_Traits,_Alloc>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
431 operator >(const basic_string<_CharT,_Traits,_Alloc>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
437 operator <=(const basic_string<_CharT,_Traits,_Alloc>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
443 operator >=(const basic_string<_CharT,_Traits,_Alloc>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
450 operator !=(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const basic_string<_CharT,_Traits,_Alloc>& __y) argument
456 operator !=(const basic_string<_CharT,_Traits,_Alloc>& __x, const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __y) argument
473 operator !=(const basic_string<_CharT,_Traits,_Alloc>& __x, const _CharT* __s) argument
490 operator !=(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const _CharT* __s) argument
507 operator >(const basic_string<_CharT,_Traits,_Alloc>& __x, const _CharT* __s) argument
524 operator >(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const _CharT* __s) argument
541 operator <=(const basic_string<_CharT,_Traits,_Alloc>& __x, const _CharT* __s) argument
558 operator <=(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const _CharT* __s) argument
575 operator >=(const basic_string<_CharT,_Traits,_Alloc>& __x, const _CharT* __s) argument
592 operator >=(const _STLP_PRIV __bstr_sum<_CharT,_Traits,_Alloc,_Lhs,_Rhs,_StoreDir>& __x, const _CharT* __s) argument
[all...]
H A D_collate.h163 const basic_string<_CharT, _Traits, _Alloc>& __x,
166 return __coll.compare(__x.data(), __x.data() + __x.size(),
162 __locale_do_operator_call(const locale& __loc, const basic_string<_CharT, _Traits, _Alloc>& __x, const basic_string<_CharT, _Traits, _Alloc>& __y) argument
H A D_numeric.h140 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr);
146 // Returns __x ** __n, where __n >= 0. _Note that "multiplication"
152 inline _Tp __power(_Tp __x, _Integer __n) { argument
153 return __power(__x, __n, multiplies<_Tp>());
161 inline _Tp power(_Tp __x, _Integer __n, _MonoidOperation __opr) { argument
162 return _STLP_PRIV __power(__x, __n, __opr);
166 inline _Tp power(_Tp __x, _Integer __n) { argument
167 return _STLP_PRIV __power(__x, __n, multiplies<_Tp>());
H A D_stack.h86 void push(const value_type& __x) { c.push_back(__x); } argument
90 void _M_swap_workaround(_Self& __x) { argument
92 c = __x.c;
93 __x.c = __tmp;
106 inline bool _STLP_CALL operator==(const stack< _STLP_STACK_ARGS >& __x, argument
108 { return __x._Get_s() == __y._Get_s(); }
111 inline bool _STLP_CALL operator<(const stack< _STLP_STACK_ARGS >& __x, argument
113 { return __x._Get_s() < __y._Get_s(); }
H A D_bitset.c179 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) { argument
211 __x._M_copy_from_string(__tmp, __STATIC_CAST(size_t,0), _Nb);
220 const bitset<_Nb>& __x) {
222 __x._M_copy_to_string(__tmp);
219 operator(basic_ostream<_CharT, _Traits>& __os, const bitset<_Nb>& __x) argument
H A D_complex.h42 complex(const value_type& __x) argument
43 : _M_re(__x), _M_im(0) {}
44 complex(const value_type& __x, const value_type& __y) argument
45 : _M_re(__x), _M_im(__y) {}
74 _Self& operator= (const value_type& __x) { argument
75 _M_re = __x;
79 _Self& operator+= (const value_type& __x) { argument
80 _M_re += __x;
83 _Self& operator-= (const value_type& __x) { argument
84 _M_re -= __x;
87 operator *=(const value_type& __x) argument
92 operator /=(const value_type& __x) argument
200 operator =(value_type __x) argument
205 operator +=(value_type __x) argument
209 operator -=(value_type __x) argument
213 operator *=(value_type __x) argument
218 operator /=(value_type __x) argument
339 operator =(value_type __x) argument
344 operator +=(value_type __x) argument
348 operator -=(value_type __x) argument
352 operator *=(value_type __x) argument
357 operator /=(value_type __x) argument
477 operator =(value_type __x) argument
482 operator +=(value_type __x) argument
486 operator -=(value_type __x) argument
490 operator *=(value_type __x) argument
495 operator /=(value_type __x) argument
628 operator +(const _Tp& __x, const complex<_Tp>& __z) argument
632 operator +(const complex<_Tp>& __z, const _Tp& __x) argument
636 operator -(const _Tp& __x, const complex<_Tp>& __z) argument
640 operator -(const complex<_Tp>& __z, const _Tp& __x) argument
644 operator *(const _Tp& __x, const complex<_Tp>& __z) argument
648 operator *(const complex<_Tp>& __z, const _Tp& __x) argument
652 operator /(const _Tp& __x, const complex<_Tp>& __z) argument
661 operator /(const complex<_Tp>& __z, const _Tp& __x) argument
700 operator ==(const complex<_Tp>& __z, const _Tp& __x) argument
704 operator ==(const _Tp& __x, const complex<_Tp>& __z) argument
718 operator !=(const complex<_Tp>& __z, const _Tp& __x) argument
722 operator !=(const _Tp& __x, const complex<_Tp>& __z) argument
[all...]
H A D_istreambuf_iterator.h110 inline bool _STLP_CALL operator==(const istreambuf_iterator<_CharT, _Traits>& __x, argument
112 return __x.equal(__y);
118 inline bool _STLP_CALL operator!=(const istreambuf_iterator<_CharT, _Traits>& __x, argument
120 return !__x.equal(__y);
H A D_iterator_old.h82 explicit reverse_bidirectional_iterator(_BidirectionalIterator __x) argument
83 : current(__x) {}
134 Reference__, _Distance>& __x,
137 { return __x.base() == __y.base(); }
143 const reverse_bidirectional_iterator<_BiIter, _Tp, Reference__, _Distance>& __x,
145 { return !(__x == __y); }
176 reverse_iterator(const _Self& __x) : __current(__x.base()) {} argument
177 explicit reverse_iterator(_RandomAccessIterator __x) : __current(__x) {} argument
132 operator ==( const reverse_bidirectional_iterator<_BidirectionalIterator, _Tp, Reference__, _Distance>& __x, const reverse_bidirectional_iterator<_BidirectionalIterator, _Tp, Reference__, _Distance>& __y) argument
142 operator !=( const reverse_bidirectional_iterator<_BiIter, _Tp, Reference__, _Distance>& __x, const reverse_bidirectional_iterator<_BiIter, _Tp, Reference__, _Distance>& __y) argument
178 operator =(const _Self& __x) argument
240 operator ==(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
251 operator <(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
264 operator !=(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
274 operator >(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
284 operator <=(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
294 operator >=(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
306 operator -(const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __y) argument
318 operator +(_Distance __n, const reverse_iterator<_RandomAccessIterator, _Tp, Reference__, _Distance>& __x) argument
[all...]
H A D_list.c95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) { argument
103 insert(end(), __new_size - __len, __x); local
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
108 if (this != &__x) {
111 const_iterator __first2 = __x.begin();
112 const_iterator __last2 = __x.end();
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x, argument
173 _Literator __first2 = __x.begin();
174 _Literator __last2 = __x.end();
175 if (__that.get_allocator() == __x
[all...]
H A D_locale.h53 const basic_string<_CharT, _Traits, _Alloc>& __x,
170 bool operator()(const string& __x, const string& __y) const;
172 bool operator()(const wstring& __x, const wstring& __y) const;
176 bool operator()(const basic_string<_CharT, _Traits, _Alloc>& __x, argument
178 { return __locale_do_operator_call(*this, __x, __y); }
265 bool operator()(const basic_string<_CharT, _Traits, _Alloc>& __x, argument
267 { return __locale_do_operator_call(*this, __x, __y); }
H A D_pair.h81 inline bool _STLP_CALL operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
82 { return __x.first == __y.first && __x.second == __y.second; }
85 inline bool _STLP_CALL operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { argument
86 return __x.first < __y.first ||
87 (!(__y.first < __x.first) && __x.second < __y.second);
92 inline bool _STLP_CALL operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
93 { return !(__x == __y); }
96 inline bool _STLP_CALL operator>(const pair<_T1, _T2>& __x, cons argument
100 operator <=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
104 operator >=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument
110 make_pair(_T1 const& __x, _T2 const (&__y)[_Sz]) argument
115 make_pair(_T1 const (&__x)[_Sz], _T2 const& __y) argument
120 make_pair(_T1 const (&__x)[_Sz1], _T2 const (&__y)[_Sz2]) argument
128 make_pair(_T1 __x, _T2 __y) argument
137 operator !=(const _Tp& __x, const _Tp& __y) argument
141 operator >(const _Tp& __x, const _Tp& __y) argument
145 operator <=(const _Tp& __x, const _Tp& __y) argument
149 operator >=(const _Tp& __x, const _Tp& __y) argument
[all...]
H A D_queue.h100 void push(const value_type& __x) { c.push_back(__x); } argument
105 void _M_swap_workaround(_Self& __x) { argument
107 c = __x.c;
108 __x.c = __tmp;
122 operator==(const queue<_STLP_QUEUE_ARGS >& __x, const queue<_STLP_QUEUE_ARGS >& __y) { argument
123 return __x._Get_s() == __y._Get_s();
128 operator<(const queue<_STLP_QUEUE_ARGS >& __x, const queue<_STLP_QUEUE_ARGS >& __y) { argument
129 return __x._Get_s() < __y._Get_s();
171 explicit priority_queue(const _Compare& __x) argument
172 priority_queue(const _Compare& __x, const _Sequence& __s) argument
188 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x) argument
194 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x, const _Sequence& __s) argument
206 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x) argument
211 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x, const _Sequence& __c) argument
223 push(const value_type& __x) argument
238 _M_swap_workaround(_Self& __x) argument
[all...]
H A D_slist.c70 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x) {
71 if (&__x != this) {
74 const _Node_base* __n2 = __x._M_head._M_data._M_next;
106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) { argument
115 _M_insert_after_fill(__cur, __len, __x);
148 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x, argument
151 if (__that.get_allocator() == __x.get_allocator()) {
153 while (__ite._M_node->_M_next && !__x.empty()) {
154 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
155 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x
[all...]
/external/clang/test/CXX/expr/expr.post/expr.static.cast/
H A Dp9-0x.cpp23 template <class _Tp> inline _Tp* addressof(_Tp& __x) { argument
24 return (_Tp*)&(char&)__x;
/external/clang/lib/Headers/
H A Dammintrin.h38 _mm_extract_si64(__m128i __x, __m128i __y) argument
40 return (__m128i)__builtin_ia32_extrq((__v2di)__x, (__v16qi)__y);
49 _mm_insert_si64(__m128i __x, __m128i __y) argument
51 return (__m128i)__builtin_ia32_insertq((__v2di)__x, (__v2di)__y);
/external/clang/test/CodeGenCXX/
H A Dlpad-linetable.cpp50 push_back(const value_type& __x) argument
/external/clang/test/SemaTemplate/
H A Ddependent-base-member-init.cpp28 insert_iterator(_Container& __x) : container(&__x) {} argument

Completed in 2083 milliseconds

1234