| /external/libcxx/test/re/re.alg/re.alg.match/ |
| basic.pass.cpp | 676 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| ecma.pass.cpp | 646 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| extended.pass.cpp | 674 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| /external/libcxx/test/re/re.alg/re.alg.search/ |
| awk.pass.cpp | 764 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| basic.pass.cpp | 766 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| ecma.pass.cpp | 742 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| extended.pass.cpp | 764 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.match/ |
| basic.pass.cpp | 683 typedef bidirectional_iterator<const char*> BI;
685 std::match_results<BI> m;
688 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
691 assert(m.prefix().first == BI(s));
[all...] |
| ecma.pass.cpp | 653 typedef bidirectional_iterator<const char*> BI;
655 std::match_results<BI> m;
658 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
661 assert(m.prefix().first == BI(s));
[all...] |
| extended.pass.cpp | 681 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.search/ |
| awk.pass.cpp | 771 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| basic.pass.cpp | 773 typedef bidirectional_iterator<const char*> BI;
775 std::match_results<BI> m;
778 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
781 assert(m.prefix().first == BI(s));
[all...] |
| ecma.pass.cpp | 749 typedef bidirectional_iterator<const char*> BI;
751 std::match_results<BI> m;
754 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
757 assert(m.prefix().first == BI(s));
[all...] |
| extended.pass.cpp | 771 typedef bidirectional_iterator<const char*> BI;
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));
[all...] |
| /external/llvm/unittests/IR/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| IRBuilderTest.cpp | 85 BranchInst *BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB);
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/Scalar/ |
| LoopDeletion.cpp | 91 BasicBlock::iterator BI = exitBlock->begin();
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();
198 while (PHINode *P = dyn_cast<PHINode>(BI)) {
204 ++BI;
[all...] |
| 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());
304 if (!BI || BI->isUnconditional())
355 BasicBlock *Exit = BI->getSuccessor(0);
356 BasicBlock *NewHeader = BI->getSuccessor(1)
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 147 BlockInterference *BI = &Blocks[MBBNum];
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->First = StartI
[all...] |
| /external/llvm/include/llvm/IR/ |
| InstIterator.h | 38 _BI_t BI; // BasicBlock::iterator
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/utils/TableGen/ |
| 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,
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, 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/IR/ |
| Value.cpp | 121 BasicBlock::const_iterator BI = BB->begin(), BE = BB->end();
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())
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 481 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
482 if (!BI->isConditional())
485 CountedExitBranch = BI;
572 MachineBasicBlock::iterator BI = I;
596 if (I != BI && clobbersCTR(I)) {
600 BI->getParent()->getNumber() << " (" <<
601 BI->getParent()->getFullName() << ") instruction " <<
602 *BI << "\n");
617 BI->getParent()->getNumber() << " (" <<
618 BI->getParent()->getFullName() << ") instruction " <
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 251 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth);
252 if (BI == BypassWidths.end())
256 IntegerType *BT = IntegerType::get(J->getContext(), BI->second);
|
