| /lib/ |
| D | xarray.c | 183 void *entry; in xas_start() local
207 void *entry = xa_entry(xas->xa, node, offset); in xas_descend() local
238 void *entry = xas_start(xas); in xas_load() local
431 static unsigned long max_index(void *entry) in max_index()
444 void *entry; in xas_shrink() local
530 void *entry = xa_entry_locked(xas->xa, node, offset); in xas_free_nodes() local
643 void *entry; in xas_create() local
776 void *xas_store(struct xa_state *xas, void *entry) in xas_store()
1018 void xas_split_alloc(struct xa_state *xas, void *entry, unsigned int order, in xas_split_alloc()
1069 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
481 void *entry; in check_reserve() local
548 void *entry; in check_xas_erase() local
627 void *entry; in check_multi_store_3() local
[all …]
|
| D | fw_table.c | 31 acpi_get_entry_type(struct acpi_subtable_entry *entry) in acpi_get_entry_type()
49 acpi_get_entry_length(struct acpi_subtable_entry *entry) in acpi_get_entry_length()
70 acpi_get_subtable_header_length(struct acpi_subtable_entry *entry) in acpi_get_subtable_header_length()
157 struct acpi_subtable_entry entry; in acpi_parse_entries_array() local
|
| D | llist.c | 55 struct llist_node *entry, *next; in llist_del_first() local
82 struct llist_node *entry, *next; in llist_del_first_this() local
|
| D | maple_tree.c | 221 const struct maple_enode *entry) in mte_node_type()
237 static __always_inline bool mte_is_leaf(const struct maple_enode *entry) in mte_is_leaf()
246 static __always_inline bool mt_is_reserved(const void *entry) in mt_is_reserved()
289 const struct maple_enode *entry) in mte_to_node()
300 static inline struct maple_topiary *mte_to_mat(const struct maple_enode *entry) in mte_to_mat()
1755 struct maple_enode *entry; in mas_find_child() local
2391 void *entry) in mab_set_b_end()
3392 static inline int mas_root_expand(struct ma_state *mas, void *entry) in mas_root_expand()
3439 static inline void mas_store_root(struct ma_state *mas, void *entry) in mas_store_root()
3469 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 | 45 bool __list_del_entry_valid_or_report(struct list_head *entry) in __list_del_entry_valid_or_report()
|
| 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
435 void *entry; in dmirror_do_write() local
699 void *entry; in dmirror_check_atomic() local
719 void *entry; in dmirror_atomic_map() local
754 void *entry; in dmirror_migrate_finalize_and_map() local
1037 unsigned char *perm, unsigned long entry) in dmirror_mkentry()
|
| D | test_maple_tree.c | 394 void *entry, *entry2; in check_find() local
607 void *entry; in check_find_2() local
1324 void *entry = NULL; in check_next_entry() local
1483 void *entry; in check_gap_combining() local
1776 void *entry; in bench_mt_for_each() local
1800 void *entry; in bench_mas_for_each() local
1830 void *entry; in bench_mas_prev() local
3067 void *entry, *ptr = (void *) 0x1234500; in check_state_handling() local
|
| D | radix-tree.c | 89 void __rcu **entry = rcu_dereference_raw(parent->slots[offset]); in radix_tree_descend() local
411 void *entry; in radix_tree_extend() local
662 void *entry = rcu_dereference_raw(child->slots[offset]); in radix_tree_free_nodes() local
1418 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 | 94 const struct nlattr *entry; in nla_validate_array() local
|
| D | rhashtable.c | 235 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
|
| /lib/zstd/compress/ |
| D | zstd_ldm.c | 181 size_t const hash, const ldmEntry_t entry, in ZSTD_ldm_insertEntry()
294 ldmEntry_t entry; in ZSTD_ldm_fillHashTable() local
|
| D | zstd_lazy.c | 682 const U32* entry = &dms->hashTable[ddsIdx]; in ZSTD_HcFindBestMatch() local
|