| /external/clang/include/clang/Basic/ |
| 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/llvm/include/llvm/IR/ |
| InstIterator.h | 37 BI_t BI; // BasicBlock::iterator
51 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
55 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
60 BI = BB->begin();
71 inline BIty &getInstructionIterator() { return BI; }
73 inline reference operator*() const { return *BI; }
77 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 149 BlockInterference *BI = &Blocks[MBBNum];
153 BI->Tag = Tag;
154 BI->First = BI->Last = SlotIndex();
164 if (!BI->First.isValid() || StartI < BI->First)
165 BI->First = StartI;
177 if (!BI->First.isValid() || StartI < BI->First)
178 BI->First = StartI
[all...] |
| SplitKit.cpp | 183 BlockInfo BI;
184 BI.MBB = &*MFI;
186 std::tie(Start, Stop) = LIS.getSlotIndexes()->getMBBRange(BI.MBB);
193 ThroughBlocks.set(BI.MBB->getNumber());
200 BI.FirstInstr = *UseI;
201 assert(BI.FirstInstr >= Start);
204 BI.LastInstr = UseI[-1];
205 assert(BI.LastInstr < Stop);
208 BI.LiveIn = LVI->start <= Start;
211 if (!BI.LiveIn)
[all...] |
| SplitKit.h | 189 /// live range for the instructions in BI. There is normally no benefit to
194 /// @param BI The block to be isolated.
196 bool shouldSplitSingleBlock(const BlockInfo &BI, bool SingleInstrs) const;
430 void splitSingleBlock(const SplitAnalysis::BlockInfo &BI);
450 /// @param BI Block descriptor.
453 void splitRegInBlock(const SplitAnalysis::BlockInfo &BI,
462 /// @param BI Block descriptor.
465 void splitRegOutBlock(const SplitAnalysis::BlockInfo &BI,
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXAllocaHoisting.cpp | 49 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) {
50 AllocaInst *allocaInst = dyn_cast<AllocaInst>(BI++);
|
| NVPTXImageOptimizer.cpp | 57 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE;
58 ++BI) {
59 for (BasicBlock::iterator I = (*BI).begin(), E = (*BI).end();
152 if (BranchInst *BI = dyn_cast<BranchInst>(*UI)) {
153 if (BI->isUnconditional()) continue;
157 Dest = BI->getSuccessor(1);
160 Dest = BI->getSuccessor(0);
161 BranchInst::Create(Dest, BI);
[all...] |
| NVPTXLowerAlloca.cpp | 102 auto BI = dyn_cast<BitCastInst>(AllocaUse.getUser());
103 if (BI && BI->getOperand(0) == allocaInst) {
104 BI->setOperand(0, NewASCToGeneric);
|
| NVPTXReplaceImageHandles.cpp | 59 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end(); BI != BE;
60 ++BI) {
61 for (MachineBasicBlock::iterator I = (*BI).begin(), E = (*BI).end();
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerExpectIntrinsic.cpp | 74 static bool handleBranchExpect(BranchInst &BI) {
75 if (BI.isUnconditional())
89 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI.getCondition());
91 CI = dyn_cast<CallInst>(BI.getCondition());
120 BI.setMetadata(LLVMContext::MD_prof, Node);
125 BI.setCondition(ArgValue);
134 if (BranchInst *BI = dyn_cast<BranchInst>(BB.getTerminator())) {
135 if (handleBranchExpect(*BI))
143 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end(); BI != BE;)
[all...] |
| LoopDeletion.cpp | 93 BasicBlock::iterator BI = exitBlock->begin();
94 while (PHINode *P = dyn_cast<PHINode>(BI)) {
110 ++BI;
119 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
120 BI != BE; ++BI) {
121 if (BI->mayHaveSideEffects())
199 BasicBlock::iterator BI = exitBlock->begin();
200 while (PHINode *P = dyn_cast<PHINode>(BI)) {
206 ++BI;
[all...] |
| SpeculativeExecution.cpp | 128 BranchInst *BI = dyn_cast<BranchInst>(B.getTerminator());
129 if (BI == nullptr)
132 if (BI->getNumSuccessors() != 2)
134 BasicBlock &Succ0 = *BI->getSuccessor(0);
135 BasicBlock &Succ1 = *BI->getSuccessor(1);
|
| /toolchain/binutils/binutils-2.25/include/cgen/ |
| basic-ops.h | 43 #define NOTBI(x) (! (BI) (x))
45 #define EQBI(x, y) ((BI) (x) == (BI) (y))
46 #define NEBI(x, y) ((BI) (x) != (BI) (y))
47 #define LTBI(x, y) ((BI) (x) < (BI) (y))
48 #define LEBI(x, y) ((BI) (x) <= (BI) (y))
49 #define GTBI(x, y) ((BI) (x) > (BI) (y)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator();
179 BI != BE;) {
180 Instruction *CI = &*BI++;
242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator());
243 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
251 BI->swapSuccessors();
358 for (BasicBlock::iterator BI(PBI2), BE(PTI2); BI != BE; ++BI) {
359 if (BI->mayReadFromMemory() || BI->mayWriteToMemory())
[all...] |
| SimplifyInstructions.cpp | 66 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {
67 Instruction *I = &*BI++;
89 BI = BB->begin(); BE = BB->end();
|
| SimplifyCFG.cpp | 147 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder);
148 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder);
287 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator());
288 if (!BI || BI->isConditional() || BI->getSuccessor(0) != BB)
536 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
537 if (BI->isConditional())
538 Cond = dyn_cast<Instruction>(BI->getCondition());
557 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 36 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
38 void AddCodeToMergeInOperand(Record *R, BitsInit *BI,
49 BitsInit *BI, int bit) {
50 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
54 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) {
63 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName,
70 int bit = BI->getNumBits()-1;
74 if (getVariableBit(VarName, BI, bit) != -1)
140 int varBit = getVariableBit(VarName, BI, bit);
154 varBit = getVariableBit(VarName, BI, bit)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 37 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
43 ExitingBlocks.push_back(*BI);
66 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
68 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI)
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 180 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) {
181 BasicBlock *BB = *BI;
247 for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end(); BI != BE; ++BI) {
248 if (const CallInst *CI = dyn_cast<CallInst>(BI)) {
252 if (BI->getType()->isTokenTy() && BI->isUsedOutsideOfBlock(*I)
[all...] |
| BranchProbabilityInfo.cpp | 300 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
301 if (!BI || !BI->isConditional())
304 Value *Cond = BI->getCondition();
391 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator());
392 if (!BI || !BI->isConditional())
395 Value *Cond = BI->getCondition();
473 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator());
474 if (!BI || !BI->isConditional()
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ConcurrentHashMapTest.java | 58 static class BI implements Comparable<BI> {
60 BI(int value) { this.value = value; }
61 public int compareTo(BI other) {
65 return (x instanceof BI) && ((BI)x).value == value;
69 static class CI extends BI { CI(int value) { super(value); } }
70 static class DI extends BI { DI(int value) { super(value); } }
124 ConcurrentHashMap<BI, Boolean> m =
125 new ConcurrentHashMap<BI, Boolean>()
144 BI bi = new BI(i); local
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| R600Packetizer.cpp | 78 MachineBasicBlock::instr_iterator BI = I.getInstrIterator();
80 BI++;
84 int BISlot = getSlot(&*BI);
88 if (TII->isPredicated(&*BI))
90 int OperandIdx = TII->getOperandIdx(BI->getOpcode(), AMDGPU::OpName::write);
91 if (OperandIdx > -1 && BI->getOperand(OperandIdx).getImm() == 0)
93 int DstIdx = TII->getOperandIdx(BI->getOpcode(), AMDGPU::OpName::dst);
97 unsigned Dst = BI->getOperand(DstIdx).getReg();
98 if (isTrans || TII->isTransOnly(&*BI)) {
102 if (BI->getOpcode() == AMDGPU::DOT4_r600 |
[all...] |
| SILowerI1Copies.cpp | 80 for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
81 BI != BE; ++BI) {
83 MachineBasicBlock &MBB = *BI;
|
| SIMachineFunctionInfo.cpp | 163 for (MachineFunction::iterator BI = MF->begin(), BE = MF->end();
164 BI != BE; ++BI) {
165 BI->addLiveIn(LaneVGPR);
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Consumed.h | 213 for (PostOrderCFGView::iterator BI = SortedGraph->begin(),
214 BE = SortedGraph->end(); BI != BE; ++BI) {
215 VisitOrder[(*BI)->getBlockID()] = VisitOrderCounter++;
|
