include/linux/xarray.h

856  * @limit: Range of ID to allocate.
859  * Finds an empty entry in @xa between @limit.min and @limit.max,
869  * -EBUSY if there are no free entries in @limit.
872 		void *entry, struct xa_limit limit, gfp_t gfp)
878 	err = __xa_alloc(xa, id, entry, limit, gfp);
889  * @limit: Range of ID to allocate.
892  * Finds an empty entry in @xa between @limit.min and @limit.max,
902  * -EBUSY if there are no free entries in @limit.
905 		void *entry, struct xa_limit limit, gfp_t gfp)
911 	err = __xa_alloc(xa, id, entry, limit, gfp);
922  * @limit: Range of ID to allocate.
925  * Finds an empty entry in @xa between @limit.min and @limit.max,
935  * -EBUSY if there are no free entries in @limit.
938 		void *entry, struct xa_limit limit, gfp_t gfp)
944 	err = __xa_alloc(xa, id, entry, limit, gfp);
955  * @limit: Range of allocated ID.
959  * Finds an empty entry in @xa between @limit.min and @limit.max,
972  * allocated or -EBUSY if there are no free entries in @limit.
975 		struct xa_limit limit, u32 *next, gfp_t gfp)
981 	err = __xa_alloc_cyclic(xa, id, entry, limit, next, gfp);
992  * @limit: Range of allocated ID.
996  * Finds an empty entry in @xa between @limit.min and @limit.max,
1009  * allocated or -EBUSY if there are no free entries in @limit.
1012 		struct xa_limit limit, u32 *next, gfp_t gfp)
1018 	err = __xa_alloc_cyclic(xa, id, entry, limit, next, gfp);
1029  * @limit: Range of allocated ID.
1033  * Finds an empty entry in @xa between @limit.min and @limit.max,
1046  * allocated or -EBUSY if there are no free entries in @limit.
1049 		struct xa_limit limit, u32 *next, gfp_t gfp)
1055 	err = __xa_alloc_cyclic(xa, id, entry, limit, next, gfp);