Searched refs:Pred (Results 226 - 250 of 335) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp323 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); } argument
1441 BasicBlock *Pred = *PI; local
1442 if (InvokeInst *II = dyn_cast<InvokeInst>(&Pred->back()))
1534 const BasicBlock *Pred = *PI; local
1535 DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Pred);
1540 Pred = *PI;
1541 I = BBStates.find(Pred);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp1077 for (MachineBasicBlock *Pred : MBB.predecessors()) {
1080 if (IndirectTerminatedMBBs.count(Pred))
1088 if (!llvm::all_of(Pred->successors(), [&](MachineBasicBlock *Succ) {
1094 Pred->dump();
1104 auto InsertPt = Pred->getFirstTerminator();
1109 auto AddrI = BuildMI(*Pred, InsertPt, DebugLoc(),
1117 auto AddrI = BuildMI(*Pred, InsertPt, DebugLoc(), TII->get(X86::LEA64r),
1130 TargetAddrSSA.AddAvailableValue(Pred, TargetReg);
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenSchedule.cpp302 const Record *Pred = EC->getValueAsDef("Predicate"); local
303 if (Predicate2Index.find(Pred) == Predicate2Index.end())
304 Predicate2Index[Pred] = NumUniquePredicates++;
344 const Record *Pred = EC->getValueAsDef("Predicate"); local
346 PredMask.setBit(Predicate2Index[Pred]);
360 OI.addPredicateForProcModel(ProcMask, OperandMask, Pred);
1216 for (Record *Pred : ProcModel.ModelDef->getValueAsListOfDefs("UnsupportedFeatures")) {
1217 ProcModel.UnsupportedFeaturesDefs.push_back(Pred);
H A DFastISelEmitter.cpp62 unsigned getIDFor(TreePredicateFn Pred) { argument
63 unsigned &Entry = ImmIDs[Pred.getOrigPatFragRecord()];
65 PredsByName.push_back(Pred);
H A DDAGISelMatcher.h421 TreePattern *Pred; member in class:llvm::CheckPredicateMatcher
438 return cast<CheckPredicateMatcher>(M)->Pred == Pred;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSwitchLoweringUtils.h107 CmpInst::Predicate Pred; member in struct:llvm::SwitchCG::CaseBlock::PredInfoPair
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h1036 Error addBlock(Block &B, PredFn Pred = includeAllBlocks) {
1037 if (!Pred(B))
1071 Error addBlocks(BlockPtrRange &&Blocks, PredFn Pred = includeAllBlocks) {
1073 if (auto Err = addBlock(*B, Pred))
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DBasicBlock.h364 /// Notify the BasicBlock that the predecessor \p Pred is no longer able to
370 void removePredecessor(BasicBlock *Pred, bool KeepOneInputPHIs = false);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h119 void addPred(SIScheduleBlock *Pred);
H A DGCNHazardRecognizer.cpp386 for (MachineBasicBlock *Pred : MBB->predecessors()) {
387 if (!Visited.insert(Pred).second)
390 int W = getWaitStatesSince(IsHazard, Pred, Pred->instr_rbegin(),
H A DAMDGPUSubtarget.cpp821 bool canAddEdge(const SUnit *Succ, const SUnit *Pred) const {
822 if (Pred->NodeNum < Succ->NodeNum)
825 SmallVector<const SUnit*, 64> Succs({Succ}), Preds({Pred});
H A DSIWholeQuadMode.cpp490 for (MachineBasicBlock *Pred : MBB.predecessors()) {
491 BlockInfo &PredBI = Blocks[Pred];
497 Worklist.push_back(Pred);
H A DAMDGPUMachineCFGStructurizer.cpp1359 MachineBasicBlock *Pred = getPHIPred(PHI, i);
1360 if (Region->contains(Pred)) {
1371 MachineBasicBlock *Pred = getPHIPred(PHI, i);
1372 if (Region->contains(Pred)) {
1383 MachineBasicBlock *Pred = getPHIPred(PHI, i);
1384 if (!Region->contains(Pred)) {
1844 MachineBasicBlock *Pred = (*PI);
1845 Pred->addSuccessor(IfBB);
2145 LLVM_DEBUG(dbgs() << "RegionExit: " << Exit->getNumber() << " Pred: "
2512 auto Pred
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DTargetInstrInfo.cpp322 MachineInstr &MI, ArrayRef<MachineOperand> Pred) const {
336 MO.setReg(Pred[j].getReg());
339 MO.setImm(Pred[j].getImm());
342 MO.setMBB(Pred[j].getMBB());
H A DMachineBasicBlock.cpp764 void MachineBasicBlock::addPredecessor(MachineBasicBlock *Pred) {
765 Predecessors.push_back(Pred);
768 void MachineBasicBlock::removePredecessor(MachineBasicBlock *Pred) {
769 pred_iterator I = find(Predecessors, Pred);
770 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
H A DMachineScheduler.cpp686 for (SDep &Pred : SU->Preds)
687 releasePred(SU, &Pred);
1611 for (const SDep &Pred : SU.Preds) {
1612 if (Pred.isCtrl()) {
1613 ChainPredID = Pred.getSUnit()->NodeNum;
1783 for (const SDep &Pred : GlobalSU->Preds) {
1784 if (Pred.getKind() != SDep::Anti || Pred.getReg() != GlobalReg)
1786 if (Pred.getSUnit() == FirstLocalSU)
1788 if (!DAG->canAddEdge(FirstLocalSU, Pred
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLocal.h186 /// to delete Pred as a predecessor of BB. If BB contains any PHI nodes, this
187 /// drops the entries in the PHI nodes for Pred.
196 void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyCommon.cpp855 void SExprBuilder::handlePredecessor(const CFGBlock *Pred) { argument
858 CurrentBB->addPredecessor(BlockMap[Pred->getBlockID()]);
859 BlockInfo *PredInfo = &BBInfo[Pred->getBlockID()];
870 void SExprBuilder::handlePredecessorBackEdge(const CFGBlock *Pred) { argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroFrame.cpp903 for (BasicBlock *Pred : Preds) {
904 auto *IncomingBB = ehAwareSplitEdge(Pred, &BB, LandingPad, ReplPHI);
905 IncomingBB->setName(BB.getName() + Twine(".from.") + Pred->getName());
913 InputV->addIncoming(V, Pred);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlan.h510 void setPredicate(VPValue *Pred) { Predicate = Pred; }
538 for (auto *Pred : NewPreds)
539 appendPredecessor(Pred);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp292 const BlockNode &Pred,
329 if (Resolved < Pred) {
330 if (!isLoopHeader(Pred)) {
340 // If "Pred" is a loop header, then this isn't really a backedge; rather,
290 addToDist(Distribution &Dist, const LoopData *OuterLoop, const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight) argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp525 for (auto &Pred : SU->Preds) {
527 if (!Pred.getSUnit()->isScheduled && (Pred.getSUnit() != SU2))
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDynamicTypePropagation.cpp873 ExplodedNode *Pred = C.getPredecessor(); local
883 Pred = C.addTransition(State);
895 C.addTransition(State, Pred);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGuardWidening.cpp531 CmpInst::Predicate Pred;
533 SubsetIntersect.getEquivalentICmp(Pred, NewRHSAP)) {
536 Result = new ICmpInst(InsertPt, Pred, LHS, NewRHS, "wide.chk");
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGBuiltin.cpp2353 CmpInst::Predicate Pred = (BuiltinID == Builtin::BI__builtin_isinf)
2356 Value *FCmp = Builder.CreateFCmp(Pred, Fabs, Infinity, "cmpinf");
9826 CmpInst::Predicate Pred;
9829 Pred = IsSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
9832 Pred = IsSigned ? ICmpInst::ICMP_SLE : ICmpInst::ICMP_ULE;
9835 Pred = IsSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
9838 Pred = IsSigned ? ICmpInst::ICMP_SGE : ICmpInst::ICMP_UGE;
9841 Pred = ICmpInst::ICMP_EQ;
9844 Pred = ICmpInst::ICMP_NE;
9854 Value *Cmp = CGF.Builder.CreateICmp(Pred, Op
[all...]

Completed in 484 milliseconds

1234567891011>>