Searched refs:__count (Results 1 - 10 of 10) sorted by relevance

/haiku/headers/cpp/
H A Dstl_uninitialized.h101 __uninitialized_copy_n(_InputIter __first, _Size __count, argument
107 for ( ; __count > 0 ; --__count, ++__first, ++__cur)
116 __uninitialized_copy_n(_RandomAccessIter __first, _Size __count, argument
119 _RandomAccessIter __last = __first + __count;
127 __uninitialized_copy_n(_InputIter __first, _Size __count, argument
129 return __uninitialized_copy_n(__first, __count, __result,
135 uninitialized_copy_n(_InputIter __first, _Size __count, argument
137 return __uninitialized_copy_n(__first, __count, __result,
H A Dstl_algobase.h309 pair<_InputIter, _OutputIter> __copy_n(_InputIter __first, _Size __count, argument
312 for ( ; __count > 0; --__count) {
322 __copy_n(_RAIter __first, _Size __count, argument
325 _RAIter __last = __first + __count;
331 __copy_n(_InputIter __first, _Size __count, _OutputIter __result) { argument
332 return __copy_n(__first, __count, __result,
338 copy_n(_InputIter __first, _Size __count, _OutputIter __result) { argument
339 return __copy_n(__first, __count, __result);
H A Dropeimpl.h540 size_t __count = __r->_M_refcount;
542 __stl_assert(__count >= 1);
543 if (__count > 1) return _S_concat_char_iter(__r, __s, __slen);
H A Dstl_algo.h374 // search_n. Search for __count consecutive copies of __val.
378 _Integer __count, const _Tp& __val) {
379 if (__count <= 0)
384 _Integer __n = __count - 1;
402 _Integer __count, const _Tp& __val,
404 if (__count <= 0)
413 _Integer __n = __count - 1;
377 search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp& __val) argument
401 search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp& __val, _BinaryPred __binary_pred) argument
/haiku/src/system/libroot/posix/glibc/iconv/
H A Dloop.c357 for (inlen = 0; inlen < (size_t) (state->__count & 7); ++inlen)
408 assert (inptr - bytebuf > (state->__count & 7));
410 *inptrp += inptr - bytebuf - (state->__count & 7);
419 state->__count &= ~7;
428 *inptrp += inend - bytebuf - (state->__count & 7);
H A Dskeleton.c126 * Bits 2..0 of '__count' contain the number of lookahead input bytes
130 * Bits 31..3 of '__count' are module dependent shift state.
138 When __value contains lookahead, __count must not be zero, because
140 defined as a (__count == 0) test -- must reflect this.
553 && consume_incomplete && (data->__statep->__count & 7) != 0)
791 data->__statep->__count &= ~7;
792 data->__statep->__count |= cnt;
/haiku/headers/build/gcc-2.95.3/
H A Dva-pyr.h57 __voidptr __stackp,__regp,__count;
56 __voidptr __stackp,__regp,__count; member in struct:__va_regs
/haiku/src/system/libroot/posix/glibc/stdio-common/
H A Dprintf-parse.h108 ps->__count = 0;
H A Dvfprintf.c1188 len = str2 - string - (ps.__count); \
/haiku/src/system/libroot/posix/glibc/wcsmbs/
H A Dwchar.h74 int __count; member in struct:__anon1

Completed in 120 milliseconds