rxe_pool.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302
  1. // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
  2. /*
  3. * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
  4. * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.
  5. */
  6. #include "rxe.h"
  7. #define RXE_POOL_TIMEOUT (200)
  8. #define RXE_POOL_ALIGN (16)
  9. static const struct rxe_type_info {
  10. const char *name;
  11. size_t size;
  12. size_t elem_offset;
  13. void (*cleanup)(struct rxe_pool_elem *elem);
  14. u32 min_index;
  15. u32 max_index;
  16. u32 max_elem;
  17. } rxe_type_info[RXE_NUM_TYPES] = {
  18. [RXE_TYPE_UC] = {
  19. .name = "uc",
  20. .size = sizeof(struct rxe_ucontext),
  21. .elem_offset = offsetof(struct rxe_ucontext, elem),
  22. .min_index = 1,
  23. .max_index = RXE_MAX_UCONTEXT,
  24. .max_elem = RXE_MAX_UCONTEXT,
  25. },
  26. [RXE_TYPE_PD] = {
  27. .name = "pd",
  28. .size = sizeof(struct rxe_pd),
  29. .elem_offset = offsetof(struct rxe_pd, elem),
  30. .min_index = 1,
  31. .max_index = RXE_MAX_PD,
  32. .max_elem = RXE_MAX_PD,
  33. },
  34. [RXE_TYPE_AH] = {
  35. .name = "ah",
  36. .size = sizeof(struct rxe_ah),
  37. .elem_offset = offsetof(struct rxe_ah, elem),
  38. .min_index = RXE_MIN_AH_INDEX,
  39. .max_index = RXE_MAX_AH_INDEX,
  40. .max_elem = RXE_MAX_AH,
  41. },
  42. [RXE_TYPE_SRQ] = {
  43. .name = "srq",
  44. .size = sizeof(struct rxe_srq),
  45. .elem_offset = offsetof(struct rxe_srq, elem),
  46. .cleanup = rxe_srq_cleanup,
  47. .min_index = RXE_MIN_SRQ_INDEX,
  48. .max_index = RXE_MAX_SRQ_INDEX,
  49. .max_elem = RXE_MAX_SRQ,
  50. },
  51. [RXE_TYPE_QP] = {
  52. .name = "qp",
  53. .size = sizeof(struct rxe_qp),
  54. .elem_offset = offsetof(struct rxe_qp, elem),
  55. .cleanup = rxe_qp_cleanup,
  56. .min_index = RXE_MIN_QP_INDEX,
  57. .max_index = RXE_MAX_QP_INDEX,
  58. .max_elem = RXE_MAX_QP,
  59. },
  60. [RXE_TYPE_CQ] = {
  61. .name = "cq",
  62. .size = sizeof(struct rxe_cq),
  63. .elem_offset = offsetof(struct rxe_cq, elem),
  64. .cleanup = rxe_cq_cleanup,
  65. .min_index = 1,
  66. .max_index = RXE_MAX_CQ,
  67. .max_elem = RXE_MAX_CQ,
  68. },
  69. [RXE_TYPE_MR] = {
  70. .name = "mr",
  71. .size = sizeof(struct rxe_mr),
  72. .elem_offset = offsetof(struct rxe_mr, elem),
  73. .cleanup = rxe_mr_cleanup,
  74. .min_index = RXE_MIN_MR_INDEX,
  75. .max_index = RXE_MAX_MR_INDEX,
  76. .max_elem = RXE_MAX_MR,
  77. },
  78. [RXE_TYPE_MW] = {
  79. .name = "mw",
  80. .size = sizeof(struct rxe_mw),
  81. .elem_offset = offsetof(struct rxe_mw, elem),
  82. .cleanup = rxe_mw_cleanup,
  83. .min_index = RXE_MIN_MW_INDEX,
  84. .max_index = RXE_MAX_MW_INDEX,
  85. .max_elem = RXE_MAX_MW,
  86. },
  87. };
  88. void rxe_pool_init(struct rxe_dev *rxe, struct rxe_pool *pool,
  89. enum rxe_elem_type type)
  90. {
  91. const struct rxe_type_info *info = &rxe_type_info[type];
  92. memset(pool, 0, sizeof(*pool));
  93. pool->rxe = rxe;
  94. pool->name = info->name;
  95. pool->type = type;
  96. pool->max_elem = info->max_elem;
  97. pool->elem_size = ALIGN(info->size, RXE_POOL_ALIGN);
  98. pool->elem_offset = info->elem_offset;
  99. pool->cleanup = info->cleanup;
  100. atomic_set(&pool->num_elem, 0);
  101. xa_init_flags(&pool->xa, XA_FLAGS_ALLOC);
  102. pool->limit.min = info->min_index;
  103. pool->limit.max = info->max_index;
  104. }
  105. void rxe_pool_cleanup(struct rxe_pool *pool)
  106. {
  107. WARN_ON(!xa_empty(&pool->xa));
  108. }
  109. void *rxe_alloc(struct rxe_pool *pool)
  110. {
  111. struct rxe_pool_elem *elem;
  112. void *obj;
  113. int err;
  114. if (WARN_ON(!(pool->type == RXE_TYPE_MR)))
  115. return NULL;
  116. if (atomic_inc_return(&pool->num_elem) > pool->max_elem)
  117. goto err_cnt;
  118. obj = kzalloc(pool->elem_size, GFP_KERNEL);
  119. if (!obj)
  120. goto err_cnt;
  121. elem = (struct rxe_pool_elem *)((u8 *)obj + pool->elem_offset);
  122. elem->pool = pool;
  123. elem->obj = obj;
  124. kref_init(&elem->ref_cnt);
  125. init_completion(&elem->complete);
  126. /* allocate index in array but leave pointer as NULL so it
  127. * can't be looked up until rxe_finalize() is called
  128. */
  129. err = xa_alloc_cyclic(&pool->xa, &elem->index, NULL, pool->limit,
  130. &pool->next, GFP_KERNEL);
  131. if (err < 0)
  132. goto err_free;
  133. return obj;
  134. err_free:
  135. kfree(obj);
  136. err_cnt:
  137. atomic_dec(&pool->num_elem);
  138. return NULL;
  139. }
  140. int __rxe_add_to_pool(struct rxe_pool *pool, struct rxe_pool_elem *elem,
  141. bool sleepable)
  142. {
  143. int err;
  144. gfp_t gfp_flags;
  145. if (WARN_ON(pool->type == RXE_TYPE_MR))
  146. return -EINVAL;
  147. if (atomic_inc_return(&pool->num_elem) > pool->max_elem)
  148. goto err_cnt;
  149. elem->pool = pool;
  150. elem->obj = (u8 *)elem - pool->elem_offset;
  151. kref_init(&elem->ref_cnt);
  152. init_completion(&elem->complete);
  153. /* AH objects are unique in that the create_ah verb
  154. * can be called in atomic context. If the create_ah
  155. * call is not sleepable use GFP_ATOMIC.
  156. */
  157. gfp_flags = sleepable ? GFP_KERNEL : GFP_ATOMIC;
  158. if (sleepable)
  159. might_sleep();
  160. err = xa_alloc_cyclic(&pool->xa, &elem->index, NULL, pool->limit,
  161. &pool->next, gfp_flags);
  162. if (err < 0)
  163. goto err_cnt;
  164. return 0;
  165. err_cnt:
  166. atomic_dec(&pool->num_elem);
  167. return -EINVAL;
  168. }
  169. void *rxe_pool_get_index(struct rxe_pool *pool, u32 index)
  170. {
  171. struct rxe_pool_elem *elem;
  172. struct xarray *xa = &pool->xa;
  173. void *obj;
  174. rcu_read_lock();
  175. elem = xa_load(xa, index);
  176. if (elem && kref_get_unless_zero(&elem->ref_cnt))
  177. obj = elem->obj;
  178. else
  179. obj = NULL;
  180. rcu_read_unlock();
  181. return obj;
  182. }
  183. static void rxe_elem_release(struct kref *kref)
  184. {
  185. struct rxe_pool_elem *elem = container_of(kref, typeof(*elem), ref_cnt);
  186. complete(&elem->complete);
  187. }
  188. int __rxe_cleanup(struct rxe_pool_elem *elem, bool sleepable)
  189. {
  190. struct rxe_pool *pool = elem->pool;
  191. struct xarray *xa = &pool->xa;
  192. static int timeout = RXE_POOL_TIMEOUT;
  193. int ret, err = 0;
  194. void *xa_ret;
  195. if (sleepable)
  196. might_sleep();
  197. /* erase xarray entry to prevent looking up
  198. * the pool elem from its index
  199. */
  200. xa_ret = xa_erase(xa, elem->index);
  201. WARN_ON(xa_err(xa_ret));
  202. /* if this is the last call to rxe_put complete the
  203. * object. It is safe to touch obj->elem after this since
  204. * it is freed below
  205. */
  206. __rxe_put(elem);
  207. /* wait until all references to the object have been
  208. * dropped before final object specific cleanup and
  209. * return to rdma-core
  210. */
  211. if (sleepable) {
  212. if (!completion_done(&elem->complete) && timeout) {
  213. ret = wait_for_completion_timeout(&elem->complete,
  214. timeout);
  215. /* Shouldn't happen. There are still references to
  216. * the object but, rather than deadlock, free the
  217. * object or pass back to rdma-core.
  218. */
  219. if (WARN_ON(!ret))
  220. err = -EINVAL;
  221. }
  222. } else {
  223. unsigned long until = jiffies + timeout;
  224. /* AH objects are unique in that the destroy_ah verb
  225. * can be called in atomic context. This delay
  226. * replaces the wait_for_completion call above
  227. * when the destroy_ah call is not sleepable
  228. */
  229. while (!completion_done(&elem->complete) &&
  230. time_before(jiffies, until))
  231. mdelay(1);
  232. if (WARN_ON(!completion_done(&elem->complete)))
  233. err = -EINVAL;
  234. }
  235. if (pool->cleanup)
  236. pool->cleanup(elem);
  237. if (pool->type == RXE_TYPE_MR)
  238. kfree_rcu(elem->obj);
  239. atomic_dec(&pool->num_elem);
  240. return err;
  241. }
  242. int __rxe_get(struct rxe_pool_elem *elem)
  243. {
  244. return kref_get_unless_zero(&elem->ref_cnt);
  245. }
  246. int __rxe_put(struct rxe_pool_elem *elem)
  247. {
  248. return kref_put(&elem->ref_cnt, rxe_elem_release);
  249. }
  250. void __rxe_finalize(struct rxe_pool_elem *elem)
  251. {
  252. void *xa_ret;
  253. xa_ret = xa_store(&elem->pool->xa, elem->index, elem, GFP_KERNEL);
  254. WARN_ON(xa_err(xa_ret));
  255. }