| /device/lge/mako/camera/ |
| QCameraHWI.cpp | [all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| itspoof.cpp | 145 // A long "identifier" that will overflow implementation stack buffers, forcing heap allocations.
146 CHECK_SKELETON(SL, " A 1ong \\u02b9identifier' that will overflow implementation stack buffers, forcing heap allocations."
147 " A 1ong 'identifier' that will overflow implementation stack buffers, forcing heap allocations."
148 " A 1ong 'identifier' that will overflow implementation stack buffers, forcing heap allocations."
149 " A 1ong 'identifier' that will overflow implementation stack buffers, forcing heap allocations.",
151 " A long 'identifier' that vvill overflovv irnplernentation stack buffers, forcing heap allocations."
152 " A long 'identifier' that vvill overflovv irnplernentation stack buffers, forcing heap allocations."
153 " A long 'identifier' that vvill overflovv irnplernentation stack buffers, forcing heap allocations."
154 " A long 'identifier' that vvill overflovv irnplernentation stack buffers, forcing heap allocations.")
|
| /external/chromium_org/third_party/zlib/ |
| deflate.h | 46 /* maximum heap size */
208 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
209 int heap_len; /* number of elements in the heap */
211 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
212 * The same heap array is used to build all trees.
|
| /external/chromium_org/tools/deep_memory_profiler/ |
| policy.android.renderer.json | 10 "unhooked-ashmem-dalvik-heap",
30 "mmap-v8-heap-newspace",
31 "mmap-v8-heap-coderange",
32 "mmap-v8-heap-pagedspace",
129 "name": "unhooked-ashmem-dalvik-heap",
130 "mappedpathname": "/dev/ashmem/dalvik-heap.*",
231 "name": "mmap-v8-heap-newspace",
236 "name": "mmap-v8-heap-coderange",
241 "name": "mmap-v8-heap-pagedspace",
|
| policy.linux.browser.json | 18 "mmap-v8-heap-newspace",
19 "mmap-v8-heap-coderange",
20 "mmap-v8-heap-pagedspace",
149 "name": "mmap-v8-heap-newspace",
154 "name": "mmap-v8-heap-coderange",
159 "name": "mmap-v8-heap-pagedspace",
|
| /external/chromium_org/v8/src/ia32/ |
| assembler-ia32-inl.h | 297 void RelocInfo::Visit(Heap* heap) {
300 StaticVisitor::VisitEmbeddedPointer(heap, this);
303 StaticVisitor::VisitCodeTarget(heap, this);
305 StaticVisitor::VisitCell(heap, this);
310 StaticVisitor::VisitCodeAgeSequence(heap, this);
312 } else if (heap->isolate()->debug()->has_break_points() &&
317 StaticVisitor::VisitDebugTarget(heap, this);
382 ASSERT(!isolate()->heap()->InNewSpace(obj));
|
| /external/qemu/distrib/zlib-1.2.3/ |
| deflate.h | 46 /* maximum heap size */
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
204 int heap_len; /* number of elements in the heap */
206 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
207 * The same heap array is used to build all trees.
|
| /external/v8/src/ia32/ |
| assembler-ia32-inl.h | 249 void RelocInfo::Visit(Heap* heap) {
252 StaticVisitor::VisitEmbeddedPointer(heap, this);
255 StaticVisitor::VisitCodeTarget(heap, this);
257 StaticVisitor::VisitGlobalPropertyCell(heap, this);
262 } else if (heap->isolate()->debug()->has_break_points() &&
267 StaticVisitor::VisitDebugTarget(heap, this);
297 ASSERT(!HEAP->InNewSpace(obj));
330 ASSERT(!isolate()->heap()->InNewSpace(obj));
|
| /external/zlib/src/ |
| deflate.h | 46 /* maximum heap size */
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
207 int heap_len; /* number of elements in the heap */
209 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
210 * The same heap array is used to build all trees.
|
| /libcore/dalvik/src/main/java/dalvik/system/ |
| VMDebug.java | 300 * Collects "hprof" heap data and sends it to DDMS. This may cause a GC.
308 * Dumps "hprof" heap data to a file, by name or descriptor.
369 * Export the heap per-space stats for dumpsys meminfo.
374 * data[0] : the application heap space size
375 * data[1] : the application heap space allocated bytes
376 * data[2] : the application heap space free bytes
377 * data[3] : the zygote heap space size
378 * data[4] : the zygote heap space allocated size
379 * data[5] : the zygote heap space free size
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| ipa-prop.h | 169 VEC (tree, heap) *types;
326 DEF_VEC_ALLOC_O (ipa_node_params_t, heap);
331 extern VEC (ipa_node_params_t, heap) *ipa_node_params_vector;
364 ipa_node_params_vector = VEC_alloc (ipa_node_params_t, heap,
369 VEC_safe_grow_cleared (ipa_node_params_t, heap,
430 VEC (cgraph_edge_p, heap) **new_edges);
502 DEF_VEC_ALLOC_O (ipa_parm_adjustment_t, heap);
504 typedef VEC (ipa_parm_adjustment_t, heap) *ipa_parm_adjustment_vec;
506 VEC(tree, heap) *ipa_get_vector_of_formal_parms (tree fndecl);
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| ipa-prop.h | 169 VEC (tree, heap) *types;
326 DEF_VEC_ALLOC_O (ipa_node_params_t, heap);
331 extern VEC (ipa_node_params_t, heap) *ipa_node_params_vector;
364 ipa_node_params_vector = VEC_alloc (ipa_node_params_t, heap,
369 VEC_safe_grow_cleared (ipa_node_params_t, heap,
430 VEC (cgraph_edge_p, heap) **new_edges);
502 DEF_VEC_ALLOC_O (ipa_parm_adjustment_t, heap);
504 typedef VEC (ipa_parm_adjustment_t, heap) *ipa_parm_adjustment_vec;
506 VEC(tree, heap) *ipa_get_vector_of_formal_parms (tree fndecl);
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| ipa-prop.h | 169 VEC (tree, heap) *types;
326 DEF_VEC_ALLOC_O (ipa_node_params_t, heap);
331 extern VEC (ipa_node_params_t, heap) *ipa_node_params_vector;
364 ipa_node_params_vector = VEC_alloc (ipa_node_params_t, heap,
369 VEC_safe_grow_cleared (ipa_node_params_t, heap,
430 VEC (cgraph_edge_p, heap) **new_edges);
502 DEF_VEC_ALLOC_O (ipa_parm_adjustment_t, heap);
504 typedef VEC (ipa_parm_adjustment_t, heap) *ipa_parm_adjustment_vec;
506 VEC(tree, heap) *ipa_get_vector_of_formal_parms (tree fndecl);
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| ipa-prop.h | 169 VEC (tree, heap) *types;
326 DEF_VEC_ALLOC_O (ipa_node_params_t, heap);
331 extern VEC (ipa_node_params_t, heap) *ipa_node_params_vector;
364 ipa_node_params_vector = VEC_alloc (ipa_node_params_t, heap,
369 VEC_safe_grow_cleared (ipa_node_params_t, heap,
430 VEC (cgraph_edge_p, heap) **new_edges);
502 DEF_VEC_ALLOC_O (ipa_parm_adjustment_t, heap);
504 typedef VEC (ipa_parm_adjustment_t, heap) *ipa_parm_adjustment_vec;
506 VEC(tree, heap) *ipa_get_vector_of_formal_parms (tree fndecl);
|
| /external/chromium_org/v8/src/mips/ |
| codegen-mips.cc | 196 __ LoadRoot(at, Heap::kEmptyFixedArrayRootIndex);
208 // t2: destination FixedDoubleArray, not tagged as heap object
211 __ LoadRoot(t5, Heap::kFixedDoubleArrayMapRootIndex);
287 // Restore a "smi-untagged" heap object.
290 __ LoadRoot(at, Heap::kTheHoleValueRootIndex);
324 __ LoadRoot(at, Heap::kEmptyFixedArrayRootIndex);
337 // t2: destination FixedArray, not tagged as heap object
339 __ LoadRoot(t5, Heap::kFixedArrayMapRootIndex);
349 __ LoadRoot(t3, Heap::kTheHoleValueRootIndex);
350 __ LoadRoot(t5, Heap::kHeapNumberMapRootIndex)
[all...] |
| full-codegen-mips.cc | 163 __ LoadRoot(a2, Heap::kUndefinedValueRootIndex);
182 __ LoadRoot(at, Heap::kUndefinedValueRootIndex);
185 __ LoadRoot(t5, Heap::kUndefinedValueRootIndex);
306 __ LoadRoot(t0, Heap::kStackLimitRootIndex);
322 __ LoadRoot(v0, Heap::kUndefinedValueRootIndex);
491 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
496 Heap::RootListIndex index) const {
502 Heap::RootListIndex index) const {
508 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
513 if (index == Heap::kUndefinedValueRootIndex |
[all...] |
| /external/grub/stage2/ |
| stage2.c | 240 char *heap, int entryno)
525 ((int) heap) - ((int) cur_entry));
530 heap += 2;
541 ((int) heap) - ((int) ptr));
542 heap -= (((int) ptr) - ((int) cur_entry));
636 new_heap = heap;
644 new_heap = heap + NEW_HEAPSIZE + 1;
662 run_menu (heap, NULL, new_num_entries, new_heap, 0);
668 new_heap = heap + NEW_HEAPSIZE + 1;
692 (int) heap - ((int) cur_entry + i))
[all...] |
| /external/v8/src/ |
| liveobjectlist.cc | 37 #include "heap.h"
215 Heap* heap = ISOLATE->heap(); local
217 return heap->InSpace(heap_obj, space);
222 // here are guaranteed to be in the heap. Hence, it is safe to infer
224 // Note: calling Heap::InSpace(heap_obj, LO_SPACE) is too slow for our
229 if (heap->InSpace(heap_obj, static_cast<AllocationSpace>(sp))) {
233 SLOW_ASSERT(heap->InSpace(heap_obj, LO_SPACE));
978 // The heap must have grown and we have more objects than capacity to stor
1940 Heap* heap = isolate->heap(); local
2000 Heap* heap = isolate->heap(); local
2126 Heap* heap = isolate->heap(); local
2616 Heap* heap = ISOLATE->heap(); local
[all...] |
| objects-visiting.h | 209 INLINE(static void IteratePointers(Heap* heap,
217 StaticVisitor::VisitPointers(heap, start_slot, end_slot);
287 static inline void VisitPointers(Heap* heap, Object** start, Object** end) {
288 for (Object** p = start; p < end; p++) StaticVisitor::VisitPointer(heap, p);
|
| /art/runtime/gc/collector/ |
| mark_sweep.cc | 32 #include "gc/heap.h"
109 // being sorted by Heap::AddContinuousSpace.
131 MarkSweep::MarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix)
132 : GarbageCollector(heap,
325 // Before freeing anything, lets verify the heap.
769 VLOG(heap) << "Parallel scanning cards " << reinterpret_cast<void*>(begin_) << " - "
811 // Calculate how many bytes of heap we will scan,
839 VLOG(heap) << "Scanning space cards " << reinterpret_cast<void*>(space->Begin()) << " - "
1046 Heap* heap = GetHeap(); local
1116 Heap* heap = mark_sweep->GetHeap(); local
1134 Heap* heap = context->mark_sweep->GetHeap(); local
1623 Heap* heap = GetHeap(); local
[all...] |
| /external/valgrind/main/massif/tests/ |
| peak2.stderr.exp | 99 Massif: heap allocs: 40
100 Massif: heap reallocs: 0
101 Massif: heap frees: 20
102 Massif: ignored heap allocs: ...
103 Massif: ignored heap frees: ...
104 Massif: ignored heap reallocs: ...
|
| /external/chromium_org/v8/src/x64/ |
| codegen-x64.cc | 168 // the V8 heap. We can't, and don't, refer to any relocatable addresses
300 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
307 Heap::kFixedCOWArrayMapRootIndex);
321 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
350 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
394 __ CompareRoot(rbx, Heap::kTheHoleValueRootIndex);
425 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
437 __ LoadRoot(rdi, Heap::kFixedArrayMapRootIndex);
444 __ LoadRoot(rdi, Heap::kTheHoleValueRootIndex);
455 // Box doubles into heap numbers
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-assembler-ia32.cc | 63 Object* code = isolate->heap()->CreateCode(
102 Object* code = isolate->heap()->CreateCode(
145 Object* code = isolate->heap()->CreateCode(
180 Code* code = Code::cast(isolate->heap()->CreateCode(
215 Code* code = Code::cast(isolate->heap()->CreateCode(
245 Code* code = Code::cast(isolate->heap()->CreateCode(
282 Code* code = Code::cast(isolate->heap()->CreateCode(
322 Code* code = Code::cast(isolate->heap()->CreateCode(
378 Code* code = Code::cast(isolate->heap()->CreateCode(
464 Code* code = Code::cast(isolate->heap()->CreateCode
[all...] |
| /external/openfst/src/include/fst/ |
| shortest-path.h | 311 vector<StateId> heap;
331 heap.push_back(final);
334 while (!heap.empty()) {
335 pop_heap(heap.begin(), heap.end(), compare);
336 StateId state = heap.back();
338 heap.pop_back();
365 heap.push_back(next);
366 push_heap(heap.begin(), heap.end(), compare)
[all...] |
| /external/v8/src/x64/ |
| codegen-x64.cc | 137 // the V8 heap. We can't, and don't, refer to any relocatable addresses
259 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
266 Heap::kFixedCOWArrayMapRootIndex);
280 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
309 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
353 __ CompareRoot(rbx, Heap::kTheHoleValueRootIndex);
380 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
392 __ LoadRoot(rdi, Heap::kFixedArrayMapRootIndex);
399 __ LoadRoot(rdi, Heap::kTheHoleValueRootIndex);
410 // Box doubles into heap numbers
[all...] |
