| /art/dex2oat/linker/arm/ |
| D | relative_patcher_arm_base.cc | 210 pending_thunks_.front()->GetPendingOffset() == aligned_offset) { in WriteThunks()
216 if (UNLIKELY(!WriteThunk(out, pending_thunks_.front()->GetCode()))) { in WriteThunks()
219 offset = aligned_offset + pending_thunks_.front()->CodeSize(); in WriteThunks()
230 DCHECK(pending_thunks_.empty() || pending_thunks_.front()->GetPendingOffset() > aligned_offset); in WriteThunks()
303 unreserved_thunks_.front()->MaxNextOffset() >= next_aligned_offset) { in ReserveSpaceInternal()
306 ThunkData* thunk = unreserved_thunks_.front(); in ReserveSpaceInternal()
311 unreserved_thunks_.front()->MaxNextOffset() >= next_aligned_offset) { in ReserveSpaceInternal()
315 thunk = unreserved_thunks_.front(); in ReserveSpaceInternal()
323 DCHECK_LE(thunk_offset - unprocessed_method_call_patches_.front().GetPatchOffset(), in ReserveSpaceInternal()
336 unreserved_thunks_.front()->MaxNextOffset() >= next_aligned_offset); in ReserveSpaceInternal()
[all …]
|
| /art/libartbase/base/ |
| D | transform_array_ref_test.cc | 72 ASSERT_EQ(input.front().value + 1, taref.front()); in TEST()
104 ASSERT_EQ(input.front().value - 1, taref.front()); in TEST()
147 ASSERT_EQ(input.front().value, taref.front()); in TEST()
207 ASSERT_EQ(cinput.front().value, ctaref.front()); in TEST()
|
| D | transform_array_ref.h | 114 reference front() { return GetFunction()(base().front()); } in front() function
115 const_reference front() const { return GetFunction()(base().front()); } in front() function
|
| D | dchecked_vector.h | 132 reference front() { DCHECK(!empty()); return Base::front(); } in front() function
133 const_reference front() const { DCHECK(!empty()); return Base::front(); } in front() function
|
| D | bounded_fifo.h | 57 const T& front() const { in front() function
|
| D | array_slice.h | 102 reference front() { in front() function
107 const_reference front() const { in front() function
|
| D | array_ref.h | 148 reference front() { in front() function
153 const_reference front() const { in front() function
|
| D | intrusive_forward_list.h | 179 reference front() { return *begin(); } in front() function
180 const_reference front() const { return *begin(); } in front() function
369 value_type& value = front(); in reverse()
|
| /art/compiler/optimizing/ |
| D | reference_type_propagation_test.cc | 285 edges.emplace_back("start", mid_blocks.front()); in RunVisitListTest()
286 edges.emplace_back(mid_blocks.back(), mid_blocks.front()); in RunVisitListTest()
287 edges.emplace_back(mid_blocks.front(), "exit"); in RunVisitListTest()
310 single_value[alg.Get(mid_blocks.front())] = new_inst; in RunVisitListTest()
386 AdjacencyListGraph alg(graph_, GetAllocator(), mid_blocks.front(), mid_blocks.back(), edges); in RunVisitListTest()
404 single_value[alg.Get(mid_blocks.front())] = new_inst; in RunVisitListTest()
405 HBasicBlock* start = alg.Get(mid_blocks.front()); in RunVisitListTest()
456 std::swap(lst.front(), lst.back()); in MutateList()
|
| D | ssa_liveness_analysis.h | 343 (uses_.front().GetUser() == actual_user) &&
344 (uses_.front().GetPosition() < position)) {
348 DCHECK(uses_.front().GetPosition() + 1 == position);
357 if (first_range_->GetEnd() == uses_.front().GetPosition()) {
364 DCHECK(env_uses_.empty() || position <= env_uses_.front().GetPosition());
369 DCHECK(uses_.empty() || position <= uses_.front().GetPosition());
1226 DCHECK_EQ(user, temp->GetUses().front().GetUser()); in GetTempUser()
1233 return temp->GetUses().front().GetInputIndex(); in GetTempIndex()
|
| D | execution_subgraph.cc | 169 current_path.front() == graph_->GetEntryBlock()->GetBlockId()) in Prune()
284 const HBasicBlock* cur = worklist.front(); in RecalculateExcludedCohort()
|
| D | execution_subgraph_test.cc | 51 const HBasicBlock* cur = worklist.front(); in CalculateValidity()
907 AdjacencyListGraph blks(SetupFromAdjacencyList(mid_blocks.front(), mid_blocks.back(), edges)); in TEST_F()
937 edges.emplace_back(mid_blocks.front(), mid_blocks.back()); in TEST_F()
938 AdjacencyListGraph blks(SetupFromAdjacencyList(mid_blocks.front(), mid_blocks.back(), edges)); in TEST_F()
955 EXPECT_TRUE(contents.find(blks.Get(mid_blocks.front())) != contents.end()); in TEST_F()
|
| D | prepare_for_register_allocation.cc | 196 HInstruction* user = condition->GetUses().front().GetUser(); in VisitCondition()
|
| /art/compiler/debug/ |
| D | elf_debug_writer.cc | 63 … DCHECK_EQ(cu.methods.front()->is_code_address_text_relative, mi.is_code_address_text_relative); in WriteDebugInfo()
88 return a.methods.front() < b.methods.front(); in WriteDebugInfo()
295 symtab->Add(symbols.front(), text); in PackElfFileForJIT()
|
| D | elf_debug_line_writer.h | 184 class_name.front() == 'L' && // Type descriptor for a class. in WriteCompilationUnit()
240 int first_line = dex2line_map.front().line_; in WriteCompilationUnit()
|
| D | elf_symtab_writer.h | 58 const MethodDebugInfo* first = methods.front(); in GetDedupedName()
|
| /art/libdexfile/dex/ |
| D | compact_offset_table_test.cc | 47 const size_t before_size = offsets.size() * sizeof(offsets.front()); in TEST()
|
| D | dex_file_tracking_registrar.cc | 144 const std::tuple<const void*, size_t, bool>& current_range = range_values_.front(); in SetCurrentRanges()
|
| /art/runtime/base/ |
| D | message_queue.h | 134 Message message = messages_.front(); in ReceiveMessage()
|
| D | timing_logger.cc | 156 return timings_.back().GetTime() - timings_.front().GetTime(); in GetTotalNs()
|
| /art/odrefresh/ |
| D | odr_fs_utils.cc | 110 std::string current = unvisited.front(); in GetUsedSpace()
|
| /art/test/1949-short-dex-file/ |
| D | info.txt | 27 wasn't caught in our other tests (package art is always at the front).
|
| /art/runtime/ |
| D | intern_table.cc | 281 for (GcRoot<mirror::String>& entry : weak_interns_.tables_.front().set_) { in PromoteWeakToStrong()
285 weak_interns_.tables_.front().set_.clear(); in PromoteWeakToStrong()
|
| D | thread_pool.cc | 288 Task* task = tasks_.front(); in TryGetTaskLocked()
|
| /art/runtime/gc/ |
| D | verification.cc | 224 auto pair = work.front(); in FirstPathFromRootSet()
|