/external/javassist/src/main/javassist/ |
CtMember.java | 23 CtMember next; // for internal use field in class:CtMember 54 fieldTail.next = this; 65 method.next = methodTail.next; 66 methodTail.next = method; 79 cons.next = consTail.next; 80 consTail.next = cons; 88 field.next = this; // or fieldTail.next 131 final CtMember next() { return next; } method in class:CtMember [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
move.pass.cpp | 65 assert(*next(m.begin(), 0) == 1); 66 assert(*next(m.begin(), 1) == 1); 67 assert(*next(m.begin(), 2) == 1); 68 assert(*next(m.begin(), 3) == 2); 69 assert(*next(m.begin(), 4) == 2); 70 assert(*next(m.begin(), 5) == 2); 71 assert(*next(m.begin(), 6) == 3); 72 assert(*next(m.begin(), 7) == 3); 73 assert(*next(m.begin(), 8) == 3); 102 assert(*next(m.begin(), 0) == 1) [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/multiset.cons/ |
move.pass.cpp | 65 assert(*next(m.begin(), 0) == 1); 66 assert(*next(m.begin(), 1) == 1); 67 assert(*next(m.begin(), 2) == 1); 68 assert(*next(m.begin(), 3) == 2); 69 assert(*next(m.begin(), 4) == 2); 70 assert(*next(m.begin(), 5) == 2); 71 assert(*next(m.begin(), 6) == 3); 72 assert(*next(m.begin(), 7) == 3); 73 assert(*next(m.begin(), 8) == 3); 102 assert(*next(m.begin(), 0) == 1) [all...] |
/external/freetype/src/cache/ |
ftcmru.c | 52 cnode = cnode->next; 59 last->next = node; 60 node->next = first; 65 node->next = node; 83 FTC_MruNode prev, next, last; local 93 cnode = cnode->next; 103 next = node->next; 105 prev->next = next; 126 FTC_MruNode prev, next; local 331 FTC_MruNode first, node, next; local [all...] |
/external/libvpx/libvpx/vpx_dsp/ |
add_noise.c | 48 int next = 0, i, j; local 55 char_dist[next + j] = (int8_t)i; 57 next = next + j; 62 for (; next < 256; ++next) { 63 char_dist[next] = 0;
|
/external/valgrind/memcheck/tests/ |
leak-cases.c | 42 struct _Node* next; member in struct:_Node 48 Node* mk(Node* next) 53 x->next = next; 82 (p6->next)++; // 16/1 possibly lost 88 (p8->next)++; // 16/1 possibly lost 92 (p9->next)++; // 32(16d,16i)/1 definitely lost (double count!)
|
/bionic/libc/bionic/ |
pthread_internal.cpp | 67 thread->next = g_thread_list; 69 if (thread->next != nullptr) { 70 thread->next->prev = thread; 79 if (thread->next != nullptr) { 80 thread->next->prev = thread->prev; 83 thread->prev->next = thread->next; 85 g_thread_list = thread->next; 111 for (pthread_internal_t* t = g_thread_list; t != nullptr; t = t->next) {
|
/external/libchrome/base/trace_event/ |
malloc_dump_provider.cc | 39 const AllocatorDispatch* const next = self->next; local 40 void* ptr = next->alloc_function(next, size, context); 50 const AllocatorDispatch* const next = self->next; local 51 void* ptr = next->alloc_zero_initialized_function(next, n, size, context); 61 const AllocatorDispatch* const next = self->next; local 72 const AllocatorDispatch* const next = self->next; local 83 const AllocatorDispatch* const next = self->next; local 90 const AllocatorDispatch* const next = self->next; local 99 const AllocatorDispatch* const next = self->next; local 112 const AllocatorDispatch* const next = self->next; local 125 const AllocatorDispatch* const next = self->next; local [all...] |
/external/mesa3d/src/intel/vulkan/tests/ |
state_pool_no_free.c | 11 * The above copyright notice and this permission notice (including the next 77 unsigned next[NUM_THREADS]; local 78 memset(next, 0, sizeof(next)); 82 /* First, we find which thread has the highest next element */ 86 if (next[i] >= STATES_PER_THREAD) 89 if (thread_max < jobs[i].offsets[next[i]]) { 90 thread_max = jobs[i].offsets[next[i]]; 95 /* The only way this can happen is if all of the next[] values are at 101 /* That next element had better be higher than the previous highest * [all...] |
/libcore/luni/src/main/java/libcore/util/ |
CollectionUtils.java | 43 private T next; local 47 while (next == null && delegate.hasNext()) { 48 next = delegate.next().get(); 49 if (trim && next == null) { 57 return next != null; 60 @Override public T next() { method 64 T result = next; 66 next = null;
|
/bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
quick_exit.c | 38 struct quick_exit_handler *next; member in struct:quick_exit_handler 62 h->next = handlers; 77 for (h = handlers; NULL != h; h = h->next)
|
/external/skia/fuzz/oss_fuzz/ |
FuzzRegionSetPath.cpp | 20 fuzz->next(&initR1); 22 fuzz->next(&r1); 25 fuzz->next(&r2);
|
/external/skqp/fuzz/oss_fuzz/ |
FuzzRegionSetPath.cpp | 20 fuzz->next(&initR1); 22 fuzz->next(&r1); 25 fuzz->next(&r2);
|
/external/syslinux/core/thread/ |
kill_thread.c | 18 * Muck with the stack so that the next time the thread is run then 28 block->list.next->prev = block->list.prev; 29 block->list.prev->next = block->list.next;
|
/hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/include/ |
viddec_emitter.h | 25 viddec_emitter_wkld next; member in struct:__anon47324 44 cxt->cur.data = cxt->next.data = 0; 45 cxt->cur.max_items = cxt->next.max_items = 0; 46 cxt->cur.num_items = cxt->next.num_items = 0; 47 cxt->cur.result = cxt->next.result = VIDDEC_FW_WORKLOAD_SUCCESS; 50 static inline void viddec_emit_update(viddec_emitter *cxt, uint32_t cur, uint32_t next, uint32_t cur_size, uint32_t next_size) 53 cxt->next.data = (next != 0) ? (viddec_workload_t *)(next | DDR_MEM_MASK): NULL; 55 cxt->next.max_items = (next_size - sizeof(viddec_workload_t))/sizeof(viddec_workload_item_t) [all...] |
/hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/ |
viddec_emit.c | 11 if(emit->next.data != NULL) 13 emit->next.data->num_items = emit->next.num_items; 15 emit->cur.num_items = emit->next.num_items; 16 emit->next.num_items = 0; 21 if(emit->next.data != NULL) 23 emit->next.data->result = emit->next.result; 25 emit->cur.result = emit->next.result; 26 emit->next.result = 0 [all...] |
/hardware/interfaces/graphics/mapper/2.0/ |
IMapper.hal | 79 @callflow(next="*") 115 @callflow(next="*") 131 @callflow(next="*") 172 @callflow(next="unlock") 208 @callflow(next="unlock") 228 @callflow(next="*")
|
/hardware/qcom/data/ipacfg-mgr/msm8998/ipacm/src/ |
IPACM_EvtDispatcher.cpp | 137 tmp = tmp1.next; 159 nw->next = NULL; 172 while(tmp->next) 174 tmp = tmp->next; 176 tmp->next = nw; 193 head = head->next; 195 else if(tmp->next == NULL) 197 prev->next = NULL; 201 prev->next = tmp->next; [all...] |
/libcore/ojluni/src/main/java/sun/misc/ |
CompoundEnumeration.java | 43 private boolean next() { method in class:CompoundEnumeration 54 return next(); 58 if (!next()) {
|
/system/core/property_service/libpropertyinfoserializer/ |
space_tokenizer.h | 29 auto next = std::string(); local 31 next.push_back(*it_++); 36 return next;
|
/toolchain/binutils/binutils-2.27/gold/testsuite/ |
script_test_12a.c | 65 int next = *p & mask; local 66 if (next <= last) 68 last = next;
|
/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
upper_bound.pass.cpp | 48 assert(r == next(m.begin(), 3)); 50 assert(r == next(m.begin(), 3)); 52 assert(r == next(m.begin(), 6)); 54 assert(r == next(m.begin(), 6)); 56 assert(r == next(m.begin(), 9)); 78 assert(r == next(m.begin(), 3)); 80 assert(r == next(m.begin(), 3)); 82 assert(r == next(m.begin(), 6)); 84 assert(r == next(m.begin(), 6)); 86 assert(r == next(m.begin(), 9)) [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
AtomicLongFieldUpdater.java | 189 long prev, next; local 192 next = prev + 1; 193 } while (!compareAndSet(obj, prev, next)); 205 long prev, next; local 208 next = prev - 1; 209 } while (!compareAndSet(obj, prev, next)); 222 long prev, next; local 225 next = prev + delta; 226 } while (!compareAndSet(obj, prev, next)); 238 long prev, next; local 254 long prev, next; local 271 long prev, next; local 291 long prev, next; local 311 long prev, next; local 336 long prev, next; local 361 long prev, next; local [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.ops/ |
upper_bound.pass.cpp | 48 assert(r == next(m.begin(), 3)); 50 assert(r == next(m.begin(), 3)); 52 assert(r == next(m.begin(), 6)); 54 assert(r == next(m.begin(), 6)); 56 assert(r == next(m.begin(), 9)); 78 assert(r == next(m.begin(), 3)); 80 assert(r == next(m.begin(), 3)); 82 assert(r == next(m.begin(), 6)); 84 assert(r == next(m.begin(), 6)); 86 assert(r == next(m.begin(), 9)) [all...] |
/external/libxml2/doc/examples/ |
xpath1.c | 151 xmlChar* next; local 162 next = nsListDup; 163 while(next != NULL) { 165 while((*next) == ' ') next++; 166 if((*next) == '\0') break; 169 prefix = next; 170 next = (xmlChar*)xmlStrchr(next, '='); 171 if(next == NULL) [all...] |