Home
last modified time | relevance | path

Searched defs:pred (Results 1 – 10 of 10) sorted by relevance

/art/compiler/optimizing/
Dcode_sinking.cc568 HBasicBlock* pred = exit->GetPredecessors()[i]; in ReturnSinking() local
593 HBasicBlock* pred = exit->GetPredecessors()[i]; in ReturnSinking() local
Dexecution_subgraph.cc290 for (const HBasicBlock* pred : cur->GetPredecessors()) { in RecalculateExcludedCohort() local
Ddead_code_elimination.cc512 HBasicBlock* pred = block->GetPredecessors()[index]; in MaybeAddPhi() local
Dnodes.cc599 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { in OrderLoopHeaderPredecessors() local
616 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in FixControlForNewSinglePreheader() local
671 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in TransformLoopToSinglePreheaderFormat() local
2900 for (size_t pred = 0; pred < to->GetPredecessors().size(); ++pred) { in InlineInto() local
Dload_store_elimination.cc3603 HBasicBlock* pred = entry->GetPredecessors()[cur_pred_idx]; in InsertMaterializationBlocks() local
3837 Value pred = ReplacementOrValue(intermediate_values_.find(read)->second); in GetPartialValueAt() local
/art/libartbase/base/
Dhash_set.h213 const Pred& pred) noexcept in HashSet()
216 const Pred& pred, in HashSet()
223 const Pred& pred) noexcept in HashSet()
228 const Pred& pred, in HashSet()
301 const Pred& pred, in HashSet()
Dintrusive_forward_list.h289 void remove_if(Predicate pred) { in remove_if()
304 void unique(BinaryPredicate pred) { in unique()
Dhash_set_test.cc460 StatefulPred pred(&strings); in TEST_F() local
/art/libdexfile/external/
Ddex_file_ext.cc114 auto pred = [](auto it) { return it.first != 0; }; // Entries to copy (not cleared above). in CreateClassCache() local
/art/runtime/base/
Dmutex.cc126 static inline bool WaitBrieflyFor(AtomicInteger* testLoc, Thread* self, Pred pred) { in WaitBrieflyFor()