2 * Copyright (c) 2006 Chelsio, Inc. All rights reserved.
3 * Copyright (c) 2006 Open Grid Computing, Inc. All rights reserved.
5 * This software is available to you under a choice of one of two
6 * licenses. You may choose to be licensed under the terms of the GNU
7 * General Public License (GPL) Version 2, available from the file
8 * COPYING in the main directory of this source tree, or the
9 * OpenIB.org BSD license below:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
33 /* Crude resource management */
34 #include <linux/kernel.h>
35 #include <linux/random.h>
36 #include <linux/slab.h>
37 #include <linux/kfifo.h>
38 #include <linux/spinlock.h>
39 #include <linux/errno.h>
40 #include "cxio_resource.h"
43 static struct kfifo *rhdl_fifo;
44 static spinlock_t rhdl_fifo_lock;
46 #define RANDOM_SIZE 16
48 static int __cxio_init_resource_fifo(struct kfifo **fifo,
49 spinlock_t *fifo_lock,
54 u32 i, j, entry = 0, idx;
57 spin_lock_init(fifo_lock);
59 *fifo = kfifo_alloc(nr * sizeof(u32), GFP_KERNEL, fifo_lock);
63 for (i = 0; i < skip_low + skip_high; i++)
64 __kfifo_put(*fifo, (unsigned char *) &entry, sizeof(u32));
67 random_bytes = random32();
68 for (i = 0; i < RANDOM_SIZE; i++)
69 rarray[i] = i + skip_low;
70 for (i = skip_low + RANDOM_SIZE; i < nr - skip_high; i++) {
71 if (j >= RANDOM_SIZE) {
73 random_bytes = random32();
75 idx = (random_bytes >> (j * 2)) & 0xF;
77 (unsigned char *) &rarray[idx],
82 for (i = 0; i < RANDOM_SIZE; i++)
84 (unsigned char *) &rarray[i],
87 for (i = skip_low; i < nr - skip_high; i++)
88 __kfifo_put(*fifo, (unsigned char *) &i, sizeof(u32));
90 for (i = 0; i < skip_low + skip_high; i++)
91 kfifo_get(*fifo, (unsigned char *) &entry, sizeof(u32));
95 static int cxio_init_resource_fifo(struct kfifo **fifo, spinlock_t * fifo_lock,
96 u32 nr, u32 skip_low, u32 skip_high)
98 return (__cxio_init_resource_fifo(fifo, fifo_lock, nr, skip_low,
102 static int cxio_init_resource_fifo_random(struct kfifo **fifo,
103 spinlock_t * fifo_lock,
104 u32 nr, u32 skip_low, u32 skip_high)
107 return (__cxio_init_resource_fifo(fifo, fifo_lock, nr, skip_low,
111 static int cxio_init_qpid_fifo(struct cxio_rdev *rdev_p)
115 spin_lock_init(&rdev_p->rscp->qpid_fifo_lock);
117 rdev_p->rscp->qpid_fifo = kfifo_alloc(T3_MAX_NUM_QP * sizeof(u32),
119 &rdev_p->rscp->qpid_fifo_lock);
120 if (IS_ERR(rdev_p->rscp->qpid_fifo))
123 for (i = 16; i < T3_MAX_NUM_QP; i++)
124 if (!(i & rdev_p->qpmask))
125 __kfifo_put(rdev_p->rscp->qpid_fifo,
126 (unsigned char *) &i, sizeof(u32));
130 int cxio_hal_init_rhdl_resource(u32 nr_rhdl)
132 return cxio_init_resource_fifo(&rhdl_fifo, &rhdl_fifo_lock, nr_rhdl, 1,
136 void cxio_hal_destroy_rhdl_resource(void)
138 kfifo_free(rhdl_fifo);
141 /* nr_* must be power of 2 */
142 int cxio_hal_init_resource(struct cxio_rdev *rdev_p,
143 u32 nr_tpt, u32 nr_pbl,
144 u32 nr_rqt, u32 nr_qpid, u32 nr_cqid, u32 nr_pdid)
147 struct cxio_hal_resource *rscp;
149 rscp = kmalloc(sizeof(*rscp), GFP_KERNEL);
153 err = cxio_init_resource_fifo_random(&rscp->tpt_fifo,
154 &rscp->tpt_fifo_lock,
158 err = cxio_init_qpid_fifo(rdev_p);
161 err = cxio_init_resource_fifo(&rscp->cqid_fifo, &rscp->cqid_fifo_lock,
165 err = cxio_init_resource_fifo(&rscp->pdid_fifo, &rscp->pdid_fifo_lock,
171 kfifo_free(rscp->cqid_fifo);
173 kfifo_free(rscp->qpid_fifo);
175 kfifo_free(rscp->tpt_fifo);
181 * returns 0 if no resource available
183 static inline u32 cxio_hal_get_resource(struct kfifo *fifo)
186 if (kfifo_get(fifo, (unsigned char *) &entry, sizeof(u32)))
189 return 0; /* fifo emptry */
192 static inline void cxio_hal_put_resource(struct kfifo *fifo, u32 entry)
194 BUG_ON(kfifo_put(fifo, (unsigned char *) &entry, sizeof(u32)) == 0);
197 u32 cxio_hal_get_rhdl(void)
199 return cxio_hal_get_resource(rhdl_fifo);
202 void cxio_hal_put_rhdl(u32 rhdl)
204 cxio_hal_put_resource(rhdl_fifo, rhdl);
207 u32 cxio_hal_get_stag(struct cxio_hal_resource *rscp)
209 return cxio_hal_get_resource(rscp->tpt_fifo);
212 void cxio_hal_put_stag(struct cxio_hal_resource *rscp, u32 stag)
214 cxio_hal_put_resource(rscp->tpt_fifo, stag);
217 u32 cxio_hal_get_qpid(struct cxio_hal_resource *rscp)
219 u32 qpid = cxio_hal_get_resource(rscp->qpid_fifo);
220 PDBG("%s qpid 0x%x\n", __FUNCTION__, qpid);
224 void cxio_hal_put_qpid(struct cxio_hal_resource *rscp, u32 qpid)
226 PDBG("%s qpid 0x%x\n", __FUNCTION__, qpid);
227 cxio_hal_put_resource(rscp->qpid_fifo, qpid);
230 u32 cxio_hal_get_cqid(struct cxio_hal_resource *rscp)
232 return cxio_hal_get_resource(rscp->cqid_fifo);
235 void cxio_hal_put_cqid(struct cxio_hal_resource *rscp, u32 cqid)
237 cxio_hal_put_resource(rscp->cqid_fifo, cqid);
240 u32 cxio_hal_get_pdid(struct cxio_hal_resource *rscp)
242 return cxio_hal_get_resource(rscp->pdid_fifo);
245 void cxio_hal_put_pdid(struct cxio_hal_resource *rscp, u32 pdid)
247 cxio_hal_put_resource(rscp->pdid_fifo, pdid);
250 void cxio_hal_destroy_resource(struct cxio_hal_resource *rscp)
252 kfifo_free(rscp->tpt_fifo);
253 kfifo_free(rscp->cqid_fifo);
254 kfifo_free(rscp->qpid_fifo);
255 kfifo_free(rscp->pdid_fifo);
260 * PBL Memory Manager. Uses Linux generic allocator.
263 #define MIN_PBL_SHIFT 8 /* 256B == min PBL size (32 entries) */
264 #define PBL_CHUNK 2*1024*1024
266 u32 cxio_hal_pblpool_alloc(struct cxio_rdev *rdev_p, int size)
268 unsigned long addr = gen_pool_alloc(rdev_p->pbl_pool, size);
269 PDBG("%s addr 0x%x size %d\n", __FUNCTION__, (u32)addr, size);
273 void cxio_hal_pblpool_free(struct cxio_rdev *rdev_p, u32 addr, int size)
275 PDBG("%s addr 0x%x size %d\n", __FUNCTION__, addr, size);
276 gen_pool_free(rdev_p->pbl_pool, (unsigned long)addr, size);
279 int cxio_hal_pblpool_create(struct cxio_rdev *rdev_p)
282 rdev_p->pbl_pool = gen_pool_create(MIN_PBL_SHIFT, -1);
283 if (rdev_p->pbl_pool)
284 for (i = rdev_p->rnic_info.pbl_base;
285 i <= rdev_p->rnic_info.pbl_top - PBL_CHUNK + 1;
287 gen_pool_add(rdev_p->pbl_pool, i, PBL_CHUNK, -1);
288 return rdev_p->pbl_pool ? 0 : -ENOMEM;
291 void cxio_hal_pblpool_destroy(struct cxio_rdev *rdev_p)
293 gen_pool_destroy(rdev_p->pbl_pool);
297 * RQT Memory Manager. Uses Linux generic allocator.
300 #define MIN_RQT_SHIFT 10 /* 1KB == mini RQT size (16 entries) */
301 #define RQT_CHUNK 2*1024*1024
303 u32 cxio_hal_rqtpool_alloc(struct cxio_rdev *rdev_p, int size)
305 unsigned long addr = gen_pool_alloc(rdev_p->rqt_pool, size << 6);
306 PDBG("%s addr 0x%x size %d\n", __FUNCTION__, (u32)addr, size << 6);
310 void cxio_hal_rqtpool_free(struct cxio_rdev *rdev_p, u32 addr, int size)
312 PDBG("%s addr 0x%x size %d\n", __FUNCTION__, addr, size << 6);
313 gen_pool_free(rdev_p->rqt_pool, (unsigned long)addr, size << 6);
316 int cxio_hal_rqtpool_create(struct cxio_rdev *rdev_p)
319 rdev_p->rqt_pool = gen_pool_create(MIN_RQT_SHIFT, -1);
320 if (rdev_p->rqt_pool)
321 for (i = rdev_p->rnic_info.rqt_base;
322 i <= rdev_p->rnic_info.rqt_top - RQT_CHUNK + 1;
324 gen_pool_add(rdev_p->rqt_pool, i, RQT_CHUNK, -1);
325 return rdev_p->rqt_pool ? 0 : -ENOMEM;
328 void cxio_hal_rqtpool_destroy(struct cxio_rdev *rdev_p)
330 gen_pool_destroy(rdev_p->rqt_pool);