Searched refs:__n1 (Results 1 - 4 of 4) sorted by relevance

/haiku/headers/cpp/
H A Dstl_slist.h689 _Node* __n1 = (_Node*) _M_head._M_next; local
691 while (__n1 && __n2) {
692 __n1->_M_data = __n2->_M_data;
693 __p1 = __n1;
694 __n1 = (_Node*) __n1->_M_next;
749 _Node* __n1 = (_Node*) _SL1._M_head._M_next; local
751 while (__n1 && __n2 && __n1->_M_data == __n2->_M_data) {
752 __n1
820 _Node_base* __n1 = &_M_head; local
893 _Node_base* __n1 = &_M_head; local
[all...]
H A Dbitset203 for (size_t __n1 = 0; __n1 < __n; ++__n1)
204 _M_w[__n1] = static_cast<_WordT>(0);
221 for (size_t __n1 = __limit + 1; __n1 < _Nw; ++__n1)
222 _M_w[__n1] = static_cast<_WordT>(0);
H A Dstl_list.h522 _Node* __n1 = (_Node*) __e1->_M_next; local
524 for ( ; __n1 != __e1 && __n2 != __e2 ;
525 __n1 = (_Node*) __n1->_M_next, __n2 = (_Node*) __n2->_M_next)
526 if (__n1->_M_data != __n2->_M_data)
528 return __n1 == __e1 && __n2 == __e2;
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dlonglong.h892 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
896 : "r" ((USItype) (__n1)), \
1017 #define udiv_qrnnd(__q, __r, __n1, __n0, __d) \
1045 "1" ((USItype) (__n1)), \

Completed in 33 milliseconds