Home
last modified time | relevance | path

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

12345678910>>...24

/external/llvm/include/llvm/Analysis/
DBlockFrequencyImpl.h53 std::string getBlockName(BasicBlock *BB) const { in getBlockName() argument
54 return BB->getName().str(); in getBlockName()
62 if (const BasicBlock *BB = MBB->getBasicBlock()) in getBlockName() local
63 ss << " derived from LLVM BB " << BB->getName(); in getBlockName()
68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) { in setBlockFreq() argument
69 Freqs[BB] = Freq; in setBlockFreq()
70 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") = " << Freq << "\n"); in setBlockFreq()
82 void incBlockFreq(BlockT *BB, BlockFrequency Freq) { in incBlockFreq() argument
83 Freqs[BB] += Freq; in incBlockFreq()
84 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") += " << Freq in incBlockFreq()
[all …]
DLoopIterator.h85 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); } in hasPreorder() argument
88 bool hasPostorder(BasicBlock *BB) const { in hasPostorder() argument
89 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB); in hasPostorder()
94 unsigned getPostorder(BasicBlock *BB) const { in getPostorder() argument
95 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB); in getPostorder()
102 unsigned getRPO(BasicBlock *BB) const { in getRPO() argument
103 return 1 + PostBlocks.size() - getPostorder(BB); in getRPO()
144 bool visitPreorder(BasicBlock *BB) { in visitPreorder() argument
145 if (!DFS.L->contains(LI->getLoopFor(BB))) in visitPreorder()
148 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second; in visitPreorder()
[all …]
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp116 bool ProcessBlock(BasicBlock *BB);
117 bool ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs,
119 bool DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
122 bool ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB,
125 bool ProcessThreadableEdges(Value *Cond, BasicBlock *BB,
160 BasicBlock *BB = I; in runOnFunction() local
162 while (ProcessBlock(BB)) in runOnFunction()
169 if (pred_begin(BB) == pred_end(BB) && in runOnFunction()
170 BB != &BB->getParent()->getEntryBlock()) { in runOnFunction()
171 DEBUG(dbgs() << " JT: Deleting dead block '" << BB->getName() in runOnFunction()
[all …]
DSimplifyCFGPass.cpp65 BasicBlock *BB = I->getParent(); in ChangeToUnreachable() local
68 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) in ChangeToUnreachable()
69 (*SI)->removePredecessor(BB); in ChangeToUnreachable()
75 Intrinsic::getDeclaration(BB->getParent()->getParent(), Intrinsic::trap); in ChangeToUnreachable()
82 BasicBlock::iterator BBI = I, BBE = BB->end(); in ChangeToUnreachable()
86 BB->getInstList().erase(BBI++); in ChangeToUnreachable()
92 BasicBlock *BB = II->getParent(); in ChangeToCall() local
105 II->getUnwindDest()->removePredecessor(BB); in ChangeToCall()
106 BB->getInstList().erase(II); in ChangeToCall()
109 static bool MarkAliveBlocks(BasicBlock *BB, in MarkAliveBlocks() argument
[all …]
DTailRecursionElimination.cpp97 bool FoldReturnAndProcessPred(BasicBlock *BB,
132 static bool CheckForEscapingAllocas(BasicBlock *BB, in CheckForEscapingAllocas() argument
135 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) in CheckForEscapingAllocas()
142 if (BB != &BB->getParent()->getEntryBlock() || in CheckForEscapingAllocas()
168 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in runOnFunction() local
173 CheckForEscapingAllocas(BB, CannotTCETailMarkedCall); in runOnFunction()
184 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in runOnFunction() local
185 if (ReturnInst *Ret = dyn_cast<ReturnInst>(BB->getTerminator())) { in runOnFunction()
188 if (!Change && BB->getFirstNonPHIOrDbg() == Ret) in runOnFunction()
189 Change = FoldReturnAndProcessPred(BB, Ret, OldEntry, in runOnFunction()
[all …]
DCodeGenPrepare.cpp112 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const;
113 void EliminateMostlyEmptyBlock(BasicBlock *BB);
114 bool OptimizeBlock(BasicBlock &BB);
158 BasicBlock *BB = I++; in runOnFunction() local
159 MadeChange |= OptimizeBlock(*BB); in runOnFunction()
169 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { in runOnFunction() local
170 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); in runOnFunction()
171 MadeChange |= ConstantFoldTerminator(BB, true); in runOnFunction()
205 BasicBlock *BB = I++; in EliminateMostlyEmptyBlocks() local
208 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in EliminateMostlyEmptyBlocks()
[all …]
/external/llvm/lib/Analysis/
DProfileInfo.cpp60 ProfileInfoT<Function,BasicBlock>::getExecutionCount(const BasicBlock *BB) { in getExecutionCount() argument
62 BlockInformation.find(BB->getParent()); in getExecutionCount()
64 BlockCounts::iterator I = J->second.find(BB); in getExecutionCount()
71 const_pred_iterator PI = pred_begin(BB), PE = pred_end(BB); in getExecutionCount()
75 Edge e = getEdge(0, BB); in getExecutionCount()
85 double w = getEdgeWeight(getEdge(P, BB)); in getExecutionCount()
98 succ_const_iterator SI = succ_begin(BB), SE = succ_end(BB); in getExecutionCount()
102 Edge e = getEdge(BB,0); in getExecutionCount()
109 double w = getEdgeWeight(getEdge(BB, *SI)); in getExecutionCount()
119 if (Count != MissingValue) BlockInformation[BB->getParent()][BB] = Count; in getExecutionCount()
[all …]
DProfileEstimatorPass.cpp69 virtual void recurseBasicBlock(BasicBlock *BB);
119 void ProfileEstimatorPass::recurseBasicBlock(BasicBlock *BB) { in recurseBasicBlock() argument
122 if (BBToVisit.find(BB) == BBToVisit.end()) return; in recurseBasicBlock()
125 bool BBisHeader = LI->isLoopHeader(BB); in recurseBasicBlock()
126 Loop* BBLoop = LI->getLoopFor(BB); in recurseBasicBlock()
131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in recurseBasicBlock()
134 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock()
153 if (getExecutionCount(BB) != MissingValue) { in recurseBasicBlock()
154 BBWeight = getExecutionCount(BB); in recurseBasicBlock()
206 EdgeInformation[BB->getParent()][edge] = BBWeight; in recurseBasicBlock()
[all …]
DProfileVerifierPass.cpp38 const BType *BB; member
57 void printDebugInfo(const BType *BB);
92 void ProfileVerifierPassT<FType, BType>::printDebugInfo(const BType *BB) { in printDebugInfo() argument
94 if (BBisPrinted.find(BB) != BBisPrinted.end()) return; in printDebugInfo()
96 double BBWeight = PI->getExecutionCount(BB); in printDebugInfo()
101 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in printDebugInfo()
104 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB); in printDebugInfo()
116 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in printDebugInfo()
119 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi); in printDebugInfo()
128 dbgs() << "Block " << BB->getName() << " in " in printDebugInfo()
[all …]
DBranchProbabilityInfo.cpp88 static uint32_t getMaxWeightFor(BasicBlock *BB) { in getMaxWeightFor() argument
89 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); in getMaxWeightFor()
97 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { in calcUnreachableHeuristics() argument
98 TerminatorInst *TI = BB->getTerminator(); in calcUnreachableHeuristics()
101 PostDominatedByUnreachable.insert(BB); in calcUnreachableHeuristics()
108 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcUnreachableHeuristics()
118 PostDominatedByUnreachable.insert(BB); in calcUnreachableHeuristics()
130 setEdgeWeight(BB, *I, UnreachableWeight); in calcUnreachableHeuristics()
139 setEdgeWeight(BB, *I, ReachableWeight); in calcUnreachableHeuristics()
146 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { in calcMetadataWeights() argument
[all …]
DRegionInfo.cpp74 void Region::replaceEntry(BasicBlock *BB) { in replaceEntry() argument
75 entry.setPointer(BB); in replaceEntry()
78 void Region::replaceExit(BasicBlock *BB) { in replaceExit() argument
80 exit = BB; in replaceExit()
84 BasicBlock *BB = const_cast<BasicBlock*>(B); in contains() local
86 assert(DT->getNode(BB) && "BB not part of the dominance tree"); in contains()
94 return (DT->dominates(entry, BB) in contains()
95 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit))); in contains()
130 Loop *Region::outermostLoopInRegion(LoopInfo *LI, BasicBlock* BB) const { in outermostLoopInRegion()
131 assert(LI && BB && "LI and BB cannot be null!"); in outermostLoopInRegion()
[all …]
DProfileInfoLoaderPass.cpp63 virtual void recurseBasicBlock(const BasicBlock *BB);
110 void LoaderPass::recurseBasicBlock(const BasicBlock *BB) { in recurseBasicBlock() argument
113 if (BBisUnvisited.find(BB) == BBisUnvisited.end()) return; in recurseBasicBlock()
114 BBisUnvisited.erase(BB); in recurseBasicBlock()
115 if (!BB) return; in recurseBasicBlock()
117 for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock()
121 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); in recurseBasicBlock()
127 if (CalculateMissingEdge(BB, tocalc)) { in recurseBasicBlock()
165 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { in runOnModule() local
166 TerminatorInst *TI = BB->getTerminator(); in runOnModule()
[all …]
/external/llvm/lib/CodeGen/
DMachineSSAUpdater.cpp62 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { in HasValueForBlock()
63 return getAvailableVals(AV).count(BB); in HasValueForBlock()
68 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { in AddAvailableValue() argument
69 getAvailableVals(AV)[BB] = V; in AddAvailableValue()
74 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { in GetValueAtEndOfBlock() argument
75 return GetValueAtEndOfBlockInternal(BB); in GetValueAtEndOfBlock()
79 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, in LookForIdenticalPHI() argument
81 if (BB->empty()) in LookForIdenticalPHI()
84 MachineBasicBlock::iterator I = BB->begin(); in LookForIdenticalPHI()
91 while (I != BB->end() && I->isPHI()) { in LookForIdenticalPHI()
[all …]
DIfConversion.cpp116 MachineBasicBlock *BB; member
125 ExtraCost(0), ExtraCost2(0), BB(0), TrueBB(0), FalseBB(0) {} in BBInfo()
184 BBInfo &AnalyzeBlock(MachineBasicBlock *BB,
189 void InvalidatePreds(MachineBasicBlock *BB);
206 bool MeetIfcvtSizeLimit(MachineBasicBlock &BB, in MeetIfcvtSizeLimit() argument
209 return Cycle > 0 && TII->isProfitableToIfCvt(BB, Cycle, Extra, in MeetIfcvtSizeLimit()
245 return C1->BBI.BB->getNumber() < C2->BBI.BB->getNumber(); in IfcvtTokenCmp()
324 << "): BB#" << BBI.BB->getNumber() << " (" in INITIALIZE_PASS_DEPENDENCY()
351 DEBUG(dbgs() << "): BB#" << BBI.BB->getNumber() << " (T:" in INITIALIZE_PASS_DEPENDENCY()
369 DEBUG(dbgs() << "Ifcvt (Diamond): BB#" << BBI.BB->getNumber() << " (T:" in INITIALIZE_PASS_DEPENDENCY()
[all …]
DUnreachableBlockElim.cpp78 BasicBlock *BB = I; in runOnFunction() local
79 DeadBlocks.push_back(BB); in runOnFunction()
80 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) { in runOnFunction()
82 BB->getInstList().pop_front(); in runOnFunction()
84 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) in runOnFunction()
85 (*SI)->removePredecessor(BB); in runOnFunction()
86 BB->dropAllReferences(); in runOnFunction()
141 MachineBasicBlock *BB = I; in runOnMachineFunction() local
144 if (!Reachable.count(BB)) { in runOnMachineFunction()
145 DeadBlocks.push_back(BB); in runOnMachineFunction()
[all …]
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp35 void llvm::DeleteDeadBlock(BasicBlock *BB) { in DeleteDeadBlock() argument
36 assert((pred_begin(BB) == pred_end(BB) || in DeleteDeadBlock()
38 BB->getSinglePredecessor() == BB) && "Block is not dead!"); in DeleteDeadBlock()
39 TerminatorInst *BBTerm = BB->getTerminator(); in DeleteDeadBlock()
44 BBTerm->getSuccessor(i)->removePredecessor(BB); in DeleteDeadBlock()
47 while (!BB->empty()) { in DeleteDeadBlock()
48 Instruction &I = BB->back(); in DeleteDeadBlock()
56 BB->getInstList().pop_back(); in DeleteDeadBlock()
60 BB->eraseFromParent(); in DeleteDeadBlock()
67 void llvm::FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P) { in FoldSingleEntryPHINodes() argument
[all …]
DSimplifyCFG.cpp80 bool run(BasicBlock *BB);
134 static Value *GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, in GetIfCondition() argument
136 PHINode *SomePHI = cast<PHINode>(BB->begin()); in GetIfCondition()
172 if (Pred1Br->getSuccessor(0) == BB && in GetIfCondition()
177 Pred1Br->getSuccessor(1) == BB) { in GetIfCondition()
264 static bool DominatesMergePoint(Value *V, BasicBlock *BB, in DominatesMergePoint() argument
280 if (PBB == BB) return false; in DominatesMergePoint()
286 if (BI == 0 || BI->isConditional() || BI->getSuccessor(0) != BB) in DominatesMergePoint()
312 if (!DominatesMergePoint(*i, BB, AggressiveInsts, CostRemaining)) in DominatesMergePoint()
500 static void EliminateBlockCases(BasicBlock *BB, in EliminateBlockCases() argument
[all …]
DSSAUpdater.cpp58 bool SSAUpdater::HasValueForBlock(BasicBlock *BB) const { in HasValueForBlock()
59 return getAvailableVals(AV).count(BB); in HasValueForBlock()
64 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) { in AddAvailableValue() argument
68 getAvailableVals(AV)[BB] = V; in AddAvailableValue()
91 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) { in GetValueAtEndOfBlock() argument
92 Value *Res = GetValueAtEndOfBlockInternal(BB); in GetValueAtEndOfBlock()
115 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) { in GetValueInMiddleOfBlock() argument
118 if (!HasValueForBlock(BB)) in GetValueInMiddleOfBlock()
119 return GetValueAtEndOfBlock(BB); in GetValueInMiddleOfBlock()
129 if (PHINode *SomePhi = dyn_cast<PHINode>(BB->begin())) { in GetValueInMiddleOfBlock()
[all …]
DLoopUnroll.cpp63 static BasicBlock *FoldBlockIntoPredecessor(BasicBlock *BB, LoopInfo* LI, in FoldBlockIntoPredecessor() argument
68 BasicBlock *OnlyPred = BB->getSinglePredecessor(); in FoldBlockIntoPredecessor()
74 DEBUG(dbgs() << "Merging: " << *BB << "into: " << *OnlyPred); in FoldBlockIntoPredecessor()
81 FoldSingleEntryPHINodes(BB); in FoldBlockIntoPredecessor()
88 BB->replaceAllUsesWith(OnlyPred); in FoldBlockIntoPredecessor()
91 OnlyPred->getInstList().splice(OnlyPred->end(), BB->getInstList()); in FoldBlockIntoPredecessor()
93 std::string OldName = BB->getName(); in FoldBlockIntoPredecessor()
99 if (Loop *L = LI->getLoopFor(BB)) in FoldBlockIntoPredecessor()
102 LI->removeBlock(BB); in FoldBlockIntoPredecessor()
103 BB->eraseFromParent(); in FoldBlockIntoPredecessor()
[all …]
DLocal.cpp55 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions) { in ConstantFoldTerminator() argument
56 TerminatorInst *T = BB->getTerminator(); in ConstantFoldTerminator()
77 OldDest->removePredecessor(BB); in ConstantFoldTerminator()
148 BasicBlock *BB = SI->getParent(); in ConstantFoldTerminator() local
157 Succ->removePredecessor(BB); in ConstantFoldTerminator()
209 BB->getTerminator()->eraseFromParent(); in ConstantFoldTerminator()
210 new UnreachableInst(BB->getContext(), BB); in ConstantFoldTerminator()
356 bool llvm::SimplifyInstructionsInBlock(BasicBlock *BB, const TargetData *TD) { in SimplifyInstructionsInBlock() argument
364 AssertingVH<Instruction> TerminatorVH(--BB->end()); in SimplifyInstructionsInBlock()
367 for (BasicBlock::iterator BI = BB->begin(), E = --BB->end(); BI != E; ) { in SimplifyInstructionsInBlock()
[all …]
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp47 void DeleteBasicBlock(BasicBlock *BB);
103 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { in runOnSCC() local
104 if (CheckUnwind && isa<ResumeInst>(BB->getTerminator())) { in runOnSCC()
107 } else if (CheckReturn && isa<ReturnInst>(BB->getTerminator())) { in runOnSCC()
114 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) in runOnSCC()
173 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { in SimplifyFunction() local
174 if (InvokeInst *II = dyn_cast<InvokeInst>(BB->getTerminator())) in SimplifyFunction()
197 BB->getInstList().pop_back(); in SimplifyFunction()
207 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) in SimplifyFunction()
214 BasicBlock *New = BB->splitBasicBlock(I); in SimplifyFunction()
[all …]
/external/llvm/include/llvm/Support/
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/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/llvm/tools/llvm-stress/
Dllvm-stress.cpp122 BB(Block),PT(PT),Ran(R),Context(BB->getContext()) {} in Modifier()
269 BasicBlock *BB; member
279 LoadModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in LoadModifier()
283 Value *V = new LoadInst(Ptr, "L", BB->getTerminator()); in Act()
289 StoreModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in StoreModifier()
302 new StoreInst(Val, Ptr, BB->getTerminator()); in Act()
307 BinModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in BinModifier()
324 Instruction* Term = BB->getTerminator(); in Act()
351 ConstModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} in ConstModifier()
399 AllocaModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R){} in AllocaModifier()
[all …]
/external/llvm/include/llvm/CodeGen/
DMachineInstrBuilder.h208 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() argument
213 MachineInstr *MI = BB.getParent()->CreateMachineInstr(MCID, DL); in BuildMI()
214 BB.insert(I, MI); in BuildMI()
218 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() argument
223 MachineInstr *MI = BB.getParent()->CreateMachineInstr(MCID, DL); in BuildMI()
224 BB.insert(I, MI); in BuildMI()
228 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() argument
235 return BuildMI(BB, MII, DL, MCID, DestReg); in BuildMI()
239 return BuildMI(BB, MII, DL, MCID, DestReg); in BuildMI()
246 inline MachineInstrBuilder BuildMI(MachineBasicBlock &BB, in BuildMI() argument
[all …]

12345678910>>...24