HomeSort by: relevance | last modified time | path
    Searched refs:Term (Results 1 - 25 of 72) sorted by relevancy

1 2 3

  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIAnnotateControlFlow.cpp 78 void openIf(BranchInst *Term);
80 void insertElse(BranchInst *Term);
84 BranchInst *Term);
86 void handleLoop(BranchInst *Term);
203 void SIAnnotateControlFlow::openIf(BranchInst *Term) {
204 if (isUniform(Term))
207 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term);
208 Term->setCondition(ExtractValueInst::Create(Ret, 0, "", Term));
    [all...]
SIPreEmitPeephole.cpp 181 for (MachineInstr &Term : Parent->terminators()) {
183 if (Term.isBranch())
184 ToRemove.push_back(&Term);
186 Found = Term.isIdenticalTo(MI);
SIOptimizeExecMaskingPreRA.cpp 350 MachineInstr &Term = MBB.back();
351 if (Term.getOpcode() != AMDGPU::S_ENDPGM || Term.getNumOperands() != 1)
  /src/external/apache2/llvm/dist/llvm/lib/IR/
StructuralHash.cpp 51 const Instruction *Term = BB->getTerminator();
52 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
53 if (!VisitedBBs.insert(Term->getSuccessor(i)).second)
55 BBs.push_back(Term->getSuccessor(i));
BasicBlock.cpp 363 auto *Term = getTerminator();
365 if (!Term)
369 assert(Term->getNumSuccessors() > 0);
372 return !Term->isExceptionalTerminator();
  /src/external/apache2/llvm/dist/llvm/tools/llvm-reduce/deltas/
ReduceBasicBlocks.cpp 29 auto *Term = BB.getTerminator();
36 if (ChunkSucessors.size() == Term->getNumSuccessors())
39 bool IsBranch = isa<BranchInst>(Term) || isa<InvokeInst>(Term);
41 if (auto *IndBI = dyn_cast<IndirectBrInst>(Term))
44 Term->replaceAllUsesWith(UndefValue::get(Term->getType()));
45 Term->eraseFromParent();
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
CoreEngine.cpp 296 if (const Stmt *Term = B->getTerminatorStmt()) {
297 switch (Term->getStmtClass()) {
303 cast<CXXBindTemporaryExpr>(Term), B, Pred);
308 HandleStaticInit(cast<DeclStmt>(Term), B, Pred);
312 HandleBranch(cast<BinaryOperator>(Term)->getLHS(), Term, B, Pred);
317 HandleBranch(cast<AbstractConditionalOperator>(Term)->getCond(),
318 Term, B, Pred);
325 HandleBranch(cast<ChooseExpr>(Term)->getCond(), Term, B, Pred)
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
SequenceToOffsetTable.h 202 const char *Term = "0") const {
212 OS << Term << ",\n";
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 271 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
436 BranchInst *Term = cast<BranchInst>(BB->getTerminator());
438 for (BasicBlock *Succ : Term->successors())
445 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx,
448 if (Term->isConditional()) {
449 Cond = Term->getCondition();
472 BranchInst *Term = cast<BranchInst>(P->getTerminator());
473 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
474 BasicBlock *Succ = Term->getSuccessor(i);
480 if (Term->isConditional())
    [all...]
PlaceSafepoints.cpp 350 Instruction *Term = Pred->getTerminator();
352 LLVM_DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term);
354 PollLocations.push_back(Term);
536 for (Instruction *Term : PollLocations) {
552 for (unsigned i = 0; i < Term->getNumSuccessors(); i++) {
553 BasicBlock *Succ = Term->getSuccessor(i);
554 if (DT.dominates(Succ, Term->getParent())) {
565 BasicBlock *NewBB = SplitEdge(Term->getParent(), Header, &DT);
571 PollsNeeded.push_back(Term);
ADCE.cpp 211 static bool isUnconditionalBranch(Instruction *Term) {
212 auto *BR = dyn_cast<BranchInst>(Term);
282 Instruction *Term = BB->getTerminator();
283 if (isLive(Term))
289 markLive(Term);
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CFGStmtMap.cpp 73 if (Stmt *Term = B->getTerminatorStmt())
74 SM[Term] = B;
ReachableCode.cpp 52 if (const Stmt *Term = B->getTerminatorStmt()) {
53 if (const DoStmt *DS = dyn_cast<DoStmt>(Term)) {
296 if (const Stmt *Term = B->getTerminatorStmt()) {
297 if (isa<SwitchStmt>(Term))
300 if (isa<BinaryOperator>(Term)) {
301 return isConfigurationValue(Term, PP);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
SyncDependenceAnalysis.cpp 431 SyncDependenceAnalysis::getJoinBlocks(const Instruction &Term) {
433 if (Term.getNumSuccessors() <= 1) {
438 auto ItCached = CachedControlDivDescs.find(&Term);
444 const auto &TermBlock = *Term.getParent();
448 LLVM_DEBUG(dbgs() << "Result (" << Term.getParent()->getName() << "):\n";
454 auto ItInserted = CachedControlDivDescs.emplace(&Term, std::move(DivDesc));
DivergenceAnalysis.cpp 290 void DivergenceAnalysisImpl::analyzeControlDivergence(const Instruction &Term) {
291 LLVM_DEBUG(dbgs() << "analyzeControlDiv " << Term.getParent()->getName()
295 if (!DT.isReachableFromEntry(Term.getParent()))
298 const auto *BranchLoop = LI.getLoopFor(Term.getParent());
300 const auto &DivDesc = SDA.getJoinBlocks(Term);
CFG.cpp 81 const Instruction *Term = BB->getTerminator();
83 unsigned e = Term->getNumSuccessors();
87 if (Term->getSuccessor(i) == Succ)
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
SyncDependenceAnalysis.h 67 /// divergence in \p Term.
69 /// The set of blocks which are reachable by disjoint paths from \p Term.
71 /// one from \p Term to the loop exit and another from \p Term to the loop
73 /// If L is the parent loop of \p Term and an exit of L is in the returned
75 const ControlDivergenceDesc &getJoinBlocks(const Instruction &Term);
DivergenceAnalysis.h 86 /// \brief Mark \p Term as divergent and push all Instructions that become
88 void analyzeControlDivergence(const Instruction &Term);
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyCFGSort.cpp 86 for (const MachineInstr &Term : MBB->terminators()) {
88 AnyBarrier |= Term.isBarrier();
90 AllAnalyzable &= Term.isBranch() && !Term.isIndirectBranch();
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopUnroll.cpp 720 auto *Term = cast<BranchInst>(Src->getTerminator());
726 Term->setSuccessor(!(*ContinueOnTrue), Dest);
741 BranchInst::Create(Dest, Term);
742 Term->eraseFromParent();
816 BranchInst *Term = cast<BranchInst>(Latches.back()->getTerminator());
817 new UnreachableInst(Term->getContext(), Term);
818 Term->eraseFromParent();
848 Instruction *Term = ExitingBlocks[i]->getTerminator();
849 if (isa<BranchInst>(Term) && cast<BranchInst>(Term)->isConditional())
    [all...]
  /src/sys/external/bsd/acpica/dist/compiler/
aslrules.y 56 * Root term. Allow multiple #line directives before the definition block
83 * The ObjectList term is obsolete and has been removed.
134 Term
208 /* C-style (ASL+) -- adds equals term */
230 | TermList Term {$$ = TrLinkPeerOp (
232 | TermList Term ';' {$$ = TrLinkPeerOp (
234 | TermList ';' Term {$$ = TrLinkPeerOp (
236 | TermList ';' Term ';' {$$ = TrLinkPeerOp (
350 * Case-Default list; allow only one Default term and unlimited Case terms
361 /* Original - attempts to force zero or one default term within the switch *
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
PHIElimination.cpp 509 for (MachineBasicBlock::iterator Term = FirstTerm;
510 Term != opBlock.end(); ++Term) {
511 if (Term->readsRegister(SrcReg))
512 KillInst = Term;
568 for (MachineBasicBlock::iterator Term = FirstTerm;
569 Term != opBlock.end(); ++Term) {
570 if (Term->readsRegister(SrcReg))
571 KillInst = Term;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64ConditionOptimizer.cpp 148 MachineBasicBlock::iterator Term = MBB->getFirstTerminator();
149 if (Term == MBB->end())
152 if (Term->getOpcode() != AArch64::Bcc)
161 for (MachineBasicBlock::iterator B = MBB->begin(), It = Term; It != B;) {
  /src/external/apache2/llvm/dist/clang/lib/Sema/
AnalysisBasedWarnings.cpp 417 const Stmt *Term = B->getTerminatorStmt();
418 if (Term && isa<CXXTryStmt>(Term))
466 const Stmt *Term = B.getTerminatorStmt();
467 if (Term && isa<CXXTryStmt>(Term)) {
847 const Stmt *Term = I->Terminator;
863 switch (Term ? Term->getStmtClass() : Stmt::DeclStmtClass) {
871 const IfStmt *IS = cast<IfStmt>(Term);
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/M68k/MCTargetDesc/
M68kBaseInfo.h 71 Term = 0x0,

Completed in 53 milliseconds

1 2 3