/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/profile/impl/ |
profiler_container_size.h | 58 __container_size_info(const __container_size_info& __o) 59 : __object_info_base(__o), _M_init(__o._M_init), _M_max(__o._M_max), 60 _M_min(__o._M_min), _M_total(__o._M_total), 61 _M_item_min(__o._M_item_min), _M_item_max(__o._M_item_max), 62 _M_item_total(__o._M_item_total), _M_count(__o._M_count) [all...] |
profiler_hash_func.h | 54 __hashfunc_info(const __hashfunc_info& __o) 55 : __object_info_base(__o), _M_longest_chain(__o._M_longest_chain), 56 _M_accesses(__o._M_accesses), _M_hops(__o._M_hops) { } 65 __merge(const __hashfunc_info& __o) 67 _M_longest_chain = std::max(_M_longest_chain, __o._M_longest_chain); 68 _M_accesses += __o._M_accesses; 69 _M_hops += __o._M_hops; 106 __hashfunc_stack_info(const __hashfunc_info& __o) [all...] |
profiler_list_to_vector.h | 64 __list2vector_info(const __list2vector_info& __o) 65 : __object_info_base(__o), _M_shift_count(__o._M_shift_count), 66 _M_iterate(__o._M_iterate), _M_resize(__o._M_resize), 67 _M_list_cost(__o._M_list_cost), _M_vector_cost(__o._M_vector_cost), 68 _M_valid(__o._M_valid), _M_max_size(__o._M_max_size) { } 71 __merge(const __list2vector_info& __o) [all...] |
profiler_list_to_slist.h | 58 __list2slist_info(const __list2slist_info& __o) 59 : __object_info_base(__o), _M_rewind(__o._M_rewind), 60 _M_operations(__o._M_operations) { } 114 __list2slist_stack_info(const __list2slist_info& __o) 115 : __list2slist_info(__o) { }
|
profiler_map_to_unordered_map.h | 87 __map2umap_info(const __map2umap_info& __o) 88 : __object_info_base(__o), _M_insert(__o._M_insert), 89 _M_erase(__o._M_erase), _M_find(__o._M_find), 90 _M_iterate(__o._M_iterate), _M_umap_cost(__o._M_umap_cost), 91 _M_map_cost(__o._M_map_cost), _M_valid(__o._M_valid) { } 94 __merge(const __map2umap_info& __o) [all...] |
profiler_vector_to_list.h | 61 __vector2list_info(const __vector2list_info& __o) 62 : __object_info_base(__o), _M_shift_count(__o._M_shift_count), 63 _M_iterate(__o._M_iterate), _M_resize(__o._M_resize), 64 _M_list_cost(__o._M_list_cost), _M_vector_cost(__o._M_vector_cost), 65 _M_valid(__o._M_valid) { } 68 __merge(const __vector2list_info& __o) 70 _M_shift_count += __o._M_shift_count [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/profile/impl/ |
profiler_container_size.h | 58 __container_size_info(const __container_size_info& __o) 59 : __object_info_base(__o), _M_init(__o._M_init), _M_max(__o._M_max), 60 _M_min(__o._M_min), _M_total(__o._M_total), 61 _M_item_min(__o._M_item_min), _M_item_max(__o._M_item_max), 62 _M_item_total(__o._M_item_total), _M_count(__o._M_count) [all...] |
profiler_hash_func.h | 54 __hashfunc_info(const __hashfunc_info& __o) 55 : __object_info_base(__o), _M_longest_chain(__o._M_longest_chain), 56 _M_accesses(__o._M_accesses), _M_hops(__o._M_hops) { } 65 __merge(const __hashfunc_info& __o) 67 _M_longest_chain = std::max(_M_longest_chain, __o._M_longest_chain); 68 _M_accesses += __o._M_accesses; 69 _M_hops += __o._M_hops; 106 __hashfunc_stack_info(const __hashfunc_info& __o) [all...] |
profiler_list_to_vector.h | 64 __list2vector_info(const __list2vector_info& __o) 65 : __object_info_base(__o), _M_shift_count(__o._M_shift_count), 66 _M_iterate(__o._M_iterate), _M_resize(__o._M_resize), 67 _M_list_cost(__o._M_list_cost), _M_vector_cost(__o._M_vector_cost), 68 _M_valid(__o._M_valid), _M_max_size(__o._M_max_size) { } 71 __merge(const __list2vector_info& __o) [all...] |
profiler_list_to_slist.h | 58 __list2slist_info(const __list2slist_info& __o) 59 : __object_info_base(__o), _M_rewind(__o._M_rewind), 60 _M_operations(__o._M_operations) { } 114 __list2slist_stack_info(const __list2slist_info& __o) 115 : __list2slist_info(__o) { }
|
profiler_map_to_unordered_map.h | 87 __map2umap_info(const __map2umap_info& __o) 88 : __object_info_base(__o), _M_insert(__o._M_insert), 89 _M_erase(__o._M_erase), _M_find(__o._M_find), 90 _M_iterate(__o._M_iterate), _M_umap_cost(__o._M_umap_cost), 91 _M_map_cost(__o._M_map_cost), _M_valid(__o._M_valid) { } 94 __merge(const __map2umap_info& __o) [all...] |
profiler_vector_to_list.h | 61 __vector2list_info(const __vector2list_info& __o) 62 : __object_info_base(__o), _M_shift_count(__o._M_shift_count), 63 _M_iterate(__o._M_iterate), _M_resize(__o._M_resize), 64 _M_list_cost(__o._M_list_cost), _M_vector_cost(__o._M_vector_cost), 65 _M_valid(__o._M_valid) { } 68 __merge(const __vector2list_info& __o) 70 _M_shift_count += __o._M_shift_count [all...] |
/external/bison/lib/ |
obstack.h | 271 ({ struct obstack const *__o = (OBSTACK); \ 272 (unsigned) (__o->next_free - __o->object_base); }) 276 ({ struct obstack const *__o = (OBSTACK); \ 277 (unsigned) (__o->chunk_limit - __o->next_free); }) 281 ({ struct obstack *__o = (OBSTACK); \ 283 if (__o->chunk_limit - __o->next_free < __len) \ 284 _obstack_newchunk (__o, __len); [all...] |
/ndk/sources/host-tools/sed-4.2.1/lib/ |
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, __len); [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
obstack.h | 272 ({ struct obstack const *__o = (OBSTACK); \ 273 (unsigned) (__o->next_free - __o->object_base); }) 277 ({ struct obstack const *__o = (OBSTACK); \ 278 (unsigned) (__o->chunk_limit - __o->next_free); }) 282 ({ struct obstack *__o = (OBSTACK); \ 284 if (__o->chunk_limit - __o->next_free < __len) \ 285 _obstack_newchunk (__o, __len); [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/ |
obstack.h | 272 ({ struct obstack const *__o = (OBSTACK); \ 273 (unsigned) (__o->next_free - __o->object_base); }) 277 ({ struct obstack const *__o = (OBSTACK); \ 278 (unsigned) (__o->chunk_limit - __o->next_free); }) 282 ({ struct obstack *__o = (OBSTACK); \ 284 if (__o->chunk_limit - __o->next_free < __len) \ 285 _obstack_newchunk (__o, __len); [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/ |
obstack.h | 272 ({ struct obstack const *__o = (OBSTACK); \ 273 (unsigned) (__o->next_free - __o->object_base); }) 277 ({ struct obstack const *__o = (OBSTACK); \ 278 (unsigned) (__o->chunk_limit - __o->next_free); }) 282 ({ struct obstack *__o = (OBSTACK); \ 284 if (__o->chunk_limit - __o->next_free < __len) \ 285 _obstack_newchunk (__o, __len); [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
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, __len); [all...] |
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
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, __len); [all...] |
/prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
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, __len); [all...] |
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
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, __len); [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ |
exception_ptr.h | 112 exception_ptr(exception_ptr&& __o) throw() 113 : _M_exception_object(__o._M_exception_object) 114 { __o._M_exception_object = 0; } 122 operator=(exception_ptr&& __o) throw() 124 exception_ptr(static_cast<exception_ptr&&>(__o)).swap(*this);
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
exception_ptr.h | 97 exception_ptr(exception_ptr&& __o) throw() 98 : _M_exception_object(__o._M_exception_object) 99 { __o._M_exception_object = 0; } 112 operator=(exception_ptr&& __o) throw() 114 exception_ptr(static_cast<exception_ptr&&>(__o)).swap(*this);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
exception_ptr.h | 97 exception_ptr(exception_ptr&& __o) throw() 98 : _M_exception_object(__o._M_exception_object) 99 { __o._M_exception_object = 0; } 112 operator=(exception_ptr&& __o) throw() 114 exception_ptr(static_cast<exception_ptr&&>(__o)).swap(*this);
|
/prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ |
exception_ptr.h | 112 exception_ptr(exception_ptr&& __o) throw() 113 : _M_exception_object(__o._M_exception_object) 114 { __o._M_exception_object = 0; } 122 operator=(exception_ptr&& __o) throw() 124 exception_ptr(static_cast<exception_ptr&&>(__o)).swap(*this);
|