| /external/python/cpython2/Modules/zlib/ |
| 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.
|
| /external/python/cpython3/Modules/zlib/ |
| deflate.h | 46 /* maximum heap size */
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
210 int heap_len; /* number of elements in the heap */
212 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
213 * The same heap array is used to build all trees.
|
| /external/syslinux/com32/lib/zlib/ |
| 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/ast/ |
| ast-types.cc | 183 Heap* heap = map->GetHeap(); local
184 if (map == heap->undefined_map()) return kUndefined;
185 if (map == heap->null_map()) return kNull;
186 if (map == heap->boolean_map()) return kBoolean;
187 if (map == heap->the_hole_map()) return kHole;
188 DCHECK(map == heap->uninitialized_map() ||
189 map == heap->no_interceptor_result_sentinel_map() ||
190 map == heap->termination_exception_map() ||
191 map == heap->arguments_marker_map() |
[all...] |
| /external/v8/src/compiler/ |
| types.cc | 178 Heap* heap = map->GetHeap(); local
179 if (map == heap->undefined_map()) return kUndefined;
180 if (map == heap->null_map()) return kNull;
181 if (map == heap->boolean_map()) return kBoolean;
182 if (map == heap->the_hole_map()) return kHole;
183 DCHECK(map == heap->uninitialized_map() ||
184 map == heap->no_interceptor_result_sentinel_map() ||
185 map == heap->termination_exception_map() ||
186 map == heap->arguments_marker_map() |
[all...] |
| /external/v8/src/ |
| feedback-vector.cc | 19 Heap* heap = symbol->GetHeap(); local
20 return symbol != heap->uninitialized_symbol() &&
21 symbol != heap->premonomorphic_symbol() &&
22 symbol != heap->megamorphic_symbol();
91 metadata->set_map(isolate->heap()->fixed_cow_array_map());
175 array->set_map_no_write_barrier(isolate->heap()->feedback_vector_map());
181 DCHECK_EQ(isolate->heap()->uninitialized_symbol(), *uninitialized_sentinel);
193 array->set(index, isolate->heap()->empty_weak_cell(),
268 Oddball* undefined_value = isolate->heap()->undefined_value()
[all...] |
| code-stubs.cc | 17 #include "src/heap/heap-inl.h"
77 UnseededNumberDictionary* stubs = isolate()->heap()->code_stubs();
119 Heap* heap = isolate_->heap(); local
120 Handle<UnseededNumberDictionary> dict(heap->code_stubs());
122 heap->SetRootCodeStubs(*dict);
146 // Copy the generated code into a heap object.
155 Heap* heap = isolate()->heap() local
[all...] |
| compiler.cc | 28 #include "src/heap/heap.h"
219 Heap* heap = isolate->heap(); local
220 if (heap->InNewSpace(*object)) {
221 heap->AddWeakNewSpaceObjectToCodeDependency(object, cell);
223 Handle<DependentCode> dep(heap->LookupWeakObjectToCodeDependency(object));
226 heap->AddWeakObjectToCodeDependency(object, dep);
262 isolate->heap()->AddRetainedMap(map)
[all...] |
| objects-printer.cc | 1617 Heap* heap = key->GetHeap(); local
[all...] |
| /external/v8/src/snapshot/ |
| serializer.cc | 8 #include "src/heap/heap-inl.h"
24 // The serializer is meant to be used only to generate initial heap images
219 STATIC_ASSERT(Heap::kEmptyDescriptorArrayRootIndex ==
224 !isolate()->heap()->InNewSpace(object)) {
270 return Heap::GetMaximumFillToAlign(alignment);
388 DCHECK(object_->map() != isolate->heap()->native_source_string_map());
398 map = internalized ? isolate->heap()->one_byte_internalized_string_map()
399 : isolate->heap()->one_byte_string_map();
405 map = internalized ? isolate->heap()->internalized_string_map(
497 Heap* heap = serializer_->isolate()->heap(); local
[all...] |
| /external/zlib/src/ |
| deflate.h | 46 /* maximum heap size */
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
210 int heap_len; /* number of elements in the heap */
212 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
213 * The same heap array is used to build all trees.
|
| /frameworks/av/media/libstagefright/ |
| CameraSource.cpp | 606 // Create memory heap to store buffers as VideoNativeMetadata.
759 // Create memory heap to store buffers as VideoNativeMetadata.
940 sp<IMemoryHeap> heap = frame->getMemory(&offset, &size); local
941 if (heap->getHeapID() != mMemoryHeapBase->getHeapID()) {
942 ALOGE("%s: Mismatched heap ID, ignoring release (got %x, expected %x)", __FUNCTION__,
943 heap->getHeapID(), mMemoryHeapBase->getHeapID());
977 sp<IMemoryHeap> heap = frame->getMemory(&offset, &size); local
1378 sp<IMemoryHeap> heap = data->getMemory(&offset, &size); local
[all...] |
| /frameworks/av/services/camera/libcameraservice/api1/ |
| CameraClient.cpp | 992 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); local
1049 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); local
[all...] |
| /hardware/interfaces/cas/1.0/vts/functional/ |
| VtsHalCasV1_0TargetTest.cpp | 319 // build HidlMemory from memory heap
322 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); local
323 if (nullptr == heap.get()) {
324 ALOGE("couldn't get memory heap!");
332 sp<HidlMemory> hidlMemory = fromHeap(heap);
380 // build HidlMemory from memory heap
383 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); local
384 if (nullptr == heap.get()) {
385 ALOGE("couldn't get memory heap!");
390 sp<HidlMemory> hidlMemory = fromHeap(heap);
[all...] |
| /toolchain/binutils/binutils-2.27/zlib/ |
| 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.
|
| /art/openjdkjvmti/ |
| ti_heap.cc | 25 #include "gc/heap-visit-objects-inl.h"
26 #include "gc/heap.h"
1307 art::gc::Heap* heap = art::Runtime::Current()->GetHeap(); local
1402 art::gc::Heap* const heap = art::Runtime::Current()->GetHeap(); member in class:openjdkjvmti::art::gc
[all...] |
| /art/runtime/mirror/ |
| class.cc | 1212 gc::Heap* heap = Runtime::Current()->GetHeap(); local
[all...] |
| /art/runtime/ |
| thread_list.cc | 40 #include "gc/heap.h"
107 gc::Heap* const heap = Runtime::Current()->GetHeap(); member in class:art::gc
108 heap->DisableGCForShutdown();
110 heap->WaitForGcToComplete(gc::kGcCauseBackground, Thread::Current());
430 // heap access.
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| MemRegion.h | 1134 HeapSpaceRegion *heap; member in class:clang::ento::MemRegionManager
[all...] |
| /external/libdrm/intel/ |
| intel_bufmgr_fake.c | 123 struct mem_block *heap; member in struct:_bufmgr_fake
437 block->mem = mmAllocMem(bufmgr_fake->heap, sz, align_log2, 0);
1249 mmDestroy(bufmgr_fake->heap);
[all...] |
| /external/v8/src/heap/ |
| incremental-marking.cc | 5 #include "src/heap/incremental-marking.h"
10 #include "src/heap/gc-idle-time-handler.h"
11 #include "src/heap/gc-tracer.h"
12 #include "src/heap/heap-inl.h"
13 #include "src/heap/mark-compact-inl.h"
14 #include "src/heap/object-stats.h"
15 #include "src/heap/objects-visiting-inl.h"
16 #include "src/heap/objects-visiting.h"
23 IncrementalMarking::IncrementalMarking(Heap* heap
186 Heap* heap = map->GetHeap(); local
[all...] |
| mark-compact.h | 13 #include "src/heap/marking.h"
14 #include "src/heap/spaces.h"
15 #include "src/heap/store-buffer.h"
22 // Callback function, returns whether an object is alive. The heap size
27 // Callback function to mark an object in a given heap.
28 typedef void (*MarkObjectFunction)(Heap* heap, HeapObject* object);
127 explicit MarkingDeque(Heap* heap)
137 heap_(heap) {}
394 inline Heap* heap() { return chunk_->heap(); } function in class:v8::internal::BASE_EMBEDDED
521 inline Heap* heap() const { return heap_; } function in class:v8::internal::MarkCompactCollector
[all...] |
| /external/v8/src/profiler/ |
| heap-snapshot-generator.h | 78 // HeapEntry instances represent an entity from the heap (or a special
148 // HeapSnapshot represents a single heap snapshot. It is stored in
150 // HeapSnapshots. All HeapSnapshots share strings copied from JS heap
218 explicit HeapObjectsMap(Heap* heap);
220 Heap* heap() const { return heap_; } function in class:v8::internal::HeapObjectsMap
267 Heap* heap_;
274 // in any kind of heap memory.
287 // real heap objects and their representations in heap snapshots
[all...] |
| /external/v8/src/runtime/ |
| runtime-debug.cc | 73 return isolate->heap()->undefined_value();
94 return isolate->heap()->undefined_value();
102 return isolate->heap()->undefined_value();
169 result->set(1, isolate->heap()->ToBoolean(iterator->HasMore()));
280 result->set(5, isolate->heap()->ToBoolean(js_proxy->IsRevoked()));
352 if (!it.IsFound()) return isolate->heap()->undefined_value();
371 2, isolate->heap()->ToBoolean(it.state() == LookupIterator::INTERCEPTOR));
374 details->set(3, isolate->heap()->ToBoolean(has_caught));
424 return isolate->heap()->true_value();
491 Heap* heap = isolate->heap() local
1309 Heap* heap = isolate->heap(); local
1364 Heap* heap = isolate->heap(); local
[all...] |
| /frameworks/base/core/jni/ |
| android_hardware_Camera.cpp | 258 sp<IMemoryHeap> heap = dataPtr->getMemory(&offset, &size); local
260 uint8_t *heapBase = (uint8_t*)heap->base();
291 ALOGE("image heap is NULL");
[all...] |
