| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 34 typedef bidirectional_iterator<int*> BI;
42 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)))
|
| equal_pred.pass.cpp | 41 typedef bidirectional_iterator<int*> BI;
49 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq)
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 29 typedef bidirectional_iterator<int*> BI;
34 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+1))
35 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == BI(std::end(ic))
[all...] |
| find_first_of_pred.pass.cpp | 31 typedef bidirectional_iterator<int*> BI;
36 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+1))
37 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) == BI(std::end(ic))
[all...] |
| /external/libcxx/test/std/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 | 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...] |
| 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...] |
| /external/libcxx/test/std/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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/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 | 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...] |
| 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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/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/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 33 typedef bidirectional_iterator<int*> BI;
54 auto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)));
55 if (p6.first != BI(ib+2) || p6.second != BI(ic+2))
|
| mismatch_pred.pass.cpp | 38 typedef bidirectional_iterator<int*> BI;
59 auto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq);
60 if (p6.first != BI(ib+2) || p6.second != BI(ic+2))
|
| /external/swiftshader/third_party/LLVM/unittests/VMCore/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 29 typedef bidirectional_iterator<int*> BI;
34 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+15))
35 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == BI(std::end(ic))
[all...] |
| find_end_pred.pass.cpp | 38 typedef bidirectional_iterator<int*> BI;
43 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+15))
44 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) == BI(std::end(ic))
[all...] |
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXLowerAlloca.cpp | 105 auto BI = dyn_cast<BitCastInst>(AllocaUse.getUser());
106 if (BI && BI->getOperand(0) == allocaInst) {
107 BI->setOperand(0, NewASCToGeneric);
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| InterferenceCache.cpp | 123 BlockInterference *BI = &Blocks[MBBNum];
125 BI->Tag = Tag;
126 BI->First = BI->Last = SlotIndex();
136 if (!BI->First.isValid() || StartI < BI->First)
137 BI->First = StartI;
141 if (BI->First.isValid())
148 BI = &Blocks[MBBNum];
149 if (BI->Tag == Tag
[all...] |
