2 * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
3 * Copyright (c) 2007, 2008 Mellanox Technologies. 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
34 #include <linux/errno.h>
35 #include <linux/slab.h>
36 #include <linux/bitmap.h>
37 #include <linux/dma-mapping.h>
38 #include <linux/vmalloc.h>
42 u32 mlx4_bitmap_alloc(struct mlx4_bitmap *bitmap)
46 spin_lock(&bitmap->lock);
48 obj = find_next_zero_bit(bitmap->table, bitmap->max, bitmap->last);
49 if (obj >= bitmap->max) {
50 bitmap->top = (bitmap->top + bitmap->max + bitmap->reserved_top)
52 obj = find_first_zero_bit(bitmap->table, bitmap->max);
55 if (obj < bitmap->max) {
56 set_bit(obj, bitmap->table);
57 bitmap->last = (obj + 1);
58 if (bitmap->last == bitmap->max)
64 spin_unlock(&bitmap->lock);
69 void mlx4_bitmap_free(struct mlx4_bitmap *bitmap, u32 obj)
71 mlx4_bitmap_free_range(bitmap, obj, 1);
74 static unsigned long find_aligned_range(unsigned long *bitmap,
81 start = ALIGN(start, align);
83 while ((start < nbits) && test_bit(start, bitmap))
93 for (i = start + 1; i < end; i++) {
94 if (test_bit(i, bitmap)) {
103 u32 mlx4_bitmap_alloc_range(struct mlx4_bitmap *bitmap, int cnt, int align)
107 if (likely(cnt == 1 && align == 1))
108 return mlx4_bitmap_alloc(bitmap);
110 spin_lock(&bitmap->lock);
112 obj = find_aligned_range(bitmap->table, bitmap->last,
113 bitmap->max, cnt, align);
114 if (obj >= bitmap->max) {
115 bitmap->top = (bitmap->top + bitmap->max + bitmap->reserved_top)
117 obj = find_aligned_range(bitmap->table, 0, bitmap->max,
121 if (obj < bitmap->max) {
122 for (i = 0; i < cnt; i++)
123 set_bit(obj + i, bitmap->table);
124 if (obj == bitmap->last) {
125 bitmap->last = (obj + cnt);
126 if (bitmap->last >= bitmap->max)
133 spin_unlock(&bitmap->lock);
138 void mlx4_bitmap_free_range(struct mlx4_bitmap *bitmap, u32 obj, int cnt)
142 obj &= bitmap->max + bitmap->reserved_top - 1;
144 spin_lock(&bitmap->lock);
145 for (i = 0; i < cnt; i++)
146 clear_bit(obj + i, bitmap->table);
147 bitmap->last = min(bitmap->last, obj);
148 bitmap->top = (bitmap->top + bitmap->max + bitmap->reserved_top)
150 spin_unlock(&bitmap->lock);
153 int mlx4_bitmap_init(struct mlx4_bitmap *bitmap, u32 num, u32 mask,
154 u32 reserved_bot, u32 reserved_top)
158 /* num must be a power of 2 */
159 if (num != roundup_pow_of_two(num))
164 bitmap->max = num - reserved_top;
166 bitmap->reserved_top = reserved_top;
167 spin_lock_init(&bitmap->lock);
168 bitmap->table = kzalloc(BITS_TO_LONGS(bitmap->max) *
169 sizeof (long), GFP_KERNEL);
173 for (i = 0; i < reserved_bot; ++i)
174 set_bit(i, bitmap->table);
179 void mlx4_bitmap_cleanup(struct mlx4_bitmap *bitmap)
181 kfree(bitmap->table);
185 * Handling for queue buffers -- we allocate a bunch of memory and
186 * register it in a memory region at HCA virtual address 0. If the
187 * requested size is > max_direct, we split the allocation into
188 * multiple pages, so we don't require too much contiguous memory.
191 int mlx4_buf_alloc(struct mlx4_dev *dev, int size, int max_direct,
192 struct mlx4_buf *buf)
196 if (size <= max_direct) {
199 buf->page_shift = get_order(size) + PAGE_SHIFT;
200 buf->direct.buf = dma_alloc_coherent(&dev->pdev->dev,
201 size, &t, GFP_KERNEL);
202 if (!buf->direct.buf)
207 while (t & ((1 << buf->page_shift) - 1)) {
212 memset(buf->direct.buf, 0, size);
216 buf->nbufs = (size + PAGE_SIZE - 1) / PAGE_SIZE;
217 buf->npages = buf->nbufs;
218 buf->page_shift = PAGE_SHIFT;
219 buf->page_list = kzalloc(buf->nbufs * sizeof *buf->page_list,
224 for (i = 0; i < buf->nbufs; ++i) {
225 buf->page_list[i].buf =
226 dma_alloc_coherent(&dev->pdev->dev, PAGE_SIZE,
228 if (!buf->page_list[i].buf)
231 buf->page_list[i].map = t;
233 memset(buf->page_list[i].buf, 0, PAGE_SIZE);
236 if (BITS_PER_LONG == 64) {
238 pages = kmalloc(sizeof *pages * buf->nbufs, GFP_KERNEL);
241 for (i = 0; i < buf->nbufs; ++i)
242 pages[i] = virt_to_page(buf->page_list[i].buf);
243 buf->direct.buf = vmap(pages, buf->nbufs, VM_MAP, PAGE_KERNEL);
245 if (!buf->direct.buf)
253 mlx4_buf_free(dev, size, buf);
257 EXPORT_SYMBOL_GPL(mlx4_buf_alloc);
259 void mlx4_buf_free(struct mlx4_dev *dev, int size, struct mlx4_buf *buf)
264 dma_free_coherent(&dev->pdev->dev, size, buf->direct.buf,
267 if (BITS_PER_LONG == 64)
268 vunmap(buf->direct.buf);
270 for (i = 0; i < buf->nbufs; ++i)
271 if (buf->page_list[i].buf)
272 dma_free_coherent(&dev->pdev->dev, PAGE_SIZE,
273 buf->page_list[i].buf,
274 buf->page_list[i].map);
275 kfree(buf->page_list);
278 EXPORT_SYMBOL_GPL(mlx4_buf_free);
280 static struct mlx4_db_pgdir *mlx4_alloc_db_pgdir(struct device *dma_device)
282 struct mlx4_db_pgdir *pgdir;
284 pgdir = kzalloc(sizeof *pgdir, GFP_KERNEL);
288 bitmap_fill(pgdir->order1, MLX4_DB_PER_PAGE / 2);
289 pgdir->bits[0] = pgdir->order0;
290 pgdir->bits[1] = pgdir->order1;
291 pgdir->db_page = dma_alloc_coherent(dma_device, PAGE_SIZE,
292 &pgdir->db_dma, GFP_KERNEL);
293 if (!pgdir->db_page) {
301 static int mlx4_alloc_db_from_pgdir(struct mlx4_db_pgdir *pgdir,
302 struct mlx4_db *db, int order)
307 for (o = order; o <= 1; ++o) {
308 i = find_first_bit(pgdir->bits[o], MLX4_DB_PER_PAGE >> o);
309 if (i < MLX4_DB_PER_PAGE >> o)
316 clear_bit(i, pgdir->bits[o]);
321 set_bit(i ^ 1, pgdir->bits[order]);
325 db->db = pgdir->db_page + db->index;
326 db->dma = pgdir->db_dma + db->index * 4;
332 int mlx4_db_alloc(struct mlx4_dev *dev, struct mlx4_db *db, int order)
334 struct mlx4_priv *priv = mlx4_priv(dev);
335 struct mlx4_db_pgdir *pgdir;
338 mutex_lock(&priv->pgdir_mutex);
340 list_for_each_entry(pgdir, &priv->pgdir_list, list)
341 if (!mlx4_alloc_db_from_pgdir(pgdir, db, order))
344 pgdir = mlx4_alloc_db_pgdir(&(dev->pdev->dev));
350 list_add(&pgdir->list, &priv->pgdir_list);
352 /* This should never fail -- we just allocated an empty page: */
353 WARN_ON(mlx4_alloc_db_from_pgdir(pgdir, db, order));
356 mutex_unlock(&priv->pgdir_mutex);
360 EXPORT_SYMBOL_GPL(mlx4_db_alloc);
362 void mlx4_db_free(struct mlx4_dev *dev, struct mlx4_db *db)
364 struct mlx4_priv *priv = mlx4_priv(dev);
368 mutex_lock(&priv->pgdir_mutex);
373 if (db->order == 0 && test_bit(i ^ 1, db->u.pgdir->order0)) {
374 clear_bit(i ^ 1, db->u.pgdir->order0);
378 set_bit(i, db->u.pgdir->bits[o]);
380 if (bitmap_full(db->u.pgdir->order1, MLX4_DB_PER_PAGE / 2)) {
381 dma_free_coherent(&(dev->pdev->dev), PAGE_SIZE,
382 db->u.pgdir->db_page, db->u.pgdir->db_dma);
383 list_del(&db->u.pgdir->list);
387 mutex_unlock(&priv->pgdir_mutex);
389 EXPORT_SYMBOL_GPL(mlx4_db_free);
391 int mlx4_alloc_hwq_res(struct mlx4_dev *dev, struct mlx4_hwq_resources *wqres,
392 int size, int max_direct)
396 err = mlx4_db_alloc(dev, &wqres->db, 1);
402 err = mlx4_buf_alloc(dev, size, max_direct, &wqres->buf);
406 err = mlx4_mtt_init(dev, wqres->buf.npages, wqres->buf.page_shift,
411 err = mlx4_buf_write_mtt(dev, &wqres->mtt, &wqres->buf);
418 mlx4_mtt_cleanup(dev, &wqres->mtt);
420 mlx4_buf_free(dev, size, &wqres->buf);
422 mlx4_db_free(dev, &wqres->db);
426 EXPORT_SYMBOL_GPL(mlx4_alloc_hwq_res);
428 void mlx4_free_hwq_res(struct mlx4_dev *dev, struct mlx4_hwq_resources *wqres,
431 mlx4_mtt_cleanup(dev, &wqres->mtt);
432 mlx4_buf_free(dev, size, &wqres->buf);
433 mlx4_db_free(dev, &wqres->db);
435 EXPORT_SYMBOL_GPL(mlx4_free_hwq_res);