| Linux kernel & device driver programming |
| [ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] |
1 /* 1
2 * Copyright (c) 2006, 2007 Cisco Systems, Inc
3 * Copyright (c) 2007, 2008 Mellanox Technolog
4 *
5 * This software is available to you under a c
6 * licenses. You may choose to be licensed un
7 * General Public License (GPL) Version 2, ava
8 * COPYING in the main directory of this sourc
9 * OpenIB.org BSD license below:
10 *
11 * Redistribution and use in source and bi
12 * without modification, are permitted pro
13 * conditions are met:
14 *
15 * - Redistributions of source code must
16 * copyright notice, this list of condi
17 * disclaimer.
18 *
19 * - Redistributions in binary form must
20 * copyright notice, this list of condi
21 * disclaimer in the documentation and/
22 * provided with the distribution.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT W
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMIT
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR P
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTH
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER L
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARIS
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR
31 * SOFTWARE.
32 */
33
34 #include <linux/errno.h>
35 #include <linux/slab.h>
36 #include <linux/mm.h>
37 #include <linux/bitmap.h>
38 #include <linux/dma-mapping.h>
39 #include <linux/vmalloc.h>
40
41 #include "mlx4.h"
42
43 u32 mlx4_bitmap_alloc(struct mlx4_bitmap *bitm
44 {
45 u32 obj;
46
47 spin_lock(&bitmap->lock);
48
49 obj = find_next_zero_bit(bitmap->table
50 if (obj >= bitmap->max) {
51 bitmap->top = (bitmap->top + b
52 & bitmap->mask
53 obj = find_first_zero_bit(bitm
54 }
55
56 if (obj < bitmap->max) {
57 set_bit(obj, bitmap->table);
58 bitmap->last = (obj + 1);
59 if (bitmap->last == bitmap->ma
60 bitmap->last = 0;
61 obj |= bitmap->top;
62 } else
63 obj = -1;
64
65 spin_unlock(&bitmap->lock);
66
67 return obj;
68 }
69
70 void mlx4_bitmap_free(struct mlx4_bitmap *bitm
71 {
72 mlx4_bitmap_free_range(bitmap, obj, 1)
73 }
74
75 static unsigned long find_aligned_range(unsign
76 u32 st
77 int le
78 {
79 unsigned long end, i;
80
81 again:
82 start = ALIGN(start, align);
83
84 while ((start < nbits) && test_bit(sta
85 start += align;
86
87 if (start >= nbits)
88 return -1;
89
90 end = start+len;
91 if (end > nbits)
92 return -1;
93
94 for (i = start + 1; i < end; i++) {
95 if (test_bit(i, bitmap)) {
96 start = i + 1;
97 goto again;
98 }
99 }
100
101 return start;
102 }
103
104 u32 mlx4_bitmap_alloc_range(struct mlx4_bitmap
105 {
106 u32 obj, i;
107
108 if (likely(cnt == 1 && align == 1))
109 return mlx4_bitmap_alloc(bitma
110
111 spin_lock(&bitmap->lock);
112
113 obj = find_aligned_range(bitmap->table
114 bitmap->max,
115 if (obj >= bitmap->max) {
116 bitmap->top = (bitmap->top + b
117 & bitmap->mask
118 obj = find_aligned_range(bitma
119 cnt,
120 }
121
122 if (obj < bitmap->max) {
123 for (i = 0; i < cnt; i++)
124 set_bit(obj + i, bitma
125 if (obj == bitmap->last) {
126 bitmap->last = (obj +
127 if (bitmap->last >= bi
128 bitmap->last =
129 }
130 obj |= bitmap->top;
131 } else
132 obj = -1;
133
134 spin_unlock(&bitmap->lock);
135
136 return obj;
137 }
138
139 void mlx4_bitmap_free_range(struct mlx4_bitmap
140 {
141 u32 i;
142
143 obj &= bitmap->max + bitmap->reserved_
144
145 spin_lock(&bitmap->lock);
146 for (i = 0; i < cnt; i++)
147 clear_bit(obj + i, bitmap->tab
148 bitmap->last = min(bitmap->last, obj);
149 bitmap->top = (bitmap->top + bitmap->m
150 & bitmap->mask;
151 spin_unlock(&bitmap->lock);
152 }
153
154 int mlx4_bitmap_init(struct mlx4_bitmap *bitma
155 u32 reserved_bot, u32 res
156 {
157 int i;
158
159 /* num must be a power of 2 */
160 if (num != roundup_pow_of_two(num))
161 return -EINVAL;
162
163 bitmap->last = 0;
164 bitmap->top = 0;
165 bitmap->max = num - reserved_top;
166 bitmap->mask = mask;
167 bitmap->reserved_top = reserved_top;
168 spin_lock_init(&bitmap->lock);
169 bitmap->table = kzalloc(BITS_TO_LONGS(
170 sizeof (long),
171 if (!bitmap->table)
172 return -ENOMEM;
173
174 for (i = 0; i < reserved_bot; ++i)
175 set_bit(i, bitmap->table);
176
177 return 0;
178 }
179
180 void mlx4_bitmap_cleanup(struct mlx4_bitmap *b
181 {
182 kfree(bitmap->table);
183 }
184
185 /*
186 * Handling for queue buffers -- we allocate a
187 * register it in a memory region at HCA virtu
188 * requested size is > max_direct, we split th
189 * multiple pages, so we don't require too muc
190 */
191
192 int mlx4_buf_alloc(struct mlx4_dev *dev, int s
193 struct mlx4_buf *buf)
194 {
195 dma_addr_t t;
196
197 if (size <= max_direct) {
198 buf->nbufs = 1;
199 buf->npages = 1;
200 buf->page_shift = get_order(
201 buf->direct.buf = dma_alloc_
202
203 if (!buf->direct.buf)
204 return -ENOMEM;
205
206 buf->direct.map = t;
207
208 while (t & ((1 << buf->page_sh
209 --buf->page_shift;
210 buf->npages *= 2;
211 }
212
213 memset(buf->direct.buf, 0, siz
214 } else {
215 int i;
216
217 buf->nbufs = (size + PAG
218 buf->npages = buf->nbufs;
219 buf->page_shift = PAGE_SHIFT;
220 buf->page_list = kzalloc(buf
221 GFP
222 if (!buf->page_list)
223 return -ENOMEM;
224
225 for (i = 0; i < buf->nbufs; ++
226 buf->page_list[i].buf
227 dma_alloc_cohe
228
229 if (!buf->page_list[i]
230 goto err_free;
231
232 buf->page_list[i].map
233
234 memset(buf->page_list[
235 }
236
237 if (BITS_PER_LONG == 64) {
238 struct page **pages;
239 pages = kmalloc(sizeof
240 if (!pages)
241 goto err_free;
242 for (i = 0; i < buf->n
243 pages[i] = vir
244 buf->direct.buf = vmap
245 kfree(pages);
246 if (!buf->direct.buf)
247 goto err_free;
248 }
249 }
250
251 return 0;
252
253 err_free:
254 mlx4_buf_free(dev, size, buf);
255
256 return -ENOMEM;
257 }
258 EXPORT_SYMBOL_GPL(mlx4_buf_alloc);
259
260 void mlx4_buf_free(struct mlx4_dev *dev, int s
261 {
262 int i;
263
264 if (buf->nbufs == 1)
265 dma_free_coherent(&dev->pdev->
266 buf->direct.
267 else {
268 if (BITS_PER_LONG == 64)
269 vunmap(buf->direct.buf
270
271 for (i = 0; i < buf->nbufs; ++
272 if (buf->page_list[i].
273 dma_free_coher
274
275
276 kfree(buf->page_list);
277 }
278 }
279 EXPORT_SYMBOL_GPL(mlx4_buf_free);
280
281 static struct mlx4_db_pgdir *mlx4_alloc_db_pgd
282 {
283 struct mlx4_db_pgdir *pgdir;
284
285 pgdir = kzalloc(sizeof *pgdir, GFP_KER
286 if (!pgdir)
287 return NULL;
288
289 bitmap_fill(pgdir->order1, MLX4_DB_PER
290 pgdir->bits[0] = pgdir->order0;
291 pgdir->bits[1] = pgdir->order1;
292 pgdir->db_page = dma_alloc_coherent(dm
293 &p
294 if (!pgdir->db_page) {
295 kfree(pgdir);
296 return NULL;
297 }
298
299 return pgdir;
300 }
301
302 static int mlx4_alloc_db_from_pgdir(struct mlx
303 struct mlx
304 {
305 int o;
306 int i;
307
308 for (o = order; o <= 1; ++o) {
309 i = find_first_bit(pgdir->bits
310 if (i < MLX4_DB_PER_PAGE >> o)
311 goto found;
312 }
313
314 return -ENOMEM;
315
316 found:
317 clear_bit(i, pgdir->bits[o]);
318
319 i <<= o;
320
321 if (o > order)
322 set_bit(i ^ 1, pgdir->bits[ord
323
324 db->u.pgdir = pgdir;
325 db->index = i;
326 db->db = pgdir->db_page + db->ind
327 db->dma = pgdir->db_dma + db->ind
328 db->order = order;
329
330 return 0;
331 }
332
333 int mlx4_db_alloc(struct mlx4_dev *dev, struct
334 {
335 struct mlx4_priv *priv = mlx4_priv(dev
336 struct mlx4_db_pgdir *pgdir;
337 int ret = 0;
338
339 mutex_lock(&priv->pgdir_mutex);
340
341 list_for_each_entry(pgdir, &priv->pgdi
342 if (!mlx4_alloc_db_from_pgdir(
343 goto out;
344
345 pgdir = mlx4_alloc_db_pgdir(&(dev->pde
346 if (!pgdir) {
347 ret = -ENOMEM;
348 goto out;
349 }
350
351 list_add(&pgdir->list, &priv->pgdir_li
352
353 /* This should never fail -- we just a
354 WARN_ON(mlx4_alloc_db_from_pgdir(pgdir
355
356 out:
357 mutex_unlock(&priv->pgdir_mutex);
358
359 return ret;
360 }
361 EXPORT_SYMBOL_GPL(mlx4_db_alloc);
362
363 void mlx4_db_free(struct mlx4_dev *dev, struct
364 {
365 struct mlx4_priv *priv = mlx4_priv(dev
366 int o;
367 int i;
368
369 mutex_lock(&priv->pgdir_mutex);
370
371 o = db->order;
372 i = db->index;
373
374 if (db->order == 0 && test_bit(i ^ 1,
375 clear_bit(i ^ 1, db->u.pgdir->
376 ++o;
377 }
378 i >>= o;
379 set_bit(i, db->u.pgdir->bits[o]);
380
381 if (bitmap_full(db->u.pgdir->order1, M
382 dma_free_coherent(&(dev->pdev-
383 db->u.pgdir-
384 list_del(&db->u.pgdir->list);
385 kfree(db->u.pgdir);
386 }
387
388 mutex_unlock(&priv->pgdir_mutex);
389 }
390 EXPORT_SYMBOL_GPL(mlx4_db_free);
391
392 int mlx4_alloc_hwq_res(struct mlx4_dev *dev, s
393 int size, int max_direc
394 {
395 int err;
396
397 err = mlx4_db_alloc(dev, &wqres->db, 1
398 if (err)
399 return err;
400
401 *wqres->db.db = 0;
402
403 err = mlx4_buf_alloc(dev, size, max_di
404 if (err)
405 goto err_db;
406
407 err = mlx4_mtt_init(dev, wqres->buf.np
408 &wqres->mtt);
409 if (err)
410 goto err_buf;
411
412 err = mlx4_buf_write_mtt(dev, &wqres->
413 if (err)
414 goto err_mtt;
415
416 return 0;
417
418 err_mtt:
419 mlx4_mtt_cleanup(dev, &wqres->mtt);
420 err_buf:
421 mlx4_buf_free(dev, size, &wqres->buf);
422 err_db:
423 mlx4_db_free(dev, &wqres->db);
424
425 return err;
426 }
427 EXPORT_SYMBOL_GPL(mlx4_alloc_hwq_res);
428
429 void mlx4_free_hwq_res(struct mlx4_dev *dev, s
430 int size)
431 {
432 mlx4_mtt_cleanup(dev, &wqres->mtt);
433 mlx4_buf_free(dev, size, &wqres->buf);
434 mlx4_db_free(dev, &wqres->db);
435 }
436 EXPORT_SYMBOL_GPL(mlx4_free_hwq_res);
437
| This page was automatically generated by the LXR engine. |