Searched refs:heap (Results 176 - 200 of 511) sorted by relevance

1234567891011>>

/external/v8/src/runtime/
H A Druntime-debug.cc73 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 local
1309 Heap* heap = isolate->heap(); local
1364 Heap* heap = isolate->heap(); local
[all...]
H A Druntime-typedarray.cc45 if (target_length == 0) return isolate->heap()->undefined_value();
53 return isolate->heap()->undefined_value();
63 return isolate->heap()->undefined_value();
71 isolate->heap()->UnregisterArrayBuffer(*array_buffer);
74 return isolate->heap()->undefined_value();
171 return isolate->heap()->undefined_value();
266 return isolate->heap()->true_value();
270 return isolate->heap()->false_value();
443 return isolate->heap()->ToBoolean(args[0]->IsJSTypedArray());
450 return isolate->heap()
[all...]
H A Druntime-compiler.cc38 return isolate->heap()->exception();
51 return isolate->heap()->exception();
64 return isolate->heap()->exception();
78 return isolate->heap()->exception();
134 return isolate->heap()->undefined_value();
204 return isolate->heap()->undefined_value();
235 return isolate->heap()->undefined_value();
441 return isolate->heap()->exception();
453 isolate->heap()->exception());
H A Druntime-numbers.cc21 return isolate->heap()->ToBoolean(Smi::IsValid(number));
52 return isolate->heap()->nan_value();
121 return isolate->heap()->nan_value();
212 return isolate->heap()->ToBoolean(obj->IsSmi());
219 return isolate->heap()->nan_value();
H A Druntime-generator.cc45 return isolate->heap()->undefined_value();
101 if (!generator->is_suspended()) return isolate->heap()->undefined_value();
/external/v8/src/
H A Dobjects-debug.cc390 Heap* heap = GetHeap(); local
391 CHECK(!heap->InNewSpace(this));
395 static_cast<size_t>(instance_size()) < heap->Capacity()));
396 CHECK(GetBackPointer()->IsUndefined(heap->isolate()) ||
672 Heap* heap = GetHeap(); local
676 CHECK(number == heap->nan_value() ||
677 number == heap->hole_nan_value());
686 if (map() == heap->undefined_map()) {
687 CHECK(this == heap->undefined_value());
688 } else if (map() == heap
1477 CanLeak(Object* obj, Heap* heap, bool skip_weak_cell) argument
[all...]
H A Dhandles.cc21 Heap* heap = heap_object->GetHeap(); local
22 Object** roots_array_start = heap->roots_array_start();
25 heap->RootCanBeTreatedAsConstant(
36 return !heap->isolate()->IsDeferredHandle(location_);
128 isolate->heap(), ZoneAllocationPolicy(&zone_));
150 return isolate_->heap()
H A Dfactory.cc32 DCHECK(__object__ != (ISOLATE)->heap()->exception()); \
43 (ISOLATE)->heap()->CollectGarbage( \
50 (ISOLATE)->heap()->CollectAllAvailableGarbage( \
66 isolate()->heap()->Allocate(*map, space),
77 isolate()->heap()->Allocate(*map, space, *allocation_site),
87 isolate()->heap()->AllocateFillerObject(size, double_align, space),
150 isolate()->heap()->AllocateFixedArray(size, pretenure),
158 isolate()->heap()->AllocateFixedArray(size, pretenure);
169 isolate()->heap()->AllocateFixedArrayWithFiller(size,
178 isolate()->heap()
1089 Heap* heap = isolate()->heap(); local
2350 Heap* heap = isolate()->heap(); local
[all...]
H A Dapi-arguments.h93 isolate->heap()->the_hole_value();
94 values[T::kReturnValueIndex] = isolate->heap()->the_hole_value();
169 values[T::kContextSaveIndex] = isolate->heap()->the_hole_value();
174 isolate->heap()->the_hole_value();
175 values[T::kReturnValueIndex] = isolate->heap()->the_hole_value();
/external/libcxxabi/src/
H A Dcxa_vector.cpp151 st_heap_block2 heap ( dealloc, heap_block );
161 heap.release (); // We're good!
179 st_heap_block3 heap ( dealloc, heap_block, heap_size );
189 heap.release (); // We're good!
335 st_heap_block2 heap ( dealloc, heap_block );
357 st_heap_block3 heap ( dealloc, heap_block, heap_block_size );
/external/v8/src/builtins/
H A Dbuiltins-object.cc103 isolate->heap()->exception());
120 if (!maybe.IsJust()) return isolate->heap()->exception();
121 if (maybe.FromJust() == ABSENT) return isolate->heap()->false_value();
122 return isolate->heap()->ToBoolean((maybe.FromJust() & DONT_ENUM) == 0);
455 MAYBE_RETURN(success, isolate->heap()->exception());
460 return isolate->heap()->undefined_value();
486 return isolate->heap()->undefined_value();
492 MAYBE_RETURN(found, isolate->heap()->exception());
500 return isolate->heap()->undefined_value();
506 return isolate->heap()
[all...]
H A Dbuiltins-error.cc60 if (!stack_trace->IsJSArray()) return isolate->heap()->undefined_value();
74 if (!status.IsJust()) return isolate->heap()->exception();
76 return isolate->heap()->undefined_value();
H A Dbuiltins-symbol.cc63 result = isolate->heap()->undefined_value();
65 DCHECK_EQ(isolate->heap()->public_symbol_table()->SlowReverseLookup(*symbol),
/external/v8/src/heap/
H A Dspaces.cc5 #include "src/heap/spaces.h"
14 #include "src/heap/array-buffer-tracker.h"
15 #include "src/heap/incremental-marking.h"
16 #include "src/heap/mark-compact.h"
17 #include "src/heap/slot-set.h"
46 DCHECK(owner == page->heap()->old_space() ||
47 owner == page->heap()->map_space() ||
48 owner == page->heap()->code_space());
58 space_->heap()
68 PauseAllocationObserversScope::PauseAllocationObserversScope(Heap* heap) argument
515 Initialize(Heap* heap, Address base, size_t size, Address area_start, Address area_end, Executability executable, Space* owner, base::VirtualMemory* reservation) argument
659 Heap* heap = isolate_->heap(); local
1213 PagedSpace(Heap* heap, AllocationSpace space, Executability executable) argument
1645 LocalAllocationBuffer(Heap* heap, AllocationInfo allocation_info) argument
2430 RepairFreeList(Heap* heap) argument
2684 RepairLists(Heap* heap) argument
2948 LargeObjectSpace(Heap* heap, AllocationSpace id) argument
[all...]
H A Dremembered-set.h9 #include "src/heap/heap.h"
10 #include "src/heap/slot-set.h"
11 #include "src/heap/spaces.h"
103 static void Iterate(Heap* heap, Callback callback) { argument
105 heap, [callback](MemoryChunk* chunk) { Iterate(chunk, callback); });
111 static void IterateMemoryChunks(Heap* heap, Callback callback) { argument
112 MemoryChunkIterator it(heap);
183 static void IterateTyped(Heap* heap, Callback callback) { argument
184 IterateMemoryChunks(heap, [callbac
204 ClearAll(Heap* heap) argument
[all...]
H A Dobject-stats.cc5 #include "src/heap/object-stats.h"
10 #include "src/heap/heap-inl.h"
81 int gc_count = heap()->gc_count();
139 int gc_count = heap()->gc_count();
239 Isolate* ObjectStats::isolate() { return heap()->isolate(); }
329 static bool CanRecordFixedArray(Heap* heap, FixedArrayBase* array) { argument
331 array->map() != heap->fixed_double_array_map() &&
332 array != heap->empty_fixed_array() &&
333 array != heap
340 IsCowArray(Heap* heap, FixedArrayBase* array) argument
[all...]
H A Dstore-buffer.cc5 #include "src/heap/store-buffer.h"
10 #include "src/heap/incremental-marking.h"
18 StoreBuffer::StoreBuffer(Heap* heap) argument
19 : heap_(heap),
82 isolate->heap()->store_buffer()->FlipStoreBuffers();
/external/python/cpython2/Modules/zlib/
H A Dtrees.c88 * 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 propert
[all...]
/external/python/cpython3/Modules/zlib/
H A Dtrees.c88 * need for the L_CODES extra codes used during heap construction. However
423 /* Index within the heap array of least frequent node in the Huffman tree */
427 * Remove the smallest element from the heap and recreate the heap with
428 * one less element. Updates heap and heap_len.
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
446 * Restore the heap property by moving down the tree starting at node k,
448 * when the heap propert
[all...]
/external/zlib/src/
H A Dtrees.c88 * need for the L_CODES extra codes used during heap construction. However
423 /* Index within the heap array of least frequent node in the Huffman tree */
427 * Remove the smallest element from the heap and recreate the heap with
428 * one less element. Updates heap and heap_len.
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
446 * Restore the heap property by moving down the tree starting at node k,
448 * when the heap propert
[all...]
/external/valgrind/memcheck/tests/
H A Daddressable.stderr.exp5 total heap usage: ... allocs, ... frees, ... bytes allocated
34 total heap usage: ... allocs, ... frees, ... bytes allocated
43 total heap usage: ... allocs, ... frees, ... bytes allocated
57 total heap usage: ... allocs, ... frees, ... bytes allocated
76 total heap usage: ... allocs, ... frees, ... bytes allocated
86 total heap usage: ... allocs, ... frees, ... bytes allocated
H A Dorigin1-yes.stderr.exp26 Uninitialised value was created by a heap allocation
34 Uninitialised value was created by a heap allocation
42 Uninitialised value was created by a heap allocation
/external/skia/src/gpu/vk/
H A DGrVkMemory.cpp14 // for simple tracking of how much we're using in each heap
106 GrVkHeap* heap = gpu->getHeap(buffer_type_to_heap(type)); local
108 if (!heap->alloc(memReqs.size, memReqs.alignment, typeIndex, heapIndex, alloc)) {
113 !heap->alloc(memReqs.size, memReqs.alignment, typeIndex, heapIndex, alloc)) {
123 SkASSERT_RELEASE(heap->free(*alloc));
133 GrVkHeap* heap = gpu->getHeap(buffer_type_to_heap(type)); local
134 SkASSERT_RELEASE(heap->free(alloc));
160 GrVkHeap* heap; local
178 heap = gpu->getHeap(GrVkGpu::kLinearImage_Heap);
195 heap
231 GrVkHeap* heap; local
[all...]
/external/skqp/src/gpu/vk/
H A DGrVkMemory.cpp14 // for simple tracking of how much we're using in each heap
106 GrVkHeap* heap = gpu->getHeap(buffer_type_to_heap(type)); local
108 if (!heap->alloc(memReqs.size, memReqs.alignment, typeIndex, heapIndex, alloc)) {
113 !heap->alloc(memReqs.size, memReqs.alignment, typeIndex, heapIndex, alloc)) {
123 SkASSERT_RELEASE(heap->free(*alloc));
133 GrVkHeap* heap = gpu->getHeap(buffer_type_to_heap(type)); local
134 SkASSERT_RELEASE(heap->free(alloc));
160 GrVkHeap* heap; local
178 heap = gpu->getHeap(GrVkGpu::kLinearImage_Heap);
195 heap
231 GrVkHeap* heap; local
[all...]
/external/valgrind/massif/tests/
H A Dalloc-fns-A.post.exp3 Massif arguments: --stacks=no --time-unit=B --heap-admin=0 --massif-out-file=massif.out --ignore-fn=__part_load_locale --ignore-fn=__time_load_locale --ignore-fn=dwarf2_unwind_dyld_add_image_hook --ignore-fn=get_or_create_key_element
36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
48 100.00% (3,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.

Completed in 2478 milliseconds

1234567891011>>