| /art/compiler/optimizing/ |
| D | code_sinking.cc | 547 for (HBasicBlock* pred : exit->GetPredecessors()) { in ReturnSinking()
551 if (pred->GetLastInstruction()->IsReturn() || pred->GetLastInstruction()->IsReturnVoid()) { in ReturnSinking()
552 saw_return |= pred->GetLastInstruction()->IsReturn(); in ReturnSinking()
568 HBasicBlock* pred = exit->GetPredecessors()[i]; in ReturnSinking() local
569 if (!pred->GetLastInstruction()->IsReturn()) { in ReturnSinking()
574 HReturn* ret = pred->GetLastInstruction()->AsReturn(); in ReturnSinking()
585 pred->ReplaceAndRemoveInstructionWith(ret, in ReturnSinking()
587 pred->ReplaceSuccessor(exit, new_block); in ReturnSinking()
593 HBasicBlock* pred = exit->GetPredecessors()[i]; in ReturnSinking() local
594 if (!pred->GetLastInstruction()->IsReturnVoid()) { in ReturnSinking()
[all …]
|
| D | execution_subgraph.cc | 63 for (HBasicBlock* pred : to_remove->GetPredecessors()) { in RemoveBlock()
66 for (auto [succ, i] : ZipCount(MakeIterationRange(pred->GetSuccessors()))) { in RemoveBlock()
71 LimitBlockSuccessors(pred, allowed_successors); in RemoveBlock()
290 for (const HBasicBlock* pred : cur->GetPredecessors()) { in RecalculateExcludedCohort() local
291 worklist.push(pred); in RecalculateExcludedCohort()
|
| D | reference_type_propagation_test.cc | 329 for (const auto& [pred, index] : ZipCount(MakeIterationRange(blk->GetPredecessors()))) { in RunVisitListTest()
330 CHECK(single_value[pred] != nullptr) << pred->GetBlockId() << " " << alg.GetName(pred); in RunVisitListTest()
331 my_val->SetRawInputAt(index, single_value[pred]); in RunVisitListTest()
421 for (const auto& [pred, index] : ZipCount(MakeIterationRange(blk->GetPredecessors()))) { in RunVisitListTest()
422 my_val->SetRawInputAt(index, single_value[pred]); in RunVisitListTest()
|
| D | nodes.cc | 599 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { in OrderLoopHeaderPredecessors() local
600 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors()
602 header->predecessors_[pred] = to_swap; in OrderLoopHeaderPredecessors()
604 FixPhisAfterPredecessorsReodering(header, 0, pred); in OrderLoopHeaderPredecessors()
616 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in FixControlForNewSinglePreheader() local
617 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader()
620 pred--; in FixControlForNewSinglePreheader()
671 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in TransformLoopToSinglePreheaderFormat() local
672 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat()
674 first_nonbackedge_pred_pos = pred; in TransformLoopToSinglePreheaderFormat()
[all …]
|
| D | load_store_elimination.cc | 3259 for (HBasicBlock* pred : blk->GetPredecessors()) { in GenerateMaterializationValueFromPredecessors()
3260 DCHECK(HasMaterialization(pred)); in GenerateMaterializationValueFromPredecessors()
3261 pred_vals.push_back(GetMaterialization(pred)); in GenerateMaterializationValueFromPredecessors()
3603 HBasicBlock* pred = entry->GetPredecessors()[cur_pred_idx]; in InsertMaterializationBlocks() local
3604 mat->InsertBetween(pred, entry); in InsertMaterializationBlocks()
3606 << pred->GetBlockId() << "->" << entry->GetBlockId(); in InsertMaterializationBlocks()
3837 Value pred = ReplacementOrValue(intermediate_values_.find(read)->second); in GetPartialValueAt() local
3838 LSE_VLOG << "using " << pred << " as default value for " << *read; in GetPartialValueAt()
3839 if (pred.IsInstruction()) { in GetPartialValueAt()
3840 return pred.GetInstruction(); in GetPartialValueAt()
[all …]
|
| D | dead_code_elimination.cc | 512 HBasicBlock* pred = block->GetPredecessors()[index]; in MaybeAddPhi() local
514 dominator->GetLastInstruction()->AsIf()->IfTrueSuccessor()->Dominates(pred); in MaybeAddPhi()
516 dominator->GetLastInstruction()->AsIf()->IfFalseSuccessor()->Dominates(pred); in MaybeAddPhi()
|
| D | superblock_cloner.cc | 692 for (HBasicBlock* pred : bb->GetPredecessors()) { in DumpBB()
693 oss << pred->GetBlockId() << " "; in DumpBB()
1110 for (HBasicBlock* pred : block->GetPredecessors()) { in IsSubgraphConnected()
1111 if (!work_set->IsBitSet(pred->GetBlockId())) { in IsSubgraphConnected()
|
| D | optimizing_unit_test.h | 349 std::all_of(preds.begin(), preds.end(), [&](HBasicBlock* pred) { in EnsurePredecessorOrder()
355 if (cur.first == pred && !bv.IsBitSet(cur.second)) { in EnsurePredecessorOrder()
|
| D | execution_subgraph_test.cc | 943 for (HBasicBlock* pred : remove_implicit->GetPredecessors()) { in TEST_F()
944 esg.RemoveBlock(pred); in TEST_F()
|
| /art/libartbase/base/ |
| D | hash_set.h | 213 const Pred& pred) noexcept in HashSet() argument
214 : HashSet(kDefaultMinLoadFactor, kDefaultMaxLoadFactor, hashfn, pred) {} in HashSet()
216 const Pred& pred, in HashSet() argument
218 : HashSet(kDefaultMinLoadFactor, kDefaultMaxLoadFactor, hashfn, pred, alloc) {} in HashSet()
223 const Pred& pred) noexcept in HashSet() argument
224 : HashSet(min_load_factor, max_load_factor, hashfn, pred, allocator_type()) {} in HashSet()
228 const Pred& pred, in HashSet() argument
233 pred_(pred), in HashSet()
301 const Pred& pred, in HashSet() argument
307 pred_(pred), in HashSet()
|
| D | intrusive_forward_list.h | 289 void remove_if(Predicate pred) { in remove_if() argument
292 if (pred(*current)) { in remove_if()
304 void unique(BinaryPredicate pred) { in unique() argument
310 if (pred(*prev, *current)) { in unique()
|
| D | hash_set_test.cc | 460 StatefulPred pred(&strings); in TEST_F() local
461 HashSet<uint16_t, SmallIndexEmptyFn, StatefulHashFn, StatefulPred> hash_set(hashfn, pred); in TEST_F()
|
| /art/test/988-method-trace/src/art/ |
| D | Test988.java | 42 (x) -> NON_DETERMINISTIC_OUTPUT_METHODS.stream().anyMatch((pred) -> pred.test(x));
44 (x) -> NON_DETERMINISTIC_OUTPUT_TYPE_METHODS.stream().anyMatch((pred) -> pred.test(x));
|
| /art/test/2263-method-trace-jit/src/art/ |
| D | Test988.java | 42 (x) -> NON_DETERMINISTIC_OUTPUT_METHODS.stream().anyMatch((pred) -> pred.test(x));
44 (x) -> NON_DETERMINISTIC_OUTPUT_TYPE_METHODS.stream().anyMatch((pred) -> pred.test(x));
|
| /art/libdexfile/external/ |
| D | dex_file_ext.cc | 114 auto pred = [](auto it) { return it.first != 0; }; // Entries to copy (not cleared above). in CreateClassCache() local
115 std::copy_if(cache.begin(), cache.end(), std::back_inserter(class_cache_), pred); in CreateClassCache()
|
| /art/runtime/base/ |
| D | mutex.cc | 126 static inline bool WaitBrieflyFor(AtomicInteger* testLoc, Thread* self, Pred pred) { in WaitBrieflyFor() argument
137 if (pred(testLoc->load(std::memory_order_relaxed))) { in WaitBrieflyFor()
|
| /art/openjdkjvmti/ |
| D | ti_redefine.cc | 2876 auto pred = [&](art::ArtField& f) REQUIRES(art::Locks::mutator_lock_) { in UpdateClassStructurally()
2887 return std::find_if(sfields.begin(), sfields.end(), pred) != sfields.end(); in UpdateClassStructurally()
2895 return std::find_if(ifields.begin(), ifields.end(), pred) != ifields.end(); in UpdateClassStructurally()
|
| /art/build/boot/hiddenapi/ |
| D | hiddenapi-max-target-o-low-priority.txt | 7140 Ljava/util/concurrent/ConcurrentLinkedDeque;->pred(Ljava/util/concurrent/ConcurrentLinkedDeque$Node…
|