HomeSort by: relevance | last modified time | path
    Searched defs:BBI (Results 1 - 25 of 26) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMBasicBlockInfo.cpp 49 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()];
50 BBI.Size = 0;
51 BBI.Unalign = 0;
52 BBI.PostAlign = Align(1);
55 BBI.Size += TII->getInstSizeInBytes(I);
59 BBI.Unalign = isThumb ? 1 : 2;
62 BBI.Unalign = 1;
67 BBI.PostAlign = Align(4);
ARMConstantIslandPass.cpp 330 const BasicBlockInfo &BBI = BBInfo[J];
331 dbgs() << format("%08x %bb.%u\t", BBI.Offset, J)
332 << " kb=" << unsigned(BBI.KnownBits)
333 << " ua=" << unsigned(BBI.Unalign) << " pa=" << Log2(BBI.PostAlign)
1018 const BasicBlockInfo &BBI = BBInfo[U.MI->getParent()->getNumber()];
1019 unsigned KnownBits = BBI.internalKnownBits();
1113 const BasicBlockInfo &BBI = BBInfo[Block];
1118 << format("%#x-%x\t", BBI.Offset, BBI.postOffset()) << *M
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopPass.cpp 52 auto BBI = llvm::find_if(L->blocks(), [](BasicBlock *BB) { return BB; });
53 if (BBI != L->blocks().end() &&
54 isFunctionInPrintList((*BBI)->getParent()->getName())) {
LazyValueInfo.cpp 419 Optional<ValueLatticeElement> solveBlockValueBinaryOp(BinaryOperator *BBI,
432 Instruction *BBI);
554 static ValueLatticeElement getFromRangeMetadata(Instruction *BBI) {
555 switch (BBI->getOpcode()) {
560 if (MDNode *Ranges = BBI->getMetadata(LLVMContext::MD_range))
561 if (isa<IntegerType>(BBI->getType())) {
589 Instruction *BBI = dyn_cast<Instruction>(Val);
590 if (!BBI || BBI->getParent() != BB)
593 if (PHINode *PN = dyn_cast<PHINode>(BBI))
    [all...]
Loads.cpp 357 BasicBlock::iterator BBI = ScanFrom->getIterator(),
364 while (BBI != E) {
365 --BBI;
369 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() &&
370 !isa<DbgInfoIntrinsic>(BBI))
376 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
385 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
Lint.cpp 650 BasicBlock::iterator BBI = L->getIterator();
657 FindAvailableLoadedValue(L, BB, BBI, DefMaxInstsToScan, AA))
659 if (BBI != BB->begin())
664 BBI = BB->end();
MemorySSAUpdater.cpp 1411 auto BBI = I->getIterator(), BBE = BB->end();
1414 while (BBI != BBE)
1415 removeMemoryAccess(&*(BBI++));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
BranchRelaxation.cpp 140 const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()];
141 dbgs() << format("%%bb.%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset)
142 << format("size=%#x\n", BBI.Size);
LiveVariables.cpp 705 for (const auto &BBI : MBB) {
706 if (!BBI.isPHI())
708 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2)
709 if (BBI.getOperand(i).readsReg())
710 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()]
711 .push_back(BBI.getOperand(i).getReg());
764 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end();
765 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
    [all...]
BranchFolding.cpp 730 MachineBasicBlock::iterator BBI =
742 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI, BB);
IfConversion.cpp 164 /// BBI - Corresponding BBInfo.
175 BBInfo &BBI;
185 : BBI(b), Kind(k), NumDups(d), NumDups2(d2), NeedSubsumption(s),
230 bool reverseBranchCondition(BBInfo &BBI) const;
248 void AnalyzeBranches(BBInfo &BBI);
249 void ScanInstructions(BBInfo &BBI,
259 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred,
265 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
266 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
267 bool IfConvertDiamondCommon(BBInfo &BBI, BBInfo &TrueBBI, BBInfo &FalseBBI
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCPreEmitPeephole.cpp 107 // loops - The outer loop finds the load immediates BBI that could be used
109 // after BBI to find redundancy and update kill/dead flags accordingly. If
110 // AfterBBI is the same as BBI, it is redundant, otherwise any instructions
111 // that modify the def register of BBI would break the scanning.
113 // kill/dead flag set. It keeps track of the def register of BBI, the use
121 for (auto BBI = MBB.instr_begin(); BBI != MBB.instr_end(); ++BBI) {
124 if (InstrsToErase.contains(&*BBI))
127 unsigned Opc = BBI->getOpcode()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SpeculateAroundPHIs.cpp 815 auto BBI = BB->begin();
816 while (auto *PN = dyn_cast<PHINode>(&*BBI)) {
818 ++BBI;
GVNHoist.cpp 437 BasicBlock *BBI = I->getParent();
438 if (!hasEH(BBI))
439 VNBlocks.insert(BBI);
560 unsigned BBI = 0;
562 DFSNumber[BB] = ++BBI;
Scalarizer.cpp 88 // insert them before BBI in BB. If Cache is nonnull, use it to cache
90 Scatterer(BasicBlock *bb, BasicBlock::iterator bbi, Value *v,
101 BasicBlock::iterator BBI;
258 Scatterer::Scatterer(BasicBlock *bb, BasicBlock::iterator bbi, Value *v,
260 : BB(bb), BBI(bbi), V(v), CachePtr(cachePtr) {
280 IRBuilder<> Builder(BB, BBI);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopSimplify.cpp 90 Function::iterator BBI = --NewBB->getIterator();
92 if (&*BBI == SplitPreds[i])
104 Function::iterator BBI = SplitPreds[i]->getIterator();
105 if (++BBI != NewBB->getParent()->end() && L->contains(&*BBI)) {
PromoteMemoryToRegister.cpp 208 for (const Instruction &BBI : *BB)
209 if (isInterestingInstruction(&BBI))
210 InstNumbers[&BBI] = InstNo++;
767 BasicBlock::iterator BBI = BB->begin();
768 while ((SomePHI = dyn_cast<PHINode>(BBI++)) &&
LoopUtils.cpp 1319 BasicBlock::iterator BBI = ExitBB->begin();
1320 while ((PN = dyn_cast<PHINode>(BBI++))) {
SimplifyCFG.cpp 311 for (BasicBlock::iterator BBI = Succ->begin(); isa<PHINode>(BBI); ++BBI) {
312 PHINode *PN = cast<PHINode>(BBI);
2387 for (BasicBlock::iterator BBI = ThenBB->begin(),
2389 BBI != BBE; ++BBI) {
2390 Instruction *I = &*BBI;
2638 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsConstantIslandPass.cpp 427 const BasicBlockInfo &BBI = BBInfo[J];
428 dbgs() << format("%08x %bb.%u\t", BBI.Offset, J)
785 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()];
786 BBI.Size = 0;
789 BBI.Size += TII->getInstSizeInBytes(MI);
977 const BasicBlockInfo &BBI = BBInfo[Block];
982 << format("%#x-%x\t", BBI.Offset, BBI.postOffset()) << *MI
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 592 BasicBlock::iterator BBI = L->getIterator(), E = L->getParent()->end();
594 for (++BBI; BBI != E; ++BBI)
595 if (BBI->mayWriteToMemory()) {
598 if (auto *CB = dyn_cast<CallBase>(BBI))
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPULibCalls.cpp 1281 BasicBlock::iterator BBI = LI->getIterator();
1282 Value *AvailableVal = FindAvailableLoadedValue(LI, CBB, BBI, MaxScan, AA);
1307 BasicBlock::iterator BBI = CI->getIterator();
1308 if (BBI == CI->getParent()->begin())
1310 --BBI;
1311 for (int I = MaxScan; I > 0 && BBI != CBB->begin(); --BBI, --I) {
1312 if (cast<Instruction>(BBI) == XI) {
SIWholeQuadMode.cpp 498 BlockInfo &BBI = Blocks[&MBB];
555 BBI.Needs |= StateExact;
556 if (!(BBI.InNeeds & StateExact)) {
557 BBI.InNeeds |= StateExact;
570 BBI.NeedsLowering = true;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 1304 const DenseMap<const BasicBlock *, BBState>::iterator BBI =
1306 assert(BBI != BBStates.end());
1307 const BottomUpPtrState &SuccS = BBI->second.getPtrBottomUpState(Arg);
  /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Reader/
BitcodeReader.cpp 2913 Function::iterator BBI = Fn->begin(), BBE = Fn->end();
2915 if (BBI == BBE)
2917 ++BBI;
2919 BB = &*BBI;

Completed in 58 milliseconds

1 2