| /lib/ |
| D | llist.c | 29 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch() local
32 new_last->next = first; in llist_add_batch()
33 } while (!try_cmpxchg(&head->first, &first, new_first)); in llist_add_batch()
35 return !first; in llist_add_batch()
57 entry = smp_load_acquire(&head->first); in llist_del_first()
62 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first()
85 entry = smp_load_acquire(&head->first); in llist_del_first_this()
90 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first_this()
|
| D | siphash.c | 116 u64 siphash_1u64(const u64 first, const siphash_key_t *key) in siphash_1u64() argument
119 v3 ^= first; in siphash_1u64()
122 v0 ^= first; in siphash_1u64()
133 u64 siphash_2u64(const u64 first, const u64 second, const siphash_key_t *key) in siphash_2u64() argument
136 v3 ^= first; in siphash_2u64()
139 v0 ^= first; in siphash_2u64()
155 u64 siphash_3u64(const u64 first, const u64 second, const u64 third, in siphash_3u64() argument
159 v3 ^= first; in siphash_3u64()
162 v0 ^= first; in siphash_3u64()
183 u64 siphash_4u64(const u64 first, const u64 second, const u64 third, in siphash_4u64() argument
[all …]
|
| D | kasprintf.c | 17 unsigned int first, second; in kvasprintf() local
22 first = vsnprintf(NULL, 0, fmt, aq); in kvasprintf()
25 p = kmalloc_track_caller(first+1, gfp); in kvasprintf()
29 second = vsnprintf(p, first+1, fmt, ap); in kvasprintf()
30 WARN(first != second, "different return values (%u and %u) from vsnprintf(\"%s\", ...)", in kvasprintf()
31 first, second, fmt); in kvasprintf()
|
| D | plist.c | 75 struct plist_node *first, *iter, *prev = NULL, *last, *reverse_iter; in plist_add() local
85 first = iter = plist_first(head); in plist_add()
86 last = reverse_iter = list_entry(first->prio_list.prev, struct plist_node, prio_list); in plist_add()
106 } while (iter != first); in plist_add()
195 struct plist_node *first, *prio_pos, *node_pos; in plist_test_check() local
202 prio_pos = first = plist_first(&test_head); in plist_test_check()
206 if (node_pos == first) in plist_test_check()
219 BUG_ON(prio_pos->prio_list.next != &first->prio_list); in plist_test_check()
|
| D | bitmap.c | 200 unsigned int first, unsigned int cut, unsigned int nbits) in bitmap_cut() argument
206 if (first % BITS_PER_LONG) { in bitmap_cut()
207 keep = src[first / BITS_PER_LONG] & in bitmap_cut()
208 (~0UL >> (BITS_PER_LONG - first % BITS_PER_LONG)); in bitmap_cut()
214 for (i = first / BITS_PER_LONG; i < len; i++) { in bitmap_cut()
224 dst[first / BITS_PER_LONG] &= ~0UL << (first % BITS_PER_LONG); in bitmap_cut()
225 dst[first / BITS_PER_LONG] |= keep; in bitmap_cut()
|
| D | xarray.c | 783 void *first, *next; in xas_store() local
788 first = xas_create(xas, allow_root); in xas_store()
790 first = xas_load(xas); in xas_store()
794 return first; in xas_store()
798 if ((first == entry) && !xas->xa_sibs) in xas_store()
799 return first; in xas_store()
801 next = first; in xas_store()
826 values += !xa_is_value(first) - !value; in xas_store()
840 first = next; in xas_store()
846 return first; in xas_store()
[all …]
|
| D | sbitmap.c | 713 bool first; in sbitmap_queue_show() local
719 first = true; in sbitmap_queue_show()
721 if (!first) in sbitmap_queue_show()
723 first = false; in sbitmap_queue_show()
|
| D | test_printf.c | 694 const struct software_node first = { .name = "first" }; in fwnode_pointer() local
695 const struct software_node second = { .name = "second", .parent = &first }; in fwnode_pointer()
697 const struct software_node *group[] = { &first, &second, &third, NULL }; in fwnode_pointer()
|
| D | debugobjects.c | 151 obj = hlist_entry(obj_to_free.first, typeof(*obj), node); in fill_pool()
211 if (list->first) { in __alloc_object()
212 obj = hlist_entry(list->first, typeof(*obj), node); in __alloc_object()
307 obj = hlist_entry(obj_to_free.first, typeof(*obj), node); in free_obj_work()
1339 new = hlist_entry(obj_pool.first, typeof(*obj), node); in debug_objects_replace_static_objects()
|
| D | list-test.c | 900 KUNIT_EXPECT_PTR_EQ(test, list.first, &b); in hlist_test_del()
901 KUNIT_EXPECT_PTR_EQ(test, b.pprev, &list.first); in hlist_test_del()
916 KUNIT_EXPECT_PTR_EQ(test, list.first, &b); in hlist_test_del_init()
917 KUNIT_EXPECT_PTR_EQ(test, b.pprev, &list.first); in hlist_test_del_init()
936 KUNIT_EXPECT_PTR_EQ(test, list.first, &b); in hlist_test_add()
|
| D | test_xarray.c | 1753 static noinline void __check_store_range(struct xarray *xa, unsigned long first, in __check_store_range() argument
1757 xa_store_range(xa, first, last, xa_mk_index(first), GFP_KERNEL); in __check_store_range()
1759 XA_BUG_ON(xa, xa_load(xa, first) != xa_mk_index(first)); in __check_store_range()
1760 XA_BUG_ON(xa, xa_load(xa, last) != xa_mk_index(first)); in __check_store_range()
1761 XA_BUG_ON(xa, xa_load(xa, first - 1) != NULL); in __check_store_range()
1764 xa_store_range(xa, first, last, NULL, GFP_KERNEL); in __check_store_range()
|
| D | dynamic_debug.c | 353 static int parse_linerange(struct ddebug_query *query, const char *first) in parse_linerange() argument
355 char *last = strchr(first, '-'); in parse_linerange()
363 if (parse_lineno(first, &query->first_lineno) < 0) in parse_linerange()
|
| D | vsprintf.c | 1201 bool first = true; in bitmap_string() local
1223 if (!first) { in bitmap_string()
1228 first = false; in bitmap_string()
1243 bool first = true; in bitmap_list_string() local
1250 if (!first) { in bitmap_list_string()
1255 first = false; in bitmap_list_string()
|
| D | Kconfig.kgdb | 139 CONFIG_KDB_CONTINUE_CATASTROPHIC == 0 (default). The first time
|
| D | maple_tree.c | 6409 int mtree_insert_range(struct maple_tree *mt, unsigned long first, in mtree_insert_range() argument
6412 MA_STATE(ms, mt, first, last); in mtree_insert_range()
6418 if (first > last) in mtree_insert_range()
7147 unsigned long first = min; in mt_dump_range64() local
7172 first, last, depth + 1, format); in mt_dump_range64()
7175 first, last, depth + 1, format); in mt_dump_range64()
7190 first = last + 1; in mt_dump_range64()
7199 unsigned long first = min; in mt_dump_arange64() local
7234 first, last, depth + 1, format); in mt_dump_arange64()
7249 first = last + 1; in mt_dump_arange64()
|
| D | test_bitmap.c | 1039 unsigned int first; member
1089 bitmap_cut(out, in, t->first, t->cut, t->nbits); in test_bitmap_cut()
|
| D | Kconfig | 34 - The least-significant 32-bit word comes first (within a 64-bit
|
| D | Kconfig.debug | 104 I.e., processors other than the first one may not boot up.
132 Thus, the debugfs or procfs filesystem must first be mounted before
|
| /lib/xz/ |
| D | Kconfig | 52 MicroLZMA is a header format variant where the first byte
|