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);
81 bool insertElse(BranchInst *Term);
85 BranchInst *Term);
87 bool handleLoop(BranchInst *Term);
205 bool SIAnnotateControlFlow::openIf(BranchInst *Term) { in openIf() argument
206 if (isUniform(Term)) in openIf()
209 IRBuilder<> IRB(Term); in openIf()
210 Value *IfCall = IRB.CreateCall(If, {Term->getCondition()}); in openIf()
213 Term->setCondition(Cond); in openIf()
214 push(Term->getSuccessor(1), Mask); in openIf()
[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.cpp102 auto *Term = BBs[0]->getTerminator(); in performBlockTailMerging() local
107 F.getContext(), Twine("common.") + Term->getOpcodeName(), &F, BBs[0]); in performBlockTailMerging()
109 NewOps.resize(Term->getNumOperands()); in performBlockTailMerging()
110 for (auto I : zip(Term->operands(), NewOps)) { in performBlockTailMerging()
118 CanonicalTerm = Term->clone(); in performBlockTailMerging()
129 auto *Term = BB->getTerminator(); in performBlockTailMerging() local
130 assert(Term->getOpcode() == CanonicalTerm->getOpcode() && in performBlockTailMerging()
136 for (auto I : zip(Term->operands(), NewOps)) in performBlockTailMerging()
141 CommonDebugLoc = Term->getDebugLoc(); in performBlockTailMerging()
144 DILocation::getMergedLocation(CommonDebugLoc, Term->getDebugLoc()); in performBlockTailMerging()
[all …]
H A DStructurizeCFG.cpp274 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
443 BranchInst *Term = cast<BranchInst>(BB->getTerminator()); in analyzeLoops() local
445 for (BasicBlock *Succ : Term->successors()) in analyzeLoops()
452 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx, in buildCondition() argument
455 if (Term->isConditional()) { in buildCondition()
456 Cond = Term->getCondition(); in buildCondition()
479 BranchInst *Term = cast<BranchInst>(P->getTerminator()); in gatherPredicates() local
480 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in gatherPredicates()
481 BasicBlock *Succ = Term->getSuccessor(i); in gatherPredicates()
487 if (Term->isConditional()) { in gatherPredicates()
[all …]
H A DPlaceSafepoints.cpp240 Instruction *Term = Pred->getTerminator(); in runOnLoop() local
242 LLVM_DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term); in runOnLoop()
244 PollLocations.push_back(Term); in runOnLoop()
318 for (Instruction *Term : PollLocations) { in runImpl()
334 for (unsigned i = 0; i < Term->getNumSuccessors(); i++) { in runImpl()
335 BasicBlock *Succ = Term->getSuccessor(i); in runImpl()
336 if (DT.dominates(Succ, Term->getParent())) { in runImpl()
347 BasicBlock *NewBB = SplitEdge(Term->getParent(), Header, &DT); in runImpl()
353 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.cpp313 if (const Stmt *Term = B->getTerminatorStmt()) { in HandleBlockExit() local
314 switch (Term->getStmtClass()) { in HandleBlockExit()
320 cast<CXXBindTemporaryExpr>(Term), B, Pred); in HandleBlockExit()
325 HandleStaticInit(cast<DeclStmt>(Term), B, Pred); in HandleBlockExit()
329 HandleBranch(cast<BinaryOperator>(Term)->getLHS(), Term, B, Pred); in HandleBlockExit()
334 HandleBranch(cast<AbstractConditionalOperator>(Term)->getCond(), in HandleBlockExit()
335 Term, B, Pred); in HandleBlockExit()
342 HandleBranch(cast<ChooseExpr>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
358 HandleBranch(cast<DoStmt>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
362 HandleBranch(cast<CXXForRangeStmt>(Term)->getCond(), Term, B, Pred); in HandleBlockExit()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DStructuralHash.cpp51 const Instruction *Term = BB->getTerminator(); update() local
H A DBasicBlock.cpp556 auto *Term = getTerminator(); in isLegalToHoistInto() local
558 if (!Term) in isLegalToHoistInto()
562 assert(Term->getNumSuccessors() > 0); in isLegalToHoistInto()
566 return !Term->isSpecialTerminator(); in isLegalToHoistInto()
732 Instruction *Term = getTerminator(); in flushTerminatorDbgRecords() local
733 if (!Term) in flushTerminatorDbgRecords()
742 createMarker(Term); in flushTerminatorDbgRecords()
743 Term->DebugMarker->absorbDebugValues(*TrailingDbgRecords, false); in flushTerminatorDbgRecords()
/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.cpp76 for (MachineInstr &Term : MBB.terminators()) in runOnMachineFunction()
77 if (Term.getOpcode() == RetOpc) in runOnMachineFunction()
78 Rets.push_back(&Term); in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DPHIElimination.cpp627 for (MachineBasicBlock::iterator Term = InsertPos; Term != opBlock.end(); in LowerPHINode() local
628 ++Term) { in LowerPHINode()
629 if (Term->readsRegister(SrcReg, /*TRI=*/nullptr)) in LowerPHINode()
630 KillInst = Term; in LowerPHINode()
686 for (MachineBasicBlock::iterator Term = InsertPos; in LowerPHINode() local
687 Term != opBlock.end(); ++Term) { in LowerPHINode()
688 if (Term->readsRegister(SrcReg, /*TRI=*/nullptr)) in LowerPHINode()
689 KillInst = Term; in LowerPHINode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp682 static void updateBranchWeights(Instruction *Term, WeightInfo &Info) { in updateBranchWeights() argument
683 setBranchWeights(*Term, Info.Weights, /*IsExpected=*/false); in updateBranchWeights()
702 Instruction *Term = ExitingBlock->getTerminator(); in initBranchWeights() local
704 if (!extractBranchWeights(*Term, Weights)) in initBranchWeights()
711 for (auto [Succ, Weight] : zip(successors(Term), Weights)) { in initBranchWeights()
723 for (auto [Succ, Weight] : zip(successors(Term), Weights)) { in initBranchWeights()
736 WeightInfos.insert({Term, {std::move(Weights), std::move(SubWeights)}}); in initBranchWeights()
1045 for (auto &[Term, Info] : Weights) { in peelLoop()
1046 auto *TermCopy = cast<Instruction>(VMap[Term]); in peelLoop()
1075 for (const auto &[Term, Info] : Weights) { in peelLoop()
[all …]
H A DLoopUnroll.cpp877 auto *Term = cast<BranchInst>(Src->getTerminator()); in UnrollLoop() local
879 BasicBlock *Dest = Term->getSuccessor(Idx); in UnrollLoop()
880 BasicBlock *DeadSucc = Term->getSuccessor(1-Idx); in UnrollLoop()
886 BranchInst::Create(Dest, Term->getIterator()); in UnrollLoop()
887 Term->eraseFromParent(); in UnrollLoop()
988 BranchInst *Term = dyn_cast<BranchInst>(Latch->getTerminator()); in UnrollLoop() local
989 assert((Term || in UnrollLoop()
993 if (Term && Term->isUnconditional()) { in UnrollLoop()
994 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/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/Sema/
H A DAnalysisBasedWarnings.cpp444 const Stmt *Term = B->getTerminatorStmt(); in CheckFallThrough() local
445 if (isa_and_nonnull<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()
908 const ConditionalOperator *CO = cast<ConditionalOperator>(Term); in DiagUninitUse()
918 const BinaryOperator *BO = cast<BinaryOperator>(Term); in DiagUninitUse()
940 Range = cast<WhileStmt>(Term)->getCond()->getSourceRange(); in DiagUninitUse()
[all …]
/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.cpp55 if (const Stmt *Term = B->getTerminatorStmt()) { in isTrivialDoWhile() local
56 if (const DoStmt *DS = dyn_cast<DoStmt>(Term)) { in isTrivialDoWhile()
298 if (const Stmt *Term = B->getTerminatorStmt()) { in shouldTreatSuccessorsAsReachable() local
299 if (isa<SwitchStmt>(Term)) in shouldTreatSuccessorsAsReachable()
302 if (isa<BinaryOperator>(Term)) { in shouldTreatSuccessorsAsReachable()
303 return isConfigurationValue(Term, PP); in shouldTreatSuccessorsAsReachable()
308 if (const auto *IS = dyn_cast<IfStmt>(Term); in shouldTreatSuccessorsAsReachable()
/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/utils/TableGen/Basic/
H A DSequenceToOffsetTable.h157 const char *Term = "0") const {
168 OS << Term << ",\n";
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.cpp42 VPRecipeBase *Term = VPBB->getTerminator(); in VPInstructionsToVPRecipes() local
43 auto EndIter = Term ? Term->getIterator() : VPBB->end(); in VPInstructionsToVPRecipes()
679 auto *Term = &ExitingVPBB->back(); in optimizeForVFAndUF() local
686 if (!match(Term, m_BranchOnCount(m_VPValue(), m_VPValue())) && in optimizeForVFAndUF()
687 !match(Term, in optimizeForVFAndUF()
706 SmallVector<VPValue *> PossiblyDead(Term->operands()); in optimizeForVFAndUF()
707 Term->eraseFromParent(); in optimizeForVFAndUF()
834 if (auto *Term = in adjustFixedOrderRecurrences() local
836 if (auto *Cmp = dyn_cast<VPInstruction>(Term->getOperand(0))) in adjustFixedOrderRecurrences()
839 MiddleBuilder.setInsertPoint(Term); in adjustFixedOrderRecurrences()

1234