Home
last modified time | relevance | path

Searched refs:Term (Results 1 – 25 of 93) sorted by relevance

1234

/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIAnnotateControlFlow.cpp79 bool openIf(BranchInst *Term);
207 if (isUniform(Term)) in openIf()
210 IRBuilder<> IRB(Term); in openIf()
214 Term->setCondition(Cond); in openIf()
221 if (isUniform(Term)) { in insertElse()
225 IRBuilder<> IRB(Term); in insertElse()
229 Term->setCondition(Cond); in insertElse()
272 if (isUniform(Term)) in handleLoop()
285 Term->setCondition(BoolTrue); in handleLoop()
363 if (!Term || Term->isUnconditional()) { in runOnFunction()
[all …]
H A DSIPreEmitPeephole.cpp203 for (MachineInstr &Term : Parent->terminators()) { in optimizeVccBranch()
205 if (Term.isBranch()) in optimizeVccBranch()
206 ToRemove.push_back(&Term); in optimizeVccBranch()
208 Found = Term.isIdenticalTo(MI); in optimizeVccBranch()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp99 auto *Term = BBs[0]->getTerminator(); in performBlockTailMerging() local
106 NewOps.resize(Term->getNumOperands()); in performBlockTailMerging()
107 for (auto I : zip(Term->operands(), NewOps)) { in performBlockTailMerging()
115 CanonicalTerm = Term->clone(); in performBlockTailMerging()
126 auto *Term = BB->getTerminator(); in performBlockTailMerging() local
133 for (auto I : zip(Term->operands(), NewOps)) in performBlockTailMerging()
138 CommonDebugLoc = Term->getDebugLoc(); in performBlockTailMerging()
145 Term->eraseFromParent(); in performBlockTailMerging()
170 auto *Term = BB.getTerminator(); in tailMergeBlocksWithSimilarFunctionTerminators() local
174 switch (Term->getOpcode()) { in tailMergeBlocksWithSimilarFunctionTerminators()
[all …]
H A DStructurizeCFG.cpp445 for (BasicBlock *Succ : Term->successors()) in analyzeLoops()
455 if (Term->isConditional()) { in buildCondition()
456 Cond = Term->getCondition(); in buildCondition()
487 if (Term->isConditional()) { in gatherPredicates()
564 for (BranchInst *Term : Conds) { in insertConditions()
565 assert(Term->isConditional()); in insertConditions()
567 BasicBlock *Parent = Term->getParent(); in insertConditions()
594 Term->setCondition(ParentValue); in insertConditions()
794 Instruction *Term = BB->getTerminator(); in killTerminator() local
795 if (!Term) in killTerminator()
[all …]
H A DPlaceSafepoints.cpp239 Instruction *Term = Pred->getTerminator(); in runOnLoop() local
241 LLVM_DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term); in runOnLoop()
243 PollLocations.push_back(Term); in runOnLoop()
316 for (Instruction *Term : PollLocations) { in runImpl()
332 for (unsigned i = 0; i < Term->getNumSuccessors(); i++) { in runImpl()
333 BasicBlock *Succ = Term->getSuccessor(i); in runImpl()
334 if (DT.dominates(Succ, Term->getParent())) { in runImpl()
345 BasicBlock *NewBB = SplitEdge(Term->getParent(), Header, &DT); in runImpl()
351 PollsNeeded.push_back(Term); in runImpl()
H A DADCE.cpp215 static bool isUnconditionalBranch(Instruction *Term) { in isUnconditionalBranch() argument
216 auto *BR = dyn_cast<BranchInst>(Term); in isUnconditionalBranch()
286 Instruction *Term = BB->getTerminator(); in initialize() local
287 if (isLive(Term)) in initialize()
293 markLive(Term); in initialize()
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp325 if (const Stmt *Term = B->getTerminatorStmt()) { in HandleBlockExit() local
326 switch (Term->getStmtClass()) { in HandleBlockExit()
341 HandleBranch(cast<BinaryOperator>(Term)->getLHS(), Term, B, Pred); in HandleBlockExit()
347 Term, B, Pred); in HandleBlockExit()
354 HandleBranch(cast<ChooseExpr>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
370 HandleBranch(cast<DoStmt>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
374 HandleBranch(cast<CXXForRangeStmt>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
378 HandleBranch(cast<ForStmt>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
388 HandleBranch(cast<IfStmt>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
414 HandleBranch(Term, Term, B, Pred); in HandleBlockExit()
[all …]
/freebsd/usr.sbin/ppp/
H A Dprompt.c97 fprintf(p->Term, "\n"); in prompt_Display()
127 fprintf(p->Term, "%s%s%s> ", pconnect, pauth, shostname); in prompt_Display()
128 fflush(p->Term); in prompt_Display()
334 p->Term = stdout; in prompt_Create()
343 p->Term = fdopen(fd, "a+"); in prompt_Create()
364 if (p->Term != stdout) { in prompt_Destroy()
365 fclose(p->Term); in prompt_Destroy()
411 vfprintf(p->Term, pfmt, ap); in prompt_vPrintf()
412 fflush(p->Term); in prompt_vPrintf()
479 if (p->Term == stdout) in prompt_TtyTermMode()
[all …]
H A Dccp.h132 void (*Term)(void *); member
143 void (*Term)(void *); member
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ReturnThunks.cpp75 for (MachineInstr &Term : MBB.terminators()) in runOnMachineFunction()
76 if (Term.getOpcode() == RetOpc) in runOnMachineFunction()
77 Rets.push_back(&Term); in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DPHIElimination.cpp550 for (MachineBasicBlock::iterator Term = InsertPos; Term != opBlock.end(); in LowerPHINode() local
551 ++Term) { in LowerPHINode()
552 if (Term->readsRegister(SrcReg)) in LowerPHINode()
553 KillInst = Term; in LowerPHINode()
608 for (MachineBasicBlock::iterator Term = InsertPos; in LowerPHINode() local
609 Term != opBlock.end(); ++Term) { in LowerPHINode()
610 if (Term->readsRegister(SrcReg)) in LowerPHINode()
611 KillInst = Term; in LowerPHINode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp642 static void updateBranchWeights(Instruction *Term, WeightInfo &Info) { in updateBranchWeights() argument
643 setBranchWeights(*Term, Info.Weights); in updateBranchWeights()
662 Instruction *Term = ExitingBlock->getTerminator(); in initBranchWeights() local
664 if (!extractBranchWeights(*Term, Weights)) in initBranchWeights()
671 for (auto [Succ, Weight] : zip(successors(Term), Weights)) { in initBranchWeights()
683 for (auto [Succ, Weight] : zip(successors(Term), Weights)) { in initBranchWeights()
696 WeightInfos.insert({Term, {std::move(Weights), std::move(SubWeights)}}); in initBranchWeights()
1005 for (auto &[Term, Info] : Weights) { in peelLoop()
1006 auto *TermCopy = cast<Instruction>(VMap[Term]); in peelLoop()
1035 for (const auto &[Term, Info] : Weights) { in peelLoop()
[all …]
H A DLoopUnroll.cpp715 auto *Term = cast<BranchInst>(Src->getTerminator()); in UnrollLoop() local
717 BasicBlock *Dest = Term->getSuccessor(Idx); in UnrollLoop()
718 BasicBlock *DeadSucc = Term->getSuccessor(1-Idx); in UnrollLoop()
724 BranchInst::Create(Dest, Term); in UnrollLoop()
725 Term->eraseFromParent(); in UnrollLoop()
826 BranchInst *Term = dyn_cast<BranchInst>(Latch->getTerminator()); in UnrollLoop() local
827 assert((Term || in UnrollLoop()
831 if (Term && Term->isUnconditional()) { in UnrollLoop()
832 BasicBlock *Dest = Term->getSuccessor(0); in UnrollLoop()
/freebsd/sys/contrib/dev/acpica/compiler/
H A Daslrules.y242 Term
338 | TermList Term {$$ = TrLinkPeerOp (
340 | TermList Term ';' {$$ = TrLinkPeerOp (
342 | TermList ';' Term {$$ = TrLinkPeerOp (
344 | TermList ';' Term ';' {$$ = TrLinkPeerOp (
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DAnalysisBasedWarnings.cpp445 if (Term && isa<CXXTryStmt>(Term)) in CheckFallThrough()
493 const Stmt *Term = B.getTerminatorStmt(); in CheckFallThrough() local
494 if (Term && (isa<CXXTryStmt>(Term) || isa<ObjCAtTryStmt>(Term))) { in CheckFallThrough()
874 const Stmt *Term = I->Terminator; in DiagUninitUse() local
890 switch (Term ? Term->getStmtClass() : Stmt::DeclStmtClass) { in DiagUninitUse()
898 const IfStmt *IS = cast<IfStmt>(Term); in DiagUninitUse()
1131 if (Term && isa<SwitchStmt>(Term)) in checkFallThroughIntoBlock()
1227 return Term; in getLastStmt()
1324 const Stmt *Term = B->getTerminatorStmt(); in DiagnoseSwitchLabelsFallthrough() local
1328 Term = B->getTerminatorStmt(); in DiagnoseSwitchLabelsFallthrough()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDelinearization.cpp219 for (const SCEV *&Term : Terms) { in findArrayDimensionsRec() local
222 SCEVDivision::divide(SE, Term, Step, &Q, &R); in findArrayDimensionsRec()
228 Term = Q; in findArrayDimensionsRec()
306 for (const SCEV *&Term : Terms) { in findArrayDimensions() local
308 SCEVDivision::divide(SE, Term, ElementSize, &Q, &R); in findArrayDimensions()
310 Term = Q; in findArrayDimensions()
H A DCFG.cpp81 const Instruction *Term = BB->getTerminator(); in GetSuccessorNumber() local
83 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
87 if (Term->getSuccessor(i) == Succ) in GetSuccessorNumber()
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp86 for (const MachineInstr &Term : MBB->terminators()) { in maybeUpdateTerminator() local
88 AnyBarrier |= Term.isBarrier(); in maybeUpdateTerminator()
90 AllAnalyzable &= Term.isBranch() && !Term.isIndirectBranch(); in maybeUpdateTerminator()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCFGStmtMap.cpp74 if (Stmt *Term = B->getTerminatorStmt()) in Accumulate() local
75 SM[Term] = B; in Accumulate()
H A DReachableCode.cpp54 if (const Stmt *Term = B->getTerminatorStmt()) { in isTrivialDoWhile() local
55 if (const DoStmt *DS = dyn_cast<DoStmt>(Term)) { in isTrivialDoWhile()
297 if (const Stmt *Term = B->getTerminatorStmt()) { in shouldTreatSuccessorsAsReachable() local
298 if (isa<SwitchStmt>(Term)) in shouldTreatSuccessorsAsReachable()
301 if (isa<BinaryOperator>(Term)) { in shouldTreatSuccessorsAsReachable()
302 return isConfigurationValue(Term, PP); in shouldTreatSuccessorsAsReachable()
307 if (const auto *IS = dyn_cast<IfStmt>(Term); in shouldTreatSuccessorsAsReachable()
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFMIPeephole.cpp442 for (MachineInstr &Term : MBB->terminators()) { in adjustBranch()
443 if (Term.isConditionalBranch()) { in adjustBranch()
445 CondJmp = &Term; in adjustBranch()
446 } else if (Term.isUnconditionalBranch()) { in adjustBranch()
448 UncondJmp = &Term; in adjustBranch()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionOptimizer.cpp148 MachineBasicBlock::iterator Term = MBB->getFirstTerminator(); in findSuitableCompare() local
149 if (Term == MBB->end()) in findSuitableCompare()
152 if (Term->getOpcode() != AArch64::Bcc) in findSuitableCompare()
161 for (MachineBasicBlock::iterator B = MBB->begin(), It = Term; It != B;) { in findSuitableCompare()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.cpp40 VPRecipeBase *Term = VPBB->getTerminator(); in VPInstructionsToVPRecipes() local
41 auto EndIter = Term ? Term->getIterator() : VPBB->end(); in VPInstructionsToVPRecipes()
557 static bool canSimplifyBranchOnCond(VPInstruction *Term) { in canSimplifyBranchOnCond() argument
558 VPInstruction *Not = dyn_cast<VPInstruction>(Term->getOperand(0)); in canSimplifyBranchOnCond()
573 auto *Term = dyn_cast<VPInstruction>(&ExitingVPBB->back()); in optimizeForVFAndUF() local
579 if (!Term || (Term->getOpcode() != VPInstruction::BranchOnCount && in optimizeForVFAndUF()
580 (Term->getOpcode() != VPInstruction::BranchOnCond || in optimizeForVFAndUF()
581 !canSimplifyBranchOnCond(Term)))) in optimizeForVFAndUF()
598 Term->eraseFromParent(); in optimizeForVFAndUF()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h158 const char *Term = "0") const {
168 OS << Term << ",\n";
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DBasicBlock.cpp588 auto *Term = getTerminator(); in isLegalToHoistInto() local
590 if (!Term) in isLegalToHoistInto()
594 assert(Term->getNumSuccessors() > 0); in isLegalToHoistInto()
598 return !Term->isSpecialTerminator(); in isLegalToHoistInto()
762 Instruction *Term = getTerminator(); in flushTerminatorDbgValues() local
763 if (!Term) in flushTerminatorDbgValues()
772 Term->DbgMarker->absorbDebugValues(*TrailingDPValues, false); in flushTerminatorDbgValues()

1234