2 * Copyright (c) 2006 Chelsio, Inc. All rights reserved.
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:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
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.
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
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"
42 static struct kfifo rhdl_fifo
;
43 static spinlock_t rhdl_fifo_lock
;
45 #define RANDOM_SIZE 16
47 static int __cxio_init_resource_fifo(struct kfifo
*fifo
,
48 spinlock_t
*fifo_lock
,
53 u32 i
, j
, entry
= 0, idx
;
56 spin_lock_init(fifo_lock
);
58 if (kfifo_alloc(fifo
, nr
* sizeof(u32
), GFP_KERNEL
))
61 for (i
= 0; i
< skip_low
+ skip_high
; i
++)
62 kfifo_in(fifo
, (unsigned char *) &entry
, sizeof(u32
));
65 random_bytes
= prandom_u32();
66 for (i
= 0; i
< RANDOM_SIZE
; i
++)
67 rarray
[i
] = i
+ skip_low
;
68 for (i
= skip_low
+ RANDOM_SIZE
; i
< nr
- skip_high
; i
++) {
69 if (j
>= RANDOM_SIZE
) {
71 random_bytes
= prandom_u32();
73 idx
= (random_bytes
>> (j
* 2)) & 0xF;
75 (unsigned char *) &rarray
[idx
],
80 for (i
= 0; i
< RANDOM_SIZE
; i
++)
82 (unsigned char *) &rarray
[i
],
85 for (i
= skip_low
; i
< nr
- skip_high
; i
++)
86 kfifo_in(fifo
, (unsigned char *) &i
, sizeof(u32
));
88 for (i
= 0; i
< skip_low
+ skip_high
; i
++)
89 if (kfifo_out_locked(fifo
, (unsigned char *) &entry
,
90 sizeof(u32
), fifo_lock
) != 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 if (kfifo_alloc(&rdev_p
->rscp
->qpid_fifo
, T3_MAX_NUM_QP
* sizeof(u32
),
121 for (i
= 16; i
< T3_MAX_NUM_QP
; i
++)
122 if (!(i
& rdev_p
->qpmask
))
123 kfifo_in(&rdev_p
->rscp
->qpid_fifo
,
124 (unsigned char *) &i
, sizeof(u32
));
128 int cxio_hal_init_rhdl_resource(u32 nr_rhdl
)
130 return cxio_init_resource_fifo(&rhdl_fifo
, &rhdl_fifo_lock
, nr_rhdl
, 1,
134 void cxio_hal_destroy_rhdl_resource(void)
136 kfifo_free(&rhdl_fifo
);
139 /* nr_* must be power of 2 */
140 int cxio_hal_init_resource(struct cxio_rdev
*rdev_p
,
141 u32 nr_tpt
, u32 nr_pbl
,
142 u32 nr_rqt
, u32 nr_qpid
, u32 nr_cqid
, u32 nr_pdid
)
145 struct cxio_hal_resource
*rscp
;
147 rscp
= kmalloc(sizeof(*rscp
), GFP_KERNEL
);
151 err
= cxio_init_resource_fifo_random(&rscp
->tpt_fifo
,
152 &rscp
->tpt_fifo_lock
,
156 err
= cxio_init_qpid_fifo(rdev_p
);
159 err
= cxio_init_resource_fifo(&rscp
->cqid_fifo
, &rscp
->cqid_fifo_lock
,
163 err
= cxio_init_resource_fifo(&rscp
->pdid_fifo
, &rscp
->pdid_fifo_lock
,
169 kfifo_free(&rscp
->cqid_fifo
);
171 kfifo_free(&rscp
->qpid_fifo
);
173 kfifo_free(&rscp
->tpt_fifo
);
179 * returns 0 if no resource available
181 static u32
cxio_hal_get_resource(struct kfifo
*fifo
, spinlock_t
* lock
)
184 if (kfifo_out_locked(fifo
, (unsigned char *) &entry
, sizeof(u32
), lock
))
187 return 0; /* fifo emptry */
190 static void cxio_hal_put_resource(struct kfifo
*fifo
, spinlock_t
* lock
,
194 kfifo_in_locked(fifo
, (unsigned char *) &entry
, sizeof(u32
), lock
)
198 u32
cxio_hal_get_stag(struct cxio_hal_resource
*rscp
)
200 return cxio_hal_get_resource(&rscp
->tpt_fifo
, &rscp
->tpt_fifo_lock
);
203 void cxio_hal_put_stag(struct cxio_hal_resource
*rscp
, u32 stag
)
205 cxio_hal_put_resource(&rscp
->tpt_fifo
, &rscp
->tpt_fifo_lock
, stag
);
208 u32
cxio_hal_get_qpid(struct cxio_hal_resource
*rscp
)
210 u32 qpid
= cxio_hal_get_resource(&rscp
->qpid_fifo
,
211 &rscp
->qpid_fifo_lock
);
212 PDBG("%s qpid 0x%x\n", __func__
, qpid
);
216 void cxio_hal_put_qpid(struct cxio_hal_resource
*rscp
, u32 qpid
)
218 PDBG("%s qpid 0x%x\n", __func__
, qpid
);
219 cxio_hal_put_resource(&rscp
->qpid_fifo
, &rscp
->qpid_fifo_lock
, qpid
);
222 u32
cxio_hal_get_cqid(struct cxio_hal_resource
*rscp
)
224 return cxio_hal_get_resource(&rscp
->cqid_fifo
, &rscp
->cqid_fifo_lock
);
227 void cxio_hal_put_cqid(struct cxio_hal_resource
*rscp
, u32 cqid
)
229 cxio_hal_put_resource(&rscp
->cqid_fifo
, &rscp
->cqid_fifo_lock
, cqid
);
232 u32
cxio_hal_get_pdid(struct cxio_hal_resource
*rscp
)
234 return cxio_hal_get_resource(&rscp
->pdid_fifo
, &rscp
->pdid_fifo_lock
);
237 void cxio_hal_put_pdid(struct cxio_hal_resource
*rscp
, u32 pdid
)
239 cxio_hal_put_resource(&rscp
->pdid_fifo
, &rscp
->pdid_fifo_lock
, pdid
);
242 void cxio_hal_destroy_resource(struct cxio_hal_resource
*rscp
)
244 kfifo_free(&rscp
->tpt_fifo
);
245 kfifo_free(&rscp
->cqid_fifo
);
246 kfifo_free(&rscp
->qpid_fifo
);
247 kfifo_free(&rscp
->pdid_fifo
);
252 * PBL Memory Manager. Uses Linux generic allocator.
255 #define MIN_PBL_SHIFT 8 /* 256B == min PBL size (32 entries) */
257 u32
cxio_hal_pblpool_alloc(struct cxio_rdev
*rdev_p
, int size
)
259 unsigned long addr
= gen_pool_alloc(rdev_p
->pbl_pool
, size
);
260 PDBG("%s addr 0x%x size %d\n", __func__
, (u32
)addr
, size
);
264 void cxio_hal_pblpool_free(struct cxio_rdev
*rdev_p
, u32 addr
, int size
)
266 PDBG("%s addr 0x%x size %d\n", __func__
, addr
, size
);
267 gen_pool_free(rdev_p
->pbl_pool
, (unsigned long)addr
, size
);
270 int cxio_hal_pblpool_create(struct cxio_rdev
*rdev_p
)
272 unsigned pbl_start
, pbl_chunk
;
274 rdev_p
->pbl_pool
= gen_pool_create(MIN_PBL_SHIFT
, -1);
275 if (!rdev_p
->pbl_pool
)
278 pbl_start
= rdev_p
->rnic_info
.pbl_base
;
279 pbl_chunk
= rdev_p
->rnic_info
.pbl_top
- pbl_start
+ 1;
281 while (pbl_start
< rdev_p
->rnic_info
.pbl_top
) {
282 pbl_chunk
= min(rdev_p
->rnic_info
.pbl_top
- pbl_start
+ 1,
284 if (gen_pool_add(rdev_p
->pbl_pool
, pbl_start
, pbl_chunk
, -1)) {
285 PDBG("%s failed to add PBL chunk (%x/%x)\n",
286 __func__
, pbl_start
, pbl_chunk
);
287 if (pbl_chunk
<= 1024 << MIN_PBL_SHIFT
) {
288 printk(KERN_WARNING MOD
"%s: Failed to add all PBL chunks (%x/%x)\n",
289 __func__
, pbl_start
, rdev_p
->rnic_info
.pbl_top
- pbl_start
);
294 PDBG("%s added PBL chunk (%x/%x)\n",
295 __func__
, pbl_start
, pbl_chunk
);
296 pbl_start
+= pbl_chunk
;
303 void cxio_hal_pblpool_destroy(struct cxio_rdev
*rdev_p
)
305 gen_pool_destroy(rdev_p
->pbl_pool
);
309 * RQT Memory Manager. Uses Linux generic allocator.
312 #define MIN_RQT_SHIFT 10 /* 1KB == mini RQT size (16 entries) */
313 #define RQT_CHUNK 2*1024*1024
315 u32
cxio_hal_rqtpool_alloc(struct cxio_rdev
*rdev_p
, int size
)
317 unsigned long addr
= gen_pool_alloc(rdev_p
->rqt_pool
, size
<< 6);
318 PDBG("%s addr 0x%x size %d\n", __func__
, (u32
)addr
, size
<< 6);
322 void cxio_hal_rqtpool_free(struct cxio_rdev
*rdev_p
, u32 addr
, int size
)
324 PDBG("%s addr 0x%x size %d\n", __func__
, addr
, size
<< 6);
325 gen_pool_free(rdev_p
->rqt_pool
, (unsigned long)addr
, size
<< 6);
328 int cxio_hal_rqtpool_create(struct cxio_rdev
*rdev_p
)
331 rdev_p
->rqt_pool
= gen_pool_create(MIN_RQT_SHIFT
, -1);
332 if (rdev_p
->rqt_pool
)
333 for (i
= rdev_p
->rnic_info
.rqt_base
;
334 i
<= rdev_p
->rnic_info
.rqt_top
- RQT_CHUNK
+ 1;
336 gen_pool_add(rdev_p
->rqt_pool
, i
, RQT_CHUNK
, -1);
337 return rdev_p
->rqt_pool
? 0 : -ENOMEM
;
340 void cxio_hal_rqtpool_destroy(struct cxio_rdev
*rdev_p
)
342 gen_pool_destroy(rdev_p
->rqt_pool
);