/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 63 if (BranchInst *BI = dyn_cast<BranchInst>(T)) { 64 if (BI->isUnconditional()) return false; // Can't optimize uncond branch 65 BasicBlock *Dest1 = BI->getSuccessor(0); 66 BasicBlock *Dest2 = BI->getSuccessor(1); 68 if (ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition())) { 84 BI->eraseFromParent(); 94 assert(BI->getParent() && "Terminator not inserted in block!"); 95 Dest1->removePredecessor(BI->getParent()); 99 Value *Cond = BI->getCondition(); 100 BI [all...] |
H A D | LoopSimplify.cpp | 190 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator())) 191 if (BI->isConditional()) { 192 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) { 197 BI->setCondition(ConstantInt::get(Cond->getType(), 198 !L->contains(BI->getSuccessor(0)))); 303 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); local 304 if (!BI || !BI->isConditional()) continue; 305 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); 311 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) { [all...] |
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | ShrinkWrapping.cpp | 908 for (df_iterator<MachineBasicBlock*> BI = df_begin(SUCC), 909 BE = df_end(SUCC); BI != BE; ++BI) { 910 MachineBasicBlock* SBB = *BI; 945 for (CSRegBlockMap::iterator BI = CSRSave.begin(), 946 BE = CSRSave.end(); BI != BE; ++BI) { 947 MachineBasicBlock* MBB = BI->first; 948 CSRegSet spilled = BI->second; 966 for (df_iterator<MachineBasicBlock*> BI [all...] |
H A D | StackColoring.cpp | 209 LivenessMap::const_iterator BI = BlockLiveness.find(*FI); local 210 assert(BI != BlockLiveness.end() && "Block not found"); 211 const BlockLifetimeInfo &BlockInfo = BI->second; 255 for (MachineBasicBlock::iterator BI = (*FI)->begin(), BE = (*FI)->end(); 256 BI != BE; ++BI) { 258 if (BI->getOpcode() != TargetOpcode::LIFETIME_START && 259 BI->getOpcode() != TargetOpcode::LIFETIME_END) 262 Markers.push_back(BI); 264 bool IsStart = BI 320 LivenessMap::iterator BI = BlockLiveness.find(BB); local [all...] |
H A D | SplitKit.h | 188 /// live range for the instructions in BI. There is normally no benefit to 193 /// @param BI The block to be isolated. 195 bool shouldSplitSingleBlock(const BlockInfo &BI, bool SingleInstrs) const; 428 void splitSingleBlock(const SplitAnalysis::BlockInfo &BI); 448 /// @param BI Block descriptor. 451 void splitRegInBlock(const SplitAnalysis::BlockInfo &BI, 460 /// @param BI Block descriptor. 463 void splitRegOutBlock(const SplitAnalysis::BlockInfo &BI,
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | ThreadSanitizer.cpp | 342 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end(); 343 BI != BE; ++BI) { 344 if (isAtomic(BI)) 345 AtomicAccesses.push_back(BI); 346 else if (isa<LoadInst>(BI) || isa<StoreInst>(BI)) 347 LocalLoadsAndStores.push_back(BI); 348 else if (isa<ReturnInst>(BI)) 349 RetVec.push_back(BI); [all...] |
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 253 BinaryOperator *BI = dyn_cast_or_null<BinaryOperator>(Rdx); local 254 if (!BI) 257 Value *Inst = BI->getOperand(0); 258 if (Inst == P) Inst = BI->getOperand(1); 270 if (BinaryOperator *BI = dyn_cast<BinaryOperator>(CI->getOperand(i))) 271 Changed |= tryToVectorizePair(BI->getOperand(0), BI->getOperand(1), R);
|
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/ |
H A D | R600Packetizer.cpp | 84 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); 86 BI++; 88 if (TII->isPredicated(BI)) 90 if (TII->isTransOnly(BI)) 92 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), R600Operands::WRITE); 95 if (BI->getOperand(OperandIdx).getImm() == 0) 97 unsigned Dst = BI->getOperand(0).getReg(); 98 if (BI->getOpcode() == AMDGPU::DOT4_r600_real) { 120 } while ((++BI)->isBundledWithPred());
|
H A D | SIInsertWaits.cpp | 342 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); 343 BI != BE; ++BI) { 345 MachineBasicBlock &MBB = *BI;
|
H A D | R600ControlFlowFinalizer.cpp | 227 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); local 228 while (++BI != E && BI->isBundledWithPred()) { 229 BI->unbundleFromPred(); 230 for (unsigned i = 0, e = BI->getNumOperands(); i != e; ++i) { 231 MachineOperand &MO = BI->getOperand(i); 235 getLiteral(BI, Literals); 236 ClauseContent.push_back(BI); 238 I = BI;
|
/freebsd-10.0-release/contrib/llvm/lib/Target/NVPTX/ |
H A D | NVPTXLowerAggrCopies.cpp | 114 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) { 115 //BasicBlock *bb = BI; 116 for (BasicBlock::iterator II = BI->begin(), IE = BI->end(); II != IE;
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | LoopExtractor.cpp | 273 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) { 274 BasicBlock &BB = *BI; 277 TranslatedBlocksToNotExtract.insert(BI);
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopInstSimplify.cpp | 101 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) { 102 Instruction *I = BI++;
|
H A D | MemCpyOptimizer.cpp | 374 BasicBlock::iterator BI = StartInst; local 375 for (++BI; !isa<TerminatorInst>(BI); ++BI) { 376 if (!isa<StoreInst>(BI) && !isa<MemSetInst>(BI)) { 380 if (BI->mayWriteToMemory() || BI->mayReadFromMemory()) 385 if (StoreInst *NextStore = dyn_cast<StoreInst>(BI)) { 401 MemSetInst *MSI = cast<MemSetInst>(BI); [all...] |
H A D | JumpThreading.cpp | 180 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 185 if (BI && BI->isUnconditional() && 193 BasicBlock *Succ = BI->getSuccessor(0); 675 if (BranchInst *BI = dyn_cast<BranchInst>(Terminator)) { 677 if (BI->isUnconditional()) return false; 678 Condition = BI->getCondition(); 1109 else if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) 1110 DestBB = BI->getSuccessor(cast<ConstantInt>(Val)->isZero()); 1384 BasicBlock::iterator BI local 1529 BasicBlock::iterator BI = BB->begin(); local [all...] |
H A D | CodeGenPrepare.cpp | 277 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 278 if (!BI || !BI->isUnconditional()) 283 BasicBlock::iterator BBI = BI; 296 BasicBlock *DestBB = BI->getSuccessor(0); 382 BranchInst *BI = cast<BranchInst>(BB->getTerminator()); local 383 BasicBlock *DestBB = BI->getSuccessor(0); 741 BasicBlock::iterator BI = BB->begin(); local 742 do { ++BI; } while (isa<DbgInfoIntrinsic>(BI)); 749 BasicBlock::iterator BI = BB->begin(); local 802 BranchInst *BI = dyn_cast<BranchInst>(CallBB->getTerminator()); local [all...] |
H A D | TailRecursionElimination.cpp | 615 if (BranchInst *BI = dyn_cast<BranchInst>(PTI)) 616 if (BI->isUnconditional()) 617 UncondBranchPreds.push_back(BI); 621 BranchInst *BI = UncondBranchPreds.pop_back_val(); local 622 BasicBlock *Pred = BI->getParent(); 623 if (CallInst *CI = FindTRECandidate(BI, CannotTailCallElimCallsMarkedTail)){
|
/freebsd-10.0-release/contrib/binutils/opcodes/ |
H A D | ppc-opc.c | 99 /* The BI field in a B form or XL form instruction. */ 100 #define BI BA 190 /* The condition register number portion of the BI field in a B form 193 BI field. This field is optional. */ 622 in BO field, the "a" bit is 00010 for branch on CR(BI) and 01000 1304 the BI field. */ 1314 /* A BBOYCB_MASK in which the BI field is fixed. */ 1498 bits of the BI field. */ 1514 /* An XL_MASK with the BO, BI and BB fields fixed. */ 1587 /* The BI conditio 98 #define BI macro [all...] |
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | CFGPrinter.h | 86 if (const BranchInst *BI = dyn_cast<BranchInst>(Node->getTerminator())) 87 if (BI->isConditional())
|
H A D | ProfileInfo.h | 213 for (typename FType::const_iterator BI = F->begin(), BE = F->end(); 214 BI != BE; ++BI) { 215 const BType *BB = &(*BI);
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 55 // ReplaceInstWithValue - Replace all uses of an instruction (specified by BI) 59 BasicBlock::iterator &BI, Value *V); 61 // ReplaceInstWithInst - Replace the instruction specified by BI with the 62 // instruction specified by I. The original instruction is deleted and BI is 66 BasicBlock::iterator &BI, Instruction *I);
|
/freebsd-10.0-release/contrib/llvm/lib/Analysis/ |
H A D | LoopPass.cpp | 149 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE; 150 ++BI) { 151 Instruction &I = *BI;
|
H A D | SparsePropagation.cpp | 126 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { 127 if (BI->isUnconditional()) { 134 BCValue = getOrInitValueState(BI->getCondition()); 136 BCValue = getLatticeState(BI->getCondition()); 149 Constant *C = LatticeFunc->GetConstant(BCValue, BI->getCondition(), *this);
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 257 typename BlockDataMapTy::iterator BI = D.getBlockDataMap().find(B); local 258 if(BI == D.getBlockDataMap().end()) { 260 BI = D.getBlockDataMap().insert( std::make_pair(B,ValTy()) ).first; 266 Merge(V, BI->second); 269 BI->second.copyValues(V);
|
/freebsd-10.0-release/contrib/llvm/lib/IR/ |
H A D | Metadata.cpp | 467 int BI = 0; local 470 while (AI < AN && BI < BN) { 472 ConstantInt *BLow = cast<ConstantInt>(B->getOperand(2 * BI)); 478 addRange(EndPoints, BLow, cast<ConstantInt>(B->getOperand(2 * BI + 1))); 479 ++BI; 487 while (BI < BN) { 488 addRange(EndPoints, cast<ConstantInt>(B->getOperand(2 * BI)), 489 cast<ConstantInt>(B->getOperand(2 * BI + 1))); 490 ++BI;
|