]>
git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - drivers/net/mlx4/alloc.c
2 * Copyright (c) 2006, 2007 Cisco Systems, 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
33 #include <linux/errno.h>
34 #include <linux/slab.h>
35 #include <linux/bitmap.h>
39 u32
mlx4_bitmap_alloc(struct mlx4_bitmap
*bitmap
)
43 spin_lock(&bitmap
->lock
);
45 obj
= find_next_zero_bit(bitmap
->table
, bitmap
->max
, bitmap
->last
);
46 if (obj
>= bitmap
->max
) {
47 bitmap
->top
= (bitmap
->top
+ bitmap
->max
) & bitmap
->mask
;
48 obj
= find_first_zero_bit(bitmap
->table
, bitmap
->max
);
51 if (obj
< bitmap
->max
) {
52 set_bit(obj
, bitmap
->table
);
54 bitmap
->last
= obj
+ 1;
58 spin_unlock(&bitmap
->lock
);
63 void mlx4_bitmap_free(struct mlx4_bitmap
*bitmap
, u32 obj
)
65 obj
&= bitmap
->max
- 1;
67 spin_lock(&bitmap
->lock
);
68 clear_bit(obj
, bitmap
->table
);
69 bitmap
->last
= min(bitmap
->last
, obj
);
70 bitmap
->top
= (bitmap
->top
+ bitmap
->max
) & bitmap
->mask
;
71 spin_unlock(&bitmap
->lock
);
74 int mlx4_bitmap_init(struct mlx4_bitmap
*bitmap
, u32 num
, u32 mask
, u32 reserved
)
78 /* num must be a power of 2 */
79 if (num
!= roundup_pow_of_two(num
))
86 spin_lock_init(&bitmap
->lock
);
87 bitmap
->table
= kzalloc(BITS_TO_LONGS(num
) * sizeof (long), GFP_KERNEL
);
91 for (i
= 0; i
< reserved
; ++i
)
92 set_bit(i
, bitmap
->table
);
97 void mlx4_bitmap_cleanup(struct mlx4_bitmap
*bitmap
)
103 * Handling for queue buffers -- we allocate a bunch of memory and
104 * register it in a memory region at HCA virtual address 0. If the
105 * requested size is > max_direct, we split the allocation into
106 * multiple pages, so we don't require too much contiguous memory.
109 int mlx4_buf_alloc(struct mlx4_dev
*dev
, int size
, int max_direct
,
110 struct mlx4_buf
*buf
)
114 if (size
<= max_direct
) {
117 buf
->page_shift
= get_order(size
) + PAGE_SHIFT
;
118 buf
->u
.direct
.buf
= dma_alloc_coherent(&dev
->pdev
->dev
,
119 size
, &t
, GFP_KERNEL
);
120 if (!buf
->u
.direct
.buf
)
123 buf
->u
.direct
.map
= t
;
125 while (t
& ((1 << buf
->page_shift
) - 1)) {
130 memset(buf
->u
.direct
.buf
, 0, size
);
134 buf
->nbufs
= (size
+ PAGE_SIZE
- 1) / PAGE_SIZE
;
135 buf
->npages
= buf
->nbufs
;
136 buf
->page_shift
= PAGE_SHIFT
;
137 buf
->u
.page_list
= kzalloc(buf
->nbufs
* sizeof *buf
->u
.page_list
,
139 if (!buf
->u
.page_list
)
142 for (i
= 0; i
< buf
->nbufs
; ++i
) {
143 buf
->u
.page_list
[i
].buf
=
144 dma_alloc_coherent(&dev
->pdev
->dev
, PAGE_SIZE
,
146 if (!buf
->u
.page_list
[i
].buf
)
149 buf
->u
.page_list
[i
].map
= t
;
151 memset(buf
->u
.page_list
[i
].buf
, 0, PAGE_SIZE
);
158 mlx4_buf_free(dev
, size
, buf
);
162 EXPORT_SYMBOL_GPL(mlx4_buf_alloc
);
164 void mlx4_buf_free(struct mlx4_dev
*dev
, int size
, struct mlx4_buf
*buf
)
169 dma_free_coherent(&dev
->pdev
->dev
, size
, buf
->u
.direct
.buf
,
172 for (i
= 0; i
< buf
->nbufs
; ++i
)
173 dma_free_coherent(&dev
->pdev
->dev
, PAGE_SIZE
,
174 buf
->u
.page_list
[i
].buf
,
175 buf
->u
.page_list
[i
].map
);
176 kfree(buf
->u
.page_list
);
179 EXPORT_SYMBOL_GPL(mlx4_buf_free
);