/external/chromium_org/third_party/cython/src/Cython/Compiler/Tests/ |
H A D | TestTreePath.py | 4 from Cython.Compiler.TreePath import find_first, find_all namespace 55 type(find_first(t, "//ReturnStatNode[./NameNode]"))) 63 type(find_first(t, "//DefNode[.//NameNode]//ReturnStatNode"))) 69 type(find_first(t, "//NameNode[@name]")))
|
/external/chromium_org/third_party/cython/src/Cython/ |
H A D | TestUtils.py | 84 self.assertNotEqual(TreePath.find_first(result_tree, path), None, 158 if TreePath.find_first(node, path) is None: 164 if TreePath.find_first(node, path) is not None:
|
/external/llvm/unittests/ADT/ |
H A D | BitVectorTest.cpp | 77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { 96 EXPECT_TRUE(Vec.find_first() == 3); 107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { 398 EXPECT_EQ(50, C.find_first());
|
/external/llvm/lib/CodeGen/ |
H A D | RegisterScavenging.cpp | 67 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) 291 int Survivor = Candidates.find_first(); 340 Survivor = Candidates.find_first();
|
H A D | SpillPlacement.cpp | 312 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) { 392 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n))
|
H A D | StackSlotColoring.cpp | 206 NextColor = AllColors.find_first(); 229 Color = UsedColors.find_first();
|
H A D | StackColoring.cpp | 410 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1; 414 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1;
|
H A D | AggressiveAntiDepBreaker.cpp | 137 DEBUG(for (int r = CriticalPathSet.find_first(); r != -1; 574 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r))
|
H A D | RegAllocGreedy.cpp | 271 for (int i = LiveBundles.find_first(); i >= 0; 1068 for (int i = Cand.LiveBundles.find_first(); i>=0; 1387 for (int i = Cand.LiveBundles.find_first(); i>=0;
|
H A D | MachineVerifier.cpp | 459 for (int Reg = regsReserved.find_first(); Reg>=0; 692 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) {
|
H A D | TargetLoweringBase.cpp | 993 for (int i = SuperRegRC.find_first(); i >= 0; i = SuperRegRC.find_next(i)) {
|
/external/llvm/lib/Target/Mips/ |
H A D | Mips16InstrInfo.cpp | 378 Reg = Available.find_first(); 381 Reg = Candidates.find_first(); 394 SpReg = Available.find_first(); 396 SpReg = Candidates.find_first();
|
H A D | MipsDelaySlotFiller.cpp | 328 for (int R = AllocSet.find_first(); R != -1; R = AllocSet.find_next(R))
|
/external/llvm/include/llvm/ADT/ |
H A D | SparseBitVector.h | 136 /// find_first - Returns the index of the first set bit. 137 int find_first() const { 356 unsigned BitPos = Iter->find_first(); 388 NextSetBitNumber = Iter->find_first(); 792 int find_first() const { 796 return (First.index() * ElementSize) + First.find_first();
|
H A D | SmallBitVector.h | 210 /// find_first - Returns the index of the first set bit, -1 if none 212 int find_first() const { function in class:llvm::SmallBitVector 223 return getPointer()->find_first();
|
H A D | BitVector.h | 156 /// find_first - Returns the index of the first set bit, -1 if none 158 int find_first() const { function in class:llvm::BitVector
|
/external/chromium_org/third_party/cython/src/Cython/Compiler/ |
H A D | TreePath.py | 284 def find_first(node, path): function
|
/external/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 2988 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) { 3259 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) { 3498 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) { 3537 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) { 3543 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { 3553 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { 3577 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { 3611 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { 3624 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { 3636 for (int SJ = ConstrainedLevels.find_first(); [all...] |
/external/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.cpp | 881 for (int s = SC.find_first(); s >= 0; s = SC.find_next(s)) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 205 int i = UsedByIndices.find_first(); 3774 for (int LUIdx = UsedByIndices.find_first(); LUIdx != -1;
|
/external/clang/lib/Sema/ |
H A D | SemaChecking.cpp | 2550 signed notCoveredArg = CoveredArgs.find_first();
|