Searched refs:BBI (Results 1 - 25 of 92) sorted by relevance

1234

/external/llvm/lib/CodeGen/
H A DIfConversion.cpp138 /// BBI - Corresponding BBInfo.
149 BBInfo &BBI; member in struct:__anon12671::IfConverter::IfcvtToken
155 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {}
198 bool ReverseBranchCondition(BBInfo &BBI);
206 void ScanInstructions(BBInfo &BBI);
209 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond,
214 void RemoveExtraEdges(BBInfo &BBI);
215 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
216 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
217 bool IfConvertDiamond(BBInfo &BBI, IfcvtKin
334 BBInfo &BBI = Token->BBI; local
453 ReverseBranchCondition(BBInfo &BBI) argument
649 ScanInstructions(BBInfo &BBI) argument
761 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch) argument
817 BBInfo &BBI = BBAnalysis[BB->getNumber()]; local
1041 RemoveExtraEdges(BBInfo &BBI) argument
1111 IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) argument
1197 IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) argument
1344 IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2) argument
1613 PredicateBlock(BBInfo &BBI, MachineBasicBlock::iterator E, SmallVectorImpl<MachineOperand> &Cond, SmallSet<unsigned, 4> *LaterRedefs) argument
[all...]
H A DPHIElimination.cpp538 for (const auto &BBI : MBB) {
539 if (!BBI.isPHI())
541 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
542 ++VRegPHIUseCount[BBVRegPair(BBI.getOperand(i+1).getMBB()->getNumber(),
543 BBI.getOperand(i).getReg())];
557 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
558 BBI != BBE && BBI->isPHI(); ++BBI) {
559 for (unsigned i = 1, e = BBI
[all...]
H A DLiveVariables.cpp712 for (const auto &BBI : MBB) {
713 if (!BBI.isPHI())
715 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
716 if (BBI.getOperand(i).readsReg())
717 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()]
718 .push_back(BBI.getOperand(i).getReg());
772 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); local
773 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
[all...]
H A DGCRootLowering.cpp297 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE;
298 ++BBI)
299 for (MachineBasicBlock::iterator MI = BBI->begin(), ME = BBI->end();
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DIfConversion.cpp128 /// BBI - Corresponding BBInfo.
139 BBInfo &BBI; member in struct:__anon19814::IfConverter::IfcvtToken
145 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {}
175 bool ReverseBranchCondition(BBInfo &BBI);
183 void ScanInstructions(BBInfo &BBI);
186 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond,
190 void RemoveExtraEdges(BBInfo &BBI);
191 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
192 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
193 bool IfConvertDiamond(BBInfo &BBI, IfcvtKin
298 BBInfo &BBI = Token->BBI; local
428 ReverseBranchCondition(BBInfo &BBI) argument
620 ScanInstructions(BBInfo &BBI) argument
708 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch) argument
744 BBInfo &BBI = BBAnalysis[BB->getNumber()]; local
949 RemoveExtraEdges(BBInfo &BBI) argument
1018 IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) argument
1090 IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) argument
1201 IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2) argument
1361 PredicateBlock(BBInfo &BBI, MachineBasicBlock::iterator E, SmallVectorImpl<MachineOperand> &Cond, SmallSet<unsigned, 4> &Redefs) argument
[all...]
H A DStrongPHIElimination.cpp242 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
243 BBI != BBE && BBI->isPHI(); ++BBI) {
244 unsigned DestReg = BBI->getOperand(0).getReg();
246 PHISrcDefs[I].push_back(BBI);
248 for (unsigned i = 1; i < BBI->getNumOperands(); i += 2) {
249 MachineOperand &SrcMO = BBI->getOperand(i);
275 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
276 BBI !
303 MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); local
[all...]
H A DPHIElimination.cpp398 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end();
399 BBI != BBE && BBI->isPHI(); ++BBI)
400 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
401 ++VRegPHIUseCount[BBVRegPair(BBI->getOperand(i+1).getMBB()->getNumber(),
402 BBI->getOperand(i).getReg())];
413 for (MachineBasicBlock::const_iterator BBI = MBB.begin(), BBE = MBB.end();
414 BBI != BBE && BBI
[all...]
H A DAnalysis.cpp230 for (BasicBlock::const_iterator BBI = prior(prior(ExitBB->end())); ;
231 --BBI) {
232 if (&*BBI == I)
235 if (isa<DbgInfoIntrinsic>(BBI))
237 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() ||
238 !BBI->isSafeToSpeculativelyExecute())
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp82 BasicBlock::iterator BBI = I, BBE = BB->end(); local
83 while (BBI != BBE) {
84 if (!BBI->use_empty())
85 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType()));
86 BB->getInstList().erase(BBI++);
124 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){
125 if (CallInst *CI = dyn_cast<CallInst>(BBI)) {
[all...]
H A DTailRecursionElimination.cpp309 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) {
310 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator());
371 BasicBlock::iterator BBI = TI; local
373 CI = dyn_cast<CallInst>(BBI);
377 if (BBI == BB->begin())
379 --BBI;
432 BasicBlock::iterator BBI = CI; local
433 for (++BBI;
[all...]
H A DDeadStoreElimination.cpp427 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
428 Instruction *Inst = BBI++;
456 // DeleteDeadInstruction can delete the current instruction. Save BBI
458 WeakVH NextInst(BBI);
463 BBI = BB.begin();
464 else if (BBI != BB.begin()) // Revisit this instruction if possible.
465 --BBI;
508 // cases, reset BBI.
509 BBI
[all...]
/external/llvm/unittests/Analysis/
H A DUnrollAnalyzer.cpp102 BasicBlock::iterator BBI = Header->begin(); local
103 std::advance(BBI, 4);
104 Instruction *Y1 = &*BBI++;
105 Instruction *Y2 = &*BBI++;
165 BasicBlock::iterator BBI = Header->begin(); local
166 BBI++;
167 Instruction *Y1 = &*BBI;
168 BBI = InnerBody->begin();
169 BBI++;
170 Instruction *Y2 = &*BBI;
210 BasicBlock::iterator BBI = Header->begin(); local
257 BasicBlock::iterator BBI = Header->begin(); local
303 BasicBlock::iterator BBI = Header->begin(); local
[all...]
/external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp173 BasicBlock::iterator BBI = &LI;
174 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6))
408 BasicBlock::iterator BBI = &SI; local
409 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
411 --BBI;
414 if (isa<DbgInfoIntrinsic>(BBI) ||
415 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) {
420 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
425 ++BBI;
[all...]
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DLoads.cpp130 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); local
132 while (BBI != E) {
133 --BBI;
137 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() &&
138 !isa<DbgInfoIntrinsic>(BBI))
141 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
143 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
H A DLazyValueInfo.cpp413 Instruction *BBI, BasicBlock *BB);
540 Instruction *BBI = dyn_cast<Instruction>(Val); local
541 if (BBI == 0 || BBI->getParent() != BB) {
545 if (PHINode *PN = dyn_cast<PHINode>(BBI)) {
549 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) {
557 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) ||
558 !BBI->getType()->isIntegerTy()) {
567 BinaryOperator *BO = dyn_cast<BinaryOperator>(BBI);
714 solveBlockValueConstantRange(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DDeadStoreElimination.cpp68 deleteDeadInstruction(Instruction *I, BasicBlock::iterator *BBI, argument
78 BasicBlock::iterator NewIter = *BBI;
110 *BBI = NewIter;
616 BasicBlock::iterator BBI(Dependency);
617 deleteDeadInstruction(Dependency, &BBI, *MD, *TLI);
626 Dep = MD->getPointerDependencyFrom(Loc, false, BBI, BB);
700 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){
701 --BBI;
704 if (hasMemoryWrite(&*BBI, *TL
822 eliminateNoopStore(Instruction *Inst, BasicBlock::iterator &BBI, AliasAnalysis *AA, MemoryDependenceResults *MD, const DataLayout &DL, const TargetLibraryInfo *TLI) argument
[all...]
H A DTailRecursionElimination.cpp396 for (BasicBlock &BBI : *F) {
397 ReturnInst *RI = dyn_cast<ReturnInst>(BBI.getTerminator());
456 BasicBlock::iterator BBI(TI);
458 CI = dyn_cast<CallInst>(BBI);
462 if (BBI == BB->begin())
464 --BBI;
517 BasicBlock::iterator BBI(CI);
518 for (++BBI; &*BBI != Ret; ++BBI) {
[all...]
H A DPlaceSafepoints.cpp265 for (BasicBlock::iterator BBI(Start), BBE0 = Start->getParent()->end(),
267 BBI != BBE0 && BBI != BBE1; BBI++) {
268 if (CallInst *CI = dyn_cast<CallInst>(&*BBI))
272 assert(!isa<InvokeInst>(&*BBI) &&
277 if (BBI->isTerminator()) {
278 BasicBlock *BB = BBI->getParent();
/external/llvm/include/llvm/Transforms/Scalar/
H A DMemCpyOptimizer.h51 bool processStore(StoreInst *SI, BasicBlock::iterator &BBI);
52 bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI);
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
H A DLCSSA.cpp137 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end();
138 BBI != E; ++BBI) {
139 BasicBlock *BB = *BBI;
217 for (SmallVectorImpl<BasicBlock*>::const_iterator BBI = ExitBlocks.begin(),
218 BBE = ExitBlocks.end(); BBI != BBE; ++BBI) {
219 BasicBlock *ExitBB = *BBI;
H A DSimplifyCFG.cpp96 for (BasicBlock::iterator BBI = (*I)->begin();
97 isa<PHINode>(BBI); ++BBI) {
98 PHINode *PN = cast<PHINode>(BBI);
825 for (BasicBlock::iterator BBI = SI->begin();
826 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
921 for (BasicBlock::iterator BBI = SI->begin();
922 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
1708 BasicBlock::iterator BBI = BB->begin(); local
2292 BasicBlock::iterator BBI = UI; local
[all...]
/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp37 BasicBlock::iterator BBI = BB0->begin(); variable
38 Instruction *Y1 = &*BBI++;
39 Instruction *Y2 = &*BBI++;
40 Instruction *Y3 = &*BBI++;
43 BBI = BB1->begin();
44 Instruction *Y4 = &*BBI++;
47 BBI = BB2->begin();
48 Instruction *Y5 = &*BBI++;
51 BBI = BB3->begin();
52 Instruction *Y6 = &*BBI
[all...]
/external/llvm/lib/Analysis/
H A DLazyValueInfo.cpp457 bool solveBlockValueBinaryOp(LVILatticeVal &BBLV, Instruction *BBI,
459 bool solveBlockValueCast(LVILatticeVal &BBLV, Instruction *BBI,
462 Instruction *BBI);
607 static LVILatticeVal getFromRangeMetadata(Instruction *BBI) { argument
608 switch (BBI->getOpcode()) {
613 if (MDNode *Ranges = BBI->getMetadata(LLVMContext::MD_range))
614 if (isa<IntegerType>(BBI->getType())) {
642 Instruction *BBI = dyn_cast<Instruction>(Val); local
643 if (!BBI || BBI
854 intersectAssumeBlockValueConstantRange(Value *Val, LVILatticeVal &BBLV, Instruction *BBI) argument
1004 solveBlockValueCast(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument
1079 solveBlockValueBinaryOp(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument
[all...]
H A DLoads.cpp249 BasicBlock::iterator BBI = ScanFrom->getIterator(),
256 while (BBI != E) {
257 --BBI;
261 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() &&
262 !isa<DbgInfoIntrinsic>(BBI))
267 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
270 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp820 BasicBlock::iterator BBI(LI);
824 FindAvailableLoadedValue(&LI, LI.getParent(), BBI,
1198 BasicBlock::iterator BBI(SI);
1199 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
1201 --BBI;
1204 if (isa<DbgInfoIntrinsic>(BBI) ||
1205 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) {
1210 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
1215 ++BBI;
[all...]

Completed in 982 milliseconds

1234