HomeSort by relevance Sort by last modified time
    Searched refs:AllocateRaw (Results 1 - 10 of 10) sorted by null

  /external/v8/src/heap/
heap-inl.h 97 AllocationResult allocation = AllocateRaw(size, space, OLD_DATA_SPACE);
129 AllocationResult allocation = AllocateRaw(size, space, OLD_DATA_SPACE);
166 AllocationResult Heap::AllocateRaw(int size_in_bytes, AllocationSpace space,
183 allocation = new_space_.AllocateRaw(size_in_bytes);
195 allocation = old_pointer_space_->AllocateRaw(size_in_bytes);
197 allocation = old_data_space_->AllocateRaw(size_in_bytes);
200 allocation = code_space_->AllocateRaw(size_in_bytes);
203 allocation = lo_space_->AllocateRaw(size_in_bytes, EXECUTABLE);
206 allocation = lo_space_->AllocateRaw(size_in_bytes, NOT_EXECUTABLE);
208 allocation = cell_space_->AllocateRaw(size_in_bytes)
    [all...]
spaces-inl.h 248 AllocationResult PagedSpace::AllocateRaw(int size_in_bytes) {
274 AllocationResult NewSpace::AllocateRaw(int size_in_bytes) {
285 // The slow path above ultimately goes through AllocateRaw, so this suffices.
heap.cc     [all...]
spaces.h     [all...]
mark-compact.cc     [all...]
spaces.cc     [all...]
heap.h     [all...]
  /external/v8/test/cctest/
test-spaces.cc 356 Object* obj = new_space.AllocateRaw(
384 s->AllocateRaw(Page::kMaxRegularHeapObjectSize).ToObjectChecked();
402 Object* obj = lo->AllocateRaw(lo_size, NOT_EXECUTABLE).ToObjectChecked();
415 { AllocationResult allocation = lo->AllocateRaw(lo_size, NOT_EXECUTABLE);
423 CHECK(lo->AllocateRaw(lo_size, NOT_EXECUTABLE).IsRetry());
cctest.h 489 space->AllocateRaw(new_linear_size);
test-heap.cc     [all...]

Completed in 543 milliseconds