| /lib/ |
| D | list_debug.c | 24 struct list_head *next) in __list_add() argument
26 WARN(next->prev != prev, in __list_add()
29 prev, next->prev, next); in __list_add()
30 WARN(prev->next != next, in __list_add()
33 next, prev->next, prev); in __list_add()
34 WARN(new == prev || new == next, in __list_add()
36 new, prev, next); in __list_add()
37 next->prev = new; in __list_add()
38 new->next = next; in __list_add()
40 prev->next = new; in __list_add()
[all …]
|
| D | list_sort.c | 29 tail->next = a; in merge()
30 a = a->next; in merge()
32 tail->next = b; in merge()
33 b = b->next; in merge()
35 tail = tail->next; in merge()
37 tail->next = a?:b; in merge()
38 return head.next; in merge()
60 tail->next = a; in merge_and_restore_back_links()
62 a = a->next; in merge_and_restore_back_links()
64 tail->next = b; in merge_and_restore_back_links()
[all …]
|
| D | plist.c | 36 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
40 t, t->next, t->prev, in plist_check_prev_next()
41 p, p->next, p->prev, in plist_check_prev_next()
42 n, n->next, n->prev); in plist_check_prev_next()
47 struct list_head *prev = top, *next = top->next; in plist_check_list() local
49 plist_check_prev_next(top, prev, next); in plist_check_list()
50 while (next != top) { in plist_check_list()
51 prev = next; in plist_check_list()
52 next = prev->next; in plist_check_list()
53 plist_check_prev_next(top, prev, next); in plist_check_list()
[all …]
|
| D | ioremap.c | 75 unsigned long next; in ioremap_pmd_range() local
82 next = pmd_addr_end(addr, end); in ioremap_pmd_range()
85 ((next - addr) == PMD_SIZE) && in ioremap_pmd_range()
92 if (ioremap_pte_range(pmd, addr, next, phys_addr + addr, prot)) in ioremap_pmd_range()
94 } while (pmd++, addr = next, addr != end); in ioremap_pmd_range()
102 unsigned long next; in ioremap_pud_range() local
109 next = pud_addr_end(addr, end); in ioremap_pud_range()
112 ((next - addr) == PUD_SIZE) && in ioremap_pud_range()
119 if (ioremap_pmd_range(pud, addr, next, phys_addr + addr, prot)) in ioremap_pud_range()
121 } while (pud++, addr = next, addr != end); in ioremap_pud_range()
[all …]
|
| D | timerqueue.c | 59 if (!head->next || node->expires.tv64 < head->next->expires.tv64) { in timerqueue_add()
60 head->next = node; in timerqueue_add()
80 if (head->next == node) { in timerqueue_del()
83 head->next = rbn ? in timerqueue_del()
88 return head->next != NULL; in timerqueue_del()
103 struct rb_node *next; in timerqueue_iterate_next() local
107 next = rb_next(&node->node); in timerqueue_iterate_next()
108 if (!next) in timerqueue_iterate_next()
110 return container_of(next, struct timerqueue_node, node); in timerqueue_iterate_next()
|
| D | llist.c | 44 new_last->next = first = ACCESS_ONCE(head->first); in llist_add_batch()
67 struct llist_node *entry, *old_entry, *next; in llist_del_first() local
74 next = READ_ONCE(entry->next); in llist_del_first()
75 entry = cmpxchg(&head->first, old_entry, next); in llist_del_first()
97 head = head->next; in llist_reverse_order()
98 tmp->next = new_head; in llist_reverse_order()
|
| D | klist.c | 380 struct klist_node *next; in klist_next() local
386 next = to_klist_node(last->n_node.next); in klist_next()
390 next = to_klist_node(i->i_klist->k_list.next); in klist_next()
393 while (next != to_klist_node(&i->i_klist->k_list)) { in klist_next()
394 if (likely(!knode_dead(next))) { in klist_next()
395 kref_get(&next->n_ref); in klist_next()
396 i->i_cur = next; in klist_next()
399 next = to_klist_node(next->n_node.next); in klist_next()
|
| D | cpumask.c | 59 int next; in cpumask_next_wrap() local
62 next = cpumask_next(n, mask); in cpumask_next_wrap()
64 if (wrap && n < start && next >= start) { in cpumask_next_wrap()
67 } else if (next >= nr_cpumask_bits) { in cpumask_next_wrap()
73 return next; in cpumask_next_wrap()
|
| D | rhashtable.c | 165 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
171 next = rht_dereference_bucket(entry->next, old_tbl, old_hash); in rhashtable_rehash_one()
173 if (rht_is_a_nulls(next)) in rhashtable_rehash_one()
176 pprev = &entry->next; in rhashtable_rehash_one()
190 RCU_INIT_POINTER(entry->next, head); in rhashtable_rehash_one()
195 rcu_assign_pointer(*pprev, next); in rhashtable_rehash_one()
477 RCU_INIT_POINTER(obj->next, head); in rhashtable_insert_slow()
607 p = rht_dereference_bucket_rcu(p->next, tbl, iter->slot); in rhashtable_walk_next()
608 goto next; in rhashtable_walk_next()
620 next: in rhashtable_walk_next()
[all …]
|
| D | oid_registry.c | 83 goto next; in look_up_OID()
87 goto next; in look_up_OID()
91 next: in look_up_OID()
|
| D | iov_iter.c | 647 __wsum sum, next; in csum_and_copy_from_iter() local
658 next = csum_and_copy_from_user(v.iov_base, in csum_and_copy_from_iter()
662 sum = csum_block_add(sum, next, off); in csum_and_copy_from_iter()
668 next = csum_partial_copy_nocheck(p + v.bv_offset, in csum_and_copy_from_iter()
672 sum = csum_block_add(sum, next, off); in csum_and_copy_from_iter()
675 next = csum_partial_copy_nocheck(v.iov_base, in csum_and_copy_from_iter()
678 sum = csum_block_add(sum, next, off); in csum_and_copy_from_iter()
691 __wsum sum, next; in csum_and_copy_to_iter() local
702 next = csum_and_copy_to_user((from += v.iov_len) - v.iov_len, in csum_and_copy_to_iter()
706 sum = csum_block_add(sum, next, off); in csum_and_copy_to_iter()
[all …]
|
| D | stackdepot.c | 69 struct stack_record *next; /* Link in the hashtable */ member
173 for (found = bucket; found; found = found->next) { in find_stack()
260 new->next = *bucket; in depot_save_stack()
|
| D | ts_fsm.c | 141 struct ts_fsm_token *cur = NULL, *next; in fsm_find() local
173 next = &fsm->tokens[tok_idx + 1]; in fsm_find()
175 next = NULL; in fsm_find()
203 if (next == NULL) in fsm_find()
209 while (!match_token(next, data[block_idx])) { in fsm_find()
226 while (!match_token(next, data[block_idx])) { in fsm_find()
|
| D | ts_bm.c | 83 goto next; in bm_find()
89 next: bs = bm->bad_shift[text[shift-i]]; in bm_find()
|
| D | scatterlist.c | 208 struct scatterlist *sgl, *next; in __sg_free_table() local
225 next = sg_chain_ptr(&sgl[max_ents - 1]); in __sg_free_table()
230 next = NULL; in __sg_free_table()
238 sgl = next; in __sg_free_table()
|
| D | vsprintf.c | 2459 char *next; in vsscanf() local
2613 simple_strtol(str, &next, base) : in vsscanf()
2614 simple_strtoll(str, &next, base); in vsscanf()
2617 simple_strtoul(str, &next, base) : in vsscanf()
2618 simple_strtoull(str, &next, base); in vsscanf()
2620 if (field_width > 0 && next - str > field_width) { in vsscanf()
2623 while (next - str > field_width) { in vsscanf()
2628 --next; in vsscanf()
2670 if (!next) in vsscanf()
2672 str = next; in vsscanf()
|
| D | dynamic_debug.c | 694 iter->table = list_entry(ddebug_tables.next, in ddebug_iter_first()
717 iter->table = list_entry(iter->table->link.next, in ddebug_iter_next()
811 .next = ddebug_proc_next,
944 struct ddebug_table *dt = list_entry(ddebug_tables.next, in ddebug_remove_all_tables()
|
| /lib/lzo/ |
| D | lzo1x_decompress_safe.c | 43 size_t t, next; in lzo1x_decompress_safe() local
57 next = t; in lzo1x_decompress_safe()
110 next = t & 3; in lzo1x_decompress_safe()
121 next = t & 3; in lzo1x_decompress_safe()
128 next = t & 3; in lzo1x_decompress_safe()
152 next = get_unaligned_le16(ip); in lzo1x_decompress_safe()
154 m_pos -= next >> 2; in lzo1x_decompress_safe()
155 next &= 3; in lzo1x_decompress_safe()
176 next = get_unaligned_le16(ip); in lzo1x_decompress_safe()
178 m_pos -= next >> 2; in lzo1x_decompress_safe()
[all …]
|
| D | lzo1x_compress.c | 43 next: in lzo1x_1_do_compress()
210 goto next; in lzo1x_1_do_compress()
|
| /lib/zlib_inflate/ |
| D | inftrees.c | 40 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()
|
| D | inflate.c | 38 state->lencode = state->distcode = state->next = state->codes; in zlib_inflateReset()
170 next = strm->next_in; \
181 strm->next_in = next; \
200 hold += (unsigned long)(*next++) << bits; \
320 const unsigned char *next; /* next input */ in zlib_inflate() local
437 memcpy(put, next, copy); in zlib_inflate()
439 next += copy; in zlib_inflate()
472 state->next = state->codes; in zlib_inflate()
473 state->lencode = (code const *)(state->next); in zlib_inflate()
475 ret = zlib_inflate_table(CODES, state->lens, 19, &(state->next), in zlib_inflate()
[all …]
|
| D | inflate.h | 106 code *next; /* next available space in codes[] */ member
|
| /lib/mpi/ |
| D | mpih-mul.c | 387 if (!ctx->next) { in mpihelp_mul_karatsuba_case()
388 ctx->next = kzalloc(sizeof *ctx, GFP_KERNEL); in mpihelp_mul_karatsuba_case()
389 if (!ctx->next) in mpihelp_mul_karatsuba_case()
395 ctx->next) < 0) in mpihelp_mul_karatsuba_case()
414 for (ctx = ctx->next; ctx; ctx = ctx2) { in mpihelp_release_karatsuba_ctx()
415 ctx2 = ctx->next; in mpihelp_release_karatsuba_ctx()
|
| /lib/zlib_deflate/ |
| D | deflate.c | 179 char *next; in zlib_deflateInit2() local
208 next = (char *) mem; in zlib_deflateInit2()
209 next += sizeof(*mem); in zlib_deflateInit2()
210 mem->window_memory = (Byte *) next; in zlib_deflateInit2()
211 next += zlib_deflate_window_memsize(windowBits); in zlib_deflateInit2()
212 mem->prev_memory = (Pos *) next; in zlib_deflateInit2()
213 next += zlib_deflate_prev_memsize(windowBits); in zlib_deflateInit2()
214 mem->head_memory = (Pos *) next; in zlib_deflateInit2()
215 next += zlib_deflate_head_memsize(memLevel); in zlib_deflateInit2()
216 mem->overlay_memory = next; in zlib_deflateInit2()
|
| /lib/842/ |
| D | 842_compress.c | 491 u64 last, next, pad, total; in sw842_compress() local
526 next = get_unaligned((u64 *)p->in); in sw842_compress()
537 if (next == last) { in sw842_compress()
545 if (next == last) /* reached max repeat bits */ in sw842_compress()
549 if (next == 0) in sw842_compress()
558 last = next; in sw842_compress()
|