Home
last modified time | relevance | path

Searched refs:mem_map (Results 1 – 25 of 35) sorted by relevance

12

/art/runtime/gc/accounting/
Dbitmap.cc27 Bitmap* Bitmap::CreateFromMemMap(MemMap* mem_map, size_t num_bits) { in CreateFromMemMap() argument
28 CHECK(mem_map != nullptr); in CreateFromMemMap()
29 return new Bitmap(mem_map, num_bits); in CreateFromMemMap()
32 Bitmap::Bitmap(MemMap* mem_map, size_t bitmap_size) in Bitmap() argument
33 : mem_map_(mem_map), bitmap_begin_(reinterpret_cast<uintptr_t*>(mem_map->Begin())), in Bitmap()
47 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), nullptr, bitmap_size, in AllocateMemMap() local
50 if (UNLIKELY(mem_map.get() == nullptr)) { in AllocateMemMap()
54 return mem_map.release(); in AllocateMemMap()
58 auto* const mem_map = AllocateMemMap(name, num_bits); in Create() local
59 if (mem_map == nullptr) { in Create()
[all …]
Dcard_table.cc64 std::unique_ptr<MemMap> mem_map( in Create() local
67 CHECK(mem_map.get() != nullptr) << "couldn't allocate card table: " << error_msg; in Create()
72 uint8_t* cardtable_begin = mem_map->Begin(); in Create()
87 return new CardTable(mem_map.release(), biased_begin, offset); in Create()
90 CardTable::CardTable(MemMap* mem_map, uint8_t* biased_begin, size_t offset) in CardTable() argument
91 : mem_map_(mem_map), biased_begin_(biased_begin), offset_(offset) { in CardTable()
Dbitmap.h46 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) in MemoryRangeBitmap() argument
182 : Bitmap(mem_map, num_bits), cover_begin_(begin), cover_end_(begin + kAlignment * num_bits) { in MemoryRangeBitmap()
Dspace_bitmap.cc44 const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) { in CreateFromMemMap() argument
45 CHECK(mem_map != nullptr); in CreateFromMemMap()
46 uintptr_t* bitmap_begin = reinterpret_cast<uintptr_t*>(mem_map->Begin()); in CreateFromMemMap()
48 return new SpaceBitmap(name, mem_map, bitmap_begin, bitmap_size, heap_begin); in CreateFromMemMap()
52 SpaceBitmap<kAlignment>::SpaceBitmap(const std::string& name, MemMap* mem_map, uintptr_t* bitmap_be… in SpaceBitmap() argument
54 : mem_map_(mem_map), bitmap_begin_(bitmap_begin), bitmap_size_(bitmap_size), in SpaceBitmap()
70 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), nullptr, bitmap_size, in Create() local
73 if (UNLIKELY(mem_map.get() == nullptr)) { in Create()
77 return CreateFromMemMap(name, mem_map.release(), heap_begin, heap_capacity); in Create()
Dread_barrier_table.h40 MemMap* mem_map = MemMap::MapAnonymous("read barrier table", nullptr, capacity, in ReadBarrierTable() local
42 CHECK(mem_map != nullptr && mem_map->Begin() != nullptr) in ReadBarrierTable()
44 mem_map_.reset(mem_map); in ReadBarrierTable()
Dspace_bitmap.h53 static SpaceBitmap* CreateFromMemMap(const std::string& name, MemMap* mem_map,
198 SpaceBitmap(const std::string& name, MemMap* mem_map, uintptr_t* bitmap_begin, size_t bitmap_size,
/art/runtime/gc/space/
Dzygote_space.cc43 ZygoteSpace* ZygoteSpace::Create(const std::string& name, MemMap* mem_map, in Create() argument
51 live_bitmap->VisitMarkedRange(reinterpret_cast<uintptr_t>(mem_map->Begin()), in Create()
52 reinterpret_cast<uintptr_t>(mem_map->End()), visitor); in Create()
53 ZygoteSpace* zygote_space = new ZygoteSpace(name, mem_map, objects_allocated); in Create()
66 ZygoteSpace::ZygoteSpace(const std::string& name, MemMap* mem_map, size_t objects_allocated) in ZygoteSpace() argument
67 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->End(), mem_map->End(), in ZygoteSpace()
Ddlmalloc_space.cc37 DlMallocSpace::DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, in DlMallocSpace() argument
40 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in DlMallocSpace()
46 DlMallocSpace* DlMallocSpace::CreateFromMemMap(MemMap* mem_map, const std::string& name, in CreateFromMemMap() argument
50 DCHECK(mem_map != nullptr); in CreateFromMemMap()
51 void* mspace = CreateMspace(mem_map->Begin(), starting_size, initial_size); in CreateFromMemMap()
58 uint8_t* end = mem_map->Begin() + starting_size; in CreateFromMemMap()
64 uint8_t* begin = mem_map->Begin(); in CreateFromMemMap()
67 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
70 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity, in CreateFromMemMap()
93 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, in Create() local
[all …]
Drosalloc_space.cc48 RosAllocSpace::RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, in RosAllocSpace() argument
52 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in RosAllocSpace()
58 RosAllocSpace* RosAllocSpace::CreateFromMemMap(MemMap* mem_map, const std::string& name, in CreateFromMemMap() argument
62 DCHECK(mem_map != nullptr); in CreateFromMemMap()
66 allocator::RosAlloc* rosalloc = CreateRosAlloc(mem_map->Begin(), starting_size, initial_size, in CreateFromMemMap()
74 uint8_t* end = mem_map->Begin() + starting_size; in CreateFromMemMap()
80 uint8_t* begin = mem_map->Begin(); in CreateFromMemMap()
85 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
88 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, in CreateFromMemMap()
115 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, in Create() local
[all …]
Dbump_pointer_space.cc31 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity, in Create() local
34 if (mem_map.get() == nullptr) { in Create()
39 return new BumpPointerSpace(name, mem_map.release()); in Create()
42 BumpPointerSpace* BumpPointerSpace::CreateFromMemMap(const std::string& name, MemMap* mem_map) { in CreateFromMemMap() argument
43 return new BumpPointerSpace(name, mem_map); in CreateFromMemMap()
56 BumpPointerSpace::BumpPointerSpace(const std::string& name, MemMap* mem_map) in BumpPointerSpace() argument
57 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->Begin(), mem_map->End(), in BumpPointerSpace()
59 growth_end_(mem_map->End()), in BumpPointerSpace()
Dlarge_object_space.cc45 delete m.second.mem_map; in ~ValgrindLargeObjectMapSpace()
133 MemMap* mem_map = MemMap::MapAnonymous("large object space allocation", nullptr, num_bytes, in Alloc() local
135 if (UNLIKELY(mem_map == nullptr)) { in Alloc()
139 mirror::Object* const obj = reinterpret_cast<mirror::Object*>(mem_map->Begin()); in Alloc()
146 auto* obj_end = reinterpret_cast<mirror::Object*>(mem_map->End()); in Alloc()
151 large_objects_.Put(obj, LargeObject {mem_map, false /* not zygote */}); in Alloc()
152 const size_t allocation_size = mem_map->BaseSize(); in Alloc()
193 MemMap* mem_map = it->second.mem_map; in Free() local
194 const size_t map_size = mem_map->BaseSize(); in Free()
199 delete mem_map; in Free()
[all …]
Dmalloc_space.cc38 MallocSpace::MallocSpace(const std::string& name, MemMap* mem_map, in MallocSpace() argument
42 : ContinuousMemMapAllocSpace(name, mem_map, begin, end, limit, kGcRetentionPolicyAlwaysCollect), in MallocSpace()
49 CHECK(IsAligned<kGcCardSize>(reinterpret_cast<uintptr_t>(mem_map->Begin()))); in MallocSpace()
50 CHECK(IsAligned<kGcCardSize>(reinterpret_cast<uintptr_t>(mem_map->End()))); in MallocSpace()
92 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity, in CreateMemMap() local
94 if (mem_map == nullptr) { in CreateMemMap()
98 return mem_map; in CreateMemMap()
192 std::unique_ptr<MemMap> mem_map(GetMemMap()->RemapAtEnd(End(), alloc_space_name, in CreateZygoteSpace() local
194 CHECK(mem_map.get() != nullptr) << error_msg; in CreateZygoteSpace()
198 uint8_t* end = mem_map->Begin() + starting_size_; in CreateZygoteSpace()
[all …]
Dregion_space.cc35 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity, in Create() local
38 if (mem_map.get() == nullptr) { in Create()
44 return new RegionSpace(name, mem_map.release()); in Create()
47 RegionSpace::RegionSpace(const std::string& name, MemMap* mem_map) in RegionSpace() argument
48 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->End(), mem_map->End(), in RegionSpace()
51 size_t mem_map_size = mem_map->Size(); in RegionSpace()
53 CHECK_ALIGNED(mem_map->Begin(), kRegionSize); in RegionSpace()
58 uint8_t* region_addr = mem_map->Begin(); in RegionSpace()
Dvalgrind_malloc_space-inl.h243 MemMap* mem_map, size_t initial_size, Params... params) : S(mem_map, initial_size, params...) { in ValgrindMallocSpace() argument
244 VALGRIND_MAKE_MEM_UNDEFINED(mem_map->Begin() + initial_size, in ValgrindMallocSpace()
245 mem_map->Size() - initial_size); in ValgrindMallocSpace()
Dzygote_space.h33 static ZygoteSpace* Create(const std::string& name, MemMap* mem_map,
88 ZygoteSpace(const std::string& name, MemMap* mem_map, size_t objects_allocated);
Ddlmalloc_space.h37 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,
Dspace.h393 …MemMapSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, in MemMapSpace() argument
396 mem_map_(mem_map) { in MemMapSpace()
449 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, in ContinuousMemMapAllocSpace() argument
451 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) { in ContinuousMemMapAllocSpace()
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,
148 RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name,
Dmalloc_space.h127 virtual MallocSpace* CreateInstance(MemMap* mem_map, const std::string& name, void* allocator,
151 MallocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end,
Dbump_pointer_space.h46 static BumpPointerSpace* CreateFromMemMap(const std::string& name, MemMap* mem_map);
161 BumpPointerSpace(const std::string& name, MemMap* mem_map);
Dvalgrind_malloc_space.h60 explicit ValgrindMallocSpace(MemMap* mem_map, size_t initial_size, Params... params);
Dlarge_object_space.h143 MemMap* mem_map; member
174 FreeListSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end);
/art/runtime/jit/
Djit_code_cache.cc44 JitCodeCache::JitCodeCache(MemMap* mem_map) in JitCodeCache() argument
46 VLOG(jit) << "Created jit code cache size=" << PrettySize(mem_map->Size()); in JitCodeCache()
47 mem_map_.reset(mem_map); in JitCodeCache()
48 uint8_t* divider = mem_map->Begin() + RoundUp(mem_map->Size() / 4, kPageSize); in JitCodeCache()
51 data_cache_ptr_ = mem_map->Begin(); in JitCodeCache()
58 code_cache_end_ = mem_map->End(); in JitCodeCache()
/art/runtime/
Dmem_map_test.cc29 static uint8_t* BaseBegin(MemMap* mem_map) { in BaseBegin() argument
30 return reinterpret_cast<uint8_t*>(mem_map->base_begin_); in BaseBegin()
32 static size_t BaseSize(MemMap* mem_map) { in BaseSize() argument
33 return mem_map->base_size_; in BaseSize()
/art/runtime/gc/
Dheap.cc546 space::MallocSpace* Heap::CreateMallocSpaceFromMemMap(MemMap* mem_map, size_t initial_size, in CreateMallocSpaceFromMemMap() argument
552 malloc_space = space::RosAllocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize, in CreateMallocSpaceFromMemMap()
556 malloc_space = space::DlMallocSpace::CreateFromMemMap(mem_map, name, kDefaultStartingSize, in CreateMallocSpaceFromMemMap()
571 void Heap::CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, in CreateMainMallocSpace() argument
590 main_space_ = CreateMallocSpaceFromMemMap(mem_map, initial_size, growth_limit, capacity, name, in CreateMainMallocSpace()
1926 std::unique_ptr<MemMap> mem_map(main_space_backup_->ReleaseMemMap()); in TransitionCollector() local
1929 CHECK(mem_map != nullptr); in TransitionCollector()
1930 mem_map->Protect(PROT_READ | PROT_WRITE); in TransitionCollector()
1932 mem_map.release()); in TransitionCollector()
1936 mem_map.reset(main_space_->ReleaseMemMap()); in TransitionCollector()
[all …]

12