| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | InterferenceCache.cpp | 161 BlockInterference *BI = &Blocks[MBBNum]; in update() local
165 BI->Tag = Tag; in update()
166 BI->First = BI->Last = SlotIndex(); in update()
176 if (!BI->First.isValid() || StartI < BI->First) in update()
177 BI->First = StartI; in update()
189 if (!BI->First.isValid() || StartI < BI->First) in update()
190 BI->First = StartI; in update()
196 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
201 BI->First = RegMaskSlots[i]; in update()
206 if (BI->First.isValid()) in update()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | InterferenceCache.cpp | 149 BlockInterference *BI = &Blocks[MBBNum]; in update() local
153 BI->Tag = Tag; in update()
154 BI->First = BI->Last = SlotIndex(); in update()
164 if (!BI->First.isValid() || StartI < BI->First) in update()
165 BI->First = StartI; in update()
177 if (!BI->First.isValid() || StartI < BI->First) in update()
178 BI->First = StartI; in update()
184 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
189 BI->First = RegMaskSlots[i]; in update()
194 if (BI->First.isValid()) in update()
[all …]
|
| D | SplitKit.cpp | 203 BlockInfo BI; in calcLiveBlockInfo() local
204 BI.MBB = &*MFI; in calcLiveBlockInfo()
206 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB); in calcLiveBlockInfo()
213 ThroughBlocks.set(BI.MBB->getNumber()); in calcLiveBlockInfo()
220 BI.FirstInstr = *UseI; in calcLiveBlockInfo()
221 assert(BI.FirstInstr >= Start); in calcLiveBlockInfo()
224 BI.LastInstr = UseI[-1]; in calcLiveBlockInfo()
225 assert(BI.LastInstr < Stop); in calcLiveBlockInfo()
228 BI.LiveIn = LVI->start <= Start; in calcLiveBlockInfo()
231 if (!BI.LiveIn) { in calcLiveBlockInfo()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| D | DebugInfoProbe.cpp | 72 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); in initialize() local
73 BI != BE; ++BI) { in initialize()
74 if (!isa<PHINode>(BI) && BI->getDebugLoc().isUnknown()) in initialize()
75 MissingDebugLoc.insert(BI); in initialize()
76 if (!isa<DbgInfoIntrinsic>(BI)) continue; in initialize()
79 if (DbgDeclareInst *DDI = dyn_cast<DbgDeclareInst>(BI)) { in initialize()
82 } else if (DbgValueInst *DVI = dyn_cast<DbgValueInst>(BI)) { in initialize()
118 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); in finalize() local
119 BI != BE; ++BI) { in finalize()
120 if (!isa<PHINode>(BI) && BI->getDebugLoc().isUnknown() && in finalize()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | InstIterator.h | 38 _BI_t BI; // BasicBlock::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()
61 BI = BB->begin(); in InstIterator()
72 inline BIty &getInstructionIterator() { return BI; } in getInstructionIterator()
74 inline reference operator*() const { return *BI; }
78 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
85 ++BI;
94 while (BB == BBs->end() || BI == BB->begin()) {
96 BI = BB->end();
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| D | LowerExpectIntrinsic.cpp | 165 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in handlePhiDef() local
166 if (BI && BI->isConditional()) in handlePhiDef()
167 return BI; in handlePhiDef()
171 BI = dyn_cast<BranchInst>(BB->getTerminator()); in handlePhiDef()
172 if (!BI || BI->isUnconditional()) in handlePhiDef()
174 return BI; in handlePhiDef()
193 BranchInst *BI = GetDomConditional(i); in handlePhiDef() local
194 if (!BI) in handlePhiDef()
213 if (OpndIncomingBB == BI->getParent() && Succ == PhiDef->getParent()) in handlePhiDef()
221 if (IsOpndComingFromSuccessor(BI->getSuccessor(1))) in handlePhiDef()
[all …]
|
| D | SimpleLoopUnswitch.cpp | 329 static bool unswitchTrivialBranch(Loop &L, BranchInst &BI, DominatorTree &DT, in unswitchTrivialBranch() argument
331 assert(BI.isConditional() && "Can only unswitch a conditional branch!"); in unswitchTrivialBranch()
332 LLVM_DEBUG(dbgs() << " Trying to unswitch branch: " << BI << "\n"); in unswitchTrivialBranch()
341 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch()
342 Invariants.push_back(BI.getCondition()); in unswitchTrivialBranch()
345 if (auto *CondInst = dyn_cast<Instruction>(BI.getCondition())) in unswitchTrivialBranch()
355 auto *LoopExitBB = BI.getSuccessor(0); in unswitchTrivialBranch()
359 LoopExitBB = BI.getSuccessor(1); in unswitchTrivialBranch()
363 auto *ContinueBB = BI.getSuccessor(1 - LoopExitSuccIdx); in unswitchTrivialBranch()
364 auto *ParentBB = BI.getParent(); in unswitchTrivialBranch()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| D | SimplifyCFG.cpp | 72 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder);
73 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder);
194 BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator()); in GetIfCondition() local
195 if (BI == 0) return 0; in GetIfCondition()
197 assert(BI->isConditional() && "Two successors but not conditional?"); in GetIfCondition()
198 if (BI->getSuccessor(0) == Pred1) { in GetIfCondition()
205 return BI->getCondition(); in GetIfCondition()
246 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); in DominatesMergePoint() local
247 if (BI == 0 || BI->isConditional() || BI->getSuccessor(0) != BB) in DominatesMergePoint()
438 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in EraseTerminatorInstAndDCECond() local
[all …]
|
| /external/llvm/include/llvm/IR/ |
| D | InstIterator.h | 37 BI_t BI; // BasicBlock::iterator variable
51 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
55 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
60 BI = BB->begin(); in InstIterator()
71 inline BIty &getInstructionIterator() { return BI; } in getInstructionIterator()
73 inline reference operator*() const { return *BI; }
77 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
84 ++BI;
93 while (BB == BBs->end() || BI == BB->begin()) {
95 BI = BB->end();
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
| D | InstIterator.h | 40 BI_t BI; // BasicBlock::iterator variable
55 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
59 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
64 BI = BB->begin(); in InstIterator()
75 inline BIty &getInstructionIterator() { return BI; } in getInstructionIterator()
77 inline reference operator*() const { return *BI; }
81 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
88 ++BI;
97 while (BB == BBs->end() || BI == BB->begin()) {
99 BI = BB->end();
[all …]
|
| /external/iptables/extensions/ |
| D | libxt_addrtype.man | 8 .BI "UNSPEC"
11 .BI "UNICAST"
14 .BI "LOCAL"
17 .BI "BROADCAST"
20 .BI "ANYCAST"
23 .BI "MULTICAST"
26 .BI "BLACKHOLE"
29 .BI "UNREACHABLE"
32 .BI "PROHIBIT"
35 .BI "THROW"
[all …]
|
| /external/clang/include/clang/Basic/ |
| D | TargetBuiltins.h | 28 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
39 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
50 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
60 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
70 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
80 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
90 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
143 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
153 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
163 #define BUILTIN(ID, TYPE, ATTRS) BI##ID,
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | SplitKit.cpp | 165 BlockInfo BI; in calcLiveBlockInfo() local
166 BI.MBB = MFI; in calcLiveBlockInfo()
168 tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB); in calcLiveBlockInfo()
175 ThroughBlocks.set(BI.MBB->getNumber()); in calcLiveBlockInfo()
182 BI.FirstInstr = *UseI; in calcLiveBlockInfo()
183 assert(BI.FirstInstr >= Start); in calcLiveBlockInfo()
186 BI.LastInstr = UseI[-1]; in calcLiveBlockInfo()
187 assert(BI.LastInstr < Stop); in calcLiveBlockInfo()
190 BI.LiveIn = LVI->start <= Start; in calcLiveBlockInfo()
193 if (!BI.LiveIn) { in calcLiveBlockInfo()
[all …]
|
| D | InterferenceCache.cpp | 123 BlockInterference *BI = &Blocks[MBBNum]; in update() local
125 BI->Tag = Tag; in update()
126 BI->First = BI->Last = SlotIndex(); in update()
136 if (!BI->First.isValid() || StartI < BI->First) in update()
137 BI->First = StartI; in update()
141 if (BI->First.isValid()) in update()
148 BI = &Blocks[MBBNum]; in update()
149 if (BI->Tag == Tag) in update()
164 if (!BI->Last.isValid() || StopI > BI->Last) in update()
165 BI->Last = StopI; in update()
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | CodeEmitterGen.cpp | 41 BitsInit *BI = R->getValueAsBitsInit("Inst"); in reverseBits() local
43 unsigned numBits = BI->getNumBits(); in reverseBits()
49 Init *OrigBit = BI->getBit(bit); in reverseBits()
50 Init *BitSwap = BI->getBit(bitSwapIdx); in reverseBits()
56 NewBits[middle] = BI->getBit(middle); in reverseBits()
70 BitsInit *BI, int bit) { in getVariableBit() argument
71 if (VarBitInit *VBI = dynamic_cast<VarBitInit*>(BI->getBit(bit))) { in getVariableBit()
75 } else if (VarInit *VI = dynamic_cast<VarInit*>(BI->getBit(bit))) { in getVariableBit()
84 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, in AddCodeToMergeInOperand() argument
90 int bit = BI->getNumBits()-1; in AddCodeToMergeInOperand()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 29 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
34 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)))… in test_constexpr()
35 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)))… in test_constexpr()
|
| D | find_first_of_pred.pass.cpp | 31 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
36 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)),… in test_constexpr()
37 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)),… in test_constexpr()
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | SIWholeQuadMode.cpp | 154 for (auto BI = MF.begin(), BE = MF.end(); BI != BE; ++BI) { in scanInstructions() local
155 MachineBasicBlock &MBB = *BI; in scanInstructions()
215 BlockInfo &BI = Blocks[MBB]; in propagateInstruction() local
225 BI.Needs |= II.Needs; in propagateInstruction()
226 if ((BI.InNeeds | II.Needs) != BI.InNeeds) { in propagateInstruction()
227 BI.InNeeds |= II.Needs; in propagateInstruction()
283 BlockInfo BI = Blocks[&MBB]; // Make a copy to prevent dangling references. in propagateBlock() local
289 if ((LastII.OutNeeds | BI.OutNeeds) != LastII.OutNeeds) { in propagateBlock()
290 LastII.OutNeeds |= BI.OutNeeds; in propagateBlock()
298 if ((PredBI.OutNeeds | BI.InNeeds) == PredBI.OutNeeds) in propagateBlock()
[all …]
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTXImageOptimizer.cpp | 60 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; in runOnFunction() local
61 ++BI) { in runOnFunction()
62 for (BasicBlock::iterator I = (*BI).begin(), E = (*BI).end(); in runOnFunction()
155 if (BranchInst *BI = dyn_cast<BranchInst>(*UI)) { in replaceWith() local
156 if (BI->isUnconditional()) continue; in replaceWith()
160 Dest = BI->getSuccessor(1); in replaceWith()
163 Dest = BI->getSuccessor(0); in replaceWith()
164 BranchInst::Create(Dest, BI); in replaceWith()
165 InstrToDelete.push_back(BI); in replaceWith()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/NVPTX/ |
| D | NVPTXImageOptimizer.cpp | 60 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; in runOnFunction() local
61 ++BI) { in runOnFunction()
62 for (BasicBlock::iterator I = (*BI).begin(), E = (*BI).end(); in runOnFunction()
153 if (BranchInst *BI = dyn_cast<BranchInst>(*UI)) { in replaceWith() local
154 if (BI->isUnconditional()) continue; in replaceWith()
158 Dest = BI->getSuccessor(1); in replaceWith()
161 Dest = BI->getSuccessor(0); in replaceWith()
162 BranchInst::Create(Dest, BI); in replaceWith()
163 InstrToDelete.push_back(BI); in replaceWith()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LowerExpectIntrinsic.cpp | 86 static bool handleBranchExpect(BranchInst &BI) { in handleBranchExpect() argument
87 if (BI.isUnconditional()) in handleBranchExpect()
101 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI.getCondition()); in handleBranchExpect()
103 CI = dyn_cast<CallInst>(BI.getCondition()); in handleBranchExpect()
132 BI.setMetadata(LLVMContext::MD_prof, Node); in handleBranchExpect()
137 BI.setCondition(ArgValue); in handleBranchExpect()
146 if (BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator())) { in lowerExpectIntrinsic() local
147 if (handleBranchExpect(*BI)) in lowerExpectIntrinsic()
155 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end(); BI != BE;) { in lowerExpectIntrinsic() local
156 CallInst *CI = dyn_cast<CallInst>(BI++); in lowerExpectIntrinsic()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopInfoImpl.h | 37 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitingBlocks() local
39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks()
43 ExitingBlocks.push_back(*BI); in getExitingBlocks()
66 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitBlocks() local
68 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks()
91 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitEdges() local
93 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitEdges()
97 ExitEdges.push_back(Edge(*BI, *I)); in getExitEdges()
234 BI = df_ext_begin(getHeader(), VisitSet), in verifyLoop() local
241 for ( ; BI != BE; ++BI) { in verifyLoop()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| D | find_end.pass.cpp | 29 typedef bidirectional_iterator<int*> BI; in test_constexpr() typedef
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
35 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | SimplifyCFG.cpp | 162 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder<> &Builder);
163 bool SimplifyCondBranch(BranchInst *BI, IRBuilder<> &Builder);
313 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); in DominatesMergePoint() local
314 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB) in DominatesMergePoint()
630 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in EraseTerminatorInstAndDCECond() local
631 if (BI->isConditional()) in EraseTerminatorInstAndDCECond()
632 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorInstAndDCECond()
653 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) in isValueEqualityComparison() local
654 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison()
655 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) { in isValueEqualityComparison()
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | CodeEmitterGen.cpp | 35 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
37 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
48 BitsInit *BI, int bit) { in getVariableBit() argument
49 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) { in getVariableBit()
53 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) { in getVariableBit()
62 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, in AddCodeToMergeInOperand() argument
69 int bit = BI->getNumBits()-1; in AddCodeToMergeInOperand()
73 if (getVariableBit(VarName, BI, bit) != -1) in AddCodeToMergeInOperand()
139 int varBit = getVariableBit(VarName, BI, bit); in AddCodeToMergeInOperand()
153 varBit = getVariableBit(VarName, BI, bit); in AddCodeToMergeInOperand()
[all …]
|