Home
last modified time | relevance | path

Searched refs:array (Results 1 – 18 of 18) sorted by relevance

/lib/
A Dstring_helpers.c154 *array = ints; in parse_int_array()
797 if (!array) in kfree_strarray()
801 kfree(array[i]); in kfree_strarray()
802 kfree(array); in kfree_strarray()
807 char **array; member
813 struct strarray *array = res; in devm_kfree_strarray() local
815 kfree_strarray(array->array, array->n); in devm_kfree_strarray()
827 if (!ptr->array) { in devm_kasprintf_strarray()
835 return ptr->array; in devm_kasprintf_strarray()
929 item = array[index]; in match_string()
[all …]
A Dassoc_array.c445 array->root = NULL; in assoc_array_destroy()
983 edit->array = array; in assoc_array_insert()
1095 edit->array = array; in assoc_array_delete()
1281 if (!array->root) in assoc_array_clear()
1287 edit->array = array; in assoc_array_clear()
1289 edit->set[1].ptr = &array->root; in assoc_array_clear()
1373 if (edit->array->root == NULL) { in assoc_array_apply_edit()
1469 if (!array->root) in assoc_array_gc()
1475 edit->array = array; in assoc_array_gc()
1478 edit->set[0].ptr = &array->root; in assoc_array_gc()
[all …]
A DKconfig.ubsan47 def_bool $(cc-option,-fsanitize=array-bounds)
50 of two more specific options, -fsanitize=array-bounds and
53 CONFIG_LOCAL_BOUNDS.) Explicitly check for -fsanitize=array-bounds
58 bool "Perform array index bounds checking"
63 array accesses, where the array size is known at compile time.
64 Note that this does not protect array overflows via bad calls
77 Clang's array bounds sanitizer. This option is used to select
A Dtest_xarray.c2233 check_xa_err(&array); in xarray_checks()
2235 check_xa_load(&array); in xarray_checks()
2236 check_xa_mark(&array); in xarray_checks()
2239 check_insert(&array); in xarray_checks()
2240 check_cmpxchg(&array); in xarray_checks()
2242 check_reserve(&array); in xarray_checks()
2250 check_find(&array); in xarray_checks()
2252 check_pause(&array); in xarray_checks()
2253 check_account(&array); in xarray_checks()
2255 check_move(&array); in xarray_checks()
[all …]
A Dtest_rhashtable.c138 static int __init test_rht_lookup(struct rhashtable *ht, struct test_obj *array, in test_rht_lookup() argument
150 if (array[i / 2].value.id == TEST_INSERT_FAIL) in test_rht_lookup()
209 static s64 __init test_rhashtable(struct rhashtable *ht, struct test_obj *array, in test_rhashtable() argument
224 struct test_obj *obj = &array[i]; in test_rhashtable()
240 test_rht_lookup(ht, array, entries); in test_rhashtable()
251 if (array[i].value.id != TEST_INSERT_FAIL) { in test_rhashtable()
435 static int __init test_rhashtable_max(struct test_obj *array, in test_rhashtable_max() argument
447 struct test_obj *obj = &array[i]; in test_rhashtable_max()
455 err = insert_retry(&ht, &array[ht.max_elems], test_rht_params); in test_rhashtable_max()
A Dpacking_test.c27 #define PBUF(array...) \ argument
28 .pbuf = (const u8[]){ array }, \
29 .pbuf_size = sizeof((const u8 []){ array })
A Dtest_vmalloc.c322 unsigned char array[20]; member
336 p->array[0] = 'a'; in kvfree_rcu_1_arg_vmalloc_test()
354 p->array[0] = 'a'; in kvfree_rcu_2_arg_vmalloc_test()
A Dxarray.c259 node->array = XA_RCU_FREE; in xa_node_free()
397 node->array = xas->xa; in xas_alloc()
1020 node->array = xas->xa; in __xas_init_node_for_split()
2360 .xa = node->array, in xa_delete_node()
2365 .xa_node = xa_parent_locked(node->array, node), in xa_delete_node()
2419 node->array, node->private_list.prev, node->private_list.next); in xa_dump_node()
A Dbootconfig.c717 goto array; in xbc_parse_kv()
726 array: in xbc_parse_kv()
A Dvsprintf.c910 const char *array[4], *s; in dentry_name() local
931 array[i] = READ_ONCE(d->d_name.name); in dentry_name()
934 array[i] = ""; in dentry_name()
939 s = array[--i]; in dentry_name()
946 s = array[--i]; in dentry_name()
A DKconfig358 Generic associative array. Can be searched and iterated over whilst
A Dradix-tree.c285 ret->array = root; in radix_tree_node_alloc()
A DKconfig.debug2436 N-disk array. Recovery is performed with the asynchronous
2536 tristate "Perform selftest on priority array manager"
2539 Enable this option to test priority array manager on boot
/lib/tests/
A Dutil_macros_kunit.c11 #define FIND_CLOSEST_RANGE_CHECK(from, to, array, exp_idx) \ argument
15 int found = find_closest(i, array, ARRAY_SIZE(array)); \
118 #define FIND_CLOSEST_DESC_RANGE_CHECK(from, to, array, exp_idx) \ argument
122 int found = find_closest_descending(i, array, \
123 ARRAY_SIZE(array)); \
A Doverflow_kunit.c1177 s16 array[] __counted_by(counter);
1183 s16 array[]; member
1188 DEFINE_RAW_FLEX(struct bar, two, array, 2); in DEFINE_FLEX_test()
1189 DEFINE_FLEX(struct foo, eight, array, counter, 8); in DEFINE_FLEX_test()
1190 DEFINE_FLEX(struct foo, empty, array, counter, 0); in DEFINE_FLEX_test()
1192 DEFINE_RAW_FLEX(struct foo, two_but_zero, array, 2); in DEFINE_FLEX_test()
1210 KUNIT_EXPECT_EQ(test, __struct_size(empty->array), 0); in DEFINE_FLEX_test()
1211 KUNIT_EXPECT_EQ(test, __member_size(empty->array), 0); in DEFINE_FLEX_test()
1213 KUNIT_EXPECT_EQ(test, STACK_FLEX_ARRAY_SIZE(two, array), 2); in DEFINE_FLEX_test()
1214 KUNIT_EXPECT_EQ(test, STACK_FLEX_ARRAY_SIZE(eight, array), 8); in DEFINE_FLEX_test()
[all …]
A Dstackinit_kunit.c360 unsigned long array[FILL_SIZE_ARRAY]; member
/lib/crypto/
A Dgf128mul.c200 be128 array[16 + 3] = {}; in gf128mul_lle() local
201 be128 *p = PTR_ALIGN(&array[0], 2 * sizeof(be128)); in gf128mul_lle()
A Dsha1.c51 #define W(x) (array[(x)&15])
90 void sha1_transform(__u32 *digest, const char *data, __u32 *array) in sha1_transform() argument

Completed in 45 milliseconds