Searched refs:mem_map (Results 1 - 25 of 37) sorted by relevance

12

/art/runtime/gc/accounting/
H A Dbitmap.cc24 #include "mem_map.h"
30 Bitmap* Bitmap::CreateFromMemMap(MemMap* mem_map, size_t num_bits) { argument
31 CHECK(mem_map != nullptr);
32 return new Bitmap(mem_map, num_bits);
35 Bitmap::Bitmap(MemMap* mem_map, size_t bitmap_size) argument
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
61 auto* const mem_map = AllocateMemMap(name, num_bits); local
86 auto* const mem_map = Bitmap::AllocateMemMap(name, num_bits); local
91 CreateFromMemMap( MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
[all...]
H A Dcard_table.cc27 #include "mem_map.h"
67 std::unique_ptr<MemMap> mem_map(
70 CHECK(mem_map.get() != nullptr) << "couldn't allocate card table: " << error_msg;
75 uint8_t* cardtable_begin = mem_map->Begin();
90 return new CardTable(mem_map.release(), biased_begin, offset);
93 CardTable::CardTable(MemMap* mem_map, uint8_t* biased_begin, size_t offset) argument
94 : mem_map_(mem_map), biased_begin_(biased_begin), offset_(offset) {
H A Dspace_bitmap.cc23 #include "mem_map.h"
52 const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) {
53 CHECK(mem_map != nullptr);
54 uintptr_t* bitmap_begin = reinterpret_cast<uintptr_t*>(mem_map->Begin());
56 return new SpaceBitmap(name, mem_map, bitmap_begin, bitmap_size, heap_begin, heap_capacity);
61 MemMap* mem_map,
66 : mem_map_(mem_map),
86 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), nullptr, bitmap_size,
89 if (UNLIKELY(mem_map.get() == nullptr)) {
93 return CreateFromMemMap(name, mem_map
51 CreateFromMemMap( const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) argument
60 SpaceBitmap(const std::string& name, MemMap* mem_map, uintptr_t* bitmap_begin, size_t bitmap_size, const void* heap_begin, size_t heap_capacity) argument
[all...]
H A Dread_barrier_table.h26 #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);
H A Dbitmap.h42 // Initialize a space bitmap using the provided mem_map as the live bits. Takes ownership of the
45 static Bitmap* CreateFromMemMap(MemMap* mem_map, size_t num_bits);
104 Bitmap(MemMap* mem_map, size_t bitmap_size);
132 static MemoryRangeBitmap* CreateFromMemMap(MemMap* mem_map, uintptr_t cover_begin,
180 MemoryRangeBitmap(MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
181 : Bitmap(mem_map, num_bits), cover_begin_(begin), cover_end_(begin + kAlignment * num_bits) {
H A Dspace_bitmap.h50 // Initialize a space bitmap using the provided mem_map as the live bits. Takes ownership of the
53 static SpaceBitmap* CreateFromMemMap(const std::string& name, MemMap* mem_map,
218 MemMap* mem_map,
/art/runtime/gc/space/
H A Dzygote_space.cc44 ZygoteSpace* ZygoteSpace::Create(const std::string& name, MemMap* mem_map, argument
52 live_bitmap->VisitMarkedRange(reinterpret_cast<uintptr_t>(mem_map->Begin()),
53 reinterpret_cast<uintptr_t>(mem_map->End()), visitor);
54 ZygoteSpace* zygote_space = new ZygoteSpace(name, mem_map, objects_allocated);
67 ZygoteSpace::ZygoteSpace(const std::string& name, MemMap* mem_map, size_t objects_allocated) argument
68 : 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 Dregion_space.cc42 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
80 Create(const std::string& name, MemMap* mem_map) argument
84 RegionSpace(const std::string& name, MemMap* mem_map) argument
[all...]
H A Ddlmalloc_space.cc41 DlMallocSpace::DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, argument
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, argument
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 local
155 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.cc47 RosAllocSpace::RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, argument
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, argument
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 local
178 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 Dmalloc_space.cc43 MallocSpace::MallocSpace(const std::string& name, MemMap* mem_map, argument
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
[all...]
H A Dzygote_space.h22 #include "mem_map.h"
33 static ZygoteSpace* Create(const std::string& name, MemMap* mem_map,
88 ZygoteSpace(const std::string& name, MemMap* mem_map, size_t objects_allocated);
H A Dlarge_object_space.cc52 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
358 FreeListSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end) argument
[all...]
H A Ddlmalloc_space.h36 // Create a DlMallocSpace from an existing mem_map.
37 static DlMallocSpace* CreateFromMemMap(MemMap* mem_map, const std::string& name,
121 MallocSpace* CreateInstance(MemMap* mem_map, const std::string& name, void* allocator,
142 DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, void* mspace,
H A Dmemory_tool_malloc_space.h56 MemoryToolMallocSpace(MemMap* mem_map, size_t initial_size, Params... params);
H A Dmalloc_space.h116 virtual MallocSpace* CreateInstance(MemMap* mem_map, const std::string& name, void* allocator,
140 MallocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end,
H A Dspace.h29 #include "mem_map.h"
393 MemMap* mem_map,
399 mem_map_(mem_map) {
454 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, argument
456 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) {
392 MemMapSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, GcRetentionPolicy gc_retention_policy) argument
H A Drosalloc_space.h44 static RosAllocSpace* CreateFromMemMap(MemMap* mem_map, const std::string& name,
114 MallocSpace* CreateInstance(MemMap* mem_map, const std::string& name, void* allocator,
150 RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name,
H A Dbump_pointer_space.h50 static BumpPointerSpace* CreateFromMemMap(const std::string& name, MemMap* mem_map);
169 BumpPointerSpace(const std::string& name, MemMap* mem_map);
H A Dlarge_object_space.h151 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);
H A Dmemory_tool_malloc_space-inl.h244 MemMap* mem_map, size_t initial_size, Params... params) : S(mem_map, initial_size, params...) {
243 MemoryToolMallocSpace( MemMap* mem_map, size_t initial_size, Params... params) argument
H A Dimage_space.h185 MemMap* mem_map,
/art/runtime/dex/
H A Dart_dex_file_loader.h69 std::unique_ptr<MemMap> mem_map,
/art/runtime/gc/
H A Dheap.cc657 space::MallocSpace* Heap::CreateMallocSpaceFromMemMap(MemMap* mem_map, argument
666 malloc_space = space::RosAllocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize,
670 malloc_space = space::DlMallocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize,
685 void Heap::CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, argument
704 main_space_ = CreateMallocSpaceFromMemMap(mem_map, initial_size, growth_limit, capacity, name,
2020 std::unique_ptr<MemMap> mem_map(main_space_backup_->ReleaseMemMap());
2023 CHECK(mem_map != nullptr);
2024 mem_map->Protect(PROT_READ | PROT_WRITE);
2026 mem_map.release());
2030 mem_map
2335 MemMap* mem_map = main_space_->ReleaseMemMap(); local
[all...]

Completed in 198 milliseconds

12