| /lib/ |
| D | xarray.c | 181 void *entry; in xas_start() local
204 void *entry = xa_entry(xas->xa, node, offset); in xas_descend() local
235 void *entry = xas_start(xas); in xas_load() local
432 static unsigned long max_index(void *entry) in max_index()
445 void *entry; in xas_shrink() local
531 void *entry = xa_entry_locked(xas->xa, node, offset); in xas_free_nodes() local
644 void *entry; in xas_create() local
777 void *xas_store(struct xa_state *xas, void *entry) in xas_store()
1005 void xas_split_alloc(struct xa_state *xas, void *entry, unsigned int order, in xas_split_alloc()
1056 void xas_split(struct xa_state *xas, void *entry, unsigned int order) in xas_split()
[all …]
|
| D | test_xarray.c | 72 unsigned order, void *entry, gfp_t gfp) in xa_store_order()
105 void *entry; in check_xas_retry() local
153 void *entry = xa_load(xa, j); in check_xa_load() local
164 void *entry = xa_load(xa, j); in check_xa_load() local
222 void *entry; in check_xa_mark_1() local
259 void *entry; in check_xa_mark_2() local
296 void *entry; in check_xa_mark_3() local
428 void *entry; in check_reserve() local
495 void *entry; in check_xas_erase() local
574 void *entry; in check_multi_store_3() local
[all …]
|
| D | maple_tree.c | 214 static inline enum maple_type mte_node_type(const struct maple_enode *entry) in mte_node_type()
230 static inline bool mte_is_leaf(const struct maple_enode *entry) in mte_is_leaf()
239 static inline bool mt_is_reserved(const void *entry) in mt_is_reserved()
276 static inline struct maple_node *mte_to_node(const struct maple_enode *entry) in mte_to_node()
287 static inline struct maple_topiary *mte_to_mat(const struct maple_enode *entry) in mte_to_mat()
1802 struct maple_enode *entry; in mas_find_child() local
2486 void *entry) in mab_set_b_end()
3557 static inline int mas_root_expand(struct ma_state *mas, void *entry) in mas_root_expand()
3599 static inline void mas_store_root(struct ma_state *mas, void *entry) in mas_store_root()
3630 void *entry = wr_mas->entry; in mas_is_span_wr() local
[all …]
|
| D | idr.c | 231 void *entry = NULL; in idr_get_next_ul() local
267 void *entry = idr_get_next_ul(idr, &id); in idr_get_next() local
294 void *entry; in idr_replace() local
561 static void ida_dump_entry(void *entry, unsigned long index) in ida_dump_entry()
|
| D | list_debug.c | 42 bool __list_del_entry_valid(struct list_head *entry) in __list_del_entry_valid()
|
| D | llist.c | 55 struct llist_node *entry, *next; in llist_del_first() local
|
| D | test_hmm.c | 216 void *entry; in dmirror_do_fault() local
245 void *entry; in dmirror_do_update() local
369 void *entry; in dmirror_do_read() local
438 void *entry; in dmirror_do_write() local
705 void *entry; in dmirror_check_atomic() local
725 void *entry; in dmirror_atomic_map() local
760 void *entry; in dmirror_migrate_finalize_and_map() local
1046 unsigned char *perm, unsigned long entry) in dmirror_mkentry()
|
| D | test_maple_tree.c | 365 void *entry, *entry2; in check_find() local
578 void *entry; in check_find_2() local
1216 void *entry = NULL; in check_next_entry() local
1374 void *entry; in check_gap_combining() local
1654 void *entry; in bench_mt_for_each() local
|
| D | radix-tree.c | 87 void __rcu **entry = rcu_dereference_raw(parent->slots[offset]); in radix_tree_descend() local
409 void *entry; in radix_tree_extend() local
660 void *entry = rcu_dereference_raw(child->slots[offset]); in radix_tree_free_nodes() local
1416 void *entry; in radix_tree_delete_item() local
|
| D | error-inject.c | 70 unsigned long entry, offset = 0, size = 0; in populate_error_injection_list() local
|
| D | nlattr.c | 90 const struct nlattr *entry; in nla_validate_array() local
|
| D | rhashtable.c | 231 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
|
| /lib/zstd/compress/ |
| D | zstd_ldm.c | 154 size_t const hash, const ldmEntry_t entry, in ZSTD_ldm_insertEntry()
267 ldmEntry_t entry; in ZSTD_ldm_fillHashTable() local
|
| D | zstd_lazy.c | 632 const U32* entry = &dms->hashTable[ddsIdx]; in ZSTD_HcFindBestMatch_generic() local
|