Home
last modified time | relevance | path

Searched refs:pred (Results 1 – 16 of 16) sorted by relevance

/art/compiler/optimizing/
Dexecution_subgraph.cc63 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()
293 for (const HBasicBlock* pred : cur->GetPredecessors()) { in RecalculateExcludedCohort() local
294 worklist.push(pred); in RecalculateExcludedCohort()
Dreference_type_propagation_test.cc329 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()
Ddead_code_elimination.cc252 HBasicBlock* pred = block->GetSinglePredecessor(); in SimplifyAlwaysThrows() local
258 !block->Dominates(pred) && in SimplifyAlwaysThrows()
259 pred->Dominates(succ) && in SimplifyAlwaysThrows()
267 if (RemoveNonNullControlDependences(pred, block)) { in SimplifyAlwaysThrows()
Dnodes.cc564 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { in OrderLoopHeaderPredecessors() local
565 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors()
567 header->predecessors_[pred] = to_swap; in OrderLoopHeaderPredecessors()
569 FixPhisAfterPredecessorsReodering(header, 0, pred); in OrderLoopHeaderPredecessors()
581 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in FixControlForNewSinglePreheader() local
582 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader()
585 pred--; in FixControlForNewSinglePreheader()
636 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in TransformLoopToSinglePreheaderFormat() local
637 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat()
639 first_nonbackedge_pred_pos = pred; in TransformLoopToSinglePreheaderFormat()
[all …]
Dload_store_elimination.cc3114 for (HBasicBlock* pred : blk->GetPredecessors()) { in GenerateMaterializationValueFromPredecessors()
3115 DCHECK(HasMaterialization(pred)); in GenerateMaterializationValueFromPredecessors()
3116 pred_vals.push_back(GetMaterialization(pred)); in GenerateMaterializationValueFromPredecessors()
3458 HBasicBlock* pred = entry->GetPredecessors()[cur_pred_idx]; in InsertMaterializationBlocks() local
3459 mat->InsertBetween(pred, entry); in InsertMaterializationBlocks()
3461 << pred->GetBlockId() << "->" << entry->GetBlockId(); in InsertMaterializationBlocks()
3692 Value pred = ReplacementOrValue(intermediate_values_.find(read)->second); in GetPartialValueAt() local
3693 LSE_VLOG << "using " << pred << " as default value for " << *read; in GetPartialValueAt()
3694 if (pred.IsInstruction()) { in GetPartialValueAt()
3695 return pred.GetInstruction(); in GetPartialValueAt()
[all …]
Dsuperblock_cloner.cc692 for (HBasicBlock* pred : bb->GetPredecessors()) { in DumpBB()
693 oss << pred->GetBlockId() << " "; in DumpBB()
1101 for (HBasicBlock* pred : block->GetPredecessors()) { in IsSubgraphConnected()
1102 if (!work_set->IsBitSet(pred->GetBlockId())) { in IsSubgraphConnected()
Doptimizing_unit_test.h361 std::all_of(preds.begin(), preds.end(), [&](HBasicBlock* pred) { in EnsurePredecessorOrder()
367 if (cur.first == pred && !bv.IsBitSet(cur.second)) { in EnsurePredecessorOrder()
Dexecution_subgraph_test.cc943 for (HBasicBlock* pred : remove_implicit->GetPredecessors()) { in TEST_F()
944 esg.RemoveBlock(pred); in TEST_F()
/art/test/988-method-trace/src/art/
DTest988.java42 (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/libartbase/base/
Dhash_set.h205 const Pred& pred) noexcept in HashSet() argument
206 : HashSet(kDefaultMinLoadFactor, kDefaultMaxLoadFactor, hashfn, pred) {} in HashSet()
208 const Pred& pred, in HashSet() argument
210 : HashSet(kDefaultMinLoadFactor, kDefaultMaxLoadFactor, hashfn, pred, alloc) {} in HashSet()
215 const Pred& pred) noexcept in HashSet() argument
216 : HashSet(min_load_factor, max_load_factor, hashfn, pred, allocator_type()) {} in HashSet()
220 const Pred& pred, in HashSet() argument
225 pred_(pred), in HashSet()
Dintrusive_forward_list.h290 void remove_if(Predicate pred) { in remove_if() argument
293 if (pred(*current)) { in remove_if()
305 void unique(BinaryPredicate pred) { in unique() argument
311 if (pred(*prev, *current)) { in unique()
Dhash_set_test.cc460 StatefulPred pred(&strings); in TEST_F() local
461 HashSet<uint16_t, SmallIndexEmptyFn, StatefulHashFn, StatefulPred> hash_set(hashfn, pred); in TEST_F()
/art/libdexfile/external/
Ddex_file_ext.cc113 auto pred = [](auto it) { return it.first != 0; }; // Entries to copy (not cleared above). in CreateClassCache() local
114 std::copy_if(cache.begin(), cache.end(), std::back_inserter(class_cache_), pred); in CreateClassCache()
/art/runtime/base/
Dmutex.cc125 static inline bool WaitBrieflyFor(AtomicInteger* testLoc, Thread* self, Pred pred) { in WaitBrieflyFor() argument
136 if (pred(testLoc->load(std::memory_order_relaxed))) { in WaitBrieflyFor()
/art/openjdkjvmti/
Dti_redefine.cc2872 auto pred = [&](art::ArtField& f) REQUIRES(art::Locks::mutator_lock_) { in UpdateClassStructurally()
2883 return std::find_if(sfields.begin(), sfields.end(), pred) != sfields.end(); in UpdateClassStructurally()
2891 return std::find_if(ifields.begin(), ifields.end(), pred) != ifields.end(); in UpdateClassStructurally()
/art/build/boot/hiddenapi/
Dhiddenapi-max-target-o-low-priority.txt7141 Ljava/util/concurrent/ConcurrentLinkedDeque;->pred(Ljava/util/concurrent/ConcurrentLinkedDeque$Node…