| /external/llvm/test/MC/PowerPC/ |
| ppc64-fixup-explicit.s | 13 # CHECK-NEXT: # fixup A - offset: 2, value: target@GOT, kind: fixup_ppc_half16
18 # CHECK-NEXT: # fixup A - offset: 2, value: target@GOT, kind: fixup_ppc_half16ds
23 # CHECK-NEXT: # fixup A - offset: 2, value: target@got@ha, kind: fixup_ppc_half16
28 # CHECK-NEXT: # fixup A - offset: 2, value: target@got@l, kind: fixup_ppc_half16
33 # CHECK-NEXT: # fixup A - offset: 2, value: target@got@h, kind: fixup_ppc_half16
38 # CHECK-NEXT: # fixup A - offset: 2, value: target@got@l, kind: fixup_ppc_half16
43 # CHECK-NEXT: # fixup A - offset: 2, value: target@got@l, kind: fixup_ppc_half16ds
|
| /external/llvm/test/Transforms/InstCombine/ |
| strpbrk-1.ll | 21 ; CHECK-NEXT: ret i8* null
32 ; CHECK-NEXT: ret i8* null
44 ; CHECK-NEXT: ret i8* getelementptr inbounds ([12 x i8]* @hello, i32 0, i32 6)
54 ; CHECK-NEXT: [[VAR:%[a-z]+]] = call i8* @strchr(i8* %str, i32 119)
56 ; CHECK-NEXT: ret i8* [[VAR]]
65 ; CHECK-NEXT: %ret = call i8* @strpbrk(i8* %str, i8* %pat)
67 ; CHECK-NEXT: ret i8* %ret
|
| /external/mesa3d/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/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/wpa_supplicant_8/wpa_supplicant/ |
| blacklist.c | 33 e = e->next;
77 e->next = wpa_s->blacklist;
103 wpa_s->blacklist = e->next;
105 prev->next = e->next;
113 e = e->next;
134 e = e->next;
|
| /libcore/luni/src/main/java/java/lang/ref/ |
| ReferenceQueue.java | 39 * Returns the next available reference from the queue, removing it in the
42 * @return the next available reference, or {@code null} if no reference is
67 * Returns the next available reference from the queue, removing it in the
77 * Returns the next available reference from the queue, removing it in the
84 * @return the next available reference, or {@code null} if no reference
153 Reference<?> next = unenqueued.pendingNext; local
155 list.pendingNext = next;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/ |
| soundfont.h | 33 struct snd_sf_zone *next; /* Link to next */ member in struct:snd_sf_zone
43 struct snd_sf_zone *next_instr; /* Next zone of this instrument */
44 struct snd_sf_zone *next_zone; /* Next zone in play list */
51 struct snd_sf_sample *next; member in struct:snd_sf_sample
58 struct snd_soundfont *next; /* Link to next */ member in struct:snd_soundfont
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/ |
| soundfont.h | 33 struct snd_sf_zone *next; /* Link to next */ member in struct:snd_sf_zone
43 struct snd_sf_zone *next_instr; /* Next zone of this instrument */
44 struct snd_sf_zone *next_zone; /* Next zone in play list */
51 struct snd_sf_sample *next; member in struct:snd_sf_sample
58 struct snd_soundfont *next; /* Link to next */ member in struct:snd_soundfont
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| TreeMapExtendTest.java | [all...] |
| /dalvik/vm/compiler/codegen/mips/ |
| RallocUtil.cpp | 201 int next = *nextTemp; local
203 if (next >= numTemps)
204 next = 0;
205 if (!p[next].inUse && !p[next].live) {
206 dvmCompilerClobber(cUnit, p[next].reg);
207 p[next].inUse = true;
208 p[next].pair = false;
209 *nextTemp = next + 1;
210 return p[next].reg
241 int next = start; local
[all...] |
| /external/chromium/net/data/cache_tests/list_loop3/ |
| contents.txt | 35 next file id: 0
54 next file id: 0
73 next file id: 0
92 next file id: 0
109 next entry: 0xa0010003
128 next: 0x90000000
137 next entry: 0xa0010004
156 next: 0x90000000
165 next entry: 0xa0010005
184 next: 0x9000000
[all...] |
| /external/chromium_org/net/data/cache_tests/list_loop3/ |
| contents.txt | 35 next file id: 0
54 next file id: 0
73 next file id: 0
92 next file id: 0
109 next entry: 0xa0010003
128 next: 0x90000000
137 next entry: 0xa0010004
156 next: 0x90000000
165 next entry: 0xa0010005
184 next: 0x9000000
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_flatshade.c | 15 * next paragraph) shall be included in all copies or substantial portions
126 stage->next->tri( stage->next, &tmp );
144 stage->next->tri( stage->next, &tmp );
164 stage->next->line( stage->next, &tmp );
177 stage->next->line( stage->next, &tmp );
234 stage->next->flush( stage->next, flags )
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkDeque.cpp | 62 Block* next = head->fNext; local
66 head = next;
247 // Due to how reset and next work, next actually returns the current element
248 // pointed to by fPos and then updates fPos to point to the next one.
249 void* SkDeque::Iter::next() { function in class:SkDeque::Iter
252 if (pos) { // if we were valid, try to move to the next setting
253 char* next = pos + fElemSize; local
254 SkASSERT(next <= fCurBlock->fEnd);
255 if (next == fCurBlock->fEnd) { // exhausted this chunk, move to nex
[all...] |
| /external/clang/test/CodeGenCXX/ |
| references.cpp | 160 // CHECK-NEXT: store
161 // CHECK-NEXT: ret
289 // CHECK-NEXT: bitcast
290 // CHECK-NEXT: load
291 // CHECK-NEXT: shl
292 // CHECK-NEXT: ashr
293 // CHECK-NEXT: store i32
294 // CHECK-NEXT: store i32*
296 // CHECK-NEXT: bitcast
297 // CHECK-NEXT: loa
[all...] |
| /external/ipsec-tools/src/racoon/ |
| proposal.h | 69 struct saprop *next; member in struct:saprop
94 struct saproto *next; /* next protocol */ member in struct:saproto
104 struct satrns *next; /* next transform */ member in struct:satrns
117 * v next
125 * (next)
131 * | | (next) | (next)
134 * v (next)
145 struct prop_pair *next; \/* next prop_pair with same proposal # *\/ member in struct:prop_pair
[all...] |
| /external/llvm/test/CodeGen/SystemZ/ |
| branch-04.ll | 11 ; CHECK-NEXT: je .L[[LABEL]]
26 ; CHECK-NEXT: jlh .L[[LABEL]]
41 ; CHECK-NEXT: jle .L[[LABEL]]
56 ; CHECK-NEXT: jl .L[[LABEL]]
71 ; CHECK-NEXT: jh .L[[LABEL]]
86 ; CHECK-NEXT: jhe .L[[LABEL]]
101 ; CHECK-NEXT: jnlh .L[[LABEL]]
116 ; CHECK-NEXT: jne .L[[LABEL]]
131 ; CHECK-NEXT: jnh .L[[LABEL]]
146 ; CHECK-NEXT: jnhe .L[[LABEL]
[all...] |
| int-cmp-03.ll | 9 ; CHECK-NEXT: jl
21 ; CHECK-NEXT: jl
34 ; CHECK-NEXT: jl
44 ; Check the next word up, which should use CLY instead of CL.
48 ; CHECK-NEXT: jl
62 ; CHECK-NEXT: jl
72 ; Check the next word up, which needs separate address logic.
78 ; CHECK-NEXT: jl
92 ; CHECK-NEXT: jl
106 ; CHECK-NEXT: j
[all...] |
| int-cmp-11.ll | 38 ; Check the next value up, which must use CGHI instead.
42 ; CHECK-NEXT: jl
54 ; CHECK-NEXT: jl
62 ; Check the next value up, which must use CGFI.
66 ; CHECK-NEXT: jl
78 ; CHECK-NEXT: jl
86 ; Check the next value up, which must use register comparison.
119 ; Check the next value down, which must use CGHI instead.
123 ; CHECK-NEXT: jl
135 ; CHECK-NEXT: j
[all...] |
| int-cmp-32.ll | 9 ; CHECK-NEXT: jl
22 ; CHECK-NEXT: jle
35 ; CHECK-NEXT: jl
44 ; Check the next value up, which can't use CHSI.
59 ; CHECK-NEXT: jl
72 ; CHECK-NEXT: jl
81 ; Check the next value down, which can't use CHSI.
96 ; CHECK-NEXT: je
109 ; CHECK-NEXT: je
122 ; CHECK-NEXT: j
[all...] |
| int-cmp-34.ll | 9 ; CHECK-NEXT: jl
22 ; CHECK-NEXT: jle
35 ; CHECK-NEXT: jl
44 ; Check the next value up, which can't use CGHSI.
59 ; CHECK-NEXT: jl
72 ; CHECK-NEXT: jl
81 ; Check the next value down, which should be treated as a positive value.
96 ; CHECK-NEXT: je
109 ; CHECK-NEXT: je
122 ; CHECK-NEXT: j
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_flatshade.c | 15 * next paragraph) shall be included in all copies or substantial portions
126 stage->next->tri( stage->next, &tmp );
144 stage->next->tri( stage->next, &tmp );
164 stage->next->line( stage->next, &tmp );
177 stage->next->line( stage->next, &tmp );
234 stage->next->flush( stage->next, flags )
[all...] |
| /external/skia/src/core/ |
| SkDeque.cpp | 62 Block* next = head->fNext; local
66 head = next;
247 // Due to how reset and next work, next actually returns the current element
248 // pointed to by fPos and then updates fPos to point to the next one.
249 void* SkDeque::Iter::next() { function in class:SkDeque::Iter
252 if (pos) { // if we were valid, try to move to the next setting
253 char* next = pos + fElemSize; local
254 SkASSERT(next <= fCurBlock->fEnd);
255 if (next == fCurBlock->fEnd) { // exhausted this chunk, move to nex
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| emplace.pass.cpp | 40 assert(r == next(m.begin()));
42 assert(next(m.begin())->first == 1);
43 assert(next(m.begin())->second == DefaultOnly());
47 assert(r == next(m.begin(), 2));
49 assert(next(m.begin(), 2)->first == 1);
50 assert(next(m.begin(), 2)->second == DefaultOnly());
72 assert(r == next(m.begin()));
101 assert(r == next(m.begin()));
103 assert(next(m.begin())->first == 1);
104 assert(next(m.begin())->second == DefaultOnly())
[all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/io/ |
| zero_copy_stream.h | 60 // input->Next(&buffer, &size);
78 // while (input->Next(&buffer, &size)) {
94 // while (output->Next(&buffer, &size)) {
143 // as repeatedly calling Next() eventually yields a buffer with non-zero
145 virtual bool Next(const void** data, int* size) = 0;
147 // Backs up a number of bytes, so that the next call to Next() returns
148 // data again that was already returned by the last call to Next(). This
150 // to a certain point in the input, then return. If Next() returns a
155 // * The last method called must have been Next()
[all...] |
