Home
last modified time | relevance | path

Searched defs:BI (Results 1 – 25 of 125) sorted by relevance

12345

/freebsd-10-stable/contrib/llvm/utils/TableGen/
DCodeEmitterGen.cpp64 BitsInit *BI = R->getValueAsBitsInit("Inst"); in reverseBits() local
93 BitsInit *BI, int bit) { in getVariableBit()
107 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, in AddCodeToMergeInOperand()
214 BitsInit *BI = R->getValueAsBitsInit("Inst"); in getInstructionCase() local
270 BitsInit *BI = R->getValueAsBitsInit("Inst"); in run() local
/freebsd-10-stable/contrib/llvm/lib/Transforms/Utils/
DLowerExpectIntrinsic.cpp92 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) { in HandleIfExpect()
140 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) { in runOnFunction() local
149 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); in runOnFunction() local
DFlattenCFG.cpp178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) { in FlattenParallelAndOr() local
240 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr() local
356 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) { in CompareIfRegionBlock() local
425 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) { in MergeIfRegion() local
DBasicBlockUtils.cpp141 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE; ++BI) { in MergeBlockIntoPredecessor() local
198 BasicBlock::iterator &BI, Value *V) { in ReplaceInstWithValue()
217 BasicBlock::iterator &BI, Instruction *I) { in ReplaceInstWithInst()
235 BasicBlock::iterator BI(From); in ReplaceInstWithInst() local
380 ArrayRef<BasicBlock*> Preds, BranchInst *BI, in UpdatePHINodes()
450 BranchInst *BI = BranchInst::Create(BB, NewBB); in SplitBlockPredecessors() local
759 BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator()); in GetIfCondition() local
DSimplifyCFG.cpp273 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); in DominatesMergePoint() local
451 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in EraseTerminatorInstAndDCECond() local
472 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) in isValueEqualityComparison() local
503 BranchInst *BI = cast<BranchInst>(TI); in GetValueEqualityComparisonCases() local
743 if (BranchInst* BI = dyn_cast<BranchInst>(TI)) { in GetBranchWeights() local
1002 static bool HoistThenElseCodeToIf(BranchInst *BI) { in HoistThenElseCodeToIf()
1395 static bool SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB) { in SpeculativelyExecuteBB()
1581 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); in BlockIsSimpleEnoughToThreadThrough() local
1608 static bool FoldCondBranchOnPHI(BranchInst *BI, const DataLayout *TD) { in FoldCondBranchOnPHI()
1843 static bool SimplifyCondBranchToTwoReturns(BranchInst *BI, in SimplifyCondBranchToTwoReturns()
[all …]
DCloneFunction.cpp116 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end(); in CloneFunctionInto() local
303 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) { in CloneBlock() local
399 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end(); in CloneAndPruneFunctionInto() local
538 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); in CloneAndPruneFunctionInto() local
DSimplifyInstructions.cpp57 for (BasicBlock::iterator BI = DI->begin(), BE = DI->end(); BI != BE;) { in runOnFunction() local
/freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/
DLoopDeletion.cpp90 BasicBlock::iterator BI = exitBlock->begin(); in isLoopDead() local
116 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end(); in isLoopDead() local
193 BasicBlock::iterator BI = exitBlock->begin(); in runOnLoop() local
DLoopRotation.cpp229 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator()); in simplifyLoopLatch() local
278 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); in rotateLoop() local
403 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin(); in rotateLoop() local
DJumpThreading.cpp182 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in runOnFunction() local
677 if (BranchInst *BI = dyn_cast<BranchInst>(Terminator)) { in ProcessBlock() local
1120 else if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) in ProcessThreadableEdges() local
1395 BasicBlock::iterator BI = BB->begin(); in ThreadEdge() local
1540 BasicBlock::iterator BI = BB->begin(); in DuplicateCondBranchOnPHIIntoPred() local
1697 for (BasicBlock::iterator BI = BB->begin(); in TryToUnfoldSelect() local
DIndVarSimplify.cpp1143 static bool isHighCostExpansion(const SCEV *S, BranchInst *BI, in isHighCostExpansion()
1212 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator()); in canExpandBackedgeTakenCount() local
1269 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator()); in getLoopTest() local
1495 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); in genLoopLimit() local
1538 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); in genLoopLimit() local
1587 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); in LinearFunctionTestReplace() local
DSCCP.cpp518 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { in getFeasibleSuccessors() local
589 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in isEdgeFeasible() local
1451 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in ResolvedUndefsIn() local
1592 for (BasicBlock::iterator BI = BB->begin(), E = BB->end(); BI != E; ) { in runOnFunction() local
1801 for (BasicBlock::iterator BI = BB->begin(), E = BB->end(); BI != E; ) { in runOnModule() local
1853 if (BranchInst *BI = dyn_cast<BranchInst>(I)) { in runOnModule() local
DCodeGenPrepare.cpp275 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in EliminateMostlyEmptyBlocks() local
380 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); in EliminateMostlyEmptyBlock() local
735 BasicBlock::iterator BI = BB->begin(); in DupRetToEnableTailCallOpts() local
743 BasicBlock::iterator BI = BB->begin(); in DupRetToEnableTailCallOpts() local
796 BranchInst *BI = dyn_cast<BranchInst>(CallBB->getTerminator()); in DupRetToEnableTailCallOpts() local
1980 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) { in PlaceDbgValues() local
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/
DLoopInfoImpl.h35 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitingBlocks() local
64 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitBlocks() local
89 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitEdges() local
232 BI = df_ext_begin(getHeader(), VisitSet), in verifyLoop() local
290 for (block_iterator BI = (*I)->block_begin(), BE = (*I)->block_end(); in verifyLoop() local
/freebsd-10-stable/contrib/llvm/lib/Target/NVPTX/
DNVPTXAllocaHoisting.cpp27 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) { in runOnFunction() local
DNVPTXSplitBBatBar.cpp34 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) { in runOnFunction() local
/freebsd-10-stable/contrib/llvm/lib/Analysis/
DLoopInfo.cpp180 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) { in isLCSSAForm() local
226 for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end(); BI != BE; ++BI) { in isSafeToClone() local
360 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) { in getUniqueExitBlocks() local
509 for (Loop::block_iterator BI = Unloop->block_begin(), in removeBlocksFromAncestors() local
DBranchProbabilityInfo.cpp274 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); in calcPointerHeuristics() local
361 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); in calcZeroHeuristics() local
435 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in calcFloatingPointHeuristics() local
524 for (Function::const_iterator BI = LastF->begin(), BE = LastF->end(); in print() local
DLoads.cpp44 if (const Instruction *BI = dyn_cast<Instruction>(B)) in AreEquivalentAddressValues() local
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
DRegAllocGreedy.cpp765 const SplitAnalysis::BlockInfo &BI = UseBlocks[i]; in addSplitConstraints() local
964 const SplitAnalysis::BlockInfo &BI = UseBlocks[i]; in calcSpillCost() local
985 const SplitAnalysis::BlockInfo &BI = UseBlocks[i]; in calcGlobalSplitCost() local
1049 const SplitAnalysis::BlockInfo &BI = UseBlocks[i]; in splitAroundRegion() local
1316 const SplitAnalysis::BlockInfo &BI = UseBlocks[i]; in tryBlockSplit() local
1418 const SplitAnalysis::BlockInfo &BI = SA->getUseBlocks().front(); in calcGapWeights() local
1496 const SplitAnalysis::BlockInfo &BI = SA->getUseBlocks().front(); in tryLocalSplit() local
DSplitKit.cpp188 BlockInfo BI; in calcLiveBlockInfo() local
1137 bool SplitAnalysis::shouldSplitSingleBlock(const BlockInfo &BI, in shouldSplitSingleBlock()
1155 void SplitEditor::splitSingleBlock(const SplitAnalysis::BlockInfo &BI) { in splitSingleBlock()
1286 void SplitEditor::splitRegInBlock(const SplitAnalysis::BlockInfo &BI, in splitRegInBlock()
1378 void SplitEditor::splitRegOutBlock(const SplitAnalysis::BlockInfo &BI, in splitRegOutBlock()
DStackColoring.cpp210 LivenessMap::const_iterator BI = BlockLiveness.find(*FI); in dump() local
256 for (MachineBasicBlock::iterator BI = (*FI)->begin(), BE = (*FI)->end(); in collectMarkers() local
321 LivenessMap::iterator BI = BlockLiveness.find(BB); in calculateLocalLiveness() local
DMachineBlockPlacement.cpp138 for (BlockChain::iterator BI = Chain->begin(), BE = Chain->end(); in merge() local
814 for (MachineLoop::block_iterator BI = L.block_begin(), in buildLoopChains() local
972 for (BlockChain::iterator BI = FunctionChain.begin(), in buildCFGChains() local
1058 for (BlockChain::iterator BI = llvm::next(FunctionChain.begin()), in buildCFGChains() local
/freebsd-10-stable/contrib/llvm/lib/Target/SystemZ/
DSystemZLongBranch.cpp336 for (SmallVectorImpl<MBBInfo>::iterator BI = MBBs.begin(), BE = MBBs.end(); in setWorstCaseAddresses() local
438 for (SmallVectorImpl<MBBInfo>::iterator BI = MBBs.begin(), BE = MBBs.end(); in relaxBranches() local
/freebsd-10-stable/contrib/llvm/include/llvm/TableGen/
DRecord.h106 virtual Init *convertValue( BitInit *BI) { return 0; } in convertValue()
107 virtual Init *convertValue( BitsInit *BI) { return 0; } in convertValue()
154 virtual Init *convertValue( BitInit *BI) { return (Init*)BI; } in convertValue()
267 virtual Init *convertValue( BitInit *BI) { return 0; } in convertValue()
268 virtual Init *convertValue( BitsInit *BI) { return 0; } in convertValue()
306 virtual Init *convertValue( BitInit *BI) { return 0; } in convertValue()
307 virtual Init *convertValue( BitsInit *BI) { return 0; } in convertValue()
343 virtual Init *convertValue( BitInit *BI) { return 0; } in convertValue()
344 virtual Init *convertValue( BitsInit *BI) { return 0; } in convertValue()
383 virtual Init *convertValue( BitInit *BI) { return 0; } in convertValue()
[all …]

12345