| /external/chromium_org/third_party/WebKit/Source/platform/ |
| Timer.cpp | 42 // Timers are stored in a heap data structure, used to implement a priority queue.
81 Vector<TimerBase*>& heap = timer->timerHeap(); local
82 if (&m_reference >= heap.data() && &m_reference < heap.data() + heap.size())
83 timer->m_heapIndex = &m_reference - heap.data();
105 // Class to represent iterators in the heap when calling the standard library heap algorithms.
106 // Uses a custom pointer and reference type that update indices for pointers in the heap.
171 // The comparisons below are "backwards" because the heap puts the larges
337 const Vector<TimerBase*>& heap = timerHeap(); local
[all...] |
| /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/ |
| allocation-tracker.cc | 9 #include "src/heap-snapshot-generator.h"
226 Heap* heap = ids_->heap(); local
228 // Mark the new block as FreeSpace to make sure the heap is iterable
230 FreeListNode::FromAddress(addr)->set_size(heap, size);
234 Isolate* isolate = heap->isolate();
280 // Converting start offset into line and column may cause heap
|
| code-stubs.cc | 66 UnseededNumberDictionary* stubs = isolate()->heap()->code_stubs();
123 // Copy the generated code into a heap object.
136 Heap* heap = isolate()->heap(); local
166 // Update the dictionary and the root in Heap.
169 Handle<UnseededNumberDictionary>(heap->code_stubs()),
172 heap->public_set_code_stubs(*dict);
179 heap->lo_space()->Contains(code) ||
180 heap->code_space()->FirstPage()->Contains(code->address()))
[all...] |
| string-stream.cc | 364 Heap* heap = array->GetHeap(); local
367 if (element != heap->the_hole_value()) {
439 Heap* heap = isolate->heap(); local
440 if (!heap->Contains(obj)) return;
443 !heap->Contains(map) ||
452 heap->Contains(HeapObject::cast(perhaps_context)) &&
455 if (!heap->Contains(context))
475 Heap* heap = HeapObject::cast(f)->GetHeap(); local
[all...] |
| types.cc | 192 Heap* heap = map->GetHeap(); local
193 if (map == heap->undefined_map()) return kUndefined;
194 if (map == heap->null_map()) return kNull;
195 if (map == heap->boolean_map()) return kBoolean;
196 DCHECK(map == heap->the_hole_map() ||
197 map == heap->uninitialized_map() ||
198 map == heap->no_interceptor_result_sentinel_map() ||
199 map == heap->termination_exception_map() ||
200 map == heap->arguments_marker_map())
[all...] |
| /external/chromium_org/v8/src/heap/ |
| 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,
144 heap->incremental_marking()->SetOldSpacePageFlags(chunk);
169 MemoryChunk* MemoryChunk::FromAnyPointerAddress(Heap* heap, Address addr) {
173 LargeObjectIterator iterator(heap->lo_space());
202 PointerChunkIterator::PointerChunkIterator(Heap* heap)
305 Heap* heap = object->GetHeap(); local
[all...] |
| objects-visiting-inl.h | 81 Heap* heap = map->GetHeap(); local
85 VisitPointers(heap, HeapObject::RawField(
89 heap, HeapObject::RawField(
207 Heap* heap, Address entry_address) {
209 heap->mark_compact_collector()->RecordCodeEntrySlot(entry_address, code);
210 StaticVisitor::MarkObject(heap, code);
216 Heap* heap, RelocInfo* rinfo)
307 Heap* heap = map->GetHeap(); local
330 Heap* heap = map->GetHeap(); local
355 Heap* heap = map->GetHeap(); local
381 Heap* heap = map->GetHeap(); local
415 Heap* heap = map->GetHeap(); local
427 Heap* heap = map->GetHeap(); local
477 Heap* heap = map->GetHeap(); local
508 Heap* heap = map->GetHeap(); local
557 Heap* heap = map->GetHeap(); local
[all...] |
| heap-inl.h | 12 #include "src/heap/heap.h"
13 #include "src/heap/store-buffer.h"
14 #include "src/heap/store-buffer-inl.h"
15 #include "src/heap-profiler.h"
47 SemiSpace::AssertValidRange(target->GetIsolate()->heap()->new_space()->top(),
54 bool inline Heap::IsOneByte(Vector<const char> str, int chars) {
61 bool inline Heap::IsOneByte(String* str, int chars) {
66 AllocationResult Heap::AllocateInternalizedStringFromUtf8(
77 AllocationResult Heap::AllocateInternalizedStringImpl(T t, int chars
538 Heap* heap = object->GetHeap(); local
[all...] |
| incremental-marking.cc | 7 #include "src/heap/incremental-marking.h"
12 #include "src/heap/objects-visiting.h"
13 #include "src/heap/objects-visiting-inl.h"
19 IncrementalMarking::IncrementalMarking(Heap* heap)
20 : heap_(heap),
53 IncrementalMarking* marking = isolate->heap()->incremental_marking();
179 Heap* heap = map->GetHeap(); local
192 VisitPointersWithAnchor(heap, HeapObject::RawField(object, 0)
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| 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()
[all...] |
| 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 = isolate->heap(); local
296 Heap* heap = isolate->heap(); local
343 Heap* heap = isolate->heap(); local
369 Heap* heap = isolate->heap(); local
[all...] |
| test-mark-compact.cc | 79 TestHeap* heap = CcTest::test_heap(); local
80 heap->ConfigureHeap(1, 1, 1, 0);
88 Object* obj = heap->AllocateFixedArray(array_length).ToObjectChecked();
92 CHECK(heap->InSpace(*array, NEW_SPACE));
95 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask);
96 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask);
99 CHECK(heap->InSpace(*array, OLD_POINTER_SPACE));
105 TestHeap* heap = CcTest::test_heap() local
132 TestHeap* heap = CcTest::test_heap(); local
254 TestHeap* heap = CcTest::test_heap(); local
[all...] |
| test-serialize.cc | 37 #include "src/heap/spaces.h"
209 internal_isolate->heap()->CollectAllGarbage(Heap::kNoGCFlags, "serialize");
214 // Test that the whole heap can be serialized.
225 // Test that heap serialization is non-destructive.
238 // Tests that the heap can be deserialized.
306 isolate->heap()->Verify();
310 CHECK(isolate->heap()->string_table()->IsStringTable());
403 Heap* heap = isolate->heap() local
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/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 | 306 bool heap; member in struct:art::LogVerbosity
|
| /external/chromium_org/sandbox/win/src/ |
| sandbox_nt_util.cc | 107 // Handle for our private heap.
162 // Create a new heap using default values for everything.
163 void* heap = g_nt.RtlCreateHeap(HEAP_GROWABLE, NULL, 0, 0, NULL, NULL); local
164 if (!heap)
167 if (NULL != _InterlockedCompareExchangePointer(&g_heap, heap, NULL)) {
169 g_nt.RtlDestroyHeap(heap);
|
| /art/runtime/mirror/ |
| class.cc | 870 gc::Heap* heap = Runtime::Current()->GetHeap(); local
876 ? heap->AllocObject<true>(self, java_lang_Class_.Read(), new_length, visitor)
877 : heap->AllocNonMovableObject<true>(self, java_lang_Class_.Read(), new_length, visitor);
|
| /external/chromium_org/third_party/zlib/ |
| deflate.h | 46 /* maximum heap size */
208 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
209 int heap_len; /* number of elements in the heap */
211 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
212 * The same heap array is used to build all trees.
|
| /external/chromium_org/v8/src/ic/arm/ |
| ic-arm.cc | 193 __ LoadRoot(ip, Heap::kFixedArrayMapRootIndex);
206 __ LoadRoot(ip, Heap::kTheHoleValueRootIndex);
297 Heap* heap = masm->isolate()->heap(); local
312 Handle<Map> arguments_map(heap->sloppy_arguments_elements_map());
332 __ LoadRoot(scratch3, Heap::kTheHoleValueRootIndex);
359 Handle<Map> fixed_array_map(masm->isolate()->heap()->fixed_array_map());
462 __ LoadRoot(ip, Heap::kHashTableMapRootIndex);
485 __ LoadRoot(ip, Heap::kHashTableMapRootIndex)
[all...] |
