cxio_resource.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320
  1. /*
  2. * Copyright (c) 2006 Chelsio, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. /* Crude resource management */
  33. #include <linux/kernel.h>
  34. #include <linux/random.h>
  35. #include <linux/slab.h>
  36. #include <linux/kfifo.h>
  37. #include <linux/spinlock.h>
  38. #include <linux/errno.h>
  39. #include "cxio_resource.h"
  40. #include "cxio_hal.h"
  41. static struct kfifo *rhdl_fifo;
  42. static spinlock_t rhdl_fifo_lock;
  43. #define RANDOM_SIZE 16
  44. static int __cxio_init_resource_fifo(struct kfifo **fifo,
  45. spinlock_t *fifo_lock,
  46. u32 nr, u32 skip_low,
  47. u32 skip_high,
  48. int random)
  49. {
  50. u32 i, j, entry = 0, idx;
  51. u32 random_bytes;
  52. u32 rarray[16];
  53. spin_lock_init(fifo_lock);
  54. *fifo = kfifo_alloc(nr * sizeof(u32), GFP_KERNEL, fifo_lock);
  55. if (IS_ERR(*fifo))
  56. return -ENOMEM;
  57. for (i = 0; i < skip_low + skip_high; i++)
  58. __kfifo_put(*fifo, (unsigned char *) &entry, sizeof(u32));
  59. if (random) {
  60. j = 0;
  61. random_bytes = random32();
  62. for (i = 0; i < RANDOM_SIZE; i++)
  63. rarray[i] = i + skip_low;
  64. for (i = skip_low + RANDOM_SIZE; i < nr - skip_high; i++) {
  65. if (j >= RANDOM_SIZE) {
  66. j = 0;
  67. random_bytes = random32();
  68. }
  69. idx = (random_bytes >> (j * 2)) & 0xF;
  70. __kfifo_put(*fifo,
  71. (unsigned char *) &rarray[idx],
  72. sizeof(u32));
  73. rarray[idx] = i;
  74. j++;
  75. }
  76. for (i = 0; i < RANDOM_SIZE; i++)
  77. __kfifo_put(*fifo,
  78. (unsigned char *) &rarray[i],
  79. sizeof(u32));
  80. } else
  81. for (i = skip_low; i < nr - skip_high; i++)
  82. __kfifo_put(*fifo, (unsigned char *) &i, sizeof(u32));
  83. for (i = 0; i < skip_low + skip_high; i++)
  84. kfifo_get(*fifo, (unsigned char *) &entry, sizeof(u32));
  85. return 0;
  86. }
  87. static int cxio_init_resource_fifo(struct kfifo **fifo, spinlock_t * fifo_lock,
  88. u32 nr, u32 skip_low, u32 skip_high)
  89. {
  90. return (__cxio_init_resource_fifo(fifo, fifo_lock, nr, skip_low,
  91. skip_high, 0));
  92. }
  93. static int cxio_init_resource_fifo_random(struct kfifo **fifo,
  94. spinlock_t * fifo_lock,
  95. u32 nr, u32 skip_low, u32 skip_high)
  96. {
  97. return (__cxio_init_resource_fifo(fifo, fifo_lock, nr, skip_low,
  98. skip_high, 1));
  99. }
  100. static int cxio_init_qpid_fifo(struct cxio_rdev *rdev_p)
  101. {
  102. u32 i;
  103. spin_lock_init(&rdev_p->rscp->qpid_fifo_lock);
  104. rdev_p->rscp->qpid_fifo = kfifo_alloc(T3_MAX_NUM_QP * sizeof(u32),
  105. GFP_KERNEL,
  106. &rdev_p->rscp->qpid_fifo_lock);
  107. if (IS_ERR(rdev_p->rscp->qpid_fifo))
  108. return -ENOMEM;
  109. for (i = 16; i < T3_MAX_NUM_QP; i++)
  110. if (!(i & rdev_p->qpmask))
  111. __kfifo_put(rdev_p->rscp->qpid_fifo,
  112. (unsigned char *) &i, sizeof(u32));
  113. return 0;
  114. }
  115. int cxio_hal_init_rhdl_resource(u32 nr_rhdl)
  116. {
  117. return cxio_init_resource_fifo(&rhdl_fifo, &rhdl_fifo_lock, nr_rhdl, 1,
  118. 0);
  119. }
  120. void cxio_hal_destroy_rhdl_resource(void)
  121. {
  122. kfifo_free(rhdl_fifo);
  123. }
  124. /* nr_* must be power of 2 */
  125. int cxio_hal_init_resource(struct cxio_rdev *rdev_p,
  126. u32 nr_tpt, u32 nr_pbl,
  127. u32 nr_rqt, u32 nr_qpid, u32 nr_cqid, u32 nr_pdid)
  128. {
  129. int err = 0;
  130. struct cxio_hal_resource *rscp;
  131. rscp = kmalloc(sizeof(*rscp), GFP_KERNEL);
  132. if (!rscp)
  133. return -ENOMEM;
  134. rdev_p->rscp = rscp;
  135. err = cxio_init_resource_fifo_random(&rscp->tpt_fifo,
  136. &rscp->tpt_fifo_lock,
  137. nr_tpt, 1, 0);
  138. if (err)
  139. goto tpt_err;
  140. err = cxio_init_qpid_fifo(rdev_p);
  141. if (err)
  142. goto qpid_err;
  143. err = cxio_init_resource_fifo(&rscp->cqid_fifo, &rscp->cqid_fifo_lock,
  144. nr_cqid, 1, 0);
  145. if (err)
  146. goto cqid_err;
  147. err = cxio_init_resource_fifo(&rscp->pdid_fifo, &rscp->pdid_fifo_lock,
  148. nr_pdid, 1, 0);
  149. if (err)
  150. goto pdid_err;
  151. return 0;
  152. pdid_err:
  153. kfifo_free(rscp->cqid_fifo);
  154. cqid_err:
  155. kfifo_free(rscp->qpid_fifo);
  156. qpid_err:
  157. kfifo_free(rscp->tpt_fifo);
  158. tpt_err:
  159. return -ENOMEM;
  160. }
  161. /*
  162. * returns 0 if no resource available
  163. */
  164. static u32 cxio_hal_get_resource(struct kfifo *fifo)
  165. {
  166. u32 entry;
  167. if (kfifo_get(fifo, (unsigned char *) &entry, sizeof(u32)))
  168. return entry;
  169. else
  170. return 0; /* fifo emptry */
  171. }
  172. static void cxio_hal_put_resource(struct kfifo *fifo, u32 entry)
  173. {
  174. BUG_ON(kfifo_put(fifo, (unsigned char *) &entry, sizeof(u32)) == 0);
  175. }
  176. u32 cxio_hal_get_stag(struct cxio_hal_resource *rscp)
  177. {
  178. return cxio_hal_get_resource(rscp->tpt_fifo);
  179. }
  180. void cxio_hal_put_stag(struct cxio_hal_resource *rscp, u32 stag)
  181. {
  182. cxio_hal_put_resource(rscp->tpt_fifo, stag);
  183. }
  184. u32 cxio_hal_get_qpid(struct cxio_hal_resource *rscp)
  185. {
  186. u32 qpid = cxio_hal_get_resource(rscp->qpid_fifo);
  187. PDBG("%s qpid 0x%x\n", __FUNCTION__, qpid);
  188. return qpid;
  189. }
  190. void cxio_hal_put_qpid(struct cxio_hal_resource *rscp, u32 qpid)
  191. {
  192. PDBG("%s qpid 0x%x\n", __FUNCTION__, qpid);
  193. cxio_hal_put_resource(rscp->qpid_fifo, qpid);
  194. }
  195. u32 cxio_hal_get_cqid(struct cxio_hal_resource *rscp)
  196. {
  197. return cxio_hal_get_resource(rscp->cqid_fifo);
  198. }
  199. void cxio_hal_put_cqid(struct cxio_hal_resource *rscp, u32 cqid)
  200. {
  201. cxio_hal_put_resource(rscp->cqid_fifo, cqid);
  202. }
  203. u32 cxio_hal_get_pdid(struct cxio_hal_resource *rscp)
  204. {
  205. return cxio_hal_get_resource(rscp->pdid_fifo);
  206. }
  207. void cxio_hal_put_pdid(struct cxio_hal_resource *rscp, u32 pdid)
  208. {
  209. cxio_hal_put_resource(rscp->pdid_fifo, pdid);
  210. }
  211. void cxio_hal_destroy_resource(struct cxio_hal_resource *rscp)
  212. {
  213. kfifo_free(rscp->tpt_fifo);
  214. kfifo_free(rscp->cqid_fifo);
  215. kfifo_free(rscp->qpid_fifo);
  216. kfifo_free(rscp->pdid_fifo);
  217. kfree(rscp);
  218. }
  219. /*
  220. * PBL Memory Manager. Uses Linux generic allocator.
  221. */
  222. #define MIN_PBL_SHIFT 8 /* 256B == min PBL size (32 entries) */
  223. #define PBL_CHUNK 2*1024*1024
  224. u32 cxio_hal_pblpool_alloc(struct cxio_rdev *rdev_p, int size)
  225. {
  226. unsigned long addr = gen_pool_alloc(rdev_p->pbl_pool, size);
  227. PDBG("%s addr 0x%x size %d\n", __FUNCTION__, (u32)addr, size);
  228. return (u32)addr;
  229. }
  230. void cxio_hal_pblpool_free(struct cxio_rdev *rdev_p, u32 addr, int size)
  231. {
  232. PDBG("%s addr 0x%x size %d\n", __FUNCTION__, addr, size);
  233. gen_pool_free(rdev_p->pbl_pool, (unsigned long)addr, size);
  234. }
  235. int cxio_hal_pblpool_create(struct cxio_rdev *rdev_p)
  236. {
  237. unsigned long i;
  238. rdev_p->pbl_pool = gen_pool_create(MIN_PBL_SHIFT, -1);
  239. if (rdev_p->pbl_pool)
  240. for (i = rdev_p->rnic_info.pbl_base;
  241. i <= rdev_p->rnic_info.pbl_top - PBL_CHUNK + 1;
  242. i += PBL_CHUNK)
  243. gen_pool_add(rdev_p->pbl_pool, i, PBL_CHUNK, -1);
  244. return rdev_p->pbl_pool ? 0 : -ENOMEM;
  245. }
  246. void cxio_hal_pblpool_destroy(struct cxio_rdev *rdev_p)
  247. {
  248. gen_pool_destroy(rdev_p->pbl_pool);
  249. }
  250. /*
  251. * RQT Memory Manager. Uses Linux generic allocator.
  252. */
  253. #define MIN_RQT_SHIFT 10 /* 1KB == mini RQT size (16 entries) */
  254. #define RQT_CHUNK 2*1024*1024
  255. u32 cxio_hal_rqtpool_alloc(struct cxio_rdev *rdev_p, int size)
  256. {
  257. unsigned long addr = gen_pool_alloc(rdev_p->rqt_pool, size << 6);
  258. PDBG("%s addr 0x%x size %d\n", __FUNCTION__, (u32)addr, size << 6);
  259. return (u32)addr;
  260. }
  261. void cxio_hal_rqtpool_free(struct cxio_rdev *rdev_p, u32 addr, int size)
  262. {
  263. PDBG("%s addr 0x%x size %d\n", __FUNCTION__, addr, size << 6);
  264. gen_pool_free(rdev_p->rqt_pool, (unsigned long)addr, size << 6);
  265. }
  266. int cxio_hal_rqtpool_create(struct cxio_rdev *rdev_p)
  267. {
  268. unsigned long i;
  269. rdev_p->rqt_pool = gen_pool_create(MIN_RQT_SHIFT, -1);
  270. if (rdev_p->rqt_pool)
  271. for (i = rdev_p->rnic_info.rqt_base;
  272. i <= rdev_p->rnic_info.rqt_top - RQT_CHUNK + 1;
  273. i += RQT_CHUNK)
  274. gen_pool_add(rdev_p->rqt_pool, i, RQT_CHUNK, -1);
  275. return rdev_p->rqt_pool ? 0 : -ENOMEM;
  276. }
  277. void cxio_hal_rqtpool_destroy(struct cxio_rdev *rdev_p)
  278. {
  279. gen_pool_destroy(rdev_p->rqt_pool);
  280. }