Home
last modified time | relevance | path

Searched refs:first (Results 1 – 25 of 29) sorted by relevance

12

/lib/
A Dsiphash.c119 v3 ^= first; in siphash_1u64()
122 v0 ^= first; in siphash_1u64()
136 v3 ^= first; in siphash_2u64()
139 v0 ^= first; in siphash_2u64()
159 v3 ^= first; in siphash_3u64()
162 v0 ^= first; in siphash_3u64()
187 v3 ^= first; in siphash_4u64()
190 v0 ^= first; in siphash_4u64()
210 b |= first; in siphash_1u32()
319 b |= first; in hsiphash_1u32()
[all …]
A Dkasprintf.c17 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()
A Dllist.c35 entry = smp_load_acquire(&head->first); in llist_del_first()
40 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first()
63 entry = smp_load_acquire(&head->first); in llist_del_first_this()
68 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first_this()
A Dplist.c75 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()
207 struct plist_node *first, *prio_pos, *node_pos; in plist_test_check() local
214 prio_pos = first = plist_first(&test_head); in plist_test_check()
218 if (node_pos == first) in plist_test_check()
231 BUG_ON(prio_pos->prio_list.next != &first->prio_list); in plist_test_check()
A Ddebugobjects.c160 first_batch = src->objects.first; in pool_move_batch()
166 src->objects.first = next_batch; in pool_move_batch()
171 last->next = dst->objects.first; in pool_move_batch()
175 dst->objects.first = first_batch; in pool_move_batch()
216 src->objects.first = next; in pool_pop_batch()
218 next->pprev = &src->objects.first; in pool_pop_batch()
228 if (unlikely(!list->first)) in __alloc_object()
293 struct debug_obj *first; in pcpu_free() local
300 first = hlist_entry(pcp->objects.first, typeof(*first), node); in pcpu_free()
301 obj->batch_last = first->batch_last; in pcpu_free()
[all …]
A Dbitmap.c200 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()
A Dxarray.c790 void *first, *next; in xas_store() local
797 first = xas_load(xas); in xas_store()
801 return first; in xas_store()
806 return first; in xas_store()
808 next = first; in xas_store()
847 first = next; in xas_store()
853 return first; in xas_store()
1830 xas_set(xas, first); in xas_set_range()
1841 first >>= XA_CHUNK_SHIFT; in xas_set_range()
1879 if (last < first) in xa_store_range()
[all …]
A Dsbitmap.c727 bool first; in sbitmap_queue_show() local
733 first = true; in sbitmap_queue_show()
735 if (!first) in sbitmap_queue_show()
737 first = false; in sbitmap_queue_show()
A Dtest_xarray.c1802 static noinline void __check_store_range(struct xarray *xa, unsigned long first, in __check_store_range() argument
1806 xa_store_range(xa, first, last, xa_mk_index(first), GFP_KERNEL); in __check_store_range()
1808 XA_BUG_ON(xa, xa_load(xa, first) != xa_mk_index(first)); in __check_store_range()
1809 XA_BUG_ON(xa, xa_load(xa, last) != xa_mk_index(first)); in __check_store_range()
1810 XA_BUG_ON(xa, xa_load(xa, first - 1) != NULL); in __check_store_range()
1813 xa_store_range(xa, first, last, NULL, GFP_KERNEL); in __check_store_range()
A Ddynamic_debug.c353 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()
A Dvsprintf.c1243 bool first = true; in bitmap_string() local
1265 if (!first) { in bitmap_string()
1270 first = false; in bitmap_string()
1285 bool first = true; in bitmap_list_string() local
1292 if (!first) { in bitmap_list_string()
1297 first = false; in bitmap_list_string()
A DKconfig.kgdb139 CONFIG_KDB_CONTINUE_CATASTROPHIC == 0 (default). The first time
A Dmaple_tree.c6408 int mtree_insert_range(struct maple_tree *mt, unsigned long first, in mtree_insert_range() argument
6411 MA_STATE(ms, mt, first, last); in mtree_insert_range()
6417 if (first > last) in mtree_insert_range()
7146 unsigned long first = min; in mt_dump_range64() local
7171 first, last, depth + 1, format); in mt_dump_range64()
7174 first, last, depth + 1, format); in mt_dump_range64()
7189 first = last + 1; in mt_dump_range64()
7198 unsigned long first = min; in mt_dump_arange64() local
7233 first, last, depth + 1, format); in mt_dump_arange64()
7248 first = last + 1; in mt_dump_arange64()
A Dtest_bitmap.c1011 unsigned int first; member
1061 bitmap_cut(out, in, t->first, t->cut, t->nbits); in test_bitmap_cut()
A DKconfig34 - The least-significant 32-bit word comes first (within a 64-bit
/lib/tests/
A Dprintf_kunit.c680 const struct software_node first = { .name = "first" }; in fwnode_pointer() local
681 const struct software_node second = { .name = "second", .parent = &first }; in fwnode_pointer()
683 const struct software_node *group[] = { &first, &second, &third, NULL }; in fwnode_pointer()
A Dlist-test.c904 KUNIT_EXPECT_PTR_EQ(test, list.first, &b); in hlist_test_del()
905 KUNIT_EXPECT_PTR_EQ(test, b.pprev, &list.first); in hlist_test_del()
920 KUNIT_EXPECT_PTR_EQ(test, list.first, &b); in hlist_test_del_init()
921 KUNIT_EXPECT_PTR_EQ(test, b.pprev, &list.first); in hlist_test_del_init()
940 KUNIT_EXPECT_PTR_EQ(test, list.first, &b); in hlist_test_add()
/lib/xz/
A DKconfig52 MicroLZMA is a header format variant where the first byte
/lib/crypto/x86/
A Dchacha-avx512vl-x86_64.S325 # o0 = i0 ^ (x0 + s0), first block
332 # o1 = i1 ^ (x1 + s1), first block
339 # o2 = i2 ^ (x2 + s2), first block
346 # o3 = i3 ^ (x3 + s3), first block
705 # xor/write first four blocks
A Dchacha-avx2-x86_64.S391 # o0 = i0 ^ (x0 + s0), first block
398 # o1 = i1 ^ (x1 + s1), first block
405 # o2 = i2 ^ (x2 + s2), first block
412 # o3 = i3 ^ (x3 + s3), first block
543 # scratch registers, we save the first four registers on the stack. The
882 # xor/write first four blocks
A Dsha1-avx2-asm.S471 # Precalc WK for first 2 blocks
A Dsha512-avx-asm.S166 # the first of a pair of QWORDS.
A Dsha512-ssse3-asm.S161 # the first of a pair of QWORDS.
A Dsha256-avx-asm.S379 ## byte swap first 16 dwords
A Dsha256-ssse3-asm.S387 ## byte swap first 16 dwords

Completed in 73 milliseconds

12