| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.match/ |
| awk.pass.cpp | 675 typedef bidirectional_iterator<const char*> BI;
677 std::match_results<BI> m;
680 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
683 assert(m.prefix().first == BI(s));
[all...] |
| 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 | 634 typedef bidirectional_iterator<const char*> BI;
636 std::match_results<BI> m;
639 assert(std::regex_match(BI(s), BI(s+ss), m, regex));
642 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| /external/llvm/unittests/IR/ |
| VerifierTest.cpp | 37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
42 BI->setOperand(0, Zero32);
|
| IRBuilderTest.cpp | 84 BranchInst *BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB);
86 EXPECT_EQ(BI, TI);
91 BI->eraseFromParent();
93 BI = Builder.CreateCondBr(Builder.getTrue(), TBB, FBB, Weights);
95 EXPECT_EQ(BI, TI);
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 90 BasicBlock::iterator BI = exitBlock->begin();
91 while (PHINode *P = dyn_cast<PHINode>(BI)) {
107 ++BI;
116 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end();
117 BI != BE; ++BI) {
118 if (BI->mayHaveSideEffects())
193 BasicBlock::iterator BI = exitBlock->begin();
194 while (PHINode *P = dyn_cast<PHINode>(BI)) {
200 ++BI;
[all...] |
| LoopRotation.cpp | 229 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator());
230 if (!BI)
240 LastExit->getInstList().splice(BI, Latch->getInstList(), Latch->begin(), Jmp);
242 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1;
247 BI->setSuccessor(FallThruPath, Header);
278 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator());
279 if (BI == 0 || BI->isUnconditional())
330 BasicBlock *Exit = BI->getSuccessor(0);
331 BasicBlock *NewHeader = BI->getSuccessor(1)
[all...] |
| TailRecursionElimination.cpp | 638 if (BranchInst *BI = dyn_cast<BranchInst>(PTI))
639 if (BI->isUnconditional())
640 UncondBranchPreds.push_back(BI);
644 BranchInst *BI = UncondBranchPreds.pop_back_val();
645 BasicBlock *Pred = BI->getParent();
646 if (CallInst *CI = FindTRECandidate(BI, CannotTailCallElimCallsMarkedTail)){
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 130 BlockInterference *BI = &Blocks[MBBNum];
134 BI->Tag = Tag;
135 BI->First = BI->Last = SlotIndex();
145 if (!BI->First.isValid() || StartI < BI->First)
146 BI->First = StartI;
158 if (!BI->First.isValid() || StartI < BI->First)
159 BI->First = StartI
[all...] |
| /external/llvm/include/llvm/Support/ |
| 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/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 161 BranchInst *BI = dyn_cast<BranchInst>(LatchBlock->getTerminator());
163 if (!BI || BI->isUnconditional()) {
244 bool ContinueOnTrue = L->contains(BI->getSuccessor(0));
245 BasicBlock *LoopExit = BI->getSuccessor(ContinueOnTrue);
|
| BypassSlowDivision.cpp | 250 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth);
251 if (BI == BypassWidths.end())
255 IntegerType *BT = IntegerType::get(J->getContext(), BI->second);
|
| CloneFunction.cpp | 116 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
117 BI != BE; ++BI) {
118 const BasicBlock &BB = *BI;
303 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
304 if (BI->isConditional()) {
306 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
309 Value *V = VMap[BI->getCondition()];
315 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
399 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end()
[all...] |
| FlattenCFG.cpp | 178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI; BI != BE;) {
179 Instruction *CI = BI++;
240 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator());
241 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition());
246 BI->swapSuccessors();
358 for (BasicBlock::iterator BI = PBI2, BE = PTI2; BI != BE; ++BI) {
359 if (BI->mayReadFromMemory() || BI->mayWriteToMemory())
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/ |
| StringTest.java | 71 public void test_Constructor$BI() {
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/ |
| DatagramPacketTest.java | 36 public void test_Constructor$BI() {
|
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 257 typename BlockDataMapTy::iterator BI = D.getBlockDataMap().find(B);
258 if(BI == D.getBlockDataMap().end()) {
260 BI = D.getBlockDataMap().insert( std::make_pair(B,ValTy()) ).first;
266 Merge(V, BI->second);
269 BI->second.copyValues(V);
|
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 40 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
42 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
46 ExitingBlocks.push_back(*BI);
74 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI)
76 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 | 455 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
456 if (!BI->isConditional())
459 CountedExitBranch = BI;
546 MachineBasicBlock::iterator BI = I;
570 if (I != BI && clobbersCTR(I)) {
574 BI->getParent()->getNumber() << " (" <<
575 BI->getParent()->getFullName() << ") instruction " <<
576 *BI << "\n");
591 BI->getParent()->getNumber() << " (" <<
592 BI->getParent()->getFullName() << ") instruction " <
[all...] |
