/external/chromium_org/v8/src/ |
factory.h | 33 #include "heap.h" 109 // a Heap::PretenureFlag argument to optionally request that they be 307 // structures in the heap. 479 &isolate()->heap()->roots_[Heap::k##camel_name##RootIndex])); \ 487 &isolate()->heap()->roots_[Heap::k##Name##MapRootIndex])); \ 495 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \ 501 return Handle<String>(&isolate()->heap()->hidden_string_) [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
trees.c | 92 * need for the L_CODES extra codes used during heap construction. However 427 /* Index within the heap array of least frequent node in the Huffman tree */ 431 * Remove the smallest element from the heap and recreate the heap with 432 * one less element. Updates heap and heap_len. 436 top = s->heap[SMALLEST]; \ 437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 450 * Restore the heap property by moving down the tree starting at node k, 452 * when the heap property is re-established (each father smaller than it [all...] |
/external/zlib/src/ |
trees.c | 88 * need for the L_CODES extra codes used during heap construction. However 425 /* Index within the heap array of least frequent node in the Huffman tree */ 429 * Remove the smallest element from the heap and recreate the heap with 430 * one less element. Updates heap and heap_len. 434 top = s->heap[SMALLEST]; \ 435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 448 * Restore the heap property by moving down the tree starting at node k, 450 * when the heap property is re-established (each father smaller than it [all...] |
/dalvik/vm/analysis/ |
RegisterMap.h | 38 kRegMapFormatOnHeap = 0x80, /* bit flag, indicates allocation on heap */ 43 * heap or mapped out of a (post-dexopt) DEX file. 83 * Get the "on heap" flag. 104 * Set the "on heap" flag. 143 * single line onto the heap, this will free "data"; otherwise, it does
|
/external/chromium/base/allocator/ |
allocator_shim.cc | 9 // When defined, different heap allocators can be used via an environment 35 WINHEAP, // Windows Heap (standard Windows allocator). 36 WINLFH, // Windows LFH Heap. 230 // The CRT heap initialization stub. 266 // The CRT heap cleanup stub.
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
heap-profiler.cc | 58 #include <gperftools/heap-profiler.h> 71 #include "deep-heap-profile.h" 72 #include "heap-profile-table.h" 120 // Flags that control heap-profiling 128 "If non-zero, dump heap profiling information once every " 133 "If non-zero, dump heap profiling information once every " 140 "If non-zero, dump heap profiling information whenever " 145 "If non-zero, dump heap profiling information once every " 152 "If heap-profiling is on, also profile mmap, mremap, and sbrk)"); 155 "If heap-profiling is on, only profile mmap, mremap, and sbrk; [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
heap-checker-death_unittest.sh | 34 # Run the heap checker unittest in a mode where it is supposed to crash and 47 EXE="${1:-$BINDIR}/heap-checker_unittest" 138 EARLY_MSG="Starting tracking the heap$" 164 Test 60 1 "Starting tracking the heap$" "" \ 167 Test 60 1 "" "Starting tracking the heap" \
|
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
heap-checker-death_unittest.sh | 34 # Run the heap checker unittest in a mode where it is supposed to crash and 47 EXE="${1:-$BINDIR}/heap-checker_unittest" 138 EARLY_MSG="Starting tracking the heap$" 164 Test 60 1 "Starting tracking the heap$" "" \ 167 Test 60 1 "" "Starting tracking the heap" \
|
/external/v8/test/cctest/ |
test-hashing.cc | 164 Code* code = Code::cast(HEAP->CreateCode( 167 Handle<Object>(HEAP->undefined_value()))->ToObjectChecked()); 193 Code* code = Code::cast(HEAP->CreateCode( 196 Handle<Object>(HEAP->undefined_value()))->ToObjectChecked()); 209 Isolate::Current()->heap()->HashSeed());
|
/external/valgrind/main/massif/tests/ |
deep-A.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 48 98.04% (3,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 59 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
deep-B.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 48 98.04% (3,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 57 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
deep-C.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 48 98.04% (3,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
deep-D.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 48 98.04% (3,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 52 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
tag_and_trait.hpp | 140 /// Pairing-heap. 143 /// Binomial-heap. 146 /// Redundant-counter binomial-heap. 149 /// Binary-heap (array-based). 152 /// Thin heap.
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/ |
tag_and_trait.hpp | 141 /// Pairing-heap. 144 /// Binomial-heap. 147 /// Redundant-counter binomial-heap. 150 /// Binary-heap (array-based). 153 /// Thin heap.
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/ |
tag_and_trait.hpp | 141 /// Pairing-heap. 144 /// Binomial-heap. 147 /// Redundant-counter binomial-heap. 150 /// Binary-heap (array-based). 153 /// Thin heap.
|
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
tag_and_trait.hpp | 140 /// Pairing-heap. 143 /// Binomial-heap. 146 /// Redundant-counter binomial-heap. 149 /// Binary-heap (array-based). 152 /// Thin heap.
|
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
tag_and_trait.hpp | 140 /// Pairing-heap. 143 /// Binomial-heap. 146 /// Redundant-counter binomial-heap. 149 /// Binary-heap (array-based). 152 /// Thin heap.
|
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
tag_and_trait.hpp | 140 /// Pairing-heap. 143 /// Binomial-heap. 146 /// Redundant-counter binomial-heap. 149 /// Binary-heap (array-based). 152 /// Thin heap.
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/ |
tag_and_trait.hpp | 140 /// Pairing-heap. 143 /// Binomial-heap. 146 /// Redundant-counter binomial-heap. 149 /// Binary-heap (array-based). 152 /// Thin heap.
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
tag_and_trait.hpp | 141 /// Pairing-heap. 144 /// Binomial-heap. 147 /// Redundant-counter binomial-heap. 150 /// Binary-heap (array-based). 153 /// Thin heap.
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
tag_and_trait.hpp | 141 /// Pairing-heap. 144 /// Binomial-heap. 147 /// Redundant-counter binomial-heap. 150 /// Binary-heap (array-based). 153 /// Thin heap.
|
/external/v8/src/mips/ |
code-stubs-mips.cc | 59 // Check if the operand is a heap number. 64 __ LoadRoot(scratch2, Heap::kHeapNumberMapRootIndex); 116 __ LoadRoot(a1, Heap::kEmptyFixedArrayRootIndex); 117 __ LoadRoot(a2, Heap::kTheHoleValueRootIndex); 118 __ LoadRoot(t0, Heap::kUndefinedValueRootIndex); 138 __ LoadRoot(t0, Heap::kFalseValueRootIndex); 161 __ LoadRoot(a1, Heap::kFunctionContextMapRootIndex); 175 __ LoadRoot(a1, Heap::kUndefinedValueRootIndex); 209 __ LoadRoot(a2, Heap::kBlockContextMapRootIndex); 237 __ LoadRoot(a1, Heap::kTheHoleValueRootIndex) [all...] |
/external/v8/src/arm/ |
code-stubs-arm.cc | 58 // Check if the operand is a heap number. 63 __ LoadRoot(scratch2, Heap::kHeapNumberMapRootIndex); 114 __ LoadRoot(r1, Heap::kEmptyFixedArrayRootIndex); 115 __ LoadRoot(r2, Heap::kTheHoleValueRootIndex); 116 __ LoadRoot(r4, Heap::kUndefinedValueRootIndex); 136 __ LoadRoot(r4, Heap::kFalseValueRootIndex); 159 __ LoadRoot(r1, Heap::kFunctionContextMapRootIndex); 173 __ LoadRoot(r1, Heap::kUndefinedValueRootIndex); 208 __ LoadRoot(r2, Heap::kBlockContextMapRootIndex); 237 __ LoadRoot(r1, Heap::kTheHoleValueRootIndex) [all...] |
/external/v8/src/x64/ |
lithium-codegen-x64.cc | 148 __ LoadRoot(kScratchRegister, Heap::kUndefinedValueRootIndex); 4130 Heap* heap = isolate()->heap(); local [all...] |