Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 54) sorted by relevance

123

/lib/
A Dlist_debug.c23 struct list_head *next) in __list_add_valid_or_report() argument
29 CHECK_DATA_CORRUPTION(next->prev != prev, next, in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, prev, in __list_add_valid_or_report()
34 next, prev->next, prev) || in __list_add_valid_or_report()
37 new, prev, next)) in __list_add_valid_or_report()
50 next = entry->next; in __list_del_entry_valid_or_report()
56 CHECK_DATA_CORRUPTION(next == LIST_POISON1, next, in __list_del_entry_valid_or_report()
64 entry, prev->next, prev) || in __list_del_entry_valid_or_report()
65 CHECK_DATA_CORRUPTION(next->prev != entry, next, in __list_del_entry_valid_or_report()
[all …]
A Dlist_sort.c22 tail = &a->next; in merge()
23 a = a->next; in merge()
30 tail = &b->next; in merge()
31 b = b->next; in merge()
58 tail->next = a; in merge_final()
61 a = a->next; in merge_final()
65 tail->next = b; in merge_final()
68 b = b->next; in merge_final()
77 tail->next = b; in merge_final()
90 b = b->next; in merge_final()
[all …]
A Dllist.c33 struct llist_node *entry, *next; in llist_del_first() local
39 next = READ_ONCE(entry->next); in llist_del_first()
40 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first()
60 struct llist_node *entry, *next; in llist_del_first_this() local
67 next = READ_ONCE(entry->next); in llist_del_first_this()
68 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first_this()
87 head = head->next; in llist_reverse_order()
88 tmp->next = new_head; in llist_reverse_order()
A Dplist.c35 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
39 t, t->next, t->prev, in plist_check_prev_next()
40 p, p->next, p->prev, in plist_check_prev_next()
41 n, n->next, n->prev); in plist_check_prev_next()
46 struct list_head *prev = top, *next = top->next; in plist_check_list() local
49 while (next != top) { in plist_check_list()
50 WRITE_ONCE(prev, next); in plist_check_list()
51 WRITE_ONCE(next, prev->next); in plist_check_list()
128 struct plist_node *next; in plist_del() local
130 next = list_entry(node->node_list.next, in plist_del()
[all …]
A Dcpumask.c137 unsigned int next, prev; in cpumask_any_and_distribute() local
142 next = cpumask_next_and_wrap(prev, src1p, src2p); in cpumask_any_and_distribute()
143 if (next < nr_cpu_ids) in cpumask_any_and_distribute()
144 __this_cpu_write(distribute_cpu_mask_prev, next); in cpumask_any_and_distribute()
146 return next; in cpumask_any_and_distribute()
158 unsigned int next, prev; in cpumask_any_distribute() local
162 next = cpumask_next_wrap(prev, srcp); in cpumask_any_distribute()
163 if (next < nr_cpu_ids) in cpumask_any_distribute()
164 __this_cpu_write(distribute_cpu_mask_prev, next); in cpumask_any_distribute()
166 return next; in cpumask_any_distribute()
A Dbootconfig.c171 return node->next ? &xbc_nodes[node->next] : NULL; in xbc_node_get_next()
343 struct xbc_node *next; in xbc_node_find_next_leaf() local
355 if (next) { in xbc_node_find_next_leaf()
356 node = next; in xbc_node_find_next_leaf()
363 while (!node->next) { in xbc_node_find_next_leaf()
419 node->next = 0; in xbc_init_node()
440 while (node->next) in xbc_last_sibling()
613 char *next; in xbc_parse_array() local
627 *__v = next; in xbc_parse_array()
697 char *next; in xbc_parse_kv() local
[all …]
A Dkobject_uevent.c103 while (next <= buf_end && *next != delim) in action_arg_word_end()
107 if (next == buf) in action_arg_word_end()
110 return next; in action_arg_word_end()
144 if (*next != ' ') in kobject_action_args()
148 key = ++next; in kobject_action_args()
152 buf = next; in kobject_action_args()
154 if (!next || next > buf_end || *next != '=') in kobject_action_args()
156 key_len = next - buf; in kobject_action_args()
159 if (++next > buf_end) in kobject_action_args()
162 buf = next; in kobject_action_args()
[all …]
A Dklist.c379 struct klist_node *next; in klist_next() local
385 next = to_klist_node(last->n_node.next); in klist_next()
389 next = to_klist_node(i->i_klist->k_list.next); in klist_next()
392 while (next != to_klist_node(&i->i_klist->k_list)) { in klist_next()
393 if (likely(!knode_dead(next))) { in klist_next()
394 kref_get(&next->n_ref); in klist_next()
395 i->i_cur = next; in klist_next()
398 next = to_klist_node(next->n_node.next); in klist_next()
A Dtimerqueue.c75 struct rb_node *next; in timerqueue_iterate_next() local
79 next = rb_next(&node->node); in timerqueue_iterate_next()
80 if (!next) in timerqueue_iterate_next()
82 return container_of(next, struct timerqueue_node, node); in timerqueue_iterate_next()
A Drhashtable.c248 next = rht_dereference_bucket(entry->next, old_tbl, old_hash); in rhashtable_rehash_one()
250 if (rht_is_a_nulls(next)) in rhashtable_rehash_one()
253 pprev = &entry->next; in rhashtable_rehash_one()
271 rcu_assign_pointer(*pprev, next); in rhashtable_rehash_one()
274 rht_assign_locked(bkt, next); in rhashtable_rehash_one()
517 pprev = &head->next; in rhashtable_lookup_one()
819 goto next; in __rhashtable_walk_find_next()
831 next: in __rhashtable_walk_find_next()
880 p = rcu_dereference(p->next); in rhashtable_walk_next()
1158 struct rhash_head *pos, *next; in rhashtable_free_and_destroy() local
[all …]
A Doid_registry.c80 goto next; in look_up_OID()
84 goto next; in look_up_OID()
88 next: in look_up_OID()
A Ddebugobjects.c163 next_batch = last->next; in pool_move_batch()
171 last->next = dst->objects.first; in pool_move_batch()
172 if (last->next) in pool_move_batch()
173 last->next->pprev = &last->next; in pool_move_batch()
200 struct hlist_node *last, *next; in pool_pop_batch() local
211 next = last->next; in pool_pop_batch()
213 last->next = NULL; in pool_pop_batch()
216 src->objects.first = next; in pool_pop_batch()
217 if (next) in pool_pop_batch()
218 next->pprev = &src->objects.first; in pool_pop_batch()
[all …]
A Dtest_hmm.c885 unsigned long next; in dmirror_migrate_to_system() local
899 for (addr = start; addr < end; addr = next) { in dmirror_migrate_to_system()
906 if (next > vma->vm_end) in dmirror_migrate_to_system()
907 next = vma->vm_end; in dmirror_migrate_to_system()
913 args.end = next; in dmirror_migrate_to_system()
946 unsigned long next; in dmirror_migrate_to_device() local
966 if (next > vma->vm_end) in dmirror_migrate_to_device()
967 next = vma->vm_end; in dmirror_migrate_to_device()
973 args.end = next; in dmirror_migrate_to_device()
1146 unsigned long next; in dmirror_snapshot() local
[all …]
A Dtest_xarray.c248 xa_erase_index(xa, next); in check_xa_mark_1()
1039 u32 next = 0; in check_xa_alloc_3() local
1046 &next, GFP_KERNEL) != 0); in check_xa_alloc_3()
1049 next = 0x3ffd; in check_xa_alloc_3()
1051 &next, GFP_KERNEL) != 0); in check_xa_alloc_3()
1063 &next, GFP_KERNEL) != 0); in check_xa_alloc_3()
1071 next = UINT_MAX; in check_xa_alloc_3()
1087 next = UINT_MAX; in check_xa_alloc_3()
1092 &next, GFP_KERNEL); in check_xa_alloc_3()
1200 xa_mk_value(next)); in check_multi_find_1()
[all …]
A Dts_fsm.c137 struct ts_fsm_token *cur = NULL, *next; in fsm_find() local
169 next = &fsm->tokens[tok_idx + 1]; in fsm_find()
171 next = NULL; in fsm_find()
199 if (next == NULL) in fsm_find()
205 while (!match_token(next, data[block_idx])) { in fsm_find()
222 while (!match_token(next, data[block_idx])) { in fsm_find()
A Dtest_rhashtable.c483 struct rhash_head *pos, *next; in print_ht() local
487 next = !rht_is_a_nulls(pos) ? rht_dereference(pos->next, ht) : NULL; in print_ht()
498 list = rht_dereference(list->next, ht); in print_ht()
506 pos = next, in print_ht()
507 next = !rht_is_a_nulls(pos) ? in print_ht()
508 rht_dereference(pos->next, ht) : NULL; in print_ht()
/lib/lzo/
A Dlzo1x_decompress_safe.c44 size_t t, next; in lzo1x_decompress_safe() local
68 next = t; in lzo1x_decompress_safe()
121 next = t & 3; in lzo1x_decompress_safe()
139 next = t & 3; in lzo1x_decompress_safe()
166 next &= 3; in lzo1x_decompress_safe()
180 next &= 3; in lzo1x_decompress_safe()
206 next &= 3; in lzo1x_decompress_safe()
229 op += next; in lzo1x_decompress_safe()
230 ip += next; in lzo1x_decompress_safe()
253 state = next; in lzo1x_decompress_safe()
[all …]
/lib/math/tests/
A Dprime_numbers_kunit.c22 unsigned long x, last, next; in prime_numbers_test() local
33 next = next_prime_number(last); in prime_numbers_test()
34 KUNIT_ASSERT_EQ_MSG(test, next, x, "next-prime(%lu)", last); in prime_numbers_test()
35 last = next; in prime_numbers_test()
/lib/tests/
A Dtest_list_sort.c84 for (cur = head.next; cur->next != &head; cur = cur->next) { in list_sort_test()
88 KUNIT_ASSERT_PTR_EQ_MSG(test, cur->next->prev, cur, in list_sort_test()
91 cmp_result = cmp(test, cur, cur->next); in list_sort_test()
95 el1 = container_of(cur->next, struct debug_el, list); in list_sort_test()
A Dlist-test.c56 KUNIT_EXPECT_PTR_EQ(test, list.next, &b); in list_test_list_add()
58 KUNIT_EXPECT_PTR_EQ(test, b.next, &a); in list_test_list_add()
70 KUNIT_EXPECT_PTR_EQ(test, list.next, &a); in list_test_list_add_tail()
72 KUNIT_EXPECT_PTR_EQ(test, a.next, &b); in list_test_list_add_tail()
87 KUNIT_EXPECT_PTR_EQ(test, list.next, &b); in list_test_list_del()
142 KUNIT_EXPECT_PTR_EQ(test, &b, list.next); in list_test_list_swap()
145 KUNIT_EXPECT_PTR_EQ(test, &a, b.next); in list_test_list_swap()
148 KUNIT_EXPECT_PTR_EQ(test, &list, a.next); in list_test_list_swap()
205 KUNIT_EXPECT_PTR_EQ(test, &b, a.next); in list_test_list_move()
224 KUNIT_EXPECT_PTR_EQ(test, &a, b.next); in list_test_list_move_tail()
[all …]
/lib/zlib_inflate/
A Dinftrees.c40 code *next; /* next available space in table */ in zlib_inflate_table() local
190 next = *table; /* current table to fill in */ in zlib_inflate_table()
224 next[(huff >> drop) + fill] = this; in zlib_inflate_table()
252 next += min; /* here min is 1 << curr */ in zlib_inflate_table()
273 (*table)[low].val = (unsigned short)(next - *table); in zlib_inflate_table()
292 next = *table; in zlib_inflate_table()
297 next[huff >> drop] = this; in zlib_inflate_table()
A Dinflate.c189 next = strm->next_in; \
200 strm->next_in = next; \
219 hold += (unsigned long)(*next++) << bits; \
334 const unsigned char *next; /* next input */ in zlib_inflate() local
456 memcpy(put, next, copy); in zlib_inflate()
458 next += copy; in zlib_inflate()
492 state->next = state->codes; in zlib_inflate()
493 state->lencode = (code const *)(state->next); in zlib_inflate()
558 state->next = state->codes; in zlib_inflate()
559 state->lencode = (code const *)(state->next); in zlib_inflate()
[all …]
/lib/crypto/mpi/
A Dmpih-mul.c374 if (!ctx->next) { in mpihelp_mul_karatsuba_case()
375 ctx->next = kzalloc(sizeof *ctx, GFP_KERNEL); in mpihelp_mul_karatsuba_case()
376 if (!ctx->next) in mpihelp_mul_karatsuba_case()
382 ctx->next) < 0) in mpihelp_mul_karatsuba_case()
401 for (ctx = ctx->next; ctx; ctx = ctx2) { in mpihelp_release_karatsuba_ctx()
402 ctx2 = ctx->next; in mpihelp_release_karatsuba_ctx()
/lib/zlib_deflate/
A Ddeflate.c197 char *next; in zlib_deflateInit2() local
226 next = (char *) mem; in zlib_deflateInit2()
227 next += sizeof(*mem); in zlib_deflateInit2()
233 mem->window_memory = (Byte *) PTR_ALIGN(next, PAGE_SIZE); in zlib_deflateInit2()
235 mem->window_memory = (Byte *) next; in zlib_deflateInit2()
237 next += zlib_deflate_window_memsize(windowBits); in zlib_deflateInit2()
238 mem->prev_memory = (Pos *) next; in zlib_deflateInit2()
239 next += zlib_deflate_prev_memsize(windowBits); in zlib_deflateInit2()
240 mem->head_memory = (Pos *) next; in zlib_deflateInit2()
241 next += zlib_deflate_head_memsize(memLevel); in zlib_deflateInit2()
[all …]
/lib/842/
A D842_compress.c482 u64 last, next, pad, total; in sw842_compress() local
517 next = get_unaligned((u64 *)p->in); in sw842_compress()
528 if (next == last) { in sw842_compress()
538 if (next == last) /* reached max repeat bits */ in sw842_compress()
542 if (next == 0) in sw842_compress()
551 last = next; in sw842_compress()

Completed in 40 milliseconds

123