/external/libcxx/test/re/re.alg/re.alg.match/ |
H A D | basic.pass.cpp | 676 typedef bidirectional_iterator<const char*> BI; typedef 678 std::match_results<BI> m; 681 assert(std::regex_match(BI(s), BI(s+ss), m, regex)); 684 assert(m.prefix().first == BI(s)); 1344 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1346 std::match_results<BI> m; 1349 assert(std::regex_match(BI(s), BI(s+ss), m, regex)); 1352 assert(m.prefix().first == BI( [all...] |
H A D | ecma.pass.cpp | 646 typedef bidirectional_iterator<const char*> BI; typedef 648 std::match_results<BI> m; 651 assert(std::regex_match(BI(s), BI(s+ss), m, regex)); 654 assert(m.prefix().first == BI(s)); 1299 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1301 std::match_results<BI> m; 1304 assert(std::regex_match(BI(s), BI(s+ss), m, regex)); 1307 assert(m.prefix().first == BI( [all...] |
H A D | extended.pass.cpp | 674 typedef bidirectional_iterator<const char*> BI; typedef 676 std::match_results<BI> m; 679 assert(std::regex_match(BI(s), BI(s+ss), m, regex)); 682 assert(m.prefix().first == BI(s)); 1340 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1342 std::match_results<BI> m; 1345 assert(std::regex_match(BI(s), BI(s+ss), m, regex)); 1348 assert(m.prefix().first == BI( [all...] |
/external/libcxx/test/re/re.alg/re.alg.search/ |
H A D | awk.pass.cpp | 764 typedef bidirectional_iterator<const char*> BI; typedef 766 std::match_results<BI> m; 769 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 772 assert(m.prefix().first == BI(s)); 1535 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1537 std::match_results<BI> m; 1540 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 1543 assert(m.prefix().first == BI( [all...] |
H A D | basic.pass.cpp | 766 typedef bidirectional_iterator<const char*> BI; typedef 768 std::match_results<BI> m; 771 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 774 assert(m.prefix().first == BI(s)); 1524 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1526 std::match_results<BI> m; 1529 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 1532 assert(m.prefix().first == BI( [all...] |
H A D | ecma.pass.cpp | 742 typedef bidirectional_iterator<const char*> BI; typedef 744 std::match_results<BI> m; 747 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 750 assert(m.prefix().first == BI(s)); 1521 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1523 std::match_results<BI> m; 1526 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 1529 assert(m.prefix().first == BI( [all...] |
H A D | extended.pass.cpp | 764 typedef bidirectional_iterator<const char*> BI; typedef 766 std::match_results<BI> m; 769 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 772 assert(m.prefix().first == BI(s)); 1520 typedef bidirectional_iterator<const wchar_t*> BI; typedef 1522 std::match_results<BI> m; 1525 assert(std::regex_search(BI(s), BI(s+ss), m, regex)); 1528 assert(m.prefix().first == BI( [all...] |
/external/llvm/unittests/IR/ |
H A D | VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry); local 42 BI->setOperand(0, Zero32);
|
H A D | IRBuilderTest.cpp | 85 BranchInst *BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB); local 87 EXPECT_EQ(BI, TI); 92 BI->eraseFromParent(); 94 BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB, Weights); 96 EXPECT_EQ(BI, TI);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LowerExpectIntrinsic.cpp | 48 bool HandleIfExpect(BranchInst *BI); 93 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) { argument 94 if (BI->isUnconditional()) 108 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI->getCondition()); 110 CI = dyn_cast<CallInst>(BI->getCondition()); 139 BI->setMetadata(LLVMContext::MD_prof, Node); 144 BI->setCondition(ArgValue); 154 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) { 155 if (HandleIfExpect(BI)) 163 for (BasicBlock::iterator BI [all...] |
H A D | FlattenCFG.cpp | 180 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) { 181 Instruction *CI = BI++; 242 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); local 243 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); 248 BI->swapSuccessors(); 358 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) { 359 if (BI [all...] |
H A D | LoopUnroll.cpp | 169 BranchInst *BI = dyn_cast<BranchInst>(LatchBlock->getTerminator()); local 171 if (!BI || BI->isUnconditional()) { 267 bool ContinueOnTrue = L->contains(BI->getSuccessor(0)); 268 BasicBlock *LoopExit = BI->getSuccessor(ContinueOnTrue);
|
H A D | BypassSlowDivision.cpp | 251 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 D | CloneFunction.cpp | 119 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end(); 120 BI != BE; ++BI) { 121 const BasicBlock &BB = *BI; 357 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) { 358 if (BI->isConditional()) { 360 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); 363 Value *V = VMap[BI->getCondition()]; 369 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue()); 453 for (Function::const_iterator BI 592 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); local [all...] |
H A D | LoopSimplify.cpp | 524 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator())) 525 if (BI->isConditional()) { 526 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) { 531 BI->setCondition(ConstantInt::get(Cond->getType(), 532 !L->contains(BI->getSuccessor(0)))); 642 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); local 643 if (!BI || !BI->isConditional()) continue; 644 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); 651 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) { [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 91 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 D | LoopRotation.cpp | 253 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator()); 254 if (!BI) 264 LastExit->getInstList().splice(BI, Latch->getInstList(), Latch->begin(), Jmp); 266 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1; 271 BI->setSuccessor(FallThruPath, Header); 303 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); local 304 if (!BI || BI->isUnconditional()) 355 BasicBlock *Exit = BI->getSuccessor(0); 356 BasicBlock *NewHeader = BI [all...] |
/external/llvm/include/llvm/IR/ |
H A D | InstIterator.h | 38 _BI_t BI; // BasicBlock::iterator member in class:llvm::InstIterator 52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} 61 BI = BB->begin(); 72 inline BIty &getInstructionIterator() { return BI; } 74 inline reference operator*() const { return *BI; } 78 return BB == y.BB && (BB == BBs->end() || BI == y.BI); [all...] |
/external/llvm/lib/CodeGen/ |
H A D | InterferenceCache.cpp | 147 BlockInterference *BI = &Blocks[MBBNum]; local 151 BI->Tag = Tag; 152 BI->First = BI->Last = SlotIndex(); 162 if (!BI->First.isValid() || StartI < BI->First) 163 BI->First = StartI; 175 if (!BI->First.isValid() || StartI < BI->First) 176 BI [all...] |
/external/llvm/utils/TableGen/ |
H A D | CodeEmitterGen.cpp | 44 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit); 46 void AddCodeToMergeInOperand(Record *R, BitsInit *BI, 57 BitsInit *BI, int bit) { 58 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) { 62 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) { 71 AddCodeToMergeInOperand(Record *R, BitsInit *BI, const std::string &VarName, argument 78 int bit = BI->getNumBits()-1; 82 if (getVariableBit(VarName, BI, bit) != -1) 150 int varBit = getVariableBit(VarName, BI, bit); 164 varBit = getVariableBit(VarName, BI, bi 56 getVariableBit(const std::string &VarName, BitsInit *BI, int bit) argument 192 BitsInit *BI = R->getValueAsBitsInit("Inst"); local 268 BitsInit *BI = R->getValueAsBitsInit("Inst"); local [all...] |
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 481 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 482 if (!BI->isConditional()) 485 CountedExitBranch = BI; 572 MachineBasicBlock::iterator BI = I; local 596 if (I != BI && clobbersCTR(I)) { 600 BI->getParent()->getNumber() << " (" << 601 BI->getParent()->getFullName() << ") instruction " << 602 *BI << "\n"); 617 BI->getParent()->getNumber() << " (" << 618 BI [all...] |
/external/clang/test/Analysis/ |
H A D | derived-to-base.cpp | 72 class BI : public virtual Intermediate { class in namespace:VirtualBaseClasses 82 class DI : public BI, public CI {};
|
/external/llvm/include/llvm/Analysis/ |
H A D | 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), 234 BI = df_ext_begin(getHeader(), VisitSet), local [all...] |
/external/llvm/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 276 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local 277 if (!BI || !BI->isConditional()) 280 Value *Cond = BI->getCondition(); 366 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); local 367 if (!BI || !BI->isConditional()) 370 Value *Cond = BI->getCondition(); 440 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); local 441 if (!BI || !B [all...] |
/external/llvm/lib/IR/ |
H A D | Value.cpp | 121 BasicBlock::const_iterator BI = BB->begin(), BE = BB->end(); local 123 for (; BI != BE && UI != UE; ++BI, ++UI) { 124 // Scan basic block: Check if this Value is used by the instruction at BI. 125 if (std::find(BI->op_begin(), BI->op_end(), this) != BI->op_end())
|