/art/runtime/ |
H A D | safe_map.h | 60 iterator begin() { return map_.begin(); } function in class:art::SafeMap 61 const_iterator begin() const { return map_.begin(); } function in class:art::SafeMap 99 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k));
|
H A D | dex_file_verifier.h | 29 static bool Verify(const DexFile* dex_file, const byte* begin, size_t size, 37 DexFileVerifier(const DexFile* dex_file, const byte* begin, size_t size, const char* location) argument 38 : dex_file_(dex_file), begin_(begin), size_(size), location_(location),
|
H A D | monitor_pool_test.cc | 82 monitors.erase(monitors.begin() + index); 114 monitors.erase(monitors.begin() + index);
|
H A D | mem_map.h | 145 MemMap(const std::string& name, byte* begin, size_t size, void* base_begin, size_t base_size,
|
H A D | fault_handler.cc | 188 auto it = std::find(generated_code_handlers_.begin(), generated_code_handlers_.end(), handler); 193 auto it2 = std::find(other_handlers_.begin(), other_handlers_.end(), handler);
|
H A D | reference_table.cc | 56 entries_.erase(entries_.begin() + i); 205 std::sort(sorted_entries.begin(), sorted_entries.end(), ObjectComparator());
|
/art/compiler/sea_ir/types/ |
H A D | type_inference_visitor_test.cc | 128 EXPECT_TRUE(true == std::equal(types.begin(), types.begin() + 2, result.begin()));
|
/art/runtime/gc/space/ |
H A D | space.h | 305 byte* begin, byte* end, byte* limit) : 306 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { 372 MemMapSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end, byte* limit, argument 374 : ContinuousSpace(name, gc_retention_policy, begin, end, limit), 428 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, byte* begin, argument 430 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) { 304 ContinuousSpace(const std::string& name, GcRetentionPolicy gc_retention_policy, byte* begin, byte* end, byte* limit) argument
|
H A D | valgrind_malloc_space.h | 50 byte* begin, byte* end, byte* limit, size_t growth_limit,
|
H A D | dlmalloc_space.h | 111 byte* begin, byte* end, byte* limit, size_t growth_limit, 131 DlMallocSpace(const std::string& name, MemMap* mem_map, void* mspace, byte* begin, byte* end,
|
H A D | malloc_space.h | 118 byte* begin, byte* end, byte* limit, size_t growth_limit, 141 MallocSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end,
|
H A D | valgrind_malloc_space-inl.h | 96 A allocator, byte* begin, 100 S(name, mem_map, allocator, begin, end, limit, growth_limit, can_move_objects, starting_size, 95 ValgrindMallocSpace(const std::string& name, MemMap* mem_map, A allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, size_t initial_size, bool can_move_objects, size_t starting_size) argument
|
H A D | large_object_space.cc | 87 LargeObjectSpace::LargeObjectSpace(const std::string& name, byte* begin, byte* end) argument 90 total_objects_allocated_(0), begin_(begin), end_(end) { 177 for (auto it = mem_maps_.begin(); it != mem_maps_.end(); ++it) { 294 FreeListSpace::FreeListSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end) argument 295 : LargeObjectSpace(name, begin, end), 298 const size_t space_capacity = end - begin; 467 << " begin: " << reinterpret_cast<void*>(Begin())
|
H A D | bump_pointer_space.cc | 45 BumpPointerSpace::BumpPointerSpace(const std::string& name, byte* begin, byte* limit) argument 46 : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit,
|
H A D | large_object_space.h | 94 explicit LargeObjectSpace(const std::string& name, byte* begin, byte* end); 156 FreeListSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end);
|
H A D | rosalloc_space.h | 96 byte* begin, byte* end, byte* limit, size_t growth_limit, 129 byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects,
|
/art/compiler/ |
H A D | compiled_method.cc | 63 return std::equal(quick_code_->begin(), quick_code_->end(), rhs.quick_code_->begin()); 71 return std::equal(portable_code_->begin(), portable_code_->end(), 72 rhs.portable_code_->begin());
|
/art/compiler/utils/ |
H A D | scoped_hashtable.h | 39 for (typename std::list<std::map<K, V>>::const_iterator scopes_it = scopes.begin();
|
H A D | swap_space.cc | 113 : free_by_size_.lower_bound(FreeBySizeEntry { size, free_by_start_.begin() }); 174 if (it != free_by_start_.begin()) {
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap_test.cc | 42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, argument 45 begin_(begin),
|
/art/runtime/base/ |
H A D | bit_vector_test.cc | 41 EXPECT_TRUE(bv.Indexes().begin().Done()); 42 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end()); 57 BitVector::IndexIterator iterator = bv.Indexes().begin();
|
/art/runtime/gc/collector/ |
H A D | mark_sweep.cc | 684 byte* begin, byte* end, byte minimum_age, size_t mark_stack_size, 688 begin_(begin), 818 accounting::ContinuousSpaceBitmap* bitmap, uintptr_t begin, uintptr_t end) 819 : MarkStackTask<false>(thread_pool, mark_sweep, 0, NULL), bitmap_(bitmap), begin_(begin), 866 uintptr_t begin = reinterpret_cast<uintptr_t>(space->Begin()); local 872 while (begin != end) { 873 uintptr_t start = begin; 874 uintptr_t delta = (end - begin) / n; 876 if (delta < 16 * KB) delta = end - begin; 877 begin 682 CardScanTask(ThreadPool* thread_pool, MarkSweep* mark_sweep, accounting::ContinuousSpaceBitmap* bitmap, byte* begin, byte* end, byte minimum_age, size_t mark_stack_size, Object** mark_stack_obj) argument 817 RecursiveMarkTask(ThreadPool* thread_pool, MarkSweep* mark_sweep, accounting::ContinuousSpaceBitmap* bitmap, uintptr_t begin, uintptr_t end) argument 888 uintptr_t begin = reinterpret_cast<uintptr_t>(space->Begin()); local [all...] |
/art/compiler/sea_ir/code_gen/ |
H A D | code_gen.cc | 42 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin(); 52 for (std::set<Region*>::const_iterator cit = dominated_regions->begin(); 67 for (std::vector<SignatureNode*>::const_iterator param_iterator = parameters->begin(); 100 for (std::vector<Region*>::const_iterator cit = regions->begin(); cit != regions->end(); cit++) { 208 for (std::vector<InstructionNode*>::const_iterator cit = parameter_sources.begin(); 265 for (std::vector<Region*>::const_iterator cit = predecessors->begin();
|
/art/compiler/sea_ir/ir/ |
H A D | sea.h | 112 cit = definition_edges_.begin(); cit != definition_edges_.end(); cit++) { 113 producers.insert(producers.end(), (*cit)->begin(), (*cit)->end());
|
/art/disassembler/ |
H A D | disassembler_mips.cc | 264 void DisassemblerMips::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 265 for (const uint8_t* cur = begin; cur < end; cur += 4) {
|