| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 84 void openIf(BranchInst *Term);
86 void insertElse(BranchInst *Term);
89 llvm::Loop *L, BranchInst *Term);
91 void handleLoop(BranchInst *Term);
215 void SIAnnotateControlFlow::openIf(BranchInst *Term) {
216 if (isUniform(Term)) {
219 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term);
220 Term->setCondition(ExtractValueInst::Create(Ret, 0, "", Term));
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 92 void openIf(BranchInst *Term);
94 void insertElse(BranchInst *Term);
98 BranchInst *Term,
101 void handleLoop(BranchInst *Term);
209 void SIAnnotateControlFlow::openIf(BranchInst *Term) {
210 if (isUniform(Term))
213 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term);
214 Term->setCondition(ExtractValueInst::Create(Ret, 0, "", Term));
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| CFG.h | 98 const Term_ Term;
104 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors();
111 explicit inline SuccIterator(Term_ T) : Term(T), idx(0) {// begin iterator
114 : Term(T) {
115 if (Term)
116 idx = Term->getNumSuccessors();
118 // Term == NULL happens, if a basic block is not fully constructed and
127 assert(Term == I.Term &&"Cannot assign iterators to two different blocks!");
139 inline pointer operator*() const { return Term->getSuccessor(idx);
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 357 if (const Stmt *Term = B->getTerminator()) {
358 switch (Term->getStmtClass()) {
369 HandleStaticInit(cast<DeclStmt>(Term), B, Pred);
373 HandleBranch(cast<BinaryOperator>(Term)->getLHS(), Term, B, Pred);
378 HandleBranch(cast<AbstractConditionalOperator>(Term)->getCond(),
379 Term, B, Pred);
386 HandleBranch(cast<ChooseExpr>(Term)->getCond(), Term, B, Pred);
403 HandleBranch(cast<DoStmt>(Term)->getCond(), Term, B, Pred)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 214 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
389 BranchInst *Term = cast<BranchInst>(BB->getTerminator());
391 for (BasicBlock *Succ : Term->successors())
431 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx,
434 if (Term->isConditional()) {
435 Cond = Term->getCondition();
458 BranchInst *Term = cast<BranchInst>(P->getTerminator());
459 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
460 BasicBlock *Succ = Term->getSuccessor(i);
466 if (Term->isConditional())
[all...] |
| PlaceSafepoints.cpp | 351 TerminatorInst *Term = Pred->getTerminator();
353 LLVM_DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term);
355 PollLocations.push_back(Term);
538 for (TerminatorInst *Term : PollLocations) {
554 for (unsigned i = 0; i < Term->getNumSuccessors(); i++) {
555 BasicBlock *Succ = Term->getSuccessor(i);
556 if (DT.dominates(Succ, Term->getParent())) {
567 BasicBlock *NewBB = SplitEdge(Term->getParent(), Header, &DT);
573 PollsNeeded.push_back(Term);
|
| ADCE.cpp | 208 static bool isUnconditionalBranch(TerminatorInst *Term) {
209 auto *BR = dyn_cast<BranchInst>(Term);
279 TerminatorInst *Term = BB->getTerminator();
280 if (isLive(Term))
286 markLive(Term);
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 200 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
369 BranchInst *Term = cast<BranchInst>(BB->getTerminator());
371 for (BasicBlock *Succ : Term->successors())
416 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx,
419 if (Term->isConditional()) {
420 Cond = Term->getCondition();
446 BranchInst *Term = cast<BranchInst>((*PI)->getTerminator());
447 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
448 BasicBlock *Succ = Term->getSuccessor(i);
454 if (Term->isConditional())
[all...] |
| PlaceSafepoints.cpp | 342 TerminatorInst *Term = Pred->getTerminator();
344 DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term);
346 PollLocations.push_back(Term);
526 for (TerminatorInst *Term : PollLocations) {
542 for (unsigned i = 0; i < Term->getNumSuccessors(); i++) {
543 BasicBlock *Succ = Term->getSuccessor(i);
544 if (DT.dominates(Succ, Term->getParent())) {
555 BasicBlock *NewBB = SplitEdge(Term->getParent(), Header, &DT);
561 PollsNeeded.push_back(Term);
|
| /external/skia/include/core/ |
| SkGraphics.h | 27 static void Term() {}
|
| /external/skqp/include/core/ |
| SkGraphics.h | 27 static void Term() {}
|
| /external/clang/lib/Analysis/ |
| CFGStmtMap.cpp | 74 if (Stmt *Term = B->getTerminator())
75 SM[Term] = B;
|
| /external/apache-commons-bcel/src/examples/Mini/ |
| Mini.jjt | 103 Term() [kind = AddOp() Expr() { jjtThis.setKind(kind); }]
143 void Term():
148 Factor() [kind = MultOp() { jjtThis.setKind(kind); } Term()]
|
| /external/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 116 const char *Term = "0") const {
126 OS << Term << ",\n";
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 116 const char *Term = "0") const {
126 OS << Term << ",\n";
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/EhciDxe/ |
| EhciUrb.h | 83 #define QH_LINK(Addr, Type, Term) \
84 ((UINT32) ((EHC_LOW_32BIT (Addr) & 0xFFFFFFE0) | (Type) | ((Term) ? 1 : 0)))
86 #define QTD_LINK(Addr, Term) QH_LINK((Addr), 0, (Term))
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/EhciPei/ |
| EhciUrb.h | 79 #define QH_LINK(Addr, Type, Term) \
80 ((UINT32) ((EHC_LOW_32BIT (Addr) & 0xFFFFFFE0) | (Type) | ((Term) ? 1 : 0)))
82 #define QTD_LINK(Addr, Term) QH_LINK((Addr), 0, (Term))
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGSort.cpp | 71 for (const MachineInstr &Term : MBB->terminators()) {
73 AnyBarrier |= Term.isBarrier();
75 AllAnalyzable &= Term.isBranch() && !Term.isIndirectBranch();
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 328 BranchInst *Term = cast<BranchInst>(Latches[i]->getTerminator());
351 Term->setSuccessor(!ContinueOnTrue, Dest);
367 BranchInst::Create(Dest, Term);
368 Term->eraseFromParent();
374 BranchInst *Term = cast<BranchInst>(Latches[i]->getTerminator());
375 if (Term->isUnconditional()) {
376 BasicBlock *Dest = Term->getSuccessor(0);
|
| /external/llvm/lib/CodeGen/ |
| PHIElimination.cpp | 428 for (MachineBasicBlock::iterator Term = FirstTerm;
429 Term != opBlock.end(); ++Term) {
430 if (Term->readsRegister(SrcReg))
431 KillInst = Term;
488 for (MachineBasicBlock::iterator Term = FirstTerm;
489 Term != opBlock.end(); ++Term) {
490 if (Term->readsRegister(SrcReg))
491 KillInst = Term;
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| PHIElimination.cpp | 442 for (MachineBasicBlock::iterator Term = FirstTerm;
443 Term != opBlock.end(); ++Term) {
444 if (Term->readsRegister(SrcReg))
445 KillInst = Term;
502 for (MachineBasicBlock::iterator Term = FirstTerm;
503 Term != opBlock.end(); ++Term) {
504 if (Term->readsRegister(SrcReg))
505 KillInst = Term;
[all...] |
| /external/llvm/lib/ProfileData/Coverage/ |
| CoverageMapping.cpp | 66 // least one term.
92 for (auto Term : Terms) {
93 if (Term.second <= 0)
95 for (int I = 0; I < Term.second; ++I)
97 C = Counter::getCounter(Term.first);
100 Counter::getCounter(Term.first)));
104 for (auto Term : Terms) {
105 if (Term.second >= 0)
107 for (int I = 0; I < -Term.second; ++I)
109 Counter::getCounter(Term.first)))
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| PHIElimination.cpp | 345 MachineBasicBlock::iterator Term = opBlock.getFirstTerminator();
346 if (Term != opBlock.end() && Term->readsRegister(SrcReg)) {
347 KillInst = Term;
351 for (MachineBasicBlock::iterator TI = llvm::next(Term);
362 KillInst = Term;
|
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 74 const TerminatorInst *Term = BB->getTerminator();
76 unsigned e = Term->getNumSuccessors();
80 if (Term->getSuccessor(i) == Succ)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| CFG.cpp | 74 const TerminatorInst *Term = BB->getTerminator();
76 unsigned e = Term->getNumSuccessors();
80 if (Term->getSuccessor(i) == Succ)
|
