| /external/libcxx/test/std/re/re.alg/re.alg.match/ |
| basic.pass.cpp | 682 typedef bidirectional_iterator<const char*> BI;
684 std::match_results<BI> m;
687 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
690 assert(m.prefix().first == BI(s));
[all...] |
| ecma.pass.cpp | 652 typedef bidirectional_iterator<const char*> BI;
654 std::match_results<BI> m;
657 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
660 assert(m.prefix().first == BI(s));
[all...] |
| extended.pass.cpp | 680 typedef bidirectional_iterator<const char*> BI;
682 std::match_results<BI> m;
685 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
688 assert(m.prefix().first == BI(s));
[all...] |
| /external/libcxx/test/std/re/re.alg/re.alg.search/ |
| awk.pass.cpp | 770 typedef bidirectional_iterator<const char*> BI;
772 std::match_results<BI> m;
775 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
778 assert(m.prefix().first == BI(s));
[all...] |
| basic.pass.cpp | 772 typedef bidirectional_iterator<const char*> BI;
774 std::match_results<BI> m;
777 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
780 assert(m.prefix().first == BI(s));
[all...] |
| ecma.pass.cpp | 748 typedef bidirectional_iterator<const char*> BI;
750 std::match_results<BI> m;
753 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
756 assert(m.prefix().first == BI(s));
[all...] |
| extended.pass.cpp | 770 typedef bidirectional_iterator<const char*> BI;
772 std::match_results<BI> m;
775 assert(std::regex_search(BI(s), BI(s+ss), m, regex));
778 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/lib/Target/NVPTX/ |
| NVPTXLowerAlloca.cpp | 102 auto BI = dyn_cast<BitCastInst>(AllocaUse.getUser());
103 if (BI && BI->getOperand(0) == allocaInst) {
104 BI->setOperand(0, NewASCToGeneric);
|
| /external/llvm/lib/Transforms/Scalar/ |
| 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);
|
| /external/llvm/unittests/IR/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| /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...] |
| /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/Transforms/IPO/ |
| CrossDSOCFI.cpp | 153 BranchInst *BI = IRBTest.CreateCondBr(Test, ExitBB, TrapBB);
154 BI->setMetadata(LLVMContext::MD_prof, VeryLikelyWeights);
|
| /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/IR/ |
| BasicBlock.cpp | 150 if (auto *BI = dyn_cast<BitCastInst>(Prev)) {
151 RV = BI->getOperand(0);
152 Prev = BI->getPrevNode();
376 BranchInst *BI = BranchInst::Create(New, this);
377 BI->setDebugLoc(Loc);
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 517 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
518 if (!BI->isConditional())
521 CountedExitBranch = BI;
607 MachineBasicBlock::iterator BI = I;
631 if (I != BI && clobbersCTR(I)) {
635 BI->getParent()->getNumber() << " (" <<
636 BI->getParent()->getFullName() << ") instruction " <<
637 *BI << "\n");
652 BI->getParent()->getNumber() << " (" <<
653 BI->getParent()->getFullName() << ") instruction " <
[all...] |
