Home
last modified time | relevance | path

Searched refs:new (Results 1 – 25 of 28) sorted by relevance

12

/lib/
A Derrseq.c80 errseq_t new; in errseq_set() local
87 new += ERRSEQ_CTR_INC; in errseq_set()
90 if (new == old) { in errseq_set()
91 cur = new; in errseq_set()
96 cur = cmpxchg(eseq, old, new); in errseq_set()
179 errseq_t old, new; in errseq_check_and_advance() local
200 new = old | ERRSEQ_SEEN; in errseq_check_and_advance()
201 if (new != old) in errseq_check_and_advance()
202 cmpxchg(eseq, old, new); in errseq_check_and_advance()
203 *since = new; in errseq_check_and_advance()
[all …]
A Dlockref.c17 struct lockref new = old; \
21 new.lock_count))) { \
45 new.count++; in lockref_get()
66 new.count++; in lockref_get_not_zero()
93 new.count--; in lockref_put_return()
97 return new.count; in lockref_put_return()
111 new.count--; in lockref_put_or_lock()
148 new.count++; in lockref_get_not_dead()
A Drbtree_test.c38 while (*new) { in insert()
39 parent = *new; in insert()
41 new = &parent->rb_left; in insert()
43 new = &parent->rb_right; in insert()
56 while (*new) { in insert_cached()
57 parent = *new; in insert_cached()
59 new = &parent->rb_left; in insert_cached()
94 while (*new) { in RB_DECLARE_CALLBACKS_MAX()
95 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX()
119 while (*new) { in insert_augmented_cached()
[all …]
A Dmemcat_p.c12 void **p = a, **new; in __memcat_p() local
23 new = kmalloc_array(nr, sizeof(void *), GFP_KERNEL); in __memcat_p()
24 if (!new) in __memcat_p()
29 new[nr] = *p; in __memcat_p()
31 return new; in __memcat_p()
A Drbtree.c79 new->__rb_parent_color = old->__rb_parent_color; in __rb_rotate_set_parents()
80 rb_set_parent_color(old, new, color); in __rb_rotate_set_parents()
81 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
559 *new = *victim; in rb_replace_node()
563 rb_set_parent(victim->rb_left, new); in rb_replace_node()
565 rb_set_parent(victim->rb_right, new); in rb_replace_node()
566 __rb_change_child(victim, new, parent, root); in rb_replace_node()
576 *new = *victim; in rb_replace_node_rcu()
580 rb_set_parent(victim->rb_left, new); in rb_replace_node_rcu()
582 rb_set_parent(victim->rb_right, new); in rb_replace_node_rcu()
[all …]
A Drefcount.c76 unsigned int new, val = atomic_read(&r->refs); in refcount_dec_not_one() local
85 new = val - 1; in refcount_dec_not_one()
86 if (new > val) { in refcount_dec_not_one()
87 WARN_ONCE(new > val, "refcount_t: underflow; use-after-free.\n"); in refcount_dec_not_one()
91 } while (!atomic_try_cmpxchg_release(&r->refs, &val, new)); in refcount_dec_not_one()
A Dlist_debug.c22 bool __list_add_valid_or_report(struct list_head *new, struct list_head *prev, in __list_add_valid_or_report() argument
35 CHECK_DATA_CORRUPTION(new == prev || new == next, NULL, in __list_add_valid_or_report()
37 new, prev, next)) in __list_add_valid_or_report()
A Datomic64_test.c79 #define XCHG_FAMILY_TEST(bit, init, new) \ argument
81 FAMILY_TEST(TEST_ARGS, bit, xchg, init, init, new, new); \
84 #define CMPXCHG_FAMILY_TEST(bit, init, new, wrong) \ argument
87 init, init, new, init, new); \
89 init, init, init, wrong, new); \
A Dcmpxchg-emu.c25 uintptr_t cmpxchg_emu_u8(volatile u8 *p, uintptr_t old, uintptr_t new) in cmpxchg_emu_u8() argument
39 new32.b[i] = new; in cmpxchg_emu_u8()
A Dbitmap.c284 const unsigned long *old, const unsigned long *new, in __bitmap_replace() argument
291 dst[k] = (old[k] & ~mask[k]) | (new[k] & mask[k]); in __bitmap_replace()
498 const unsigned long *old, const unsigned long *new, in bitmap_remap() argument
507 w = bitmap_weight(new, nbits); in bitmap_remap()
514 set_bit(find_nth_bit(new, nbits, n % w), dst); in bitmap_remap()
546 const unsigned long *new, int bits) in bitmap_bitremap() argument
548 int w = bitmap_weight(new, bits); in bitmap_bitremap()
553 return find_nth_bit(new, bits, n % w); in bitmap_bitremap()
A Dlwq.c27 if (!this && !llist_empty(&q->new)) { in __lwq_dequeue()
30 this = llist_reverse_order(llist_del_all(&q->new)); in __lwq_dequeue()
59 t = llist_del_all(&q->new); in lwq_dequeue_all()
A Dclosure.c206 unsigned old, new, v = atomic_read(&cl->remaining); in __closure_sync_timeout() local
212 new = old + CLOSURE_REMAINING_INITIALIZER; in __closure_sync_timeout()
213 } while ((v = atomic_cmpxchg(&cl->remaining, old, new)) != old); in __closure_sync_timeout()
A Dbtree.c466 unsigned long *new; in btree_insert_level() local
468 new = btree_node_alloc(head, gfp); in btree_insert_level()
469 if (!new) in btree_insert_level()
473 new, level + 1, gfp); in btree_insert_level()
475 mempool_free(new, head->mempool); in btree_insert_level()
479 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level()
480 setval(geo, new, i, bval(geo, node, i)); in btree_insert_level()
A Datomic64.c175 s64 generic_atomic64_xchg(atomic64_t *v, s64 new) in generic_atomic64_xchg() argument
184 v->counter = new; in generic_atomic64_xchg()
A Dstackdepot.c697 struct stack_record *new = in stack_depot_save_flags() local
700 if (new) { in stack_depot_save_flags()
705 list_add_rcu(&new->hash_list, bucket); in stack_depot_save_flags()
706 found = new; in stack_depot_save_flags()
A Dstring_helpers.c738 char *kstrdup_and_replace(const char *src, char old, char new, gfp_t gfp) in kstrdup_and_replace() argument
746 return strreplace(dst, old, new); in kstrdup_and_replace()
984 char *strreplace(char *str, char old, char new) in strreplace() argument
990 *s = new; in strreplace()
A Diov_iter.c1306 const void *dup_iter(struct iov_iter *new, struct iov_iter *old, gfp_t flags) in dup_iter() argument
1308 *new = *old; in dup_iter()
1309 if (iov_iter_is_bvec(new)) in dup_iter()
1310 return new->bvec = kmemdup(new->bvec, in dup_iter()
1311 new->nr_segs * sizeof(struct bio_vec), in dup_iter()
1313 else if (iov_iter_is_kvec(new) || iter_is_iovec(new)) in dup_iter()
1315 return new->__iov = kmemdup(new->__iov, in dup_iter()
1316 new->nr_segs * sizeof(struct iovec), in dup_iter()
A Dalloc_tag.c190 void pgalloc_tag_swap(struct folio *new, struct folio *old) in pgalloc_tag_swap() argument
202 tag_new = __pgalloc_tag_get(&new->page); in pgalloc_tag_swap()
208 if (!get_page_tag_ref(&new->page, &ref_new, &handle_new)) { in pgalloc_tag_swap()
A Ddebugobjects.c1452 struct debug_obj *new = pcpu_alloc(); in debug_objects_replace_static_objects() local
1455 *new = *obj; in debug_objects_replace_static_objects()
1456 hlist_add_head(&new->node, &db->list); in debug_objects_replace_static_objects()
A Dtest_firmware.c399 long new; in __test_dev_config_update_size_t() local
401 ret = kstrtol(buf, 10, &new); in __test_dev_config_update_size_t()
405 *(size_t *)cfg = new; in __test_dev_config_update_size_t()
A DKconfig.kgdb58 intended to for the development of new kgdb stubs
A Dmaple_tree.c1621 unsigned long new) in mas_parent_gap() argument
1640 pgaps[offset] = new; in mas_parent_gap()
1642 if (meta_gap == new) in mas_parent_gap()
1646 if (meta_gap > new) in mas_parent_gap()
1650 } else if (new < meta_gap) { in mas_parent_gap()
1651 new = ma_max_gap(pnode, pgaps, pmt, &meta_offset); in mas_parent_gap()
6812 int __mt_dup(struct maple_tree *mt, struct maple_tree *new, gfp_t gfp) in __mt_dup() argument
6816 MA_STATE(new_mas, new, 0, 0); in __mt_dup()
6849 int mtree_dup(struct maple_tree *mt, struct maple_tree *new, gfp_t gfp) in mtree_dup() argument
6853 MA_STATE(new_mas, new, 0, 0); in mtree_dup()
/lib/math/
A Dprime_numbers.c121 struct primes *new; in expand_to_next_prime() local
137 new = kmalloc(sizeof(*new) + bitmap_size(sz), in expand_to_next_prime()
139 if (!new) in expand_to_next_prime()
145 kfree(new); in expand_to_next_prime()
153 bitmap_fill(new->primes, sz); in expand_to_next_prime()
154 bitmap_copy(new->primes, p->primes, p->sz); in expand_to_next_prime()
155 for (y = 2UL; y < sz; y = find_next_bit(new->primes, sz, y + 1)) in expand_to_next_prime()
156 new->last = clear_multiples(y, new->primes, p->sz, sz); in expand_to_next_prime()
157 new->sz = sz; in expand_to_next_prime()
159 BUG_ON(new->last <= x); in expand_to_next_prime()
[all …]
/lib/kunit/
A DKconfig53 features of KUnit. This test only exists to help new users understand
/lib/crypto/x86/
A Dsha512-avx-asm.S162 # The two new schedule QWORDS are stored at [W_t(t)] and [W_t(t+1)].

Completed in 54 milliseconds

12