| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| pthread_mutex_consistent.c | 49 * unlocked. The next owner of this mutex acquires the mutex with an error return of
67 * mutex, the next owner acquires the lock with an EOWNERDEAD return code.
103 * The next two internal support functions depend on only being
128 robust->next = NULL;
134 robust->next = *list;
150 if (robust->next != NULL)
152 robust->next->prev = robust->prev;
156 robust->prev->next = robust->next;
160 *list = robust->next;
[all...] |
| ptw32_MCS_lock.c | 165 node->next = 0; /* initially, no successor */
174 pred->next = node;
195 ptw32_mcs_local_node_t *next = local
197 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */
199 if (0 == next)
214 next = (ptw32_mcs_local_node_t *)
215 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */
219 ptw32_mcs_flag_set(&next->readyFlag);
234 node->next = 0; /* initially, no successor */
262 new_node->next = 0
[all...] |
| /external/chromium_org/testing/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
87 QueueNode<E>* next = node->next(); local
90 node = next;
92 next = node->next();
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions
93 stage->next->tri( stage->next, &tmp );
96 stage->next->tri( stage->next, header );
145 stage->next->flush( stage->next, flags );
151 stage->next->reset_stipple_counter( stage->next );
173 twoside->stage.next = NULL
[all...] |
| draw_pipe_wide_line.c | 15 * next paragraph) shall be included in all copies or substantial portions
143 stage->next->tri( stage->next, &tri );
148 stage->next->tri( stage->next, &tri );
178 stage->next->flush( stage->next, flags );
191 stage->next->reset_stipple_counter( stage->next );
210 wide->stage.next = NULL
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.h | 91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
155 Item *next; member in class:nv50_ir::DLList::Item
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; } function in class:nv50_ir::DLList::Iterator
391 void next() { if (pos < size) { ++pos; nextValid(); } } function in class:nv50_ir::ArrayList
[all...] |
| /external/chromium_org/tools/memory_watcher/scripts/ |
| memtrace.pl | 73 next;
76 next;
79 next;
84 next;
87 next;
90 next;
93 next;
96 next;
99 next;
102 next;
[all...] |
| /external/clang/test/CodeGenObjCXX/ |
| literals.mm | 23 // CHECK-NEXT: call void @_ZN1XC1Ev
24 // CHECK-NEXT: [[OBJECT0:%[a-zA-Z0-9.]+]] = invoke i8* @_ZNK1XcvP11objc_objectEv
30 // CHECK-NEXT: invoke void @_ZN1YC1Ev
47 // CHECK-NEXT: call void @_ZN1XD1Ev
50 // CHECK-NEXT: ret void
70 // CHECK-NEXT: call void @_ZN1XC1Ev
71 // CHECK-NEXT: [[OBJECT0:%[a-zA-Z0-9.]+]] = invoke i8* @_ZNK1XcvP11objc_objectEv
77 // CHECK-NEXT: invoke void @_ZN1YC1Ev
94 // CHECK-NEXT: call void @_ZN1XD1Ev
97 // CHECK-NEXT: ret voi
[all...] |
| /external/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/libvpx/libvpx/third_party/googletest/src/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.c | 206 signed char next; member in struct:vp8_token_state
240 int next; local
285 tokens[eob][0].next = 16;
289 next = eob;
302 error0 = tokens[next][0].error;
303 error1 = tokens[next][1].error;
305 rate0 = tokens[next][0].rate;
306 rate1 = tokens[next][1].rate;
309 if (next < 16)
314 mb->token_costs[type][band][pt][tokens[next][0].token]
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encodemb.c | 107 int next; member in struct:vp9_token_state
158 int rc, x, next, i; local
208 tokens[eob][0].next = default_eob;
212 next = eob;
226 error0 = tokens[next][0].error;
227 error1 = tokens[next][1].error;
229 rate0 = tokens[next][0].rate;
230 rate1 = tokens[next][1].rate;
233 if (next < default_eob) {
238 [tokens[next][0].token]
[all...] |
| /external/llvm/test/CodeGen/SystemZ/ |
| int-cmp-08.ll | 9 ; CHECK-NEXT: jl
21 ; CHECK-NEXT: jl
34 ; CHECK-NEXT: jl
44 ; Check the next doubleword up, which needs separate address logic.
50 ; CHECK-NEXT: jl
64 ; CHECK-NEXT: jl
78 ; CHECK-NEXT: jl
88 ; Check the next doubleword down, which needs separate address logic.
94 ; CHECK-NEXT: jl
108 ; CHECK-NEXT: j
[all...] |
| int-cmp-22.ll | 9 ; CHECK-NEXT: jl
22 ; CHECK-NEXT: jle
35 ; CHECK-NEXT: jl
48 ; CHECK-NEXT: jl
61 ; CHECK-NEXT: jl
74 ; CHECK-NEXT: jl
84 ; Check the next halfword up, which needs separate address logic,
89 ; CHECK-NEXT: jl
104 ; CHECK-NEXT: jl
119 ; CHECK-NEXT: j
[all...] |
| int-cmp-02.ll | 22 ; CHECK-NEXT: jl
35 ; CHECK-NEXT: jl
45 ; Check the next word up, which should use CY instead of C.
49 ; CHECK-NEXT: jl
63 ; CHECK-NEXT: jl
73 ; Check the next word up, which needs separate address logic.
79 ; CHECK-NEXT: jl
93 ; CHECK-NEXT: jl
107 ; CHECK-NEXT: jl
117 ; Check the next word down, which needs separate address logic
[all...] |
| /external/llvm/test/Transforms/BBVectorize/X86/ |
| loop1.ll | 14 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
33 %indvars.iv.next = add i64 %indvars.iv, 1
34 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
38 ; CHECK-NEXT: insertelement
39 ; CHECK-NEXT: fadd <2 x double>
40 ; CHECK-NEXT: insertelement
41 ; CHECK-NEXT: insertelement
42 ; CHECK-NEXT: fadd <2 x double>
43 ; CHECK-NEXT: insertelement
44 ; CHECK-NEXT: fmul <2 x double
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| 2012-04-23-Neon-Intrinsics.ll | 11 ; CHECK-NEXT: ret <4 x i32> zeroinitializer
19 ; CHECK-NEXT: %a = sext <4 x i16> %x to <4 x i32>
20 ; CHECK-NEXT: ret <4 x i32> %a
28 ; CHECK-NEXT: ret <4 x i32> <i32 6, i32 6, i32 6, i32 6>
36 ; CHECK-NEXT: ret <4 x i32> <i32 -1, i32 -1, i32 -1, i32 -1>
44 ; CHECK-NEXT: ret <4 x i32> <i32 65535, i32 65535, i32 65535, i32 65535>
53 ; CHECK-NEXT: %a = tail call <4 x i32> @llvm.arm.neon.vmulls.v4i32(<4 x i16> <i16 2, i16 2, i16 2, i16 2>, <4 x i16> %x) [[NUW:#[0-9]+]]
54 ; CHECK-NEXT: ret <4 x i32> %a
63 ; CHECK-NEXT: %b = add <4 x i32> %x, <i32 6, i32 6, i32 6, i32 6>
64 ; CHECK-NEXT: ret <4 x i32> %
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions
93 stage->next->tri( stage->next, &tmp );
96 stage->next->tri( stage->next, header );
145 stage->next->flush( stage->next, flags );
151 stage->next->reset_stipple_counter( stage->next );
173 twoside->stage.next = NULL
[all...] |
| draw_pipe_wide_line.c | 15 * next paragraph) shall be included in all copies or substantial portions
143 stage->next->tri( stage->next, &tri );
148 stage->next->tri( stage->next, &tri );
178 stage->next->flush( stage->next, flags );
191 stage->next->reset_stipple_counter( stage->next );
210 wide->stage.next = NULL
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.h | 91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
155 Item *next; member in class:nv50_ir::DLList::Item
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; } function in class:nv50_ir::DLList::Iterator
391 void next() { if (pos < size) { ++pos; nextValid(); } } function in class:nv50_ir::ArrayList
[all...] |
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode * next() { return next_; } function in class:QueueNode
58 const QueueNode * next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E> * next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowContextWrapper.java | 154 * Non-Android accessor that delegates to the application to consume and return the next {@code Intent} on the
157 * @return the next started {@code Intent} for an activity
164 * Non-Android accessor that delegates to the application to return (without consuming) the next {@code Intent} on
167 * @return the next started {@code Intent} for an activity
174 * Non-Android accessor that delegates to the application to consume and return the next {@code Intent} on the
177 * @return the next started {@code Intent} for a service
192 * Return (without consuming) the next {@code Intent} on the started services stack.
194 * @return the next started {@code Intent} for a service
201 * Non-Android accessor that delegates to the application to return the next {@code Intent} to stop
204 * @return {@code Intent} for the next service requested to be stoppe
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Random.java | 89 protected synchronized int next(int bits) { method in class:Random
98 return next(1) != 0;
123 return ((((long) next(26) << 27) + next(27)) / (double) (1L << 53));
131 return (next(24) / 16777216f);
166 return next(32);
178 return (int) ((n * (long) next(31)) >> 31);
182 bits = next(31);
192 return ((long) next(32) << 32) + next(32)
[all...] |
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
87 QueueNode<E>* next = node->next(); local
90 node = next;
92 next = node->next();
[all...] |
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_ListTest.java | 119 elem = li.next();
130 assertTrue("listIterator(1)", li.next() == list.get(1));
152 assertTrue("list iterator next(): " + i, li.next() == list
158 assertTrue("list iterator next() exception: " + i, exception);
160 assertTrue("list iterator next() exception: " + i, !exception);
194 Object next = li.next(); local
195 assertTrue("list iterator add(), next(): " + next, next == list.get(1))
[all...] |
