HomeSort by relevance Sort by last modified time
    Searched refs:Heap (Results 226 - 250 of 475) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /art/runtime/mirror/
string-inl.h 27 #include "gc/heap-inl.h"
236 gc::Heap* heap = Runtime::Current()->GetHeap(); local
238 heap->AllocObjectWithAllocator<kIsInstrumented, true>(self, string_class, alloc_size,
  /external/v8/src/ia32/
code-stubs-ia32.cc 101 // be either a smi or a heap number object (fp value). Requirements:
159 // Load x87 register with heap number.
281 __ SmiTag(edx); // Retag smi for heap number overwriting test.
286 __ SmiTag(eax); // Retag smi for heap number overwriting test.
    [all...]
macro-assembler-ia32.cc 29 Handle<Object>::New(isolate()->heap()->undefined_value(), isolate());
67 void MacroAssembler::LoadRoot(Register destination, Heap::RootListIndex index) {
68 if (isolate()->heap()->RootCanBeTreatedAsConstant(index)) {
69 mov(destination, isolate()->heap()->root_handle(index));
83 Heap::RootListIndex index) {
84 DCHECK(Heap::RootCanBeWrittenAfterInitialization(index));
95 Heap::RootListIndex index) {
105 void MacroAssembler::CompareRoot(Register with, Heap::RootListIndex index) {
106 DCHECK(isolate()->heap()->RootCanBeTreatedAsConstant(index));
107 cmp(with, isolate()->heap()->root_handle(index))
    [all...]
  /external/v8/src/
lookup.h 161 Heap* heap() const { return isolate_->heap(); } function in class:v8::internal::BASE_EMBEDDED
261 if (*name_ == heap()->is_concat_spreadable_symbol() ||
262 *name_ == heap()->constructor_string() ||
263 *name_ == heap()->species_symbol() ||
264 *name_ == heap()->has_instance_symbol() ||
265 *name_ == heap()->iterator_symbol()) {
contexts.cc 26 copy->set_map(isolate->heap()->script_context_table_map());
526 Heap* heap = GetHeap();
556 // Always trim even when array is cleared because of heap verifier.
557 heap->RightTrimFixedArray(code_map, length - dst);
584 Object* context = isolate->heap()->native_contexts_list();
725 return isolate->heap()->gc_state() != Heap::NOT_IN_GC ||
isolate.cc 959 heap()->CollectAllGarbage(Heap::kNoGCFlags,
964 return heap()->exception();
    [all...]
code-stubs.cc 17 #include "src/heap/heap-inl.h"
77 UnseededNumberDictionary* stubs = isolate()->heap()->code_stubs();
119 Heap* heap = isolate_->heap(); local
120 Handle<UnseededNumberDictionary> dict(heap->code_stubs());
122 heap->SetRootCodeStubs(*dict);
146 // Copy the generated code into a heap object.
155 Heap* heap = isolate()->heap() local
    [all...]
api.cc 56 #include "src/profiler/heap-profiler.h"
57 #include "src/profiler/heap-snapshot-generator-inl.h"
305 char last_few_messages[Heap::kTraceRingBufferSize + 1];
306 char js_stacktrace[Heap::kStacktraceBufferSize + 1];
312 memset(last_few_messages, 0x0badc0de, Heap::kTraceRingBufferSize + 1);
313 memset(js_stacktrace, 0x0badc0de, Heap::kStacktraceBufferSize + 1);
321 memset(last_few_messages, 0, Heap::kTraceRingBufferSize + 1);
322 memset(js_stacktrace, 0, Heap::kStacktraceBufferSize + 1);
372 if (isolate->heap()->HasBeenSetUp()) {
375 isolate->heap()->RecordStats(&heap_stats, false)
1038 i::Heap* heap = reinterpret_cast<i::Isolate*>(GetIsolate())->heap(); local
7981 i::Heap* heap = reinterpret_cast<i::Isolate*>(this)->heap(); local
8314 i::Heap* heap = isolate->heap(); local
8342 i::Heap* heap = isolate->heap(); local
8356 i::Heap* heap = isolate->heap(); local
8367 i::Heap* heap = isolate->heap(); local
    [all...]
objects-inl.h 25 #include "src/heap/heap-inl.h"
26 #include "src/heap/heap.h"
216 return this == isolate->heap()->Value(); \
219 return this == isolate->heap()->Value(); \
225 Heap* heap = isolate->heap(); local
226 return this == heap->null_value() || this == heap->undefined_value()
230 Heap* heap = isolate->heap(); local
424 Heap* heap = GetHeap(); local
1446 Heap* heap = MemoryChunk::FromAddress( local
    [all...]
  /external/v8/src/mips/
assembler-mips-inl.h 390 void RelocInfo::Visit(Heap* heap) {
393 StaticVisitor::VisitEmbeddedPointer(heap, this);
395 StaticVisitor::VisitCodeTarget(heap, this);
397 StaticVisitor::VisitCell(heap, this);
404 StaticVisitor::VisitCodeAgeSequence(heap, this);
407 StaticVisitor::VisitDebugTarget(heap, this);
  /external/v8/src/mips64/
assembler-mips64-inl.h 372 void RelocInfo::Visit(Heap* heap) {
375 StaticVisitor::VisitEmbeddedPointer(heap, this);
377 StaticVisitor::VisitCodeTarget(heap, this);
379 StaticVisitor::VisitCell(heap, this);
386 StaticVisitor::VisitCodeAgeSequence(heap, this);
389 StaticVisitor::VisitDebugTarget(heap, this);
  /external/v8/src/x87/
macro-assembler-x87.cc 29 Handle<Object>::New(isolate()->heap()->undefined_value(), isolate());
67 void MacroAssembler::LoadRoot(Register destination, Heap::RootListIndex index) {
68 if (isolate()->heap()->RootCanBeTreatedAsConstant(index)) {
69 mov(destination, isolate()->heap()->root_handle(index));
83 Heap::RootListIndex index) {
84 DCHECK(Heap::RootCanBeWrittenAfterInitialization(index));
95 Heap::RootListIndex index) {
105 void MacroAssembler::CompareRoot(Register with, Heap::RootListIndex index) {
106 DCHECK(isolate()->heap()->RootCanBeTreatedAsConstant(index));
107 cmp(with, isolate()->heap()->root_handle(index))
    [all...]
code-stubs-x87.cc 97 // be either a smi or a heap number object (fp value). Requirements:
781 // Test for NaN. Compare heap numbers in a general way,
822 // Check whether the non-smi is a heap number.
832 // Check if the non-smi operand is a heap number.
835 // If heap number, handle it in the slow case.
    [all...]
  /system/core/libmemunreachable/tests/
LeakFolding_test.cpp 39 Heap heap_;
  /art/runtime/
common_runtime_test.cc 37 #include "gc/heap.h"
392 std::string min_heap_string(StringPrintf("-Xms%zdm", gc::Heap::kDefaultInitialSize / MB));
393 std::string max_heap_string(StringPrintf("-Xmx%zdm", gc::Heap::kDefaultMaximumSize / MB));
460 // Create the heap thread pool so that the GC runs in parallel for tests. Normally, the thread
463 runtime_->GetHeap()->VerifyHeap(); // Check for heap corruption before the test
507 runtime_->GetHeap()->VerifyHeap(); // Check for heap corruption after the test
  /art/runtime/entrypoints/
entrypoint_utils-inl.h 215 gc::Heap* heap = Runtime::Current()->GetHeap(); local
219 return klass->Alloc</*kInstrumented*/true, false>(self, heap->GetCurrentAllocator()).Ptr();
288 gc::Heap* heap = Runtime::Current()->GetHeap(); local
294 heap->GetCurrentAllocator());
    [all...]
  /external/v8/src/profiler/
heap-snapshot-generator.cc 5 #include "src/profiler/heap-snapshot-generator.h"
17 #include "src/profiler/heap-profiler.h"
18 #include "src/profiler/heap-snapshot-generator-inl.h"
167 // It is very important to keep objects that form a heap snapshot
361 HeapObjectsMap::HeapObjectsMap(Heap* heap)
362 : next_id_(kFirstAvailableObjectId), heap_(heap) {
473 heap_->CollectAllGarbage(Heap::kMakeHeapIterableMask,
762 : heap_(snapshot->profiler()->heap_object_map()->heap()),
    [all...]
  /prebuilts/go/darwin-x86/src/runtime/
time.go 16 i int // heap index
62 // startTimer adds t to the timer heap.
71 // stopTimer removes t from the timer heap if it is there.
91 // Add a timer to the heap and start or kick timerproc if the new timer is
120 // Delete timer t from the heap.
124 // Discard result, because t might be moving in the heap.
152 // It sleeps until the next event in the timers heap.
172 // leave in heap but adjust next time to fire
176 // remove from heap
236 // Heap maintenance algorithms
    [all...]
  /prebuilts/go/darwin-x86/test/bench/garbage/
parser.go 90 // Once the heap is grown to full size, reset counters.
116 fmt.Printf("Alloc=%d/%d Heap=%d Mallocs=%d PauseTime=%.3f/%d = %.3f\n",
152 "container/heap",
  /prebuilts/go/darwin-x86/test/fixedbugs/
issue13799.go 23 fmt.Println(iter) // ERROR "iter escapes to heap$" "main ... argument does not escape$"
37 m := make(map[int][]int) // ERROR "make\(map\[int\]\[\]int\) escapes to heap$"
45 // Heap -> stack pointer eventually causes badness when stack reallocation
48 var fn func() // ERROR "moved to heap: fn$"
49 for i := 0; i < maxI; i++ { // ERROR "moved to heap: i$"
50 // var fn func() // this makes it work, because fn stays off heap
51 j := 0 // ERROR "moved to heap: j$"
52 fn = func() { // ERROR "func literal escapes to heap$"
53 m[i] = append(m[i], 0) // ERROR "&i escapes to heap$"
54 if j < 25 { // ERROR "&j escapes to heap$
    [all...]
  /prebuilts/go/linux-x86/src/runtime/
time.go 16 i int // heap index
62 // startTimer adds t to the timer heap.
71 // stopTimer removes t from the timer heap if it is there.
91 // Add a timer to the heap and start or kick timerproc if the new timer is
120 // Delete timer t from the heap.
124 // Discard result, because t might be moving in the heap.
152 // It sleeps until the next event in the timers heap.
172 // leave in heap but adjust next time to fire
176 // remove from heap
236 // Heap maintenance algorithms
    [all...]
  /prebuilts/go/linux-x86/test/bench/garbage/
parser.go 90 // Once the heap is grown to full size, reset counters.
116 fmt.Printf("Alloc=%d/%d Heap=%d Mallocs=%d PauseTime=%.3f/%d = %.3f\n",
152 "container/heap",
  /prebuilts/go/linux-x86/test/fixedbugs/
issue13799.go 23 fmt.Println(iter) // ERROR "iter escapes to heap$" "main ... argument does not escape$"
37 m := make(map[int][]int) // ERROR "make\(map\[int\]\[\]int\) escapes to heap$"
45 // Heap -> stack pointer eventually causes badness when stack reallocation
48 var fn func() // ERROR "moved to heap: fn$"
49 for i := 0; i < maxI; i++ { // ERROR "moved to heap: i$"
50 // var fn func() // this makes it work, because fn stays off heap
51 j := 0 // ERROR "moved to heap: j$"
52 fn = func() { // ERROR "func literal escapes to heap$"
53 m[i] = append(m[i], 0) // ERROR "&i escapes to heap$"
54 if j < 25 { // ERROR "&j escapes to heap$
    [all...]
  /external/v8/src/builtins/
builtins-array.cc 371 if (len == 0) return isolate->heap()->undefined_value();
393 Heap* heap = isolate->heap(); local
402 if (len == 0) return heap->undefined_value();
    [all...]
builtins-date.cc     [all...]

Completed in 570 milliseconds

1 2 3 4 5 6 7 8 91011>>