/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolution.h | 676 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred, 681 bool isLoopBackedgeGuardedByCond(const Loop *L, ICmpInst::Predicate Pred, 897 /// e. Return true if isLoopEntryGuardedByCond(Pred, E(LHS), E(RHS)) && 898 /// isLoopBackedgeGuardedByCond(Pred, B(LHS), B(RHS)) 899 bool isKnownViaInduction(ICmpInst::Predicate Pred, const SCEV *LHS, 903 /// by Pred, LHS, and RHS. 904 bool isKnownPredicate(ICmpInst::Predicate Pred, const SCEV *LHS, 907 /// Test if the condition described by Pred, LHS, RHS is known to be true on 909 bool isKnownOnEveryIteration(ICmpInst::Predicate Pred, 912 /// Return true if, for all loop invariant X, the predicate "LHS `Pred` [all...] |
H A D | ValueLattice.h | 332 /// Compares this symbolic value with Other using Pred and returns either 335 Constant *getCompare(CmpInst::Predicate Pred, Type *Ty, argument 341 return ConstantExpr::getCompare(Pred, getConstant(), Other.getConstant()); 350 if (ConstantRange::makeSatisfyingICmpRegion(Pred, OtherCR).contains(CR)) 353 CmpInst::getInversePredicate(Pred), OtherCR)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | erase_fn_imps.hpp | 137 template<typename Pred> 140 erase_if(Pred pred)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | erase_fn_imps.hpp | 72 template<typename Pred> 75 erase_if(Pred pred)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | erase_fn_imps.hpp | 90 template<typename Pred> 93 erase_if(Pred pred)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyIndVar.cpp | 178 ICmpInst::Predicate Pred = ICmp->getPredicate(); local 183 Pred = ICmpInst::getSwappedPredicate(Pred); 198 if (!SE->isLoopInvariantPredicate(Pred, S, X, L, InvariantPredicate, 247 ICmpInst::Predicate Pred = ICmp->getPredicate(); local 248 ICmpInst::Predicate OriginalPred = Pred; 253 Pred = ICmpInst::getSwappedPredicate(Pred); 264 if (SE->isKnownPredicate(Pred, S, X)) { 268 } else if (SE->isKnownPredicate(ICmpInst::getInversePredicate(Pred), 588 ICmpInst::Predicate Pred = ICI->getPredicate(); local [all...] |
H A D | BreakCriticalEdges.cpp | 336 for (unsigned Pred = 0, E = PN->getNumIncomingValues(); Pred != E; ++Pred) { 337 BasicBlock *PredBB = PN->getIncomingBlock(Pred); 412 for (BasicBlock *Pred : OtherPreds) { 415 BasicBlock *Src = Pred != Target ? Pred : BodyBlock;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | LiveRegUnits.h | 168 std::function<bool(const MachineOperand &)> Pred = local 173 return make_filter_range(const_mi_bundle_ops(MI), Pred);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | IPO.cpp | 131 LLVMBool (*Pred)(LLVMValueRef, void *)) { 133 return Pred(wrap(&GV), Context) == 0 ? false : true; 128 LLVMAddInternalizePassWithMustPreservePredicate( LLVMPassManagerRef PM, void *Context, LLVMBool (*Pred)(LLVMValueRef, void *)) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIMachineScheduler.cpp | 537 void SIScheduleBlock::addPred(SIScheduleBlock *Pred) { argument 538 unsigned PredID = Pred->getID(); 545 Preds.push_back(Pred); 820 SUnit *Pred = PredDep.getSUnit(); local 821 if (PredDep.isWeak() || Pred->NodeNum >= DAGSize) 823 if (CurrentTopDownReservedDependencyColoring[Pred->NodeNum] > 0) 824 SUColors.insert(CurrentTopDownReservedDependencyColoring[Pred->NodeNum]); 1244 SUnit *Pred = PredDep.getSUnit(); local 1245 if (PredDep.isWeak() || Pred->NodeNum >= DAGSize) 1247 if (Node2CurrentBlock[Pred 1833 SUnit *Pred = PredDep.getSUnit(); local [all...] |
H A D | GCNILPSched.cpp | 65 for (const SDep &Pred : SU->Preds) { 66 if (Pred.isCtrl()) continue; // ignore chain preds 67 SUnit *PredSU = Pred.getSUnit(); 124 for (const SDep &Pred : SU->Preds) { 125 if (Pred.isCtrl()) continue; // ignore chain preds
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 69 for (SDep &Pred : SU->Preds) { 70 if (Pred.isCtrl()) 73 SUnit *PredSU = Pred.getSUnit(); 153 for (SDep &Pred : SU->Preds) 154 if (Pred.isCtrl()) 212 for (const SDep &Pred : SU->Preds) { 213 SUnit &PredSU = *Pred.getSUnit(); 498 for (SDep &Pred : SU->Preds) { 499 if (Pred.isCtrl() || (Pred [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/FuzzMutate/ |
H A D | Operations.cpp | 125 CmpInst::Predicate Pred) { 126 auto buildOp = [CmpOp, Pred](ArrayRef<Value *> Srcs, Instruction *Inst) { 127 return CmpInst::Create(CmpOp, Pred, Srcs[0], Srcs[1], "C", Inst); 190 auto Pred = [](ArrayRef<Value *> Cur, const Value *V) { local 208 return {Pred, Make}; 222 auto Pred = [](ArrayRef<Value *> Cur, const Value *V) { local 242 return {Pred, Make}; 246 auto Pred = [](ArrayRef<Value *> Cur, const Value *V) { local 263 return {Pred, Make}; 297 auto Pred local 123 cmpOpDescriptor(unsigned Weight, Instruction::OtherOps CmpOp, CmpInst::Predicate Pred) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | PatternMatch.h | 485 ICmpInst::Predicate Pred; member in struct:llvm::PatternMatch::icmp_pred_with_threshold 488 switch (Pred) { 519 P.Pred = Predicate; 1154 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS) argument 1155 : Predicate(Pred), L(LHS), R(RHS) {} 1171 m_Cmp(CmpInst::Predicate &Pred, const LHS &L, const RHS &R) { argument 1172 return CmpClass_match<LHS, RHS, CmpInst, CmpInst::Predicate>(Pred, L, R); 1177 m_ICmp(ICmpInst::Predicate &Pred, const LHS &L, const RHS &R) { argument 1178 return CmpClass_match<LHS, RHS, ICmpInst, ICmpInst::Predicate>(Pred, L, R); 1183 m_FCmp(FCmpInst::Predicate &Pred, cons argument 1500 match(ICmpInst::Predicate Pred) argument 1507 match(ICmpInst::Predicate Pred) argument 1514 match(ICmpInst::Predicate Pred) argument 1521 match(ICmpInst::Predicate Pred) argument 1528 match(FCmpInst::Predicate Pred) argument 1535 match(FCmpInst::Predicate Pred) argument 1542 match(FCmpInst::Predicate Pred) argument 1549 match(FCmpInst::Predicate Pred) argument 1653 ICmpInst::Predicate Pred; local 1853 m_c_ICmp(ICmpInst::Predicate &Pred, const LHS &L, const RHS &R) argument [all...] |
H A D | ConstantRange.h | 102 /// Example: Pred = ult and Other = i8 [2, 5) returns Result = [0, 4) 103 static ConstantRange makeAllowedICmpRegion(CmpInst::Predicate Pred, 113 /// Example: Pred = ult and Other = i8 [2, 5) returns [0, 2) 114 static ConstantRange makeSatisfyingICmpRegion(CmpInst::Predicate Pred, 123 /// Example: Pred = ult and Other = i8 3 returns [0, 3) 124 static ConstantRange makeExactICmpRegion(CmpInst::Predicate Pred, 153 /// Set up \p Pred and \p RHS such that 154 /// ConstantRange::makeExactICmpRegion(Pred, RHS) == *this. Return true if 156 bool getEquivalentICmp(CmpInst::Predicate &Pred, APInt &RHS) const;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 607 for (BasicBlock *Pred : predecessors(BB)) 608 Result.push_back(std::make_pair(KC, Pred)); 773 CmpInst::Predicate Pred = Cmp->getPredicate(); local 796 Value *Res = SimplifyCmpInst(Pred, LHS, RHS, {DL}); 807 ResT = LVI->getPredicateOnEdge(Pred, LHS, 837 LVI->getPredicateOnEdge(Pred, CmpLHS, 876 Pred, cast<ConstantInt>(CmpConst)->getValue()); 902 Constant *Folded = ConstantExpr::getCompare(Pred, V, CmpConst); 952 for (BasicBlock *Pred : predecessors(BB)) 953 Result.push_back(std::make_pair(KC, Pred)); 1586 BasicBlock *Pred = PredValue.second; local 1703 BasicBlock *Pred = PredToDest.first; local 2429 UnfoldSelectInstr(BasicBlock *Pred, BasicBlock *BB, SelectInst *SI, PHINode *SIUse, unsigned Idx) argument 2471 BasicBlock *Pred = CondPHI->getIncomingBlock(I); local 2512 BasicBlock *Pred = CondLHS->getIncomingBlock(I); local [all...] |
H A D | StructurizeCFG.cpp | 454 BBPredicates &Pred = Predicates[BB]; local 477 !Pred.count(Other) && !Pred.count(P)) { 479 Pred[Other] = BoolFalse; 480 Pred[P] = BoolTrue; 484 Pred[P] = buildCondition(Term, i, false); 501 Pred[Entry] = BoolTrue; 562 Value *Pred = BBAndPred.second; local 565 ParentValue = Pred; 568 PhiInserter.AddAvailableValue(BB, Pred); [all...] |
H A D | GVN.cpp | 1095 for (BasicBlock *Pred : predecessors(LoadBB)) { 1098 if (Pred->getTerminator()->isEHPad()) { 1101 << Pred->getName() << "': " << *LI << '\n'); 1105 if (IsValueFullyAvailableInBlock(Pred, FullyAvailableBlocks, 0)) { 1109 if (Pred->getTerminator()->getNumSuccessors() != 1) { 1110 if (isa<IndirectBrInst>(Pred->getTerminator())) { 1113 << Pred->getName() << "': " << *LI << '\n'); 1118 if (isa<CallBrInst>(Pred->getTerminator())) { 1121 << Pred->getName() << "': " << *LI << '\n'); 1128 << Pred 1638 phiTranslate(const BasicBlock *Pred, const BasicBlock *PhiBlock, uint32_t Num, GVN &Gvn) argument 1651 areCallValsEqual(uint32_t Num, uint32_t NewNum, const BasicBlock *Pred, const BasicBlock *PhiBlock, GVN &Gvn) argument 1686 phiTranslateImpl(const BasicBlock *Pred, const BasicBlock *PhiBlock, uint32_t Num, GVN &Gvn) argument 1787 const BasicBlock *Pred = E.getEnd()->getSinglePredecessor(); local 2227 performScalarPREInsertion(Instruction *Instr, BasicBlock *Pred, BasicBlock *Curr, unsigned int ValNo) argument 2480 splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ) argument [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | thin_heap_.hpp | 162 template<typename Pred> 164 erase_if(Pred pred); 166 template<typename Pred> 168 split(Pred pred, PB_DS_CLASS_C_DEC& other);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Lanai/ |
H A D | LanaiAsmPrinter.cpp | 218 const MachineBasicBlock *Pred = *MBB->pred_begin(); local 222 if (const BasicBlock *B = Pred->getBasicBlock()) 232 MachineBasicBlock::const_iterator I = Pred->end(); 233 while (I != Pred->begin() && !(--I)->isTerminator()) {
|
/freebsd-11-stable/contrib/libstdc++/include/ext/ |
H A D | typelist.h | 84 template<typename Typelist, template<typename T> class Pred> 230 template<typename Typelist_Chain, template<typename T> class Pred> 233 template<template<typename T> class Pred> 234 struct chain_filter_<null_type, Pred> 239 template<typename Hd, typename Tl, template<typename T> class Pred> 240 struct chain_filter_<chain<Hd, Tl>, Pred> 245 include_hd = Pred<Hd>::value 248 typedef typename chain_filter_<Tl, Pred>::type rest_type; 377 template<typename Typelist, template<typename T> class Pred> 382 typedef detail::chain_filter_<root_type, Pred> filter_typ [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | SwiftErrorValueTracking.cpp | 183 for (auto *Pred : MBB->predecessors()) { 184 if (!Visited.insert(Pred).second) 187 Pred, getOrCreateVReg(Pred, SwiftErrorVal))); 188 if (Pred != MBB)
|
H A D | LiveRangeCalc.cpp | 386 for (MachineBasicBlock *Pred : MBB->predecessors()) { 388 if (Seen.test(Pred->getNumber())) { 389 if (VNInfo *VNI = Map[Pred].first) { 398 std::tie(Start, End) = Indexes->getMBBRange(Pred); 400 // First time we see Pred. Try to determine the live-out value, but set 401 // it as null if Pred is live-through with an unknown value. 405 setLiveOutValue(Pred, EP.second ? &UndefVNI : VNI); 414 // No, we need a live-in value for Pred as well 415 if (Pred != &UseMBB) 416 WorkList.push_back(Pred [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ValueTracking.cpp | 592 CmpInst::Predicate Pred; 593 if (!match(Cmp, m_c_ICmp(Pred, m_V, m_Value(RHS)))) 597 Pred = CmpInst::getSwappedPredicate(Pred); 600 if (Pred == ICmpInst::ICMP_UGT) 605 if (Pred == ICmpInst::ICMP_NE) 614 ConstantRange::makeAllowedICmpRegion(Pred, RHSRange); 699 CmpInst::Predicate Pred; local 706 if (match(Cmp, m_c_ICmp(Pred, m_V, m_Value(A))) && 714 m_c_ICmp(Pred, m_c_An 2024 CmpInst::Predicate Pred; local 4660 matchFastFloatClamp(CmpInst::Predicate Pred, Value *CmpLHS, Value *CmpRHS, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS) argument 4714 matchClamp(CmpInst::Predicate Pred, Value *CmpLHS, Value *CmpRHS, Value *TrueVal, Value *FalseVal) argument 4750 matchMinMaxOfMinMax(CmpInst::Predicate Pred, Value *CmpLHS, Value *CmpRHS, Value *TVal, Value *FVal, unsigned Depth) argument 4844 matchMinMax(CmpInst::Predicate Pred, Value *CmpLHS, Value *CmpRHS, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS, unsigned Depth) argument 4938 matchSelectPattern(CmpInst::Predicate Pred, FastMathFlags FMF, Value *CmpLHS, Value *CmpRHS, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS, unsigned Depth) argument 5250 CmpInst::Predicate Pred = CmpI->getPredicate(); local 5311 isTruePredicate(CmpInst::Predicate Pred, const Value *LHS, const Value *RHS, const DataLayout &DL, unsigned Depth) argument 5372 isImpliedCondOperands(CmpInst::Predicate Pred, const Value *ALHS, const Value *ARHS, const Value *BLHS, const Value *BRHS, const DataLayout &DL, unsigned Depth) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DAGISelMatcherEmitter.cpp | 101 unsigned getNodePredicate(TreePredicateFn Pred) { argument 102 TreePattern *TP = Pred.getOrigPatFragRecord(); 106 NodePredicatesByCodeToRun[Pred.getCodeToRunOnSDNode()]; 109 if (Pred.usesOperands()) { 110 NodePredicatesWithOperands.push_back(Pred); 113 NodePredicates.push_back(Pred); 121 Pred.usesOperands() && 401 StringRef Pred =cast<CheckPatternPredicateMatcher>(N)->getPredicate(); local 402 OS << "OPC_CheckPatternPredicate, " << getPatternPredicate(Pred) << ','; 404 OS << " // " << Pred; local 409 TreePredicateFn Pred = cast<CheckPredicateMatcher>(N)->getPredicate(); local [all...] |