| /external/llvm/lib/CodeGen/ |
| IfConversion.cpp | 136 /// BBI - Corresponding BBInfo.
147 BBInfo &BBI;
153 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {}
187 bool ReverseBranchCondition(BBInfo &BBI);
195 void ScanInstructions(BBInfo &BBI);
198 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond,
202 void RemoveExtraEdges(BBInfo &BBI);
203 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
204 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
205 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind
[all...] |
| ErlangGC.cpp | 63 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE;
64 ++BBI)
65 for (MachineBasicBlock::iterator MI = BBI->begin(), ME = BBI->end();
|
| PHIElimination.cpp | 536 for (const auto &BBI : MBB) {
537 if (!BBI.isPHI())
539 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
540 ++VRegPHIUseCount[BBVRegPair(BBI.getOperand(i+1).getMBB()->getNumber(),
541 BBI.getOperand(i).getReg())];
555 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
556 BBI != BBE && BBI->isPHI(); ++BBI) {
557 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
[all...] |
| LiveVariables.cpp | 705 for (const auto &BBI : MBB) {
706 if (!BBI.isPHI())
708 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
709 if (BBI.getOperand(i).readsReg())
710 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()]
711 .push_back(BBI.getOperand(i).getReg());
788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end();
789 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
[all...] |
| GCStrategy.cpp | 371 for (MachineFunction::iterator BBI = MF.begin(),
372 BBE = MF.end(); BBI != BBE; ++BBI)
373 for (MachineBasicBlock::iterator MI = BBI->begin(),
374 ME = BBI->end(); MI != ME; ++MI)
|
| Analysis.cpp | 501 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) {
502 if (&*BBI == I)
505 if (isa<DbgInfoIntrinsic>(BBI))
507 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() ||
508 !isSafeToSpeculativelyExecute(BBI))
|
| /external/llvm/lib/MC/MCAnalysis/ |
| MCObjectDisassembler.cpp | 261 BBInfo &BBI = BBInfos[*CI];
262 if (!BBI.Atom) continue;
264 MCFunction &MCFN = *Module->createFunction(BBI.Atom->getName());
268 Worklist.insert(&BBI);
270 BBInfo *BBI = Worklist[wi];
271 if (!BBI->Atom)
273 BBI->BB = &MCFN.createBlock(*BBI->Atom);
275 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end()
[all...] |
| MCModuleYAML.cpp | 338 for (MCFunction::const_iterator BBI = MCF.begin(), BBE = MCF.end();
339 BBI != BBE; ++BBI) {
340 const MCBasicBlock &MCBB = **BBI;
408 for (BBIt BBI = FI->BasicBlocks.begin(), BBE = FI->BasicBlocks.end();
409 BBI != BBE; ++BBI) {
410 AddrToTextAtomTy::const_iterator It = TAByAddr.find(BBI->Address);
415 for (BBIt BBI = FI->BasicBlocks.begin(), BBE = FI->BasicBlocks.end();
416 BBI != BBE; ++BBI)
[all...] |
| /external/llvm/lib/Analysis/ |
| Loads.cpp | 102 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
104 while (BBI != E) {
105 --BBI;
109 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() &&
110 !isa<DbgInfoIntrinsic>(BBI))
113 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
115 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
|
| LazyValueInfo.cpp | 379 Instruction *BBI, BasicBlock *BB);
519 Instruction *BBI = dyn_cast<Instruction>(Val);
520 if (!BBI || BBI->getParent() != BB) {
524 if (PHINode *PN = dyn_cast<PHINode>(BBI)) {
528 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) {
536 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) ||
537 !BBI->getType()->isIntegerTy()) {
546 BinaryOperator *BO = dyn_cast<BinaryOperator>(BBI);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 497 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
498 Instruction *Inst = BBI++;
526 // DeleteDeadInstruction can delete the current instruction. Save BBI
528 WeakVH NextInst(BBI);
533 BBI = BB.begin();
534 else if (BBI != BB.begin()) // Revisit this instruction if possible.
535 --BBI;
582 // cases, reset BBI.
583 BBI = Inst
[all...] |
| TailRecursionElimination.cpp | 517 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) {
518 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator());
579 BasicBlock::iterator BBI = TI;
581 CI = dyn_cast<CallInst>(BBI);
585 if (BBI == BB->begin())
587 --BBI;
641 BasicBlock::iterator BBI = CI;
642 for (++BBI; &*BBI != Ret; ++BBI)
[all...] |
| SimplifyCFGPass.cpp | 78 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; ) {
79 BasicBlock &BB = *BBI++;
|
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 35 BasicBlock::iterator BBI = BB0->begin();
36 Instruction *Y1 = BBI++;
37 Instruction *Y2 = BBI++;
38 Instruction *Y3 = BBI++;
41 BBI = BB1->begin();
42 Instruction *Y4 = BBI++;
45 BBI = BB2->begin();
46 Instruction *Y5 = BBI++;
49 BBI = BB3->begin();
50 Instruction *Y6 = BBI++
[all...] |
| PassManagerTest.cpp | 38 for (Function::iterator BBI = F->begin(), BBE = F->end(); BBI != BBE; ++BBI)
39 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 389 BasicBlock::iterator BBI = &LI;
390 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6))
636 BasicBlock::iterator BBI = &SI;
637 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
639 --BBI;
642 if (isa<DbgInfoIntrinsic>(BBI) ||
643 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) {
648 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
653 ++BBI;
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 103 for (SmallVectorImpl<BasicBlock *>::const_iterator BBI = ExitBlocks.begin(),
105 BBI != BBE; ++BBI) {
106 BasicBlock *ExitBB = *BBI;
197 for (Loop::block_iterator BBI = L.block_begin(), BBE = L.block_end();
198 BBI != BBE; ++BBI) {
199 BasicBlock *BB = *BBI;
|
| SimplifyCFG.cpp | 135 for (BasicBlock::iterator BBI = (*I)->begin();
136 isa<PHINode>(BBI); ++BBI) {
137 PHINode *PN = cast<PHINode>(BBI);
176 for (BasicBlock::iterator BBI = (*I)->begin();
177 isa<PHINode>(BBI); ++BBI) {
178 PHINode *PN = cast<PHINode>(BBI);
[all...] |
| Local.cpp | 755 BasicBlock::iterator BBI = BB->begin();
756 while (isa<PHINode>(*BBI)) {
757 for (Use &U : BBI->uses()) {
765 ++BBI;
[all...] |
| LoopUnroll.cpp | 327 for (BasicBlock::iterator BBI = (*SI)->begin();
328 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) {
413 for (BasicBlock::iterator BBI = (*SI)->begin();
414 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) {
|
| LoopUnrollRuntime.cpp | 71 for (BasicBlock::iterator BBI = (*SBI)->begin();
72 PHINode *PN = dyn_cast<PHINode>(BBI); ++BBI) {
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 374 BasicBlock::iterator BBI = Inst;
381 if (&*BBI == InstParent->begin()) {
385 BBI = Pred->getTerminator();
388 --BBI;
389 } while (IsNoopInstruction(BBI));
391 if (&*BBI == GetObjCArg(Inst)) {
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 260 Function::iterator BBI = MF->begin();
261 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB)));
262 TranslatedBlocksToNotExtract.insert(BBI);
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXGenericToNVVM.cpp | 112 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE;
113 ++BBI) {
114 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
|
| /external/llvm/lib/Target/ARM/ |
| ARMConstantIslandPass.cpp | 361 const BasicBlockInfo &BBI = BBInfo[J];
362 dbgs() << format("%08x BB#%u\t", BBI.Offset, J)
363 << " kb=" << unsigned(BBI.KnownBits)
364 << " ua=" << unsigned(BBI.Unalign)
365 << " pa=" << unsigned(BBI.PostAlign)
800 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()];
801 BBI.Size = 0;
802 BBI.Unalign = 0;
803 BBI.PostAlign = 0;
807 BBI.Size += TII->GetInstSizeInBytes(I)
[all...] |
