| /lib/ |
| D | xarray.c | 181 void *entry; in xas_start() local
188 entry = xa_head(xas->xa); in xas_start()
189 if (!xa_is_node(entry)) { in xas_start()
193 if ((xas->xa_index >> xa_to_node(entry)->shift) > XA_CHUNK_MASK) in xas_start()
198 return entry; in xas_start()
204 void *entry = xa_entry(xas->xa, node, offset); in xas_descend() local
207 if (xa_is_sibling(entry)) { in xas_descend()
208 offset = xa_to_sibling(entry); in xas_descend()
209 entry = xa_entry(xas->xa, node, offset); in xas_descend()
213 return entry; in xas_descend()
[all …]
|
| D | list_debug.c | 42 bool __list_del_entry_valid(struct list_head *entry) in __list_del_entry_valid() argument
46 prev = entry->prev; in __list_del_entry_valid()
47 next = entry->next; in __list_del_entry_valid()
50 "list_del corruption, %px->next is NULL\n", entry) || in __list_del_entry_valid()
52 "list_del corruption, %px->prev is NULL\n", entry) || in __list_del_entry_valid()
55 entry, LIST_POISON1) || in __list_del_entry_valid()
58 entry, LIST_POISON2) || in __list_del_entry_valid()
59 CHECK_DATA_CORRUPTION(prev->next != entry, in __list_del_entry_valid()
61 entry, prev->next) || in __list_del_entry_valid()
62 CHECK_DATA_CORRUPTION(next->prev != entry, in __list_del_entry_valid()
[all …]
|
| D | llist.c | 55 struct llist_node *entry, *old_entry, *next; in llist_del_first() local
57 entry = smp_load_acquire(&head->first); in llist_del_first()
59 if (entry == NULL) in llist_del_first()
61 old_entry = entry; in llist_del_first()
62 next = READ_ONCE(entry->next); in llist_del_first()
63 entry = cmpxchg(&head->first, old_entry, next); in llist_del_first()
64 if (entry == old_entry) in llist_del_first()
68 return entry; in llist_del_first()
|
| D | logic_pio.c | 243 struct logic_pio_hwaddr *entry = find_io_range(addr); \
245 if (entry) \
246 ret = entry->ops->in(entry->hostdata, \
259 struct logic_pio_hwaddr *entry = find_io_range(addr); \
261 if (entry) \
262 entry->ops->out(entry->hostdata, \
275 struct logic_pio_hwaddr *entry = find_io_range(addr); \
277 if (entry) \
278 entry->ops->ins(entry->hostdata, \
292 struct logic_pio_hwaddr *entry = find_io_range(addr); \
[all …]
|
| D | idr.c | 231 void *entry = NULL; in idr_get_next_ul() local
237 entry = rcu_dereference_raw(*slot); in idr_get_next_ul()
238 if (!entry) in idr_get_next_ul()
240 if (!xa_is_internal(entry)) in idr_get_next_ul()
242 if (slot != &idr->idr_rt.xa_head && !xa_is_retry(entry)) in idr_get_next_ul()
250 return entry; in idr_get_next_ul()
267 void *entry = idr_get_next_ul(idr, &id); in idr_get_next() local
272 return entry; in idr_get_next()
294 void *entry; in idr_replace() local
298 entry = __radix_tree_lookup(&idr->idr_rt, id, &node, &slot); in idr_replace()
[all …]
|
| D | test_xarray.c | 72 unsigned order, void *entry, gfp_t gfp) in xa_store_order() argument
79 curr = xas_store(&xas, entry); in xa_store_order()
105 void *entry; in check_xas_retry() local
138 xas_for_each(&xas, entry, ULONG_MAX) { in check_xas_retry()
153 void *entry = xa_load(xa, j); in check_xa_load() local
155 XA_BUG_ON(xa, xa_to_value(entry) != j); in check_xa_load()
157 XA_BUG_ON(xa, entry); in check_xa_load()
164 void *entry = xa_load(xa, j); in check_xa_load() local
166 XA_BUG_ON(xa, xa_to_value(entry) != j); in check_xa_load()
168 XA_BUG_ON(xa, entry); in check_xa_load()
[all …]
|
| D | test_hmm.c | 171 void *entry; in dmirror_do_fault() local
183 entry = page; in dmirror_do_fault()
185 entry = xa_tag_pointer(entry, DPT_XA_TAG_WRITE); in dmirror_do_fault()
188 entry = xa_store(&dmirror->pt, pfn, entry, GFP_ATOMIC); in dmirror_do_fault()
189 if (xa_is_err(entry)) in dmirror_do_fault()
190 return xa_err(entry); in dmirror_do_fault()
200 void *entry; in dmirror_do_update() local
207 xa_for_each_range(&dmirror->pt, pfn, entry, start >> PAGE_SHIFT, in dmirror_do_update()
324 void *entry; in dmirror_do_read() local
328 entry = xa_load(&dmirror->pt, pfn); in dmirror_do_read()
[all …]
|
| D | error-inject.c | 63 unsigned long entry, offset = 0, size = 0; in populate_error_injection_list() local
67 entry = arch_deref_entry_point((void *)iter->addr); in populate_error_injection_list()
69 if (!kernel_text_address(entry) || in populate_error_injection_list()
70 !kallsyms_lookup_size_offset(entry, &size, &offset)) { in populate_error_injection_list()
72 (void *)entry); in populate_error_injection_list()
79 ent->start_addr = entry; in populate_error_injection_list()
80 ent->end_addr = entry + size; in populate_error_injection_list()
|
| D | radix-tree.c | 87 void __rcu **entry = rcu_dereference_raw(parent->slots[offset]); in radix_tree_descend() local
89 *nodep = (void *)entry; in radix_tree_descend()
409 void *entry; in radix_tree_extend() local
418 entry = rcu_dereference_raw(root->xa_head); in radix_tree_extend()
419 if (!entry && (!is_idr(root) || root_tag_get(root, IDR_FREE))) in radix_tree_extend()
443 if (radix_tree_is_internal_node(entry)) { in radix_tree_extend()
444 entry_to_node(entry)->parent = node; in radix_tree_extend()
445 } else if (xa_is_value(entry)) { in radix_tree_extend()
453 node->slots[0] = (void __rcu *)entry; in radix_tree_extend()
454 entry = node_to_entry(node); in radix_tree_extend()
[all …]
|
| D | nlattr.c | 90 const struct nlattr *entry; in nla_validate_array() local
93 nla_for_each_attr(entry, head, len, rem) { in nla_validate_array()
96 if (nla_len(entry) == 0) in nla_validate_array()
99 if (nla_len(entry) < NLA_HDRLEN) { in nla_validate_array()
100 NL_SET_ERR_MSG_ATTR_POL(extack, entry, policy, in nla_validate_array()
105 ret = __nla_validate_parse(nla_data(entry), nla_len(entry), in nla_validate_array()
|
| D | rhashtable.c | 231 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
240 rht_for_each_from(entry, rht_ptr(bkt, old_tbl, old_hash), in rhashtable_rehash_one()
243 next = rht_dereference_bucket(entry->next, old_tbl, old_hash); in rhashtable_rehash_one()
248 pprev = &entry->next; in rhashtable_rehash_one()
254 new_hash = head_hashfn(ht, new_tbl, entry); in rhashtable_rehash_one()
260 RCU_INIT_POINTER(entry->next, head); in rhashtable_rehash_one()
262 rht_assign_unlock(new_tbl, &new_tbl->buckets[new_hash], entry); in rhashtable_rehash_one()
|
| D | kobject.c | 204 list_add_tail(&kobj->entry, &kobj->kset->list); in kobj_kset_join()
215 list_del_init(&kobj->entry); in kobj_kset_leave()
225 INIT_LIST_HEAD(&kobj->entry); in kobject_init_internal()
928 list_for_each_entry(k, &kset->list, entry) { in kset_find_obj()
|
| D | sbitmap.c | 681 list_del_init(&sbq_wait->wait.entry); in sbitmap_del_wait_queue()
|
| /lib/pldmfw/ |
| D | pldmfw.c | 298 list_add_tail(&desc->entry, &record->descs); in pldm_parse_desc_tlvs()
336 list_add_tail(&record->entry, &data->records); in pldm_parse_one_record()
484 list_add_tail(&component->entry, &data->components); in pldm_parse_components()
549 list_for_each_entry_safe(component, c_safe, &data->components, entry) { in pldmfw_free_priv()
550 list_del(&component->entry); in pldmfw_free_priv()
554 list_for_each_entry_safe(record, r_safe, &data->records, entry) { in pldmfw_free_priv()
555 list_for_each_entry_safe(desc, d_safe, &record->descs, entry) { in pldmfw_free_priv()
556 list_del(&desc->entry); in pldmfw_free_priv()
565 list_del(&record->entry); in pldmfw_free_priv()
639 list_for_each_entry(desc, &record->descs, entry) { in pldmfw_op_pci_match_record()
[all …]
|