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

  /art/runtime/gc/accounting/
bitmap.cc 22 #include "mem_map.h"
28 Bitmap* Bitmap::CreateFromMemMap(MemMap* mem_map, size_t num_bits) {
29 CHECK(mem_map != nullptr);
30 return new Bitmap(mem_map, num_bits);
33 Bitmap::Bitmap(MemMap* mem_map, size_t bitmap_size)
34 : mem_map_(mem_map), bitmap_begin_(reinterpret_cast<uintptr_t*>(mem_map->Begin())),
48 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), nullptr, bitmap_size,
51 if (UNLIKELY(mem_map.get() == nullptr)) {
55 return mem_map.release()
59 auto* const mem_map = AllocateMemMap(name, num_bits); local
84 auto* const mem_map = Bitmap::AllocateMemMap(name, num_bits); local
    [all...]
read_barrier_table.h 24 #include "mem_map.h"
40 MemMap* mem_map = MemMap::MapAnonymous("read barrier table", nullptr, capacity, local
42 CHECK(mem_map != nullptr && mem_map->Begin() != nullptr)
44 mem_map_.reset(mem_map);
  /art/runtime/gc/space/
malloc_space.cc 38 MallocSpace::MallocSpace(const std::string& name, MemMap* mem_map,
42 : ContinuousMemMapAllocSpace(name, mem_map, begin, end, limit, kGcRetentionPolicyAlwaysCollect),
49 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(mem_map->Begin()), kGcCardSize);
50 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(mem_map->End()), kGcCardSize);
92 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity, local
94 if (mem_map == nullptr) {
98 return mem_map;
192 std::unique_ptr<MemMap> mem_map(GetMemMap()->RemapAtEnd(End(), alloc_space_name,
194 CHECK(mem_map.get() != nullptr) << error_msg;
198 uint8_t* end = mem_map->Begin() + starting_size_
    [all...]
dlmalloc_space.cc 39 DlMallocSpace::DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name,
42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects,
48 DlMallocSpace* DlMallocSpace::CreateFromMemMap(MemMap* mem_map, const std::string& name,
52 DCHECK(mem_map != nullptr);
53 void* mspace = CreateMspace(mem_map->Begin(), starting_size, initial_size);
60 uint8_t* end = mem_map->Begin() + starting_size;
66 uint8_t* begin = mem_map->Begin();
69 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit,
72 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity,
95 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity local
    [all...]
large_object_space.h 144 MemMap* mem_map; member in struct:art::gc::space::LargeObjectMapSpace::LargeObject
176 FreeListSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end);
rosalloc_space.cc 45 RosAllocSpace::RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name,
49 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects,
55 RosAllocSpace* RosAllocSpace::CreateFromMemMap(MemMap* mem_map, const std::string& name,
59 DCHECK(mem_map != nullptr);
63 allocator::RosAlloc* rosalloc = CreateRosAlloc(mem_map->Begin(), starting_size, initial_size,
71 uint8_t* end = mem_map->Begin() + starting_size;
77 uint8_t* begin = mem_map->Begin();
82 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit,
85 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity,
112 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity local
    [all...]
large_object_space.cc 48 delete m.second.mem_map;
137 MemMap* mem_map = MemMap::MapAnonymous("large object space allocation", nullptr, num_bytes, local
139 if (UNLIKELY(mem_map == nullptr)) {
143 mirror::Object* const obj = reinterpret_cast<mirror::Object*>(mem_map->Begin());
150 auto* obj_end = reinterpret_cast<mirror::Object*>(mem_map->End());
155 large_objects_.Put(obj, LargeObject {mem_map, false /* not zygote */});
156 const size_t allocation_size = mem_map->BaseSize();
198 MemMap* mem_map = it->second.mem_map; local
199 const size_t map_size = mem_map->BaseSize()
234 MemMap* mem_map = pair.second.mem_map; local
357 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, size, local
    [all...]
  /art/runtime/gc/collector/
mark_sweep.cc 104 MemMap* mem_map = MemMap::MapAnonymous( local
108 CHECK(mem_map != nullptr) << "Couldn't allocate sweep array free buffer: " << error_msg;
109 sweep_array_free_buffer_mem_map_.reset(mem_map);
    [all...]
  /art/runtime/interpreter/
unstarted_runtime.cc 425 std::unique_ptr<MemMap> mem_map; local
430 mem_map = FindAndExtractEntry(jar_file, resource_cstr, &map_size, &last_error_msg);
431 if (mem_map != nullptr) {
436 if (mem_map == nullptr) {
455 memcpy(h_array->GetData(), mem_map->Begin(), map_size);
457 mem_map.release();
    [all...]
  /art/runtime/gc/
heap.cc 655 space::MallocSpace* Heap::CreateMallocSpaceFromMemMap(MemMap* mem_map,
2477 MemMap* mem_map = main_space_->ReleaseMemMap(); local
    [all...]

Completed in 2492 milliseconds