| /external/elfutils/src/ |
| ldscript.y | 186 if ($3 != $3->next)
188 $3->next->group_start = 1;
205 $2->next = $1->next;
206 $$ = $1->next = $2;
221 $$->val.section.input = $3->next;
227 $3->next = NULL;
235 $$->val.section.input->next = NULL;
261 $2->next = $1->next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/i915/ |
| i915_fpc_optimize.c | 15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next)
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], ¤t->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next->FullInstruction.Dst[0].Register.WriteMask)
[all...] |
| /external/mesa3d/src/gallium/drivers/i915/ |
| i915_fpc_optimize.c | 15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next)
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], ¤t->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next->FullInstruction.Dst[0].Register.WriteMask)
[all...] |
| /external/chromium/net/disk_cache/ |
| rankings.cc | 258 node->Data()->next = my_head.value();
264 node->Data()->next = my_tail.value();
281 // y, prev is x and next is z):
286 // 4. r(0, 0), head(0), tail(0) next.Store()
290 // 2. a(x, r), r(a, b), b(a, y), head(x), tail(y) next.Store()
297 // 3. r(r, b), b(b, y), head(b), tail(y) next.Store()
304 // 4. a(x, a), r(0, 0), head(x), tail(a) next.Store()
307 node->Data()->next, node->Data()->prev, list);
312 Addr next_addr(node->Data()->next);
322 CacheRankingsBlock next(backend_->File(next_addr), next_addr)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseIterators.java | 257 * returned (starting point for the next() search); for single-node
263 * Remembers the current node for the next call to gotoMark().
292 * i.e. subsequent call to next() should return END.
320 * Get the next node in the iteration.
322 * @return The next node handle in the iteration, or END if no more
325 public int next() method in class:DTMDefaultBaseIterators.ChildrenIterator
350 * i.e. subsequent call to next() should return END.
391 * Get the next node in the iteration. In this case, we return
394 * @return The next node handle in the iteration, or END.
396 public int next() method in class:DTMDefaultBaseIterators.ParentIterator
470 public int next() method in class:DTMDefaultBaseIterators.TypedChildrenIterator
559 public int next() method in class:DTMDefaultBaseIterators.NamespaceChildrenIterator
625 public int next() method in class:DTMDefaultBaseIterators.NamespaceIterator
664 public int next() method in class:DTMDefaultBaseIterators.TypedNamespaceIterator
728 public int next() method in class:DTMDefaultBaseIterators.RootIterator
765 public int next() method in class:DTMDefaultBaseIterators.TypedRootIterator
849 public int next() method in class:DTMDefaultBaseIterators.NamespaceAttributeIterator
896 public int next() method in class:DTMDefaultBaseIterators.FollowingSiblingIterator
930 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingSiblingIterator
1002 public int next() method in class:DTMDefaultBaseIterators.AttributeIterator
1065 public int next() method in class:DTMDefaultBaseIterators.TypedAttributeIterator
1150 public int next() method in class:DTMDefaultBaseIterators.PrecedingSiblingIterator
1194 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingSiblingIterator
1349 public int next() method in class:DTMDefaultBaseIterators.PrecedingIterator
1425 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingIterator
1529 public int next() method in class:DTMDefaultBaseIterators.FollowingIterator
1565 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingIterator
1709 public int next() method in class:DTMDefaultBaseIterators.AncestorIterator
1712 int next = _currentNode; local
1872 public int next() method in class:DTMDefaultBaseIterators.DescendantIterator
1944 public int next() method in class:DTMDefaultBaseIterators.TypedDescendantIterator
1998 public int next() method in class:DTMDefaultBaseIterators.NthDescendantIterator
2134 public int next() method in class:DTMDefaultBaseIterators.SingletonIterator
2170 public int next() method in class:DTMDefaultBaseIterators.TypedSingletonIterator
[all...] |
| /external/chromium_org/base/win/ |
| enum_variant_unittest.cc | 33 EXPECT_EQ(S_FALSE, ev->Next(1, &out_element, &out_received));
70 EXPECT_EQ(S_OK, ev->Next(1, &out_element, &out_received));
75 EXPECT_EQ(S_OK, ev->Next(1, &out_element, &out_received));
79 EXPECT_EQ(S_FALSE, ev->Next(1, &out_element, &out_received));
84 EXPECT_EQ(S_OK, ev->Next(3, out_elements, &out_received));
92 EXPECT_EQ(S_FALSE, ev->Next(1, &out_element, &out_received));
98 EXPECT_EQ(S_FALSE, ev->Next(1, &out_element, &out_received));
100 EXPECT_EQ(S_OK, ev2->Next(3, out_elements, &out_received));
108 EXPECT_EQ(S_FALSE, ev2->Next(1, &out_element, &out_received));
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_cull.c | 15 * next paragraph) shall be included in all copies or substantial portions
83 /* triangle is not culled, pass to next stage */
84 stage->next->tri( stage->next, header );
106 stage->next->flush( stage->next, flags );
112 stage->next->reset_stipple_counter( stage->next );
134 cull->stage.next = NULL;
|
| draw_pipe_unfilled.c | 15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next->flush( stage->next, flags )
[all...] |
| /external/clang/test/CodeGenCXX/ |
| lambda-expressions.cpp | 69 // CHECK-NEXT: store i32 (i32, i32)*
70 // CHECK-NEXT: ret void
85 // CHECK-NEXT: store i32 [[ARRVAL]]
97 // CHECK-NEXT: ret void
105 // CHECK-NEXT: store i32
106 // CHECK-NEXT: load i32*
107 // CHECK-NEXT: load i32*
108 // CHECK-NEXT: call i32 @"_ZZ1fvENK3$_5clEii"
109 // CHECK-NEXT: ret i32
|
| /external/clang/test/CodeGenObjCXX/ |
| property-reference.mm | 46 // CHECK-NEXT: [[T1:%.*]] = bitcast [[TEST1]]* [[T0]] to i8*
47 // CHECK-NEXT: [[T2:%.*]] = getelementptr inbounds i8* [[T1]], i64 0
48 // CHECK-NEXT: [[T3:%.*]] = bitcast i8* [[T2]] to [[A]]*
49 // CHECK-NEXT: ret [[A]]* [[T3]]
53 // CHECK-NEXT: ret void
75 // CHECK-NEXT: add nsw
77 // CHECK-NEXT: ret void
94 // CHECK-NEXT: add nsw
96 // CHECK-NEXT: ret void
|
| /external/e2fsprogs/lib/ext2fs/ |
| link.c | 40 struct ext2_dir_entry *next; local
54 next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len);
56 (next->inode == 0) &&
57 (offset + curr_rec_len + next->rec_len <= blocksize)) {
58 curr_rec_len += next->rec_len;
78 next = (struct ext2_dir_entry *) (buf + offset +
80 next->inode = 0;
81 next->name_len = 0;
82 ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next);
|
| /external/llvm/test/Analysis/BasicAA/ |
| intrinsics.ll | 9 ; CHECK-NEXT: entry:
10 ; CHECK-NEXT: %a = call <8 x i16> @llvm.arm.neon.vld1.v8i16(i8* %p, i32 16) [[ATTR:#[0-9]+]]
11 ; CHECK-NEXT: call void @llvm.arm.neon.vst1.v8i16(i8* %q, <8 x i16> %y, i32 16)
12 ; CHECK-NEXT: %c = add <8 x i16> %a, %a
23 ; CHECK-NEXT: entry:
24 ; CHECK-NEXT: %q = getelementptr i8* %p, i64 16
25 ; CHECK-NEXT: %a = call <8 x i16> @llvm.arm.neon.vld1.v8i16(i8* %p, i32 16) [[ATTR]]
26 ; CHECK-NEXT: call void @llvm.arm.neon.vst1.v8i16(i8* %q, <8 x i16> %y, i32 16)
27 ; CHECK-NEXT: %c = add <8 x i16> %a, %a
|
| /external/llvm/test/CodeGen/AArch64/ |
| tail-call.ll | 9 ; CHECK-NEXT: // BB
12 ; CHECK-NEXT: b callee_stack0
21 ; CHECK-NEXT: b callee_stack0
33 ; CHECK-NEXT: add sp, sp, #16
34 ; CHECK-NEXT: b callee_stack8
45 ; CHECK-NEXT: add sp, sp, #16
46 ; CHECK-NEXT: b callee_stack8
73 ; CHECK-NEXT: add sp, sp, #32
74 ; CHECK-NEXT: b callee_stack8
|
| /external/llvm/test/DebugInfo/X86/ |
| nondefault-subrange-array.ll | 12 ; CHECK-NEXT: 0x0000002e: DW_AT_name [DW_FORM_strp] ( .debug_str[0x00000041] = "int")
13 ; CHECK-NEXT: 0x00000032: DW_AT_byte_size [DW_FORM_data1] (0x04)
14 ; CHECK-NEXT: 0x00000033: DW_AT_encoding [DW_FORM_data1] (0x05)
17 ; CHECK-NEXT: 0x00000035: DW_AT_type [DW_FORM_ref4] (cu + 0x0026 => {0x00000026})
20 ; CHECK-NEXT: 0x0000003a: DW_AT_type [DW_FORM_ref4] (cu + 0x002d => {0x0000002d})
21 ; CHECK-NEXT: 0x0000003e: DW_AT_lower_bound [DW_FORM_data8] (0xfffffffffffffffd)
22 ; CHECK-NEXT: 0x00000046: DW_AT_upper_bound [DW_FORM_data1] (0x26)
25 ; CHECK-NEXT: 0x00000056: DW_AT_name [DW_FORM_strp] ( .debug_str[0x0000003f] = "x")
26 ; CHECK-NEXT: 0x0000005a: DW_AT_type [DW_FORM_ref4] (cu + 0x0034 => {0x00000034})
|
| /external/mdnsresponder/mDNSCore/ |
| Implementer Notes.txt | 8 perform its next timed operation. When the workload is light, and
13 spends a lot of CPU time working out what to do next, when what it needs
14 to do next should be obvious: Finish processing the big backlog of
33 The value returned from mDNS_Execute() is the next time (in absolute
35 perform its next necessary operation (e.g. transmitting its next
37 time, not the time *interval* between now and the next required call.
40 the interval between now and the next event.
66 time for the next scheduled event.
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_cull.c | 15 * next paragraph) shall be included in all copies or substantial portions
83 /* triangle is not culled, pass to next stage */
84 stage->next->tri( stage->next, header );
106 stage->next->flush( stage->next, flags );
112 stage->next->reset_stipple_counter( stage->next );
134 cull->stage.next = NULL;
|
| /external/skia/tests/ |
| LListTest.cpp | 78 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
119 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
226 iter.next();
229 Iter next(iter);
230 next.next();
242 if (NULL != next.get()) {
243 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
246 REPORTER_ASSERT(reporter, prev.next()->fID == id);
251 newItem.next();
288 Iter next = iter; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLInputStream.h | 36 // [--current--][--next--][--next--] ... [--next--]
93 void splitInto(SegmentedString& next)
95 next = m_first;
100 // the m_last string, |next| is now the last one.
101 m_last = &next;
105 void mergeFrom(SegmentedString& next)
107 m_first.append(next);
108 if (m_last == &next) {
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_program.c | 15 * next paragraph) shall be included in all copies or substantial
57 struct rc_instruction * inst = c->Program.Instructions.Next;
63 inst = inst->Next;
114 for(inst = c->Program.Instructions.Next;
115 inst != &c->Program.Instructions; inst = inst->Next) {
187 inst->Next = after->Next;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| trip-count10.ll | 27 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
28 %i.next = add nsw i64 %i, 1
29 %exitcond = icmp eq i64 %i.next, %n
41 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
42 %i.next = add nsw i64 %i, 1
43 %exitcond = icmp eq i64 %i.next, %n
55 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
56 %i.next = add nsw i64 %i, 1
57 %exitcond = icmp eq i64 %i.next, %n
69 %i = phi i64 [ %i.next, %loop ], [ 0, %entry
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| avx-splat.ll | 5 ; CHECK-NEXT: vpunpckhbw %xmm
6 ; CHECK-NEXT: vpshufd $85
7 ; CHECK-NEXT: vinsertf128 $1
15 ; CHECK-NEXT: vpshufd $85
16 ; CHECK-NEXT: vinsertf128 $1
24 ; CHECK-NEXT: vmovlhps %xmm
25 ; CHECK-NEXT: vinsertf128 $1
36 ; CHECK-NEXT: vinsertf128 $1
51 ; CHECK-NEXT: vpshufd $-1
52 ; CHECK-NEXT: vinsertf128 $
[all...] |
| peep-test-4.ll | 7 ; CHECK-NEXT: je
25 ; CHECK-NEXT: je
43 ; CHECK-NEXT: je
61 ; CHECK-NEXT: je
79 ; CHECK-NEXT: je
97 ; CHECK-NEXT: je
115 ; CHECK-NEXT: addq %rdi, %rax
116 ; CHECK-NEXT: adcq $0, %rsi
117 ; CHECK-NEXT: sete %al
127 ; CHECK-NEXT: sbbq %rcx, %rs
[all...] |
| /external/llvm/test/Transforms/CorrelatedValuePropagation/ |
| basic.ll | 117 i32 -1, label %next
118 ; CHECK: i32 -1, label %next
119 i32 -2, label %next
120 ; CHECK: i32 -2, label %next
131 next:
145 i32 -1, label %next
146 i32 -2, label %next
154 next:
168 i32 -2, label %next
169 i32 -3, label %next
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| fprintf-1.ll | 24 ; CHECK-NEXT: call i32 @fwrite(i8* getelementptr inbounds ([13 x i8]* @hello_world, i32 0, i32 0), i32 12, i32 1, %FILE* %fp)
26 ; CHECK-NEXT: ret void
35 ; CHECK-NEXT: call i32 @fputc(i32 104, %FILE* %fp)
37 ; CHECK-NEXT: ret void
48 ; CHECK-NEXT: call i32 @fwrite(i8* getelementptr inbounds ([13 x i8]* @hello_world, i32 0, i32 0), i32 12, i32 1, %FILE* %fp)
50 ; CHECK-NEXT: ret void
59 ; CHECK-NEXT-IPRINTF: call i32 (%FILE*, i8*, ...)* @fiprintf(%FILE* %fp, i8* getelementptr inbounds ([3 x i8]* @percent_d, i32 0, i32 0), i32 187)
61 ; CHECK-NEXT-IPRINTF: ret void
68 ; CHECK-NEXT-IPRINTF: call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* getelementptr inbounds ([3 x i8]* @percent_f, i32 0, i32 0), double 1.870000e+00)
70 ; CHECK-NEXT-IPRINTF: ret voi
[all...] |
