/external/mesa3d/src/gallium/drivers/nv30/ |
H A D | nv30_vertprog.c | 87 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local 92 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) { 93 while (heap->next && heap->size < vp->nr_insns) { 94 struct nouveau_heap **evict = heap->next->priv; 98 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) { 130 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local 135 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) { 136 while (heap->next && heap [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | mm.c | 34 mmDumpMemInfo(const struct mem_block *heap) argument 36 fprintf(stderr, "Memory heap %p:\n", (void *)heap); 37 if (heap == 0) { 38 fprintf(stderr, " heap == 0\n"); 42 for(p = heap->next; p != heap; p = p->next) { 50 for(p = heap->next_free; p != heap; p = p->next_free) { 63 struct mem_block *heap, *bloc local 168 mmAllocMem(struct mem_block *heap, unsigned size, unsigned align2, unsigned startSearch) argument 201 mmFindBlock(struct mem_block *heap, unsigned start) argument 269 mmDestroy(struct mem_block *heap) argument [all...] |
/external/bzip2/ |
H A D | huffman.c | 36 zz = z; tmp = heap[zz]; \ 37 while (weight[tmp] < weight[heap[zz >> 1]]) { \ 38 heap[zz] = heap[zz >> 1]; \ 41 heap[zz] = tmp; \ 47 zz = z; tmp = heap[zz]; \ 52 weight[heap[yy+1]] < weight[heap[yy]]) \ 54 if (weight[tmp] < weight[heap[yy]]) break; \ 55 heap[z 75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
H A D | pb_bufmgr_mm.c | 59 struct mem_block *heap; member in struct:mm_pb_manager 204 mm_buf->block = u_mmAllocMem(mm->heap, (int)size, (int)mm->align2, 0); 207 debug_printf("warning: heap full\n"); 208 mmDumpMemInfo(mm->heap); 238 u_mmDestroy(mm->heap); 279 mm->heap = u_mmInit(0, (int)size); 280 if (!mm->heap) 286 if(mm->heap) 287 u_mmDestroy(mm->heap);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/ |
H A D | nv50_program.c | 376 struct nouveau_heap *heap; local 381 case PIPE_SHADER_VERTEX: heap = nv50->screen->vp_code_heap; break; 382 case PIPE_SHADER_GEOMETRY: heap = nv50->screen->fp_code_heap; break; 383 case PIPE_SHADER_FRAGMENT: heap = nv50->screen->gp_code_heap; break; 389 ret = nouveau_heap_alloc(heap, size, prog, &prog->mem); 394 while (heap->next) { 395 struct nv50_program *evict = heap->next->priv;
|
/external/chromium_org/v8/src/ |
H A D | handles-inl.h | 11 #include "src/heap/heap.h" 61 Heap* heap = heap_object->GetHeap(); local 63 Object** roots_array_start = heap->roots_array_start(); 66 heap->RootCanBeTreatedAsConstant( 77 return !heap->isolate()->IsDeferredHandle(handle);
|
H A D | lithium-codegen.h | 32 Heap* heap() const { return isolate()->heap(); } function in class:v8::internal::BASE_EMBEDDED
|
H A D | heap-profiler.cc | 7 #include "src/heap-profiler.h" 10 #include "src/heap-snapshot-generator-inl.h" 15 HeapProfiler::HeapProfiler(Heap* heap) argument 16 : ids_(new HeapObjectsMap(heap)), 17 names_(new StringsStorage(heap)), 37 names_.Reset(new StringsStorage(heap())); 71 HeapSnapshotGenerator generator(result, control, resolver, heap()); 99 heap()->DisableInlineAllocation(); 113 heap()->EnableInlineAllocation(); 171 heap() [all...] |
H A D | lithium-codegen.cc | 171 Heap* heap = isolate->heap(); local 172 heap->EnsureWeakObjectToCodeTable(); 173 Handle<DependentCode> dep(heap->LookupWeakObjectToCodeDependency(object)); 175 heap->AddWeakObjectToCodeDependency(object, dep);
|
/external/chromium_org/v8/src/heap/ |
H A D | objects-visiting.cc | 7 #include "src/heap/objects-visiting.h" 180 static bool MustRecordSlots(Heap* heap) { argument 181 return heap->gc_state() == Heap::MARK_COMPACT && 182 heap->mark_compact_collector()->is_compacting(); 191 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer) { argument 192 Object* undefined = heap->undefined_value(); 195 MarkCompactCollector* collector = heap->mark_compact_collector(); 196 bool record_slots = MustRecordSlots(heap); 222 WeakListVisitor<T>::VisitLiveObject(heap, tail, retainer); 224 WeakListVisitor<T>::VisitPhantomObject(heap, candidat 240 ClearWeakList(Heap* heap, Object* list) argument 298 VisitLiveObject(Heap* heap, Context* context, WeakObjectRetainer* retainer) argument 308 DoWeakList(Heap* heap, Context* context, WeakObjectRetainer* retainer, int index) argument 325 VisitPhantomObject(Heap* heap, Context* context) argument 360 VisitLiveObject(Heap* heap, JSArrayBuffer* array_buffer, WeakObjectRetainer* retainer) argument 372 VisitPhantomObject(Heap* heap, JSArrayBuffer* phantom) argument [all...] |
H A D | gc-tracer.cc | 7 #include "src/heap/gc-tracer.h" 12 static intptr_t CountTotalHolesSize(Heap* heap) { argument 14 OldSpaces spaces(heap); 82 GCTracer::GCTracer(Heap* heap) argument 83 : heap_(heap),
|
H A D | objects-visiting.h | 189 INLINE(static void IteratePointers(Heap* heap, HeapObject* object, 195 StaticVisitor::VisitPointers(heap, start_slot, end_slot); 257 INLINE(static void VisitPointers(Heap* heap, Object** start, Object** end)) { argument 258 for (Object** p = start; p < end; p++) StaticVisitor::VisitPointer(heap, p); 263 Heap* heap = map->GetHeap(); local 264 VisitPointers(heap, 271 heap, HeapObject::RawField(object, 341 // Base class for visitors used to transitively mark the entire heap. 365 INLINE(static void VisitCodeEntry(Heap* heap, Address entry_address)); 366 INLINE(static void VisitEmbeddedPointer(Heap* heap, RelocInf 374 INLINE(static void VisitNextCodeLink(Heap* heap, Object** slot)) argument [all...] |
H A D | spaces-inl.h | 8 #include "src/heap/spaces.h" 9 #include "src/heap-profiler.h" 136 Page* Page::Initialize(Heap* heap, MemoryChunk* chunk, Executability executable, argument 144 heap->incremental_marking()->SetOldSpacePageFlags(chunk); 169 MemoryChunk* MemoryChunk::FromAnyPointerAddress(Heap* heap, Address addr) { argument 173 LargeObjectIterator iterator(heap->lo_space()); 202 PointerChunkIterator::PointerChunkIterator(Heap* heap) argument 204 old_pointer_iterator_(heap->old_pointer_space()), 205 map_iterator_(heap->map_space()), 206 lo_iterator_(heap 292 Initialize(Heap* heap, MemoryChunk* chunk) argument 305 Heap* heap = object->GetHeap(); local [all...] |
H A D | store-buffer.h | 30 explicit StoreBuffer(Heap* heap); 42 // This is used by the heap traversal to enter the addresses into the store 180 explicit StoreBufferRebuildScope(Heap* heap, StoreBuffer* store_buffer, argument 187 (*callback)(heap, NULL, kStoreBufferStartScanningPagesEvent);
|
/external/chromium_org/v8/src/ic/ |
H A D | ic-inl.h | 99 Heap* heap = target->GetHeap(); local 112 if (heap->gc_state() == Heap::MARK_COMPACT) { 113 heap->mark_compact_collector()->RecordCodeTargetPatch(address, target); 115 heap->incremental_marking()->RecordCodeTargetPatch(address, target);
|
/external/fio/lib/ |
H A D | prio_tree.c | 20 * A clever mix of heap and radix trees forms a radix priority search tree (PST) 44 unsigned long *radix, unsigned long *heap) 47 *heap = node->last; 43 get_index(const struct prio_tree_node *node, unsigned long *radix, unsigned long *heap) argument
|
/external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
H A D | pb_bufmgr_mm.c | 59 struct mem_block *heap; member in struct:mm_pb_manager 204 mm_buf->block = u_mmAllocMem(mm->heap, (int)size, (int)mm->align2, 0); 207 debug_printf("warning: heap full\n"); 208 mmDumpMemInfo(mm->heap); 238 u_mmDestroy(mm->heap); 279 mm->heap = u_mmInit(0, (int)size); 280 if (!mm->heap) 286 if(mm->heap) 287 u_mmDestroy(mm->heap);
|
/external/mesa3d/src/gallium/drivers/nv50/ |
H A D | nv50_program.c | 376 struct nouveau_heap *heap; local 381 case PIPE_SHADER_VERTEX: heap = nv50->screen->vp_code_heap; break; 382 case PIPE_SHADER_GEOMETRY: heap = nv50->screen->fp_code_heap; break; 383 case PIPE_SHADER_FRAGMENT: heap = nv50->screen->gp_code_heap; break; 389 ret = nouveau_heap_alloc(heap, size, prog, &prog->mem); 394 while (heap->next) { 395 struct nv50_program *evict = heap->next->priv;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | thread_cache.cc | 155 // Remove some objects of class "cl" from central cache and add to thread heap. 221 // Remove some objects of class "cl" from thread heap and add to central cache 350 ThreadCache* heap = NULL; local 372 // In that case, the heap for this thread has already been created 376 heap = h; 381 if (heap == NULL) heap = NewHeap(me); 388 if (!heap->in_setspecific_ && tsd_inited_) { 389 heap->in_setspecific_ = true; 390 perftools_pthread_setspecific(heap_key_, heap); 402 ThreadCache *heap = threadcache_allocator.New(); local 453 DeleteCache(ThreadCache* heap) argument [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | thread_cache.cc | 152 // Remove some objects of class "cl" from central cache and add to thread heap. 215 // Remove some objects of class "cl" from thread heap and add to central cache 339 ThreadCache* heap = NULL; local 361 // In that case, the heap for this thread has already been created 365 heap = h; 370 if (heap == NULL) heap = NewHeap(me); 377 if (!heap->in_setspecific_ && tsd_inited_) { 378 heap->in_setspecific_ = true; 379 perftools_pthread_setspecific(heap_key_, heap); 391 ThreadCache *heap = threadcache_allocator.New(); local 442 DeleteCache(ThreadCache* heap) argument [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-changes-lowering.cc | 158 Heap* heap() { return this->isolate()->heap(); } function in class:ChangesLoweringTester 278 Object* true_obj = t.heap()->true_value(); 284 Object* false_obj = t.heap()->false_value(); 297 Object* true_obj = t.heap()->true_value(); 303 Object* false_obj = t.heap()->false_value(); 356 if (m == 0) CcTest::heap()->EnableInlineAllocation(); 357 if (m == 1) CcTest::heap()->DisableInlineAllocation(); 358 if (m == 2) SimulateFullSpace(CcTest::heap()->new_space()); 378 if (m == 0) CcTest::heap() [all...] |
/external/chromium_org/v8/test/cctest/ |
H A D | test-constantpool.cc | 234 Heap* heap = isolate->heap(); local 247 // If interpreted as a pointer, this should be right inside the heap number 257 heap->CollectGarbage(NEW_SPACE); 273 Heap* heap = isolate->heap(); local 282 // Start a second old-space page so that the heap pointer added to the 284 Page* first_page = heap->old_data_space()->anchor()->next_page(); 289 CHECK(heap->InOldDataSpace(temp->address())); 292 CHECK(heap [all...] |
H A D | test-global-handles.cc | 40 static bool CanSkipCallback(Heap* heap, Object** pointer) { argument 350 isolate->heap()->CollectAllAvailableGarbage();
|
H A D | test-spaces.cc | 76 // Initialized Page has heap pointer, normally set by memory_allocator. 77 p->heap_ = CcTest::heap(); 151 Heap* heap, 158 CHECK(memory_allocator->SetUp(heap->MaxReserved(), 159 heap->MaxExecutableSize())); 208 Heap* heap = isolate->heap(); local 211 memory_allocator->SetUp(heap->MaxReserved(), heap->MaxExecutableSize())); 242 Heap* heap local 150 VerifyMemoryChunk(Isolate* isolate, Heap* heap, CodeRange* code_range, size_t reserve_area_size, size_t commit_area_size, size_t second_commit_area_size, Executability executable) argument 296 Heap* heap = isolate->heap(); local 343 Heap* heap = isolate->heap(); local 369 Heap* heap = isolate->heap(); local [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | shortest-path.h | 281 vector<StateId> heap; local 291 heap.push_back(final); 293 while (!heap.empty()) { 294 pop_heap(heap.begin(), heap.end(), compare); 295 StateId state = heap.back(); 297 heap.pop_back(); 317 heap.push_back(next); 318 push_heap(heap.begin(), heap [all...] |