| /art/runtime/gc/accounting/ |
| bitmap.cc | 24 #include "mem_map.h"
30 Bitmap* Bitmap::CreateFromMemMap(MemMap* mem_map, size_t num_bits) {
31 CHECK(mem_map != nullptr);
32 return new Bitmap(mem_map, num_bits);
35 Bitmap::Bitmap(MemMap* mem_map, size_t bitmap_size)
36 : mem_map_(mem_map), bitmap_begin_(reinterpret_cast<uintptr_t*>(mem_map->Begin())),
50 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), nullptr, bitmap_size,
53 if (UNLIKELY(mem_map.get() == nullptr)) {
57 return mem_map.release()
61 auto* const mem_map = AllocateMemMap(name, num_bits); local
86 auto* const mem_map = Bitmap::AllocateMemMap(name, num_bits); local
[all...] |
| read_barrier_table.h | 26 #include "mem_map.h"
42 MemMap* mem_map = MemMap::MapAnonymous("read barrier table", nullptr, capacity, local
44 CHECK(mem_map != nullptr && mem_map->Begin() != nullptr)
46 mem_map_.reset(mem_map);
|
| /external/ltp/testcases/kernel/controllers/memcg/control/ |
| mem_process.c | 84 void mem_map() function
136 mem_map();
|
| /art/runtime/gc/space/ |
| malloc_space.cc | 43 MallocSpace::MallocSpace(const std::string& name, MemMap* mem_map,
47 : ContinuousMemMapAllocSpace(name, mem_map, begin, end, limit, kGcRetentionPolicyAlwaysCollect),
54 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(mem_map->Begin()), kGcCardSize);
55 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(mem_map->End()), kGcCardSize);
97 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity, local
99 if (mem_map == nullptr) {
103 return mem_map;
197 std::unique_ptr<MemMap> mem_map(GetMemMap()->RemapAtEnd(End(), alloc_space_name,
199 CHECK(mem_map.get() != nullptr) << error_msg;
203 uint8_t* end = mem_map->Begin() + starting_size_
[all...] |
| dlmalloc_space.cc | 41 DlMallocSpace::DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name,
44 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects,
50 DlMallocSpace* DlMallocSpace::CreateFromMemMap(MemMap* mem_map, const std::string& name,
54 DCHECK(mem_map != nullptr);
55 void* mspace = CreateMspace(mem_map->Begin(), starting_size, initial_size);
62 uint8_t* end = mem_map->Begin() + starting_size;
68 uint8_t* begin = mem_map->Begin();
71 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit,
74 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity,
97 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity local
[all...] |
| large_object_space.h | 151 MemMap* mem_map; member in struct:art::gc::space::LargeObjectMapSpace::LargeObject
185 FreeListSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end);
|
| rosalloc_space.cc | 47 RosAllocSpace::RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name,
51 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects,
57 RosAllocSpace* RosAllocSpace::CreateFromMemMap(MemMap* mem_map, const std::string& name,
61 DCHECK(mem_map != nullptr);
65 allocator::RosAlloc* rosalloc = CreateRosAlloc(mem_map->Begin(), starting_size, initial_size,
73 uint8_t* end = mem_map->Begin() + starting_size;
79 uint8_t* begin = mem_map->Begin();
84 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit,
87 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity,
114 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity local
[all...] |
| region_space.cc | 42 std::unique_ptr<MemMap> mem_map; local
44 mem_map.reset(MemMap::MapAnonymous(name.c_str(),
51 if (mem_map.get() != nullptr || requested_begin == nullptr) {
57 if (mem_map.get() == nullptr) {
63 CHECK_EQ(mem_map->Size(), capacity + kRegionSize);
64 CHECK_EQ(mem_map->Begin(), mem_map->BaseBegin());
65 CHECK_EQ(mem_map->Size(), mem_map->BaseSize());
66 if (IsAlignedParam(mem_map->Begin(), kRegionSize))
[all...] |
| large_object_space.cc | 52 delete m.second.mem_map;
141 MemMap* mem_map = MemMap::MapAnonymous("large object space allocation", nullptr, num_bytes, local
143 if (UNLIKELY(mem_map == nullptr)) {
147 mirror::Object* const obj = reinterpret_cast<mirror::Object*>(mem_map->Begin());
149 large_objects_.Put(obj, LargeObject {mem_map, false /* not zygote */});
150 const size_t allocation_size = mem_map->BaseSize();
193 MemMap* mem_map = it->second.mem_map; local
194 const size_t map_size = mem_map->BaseSize();
199 delete mem_map;
229 MemMap* mem_map = pair.second.mem_map; local
352 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, size, local
[all...] |
| /art/runtime/gc/collector/ |
| mark_sweep.cc | 106 MemMap* mem_map = MemMap::MapAnonymous( local
110 CHECK(mem_map != nullptr) << "Couldn't allocate sweep array free buffer: " << error_msg;
111 sweep_array_free_buffer_mem_map_.reset(mem_map);
[all...] |
| /art/runtime/interpreter/ |
| unstarted_runtime.cc | 581 std::unique_ptr<MemMap> mem_map; local
586 mem_map = FindAndExtractEntry(jar_file, resource_cstr, &map_size, &last_error_msg);
587 if (mem_map != nullptr) {
592 if (mem_map == nullptr) {
611 memcpy(h_array->GetData(), mem_map->Begin(), map_size);
613 mem_map.reset();
[all...] |
| /art/runtime/gc/ |
| heap.cc | 657 space::MallocSpace* Heap::CreateMallocSpaceFromMemMap(MemMap* mem_map,
666 malloc_space = space::RosAllocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize,
2335 MemMap* mem_map = main_space_->ReleaseMemMap(); local
[all...] |
