| /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 | 117 u64 siphash_1u64(const u64 first, const siphash_key_t *key) in siphash_1u64() argument
120 v3 ^= first; in siphash_1u64()
123 v0 ^= first; in siphash_1u64()
134 u64 siphash_2u64(const u64 first, const u64 second, const siphash_key_t *key) in siphash_2u64() argument
137 v3 ^= first; in siphash_2u64()
140 v0 ^= first; in siphash_2u64()
156 u64 siphash_3u64(const u64 first, const u64 second, const u64 third, in siphash_3u64() argument
160 v3 ^= first; in siphash_3u64()
163 v0 ^= first; in siphash_3u64()
184 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 | 781 void *first, *next; in xas_store() local
786 first = xas_create(xas, allow_root); in xas_store()
788 first = xas_load(xas); in xas_store()
792 return first; in xas_store()
796 if ((first == entry) && !xas->xa_sibs) in xas_store()
797 return first; in xas_store()
799 next = first; in xas_store()
824 values += !xa_is_value(first) - !value; in xas_store()
838 first = next; in xas_store()
844 return first; in xas_store()
[all …]
|
| D | logic_pio.c | 24 #define in_range(b, first, len) ((b) >= (first) && (b) < (first) + (len)) argument
|
| D | bitmap.c | 211 unsigned int first, unsigned int cut, unsigned int nbits) in bitmap_cut() argument
217 if (first % BITS_PER_LONG) { in bitmap_cut()
218 keep = src[first / BITS_PER_LONG] & in bitmap_cut()
219 (~0UL >> (BITS_PER_LONG - first % BITS_PER_LONG)); in bitmap_cut()
225 for (i = first / BITS_PER_LONG; i < len; i++) { in bitmap_cut()
235 dst[first / BITS_PER_LONG] &= ~0UL << (first % BITS_PER_LONG); in bitmap_cut()
236 dst[first / BITS_PER_LONG] |= keep; in bitmap_cut()
|
| D | sbitmap.c | 633 bool first; in sbitmap_queue_show() local
639 first = true; in sbitmap_queue_show()
641 if (!first) in sbitmap_queue_show()
643 first = false; in sbitmap_queue_show()
|
| D | debugobjects.c | 154 obj = hlist_entry(obj_to_free.first, typeof(*obj), node); in fill_pool()
214 if (list->first) { in __alloc_object()
215 obj = hlist_entry(list->first, typeof(*obj), node); in __alloc_object()
310 obj = hlist_entry(obj_to_free.first, typeof(*obj), node); in free_obj_work()
1322 new = hlist_entry(obj_pool.first, typeof(*obj), node); in debug_objects_replace_static_objects()
|
| D | dynamic_debug.c | 307 static int parse_linerange(struct ddebug_query *query, const char *first) in parse_linerange() argument
309 char *last = strchr(first, '-'); in parse_linerange()
317 if (parse_lineno(first, &query->first_lineno) < 0) in parse_linerange()
|
| D | test_xarray.c | 1520 static noinline void __check_store_range(struct xarray *xa, unsigned long first, in __check_store_range() argument
1524 xa_store_range(xa, first, last, xa_mk_index(first), GFP_KERNEL); in __check_store_range()
1526 XA_BUG_ON(xa, xa_load(xa, first) != xa_mk_index(first)); in __check_store_range()
1527 XA_BUG_ON(xa, xa_load(xa, last) != xa_mk_index(first)); in __check_store_range()
1528 XA_BUG_ON(xa, xa_load(xa, first - 1) != NULL); in __check_store_range()
1531 xa_store_range(xa, first, last, NULL, GFP_KERNEL); in __check_store_range()
|
| D | test_bitmap.c | 623 unsigned int first; member
673 bitmap_cut(out, in, t->first, t->cut, t->nbits); in test_bitmap_cut()
|
| D | vsprintf.c | 1221 bool first = true; in bitmap_string() local
1243 if (!first) { in bitmap_string()
1248 first = false; in bitmap_string()
1265 bool first = true; in bitmap_list_string() local
1277 if (!first) { in bitmap_list_string()
1282 first = false; in bitmap_list_string()
|
| D | Kconfig.kgdb | 138 CONFIG_KDB_CONTINUE_CATASTROPHIC == 0 (default). The first time
|
| D | Kconfig | 33 - 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 | 46 MicroLZMA is a header format variant where the first byte
|