| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractIteratorTest.java | 58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
104 assertEquals(0, (int) iter.next());
107 assertEquals(1, (int) iter.next());
122 iter.next();
123 fail("next() should throw NoSuchElementException as usual");
129 fail("peek() should still throw NoSuchElementException after next()");
235 assertEquals(0, (int) iter.next());
259 // hasNext/next/peek), but we'll cop out for now, knowing that peek() an
[all...] |
| HashBiMapTest.java | 92 // The next two tests verify that map entries are not accessed after they're
100 iterator.next();
101 iterator.next();
103 iterator.next();
115 iterator.next();
116 iterator.next();
118 iterator.next();
|
| /external/icu4c/test/intltest/ |
| tstnrapi.cpp | 27 if(norm.next()!=0xe4) {
28 dataerrln("error in Normalizer(CharacterIterator).next()");
33 if(copy.next()!=0xac00) {
34 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).next()");
46 if(clone->next()!=0x4e3d) {
47 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next()");
51 errln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next().hashCode()==copy.hashCode()");
103 if(copy.next()!=0x308 || copy.next()!=0x1100) {
135 if(norm.first()!=0x61 || norm.next()!=0x308 || norm.last()!=0x2f800)
[all...] |
| /external/llvm/test/CodeGen/SystemZ/ |
| int-cmp-33.ll | 10 ; CHECK-NEXT: jh
23 ; CHECK-NEXT: jl
32 ; Check the next value up, which can't use CLFHSI.
48 ; CHECK-NEXT: je
61 ; CHECK-NEXT: je
70 ; Check the next value up, which can't use CLFHSI.
85 ; CHECK-NEXT: jh
95 ; Check the next word up, which needs separate address logic,
100 ; CHECK-NEXT: jh
115 ; CHECK-NEXT: j
[all...] |
| int-cmp-35.ll | 10 ; CHECK-NEXT: jl
23 ; CHECK-NEXT: jl
32 ; Check the next value up, which can't use CLGHSI.
48 ; CHECK-NEXT: je
61 ; CHECK-NEXT: je
70 ; Check the next value up, which can't use CLGHSI.
85 ; CHECK-NEXT: jl
95 ; Check the next doubleword up, which needs separate address logic,
100 ; CHECK-NEXT: jl
115 ; CHECK-NEXT: j
[all...] |
| int-cmp-23.ll | 9 ; CHECK-NEXT: jh
22 ; CHECK-NEXT: jl
35 ; CHECK-NEXT: jh
45 ; Check the next halfword up, which needs separate address logic,
50 ; CHECK-NEXT: jh
65 ; CHECK-NEXT: jh
80 ; CHECK-NEXT: jh
|
| /external/llvm/test/CodeGen/X86/ |
| add.ll | 44 ; X32-NEXT: jo
48 ; X64-NEXT: jo
67 ; X32-NEXT: jb
71 ; X64-NEXT: jb
86 ; X32-NEXT: addl 8(%esp), %edx
87 ; X32-NEXT: movl 4(%esp), %eax
88 ; X32-NEXT: ret
103 ; X64-NEXT: setb %dl
122 ; X64-NEXT: setb
145 ; X32-NEXT: set
[all...] |
| divide-by-constant.ll | 11 ; CHECK-NEXT: shrl $21, %eax
12 ; CHECK-NEXT: ret
22 ; CHECK-NEXT: shrl $17, %eax
23 ; CHECK-NEXT: ret
33 ; CHECK-NEXT: imull $171, %eax, %eax
34 ; CHECK-NEXT: shrl $9, %eax
35 ; CHECK-NEXT: ret
|
| select-with-and-or.ll | 10 ; CHECK-NEXT: andps
20 ; CHECK-NEXT: orps
30 ; CHECK-NEXT: andps
40 ; CHECK-NEXT: orps
50 ; CHECK-NEXT: ret
59 ; CHECK-NEXT: ret
70 ; CHECK-NEXT: andps
|
| /external/llvm/test/Transforms/EarlyCSE/ |
| basic.ll | 9 ; CHECK-NEXT: store i32 23, i32* %P
15 ; CHECK-NEXT: %C = zext i8 %V to i32
16 ; CHECK-NEXT: store volatile i32 %C
17 ; CHECK-NEXT: store volatile i32 %C
23 ; CHECK-NEXT: %E = add i32 %C, %C
24 ; CHECK-NEXT: store volatile i32 %E
25 ; CHECK-NEXT: store volatile i32 %E
29 ; CHECK-NEXT: %G = add nuw i32 %C, %C
30 ; CHECK-NEXT: store volatile i32 %G
106 ; CHECK-NEXT: store i32 4
[all...] |
| /external/llvm/test/Transforms/ObjCARC/ |
| retain-block.ll | 97 ; CHECK-NEXT: entry:
98 ; CHECK-NEXT: tail call i8* @objc_retainBlock(i8* %tmp) [[NUW]]
99 ; CHECK-NEXT: @use_pointer(i8* %tmp2)
100 ; CHECK-NEXT: @use_pointer(i8* %tmp2)
101 ; CHECK-NEXT: tail call void @objc_release(i8* %tmp2) [[NUW]], !clang.imprecise_release !0
120 ; CHECK-NEXT: entry:
121 ; CHECK-NEXT: %tmp2 = tail call i8* @objc_retainBlock(i8* %tmp) [[NUW]], !clang.arc.copy_on_escape !0
122 ; CHECK-NEXT: store i8* %tmp2, i8** %z
123 ; CHECK-NEXT: @use_pointer(i8* %tmp2)
124 ; CHECK-NEXT: @use_pointer(i8* %tmp2
[all...] |
| /external/llvm/test/Transforms/SimplifyCFG/ |
| switch-on-const-select.ll | 22 ; CHECK-NEXT: %retval = phi i32 [ 0, %switch ], [ 2, %entry ]
37 ; CHECK-NEXT: entry:
38 ; CHECK-NEXT: tail call void @bees.a() [[NUW:#[0-9]+]]
39 ; CHECK-NEXT: ret i32 0
63 ; CHECK-NEXT: entry:
64 ; CHECK-NEXT: tail call void @bees.b() [[NUW]]
65 ; CHECK-NEXT: ret void
88 ; CHECK-NEXT: entry:
89 ; CHECK-NEXT: tail call void @bees.a() [[NUW]]
90 ; CHECK-NEXT: ret voi
[all...] |
| /frameworks/base/libs/hwui/ |
| PatchCache.cpp | 96 while (i.next()) {
103 BufferBlock* next = block->next; local
105 block = next;
112 while (i.next()) {
145 block->next = mFreeBlocks;
191 block = block->next;
211 previous->next = block->next;
213 mFreeBlocks = block->next;
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| SplineMath.java | 39 double[] next = null; local
48 next = points[pivot + 1];
49 if (x <= next[0]) {
51 double x2 = next[0];
53 double y2 = next[1];
70 curve[i][0] = (float) (next[0]);
71 curve[i][1] = (float) (next[1]);
79 double[] next = null; local
90 next = mPoints[pivot + 1];
92 double x2 = next[0]
[all...] |
| /system/core/sh/ |
| nodetypes | 100 next nodeptr # the next case in list
105 NDEFUN narg # define a function. The "next" field contains
110 next nodeptr # next word in list
120 next nodeptr # next redirection in list
128 next nodeptr # next redirection in list
137 next nodeptr # next redirection in lis
[all...] |
| /art/compiler/dex/ |
| dataflow_iterator.h | 33 * pass through the pre-computed list using Next(). If true, the caller must tell the
35 * Next(had_change) for this. The general idea is that the iterative_ use case means
37 * is made through it with no changes. Note that calling Next(true) does not affect
46 // Return the next BasicBlock* to visit.
47 BasicBlock* Next() {
53 * Return the next BasicBlock* to visit, and tell the iterator whether any change
56 BasicBlock* Next(bool had_change) {
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ChildIterator.java | 77 * Returns the next node in the set and advances the position of the
81 * @return The next <code>Node</code> in the set being iterated over, or
89 int next; local
91 m_lastFetched = next = (DTM.NULL == m_lastFetched)
95 // m_lastFetched = next;
96 if (DTM.NULL != next)
99 return next;
|
| SelfIteratorNoPredicate.java | 66 * Returns the next node in the set and advances the position of the
70 * @return The next <code>Node</code> in the set being iterated over, or
78 int next; local
80 m_lastFetched = next = (DTM.NULL == m_lastFetched)
84 // m_lastFetched = next;
85 if (DTM.NULL != next)
89 return next;
|
| /external/chromium_org/chrome/browser/chromeos/contacts/ |
| contact.proto | 17 // Next ID to use: 16
48 // Next ID to use: 3
60 // Next ID to use: 4
68 // Next ID to use: 4
76 // Next ID to use: 4
84 // Next ID to use: 5
107 // Next ID to use: 3
|
| /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/ |
| glcpp.h | 11 * The above copyright notice and this permission notice (including the next
40 struct string_node *next; member in struct:string_node
100 struct token_node *next; member in struct:token_node
111 struct argument_node *next; member in struct:argument_node
143 struct expansion_node *next; member in struct:expansion_node
155 struct skip_node *next; member in struct:skip_node
161 struct active_list *next; member in struct:active_list
|
| /external/chromium_org/v8/tools/ |
| consarray.js | 56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
72 * Returns the current item, moves to the next one.
74 ConsArray.prototype.next = function() {
77 this.currCell_ = this.currCell_.next;
89 ConsArray.Cell = function(data, next) {
91 this.next = next;
|
| /external/clang/test/CodeGenCXX/ |
| static-data-member.cpp | 47 // CHECK-NEXT: store i32 [[TMP]], i32* @_ZN5test212_GLOBAL__N_11AIiE1xE, align 4
48 // CHECK-NEXT: ret void
65 // CHECK-NEXT: [[UNINITIALIZED:%.*]] = icmp eq i8 [[GUARDBYTE]], 0
66 // CHECK-NEXT: br i1 [[UNINITIALIZED]]
68 // CHECK-NEXT: store i32 [[TMP]], i32* @_ZN5test31AIiE1xE, align 4
69 // CHECK-NEXT: store i64 1, i64* @_ZGVN5test31AIiE1xE
70 // CHECK-NEXT: br label
|
| /external/e2fsprogs/lib/e2p/ |
| mntopts.c | 103 char *cp, *buf, *next; local
116 next = skip_over_word(cp);
117 if (*next == 0)
118 next = 0;
120 *next = 0;
143 cp = next ? next+1 : 0;
|
| /external/llvm/test/CodeGen/PowerPC/ |
| ctrloop-fp64.ll | 41 %index.i = phi i32 [ 0, %entry ], [ %index.next.i, %vector.body.i ]
42 %next.gep.i = getelementptr [8000 x i64]* @data64, i32 0, i32 %index.i
43 %1 = bitcast i64* %next.gep.i to <2 x i64>*
45 %next.gep.sum24.i = or i32 %index.i, 2
46 %2 = getelementptr [8000 x i64]* @data64, i32 0, i32 %next.gep.sum24.i
49 %index.next.i = add i32 %index.i, 4
50 %4 = icmp eq i32 %index.next.i, 8000
|
| /external/llvm/test/DebugInfo/X86/ |
| empty-array.ll | 10 ; CHECK-NEXT: DW_AT_name
11 ; CHECK-NEXT: DW_AT_byte_size [DW_FORM_data1] (0x04)
12 ; CHECK-NEXT: DW_AT_encoding [DW_FORM_data1] (0x05)
15 ; CHECK-NEXT: DW_AT_type [DW_FORM_ref4] (cu + 0x0026 => {0x00000026})
18 ; CHECK-NEXT: DW_AT_type [DW_FORM_ref4] (cu + 0x002d => {0x0000002d})
22 ; CHECK-NEXT: DW_AT_name [DW_FORM_strp] ( .debug_str[0x0000003f] = "x")
23 ; CHECK-NEXT: DW_AT_type [DW_FORM_ref4] (cu + 0x0034 => {0x00000034})
|
