Searched defs:BI (Results 1 - 25 of 72) sorted by relevance

123

/external/libcxx/test/std/re/re.alg/re.alg.match/
H A Dbasic.pass.cpp681 typedef bidirectional_iterator<const char*> BI; typedef
683 std::match_results<BI> m;
686 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
689 assert(m.prefix().first == BI(s));
1349 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1351 std::match_results<BI> m;
1354 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
1357 assert(m.prefix().first == BI(
[all...]
H A Decma.pass.cpp651 typedef bidirectional_iterator<const char*> BI; typedef
653 std::match_results<BI> m;
656 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
659 assert(m.prefix().first == BI(s));
1304 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1306 std::match_results<BI> m;
1309 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
1312 assert(m.prefix().first == BI(
[all...]
H A Dextended.pass.cpp679 typedef bidirectional_iterator<const char*> BI; typedef
681 std::match_results<BI> m;
684 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
687 assert(m.prefix().first == BI(s));
1345 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1347 std::match_results<BI> m;
1350 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
1353 assert(m.prefix().first == BI(
[all...]
/external/libcxx/test/std/re/re.alg/re.alg.search/
H A Dawk.pass.cpp769 typedef bidirectional_iterator<const char*> BI; typedef
771 std::match_results<BI> m;
774 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
777 assert(m.prefix().first == BI(s));
1540 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1542 std::match_results<BI> m;
1545 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
1548 assert(m.prefix().first == BI(
[all...]
H A Dbasic.pass.cpp771 typedef bidirectional_iterator<const char*> BI; typedef
773 std::match_results<BI> m;
776 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
779 assert(m.prefix().first == BI(s));
1529 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1531 std::match_results<BI> m;
1534 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
1537 assert(m.prefix().first == BI(
[all...]
H A Decma.pass.cpp747 typedef bidirectional_iterator<const char*> BI; typedef
749 std::match_results<BI> m;
752 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
755 assert(m.prefix().first == BI(s));
1526 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1528 std::match_results<BI> m;
1531 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
1534 assert(m.prefix().first == BI(
[all...]
H A Dextended.pass.cpp769 typedef bidirectional_iterator<const char*> BI; typedef
771 std::match_results<BI> m;
774 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
777 assert(m.prefix().first == BI(s));
1525 typedef bidirectional_iterator<const wchar_t*> BI; typedef
1527 std::match_results<BI> m;
1530 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
1533 assert(m.prefix().first == BI(
[all...]
/external/llvm/unittests/IR/
H A DVerifierTest.cpp37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry); local
42 BI->setOperand(0, Zero32);
H A DIRBuilderTest.cpp87 BranchInst *BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB); local
89 EXPECT_EQ(BI, TI);
94 BI->eraseFromParent();
96 BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB, Weights);
98 EXPECT_EQ(BI, TI);
/external/llvm/lib/Transforms/Scalar/
H A DLowerExpectIntrinsic.cpp74 static bool handleBranchExpect(BranchInst &BI) { argument
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 !
[all...]
H A DLoopDeletion.cpp91 BasicBlock::iterator BI = exitBlock->begin(); local
92 while (PHINode *P = dyn_cast<PHINode>(BI)) {
108 ++BI;
117 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
118 BI != BE; ++BI) {
119 if (BI->mayHaveSideEffects())
197 BasicBlock::iterator BI = exitBlock->begin(); local
198 while (PHINode *P = dyn_cast<PHINode>(BI)) {
204 ++BI;
[all...]
H A DLoopRotation.cpp289 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator());
290 if (!BI)
300 LastExit->getInstList().splice(BI, Latch->getInstList(), Latch->begin(), Jmp);
302 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1;
307 BI->setSuccessor(FallThruPath, Header);
338 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); local
339 if (!BI || BI->isUnconditional())
393 BasicBlock *Exit = BI->getSuccessor(0);
394 BasicBlock *NewHeader = BI
[all...]
H A DMergedLoadStoreMotion.cpp198 BranchInst *BI = (BranchInst *)(BB->getTerminator()); local
199 BasicBlock *Succ0 = BI->getSuccessor(0);
215 BranchInst *BI = (BranchInst *)(BB->getTerminator());
216 BasicBlock *Succ0 = BI->getSuccessor(0);
217 BasicBlock *Succ1 = BI->getSuccessor(1);
363 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local
364 BasicBlock *Succ0 = BI->getSuccessor(0);
365 BasicBlock *Succ1 = BI->getSuccessor(1);
/external/llvm/include/llvm/IR/
H A DInstIterator.h37 BI_t BI; // BasicBlock::iterator member in class:llvm::InstIterator
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/
H A DInterferenceCache.cpp148 BlockInterference *BI = &Blocks[MBBNum]; local
152 BI->Tag = Tag;
153 BI->First = BI->Last = SlotIndex();
163 if (!BI->First.isValid() || StartI < BI->First)
164 BI->First = StartI;
176 if (!BI->First.isValid() || StartI < BI->First)
177 BI
[all...]
/external/llvm/utils/TableGen/
H A DCodeEmitterGen.cpp36 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, argument
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, bi
48 getVariableBit(const std::string &VarName, BitsInit *BI, int bit) argument
182 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
254 BitsInit *BI = R->getValueAsBitsInit("Inst"); local
[all...]
/external/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h37 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),
234 BI = df_ext_begin(getHeader(), VisitSet), local
[all...]
/external/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp180 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) {
181 Instruction *CI = BI++;
243 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); local
244 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
252 BI->swapSuccessors();
359 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) {
360 if (BI
[all...]
H A DBypassSlowDivision.cpp251 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth); local
252 if (BI == BypassWidths.end())
256 IntegerType *BT = IntegerType::get(J->getContext(), BI->second);
H A DCloneFunction.cpp119 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
120 BI != BE; ++BI) {
121 const BasicBlock &BB = *BI;
407 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
408 if (BI->isConditional()) {
410 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
413 Value *V = VMap[BI->getCondition()];
419 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
517 for (Function::const_iterator BI
664 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); local
[all...]
H A DLoopSimplify.cpp528 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator()))
529 if (BI->isConditional()) {
530 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) {
535 BI->setCondition(ConstantInt::get(Cond->getType(),
536 !L->contains(BI->getSuccessor(0))));
649 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); local
650 if (!BI || !BI->isConditional()) continue;
651 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
658 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) {
[all...]
/external/clang/test/Analysis/
H A Dderived-to-base.cpp72 class BI : public virtual Intermediate { class in namespace:VirtualBaseClasses
82 class DI : public BI, public CI {};
/external/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp278 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local
279 if (!BI || !BI->isConditional())
282 Value *Cond = BI->getCondition();
368 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local
369 if (!BI || !BI->isConditional())
372 Value *Cond = BI->getCondition();
450 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local
451 if (!BI || !B
[all...]
/external/llvm/lib/IR/
H A DValue.cpp120 BasicBlock::const_iterator BI = BB->begin(), BE = BB->end(); local
122 for (; BI != BE && UI != UE; ++BI, ++UI) {
123 // Scan basic block: Check if this Value is used by the instruction at BI.
124 if (std::find(BI->op_begin(), BI->op_end(), this) != BI->op_end())
/external/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp500 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
501 if (!BI->isConditional())
504 CountedExitBranch = BI;
591 MachineBasicBlock::iterator BI = I; local
615 if (I != BI && clobbersCTR(I)) {
619 BI->getParent()->getNumber() << " (" <<
620 BI->getParent()->getFullName() << ") instruction " <<
621 *BI << "\n");
636 BI->getParent()->getNumber() << " (" <<
637 BI
[all...]

Completed in 507 milliseconds

123