HomeSort by relevance Sort by last modified time
    Searched refs:heap (Results 201 - 225 of 1276) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/mesa3d/src/gallium/drivers/nouveau/nv30/
nv30_vertprog.c 89 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
94 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
95 while (heap->next && heap->size < vp->nr_insns) {
96 struct nouveau_heap **evict = heap->next->priv;
100 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
132 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
137 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
138 while (heap->next && heap->size < vp->nr_consts)
    [all...]
  /external/syslinux/core/mem/
malloc.h 32 enum heap { enum
49 2..3: Heap,
90 #define ARENA_HEAP_SET(attrs, heap) \
91 ((attrs) = (((heap) << ARENA_HEAP_POS) & ARENA_HEAP_MASK) | \
  /external/v8/src/heap/
memory-reducer.h 16 class Heap;
113 explicit MemoryReducer(Heap* heap)
114 : heap_(heap),
139 Heap* heap() { return heap_; } function in class:v8::internal::MemoryReducer
161 Heap* heap_;
spaces-inl.h 8 #include "src/heap/incremental-marking.h"
9 #include "src/heap/spaces.h"
12 #include "src/profiler/heap-profiler.h"
85 DCHECK_EQ(space_, space_->heap()->code_space());
172 Page* Page::Initialize(Heap* heap, MemoryChunk* chunk, Executability executable,
181 heap->incremental_marking()->SetNewSpacePageFlags(page);
190 Page* Page::Initialize(Heap* heap, MemoryChunk* chunk, Executability executable,
197 heap->incremental_marking()->SetOldSpacePageFlags(chunk)
    [all...]
  /external/v8/src/runtime/
runtime-promise.cc 53 return isolate->heap()->undefined_value();
63 return isolate->heap()->undefined_value();
74 return isolate->heap()->undefined_value();
82 return isolate->heap()->undefined_value();
90 return isolate->heap()->undefined_value();
98 return isolate->heap()->undefined_value();
105 return isolate->heap()->undefined_value();
129 return isolate->heap()->undefined_value();
138 return isolate->heap()->undefined_value();
147 return isolate->heap()->undefined_value()
    [all...]
runtime-liveedit.cc 18 // For a script finds all SharedFunctionInfo's in the heap that points
31 Heap* heap = isolate->heap(); local
33 HeapIterator iterator(heap);
99 return isolate->heap()->null_value();
116 return isolate->heap()->undefined_value();
128 return isolate->heap()->undefined_value();
142 return isolate->heap()->undefined_value();
168 return isolate->heap()->undefined_value()
280 Heap* heap = isolate->heap(); local
    [all...]
  /external/valgrind/massif/tests/
deep-B.stderr.exp 41 Massif: heap allocs: 10
42 Massif: heap reallocs: 0
43 Massif: heap frees: 0
44 Massif: ignored heap allocs: ...
45 Massif: ignored heap frees: ...
46 Massif: ignored heap reallocs: ...
deep-C.stderr.exp 44 Massif: heap allocs: 10
45 Massif: heap reallocs: 0
46 Massif: heap frees: 0
47 Massif: ignored heap allocs: ...
48 Massif: ignored heap frees: ...
49 Massif: ignored heap reallocs: ...
long-names.post.exp 3 Massif arguments: --stacks=no --time-unit=B --heap-admin=0 --massif-out-file=massif.out --detailed-freq=3 --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)
41 100.00% (4,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
49 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
realloc.stderr.exp 31 Massif: heap allocs: 1
32 Massif: heap reallocs: 3
33 Massif: heap frees: 1
34 Massif: ignored heap allocs: ...
35 Massif: ignored heap frees: ...
36 Massif: ignored heap reallocs: ...
basic.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)
64 98.04% (7,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
68 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
80 98.04% (11,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
84 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B
    [all...]
long-time.post.exp 3 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)
40 100.00% (2,300,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
48 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
56 100.00% (900,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
62 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
85 00.00% (0B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc
    [all...]
new-cpp.post.exp 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
44 99.73% (12,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
overloaded-new.post.exp 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
44 99.73% (12,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
  /art/runtime/gc/accounting/
mod_union_table.h 44 class Heap;
52 // A callback for visiting an object in the heap.
59 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space)
61 heap_(heap),
104 Heap* GetHeap() const {
114 Heap* const heap_;
121 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap,
123 : ModUnionTable(name, heap, space) {
    [all...]
  /prebuilts/go/darwin-x86/src/container/heap/
example_pq_test.go 5 // This example demonstrates a priority queue built using the heap interface.
9 "container/heap"
17 // The index is needed by update and is maintained by the heap.Interface methods.
18 index int // The index of the item in the heap.
21 // A PriorityQueue implements heap.Interface and holds Items.
57 heap.Fix(pq, item.index)
69 // establish the priority queue (heap) invariants.
80 heap.Init(&pq)
87 heap.Push(&pq, item)
92 item := heap.Pop(&pq).(*Item
    [all...]
  /prebuilts/go/linux-x86/src/container/heap/
example_pq_test.go 5 // This example demonstrates a priority queue built using the heap interface.
9 "container/heap"
17 // The index is needed by update and is maintained by the heap.Interface methods.
18 index int // The index of the item in the heap.
21 // A PriorityQueue implements heap.Interface and holds Items.
57 heap.Fix(pq, item.index)
69 // establish the priority queue (heap) invariants.
80 heap.Init(&pq)
87 heap.Push(&pq, item)
92 item := heap.Pop(&pq).(*Item
    [all...]
  /external/v8/src/snapshot/
deserializer.cc 11 #include "src/heap/heap-inl.h"
38 for (Page* p : *isolate_->heap()->code_space()) {
48 isolate_->heap()->RecordWritesIntoCode(code);
63 if (!isolate_->heap()->ReserveSpace(reservations_, &allocated_maps_))
93 isolate_->heap()->IterateStrongRoots(this, VISIT_ONLY_STRONG_ROOT_LIST);
94 isolate_->heap()->IterateSmiRoots(this);
95 isolate_->heap()->IterateStrongRoots(this, VISIT_ONLY_STRONG);
96 isolate_->heap()->RepairFreeListsAfterDeserialization();
97 isolate_->heap()->IterateWeakRoots(this, VISIT_ALL)
344 Heap* heap = isolate->heap(); local
404 Heap* heap = isolate_->heap(); local
    [all...]
  /art/runtime/gc/
allocation_record.cc 142 VLOG(heap) << "Start SweepAllocationRecords()";
170 VLOG(heap) << "Deleted " << count_deleted << " allocation records";
171 VLOG(heap) << "Updated " << count_moved << " allocation records";
219 Heap* heap = Runtime::Current()->GetHeap(); local
223 if (heap->IsAllocTrackingEnabled()) {
226 AllocRecordObjectMap* records = heap->GetAllocationRecords();
229 heap->SetAllocationRecords(records);
247 heap->SetAllocTrackingEnabled(true);
254 if (!heap->IsAllocTrackingEnabled())
281 Heap* const heap = Runtime::Current()->GetHeap(); local
    [all...]
  /prebuilts/go/darwin-x86/test/fixedbugs/
issue17318.go 25 return fmt.Sprintf("%d", int(e)) // ERROR "ent.String ... argument does not escape$" "int\(e\) escapes to heap$"
30 enqueue := func(i int) fmt.Stringer { // ERROR "func literal escapes to heap$"
31 return ops(i, j) // ERROR "ops\(i, j\) escapes to heap$"
42 f := func(i, j int) ent { // ERROR "func literal escapes to heap$"
46 fmt.Printf("foo(f,3)=%d\n", int(i)) // ERROR "int\(i\) escapes to heap$" "main ... argument does not escape$"
  /prebuilts/go/linux-x86/test/fixedbugs/
issue17318.go 25 return fmt.Sprintf("%d", int(e)) // ERROR "ent.String ... argument does not escape$" "int\(e\) escapes to heap$"
30 enqueue := func(i int) fmt.Stringer { // ERROR "func literal escapes to heap$"
31 return ops(i, j) // ERROR "ops\(i, j\) escapes to heap$"
42 f := func(i, j int) ent { // ERROR "func literal escapes to heap$"
46 fmt.Printf("foo(f,3)=%d\n", int(i)) // ERROR "int\(i\) escapes to heap$" "main ... argument does not escape$"
  /external/v8/src/
property-descriptor.cc 85 Heap* heap = isolate->heap(); local
86 if (key == heap->enumerable_string()) {
88 } else if (key == heap->configurable_string()) {
90 } else if (key == heap->value_string()) {
92 } else if (key == heap->writable_string()) {
94 } else if (key == heap->get_string()) {
98 } else if (key == heap->set_string()) {
138 isolate->heap()->ToBoolean(enumerable()))
    [all...]
isolate-inl.h 76 return exception != heap()->termination_exception();
122 // - You'd need to traverse the heap to check that no Array instance has
131 Cell* species_cell = heap()->species_protector();
137 PropertyCell* string_length_cell = heap()->string_length_protector();
142 Cell* fast_iteration_cell = heap()->fast_array_iteration_protector();
147 PropertyCell* buffer_neutering = heap()->array_buffer_neutering_protector();
152 PropertyCell* array_iterator_cell = heap()->array_iterator_protector();
transitions-inl.h 112 Heap* heap = name->GetHeap();
113 return name == heap->nonextensible_symbol() ||
114 name == heap->sealed_symbol() || name == heap->frozen_symbol() ||
115 name == heap->elements_transition_symbol() ||
116 name == heap->strict_function_transition_symbol();
  /external/v8/src/profiler/
heap-profiler.h 25 explicit HeapProfiler(Heap* heap);
80 Isolate* isolate() const { return heap()->isolate(); }
83 Heap* heap() const;

Completed in 1785 milliseconds

1 2 3 4 5 6 7 891011>>