HomeSort by relevance Sort by last modified time
    Searched defs:heap (Results 51 - 75 of 211) sorted by null

1 23 4 5 6 7 8 9

  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv30/
nv30_draw.c 283 struct nouveau_heap *heap = nv30_screen(pscreen)->vp_exec_heap; local
284 if (nouveau_heap_alloc(heap, 16, &r->vertprog, &r->vertprog)) {
285 while (heap->next && heap->size < 16) {
286 struct nouveau_heap **evict = heap->next->priv;
290 if (nouveau_heap_alloc(heap, 16, &r->vertprog, &r->vertprog))
nv30_transfer.c 73 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
78 if (nouveau_heap_alloc(heap, 2, &nv30->blit_vp, &nv30->blit_vp)) {
79 while (heap->next && heap->size < 2) {
80 struct nouveau_heap **evict = heap->next->priv;
84 if (nouveau_heap_alloc(heap, 2, &nv30->blit_vp, &nv30->blit_vp))
  /external/chromium_org/third_party/tcmalloc/chromium/src/
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
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/
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
    [all...]
  /external/chromium_org/v8/src/
disassembler.cc 121 Heap* heap = HEAP; local
256 Object* obj = heap->code_stubs()->SlowReverseLookup(code);
257 if (obj != heap->undefined_value()) {
objects-visiting-inl.h 112 Heap* heap = map->GetHeap(); local
118 heap,
122 heap,
251 Heap* heap, Address entry_address) {
253 heap->mark_compact_collector()->RecordCodeEntrySlot(entry_address, code);
254 StaticVisitor::MarkObject(heap, code);
260 Heap* heap, RelocInfo* rinfo)
347 Heap* heap = map->GetHeap(); local
370 Heap* heap = map->GetHeap(); local
394 Heap* heap = map->GetHeap(); local
409 Heap* heap = map->GetHeap(); local
457 Heap* heap = map->GetHeap(); local
506 Heap* heap = map->GetHeap(); local
    [all...]
spaces-inl.h 162 Page* Page::Initialize(Heap* heap,
172 heap->incremental_marking()->SetOldSpacePageFlags(chunk);
201 LargeObjectIterator iterator(HEAP->lo_space());
230 PointerChunkIterator::PointerChunkIterator(Heap* heap)
232 old_pointer_iterator_(heap->old_pointer_space()),
233 map_iterator_(heap->map_space()),
234 lo_iterator_(heap->lo_space()) { }
285 ASSERT(!heap()->linear_allocation() |
356 Heap* heap = object->GetHeap(); local
    [all...]
code-stubs.cc 54 UnseededNumberDictionary* stubs = isolate->heap()->code_stubs();
120 // Copy the generated code into a heap object.
135 Heap* heap = isolate->heap(); local
162 // Update the dictionary and the root in Heap.
165 Handle<UnseededNumberDictionary>(heap->code_stubs()),
168 heap->public_set_code_stubs(*dict);
175 heap->lo_space()->Contains(code) ||
176 heap->code_space()->FirstPage()->Contains(code->address()))
    [all...]
string-stream.cc 354 if (!HEAP->Contains(map) ||
388 Heap* heap = HEAP; local
391 if (element != heap->the_hole_value()) {
461 Heap* heap = isolate->heap(); local
462 if (!f->IsHeapObject() || !heap->Contains(HeapObject::cast(f))) {
467 !heap->Contains(map) |
    [all...]
  /external/chromium_org/v8/test/cctest/
test-serialize.cc 263 // Test that the whole heap can be serialized.
273 // Test that heap serialization is non-destructive.
285 // Tests that the heap can be deserialized.
296 HEAP->Verify();
300 CHECK(HEAP->string_table()->IsStringTable());
378 Heap* heap = isolate->heap(); local
396 heap->CollectAllGarbage(Heap::kNoGCFlags)
528 Heap* heap = isolate->heap(); local
    [all...]
  /external/mesa3d/src/gallium/drivers/nv30/
nv30_draw.c 283 struct nouveau_heap *heap = nv30_screen(pscreen)->vp_exec_heap; local
284 if (nouveau_heap_alloc(heap, 16, &r->vertprog, &r->vertprog)) {
285 while (heap->next && heap->size < 16) {
286 struct nouveau_heap **evict = heap->next->priv;
290 if (nouveau_heap_alloc(heap, 16, &r->vertprog, &r->vertprog))
nv30_transfer.c 73 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
78 if (nouveau_heap_alloc(heap, 2, &nv30->blit_vp, &nv30->blit_vp)) {
79 while (heap->next && heap->size < 2) {
80 struct nouveau_heap **evict = heap->next->priv;
84 if (nouveau_heap_alloc(heap, 2, &nv30->blit_vp, &nv30->blit_vp))
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
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.end(), compare)
    [all...]
  /external/v8/src/
disassembler.cc 121 Heap* heap = HEAP; local
256 Object* obj = heap->code_stubs()->SlowReverseLookup(code);
257 if (obj != heap->undefined_value()) {
spaces-inl.h 162 Page* Page::Initialize(Heap* heap,
172 heap->incremental_marking()->SetOldSpacePageFlags(chunk);
201 LargeObjectIterator iterator(HEAP->lo_space());
217 PointerChunkIterator::PointerChunkIterator(Heap* heap)
219 old_pointer_iterator_(heap->old_pointer_space()),
220 map_iterator_(heap->map_space()),
221 lo_iterator_(heap->lo_space()) { }
310 LargePage* LargePage::Initialize(Heap* heap, MemoryChunk* chunk)
340 Heap* heap = object->GetHeap(); local
    [all...]
string-stream.cc 345 if (!HEAP->Contains(map) ||
377 Heap* heap = HEAP; local
380 if (element != heap->the_hole_value()) {
450 Heap* heap = isolate->heap(); local
451 if (!f->IsHeapObject() || !heap->Contains(HeapObject::cast(f))) {
456 !heap->Contains(map) |
533 Heap* heap = HEAP; local
    [all...]
  /frameworks/av/media/libmedia/
IMediaPlayerService.cpp 91 const sp<IMemoryHeap>& heap, size_t *pSize)
96 data.writeStrongBinder(heap->asBinder());
112 const sp<IMemoryHeap>& heap, size_t *pSize)
119 data.writeStrongBinder(heap->asBinder());
226 sp<IMemoryHeap> heap = interface_cast<IMemoryHeap>(data.readStrongBinder()); local
231 status_t status = decode(url, &sampleRate, &numChannels, &format, heap, &size);
246 sp<IMemoryHeap> heap = interface_cast<IMemoryHeap>(data.readStrongBinder()); local
252 heap, &size);
  /frameworks/av/services/camera/libcameraservice/api1/client2/
CallbackProcessor.cpp 404 sp<IMemoryHeap> heap = local
407 uint8_t *data = (uint8_t*)heap->getBase() + offset;
442 // Only increment free if we're still using the same heap
StreamingProcessor.cpp 238 // Need to re-size consumer and heap
240 ALOGV("%s: Camera %d: Resetting recording heap and consumer",
320 // always acquire and free a buffer when the heap is full; otherwise the consumer
438 ALOGV("%s: Camera %d: %s started, recording heap has %d free of %d",
661 ALOGV("%s: Camera %d: Creating recording heap with %d buffers of "
704 sp<IMemoryHeap> heap = local
708 uint8_t *data = (uint8_t*)heap->getBase() + offset;
737 // Make sure this is for the current heap
740 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); local
741 if (heap->getHeapID() != mRecordingHeap->mHeap->getHeapID())
    [all...]
  /external/guava/guava/src/com/google/common/collect/
MinMaxPriorityQueue.java 62 * <a href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a>
64 * it stores elements in a single array, as compact as the traditional heap data
219 private final Heap minHeap;
220 private final Heap maxHeap;
228 this.minHeap = new Heap(ordering);
229 this.maxHeap = new Heap(ordering.reverse());
277 // Adds the element to the end of the heap and bubbles it up to the correct
371 * <p>Occasionally, in order to maintain the heap invariant, it must swap a
374 * first one is the element that was previously at the end of the heap and is
410 Heap heap = heapForIndex(index) local
538 Heap heap; local
    [all...]
  /art/runtime/base/
logging.h 312 bool heap; member in struct:art::LogVerbosity
  /external/chromium_org/sandbox/win/src/
sandbox_nt_util.cc 104 // Handle for our private heap.
159 // Create a new heap using default values for everything.
160 void* heap = g_nt.RtlCreateHeap(HEAP_GROWABLE, NULL, 0, 0, NULL, NULL); local
161 if (!heap)
164 if (NULL != _InterlockedCompareExchangePointer(&g_heap, heap, NULL)) {
166 g_nt.RtlDestroyHeap(heap);
  /external/chromium_org/third_party/openssl/openssl/crypto/ec/
ecp_smpl.c 1186 BIGNUM **heap = NULL; local
1217 heap = OPENSSL_malloc(pow2 * sizeof heap[0]);
1218 if (heap == NULL) goto err;
1222 * heap[1]
1223 * heap[2] heap[3]
1224 * heap[4] heap[5] heap[6] heap[7
    [all...]
  /external/chromium_org/v8/src/x64/
lithium-codegen-x64.h 80 Heap* heap() const { return isolate()->heap(); } function in class:v8::internal::BASE_EMBEDDED
  /external/openssl/crypto/ec/
ecp_smpl.c 1186 BIGNUM **heap = NULL; local
1217 heap = OPENSSL_malloc(pow2 * sizeof heap[0]);
1218 if (heap == NULL) goto err;
1222 * heap[1]
1223 * heap[2] heap[3]
1224 * heap[4] heap[5] heap[6] heap[7
    [all...]

Completed in 1242 milliseconds

1 23 4 5 6 7 8 9