Home
last modified time | relevance | path

Searched refs:BI (Results 1 – 25 of 298) sorted by relevance

12345678910>>...12

/openbsd/src/gnu/llvm/llvm/lib/CodeGen/
DInterferenceCache.cpp156 BlockInterference *BI = &Blocks[MBBNum]; in update() local
160 BI->Tag = Tag; in update()
161 BI->First = BI->Last = SlotIndex(); in update()
171 if (!BI->First.isValid() || StartI < BI->First) in update()
172 BI->First = StartI; in update()
184 if (!BI->First.isValid() || StartI < BI->First) in update()
185 BI->First = StartI; in update()
191 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
196 BI->First = RegMaskSlots[i]; in update()
201 if (BI->First.isValid()) in update()
[all …]
DSplitKit.cpp214 BlockInfo BI; in calcLiveBlockInfo() local
215 BI.MBB = &*MFI; in calcLiveBlockInfo()
217 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB); in calcLiveBlockInfo()
224 ThroughBlocks.set(BI.MBB->getNumber()); in calcLiveBlockInfo()
230 BI.FirstInstr = *UseI; in calcLiveBlockInfo()
231 assert(BI.FirstInstr >= Start); in calcLiveBlockInfo()
234 BI.LastInstr = UseI[-1]; in calcLiveBlockInfo()
235 assert(BI.LastInstr < Stop); in calcLiveBlockInfo()
238 BI.LiveIn = LVI->start <= Start; in calcLiveBlockInfo()
241 if (!BI.LiveIn) { in calcLiveBlockInfo()
[all …]
DInterleavedAccessPass.cpp313 if (auto *BI = dyn_cast<BinaryOperator>(User)) { in lowerInterleavedLoad() local
314 if (all_of(BI->users(), in lowerInterleavedLoad()
316 for (auto *SVI : BI->users()) in lowerInterleavedLoad()
399 BinaryOperator *BI = cast<BinaryOperator>(SVI->getOperand(0)); in replaceBinOpShuffles() local
400 Type *BIOp0Ty = BI->getOperand(0)->getType(); in replaceBinOpShuffles()
407 new ShuffleVectorInst(BI->getOperand(0), PoisonValue::get(BIOp0Ty), in replaceBinOpShuffles()
410 BI->getOperand(1), PoisonValue::get(BI->getOperand(1)->getType()), Mask, in replaceBinOpShuffles()
413 BI->getOpcode(), NewSVI1, NewSVI2, BI, BI->getName(), SVI); in replaceBinOpShuffles()
415 LLVM_DEBUG(dbgs() << " Replaced: " << *BI << "\n And : " << *SVI in replaceBinOpShuffles()
/openbsd/src/gnu/llvm/llvm/include/llvm/IR/
DInstIterator.h39 BI_t BI; // BasicBlock::iterator variable
54 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
58 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
63 BI = BB->begin(); in InstIterator()
74 inline BIty &getInstructionIterator() { return BI; } in getInstructionIterator()
76 inline reference operator*() const { return *BI; }
80 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
87 ++BI;
96 while (BB == BBs->end() || BI == BB->begin()) {
98 BI = BB->end();
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/AVR/
DAVRShiftExpand.cpp35 void expand(BinaryOperator *BI);
75 void AVRShiftExpand::expand(BinaryOperator *BI) { in expand() argument
76 auto &Ctx = BI->getContext(); in expand()
77 IRBuilder<> Builder(BI); in expand()
84 BasicBlock *BB = BI->getParent(); in expand()
86 BasicBlock *EndBB = BB->splitBasicBlock(BI, "shift.done"); in expand()
92 Value *ShiftAmount = Builder.CreateTrunc(BI->getOperand(1), Int8Ty); in expand()
105 ValuePHI->addIncoming(BI->getOperand(0), BB); in expand()
117 switch (BI->getOpcode()) { in expand()
139 Builder.SetInsertPoint(BI); in expand()
[all …]
/openbsd/src/gnu/llvm/clang/include/clang/Basic/
DTargetBuiltins.h29 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
30 #define TARGET_BUILTIN(ID, TYPE, ATTRS, FEATURE) BI##ID,
41 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
50 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
63 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
73 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
83 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
93 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
103 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
113 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
[all …]
/openbsd/src/gnu/usr.bin/binutils-2.17/opcodes/
Dcgen-ops.h46 #define NOTBI(x) (! (BI) (x))
48 #define EQBI(x, y) ((BI) (x) == (BI) (y))
49 #define NEBI(x, y) ((BI) (x) != (BI) (y))
50 #define LTBI(x, y) ((BI) (x) < (BI) (y))
51 #define LEBI(x, y) ((BI) (x) <= (BI) (y))
52 #define GTBI(x, y) ((BI) (x) > (BI) (y))
53 #define GEBI(x, y) ((BI) (x) >= (BI) (y))
54 #define LTUBI(x, y) ((BI) (x) < (BI) (y))
55 #define LEUBI(x, y) ((BI) (x) <= (BI) (y))
56 #define GTUBI(x, y) ((BI) (x) > (BI) (y))
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/
DLowerExpectIntrinsic.cpp204 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in handlePhiDef() local
205 if (BI && BI->isConditional()) in handlePhiDef()
206 return BI; in handlePhiDef()
210 BI = dyn_cast<BranchInst>(BB->getTerminator()); in handlePhiDef()
211 if (!BI || BI->isUnconditional()) in handlePhiDef()
213 return BI; in handlePhiDef()
235 BranchInst *BI = GetDomConditional(i); in handlePhiDef() local
236 if (!BI) in handlePhiDef()
255 if (OpndIncomingBB == BI->getParent() && Succ == PhiDef->getParent()) in handlePhiDef()
268 if (IsOpndComingFromSuccessor(BI->getSuccessor(1))) in handlePhiDef()
[all …]
DLowerConstantIntrinsics.cpp67 BranchInst *BI = dyn_cast_or_null<BranchInst>(VH); in replaceConditionalBranchesOnConstant() local
68 if (!BI) in replaceConditionalBranchesOnConstant()
70 if (BI->isUnconditional()) in replaceConditionalBranchesOnConstant()
74 if (match(BI->getOperand(0), m_Zero())) { in replaceConditionalBranchesOnConstant()
75 Target = BI->getSuccessor(1); in replaceConditionalBranchesOnConstant()
76 Other = BI->getSuccessor(0); in replaceConditionalBranchesOnConstant()
77 } else if (match(BI->getOperand(0), m_One())) { in replaceConditionalBranchesOnConstant()
78 Target = BI->getSuccessor(0); in replaceConditionalBranchesOnConstant()
79 Other = BI->getSuccessor(1); in replaceConditionalBranchesOnConstant()
85 BasicBlock *Source = BI->getParent(); in replaceConditionalBranchesOnConstant()
[all …]
DLoopBoundSplit.cpp31 BranchInst *BI = nullptr; member
160 const BranchInst *BI) { in isProcessableCondBI() argument
165 if (!match(BI, m_Br(m_ICmp(Pred, m_Value(LHS), m_Value(RHS)), in isProcessableCondBI()
219 Cond.BI = ExitingBI; in canSplitLoopBound()
223 static bool isProfitableToTransform(const Loop &L, const BranchInst *BI) { in isProfitableToTransform() argument
230 BasicBlock *Succ0 = BI->getSuccessor(0); in isProfitableToTransform()
231 BasicBlock *Succ1 = BI->getSuccessor(1); in isProfitableToTransform()
251 auto *BI = dyn_cast<BranchInst>(BB->getTerminator()); in findSplitCandidate() local
252 if (!BI) in findSplitCandidate()
256 if (!isProcessableCondBI(SE, BI)) in findSplitCandidate()
[all …]
DIndVarSimplify.cpp469 if (auto *BI = dyn_cast<BranchInst>(TermInst)) { in rewriteFirstIterationLoopExitValues() local
472 Cond = BI->getCondition(); in rewriteFirstIterationLoopExitValues()
703 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); in isLoopExitTestBasedOn() local
704 ICmpInst *ICmp = dyn_cast<ICmpInst>(BI->getCondition()); in isLoopExitTestBasedOn()
722 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); in needsLFTR() local
723 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR()
727 ICmpInst *Cond = dyn_cast<ICmpInst>(BI->getCondition()); in needsLFTR()
1008 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); in genLoopLimit() local
1009 return Rewriter.expandCodeFor(IVLimit, IndVar->getType(), BI); in genLoopLimit()
1051 BranchInst *BI = cast<BranchInst>(ExitingBB->getTerminator()); in genLoopLimit() local
[all …]
DSimpleLoopUnswitch.cpp466 static bool unswitchTrivialBranch(Loop &L, BranchInst &BI, DominatorTree &DT, in unswitchTrivialBranch() argument
469 assert(BI.isConditional() && "Can only unswitch a conditional branch!"); in unswitchTrivialBranch()
470 LLVM_DEBUG(dbgs() << " Trying to unswitch branch: " << BI << "\n"); in unswitchTrivialBranch()
479 Value *Cond = skipTrivialSelect(BI.getCondition()); in unswitchTrivialBranch()
495 auto *LoopExitBB = BI.getSuccessor(0); in unswitchTrivialBranch()
499 LoopExitBB = BI.getSuccessor(1); in unswitchTrivialBranch()
505 auto *ContinueBB = BI.getSuccessor(1 - LoopExitSuccIdx); in unswitchTrivialBranch()
506 auto *ParentBB = BI.getParent(); in unswitchTrivialBranch()
527 dbgs() << " unswitching trivial invariant conditions for: " << BI in unswitchTrivialBranch()
564 assert(LoopExitBB->getUniquePredecessor() == BI.getParent() && in unswitchTrivialBranch()
[all …]
/openbsd/src/gnu/llvm/llvm/examples/IRTransforms/
DSimplifyCFG.cpp143 BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator()); in eliminateCondBranches_v1() local
144 if (!BI || !BI->isConditional()) in eliminateCondBranches_v1()
148 ConstantInt *CI = dyn_cast<ConstantInt>(BI->getCondition()); in eliminateCondBranches_v1()
154 BasicBlock *RemovedSucc = BI->getSuccessor(CI->isOne()); in eliminateCondBranches_v1()
161 BranchInst::Create(BI->getSuccessor(CI->isZero()), BI); in eliminateCondBranches_v1()
162 BI->eraseFromParent(); in eliminateCondBranches_v1()
179 BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator()); in eliminateCondBranches_v2() local
180 if (!BI || !BI->isConditional()) in eliminateCondBranches_v2()
184 ConstantInt *CI = dyn_cast<ConstantInt>(BI->getCondition()); in eliminateCondBranches_v2()
190 BasicBlock *RemovedSucc = BI->getSuccessor(CI->isOne()); in eliminateCondBranches_v2()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Utils/
DFlattenCFG.cpp188 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); in FlattenParallelAndOr() local
189 BI != BE;) { in FlattenParallelAndOr()
190 Instruction *CI = &*BI++; in FlattenParallelAndOr()
252 auto *BI = cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr() local
253 auto *CI = dyn_cast<CmpInst>(BI->getCondition()); in FlattenParallelAndOr()
261 BI->swapSuccessors(); in FlattenParallelAndOr()
357 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in CompareIfRegionBlock() local
358 if (BI->mayReadFromMemory() || BI->mayWriteToMemory()) { in CompareIfRegionBlock()
360 if (!AA || !AA->isNoAlias(&*iter1, &*BI)) in CompareIfRegionBlock()
474 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) { in MergeIfRegion() local
[all …]
DSimplifyCFG.cpp268 bool simplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder);
269 bool simplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder);
274 bool HoistThenElseCodeToIf(BranchInst *BI, const TargetTransformInfo &TTI,
276 bool SpeculativelyExecuteBB(BranchInst *BI, BasicBlock *ThenBB,
281 bool SimplifyBranchOnICmpChain(BranchInst *BI, IRBuilder<> &Builder,
440 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); in dominatesMergePoint() local
441 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB) in dominatesMergePoint()
760 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in EraseTerminatorAndDCECond() local
761 if (BI->isConditional()) in EraseTerminatorAndDCECond()
762 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorAndDCECond()
[all …]
DLoopRotationUtils.cpp186 BranchInst *BI = dyn_cast<BranchInst>(Header->getTerminator()); in profitableToRotateLoopExitingLatch() local
187 assert(BI && BI->isConditional() && "need header with conditional exit"); in profitableToRotateLoopExitingLatch()
188 BasicBlock *HeaderExit = BI->getSuccessor(0); in profitableToRotateLoopExitingLatch()
190 HeaderExit = BI->getSuccessor(1); in profitableToRotateLoopExitingLatch()
212 BranchInst *BI = dyn_cast<BranchInst>(Latch->getTerminator()); in canRotateDeoptimizingLatchExit() local
214 if (!BI || !BI->isConditional()) in canRotateDeoptimizingLatchExit()
217 BasicBlock *Exit = BI->getSuccessor(1); in canRotateDeoptimizingLatchExit()
219 Exit = BI->getSuccessor(0); in canRotateDeoptimizingLatchExit()
270 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); in rotateLoop() local
271 if (!BI || BI->isUnconditional()) in rotateLoop()
[all …]
/openbsd/src/gnu/usr.bin/gcc/gcc/config/ia64/
Dia64.md247 [(set (match_operand:BI 0 "nonimmediate_operand" "=c,c,?c,?*r, c,*r,*r,*m,*r")
248 (match_operand:BI 1 "move_operand" " O,n, c, c,*r, n,*m,*r,*r"))]
263 [(set (match_operand:BI 0 "register_operand" "")
264 (match_operand:BI 1 "register_operand" ""))]
275 [(set (match_operand:BI 0 "register_operand" "")
276 (match_operand:BI 1 "register_operand" ""))]
282 (set (match_dup 0) (unspec:BI [(match_dup 0)] UNSPEC_PRED_REL_MUTEX))]
1373 [(set (match_operand:BI 0 "register_operand" "=c,c,r")
1374 (and:BI (match_operand:BI 1 "register_operand" "%0,0,r")
1375 (match_operand:BI 2 "register_operand" "c,r,r")))]
[all …]
/openbsd/src/gnu/llvm/llvm/utils/TableGen/
DCodeEmitterGen.cpp48 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
52 bool addCodeToMergeInOperand(Record *R, BitsInit *BI,
67 BitsInit *BI, int bit) { in getVariableBit() argument
68 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) { in getVariableBit()
72 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) { in getVariableBit()
81 bool CodeEmitterGen::addCodeToMergeInOperand(Record *R, BitsInit *BI, in addCodeToMergeInOperand() argument
90 int bit = BI->getNumBits()-1; in addCodeToMergeInOperand()
94 if (getVariableBit(VarName, BI, bit) != -1) in addCodeToMergeInOperand()
203 int varBit = getVariableBit(VarName, BI, tmpBit); in addCodeToMergeInOperand()
216 varBit = getVariableBit(VarName, BI, tmpBit); in addCodeToMergeInOperand()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/PowerPC/
DPPCCTRLoopsVerify.cpp99 MachineBasicBlock::iterator BI = I; in verifyCTRBranch() local
123 if (I != BI && clobbersCTR(*I)) { in verifyCTRBranch()
127 << printMBBReference(*BI->getParent()) << " (" in verifyCTRBranch()
128 << BI->getParent()->getFullName() << ") instruction " in verifyCTRBranch()
129 << *BI << "\n"); in verifyCTRBranch()
144 << printMBBReference(*BI->getParent()) << " (" in verifyCTRBranch()
145 << BI->getParent()->getFullName() << ") instruction " in verifyCTRBranch()
146 << *BI << "\n"); in verifyCTRBranch()
/openbsd/src/gnu/gcc/gcc/config/ia64/
Dia64.md222 [(set (match_operand:BI 0 "destination_operand" "=c,c,?c,?*r, c,*r,*r,*m,*r")
223 (match_operand:BI 1 "move_operand" " O,n, c, c,*r, n,*m,*r,*r"))]
238 [(set (match_operand:BI 0 "register_operand" "")
239 (match_operand:BI 1 "register_operand" ""))]
250 [(set (match_operand:BI 0 "register_operand" "")
251 (match_operand:BI 1 "register_operand" ""))]
257 (set (match_dup 0) (unspec:BI [(match_dup 0)] UNSPEC_PRED_REL_MUTEX))]
388 (define_mode_macro MODE [BI QI HI SI DI SF DF XF TI])
392 (BI "ld1.a %0 = %1%P1")
412 (BI "ld1.s %0 = %1%P1")
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Analysis/
DGuardUtils.cpp63 auto *BI = dyn_cast<BranchInst>(U); in parseWidenableBranch() local
64 if (!BI || !BI->isConditional()) in parseWidenableBranch()
66 auto *Cond = BI->getCondition(); in parseWidenableBranch()
70 IfTrueBB = BI->getSuccessor(0); in parseWidenableBranch()
71 IfFalseBB = BI->getSuccessor(1); in parseWidenableBranch()
74 WC = &BI->getOperandUse(0); in parseWidenableBranch()
/openbsd/src/gnu/llvm/llvm/docs/HistoricalNotes/
D2002-06-25-MegaPatchInfo.txt34 for (Function::iterator BI = Func->begin(); BI != Func->end(); ++BI)
35 for (BasicBlock::iterator II = (*BI)->begin(); II != (*BI)->end(); ++II)
40 for (Function::iterator BI = Func->begin(); BI != Func->end(); ++BI)
41 for (BasicBlock::iterator II = BI->begin(); II != BI->end(); ++II)
/openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/
DR600Packetizer.cpp69 MachineBasicBlock::instr_iterator BI = I.getInstrIterator(); in getPreviousVector() local
71 BI++; in getPreviousVector()
75 int BISlot = getSlot(*BI); in getPreviousVector()
79 if (TII->isPredicated(*BI)) in getPreviousVector()
81 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::write); in getPreviousVector()
82 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0) in getPreviousVector()
84 int DstIdx = TII->getOperandIdx(BI->getOpcode(), R600::OpName::dst); in getPreviousVector()
88 Register Dst = BI->getOperand(DstIdx).getReg(); in getPreviousVector()
89 if (isTrans || TII->isTransOnly(*BI)) { in getPreviousVector()
93 if (BI->getOpcode() == R600::DOT4_r600 || in getPreviousVector()
[all …]
/openbsd/src/regress/usr.bin/mandoc/man/BI/
Demptyargs.out_ascii1 BI-EMPTYARGS(1) General Commands Manual BI-EMPTYARGS(1)
4 BI-emptyargs - empty arguments to font alternation macros
14 OpenBSD April 6, 2015 BI-EMPTYARGS(1)
/openbsd/src/gnu/llvm/llvm/lib/Target/NVPTX/
DNVPTXImageOptimizer.cpp151 if (BranchInst *BI = dyn_cast<BranchInst>(U)) { in replaceWith() local
152 if (BI->isUnconditional()) continue; in replaceWith()
156 Dest = BI->getSuccessor(1); in replaceWith()
159 Dest = BI->getSuccessor(0); in replaceWith()
160 BranchInst::Create(Dest, BI); in replaceWith()
161 InstrToDelete.push_back(BI); in replaceWith()

12345678910>>...12