Home
last modified time | relevance | path

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

/lib/
Dassoc_array.c133 int assoc_array_iterate(const struct assoc_array *array, in assoc_array_iterate() argument
138 struct assoc_array_ptr *root = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_iterate()
170 assoc_array_walk(const struct assoc_array *array, in assoc_array_walk() argument
185 cursor = READ_ONCE(array->root); /* Address dependency. */ in assoc_array_walk()
304 void *assoc_array_find(const struct assoc_array *array, in assoc_array_find() argument
314 if (assoc_array_walk(array, ops, index_key, &result) != in assoc_array_find()
441 void assoc_array_destroy(struct assoc_array *array, in assoc_array_destroy() argument
444 assoc_array_destroy_subtree(array->root, ops); in assoc_array_destroy()
445 array->root = NULL; in assoc_array_destroy()
464 edit->set[0].ptr = &edit->array->root; in assoc_array_insert_in_empty_tree()
[all …]
Dtest_xarray.c1502 XA_STATE(xas, node->array, 0); in shadow_remove()
1503 XA_BUG_ON(xa, node->array != xa); in shadow_remove()
1505 xas.xa_node = xa_parent_locked(node->array, node); in shadow_remove()
1609 static DEFINE_XARRAY(array);
1613 check_xa_err(&array); in xarray_checks()
1614 check_xas_retry(&array); in xarray_checks()
1615 check_xa_load(&array); in xarray_checks()
1616 check_xa_mark(&array); in xarray_checks()
1617 check_xa_shrink(&array); in xarray_checks()
1618 check_xas_erase(&array); in xarray_checks()
[all …]
Dtest_rhashtable.c137 static int __init test_rht_lookup(struct rhashtable *ht, struct test_obj *array, in test_rht_lookup() argument
149 if (array[i / 2].value.id == TEST_INSERT_FAIL) in test_rht_lookup()
208 static s64 __init test_rhashtable(struct rhashtable *ht, struct test_obj *array, in test_rhashtable() argument
223 struct test_obj *obj = &array[i]; in test_rhashtable()
239 test_rht_lookup(ht, array, entries); in test_rhashtable()
250 if (array[i].value.id != TEST_INSERT_FAIL) { in test_rhashtable()
448 static int __init test_rhashtable_max(struct test_obj *array, in test_rhashtable_max() argument
460 struct test_obj *obj = &array[i]; in test_rhashtable_max()
470 err = insert_retry(&ht, &array[ht.max_elems], test_rht_params); in test_rhashtable_max()
Dstring.c688 int match_string(const char * const *array, size_t n, const char *string) in match_string() argument
694 item = array[index]; in match_string()
714 int __sysfs_match_string(const char * const *array, size_t n, const char *str) in __sysfs_match_string() argument
720 item = array[index]; in __sysfs_match_string()
Dsha1.c46 #define W(x) (array[(x)&15])
82 void sha_transform(__u32 *digest, const char *data, __u32 *array) in sha_transform() argument
Dvsprintf.c845 const char *array[4], *s; in dentry_name() local
866 array[i] = READ_ONCE(d->d_name.name); in dentry_name()
869 array[i] = ""; in dentry_name()
874 s = array[--i]; in dentry_name()
881 s = array[--i]; in dentry_name()
Dxarray.c257 node->array = XA_RCU_FREE; in xa_node_free()
390 node->array = xas->xa; in xas_alloc()
2017 node->array, node->private_list.prev, node->private_list.next); in xa_dump_node()
Dradix-tree.c294 ret->array = root; in radix_tree_node_alloc()
DKconfig436 Generic associative array. Can be searched and iterated over whilst
DKconfig.debug1780 N-disk array. Recovery is performed with the asynchronous
1845 tristate "Perform selftest on priority array manager"
1848 Enable this option to test priority array manager on boot