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()
304 	return entry;  in idr_replace()
556 static void ida_dump_entry(void *entry, unsigned long index)  in ida_dump_entry()  argument
560 	if (!entry)  in ida_dump_entry()
563 	if (xa_is_node(entry)) {  in ida_dump_entry()
564 		struct xa_node *node = xa_to_node(entry);  in ida_dump_entry()
573 	} else if (xa_is_value(entry)) {  in ida_dump_entry()
575 		pr_cont("value: data %lx [%px]\n", xa_to_value(entry), entry);  in ida_dump_entry()
577 		struct ida_bitmap *bitmap = entry;  in ida_dump_entry()