Home
last modified time | relevance | path

Searched refs:BB (Results 1 – 25 of 1110) sorted by relevance

12345678910>>...45

/external/llvm/lib/Target/Mips/
DMips16ISelLowering.cpp166 MachineBasicBlock *BB) const { in EmitInstrWithCustomInserter()
169 return MipsTargetLowering::EmitInstrWithCustomInserter(MI, BB); in EmitInstrWithCustomInserter()
171 return emitSel16(Mips::BeqzRxImm16, MI, BB); in EmitInstrWithCustomInserter()
173 return emitSel16(Mips::BnezRxImm16, MI, BB); in EmitInstrWithCustomInserter()
175 return emitSeliT16(Mips::Bteqz16, Mips::CmpiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
177 return emitSeliT16(Mips::Bteqz16, Mips::SltiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
179 return emitSeliT16(Mips::Bteqz16, Mips::SltiuRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
181 return emitSeliT16(Mips::Btnez16, Mips::CmpiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
183 return emitSeliT16(Mips::Btnez16, Mips::SltiRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
185 return emitSeliT16(Mips::Btnez16, Mips::SltiuRxImmX16, MI, BB); in EmitInstrWithCustomInserter()
[all …]
/external/llvm/lib/Analysis/
DCFG.cpp29 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges() local
30 if (succ_begin(BB) == succ_end(BB)) in FindFunctionBackedges()
37 Visited.insert(BB); in FindFunctionBackedges()
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
39 InStack.insert(BB); in FindFunctionBackedges()
47 BB = *I++; in FindFunctionBackedges()
48 if (Visited.insert(BB)) { in FindFunctionBackedges()
53 if (InStack.count(BB)) in FindFunctionBackedges()
54 Result.push_back(std::make_pair(ParentBB, BB)); in FindFunctionBackedges()
59 InStack.insert(BB); in FindFunctionBackedges()
[all …]
DBranchProbabilityInfo.cpp117 static uint32_t getMaxWeightFor(BasicBlock *BB) { in getMaxWeightFor() argument
118 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); in getMaxWeightFor()
126 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { in calcUnreachableHeuristics() argument
127 TerminatorInst *TI = BB->getTerminator(); in calcUnreachableHeuristics()
130 PostDominatedByUnreachable.insert(BB); in calcUnreachableHeuristics()
137 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcUnreachableHeuristics()
147 PostDominatedByUnreachable.insert(BB); in calcUnreachableHeuristics()
159 setEdgeWeight(BB, *I, UnreachableWeight); in calcUnreachableHeuristics()
169 setEdgeWeight(BB, *I, ReachableWeight); in calcUnreachableHeuristics()
176 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { in calcMetadataWeights() argument
[all …]
DRegionInfo.cpp69 void Region::replaceEntry(BasicBlock *BB) { in replaceEntry() argument
70 entry.setPointer(BB); in replaceEntry()
73 void Region::replaceExit(BasicBlock *BB) { in replaceExit() argument
75 exit = BB; in replaceExit()
111 BasicBlock *BB = const_cast<BasicBlock*>(B); in contains() local
113 if (!DT->getNode(BB)) in contains()
122 return (DT->dominates(entry, BB) in contains()
123 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit))); in contains()
158 Loop *Region::outermostLoopInRegion(LoopInfo *LI, BasicBlock* BB) const { in outermostLoopInRegion()
159 assert(LI && BB && "LI and BB cannot be null!"); in outermostLoopInRegion()
[all …]
/external/llvm/lib/CodeGen/
DMachineSSAUpdater.cpp64 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { in HasValueForBlock()
65 return getAvailableVals(AV).count(BB); in HasValueForBlock()
70 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { in AddAvailableValue() argument
71 getAvailableVals(AV)[BB] = V; in AddAvailableValue()
76 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { in GetValueAtEndOfBlock() argument
77 return GetValueAtEndOfBlockInternal(BB); in GetValueAtEndOfBlock()
81 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, in LookForIdenticalPHI() argument
83 if (BB->empty()) in LookForIdenticalPHI()
86 MachineBasicBlock::iterator I = BB->begin(); in LookForIdenticalPHI()
93 while (I != BB->end() && I->isPHI()) { in LookForIdenticalPHI()
[all …]
DIfConversion.cpp122 MachineBasicBlock *BB; member
131 ExtraCost(0), ExtraCost2(0), BB(nullptr), TrueBB(nullptr), in BBInfo()
196 BBInfo &AnalyzeBlock(MachineBasicBlock *BB,
201 void InvalidatePreds(MachineBasicBlock *BB);
216 bool MeetIfcvtSizeLimit(MachineBasicBlock &BB, in MeetIfcvtSizeLimit() argument
219 return Cycle > 0 && TII->isProfitableToIfCvt(BB, Cycle, Extra, in MeetIfcvtSizeLimit()
255 return C1->BBI.BB->getNumber() < C2->BBI.BB->getNumber(); in IfcvtTokenCmp()
344 << "): BB#" << BBI.BB->getNumber() << " (" in INITIALIZE_PASS_DEPENDENCY()
371 DEBUG(dbgs() << "): BB#" << BBI.BB->getNumber() << " (T:" in INITIALIZE_PASS_DEPENDENCY()
389 DEBUG(dbgs() << "Ifcvt (Diamond): BB#" << BBI.BB->getNumber() << " (T:" in INITIALIZE_PASS_DEPENDENCY()
[all …]
DUnreachableBlockElim.cpp76 BasicBlock *BB = I; in runOnFunction() local
77 DeadBlocks.push_back(BB); in runOnFunction()
78 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) { in runOnFunction()
80 BB->getInstList().pop_front(); in runOnFunction()
82 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) in runOnFunction()
83 (*SI)->removePredecessor(BB); in runOnFunction()
84 BB->dropAllReferences(); in runOnFunction()
137 MachineBasicBlock *BB = I; in runOnMachineFunction() local
140 if (!Reachable.count(BB)) { in runOnMachineFunction()
141 DeadBlocks.push_back(BB); in runOnMachineFunction()
[all …]
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp118 bool ProcessBlock(BasicBlock *BB);
119 bool ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs,
121 bool DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
124 bool ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB,
127 bool ProcessThreadableEdges(Value *Cond, BasicBlock *BB,
134 bool TryToUnfoldSelect(CmpInst *CondCmp, BasicBlock *BB);
176 BasicBlock *BB = I; in runOnFunction() local
178 while (ProcessBlock(BB)) in runOnFunction()
185 if (pred_begin(BB) == pred_end(BB) && in runOnFunction()
186 BB != &BB->getParent()->getEntryBlock()) { in runOnFunction()
[all …]
DTailRecursionElimination.cpp110 bool FoldReturnAndProcessPred(BasicBlock *BB,
144 for (auto &BB : F) { in CanTRE() local
145 for (auto &I : BB) { in CanTRE()
260 for (auto &BB : F) { in markTails() local
261 for (auto &I : BB) in markTails()
292 BasicBlock *BB = &F.getEntryBlock(); in markTails() local
295 for (auto &I : *BB) { in markTails()
338 for (auto *SuccBB : make_range(succ_begin(BB), succ_end(BB))) { in markTails()
350 BB = WorklistEscaped.pop_back_val(); in markTails()
353 BB = nullptr; in markTails()
[all …]
/external/llvm/include/llvm/IR/
DInstIterator.h37 _BB_i_t BB; // BasicBlocksType::iterator variable
52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
59 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor in InstIterator()
60 if (BB != BBs->end()) { in InstIterator()
61 BI = BB->begin(); in InstIterator()
67 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor in InstIterator()
71 inline BBIty &getBasicBlockIterator() { return BB; } in getBasicBlockIterator()
78 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
94 while (BB == BBs->end() || BI == BB->begin()) {
[all …]
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp48 void DeleteBasicBlock(BasicBlock *BB);
104 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { in runOnSCC() local
105 if (CheckUnwind && isa<ResumeInst>(BB->getTerminator())) { in runOnSCC()
108 } else if (CheckReturn && isa<ReturnInst>(BB->getTerminator())) { in runOnSCC()
115 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) in runOnSCC()
176 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { in SimplifyFunction() local
177 if (InvokeInst *II = dyn_cast<InvokeInst>(BB->getTerminator())) in SimplifyFunction()
200 BB->getInstList().pop_back(); in SimplifyFunction()
210 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) in SimplifyFunction()
217 BasicBlock *New = BB->splitBasicBlock(I); in SimplifyFunction()
[all …]
/external/llvm/lib/Transforms/Utils/
DLocal.cpp61 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions, in ConstantFoldTerminator() argument
63 TerminatorInst *T = BB->getTerminator(); in ConstantFoldTerminator()
84 OldDest->removePredecessor(BB); in ConstantFoldTerminator()
151 MDBuilder(BB->getContext()). in ConstantFoldTerminator()
178 BasicBlock *BB = SI->getParent(); in ConstantFoldTerminator() local
187 Succ->removePredecessor(BB); in ConstantFoldTerminator()
216 MDBuilder(BB->getContext()). in ConstantFoldTerminator()
251 BB->getTerminator()->eraseFromParent(); in ConstantFoldTerminator()
252 new UnreachableInst(BB->getContext(), BB); in ConstantFoldTerminator()
402 bool llvm::SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD, in SimplifyInstructionsInBlock() argument
[all …]
DSSAUpdater.cpp53 bool SSAUpdater::HasValueForBlock(BasicBlock *BB) const { in HasValueForBlock()
54 return getAvailableVals(AV).count(BB); in HasValueForBlock()
57 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) { in AddAvailableValue() argument
61 getAvailableVals(AV)[BB] = V; in AddAvailableValue()
80 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) { in GetValueAtEndOfBlock() argument
81 Value *Res = GetValueAtEndOfBlockInternal(BB); in GetValueAtEndOfBlock()
85 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) { in GetValueInMiddleOfBlock() argument
88 if (!HasValueForBlock(BB)) in GetValueInMiddleOfBlock()
89 return GetValueAtEndOfBlock(BB); in GetValueInMiddleOfBlock()
99 if (PHINode *SomePhi = dyn_cast<PHINode>(BB->begin())) { in GetValueInMiddleOfBlock()
[all …]
DBasicBlockUtils.cpp36 void llvm::DeleteDeadBlock(BasicBlock *BB) { in DeleteDeadBlock() argument
37 assert((pred_begin(BB) == pred_end(BB) || in DeleteDeadBlock()
39 BB->getSinglePredecessor() == BB) && "Block is not dead!"); in DeleteDeadBlock()
40 TerminatorInst *BBTerm = BB->getTerminator(); in DeleteDeadBlock()
45 BBTerm->getSuccessor(i)->removePredecessor(BB); in DeleteDeadBlock()
48 while (!BB->empty()) { in DeleteDeadBlock()
49 Instruction &I = BB->back(); in DeleteDeadBlock()
57 BB->getInstList().pop_back(); in DeleteDeadBlock()
61 BB->eraseFromParent(); in DeleteDeadBlock()
68 void llvm::FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P) { in FoldSingleEntryPHINodes() argument
[all …]
DLoopUnroll.cpp69 static BasicBlock *FoldBlockIntoPredecessor(BasicBlock *BB, LoopInfo* LI, in FoldBlockIntoPredecessor() argument
74 BasicBlock *OnlyPred = BB->getSinglePredecessor(); in FoldBlockIntoPredecessor()
80 DEBUG(dbgs() << "Merging: " << *BB << "into: " << *OnlyPred); in FoldBlockIntoPredecessor()
87 FoldSingleEntryPHINodes(BB); in FoldBlockIntoPredecessor()
94 BB->replaceAllUsesWith(OnlyPred); in FoldBlockIntoPredecessor()
97 OnlyPred->getInstList().splice(OnlyPred->end(), BB->getInstList()); in FoldBlockIntoPredecessor()
100 StringRef OldName = BB->getName(); in FoldBlockIntoPredecessor()
107 if (Loop *L = LI->getLoopFor(BB)) in FoldBlockIntoPredecessor()
111 LI->removeBlock(BB); in FoldBlockIntoPredecessor()
117 BB->eraseFromParent(); in FoldBlockIntoPredecessor()
[all …]
/external/llvm/include/llvm/Analysis/
DLoopIterator.h84 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); } in hasPreorder() argument
87 bool hasPostorder(BasicBlock *BB) const { in hasPostorder() argument
88 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB); in hasPostorder()
93 unsigned getPostorder(BasicBlock *BB) const { in getPostorder() argument
94 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB); in getPostorder()
101 unsigned getRPO(BasicBlock *BB) const { in getRPO() argument
102 return 1 + PostBlocks.size() - getPostorder(BB); in getRPO()
118 void finishPostorder(BasicBlock *BB);
153 bool visitPreorder(BasicBlock *BB) { in visitPreorder() argument
154 if (!DFS.L->contains(LI->getLoopFor(BB))) in visitPreorder()
[all …]
DLoopInfo.h115 bool contains(const BlockT *BB) const { in contains() argument
116 return DenseBlockSet.count(BB); in contains()
154 bool isLoopExiting(const BlockT *BB) const { in isLoopExiting() argument
157 BlockTraits::child_begin(BB), in isLoopExiting()
158 SE = BlockTraits::child_end(BB); SI != SE; ++SI) { in isLoopExiting()
288 void addBlockEntry(BlockT *BB) { in addBlockEntry() argument
289 Blocks.push_back(BB); in addBlockEntry()
290 DenseBlockSet.insert(BB); in addBlockEntry()
306 void moveToHeader(BlockT *BB) { in moveToHeader() argument
307 if (Blocks[0] == BB) return; in moveToHeader()
[all …]
/external/llvm/test/Transforms/SimplifyCFG/
D2008-05-16-PHIBlockMerge.ll2 ; RUN: not grep "^BB.tomerge" %t
3 ; RUN: grep "^BB.nomerge" %t | count 2
13 br label %BB.nomerge
15 BB.nomerge: ; preds = %Common, %entry
21 Succ: ; preds = %Common, %BB.nomerge
22 %b = phi i32 [ %a, %BB.nomerge ], [ 2, %Common ] ; <i32> [#uses=0]
28 br i1 %cond, label %BB.nomerge, label %Succ
37 br label %BB.nomerge
39 BB.nomerge: ; preds = %Common, %entry
42 Succ: ; preds = %Common, %BB.nomerge
[all …]
/external/mesa3d/src/gallium/drivers/radeon/
DSIISelLowering.cpp66 MachineInstr * MI, MachineBasicBlock * BB) const in EmitInstrWithCustomInserter()
69 MachineRegisterInfo & MRI = BB->getParent()->getRegInfo(); in EmitInstrWithCustomInserter()
73 AppendS_WAITCNT(MI, *BB, llvm::next(I)); in EmitInstrWithCustomInserter()
74 return BB; in EmitInstrWithCustomInserter()
79 return AMDGPUTargetLowering::EmitInstrWithCustomInserter(MI, BB); in EmitInstrWithCustomInserter()
82 BuildMI(*BB, I, BB->findDebugLoc(I), TII->get(AMDGPU::V_MOV_B32_e64)) in EmitInstrWithCustomInserter()
97 BuildMI(*BB, I, BB->findDebugLoc(I), TII->get(AMDGPU::V_MOV_B32_e64)) in EmitInstrWithCustomInserter()
112 BuildMI(*BB, I, BB->findDebugLoc(I), TII->get(AMDGPU::V_MOV_B32_e64)) in EmitInstrWithCustomInserter()
127 LowerSI_INTERP(MI, *BB, I, MRI); in EmitInstrWithCustomInserter()
130 LowerSI_INTERP_CONST(MI, *BB, I, MRI); in EmitInstrWithCustomInserter()
[all …]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
DSIISelLowering.cpp66 MachineInstr * MI, MachineBasicBlock * BB) const in EmitInstrWithCustomInserter()
69 MachineRegisterInfo & MRI = BB->getParent()->getRegInfo(); in EmitInstrWithCustomInserter()
73 AppendS_WAITCNT(MI, *BB, llvm::next(I)); in EmitInstrWithCustomInserter()
74 return BB; in EmitInstrWithCustomInserter()
79 return AMDGPUTargetLowering::EmitInstrWithCustomInserter(MI, BB); in EmitInstrWithCustomInserter()
82 BuildMI(*BB, I, BB->findDebugLoc(I), TII->get(AMDGPU::V_MOV_B32_e64)) in EmitInstrWithCustomInserter()
97 BuildMI(*BB, I, BB->findDebugLoc(I), TII->get(AMDGPU::V_MOV_B32_e64)) in EmitInstrWithCustomInserter()
112 BuildMI(*BB, I, BB->findDebugLoc(I), TII->get(AMDGPU::V_MOV_B32_e64)) in EmitInstrWithCustomInserter()
127 LowerSI_INTERP(MI, *BB, I, MRI); in EmitInstrWithCustomInserter()
130 LowerSI_INTERP_CONST(MI, *BB, I, MRI); in EmitInstrWithCustomInserter()
[all …]
/external/llvm/tools/llvm-stress/
Dllvm-stress.cpp130 BB(Block),PT(PT),Ran(R),Context(BB->getContext()) {} in Modifier()
281 BasicBlock *BB; member
291 LoadModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in LoadModifier()
295 Value *V = new LoadInst(Ptr, "L", BB->getTerminator()); in Act()
301 StoreModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in StoreModifier()
314 new StoreInst(Val, Ptr, BB->getTerminator()); in Act()
319 BinModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in BinModifier()
336 Instruction* Term = BB->getTerminator(); in Act()
363 ConstModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in ConstModifier()
409 AllocaModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R){} in AllocaModifier()
[all …]
/external/llvm/unittests/Transforms/Utils/
DIntegerDivision.cpp34 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
35 Builder.SetInsertPoint(BB); in TEST()
42 EXPECT_TRUE(BB->front().getOpcode() == Instruction::SDiv); in TEST()
47 EXPECT_TRUE(BB->front().getOpcode() == Instruction::AShr); in TEST()
64 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
65 Builder.SetInsertPoint(BB); in TEST()
72 EXPECT_TRUE(BB->front().getOpcode() == Instruction::UDiv); in TEST()
77 EXPECT_TRUE(BB->front().getOpcode() == Instruction::ICmp); in TEST()
94 BasicBlock *BB = BasicBlock::Create(C, "", F); in TEST() local
95 Builder.SetInsertPoint(BB); in TEST()
[all …]
/external/llvm/test/CodeGen/Generic/
DMachineBranchProb.ll17 ; CHECK: BB#0: derived from LLVM BB %entry
18 ; CHECK: Successors according to CFG: BB#2(64) BB#4(14)
19 ; CHECK: BB#4: derived from LLVM BB %entry
20 ; CHECK: Successors according to CFG: BB#1(10) BB#5(4)
21 ; CHECK: BB#5: derived from LLVM BB %entry
22 ; CHECK: Successors according to CFG: BB#1(4) BB#3(7)
/external/llvm/test/CodeGen/AArch64/
Dneon-bitcast.ll7 ; CHECK-NEXT: // BB#0:
16 ; CHECK-NEXT: // BB#0:
25 ; CHECK-NEXT: // BB#0:
34 ; CHECK-NEXT: // BB#0:
43 ; CHECK-NEXT: // BB#0:
54 ; CHECK-NEXT: // BB#0:
63 ; CHECK-NEXT: // BB#0:
72 ; CHECK-NEXT: // BB#0:
81 ; CHECK-NEXT: // BB#0:
90 ; CHECK-NEXT: // BB#0:
[all …]
/external/llvm/test/CodeGen/X86/
Dfast-isel-select-pseudo-cmov.ll10 ; CHECK-NEXT: jne [[BB:LBB[0-9]+_2]]
11 ; CHECK: [[BB]]
21 ; CHECK-NEXT: jne [[BB:LBB[0-9]+_2]]
22 ; CHECK: [[BB]]
32 ; CHECK-NEXT: je [[BB:LBB[0-9]+_2]]
33 ; CHECK: [[BB]]
43 ; CHECK-NEXT: jne [[BB:LBB[0-9]+_2]]
44 ; CHECK: [[BB]]
54 ; CHECK-NEXT: ja [[BB:LBB[0-9]+_2]]
55 ; CHECK: [[BB]]
[all …]

12345678910>>...45