Searched defs:mem_map (Results 1 - 22 of 22) sorted by relevance

/art/runtime/gc/accounting/
H A Dbitmap.cc22 #include "mem_map.h"
28 Bitmap* Bitmap::CreateFromMemMap(MemMap* mem_map, size_t num_bits) { argument
29 CHECK(mem_map != nullptr);
30 return new Bitmap(mem_map, num_bits);
33 Bitmap::Bitmap(MemMap* mem_map, size_t bitmap_size) argument
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
59 auto* const mem_map = AllocateMemMap(name, num_bits); local
84 auto* const mem_map = Bitmap::AllocateMemMap(name, num_bits); local
89 CreateFromMemMap( MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
[all...]
H A Dbitmap.h43 // Initialize a space bitmap using the provided mem_map as the live bits. Takes ownership of the
46 static Bitmap* CreateFromMemMap(MemMap* mem_map, size_t num_bits);
105 Bitmap(MemMap* mem_map, size_t bitmap_size);
133 static MemoryRangeBitmap* CreateFromMemMap(MemMap* mem_map, uintptr_t cover_begin,
181 MemoryRangeBitmap(MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
182 : Bitmap(mem_map, num_bits), cover_begin_(begin), cover_end_(begin + kAlignment * num_bits) {
H A Dcard_table.cc25 #include "mem_map.h"
66 std::unique_ptr<MemMap> mem_map(
69 CHECK(mem_map.get() != nullptr) << "couldn't allocate card table: " << error_msg;
74 uint8_t* cardtable_begin = mem_map->Begin();
89 return new CardTable(mem_map.release(), biased_begin, offset);
92 CardTable::CardTable(MemMap* mem_map, uint8_t* biased_begin, size_t offset) argument
93 : mem_map_(mem_map), biased_begin_(biased_begin), offset_(offset) {
H A Dread_barrier_table.h24 #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);
H A Dspace_bitmap.cc22 #include "mem_map.h"
44 const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) {
45 CHECK(mem_map != nullptr);
46 uintptr_t* bitmap_begin = reinterpret_cast<uintptr_t*>(mem_map->Begin());
48 return new SpaceBitmap(name, mem_map, bitmap_begin, bitmap_size, heap_begin);
52 SpaceBitmap<kAlignment>::SpaceBitmap(const std::string& name, MemMap* mem_map, uintptr_t* bitmap_begin, argument
54 : mem_map_(mem_map), bitmap_begin_(bitmap_begin), bitmap_size_(bitmap_size),
70 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), nullptr, bitmap_size,
73 if (UNLIKELY(mem_map.get() == nullptr)) {
77 return CreateFromMemMap(name, mem_map
43 CreateFromMemMap( const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) argument
[all...]
/art/runtime/gc/space/
H A Dmemory_tool_malloc_space-inl.h242 MemMap* mem_map, size_t initial_size, Params... params) : S(mem_map, initial_size, params...) {
241 MemoryToolMallocSpace( MemMap* mem_map, size_t initial_size, Params... params) argument
H A Dzygote_space.cc42 ZygoteSpace* ZygoteSpace::Create(const std::string& name, MemMap* mem_map, argument
50 live_bitmap->VisitMarkedRange(reinterpret_cast<uintptr_t>(mem_map->Begin()),
51 reinterpret_cast<uintptr_t>(mem_map->End()), visitor);
52 ZygoteSpace* zygote_space = new ZygoteSpace(name, mem_map, objects_allocated);
65 ZygoteSpace::ZygoteSpace(const std::string& name, MemMap* mem_map, size_t objects_allocated) argument
66 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->End(), mem_map->End(),
H A Dbump_pointer_space.cc31 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity,
34 if (mem_map.get() == nullptr) {
39 return new BumpPointerSpace(name, mem_map.release());
42 BumpPointerSpace* BumpPointerSpace::CreateFromMemMap(const std::string& name, MemMap* mem_map) { argument
43 return new BumpPointerSpace(name, mem_map);
56 BumpPointerSpace::BumpPointerSpace(const std::string& name, MemMap* mem_map) argument
57 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->Begin(), mem_map
[all...]
H A Dlarge_object_space.h144 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);
H A Dmalloc_space.cc38 MallocSpace::MallocSpace(const std::string& name, MemMap* mem_map, argument
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
[all...]
H A Dregion_space.cc35 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity,
38 if (mem_map.get() == nullptr) {
44 return new RegionSpace(name, mem_map.release());
47 RegionSpace::RegionSpace(const std::string& name, MemMap* mem_map) argument
48 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->End(), mem_map->End(),
51 size_t mem_map_size = mem_map->Size();
53 CHECK_ALIGNED(mem_map
[all...]
H A Ddlmalloc_space.cc39 DlMallocSpace::DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, argument
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, argument
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 local
153 CreateInstance(MemMap* mem_map, const std::string& name, void* allocator, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects) argument
[all...]
H A Drosalloc_space.cc45 RosAllocSpace::RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, argument
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, argument
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 local
176 CreateInstance(MemMap* mem_map, const std::string& name, void* allocator, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects) argument
[all...]
H A Dlarge_object_space.cc48 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
234 MemMap* mem_map = pair.second.mem_map; local
357 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, size, local
363 FreeListSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end) argument
[all...]
H A Dspace.h30 #include "mem_map.h"
393 MemMapSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, argument
396 mem_map_(mem_map) {
448 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, argument
450 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) {
H A Dimage_space.cc49 MemMap* mem_map,
53 mem_map,
54 mem_map->Begin(),
47 ImageSpace(const std::string& image_filename, const char* image_location, MemMap* mem_map, accounting::ContinuousSpaceBitmap* live_bitmap, uint8_t* end) argument
/art/runtime/
H A Dmem_map_test.cc17 #include "mem_map.h"
29 static uint8_t* BaseBegin(MemMap* mem_map) { argument
30 return reinterpret_cast<uint8_t*>(mem_map->base_begin_);
33 static size_t BaseSize(MemMap* mem_map) { argument
34 return mem_map->base_size_;
H A Dmem_map.cc17 #include "mem_map.h"
77 // Handling mem_map in 32b address range for 64b architectures that do not support MAP_32BIT.
896 std::ostream& operator<<(std::ostream& os, const MemMap& mem_map) { argument
898 mem_map.BaseBegin(), mem_map.BaseEnd(), mem_map.GetProtect(),
899 mem_map.GetName().c_str());
H A Ddex_file.cc302 MemMap* mem_map,
304 return OpenMemory(mem_map->Begin(),
305 mem_map->Size(),
308 mem_map,
413 MemMap* mem_map,
418 new DexFile(base, size, location, location_checksum, mem_map, oat_dex_file));
428 MemMap* mem_map,
434 mem_map_(mem_map),
300 OpenMemory(const std::string& location, uint32_t location_checksum, MemMap* mem_map, std::string* error_msg) argument
409 OpenMemory(const uint8_t* base, size_t size, const std::string& location, uint32_t location_checksum, MemMap* mem_map, const OatDexFile* oat_dex_file, std::string* error_msg) argument
425 DexFile(const uint8_t* base, size_t size, const std::string& location, uint32_t location_checksum, MemMap* mem_map, const OatDexFile* oat_dex_file) argument
/art/runtime/gc/collector/
H A Dmark_sweep.cc104 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);
/art/runtime/interpreter/
H A Dunstarted_runtime.cc425 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();
/art/runtime/gc/
H A Dheap.cc655 space::MallocSpace* Heap::CreateMallocSpaceFromMemMap(MemMap* mem_map, argument
664 malloc_space = space::RosAllocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize,
668 malloc_space = space::DlMallocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize,
683 void Heap::CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, argument
702 main_space_ = CreateMallocSpaceFromMemMap(mem_map, initial_size, growth_limit, capacity, name,
2147 std::unique_ptr<MemMap> mem_map(main_space_backup_->ReleaseMemMap());
2150 CHECK(mem_map != nullptr);
2151 mem_map->Protect(PROT_READ | PROT_WRITE);
2153 mem_map.release());
2157 mem_map
2477 MemMap* mem_map = main_space_->ReleaseMemMap(); local
[all...]

Completed in 9162 milliseconds