| /lib/ |
| D | llist.c | 29 struct llist_node *first; in llist_add_batch() local
32 new_last->next = first = READ_ONCE(head->first); in llist_add_batch()
33 } while (cmpxchg(&head->first, first, new_first) != first); in llist_add_batch()
35 return !first; in llist_add_batch()
57 entry = smp_load_acquire(&head->first); in llist_del_first()
63 entry = cmpxchg(&head->first, old_entry, next); in llist_del_first()
|
| D | siphash.c | 123 u64 siphash_1u64(const u64 first, const siphash_key_t *key) in siphash_1u64() argument
126 v3 ^= first; in siphash_1u64()
129 v0 ^= first; in siphash_1u64()
140 u64 siphash_2u64(const u64 first, const u64 second, const siphash_key_t *key) in siphash_2u64() argument
143 v3 ^= first; in siphash_2u64()
146 v0 ^= first; in siphash_2u64()
162 u64 siphash_3u64(const u64 first, const u64 second, const u64 third, in siphash_3u64() argument
166 v3 ^= first; in siphash_3u64()
169 v0 ^= first; in siphash_3u64()
190 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; in plist_add() local
85 first = iter = plist_first(head); in plist_add()
96 } while (iter != first); in plist_add()
185 struct plist_node *first, *prio_pos, *node_pos; in plist_test_check() local
192 prio_pos = first = plist_first(&test_head); in plist_test_check()
196 if (node_pos == first) in plist_test_check()
209 BUG_ON(prio_pos->prio_list.next != &first->prio_list); in plist_test_check()
|
| D | xarray.c | 776 void *first, *next; in xas_store() local
781 first = xas_create(xas, allow_root); in xas_store()
783 first = xas_load(xas); in xas_store()
787 return first; in xas_store()
791 if ((first == entry) && !xas->xa_sibs) in xas_store()
792 return first; in xas_store()
794 next = first; in xas_store()
819 values += !xa_is_value(first) - !value; in xas_store()
833 first = next; in xas_store()
839 return first; in xas_store()
[all …]
|
| D | logic_pio.c | 23 #define in_range(b, first, len) ((b) >= (first) && (b) < (first) + (len)) argument
|
| D | sbitmap.c | 629 bool first; in sbitmap_queue_show() local
635 first = true; in sbitmap_queue_show()
637 if (!first) in sbitmap_queue_show()
639 first = false; in sbitmap_queue_show()
|
| D | debugobjects.c | 149 obj = hlist_entry(obj_to_free.first, typeof(*obj), node); in fill_pool()
209 if (list->first) { in __alloc_object()
210 obj = hlist_entry(list->first, typeof(*obj), node); in __alloc_object()
309 obj = hlist_entry(obj_to_free.first, typeof(*obj), node); in free_obj_work()
1323 new = hlist_entry(obj_pool.first, typeof(*obj), node); in debug_objects_replace_static_objects()
|
| D | test_xarray.c | 1397 static noinline void __check_store_range(struct xarray *xa, unsigned long first, in __check_store_range() argument
1401 xa_store_range(xa, first, last, xa_mk_index(first), GFP_KERNEL); in __check_store_range()
1403 XA_BUG_ON(xa, xa_load(xa, first) != xa_mk_index(first)); in __check_store_range()
1404 XA_BUG_ON(xa, xa_load(xa, last) != xa_mk_index(first)); in __check_store_range()
1405 XA_BUG_ON(xa, xa_load(xa, first - 1) != NULL); in __check_store_range()
1408 xa_store_range(xa, first, last, NULL, GFP_KERNEL); in __check_store_range()
|
| D | dynamic_debug.c | 350 char *first = words[i+1]; in ddebug_parse_query() local
351 char *last = strchr(first, '-'); in ddebug_parse_query()
358 if (parse_lineno(first, &query->first_lineno) < 0) in ddebug_parse_query()
|
| D | vsprintf.c | 1139 bool first = true; in bitmap_string() local
1161 if (!first) { in bitmap_string()
1166 first = false; in bitmap_string()
1183 bool first = true; in bitmap_list_string() local
1195 if (!first) { in bitmap_list_string()
1200 first = false; in bitmap_list_string()
|
| D | Kconfig.kgdb | 118 CONFIG_KDB_CONTINUE_CATASTROPHIC == 0 (default). The first time
|
| D | Kconfig | 30 - The least-significant 32-bit word comes first (within a 64-bit
|
| D | Kconfig.debug | 93 I.e., processors other than the first one may not boot up.
120 filesystem must first be mounted before making use of this feature.
1306 warning for the first use of unseeded randomness.
|