Searched refs:__n (Results 1 - 25 of 175) sorted by relevance

1234567

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/
H A Dpr37742.C4 void* __valarray_get_memory(size_t __n);
6 __valarray_get_storage(size_t __n) argument
8 return static_cast<int* __restrict__>(__valarray_get_memory(__n));
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/
H A Dpr18425.c8 _M_fill_insert(unsigned int __n) argument
12 for (; __n > 0; --__n, ++__new_start)
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/charset/
H A Dasm2.c11 memmove (void *__dest, __const void *__src, size_t __n) argument
20 : "0" (__n), "1" (__src), "2" (__dest)
29 : "0" (__n), "1" (__n - 1 + (const char *) __src),
30 "2" (__n - 1 + (char *) __dest)
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/charset/
H A Dasm3.c11 memmove (void *__dest, __const void *__src, size_t __n) argument
20 : "0" (__n), "1" (__src), "2" (__dest)
29 : "0" (__n), "1" (__n - 1 + (const char *) __src),
30 "2" (__n - 1 + (char *) __dest)
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/warn/
H A DWparentheses-4.C9 cmath_power(_Tp __x, unsigned int __n) argument
11 while (__n >>= 1)
/haiku-buildtools/gcc/gmp/tune/
H A Dmodlinv.c36 mp_limb_t __n = (n); \
38 ASSERT ((__n & 1) == 1); \
39 __inv = binvert_limb_table[(__n&0xFF)/2]; /* 8 */ \
40 __inv = (1 - __n * __inv) * __inv + __inv; /* 16 */ \
41 __inv = (1 - __n * __inv) * __inv + __inv; /* 32 */ \
42 ASSERT (__inv * __n == 1); \
50 mp_limb_t __n = (n); \
52 ASSERT ((__n & 1) == 1); \
53 __inv = binvert_limb_table[(__n&0xFF)/2]; /* 8 */ \
54 __inv = (1 - __n * __in
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/
H A Dstd1.C6 __SIZE_TYPE__ __n) throw ();
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tm/
H A Dcgraph_edge.C4 template<typename _InputIterator, typename _Distance> inline void advance(_InputIterator& __i, _Distance __n) argument
6 if (__n > 0)
7 while (__n--)
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dcompiletime_settings.h41 * @param __n Input size.
44 #define _GLIBCXX_CALL(__n)
47 #define _GLIBCXX_CALL(__n) \
48 printf(" %__s:\niam = %d, __n = %ld, __num_threads = %d\n", \
49 __PRETTY_FUNCTION__, omp_get_thread_num(), (__n), __get_max_threads());
H A Dequally_split.h39 * splitting positions when splitting the range [0,__n) into parts of
42 * @param __n Number of elements
48 __equally_split(_DifferenceType __n, _ThreadIndex __num_threads, argument
51 _DifferenceType __chunk_length = __n / __num_threads;
52 _DifferenceType __num_longer_chunks = __n % __num_threads;
60 *__s++ = __n;
69 * @param __n Number of elements
75 __equally_split_point(_DifferenceType __n, argument
79 _DifferenceType __chunk_length = __n / __num_threads;
80 _DifferenceType __num_longer_chunks = __n
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_iterator_base_funcs.h79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) argument
127 _GLIBCXX_DEBUG_ASSERT(__n >= 0);
128 while (__n--)
134 __advance(_BidirectionalIterator& __i, _Distance __n, argument
140 if (__n > 0)
141 while (__n--)
144 while (__n
150 __advance(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) argument
173 advance(_InputIterator& __i, _Distance __n) argument
[all...]
H A Dostream_insert.h45 const _CharT* __s, streamsize __n)
50 const streamsize __put = __out.rdbuf()->sputn(__s, __n);
51 if (__put != __n)
57 __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n) argument
63 for (; __n > 0; --__n)
77 const _CharT* __s, streamsize __n)
88 if (__w > __n)
94 __ostream_fill(__out, __w - __n);
96 __ostream_write(__out, __s, __n);
44 __ostream_write(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) argument
76 __ostream_insert(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) argument
[all...]
H A Dchar_traits.h104 compare(const char_type* __s1, const char_type* __s2, std::size_t __n);
110 find(const char_type* __s, std::size_t __n, const char_type& __a);
113 move(char_type* __s1, const char_type* __s2, std::size_t __n);
116 copy(char_type* __s1, const char_type* __s2, std::size_t __n);
119 assign(char_type* __s, std::size_t __n, char_type __a);
145 compare(const char_type* __s1, const char_type* __s2, std::size_t __n) argument
147 for (std::size_t __i = 0; __i < __n; ++__i)
169 find(const char_type* __s, std::size_t __n, const char_type& __a) argument
171 for (std::size_t __i = 0; __i < __n; ++__i)
180 move(char_type* __s1, const char_type* __s2, std::size_t __n) argument
189 copy(char_type* __s1, const char_type* __s2, std::size_t __n) argument
199 assign(char_type* __s, std::size_t __n, char_type __a) argument
258 compare(const char_type* __s1, const char_type* __s2, size_t __n) argument
270 find(const char_type* __s, size_t __n, const char_type& __a) argument
278 move(char_type* __s1, const char_type* __s2, size_t __n) argument
286 copy(char_type* __s1, const char_type* __s2, size_t __n) argument
294 assign(char_type* __s, size_t __n, char_type __a) argument
349 compare(const char_type* __s1, const char_type* __s2, size_t __n) argument
361 find(const char_type* __s, size_t __n, const char_type& __a) argument
369 move(char_type* __s1, const char_type* __s2, size_t __n) argument
377 copy(char_type* __s1, const char_type* __s2, size_t __n) argument
385 assign(char_type* __s, size_t __n, char_type __a) argument
448 compare(const char_type* __s1, const char_type* __s2, size_t __n) argument
468 find(const char_type* __s, size_t __n, const char_type& __a) argument
477 move(char_type* __s1, const char_type* __s2, size_t __n) argument
486 copy(char_type* __s1, const char_type* __s2, size_t __n) argument
495 assign(char_type* __s, size_t __n, char_type __a) argument
545 compare(const char_type* __s1, const char_type* __s2, size_t __n) argument
565 find(const char_type* __s, size_t __n, const char_type& __a) argument
574 move(char_type* __s1, const char_type* __s2, size_t __n) argument
583 copy(char_type* __s1, const char_type* __s2, size_t __n) argument
592 assign(char_type* __s, size_t __n, char_type __a) argument
[all...]
H A Dvalarray_array.h52 __valarray_get_memory(size_t __n) argument
53 { return operator new(__n); }
57 __valarray_get_storage(size_t __n) argument
60 (std::__valarray_get_memory(__n * sizeof(_Tp)));
166 // copy-construct raw array [__o, *) from strided array __a[<__n : __s>]
169 __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n, argument
173 while (__n--)
179 while (__n--)
186 // copy-construct raw array [__o, *) from indexed array __a[__i[<__n>]]
191 _Tp* __restrict__ __o, size_t __n)
189 __valarray_copy_construct(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __o, size_t __n) argument
217 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) argument
226 __valarray_fill(_Tp* __restrict__ __a, size_t __n, size_t __s, const _Tp& __t) argument
236 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) argument
249 _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) argument
260 _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) argument
267 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) argument
276 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) argument
286 __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) argument
297 __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1, _Tp* __restrict__ __dst, size_t __s2) argument
307 __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) argument
318 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) argument
329 __valarray_copy(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) argument
421 __valarray_copy_construct(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument
429 __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) argument
435 __valarray_fill(_Array<_Tp> __a, size_t __n, const _Tp& __t) argument
440 __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) argument
445 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument
452 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) argument
458 __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) argument
464 __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) argument
471 __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1, _Array<_Tp> __b, size_t __s2) argument
478 __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument
485 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) argument
493 __valarray_copy(_Array<_Tp> __src, size_t __n, _Array<size_t> __i, _Array<_Tp> __dst, _Array<size_t> __j) argument
502 _Array(size_t __n) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/config/locale/generic/
H A Dcollate_members.cc52 size_t __n) const throw()
53 { return strxfrm(__to, __from, __n); }
68 size_t __n) const throw()
69 { return wcsxfrm(__to, __from, __n); }
/haiku-buildtools/gcc/libstdc++-v3/config/locale/gnu/
H A Dcollate_members.cc52 size_t __n) const throw()
53 { return __strxfrm_l(__to, __from, __n, _M_c_locale_collate); }
68 size_t __n) const throw()
69 { return __wcsxfrm_l(__to, __from, __n, _M_c_locale_collate); }
/haiku-buildtools/legacy/gcc/libstdc++/std/
H A Dvalarray_array.h44 // fill plain array __a[<__n>] with __t
47 __valarray_fill (_Tp* __restrict__ __a, size_t __n, const _Tp& __t) argument
48 { while (__n--) *__a++ = __t; }
50 // fill strided array __a[<__n-1 : __s>] with __t
53 __valarray_fill (_Tp* __restrict__ __a, size_t __n, argument
55 { for (size_t __i=0; __i<__n; ++__i, __a+=__s) *__a = __t; }
57 // fill indirect array __a[__i[<__n>]] with __i
61 size_t __n, const _Tp& __t)
62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; }
64 // copy plain array __a[<__n>] i
60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) argument
67 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) argument
74 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) argument
81 __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) argument
88 __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) argument
96 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) argument
121 __valarray_fill(_Array<_Tp> __a, size_t __n, const _Tp& __t) argument
126 __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) argument
131 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument
137 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) argument
142 __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) argument
147 __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) argument
152 __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument
158 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) argument
164 _Array(size_t __n) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/src/c++98/
H A Dpool_allocator.cc60 // heap too much. Assume that __n is properly aligned. We hold the
63 __pool_alloc_base::_M_allocate_chunk(size_t __n, int& __nobjs) argument
66 size_t __total_bytes = __n * __nobjs;
75 else if (__bytes_left >= __n)
77 __nobjs = (int)(__bytes_left / __n);
78 __total_bytes = __n * __nobjs;
104 size_t __i = __n;
114 return _M_allocate_chunk(__n, __nobjs);
125 return _M_allocate_chunk(__n, __nobjs);
129 // Returns an object of size __n, an
133 _M_refill(size_t __n) argument
[all...]
H A Dstreambuf.cc46 const streamsize __n = __sbin->egptr() - __sbin->gptr(); local
47 if (__n > 1)
49 const streamsize __wrote = __sbout->sputn(__sbin->gptr(), __n);
52 if (__wrote < __n)
86 const streamsize __n = __sbin->egptr() - __sbin->gptr(); local
87 if (__n > 1)
89 const streamsize __wrote = __sbout->sputn(__sbin->gptr(), __n);
92 if (__wrote < __n)
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/
H A Dpr48695.C17 int *_M_allocate (size_t __n) argument
19 return __n != 0 ? new int[__n] : 0;
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/rtti/
H A Dtinfo1.C16 explicit type_info(const char *__n): __name(__n) { } argument
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr62090-2.c7 snprintf (char *__restrict __s, size_t __n, const char *__restrict __fmt, ...) argument
9 return __builtin___snprintf_chk (__s, __n, 2 - 1,
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_vector.h67 _Tp* _M_allocate(size_t __n) argument
68 { return _M_data_allocator.allocate(__n); }
69 void _M_deallocate(_Tp* __p, size_t __n) argument
70 { if (__p) _M_data_allocator.deallocate(__p, __n); }
92 _Tp* _M_allocate(size_t __n) argument
93 { return _Alloc_type::allocate(__n); }
94 void _M_deallocate(_Tp* __p, size_t __n) argument
95 { _Alloc_type::deallocate(__p, __n);}
109 _Vector_base(size_t __n, const allocator_type& __a) : _Base(__a) { argument
110 _M_start = _M_allocate(__n);
218 operator [](size_type __n) argument
224 vector(size_type __n, const _Tp& __value, const allocator_type& __a = allocator_type()) argument
229 vector(size_type __n) argument
247 _M_initialize_aux(_Integer __n, _Integer __value, __true_type) argument
269 reserve(size_type __n) argument
297 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
342 size_type __n = __position - begin(); local
352 size_type __n = __position - begin(); local
370 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, __true_type) argument
419 _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last) argument
430 _M_allocate_and_copy(size_type __n, const_iterator __first, const_iterator __last) argument
457 size_type __n = 0; local
530 assign(size_t __n, const value_type& __val) argument
650 insert(iterator __position, size_type __n, const _Tp& __x) argument
717 size_type __n = 0; local
769 size_type __n = 0; local
[all...]
H A Dstl_hashtable.h91 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) argument
92 : _M_cur(__n), _M_ht(__tab) {}
130 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) argument
131 : _M_cur(__n), _M_ht(__tab) {}
159 inline unsigned long __stl_next_prime(unsigned long __n) argument
163 const unsigned long* pos = lower_bound(__first, __last, __n);
247 hashtable(size_type __n,
259 _M_initialize_buckets(__n); variable
262 hashtable(size_type __n,
273 _M_initialize_buckets(__n); variable
402 size_type __n = 0; local
413 size_type __n = 0; local
423 size_type __n = __l - __f; local
431 size_type __n = __l - __f; local
439 size_type __n = 0; local
448 size_type __n = 0; local
460 size_type __n = _M_bkt_num_key(__key); local
471 size_type __n = _M_bkt_num_key(__key); local
482 const size_type __n = _M_bkt_num_key(__key); local
511 _M_initialize_buckets(size_type __n) argument
541 _Node* __n = _M_get_node(); local
550 _M_delete_node(_Node* __n) argument
702 const size_type __n = _M_bkt_num(__obj); local
721 const size_type __n = _M_bkt_num(__obj); local
746 size_type __n = _M_bkt_num(__obj); local
766 const size_type __n = _M_bkt_num_key(__key); local
789 const size_type __n = _M_bkt_num_key(__key); local
815 const size_type __n = _M_bkt_num_key(__key); local
849 const size_type __n = _M_bkt_num(__p->_M_val); local
922 const size_type __n = _M_next_size(__num_elements_hint); local
957 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last) argument
979 _M_erase_bucket(const size_type __n, _Node* __last) argument
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_ios/cons/char/
H A D3.cc54 compare(const char_type* __s1, const char_type* __s2, size_t __n) argument
56 for (size_t __i = 0; __i < __n; ++__i)
72 find(const char_type* __s, size_t __n, const char_type& __a) argument
74 for (const char_type* __p = __s; size_t(__p - __s) < __n; ++__p)
80 move(char_type* __s1, const char_type* __s2, size_t __n) argument
81 { return (char_type*) memmove(__s1, __s2, __n * sizeof(char_type)); }
84 copy(char_type* __s1, const char_type* __s2, size_t __n) argument
85 { return (char_type*) memcpy(__s1, __s2, __n * sizeof(char_type)); }
88 assign(char_type* __s, size_t __n, char_type __a) argument
90 for (char_type* __p = __s; __p < __s + __n;
[all...]

Completed in 231 milliseconds

1234567