Searched refs:Preds (Results 51 - 73 of 73) sorted by relevance

123

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp1876 MBBVector Preds(Header->pred_begin(), Header->pred_end());
1883 for (MBBVector::iterator I = Preds.begin(), E = Preds.end(); I != E; ++I) {
1966 for (MBBVector::iterator I = Preds.begin(), E = Preds.end(); I != E; ++I) {
H A DHexagonVLIWPacketizer.cpp534 for (const auto &PI : SUI->Preds)
1927 for (auto &Pred : SUI->Preds)
1938 for (auto &Pred : SUI->Preds)
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenSchedule.cpp1668 RecVec Preds; local
1669 transform(I->PredTerm, std::back_inserter(Preds),
1673 Preds.erase(std::unique(Preds.begin(), Preds.end()), Preds.end());
1674 SCTrans.PredTerm = std::move(Preds);
H A DCodeGenDAGPatterns.cpp3902 std::vector<Predicate> Preds; local
3905 Preds.push_back(Pred->getDef());
3911 llvm::sort(Preds);
3912 return Preds;
4209 ListInit *Preds = TheDef->getValueAsListInit("Predicates"); local
4226 PatternToMatch(TheDef, makePredList(Preds),
4289 std::vector<Predicate> Preds = P.Predicates;
4291 Preds.insert(Preds.end(), MC.begin(), MC.end());
4292 PatternsToMatch.emplace_back(P.getSrcRecord(), Preds, st
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFGraph.cpp929 NodeList Preds; local
931 Preds.push_back(findBlock(PB));
941 for (NodeAddr<BlockNode*> PBA : Preds) {
1471 NodeList Preds; local
1474 Preds.push_back(findBlock(PB));
1498 for (NodeAddr<BlockNode*> PBA : Preds) {
H A DScheduleDAGInstrs.cpp1280 for (const SDep &PredDep : SU->Preds) {
1417 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin()));
1431 return getCurr()->Preds.end();
H A DMachineBlockPlacement.cpp3137 SmallVector<MachineBasicBlock *, 8> Preds(BB->pred_begin(), BB->pred_end());
3148 llvm::stable_sort(Preds, CmpPred);
3196 for (MachineBasicBlock *Pred : Preds) {
3234 if ((Candidates.size() < Preds.size()) && (Candidates.size() > 0)) {
H A DMachineScheduler.cpp686 for (SDep &Pred : SU->Preds)
1655 for (const SDep &Pred : SU.Preds) {
1827 for (const SDep &Pred : GlobalSU->Preds) {
3304 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs;
3313 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1)
3742 return (Node->Preds.size() > ViewMISchedCutoff
H A DMachineVerifier.cpp155 BlockSet Preds, Succs; member in struct:__anon3530::MachineVerifier::BBInfo
560 MInfo.Preds.insert(MBB.pred_begin(), MBB.pred_end());
561 if (MInfo.Preds.size() != MBB.pred_size())
601 if (!MBBInfoMap[succ].Preds.count(MBB)) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGSDNodes.cpp794 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DModuleSummaryAnalysis.cpp209 SmallVector<Instruction *, 4> Preds; local
211 findDevirtualizableCallsForTypeCheckedLoad(DevirtCalls, LoadedPtrs, Preds,
H A DScalarEvolution.cpp4742 if (Expr1 != Expr2 && !Preds.implies(SE.getEqualPredicate(Expr1, Expr2)) &&
4743 !Preds.implies(SE.getEqualPredicate(Expr2, Expr1)))
6456 SCEVUnionPredicate &Preds) {
6457 return getPredicatedBackedgeTakenInfo(L).getExact(L, this, &Preds);
6738 SCEVUnionPredicate *Preds) const {
6760 if (Preds && !ENT.hasAlwaysTruePredicate())
6761 Preds->add(ENT.Predicate.get());
6763 assert((Preds || ENT.hasAlwaysTruePredicate()) &&
12139 SCEVUnionPredicate &Preds) {
12140 return SCEVPredicateRewriter::rewrite(S, L, *this, nullptr, &Preds);
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DWholeProgramDevirt.cpp1805 SmallVector<Instruction *, 1> Preds; local
1808 findDevirtualizableCallsForTypeCheckedLoad(DevirtCalls, LoadedPtrs, Preds,
1829 IRBuilder<> CallB((Preds.size() == 1 && !HasNonCallUses) ? Preds[0] : CI);
1832 for (Instruction *Pred : Preds) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp2352 /// all blocks in Preds. When profile data is available, update the frequency of
2355 ArrayRef<BasicBlock *> Preds,
2363 for (auto Pred : Preds)
2371 SplitLandingPadPredecessors(BB, Preds, Suffix, NewName.c_str(), NewBBs);
2373 NewBBs.push_back(SplitBlockPredecessors(BB, Preds, Suffix));
2377 Updates.reserve((2 * Preds.size()) + NewBBs.size());
2354 SplitBlockPreds(BasicBlock *BB, ArrayRef<BasicBlock *> Preds, const char *Suffix) argument
H A DLoopUnswitch.cpp1197 SmallVector<BasicBlock *, 4> Preds(pred_begin(ExitBlock),
1202 SplitBlockPredecessors(ExitBlock, Preds, ".us-lcssa", DT, LI, MSSAU.get(),
H A DGVN.cpp2636 SmallVector<BasicBlock *, 4> Preds(pred_begin(B), pred_end(B));
2637 for (BasicBlock *P : Preds) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp1028 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
1029 while (!Preds.empty()) {
1030 BasicBlock *Pred = Preds.pop_back_val();
4333 SmallVector<BasicBlock *, 8> Preds(pred_begin(BB), pred_end(BB));
4334 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
4335 Instruction *TI = Preds[i]->getTerminator();
5880 SmallPtrSet<BasicBlock *, 16> Preds; local
5881 Preds.insert(pred_begin(BB), pred_end(BB));
5882 for (BasicBlock *Pred : Preds) {
H A DCodeExtractor.cpp731 SmallVector<BasicBlock *, 4> Preds(pred_begin(ExitBB),
733 for (BasicBlock *PredBB : Preds)
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp329 SmallPtrSet<MachineBasicBlock *, 4> Preds; local
341 if (!Preds.insert(MI.getOperand(OpIdx + 1).getMBB()).second)
363 Preds.clear();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp202 SmallVector<BasicBlock *, 2> Preds; member in class:__anon4602::BBState
316 edge_iterator pred_begin() const { return Preds.begin(); }
317 edge_iterator pred_end() const { return Preds.end(); }
322 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroFrame.cpp1079 SmallVector<BasicBlock *, 8> Preds(pred_begin(&BB), pred_end(&BB));
1080 for (BasicBlock *Pred : Preds) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DVerifier.cpp2491 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
2493 llvm::sort(Preds);
2500 Assert(PN.getNumIncomingValues() == Preds.size(),
2526 Assert(Values[i].first == Preds[i],
2528 Values[i].first, Preds[i]);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCFG.cpp5082 B->Preds.push_back(AdjacentBlock(this, Succ.isReachable()), C);
5085 UnreachableB->Preds.push_back(AdjacentBlock(this, false), C);
5717 OS << " Preds " ;

Completed in 505 milliseconds

123