Searched refs:__x (Results 26 - 48 of 48) sorted by relevance

12

/haiku/headers/cpp/
H A Dstl_bvector.h46 _Bit_reference(unsigned int* __x, unsigned int __y) argument
47 : _M_p(__x), _M_mask(__y) {}
52 _Bit_reference& operator=(bool __x) argument
54 if (__x) *_M_p |= _M_mask;
58 _Bit_reference& operator=(const _Bit_reference& __x) argument
59 { return *this = bool(__x); }
60 bool operator==(const _Bit_reference& __x) const
61 { return bool(*this) == bool(__x); }
62 bool operator<(const _Bit_reference& __x) const {
63 return !bool(*this) && bool(__x);
68 swap(_Bit_reference __x, _Bit_reference __y) argument
96 _Bit_iterator(unsigned int* __x, unsigned int __y) argument
179 _Bit_const_iterator(unsigned int* __x, unsigned int __y) argument
181 _Bit_const_iterator(const _Bit_iterator& __x) argument
420 _M_insert_aux(iterator __position, bool __x) argument
541 __BVECTOR(const __BVECTOR& __x) argument
558 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
591 operator =(const __BVECTOR& __x) argument
607 assign(size_t __n, bool __x) argument
610 insert(end(), __n - size(), __x); local
677 push_back(bool __x) argument
681 _M_insert_aux(end(), __x); local
683 swap(__BVECTOR& __x) argument
707 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
763 insert(iterator __position, size_type __n, bool __x) argument
797 insert(end(), __new_size - size(), __x); local
809 operator ==(const bit_vector& __x, const bit_vector& __y) argument
816 operator <(const bit_vector& __x, const bit_vector& __y) argument
[all...]
H A Dstl_slist.h111 _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {} argument
114 bool operator==(const _Slist_iterator_base& __x) const {
115 return _M_node == __x._M_node;
117 bool operator!=(const _Slist_iterator_base& __x) const {
118 return _M_node != __x._M_node;
134 _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {} argument
136 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x argument
324 _M_create_node(const value_type& __x) argument
355 slist(size_type __n, const value_type& __x, const allocator_type& __a = allocator_type()) argument
379 slist(const slist& __x) argument
427 swap(slist& __x) argument
438 push_front(const value_type& __x) argument
457 _M_insert_after(_Node_base* __pos, const value_type& __x) argument
465 _M_insert_after_fill(_Node_base* __pos, size_type __n, const value_type& __x) argument
482 _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x, __true_type) argument
519 insert_after(iterator __pos, const value_type& __x) argument
527 insert_after(iterator __pos, size_type __n, const value_type& __x) argument
553 insert(iterator __pos, const value_type& __x) argument
563 insert(iterator __pos, size_type __n, const value_type& __x) argument
564 _M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x); local
635 splice(iterator __pos, slist& __x) argument
642 splice(iterator __pos, slist& __x, iterator __i) argument
650 splice(iterator __pos, slist& __x, iterator __first, iterator __last) argument
685 operator =(const slist<_Tp,_Alloc>& __x) argument
769 swap(slist<_Tp,_Alloc>& __x, slist<_Tp,_Alloc>& __y) argument
777 resize(size_type __len, const _Tp& __x) argument
818 merge(slist<_Tp,_Alloc>& __x) argument
890 merge(slist<_Tp,_Alloc>& __x, _StrictWeakOrdering __comp) argument
[all...]
H A Dstl_uninitialized.h146 const _Tp& __x, __true_type)
148 fill(__first, __last, __x);
154 const _Tp& __x, __false_type)
159 construct(&*__cur, __x);
166 _ForwardIter __last, const _Tp& __x, _Tp1*)
169 __uninitialized_fill_aux(__first, __last, __x, _Is_POD());
176 const _Tp& __x)
178 __uninitialized_fill(__first, __last, __x, __VALUE_TYPE(__first));
186 const _Tp& __x, __true_type)
188 return fill_n(__first, __n, __x);
145 __uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, __true_type) argument
153 __uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, __false_type) argument
165 __uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, _Tp1*) argument
174 uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x) argument
185 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, const _Tp& __x, __true_type) argument
193 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, const _Tp& __x, __false_type) argument
207 __uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x, _Tp1*) argument
215 uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x) argument
246 __uninitialized_fill_copy(_ForwardIter __result, _ForwardIter __mid, const _Tp& __x, _InputIter __first, _InputIter __last) argument
262 __uninitialized_copy_fill(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, const _Tp& __x) argument
[all...]
H A Dstl_numeric.h175 // Returns __x ** __n, where __n >= 0. _Note that "multiplication"
180 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument
187 __x = __oper(__x, __x);
190 _Tp __result = __x;
193 __x = __oper(__x, __x);
195 __result = __oper(__result, __x);
203 __power(_Tp __x, _Integer __n) argument
212 power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument
218 power(_Tp __x, _Integer __n) argument
[all...]
H A Dstl_list.h65 _List_iterator(_Node* __x) : _M_node(__x) {} argument
67 _List_iterator(const iterator& __x) : _M_node(__x._M_node) {} argument
69 bool operator==(const _Self& __x) const { return _M_node == __x._M_node; }
70 bool operator!=(const _Self& __x) const { return _M_node != __x._M_node; }
289 _Node* _M_create_node(const _Tp& __x) argument
293 construct(&__p->_M_data, __x);
341 swap(list<_Tp, _Alloc>& __x) argument
343 insert(iterator __position, const _Tp& __x) argument
356 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
379 void push_front(const _Tp& __x) { insert(begin(), __x); } local
381 void push_back(const _Tp& __x) { insert(end(), __x); } local
434 list(const list<_Tp, _Alloc>& __x) argument
484 splice(iterator __position, list& __x) argument
516 operator ==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
532 operator <(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
543 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) argument
586 insert(iterator __position, size_type __n, const _Tp& __x) argument
602 resize(size_type __new_size, const _Tp& __x) argument
611 insert(end(), __new_size - __len, __x); local
615 operator =(const list<_Tp, _Alloc>& __x) argument
692 merge(list<_Tp, _Alloc>& __x) argument
783 merge(list<_Tp, _Alloc>& __x, _StrictWeakOrdering __comp) argument
[all...]
H A Dstl_rope.h124 sequence_buffer(const sequence_buffer& __x) { argument
125 _M_prefix = __x._M_prefix;
126 _M_buf_count = __x._M_buf_count;
127 copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);
129 sequence_buffer(sequence_buffer& __x) { argument
130 __x.flush();
131 _M_prefix = __x._M_prefix;
135 sequence_buffer& operator= (sequence_buffer& __x) { argument
141 operator =(const sequence_buffer& __x) argument
147 push_back(value_type __x) argument
179 put(value_type __x) argument
741 operator =(_Rope_RopeRep<_CharT,_Alloc>* __x) argument
770 _Rope_char_ref_proxy(const _Rope_char_ref_proxy& __x) argument
821 _Rope_char_ptr_proxy(const _Rope_char_ref_proxy<_CharT,_Alloc>& __x) argument
823 _Rope_char_ptr_proxy(const _Rope_char_ptr_proxy& __x) argument
826 _Rope_char_ptr_proxy(_CharT* __x) argument
830 operator =(const _Rope_char_ptr_proxy& __x) argument
916 _Rope_iterator_base(const _Rope_iterator_base& __x) argument
946 _Rope_const_iterator(const _Rope_const_iterator& __x) argument
951 operator =(const _Rope_const_iterator& __x) argument
1058 _Rope_iterator(const _Rope_iterator& __x) argument
1067 operator =(const _Rope_iterator& __x) argument
1533 operator ()(const rope& __x, const rope& __y) argument
1671 rope(const rope& __x, const allocator_type& __a = allocator_type()) argument
1682 operator =(const rope& __x) argument
1694 push_back(_CharT __x) argument
1714 push_front(_CharT __x) argument
2312 operator ==(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument
2319 operator <(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument
2325 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument
2332 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument
2339 operator +(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument
2346 operator +(ptrdiff_t __n, const _Rope_const_iterator<_CharT,_Alloc>& __x) argument
2352 operator ==(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument
2359 operator <(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument
2365 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument
2372 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument
2380 operator +(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument
2388 operator +(ptrdiff_t __n, const _Rope_iterator<_CharT,_Alloc>& __x) argument
2470 operator ==(const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x, const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y) argument
2494 swap(rope<_CharT,_Alloc>& __x, rope<_CharT,_Alloc>& __y) argument
2500 swap(crope __x, crope __y) argument
2501 swap(wrope __x, wrope __y) argument
[all...]
H A Dstl_raw_storage_iter.h47 explicit raw_storage_iterator(_ForwardIterator __x) : _M_iter(__x) {} argument
H A Dstl_vector.h193 void _M_insert_aux(iterator __position, const _Tp& __x);
247 vector(const vector<_Tp, _Alloc>& __x) argument
248 : _Base(__x.size(), __x.get_allocator())
249 { _M_finish = uninitialized_copy(__x.begin(), __x.end(), _M_start); }
282 vector<_Tp, _Alloc>& operator=(const vector<_Tp, _Alloc>& __x);
333 void push_back(const _Tp& __x) { argument
335 construct(_M_finish, __x);
339 _M_insert_aux(end(), __x); local
349 swap(vector<_Tp, _Alloc>& __x) argument
355 insert(iterator __position, const _Tp& __x) argument
420 resize(size_type __new_size, const _Tp& __x) argument
424 insert(end(), __new_size - size(), __x); local
493 operator ==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
501 operator <(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
510 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) argument
519 operator =(const vector<_Tp, _Alloc>& __x) argument
602 _M_insert_aux(iterator __position, const _Tp& __x) argument
664 insert(iterator __position, size_type __n, const _Tp& __x) argument
[all...]
H A Dstl_iterator.h358 explicit back_insert_iterator(_Container& __x) : container(&__x) {} argument
381 inline back_insert_iterator<_Container> back_inserter(_Container& __x) { argument
382 return back_insert_iterator<_Container>(__x);
397 explicit front_insert_iterator(_Container& __x) : container(&__x) {} argument
420 inline front_insert_iterator<_Container> front_inserter(_Container& __x) { argument
421 return front_insert_iterator<_Container>(__x);
437 insert_iterator(_Container& __x, typename _Container::iterator __i) argument
438 : container(&__x), ite
463 inserter(_Container& __x, _Iterator __i) argument
489 reverse_bidirectional_iterator(_BidirectionalIterator __x) argument
554 operator ==( const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x, const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y) argument
591 reverse_iterator(iterator_type __x) argument
593 reverse_iterator(const _Self& __x) argument
596 reverse_iterator(const reverse_iterator<_Iter>& __x) argument
646 operator ==(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
652 operator <(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
659 operator -(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument
666 operator +(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) argument
696 reverse_iterator(_RandomAccessIterator __x) argument
767 operator ==(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument
778 operator <(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument
789 operator -(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument
799 operator +(_Dist __n, const reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>& __x) argument
867 operator ==(const istream_iterator<_Tp, _Distance>& __x, const istream_iterator<_Tp, _Distance>& __y) argument
[all...]
H A Dstl_deque.h128 _Deque_iterator(_Tp* __x, _Map_pointer __y) argument
129 : _M_cur(__x), _M_first(*__y),
132 _Deque_iterator(const iterator& __x) argument
133 : _M_cur(__x._M_cur), _M_first(__x._M_first),
134 _M_last(__x._M_last), _M_node(__x._M_node) {}
141 difference_type operator-(const _Self& __x) const {
142 return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) +
143 (_M_cur - _M_first) + (__x
568 deque(const deque& __x) argument
587 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
613 operator =(const deque& __x) argument
627 swap(deque& __x) argument
751 insert(iterator position, const value_type& __x) argument
782 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
803 resize(size_type __new_size, const value_type& __x) argument
966 insert(iterator __pos, size_type __n, const value_type& __x) argument
1280 _M_insert_aux(iterator __pos, const value_type& __x) argument
1340 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) argument
1658 operator ==(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument
1666 operator <(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument
1680 swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y) argument
[all...]
H A Dropeimpl.h33 _Rope_iterator_base<_CharT,_Alloc>& __x)
35 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index];
36 size_t __leaf_pos = __x._M_leaf_pos;
37 size_t __pos = __x._M_current_pos;
41 __x._M_buf_start =
43 __x._M_buf_ptr = __x._M_buf_start + (__pos - __leaf_pos);
44 __x._M_buf_end = __x
32 _S_setbuf( _Rope_iterator_base<_CharT,_Alloc>& __x) argument
78 _S_setcache(_Rope_iterator_base<_CharT,_Alloc>& __x) argument
152 _S_setcache_for_incr(_Rope_iterator_base<_CharT,_Alloc>& __x) argument
257 _Rope_const_iterator( const _Rope_iterator<_CharT,_Alloc>& __x) argument
[all...]
H A Dbitset98 void _M_do_and(const _Base_bitset<_Nw,_WordT>& __x) {
100 _M_w[__i] &= __x._M_w[__i];
104 void _M_do_or(const _Base_bitset<_Nw,_WordT>& __x) {
106 _M_w[__i] |= __x._M_w[__i];
110 void _M_do_xor(const _Base_bitset<_Nw,_WordT>& __x) {
112 _M_w[__i] ^= __x._M_w[__i];
138 bool _M_is_equal(const _Base_bitset<_Nw,_WordT>& __x) const {
140 if (_M_w[__i] != __x._M_w[__i])
384 void _M_do_and(const _Base_bitset<1,_WordT>& __x) { _M_w &= __x
[all...]
H A Dpthread_alloc389 pointer address(reference __x) const { return &__x; }
390 const_pointer address(const_reference __x) const { return &__x; }
H A Dstl_alloc.h753 pointer address(reference __x) const { return &__x; }
754 const_pointer address(const_reference __x) const { return &__x; }
831 pointer address(reference __x) const { return &__x; }
832 const_pointer address(const_reference __x) const { return &__x; }
/haiku/src/system/libroot/posix/glibc/math/
H A Dmath_private.h309 extern double __exp1 (double __x, double __xx, double __error);
310 extern double __sin (double __x);
311 extern double __cos (double __x);
312 extern int __branred (double __x, double *__a, double *__aa);
313 extern void __doasin (double __x, double __dx, double __v[]);
314 extern void __dubsin (double __x, double __dx, double __v[]);
315 extern void __dubcos (double __x, double __dx, double __v[]);
316 extern double __halfulp (double __x, double __y);
317 extern double __sin32 (double __x, double __res, double __res1);
318 extern double __cos32 (double __x, doubl
[all...]
/haiku/src/add-ons/kernel/busses/scsi/usb/
H A Dproto_module.h79 #define PTRACE_ALWAYS(__udi, __x...) \
80 { /*if(__udi->b_trace)*/ __udi->trace(true, __x); }
85 #define PTRACE(__udi, __x...) \
86 { if(__udi->b_trace) __udi->trace(false, __x); }
/haiku/src/system/libroot/posix/glibc/math/bits/
H A Dcmathcalls.h102 __MATHCALL (cpow, (_Mdouble_complex_ __x, _Mdouble_complex_ __y));
/haiku/headers/cpp/std/
H A Dstd_valarray.h239 _Tp operator() (_Tp __x, _Tp __y) const { return __x & __y; } argument
243 _Tp operator() (_Tp __x, _Tp __y) const { return __x | __y; } argument
247 _Tp operator() (_Tp __x, _Tp __y) const { return __x ^ __y; } argument
255 _Tp operator() (_Tp __x, _Tp __y) const { return __x << __y; } argument
259 _Tp operator() (_Tp __x, _Tp __y) const { return __x >> __ argument
[all...]
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dgmp-impl.h163 We use __x here to make it possible to accept both mpz_ptr and mpz_t
167 mpz_ptr __x = (X); \
168 __x->_mp_alloc = (NLIMBS); \
169 __x->_mp_d = (mp_ptr) TMP_ALLOC ((NLIMBS) * BYTES_PER_MP_LIMB); \
H A Dstdlib.h511 unsigned short int __x[3]; /* Current state. */ member in struct:drand48_data
743 extern int abs (int __x) __THROW __attribute__ ((__const__));
744 extern long int labs (long int __x) __THROW __attribute__ ((__const__));
748 __extension__ extern long long int llabs (long long int __x)
H A Dlonglong.h1204 UWtype __x; \
1205 __x = (al) + (bl); \
1206 (sh) = (ah) + (bh) + (__x < (al)); \
1207 (sl) = __x; \
1214 UWtype __x; \
1215 __x = (al) - (bl); \
1216 (sh) = (ah) - (bh) - (__x > (al)); \
1217 (sl) = __x; \
/haiku/src/libs/bsd/
H A Dunvis.c55 * __x.
57 #define __arraycount(__x) (sizeof(__x) / sizeof(__x[0]))
/haiku/src/libs/compat/freebsd_network/compat/sys/
H A Dcdefs.h190 const volatile __typeof(((s *)0)->m) *__x = (x); \
191 __DEQUALIFY(s *, (const volatile char *)__x - __offsetof(s, m));\

Completed in 180 milliseconds

12