| /external/chromium_org/third_party/simplejson/ |
| ordered_dict.py | 33 self.__map = {} # key --> [key, prev, next]
45 key, prev, next = self.__map.pop(key)
46 prev[2] = next
47 next[1] = prev
69 key = reversed(self).next()
71 key = iter(self).next()
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersectionHelper.h | 66 bool isAdjacent(const SkIntersectionHelper& next) {
67 return fContour == next.fContour && fIndex + 1 == next.fIndex;
70 bool isFirstLast(const SkIntersectionHelper& next) {
71 return fContour == next.fContour && fIndex == 0
72 && next.fIndex == fLast - 1;
|
| /external/chromium_org/ui/base/models/ |
| tree_node_iterator.h | 19 // Node* node = iterator.Next();
53 // Returns the next descendant.
54 NodeType* Next() {
69 // Advance to next valid node by skipping over the pruned nodes and the
75 positions_.pop(); // This Position is all processed, move to the next.
80 break; // Now positioned at the next node to be returned.
|
| /external/chromium_org/v8/src/ |
| dateparser-inl.h | 102 token = scanner.Next()) {
115 if (scanner.Peek().IsSymbol('.')) scanner.Next();
120 int n = ReadMilliseconds(scanner.Next());
162 n = scanner.Next().number();
215 in_->Next();
234 DateToken sign_token = scanner->Next();
237 int year = scanner->Next().number();
241 day->Add(scanner->Next().number());
243 return scanner->Next();
247 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...] |
| /external/clang/test/Index/ |
| complete-lambdas.cpp | 21 // CHECK-CC1-NEXT: VarDecl:{ResultType int}{TypedText local} (34)
22 // CHECK-CC1-NEXT: NotImplemented:{ResultType X *}{TypedText this} (40)
23 // CHECK-CC1-NEXT: ParmDecl:{ResultType int}{TypedText zed} (34)
27 // CHECK-CC2-NEXT: NotImplemented:{ResultType X *}{TypedText this} (40)
28 // CHECK-CC2-NEXT: ParmDecl:{ResultType int}{TypedText zed} (34)
32 // CHECK-CC3-NEXT: ParmDecl:{ResultType int}{TypedText zed} (34)
|
| /external/e2fsprogs/debugfs/ |
| ncheck.c | 105 goto next;
111 goto next;
114 goto next;
122 goto next;
131 goto next;
137 next:
|
| /external/e2fsprogs/lib/et/ |
| com_right.c | 51 for (p = list; p; p = p->next) {
62 for (p = list; p; p = p->next) {
95 for (end = list, et = *list; et; end = &et->next, et = et->next)
106 et->next = NULL;
116 et = et->next;
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| AbstractIteratorTest.java | 58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
153 assertEquals(0, (int) iter.next());
177 // hasNext/next), but we'll cop out for now, knowing that
178 // next() both start by invoking hasNext() anyway.
|
| /external/icu4c/common/ |
| uenumimp.h | 61 * This function returns the next element as a UChar *,
67 * @return next element as UChar *,
78 * This function returns the next element as a char *,
84 * @return next element as char *,
124 UEnumNext *next; member in struct:UEnumeration
145 * when a UEnumeration is defined with 'next' pointing to this
|
| /external/iproute2/misc/ |
| nstat.c | 75 struct nstat_ent *next; member in struct:nstat_ent
147 n->next = db;
153 db = db->next;
154 n->next = kern_db;
181 char *next; local
182 if ((next = strchr(p, ' ')) != NULL)
183 *next++ = 0;
184 else if ((next = strchr(p, '\n')) != NULL)
185 *next++ = 0;
195 n->next = db
[all...] |
| /external/llvm/test/Analysis/BasicAA/ |
| noalias-geps.ll | 8 %pi.next = getelementptr i32* %p, i32 1
14 %g = getelementptr i32* %pi.next, i32 1
18 %g2 = getelementptr i32* %pi.next, i32 1
34 %pi.next = getelementptr [2 x i32]* %p, i32 1
40 %g = getelementptr [2 x i32]* %pi.next, i32 1
44 %g2 = getelementptr [2 x i32]* %pi.next, i32 1
|
| /external/llvm/test/Analysis/CostModel/X86/ |
| intrinsic-cost.ll | 11 %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
17 %index.next = add i64 %index, 4
18 %3 = icmp eq i64 %index.next, 1024
39 %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
45 %index.next = add i64 %index, 4
46 %3 = icmp eq i64 %index.next, 1024
|
| /external/llvm/test/CodeGen/AArch64/ |
| fastcc.ll | 40 ; CHECK-NEXT: ret
43 ; CHECK-TAIL-NEXT: ret
80 ; CHECK-NEXT: ret
83 ; CHECK-TAIL-NEXT: ret
119 ; CHECK-NEXT: ret
122 ; CHECK-TAIL-NEXT: ret
|
| sibling-call.ll | 9 ; CHECK-NEXT: // BB
12 ; CHECK-NEXT: b callee_stack0
17 ; CHECK-NEXT: // BB
21 ; CHECK-NEXT: b callee_stack0
42 ; CHECK-NEXT: b callee_stack8
64 ; CHECK-NEXT: b callee_stack8
|
| /external/llvm/test/CodeGen/PowerPC/ |
| crsave.ll | 19 ; PPC32-NEXT: stw 12, 24(31)
21 ; PPC32-NEXT: mtocrf 32, 12
48 ; PPC32-NEXT: stw 12, 24(31)
50 ; PPC32-NEXT: mtocrf 32, 12
51 ; PPC32-NEXT: mtocrf 16, 12
52 ; PPC32-NEXT: mtocrf 8, 12
|
| /external/llvm/test/CodeGen/SPARC/ |
| leafproc.ll | 5 ; CHECK-NEXT: nop
14 ; CHECK-NEXT: or %g0, 1729, %o0
23 ; CHECK-NEXT: ldd {{.*}}, %f0
33 ; CHECK-NEXT: add [[R]], %o2, %o0
46 ; CHECK-NEXT: add {{.*}}, %o0
67 ; CHECK-NEXT: add %sp, 104, %sp
|
| /external/llvm/test/CodeGen/SystemZ/ |
| branch-02.ll | 12 ; CHECK-NEXT: je .L[[LABEL]]
27 ; CHECK-NEXT: jlh .L[[LABEL]]
42 ; CHECK-NEXT: jle .L[[LABEL]]
57 ; CHECK-NEXT: jl .L[[LABEL]]
72 ; CHECK-NEXT: jh .L[[LABEL]]
87 ; CHECK-NEXT: jhe .L[[LABEL]]
|
| /external/llvm/test/CodeGen/X86/ |
| atom-bypass-slow-division.ll | 6 ; CHECK-NEXT: testl $-256, %edx
7 ; CHECK-NEXT: je
19 ; CHECK-NEXT: testl $-256, %edx
20 ; CHECK-NEXT: je
32 ; CHECK-NEXT: testl $-256, %edx
33 ; CHECK-NEXT: je
|
| hipe-prologue.ll | 28 ; X32-Linux-NEXT: cmpl 76(%ebp), %ebx
29 ; X32-Linux-NEXT: jb .LBB1_1
34 ; X32-Linux-NEXT: calll inc_stack_0
38 ; X64-Linux-NEXT: cmpq 144(%rbp), %r14
39 ; X64-Linux-NEXT: jb .LBB1_1
44 ; X64-Linux-NEXT: callq inc_stack_0
|
| /external/llvm/test/Transforms/DeadStoreElimination/ |
| PartialStore.ll | 12 ; CHECK-NEXT: store i32 1234567
43 ; CHECK-NEXT: bitcast
44 ; CHECK-NEXT: store double
68 ; CHECK-NEXT: alloca
69 ; CHECK-NEXT: store i32 20
70 ; CHECK-NEXT: call void @test5a
|
| /external/llvm/test/Transforms/InstCombine/ |
| xor2.ll | 25 ; CHECK-NEXT: and i32 %tmp1, 32
26 ; CHECK-NEXT: or i32 %ovm, 8
27 ; CHECK-NEXT: ret i32
36 ; CHECK-NEXT: and i32 %tmp1, 32
37 ; CHECK-NEXT: or i32 %ovm, 8
38 ; CHECK-NEXT: ret i32
|
| /external/llvm/test/Transforms/LoopRotate/ |
| simplifylatch.ll | 14 %mode.0 = phi i8 [ 0, %entry ], [ %indvar.next, %bb4 ] ; <i8> [#uses=4]
29 %indvar.next = add i8 %mode.0, 1 ; <i8> [#uses=1]
42 ;CHECK-NEXT: %arrayidx1 = getelementptr inbounds i8* %CurPtr, i64 0
43 ;CHECK-NEXT: %0 = load i8* %arrayidx1, align 1
44 ;CHECK-NEXT: %conv2 = sext i8 %0 to i32
45 ;CHECK-NEXT: br label %for.body
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| 2012-10-22-isconsec.ll | 23 %indvars.iv = phi i64 [ 0, %"3.lr.ph" ], [ %indvars.iv.next, %"3" ]
28 %indvars.iv.next = add i64 %indvars.iv, %2
29 %6 = trunc i64 %indvars.iv.next to i32
42 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %"3" ]
47 %indvars.iv.next = add i64 %indvars.iv, 1
48 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| /external/llvm/test/Transforms/LoopVectorize/ARM/ |
| gcc-examples.ll | 20 %indvars.iv = phi i64 [ 0, %0 ], [ %indvars.iv.next, %1 ]
28 %indvars.iv.next = add i64 %indvars.iv, 1
29 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
46 %indvars.iv = phi i64 [ 0, %0 ], [ %indvars.iv.next, %1 ]
52 %indvars.iv.next = add i64 %indvars.iv, 1
53 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| width-detect.ll | 14 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 0, %0 ]
19 %indvars.iv.next = add i64 %indvars.iv, 1
20 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
37 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 0, %0 ]
42 %indvars.iv.next = add i64 %indvars.iv, 1
43 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
