/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/include/ |
H A D | objalloc.h | 89 ({ struct objalloc *__o = (o); \ 94 (__len <= __o->current_space \ 95 ? (__o->current_ptr += __len, \ 96 __o->current_space -= __len, \ 97 (void *) (__o->current_ptr - __len)) \ 98 : _objalloc_alloc (__o, __len)); })
|
H A D | obstack.h | 314 ({ struct obstack *__o = (OBSTACK); \ 315 (unsigned) (__o->next_free - __o->object_base); }) 319 ({ struct obstack *__o = (OBSTACK); \ 320 (unsigned) (__o->chunk_limit - __o->next_free); }) 324 ({ struct obstack *__o = (OBSTACK); \ 326 if (__o->chunk_limit - __o->next_free < __len) \ 327 _obstack_newchunk (__o, __le [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/include/ |
H A D | objalloc.h | 89 ({ struct objalloc *__o = (o); \ 94 (__len <= __o->current_space \ 95 ? (__o->current_ptr += __len, \ 96 __o->current_space -= __len, \ 97 (void *) (__o->current_ptr - __len)) \ 98 : _objalloc_alloc (__o, __len)); })
|
H A D | obstack.h | 314 ({ struct obstack *__o = (OBSTACK); \ 315 (unsigned) (__o->next_free - __o->object_base); }) 319 ({ struct obstack *__o = (OBSTACK); \ 320 (unsigned) (__o->chunk_limit - __o->next_free); }) 324 ({ struct obstack *__o = (OBSTACK); \ 326 if (__o->chunk_limit - __o->next_free < __len) \ 327 _obstack_newchunk (__o, __le [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/include/ |
H A D | objalloc.h | 89 ({ struct objalloc *__o = (o); \ 94 (__len <= __o->current_space \ 95 ? (__o->current_ptr += __len, \ 96 __o->current_space -= __len, \ 97 (void *) (__o->current_ptr - __len)) \ 98 : _objalloc_alloc (__o, __len)); })
|
H A D | obstack.h | 314 ({ struct obstack *__o = (OBSTACK); \ 315 (unsigned) (__o->next_free - __o->object_base); }) 319 ({ struct obstack *__o = (OBSTACK); \ 320 (unsigned) (__o->chunk_limit - __o->next_free); }) 324 ({ struct obstack *__o = (OBSTACK); \ 326 if (__o->chunk_limit - __o->next_free < __len) \ 327 _obstack_newchunk (__o, __le [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/include/ |
H A D | objalloc.h | 89 ({ struct objalloc *__o = (o); \ 94 (__len <= __o->current_space \ 95 ? (__o->current_ptr += __len, \ 96 __o->current_space -= __len, \ 97 (void *) (__o->current_ptr - __len)) \ 98 : _objalloc_alloc (__o, __len)); })
|
H A D | obstack.h | 314 ({ struct obstack *__o = (OBSTACK); \ 315 (unsigned) (__o->next_free - __o->object_base); }) 319 ({ struct obstack *__o = (OBSTACK); \ 320 (unsigned) (__o->chunk_limit - __o->next_free); }) 324 ({ struct obstack *__o = (OBSTACK); \ 326 if (__o->chunk_limit - __o->next_free < __len) \ 327 _obstack_newchunk (__o, __le [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gettext/gettext-tools/lib/ |
H A D | obstack.h | 275 ({ struct obstack const *__o = (OBSTACK); \ 276 (unsigned) (__o->next_free - __o->object_base); }) 280 ({ struct obstack const *__o = (OBSTACK); \ 281 (unsigned) (__o->chunk_limit - __o->next_free); }) 285 ({ struct obstack *__o = (OBSTACK); \ 287 if (__o->chunk_limit - __o->next_free < __len) \ 288 _obstack_newchunk (__o, __le [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/profile/impl/ |
H A D | profiler_container_size.h | 64 __container_size_info(const __container_size_info& __o); 72 void __merge(const __container_size_info& __o); 139 inline void __container_size_info::__merge(const __container_size_info& __o) argument 141 _M_init = std::max(_M_init, __o._M_init); 142 _M_max = std::max(_M_max, __o._M_max); 143 _M_item_max = std::max(_M_item_max, __o._M_item_max); 144 _M_min = std::min(_M_min, __o._M_min); 145 _M_item_min = std::min(_M_item_min, __o._M_item_min); 146 _M_total += __o._M_total; 147 _M_item_total += __o 159 __container_size_info( const __container_size_info& __o) argument 179 __container_size_stack_info(const __container_size_info& __o) argument [all...] |
H A D | profiler_list_to_vector.h | 70 __list2vector_info(const __list2vector_info& __o); 71 void __merge(const __list2vector_info& __o); 99 inline __list2vector_info::__list2vector_info(const __list2vector_info& __o) argument 100 : __object_info_base(__o) 102 _M_shift_count = __o._M_shift_count; 103 _M_iterate = __o._M_iterate; 104 _M_vector_cost = __o._M_vector_cost; 105 _M_list_cost = __o._M_list_cost; 106 _M_valid = __o._M_valid; 107 _M_resize = __o 119 __merge(const __list2vector_info& __o) argument 143 __list2vector_stack_info(const __list2vector_info& __o) argument [all...] |
H A D | profiler_vector_to_list.h | 67 __vector2list_info(const __vector2list_info& __o); 68 void __merge(const __vector2list_info& __o); 97 inline __vector2list_info::__vector2list_info(const __vector2list_info& __o) argument 98 : __object_info_base(__o) 100 _M_shift_count = __o._M_shift_count; 101 _M_iterate = __o._M_iterate; 102 _M_vector_cost = __o._M_vector_cost; 103 _M_list_cost = __o._M_list_cost; 104 _M_valid = __o._M_valid; 105 _M_resize = __o 108 __merge(const __vector2list_info& __o) argument 142 __vector2list_stack_info(const __vector2list_info& __o) argument [all...] |
H A D | profiler_hash_func.h | 68 void __merge(const __hashfunc_info& __o); 80 inline __hashfunc_info::__hashfunc_info(const __hashfunc_info& __o) argument 81 : __object_info_base(__o) 83 _M_longest_chain = __o._M_longest_chain; 84 _M_accesses = __o._M_accesses; 85 _M_hops = __o._M_hops; 88 inline void __hashfunc_info::__merge(const __hashfunc_info& __o) argument 90 _M_longest_chain = std::max(_M_longest_chain, __o._M_longest_chain); 91 _M_accesses += __o._M_accesses; 92 _M_hops += __o 106 __hashfunc_stack_info(const __hashfunc_info& __o) argument [all...] |
H A D | profiler_map_to_unordered_map.h | 123 inline __map2umap_info::__map2umap_info(const __map2umap_info& __o) argument 124 : __object_info_base(__o), 125 _M_insert(__o._M_insert), 126 _M_erase(__o._M_erase), 127 _M_find(__o._M_find), 128 _M_iterate(__o._M_iterate), 129 _M_map_cost(__o._M_map_cost), 130 _M_umap_cost(__o._M_umap_cost), 131 _M_valid(__o._M_valid) 134 inline void __map2umap_info::__merge(const __map2umap_info& __o) argument [all...] |
H A D | profiler_list_to_slist.h | 63 __list2slist_info(const __list2slist_info& __o) : __object_info_base(__o) argument 64 { _M_rewind = __o._M_rewind; _M_operations = __o._M_operations; } 74 void __merge(const __list2slist_info& __o) {}; argument 89 __list2slist_stack_info(const __list2slist_info& __o) argument 90 : __list2slist_info(__o) {}
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/src/ |
H A D | valarray-inst.cc | 64 __gslice_to_index(size_t __o, const valarray<size_t>& __l, argument 82 __i[__j] = __o; 85 __o += __s[__n - 1]; 91 __o -= __s[__k2] * __l[__k2]; 95 __o += __s[__k2 - 1]; 100 gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __l, argument 102 : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s), 104 { __gslice_to_index(__o, __l, __s, _M_index); }
|
/netbsd-6-1-5-RELEASE/gnu/dist/grep/lib/ |
H A D | obstack.h | 367 ({ struct obstack *__o = (OBSTACK); \ 368 (unsigned) (__o->next_free - __o->object_base); }) 372 ({ struct obstack *__o = (OBSTACK); \ 373 (unsigned) (__o->chunk_limit - __o->next_free); }) 377 ({ struct obstack *__o = (OBSTACK); \ 379 if (__o->chunk_limit - __o->next_free < __len) \ 380 _obstack_newchunk (__o, __le [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
H A D | for_each_selectors.h | 55 * @param __o Operator. 59 operator()(_Op& __o, _It __i) argument 61 __o(*__i); 71 * @param __o Operator. 75 operator()(_Op& __o, _It __i) argument 77 *__i = __o(); 103 * @param __o Operator. 107 operator()(_Op& __o, _It __i) argument 109 *__i.second = __o(*__i.first); 119 * @param __o Operato 123 operator ()(_Op& __o, _It __i) argument 170 operator ()(_Op& __o, _It __i) argument 202 operator ()(_Op& __o, _It __i) argument 216 operator ()(_Op __o, _It __i) argument 261 operator ()(_Op __o, _It __i) argument 274 operator ()(_Op& __o, _It __i) argument [all...] |
H A D | par_loop.h | 49 * @param __o User-supplied functor (comparator, predicate, adding 68 _Op __o, _Fu& __f, _Red __r, 103 new(__reduct) _Result(__f(__o, __begin + __start)); 111 *__reduct = __r(*__reduct, __f(__o, __begin + __start)); 127 return __o; 67 __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end, _Op __o, _Fu& __f, _Red __r, _Result __base, _Result& __output, typename std::iterator_traits<_RAIter>::difference_type __bound) argument
|
H A D | omp_loop.h | 49 * @param __o User-supplied functor (comparator, predicate, adding 68 _Op __o, _Fu& __f, _Red __r, 98 __f(__o, __begin+__pos)); 110 return __o; 67 __for_each_template_random_access_omp_loop(_RAIter __begin, _RAIter __end, _Op __o, _Fu& __f, _Red __r, _Result __base, _Result& __output, typename std::iterator_traits<_RAIter>::difference_type __bound) argument
|
H A D | omp_loop_static.h | 48 * @param __o User-supplied functor (comparator, predicate, adding 67 _RAIter __end, _Op __o, 98 __f(__o, __begin+__pos)); 110 return __o; 66 __for_each_template_random_access_omp_loop_static(_RAIter __begin, _RAIter __end, _Op __o, _Fu& __f, _Red __r, _Result __base, _Result& __output, typename std::iterator_traits<_RAIter>::difference_type __bound) argument
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20001203-2.c | 65 struct obstack *__o = (__h); 67 if (__o->chunk_limit - __o->next_free < __len) 68 _obstack_newchunk (__o, __len); 69 __o->next_free += __len; (void) 0;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/libsupc++/ |
H A D | exception_ptr.h | 100 exception_ptr(exception_ptr&& __o) throw() argument 101 : _M_exception_object(__o._M_exception_object) 102 { __o._M_exception_object = 0; } 110 operator=(exception_ptr&& __o) throw() argument 112 exception_ptr(static_cast<exception_ptr&&>(__o)).swap(*this);
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20001203-2.c | 65 struct obstack *__o = (__h); 67 if (__o->chunk_limit - __o->next_free < __len) 68 _obstack_newchunk (__o, __len); 69 __o->next_free += __len; (void) 0;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/src/ |
H A D | valarray-inst.cc | 68 __gslice_to_index(size_t __o, const valarray<size_t>& __l, argument 90 size_t __a = __o; 110 gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __l, argument 112 : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s), 114 { __gslice_to_index(__o, __l, __s, _M_index); }
|