1 files changed, 179 insertions, 0 deletions
diff --git a/drivers/net/mlx4/alloc.c b/drivers/net/mlx4/alloc.c
new file mode 100644
index 000000000000..9ffdb9d29da9
--- /dev/null
+++ b/drivers/net/mlx4/alloc.c
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2006, 2007 Cisco Systems, Inc.  All rights reserved.
+ *
+ * This software is available to you under a choice of one of two
+ * licenses.  You may choose to be licensed under the terms of the GNU
+ * General Public License (GPL) Version 2, available from the file
+ * COPYING in the main directory of this source tree, or the
+ * OpenIB.org BSD license below:
+ *
+ *     Redistribution and use in source and binary forms, with or
+ *     without modification, are permitted provided that the following
+ *     conditions are met:
+ *
+ *      - Redistributions of source code must retain the above
+ *        copyright notice, this list of conditions and the following
+ *        disclaimer.
+ *
+ *      - Redistributions in binary form must reproduce the above
+ *        copyright notice, this list of conditions and the following
+ *        disclaimer in the documentation and/or other materials
+ *        provided with the distribution.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
+ * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+ * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+#include <linux/errno.h>
+#include <linux/slab.h>
+#include <linux/bitmap.h>
+#include "mlx4.h"
+u32 mlx4_bitmap_alloc(struct mlx4_bitmap *bitmap)
+{
+        u32 obj;
+        spin_lock(&bitmap->lock);
+        obj = find_next_zero_bit(bitmap->table, bitmap->max, bitmap->last);
+        if (obj >= bitmap->max) {
+                bitmap->top = (bitmap->top + bitmap->max) & bitmap->mask;
+                obj = find_first_zero_bit(bitmap->table, bitmap->max);
+        }
+        if (obj < bitmap->max) {
+                set_bit(obj, bitmap->table);
+                obj |= bitmap->top;
+                bitmap->last = obj + 1;
+        } else
+                obj = -1;
+        spin_unlock(&bitmap->lock);
+        return obj;
+}
+void mlx4_bitmap_free(struct mlx4_bitmap *bitmap, u32 obj)
+{
+        obj &= bitmap->max - 1;
+        spin_lock(&bitmap->lock);
+        clear_bit(obj, bitmap->table);
+        bitmap->last = min(bitmap->last, obj);
+        bitmap->top = (bitmap->top + bitmap->max) & bitmap->mask;
+        spin_unlock(&bitmap->lock);
+}
+int mlx4_bitmap_init(struct mlx4_bitmap *bitmap, u32 num, u32 mask, u32 reserved)
+{
+        int i;
+        /* num must be a power of 2 */
+        if (num != roundup_pow_of_two(num))
+                return -EINVAL;
+        bitmap->last = 0;
+        bitmap->top  = 0;
+        bitmap->max  = num;
+        bitmap->mask = mask;
+        spin_lock_init(&bitmap->lock);
+        bitmap->table = kzalloc(BITS_TO_LONGS(num) * sizeof (long), GFP_KERNEL);
+        if (!bitmap->table)
+                return -ENOMEM;
+        for (i = 0; i < reserved; ++i)
+                set_bit(i, bitmap->table);
+        return 0;
+}
+void mlx4_bitmap_cleanup(struct mlx4_bitmap *bitmap)
+{
+        kfree(bitmap->table);
+}
+/*
+ * Handling for queue buffers -- we allocate a bunch of memory and
+ * register it in a memory region at HCA virtual address 0.  If the
+ * requested size is > max_direct, we split the allocation into
+ * multiple pages, so we don't require too much contiguous memory.
+ */
+int mlx4_buf_alloc(struct mlx4_dev *dev, int size, int max_direct,
+                   struct mlx4_buf *buf)
+{
+        dma_addr_t t;
+        if (size <= max_direct) {
+                buf->nbufs        = 1;
+                buf->npages       = 1;
+                buf->page_shift   = get_order(size) + PAGE_SHIFT;
+                buf->u.direct.buf = dma_alloc_coherent(&dev->pdev->dev,
+                                                       size, &t, GFP_KERNEL);
+                if (!buf->u.direct.buf)
+                        return -ENOMEM;
+                buf->u.direct.map = t;
+                while (t & ((1 << buf->page_shift) - 1)) {
+                        --buf->page_shift;
+                        buf->npages *= 2;
+                }
+                memset(buf->u.direct.buf, 0, size);
+        } else {
+                int i;
+                buf->nbufs       = (size + PAGE_SIZE - 1) / PAGE_SIZE;
+                buf->npages      = buf->nbufs;
+                buf->page_shift  = PAGE_SHIFT;
+                buf->u.page_list = kzalloc(buf->nbufs * sizeof *buf->u.page_list,
+                                           GFP_KERNEL);
+                if (!buf->u.page_list)
+                        return -ENOMEM;
+                for (i = 0; i < buf->nbufs; ++i) {
+                        buf->u.page_list[i].buf =
+                                dma_alloc_coherent(&dev->pdev->dev, PAGE_SIZE,
+                                                   &t, GFP_KERNEL);
+                        if (!buf->u.page_list[i].buf)
+                                goto err_free;
+                        buf->u.page_list[i].map = t;
+                        memset(buf->u.page_list[i].buf, 0, PAGE_SIZE);
+                }
+        }
+        return 0;
+err_free:
+        mlx4_buf_free(dev, size, buf);
+        return -ENOMEM;
+}
+EXPORT_SYMBOL_GPL(mlx4_buf_alloc);
+void mlx4_buf_free(struct mlx4_dev *dev, int size, struct mlx4_buf *buf)
+{
+        int i;
+        if (buf->nbufs == 1)
+                dma_free_coherent(&dev->pdev->dev, size, buf->u.direct.buf,
+                                  buf->u.direct.map);
+        else {
+                for (i = 0; i < buf->nbufs; ++i)
+                        dma_free_coherent(&dev->pdev->dev, PAGE_SIZE,
+                                          buf->u.page_list[i].buf,
+                                          buf->u.page_list[i].map);
+                kfree(buf->u.page_list);
+        }
+}
+EXPORT_SYMBOL_GPL(mlx4_buf_free);

diff --git a/drivers/net/mlx4/alloc.c b/drivers/net/mlx4/alloc.c new file mode 100644 index 000000000000..9ffdb9d29da9 --- /dev/null +++ b/drivers/net/mlx4/alloc.c
@@ -0,0 +1,179 @@
	1	/*
	2	* Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
	3	*
	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:
	9	*
	10	* Redistribution and use in source and binary forms, with or
	11	* without modification, are permitted provided that the following
	12	* conditions are met:
	13	*
	14	* - Redistributions of source code must retain the above
	15	* copyright notice, this list of conditions and the following
	16	* disclaimer.
	17	*
	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.
	22	*
	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
	30	* SOFTWARE.
	31	*/
	32
	33	#include <linux/errno.h>
	34	#include <linux/slab.h>
	35	#include <linux/bitmap.h>
	36
	37	#include "mlx4.h"
	38
	39	u32 mlx4_bitmap_alloc(struct mlx4_bitmap *bitmap)
	40	{
	41	u32 obj;
	42
	43	spin_lock(&bitmap->lock);
	44
	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);
	49	}
	50
	51	if (obj < bitmap->max) {
	52	set_bit(obj, bitmap->table);
	53	obj \|= bitmap->top;
	54	bitmap->last = obj + 1;
	55	} else
	56	obj = -1;
	57
	58	spin_unlock(&bitmap->lock);
	59
	60	return obj;
	61	}
	62
	63	void mlx4_bitmap_free(struct mlx4_bitmap *bitmap, u32 obj)
	64	{
	65	obj &= bitmap->max - 1;
	66
	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);
	72	}
	73
	74	int mlx4_bitmap_init(struct mlx4_bitmap *bitmap, u32 num, u32 mask, u32 reserved)
	75	{
	76	int i;
	77
	78	/* num must be a power of 2 */
	79	if (num != roundup_pow_of_two(num))
	80	return -EINVAL;
	81
	82	bitmap->last = 0;
	83	bitmap->top = 0;
	84	bitmap->max = num;
	85	bitmap->mask = mask;
	86	spin_lock_init(&bitmap->lock);
	87	bitmap->table = kzalloc(BITS_TO_LONGS(num) * sizeof (long), GFP_KERNEL);
	88	if (!bitmap->table)
	89	return -ENOMEM;
	90
	91	for (i = 0; i < reserved; ++i)
	92	set_bit(i, bitmap->table);
	93
	94	return 0;
	95	}
	96
	97	void mlx4_bitmap_cleanup(struct mlx4_bitmap *bitmap)
	98	{
	99	kfree(bitmap->table);
	100	}
	101
	102	/*
	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.
	107	*/
	108
	109	int mlx4_buf_alloc(struct mlx4_dev *dev, int size, int max_direct,
	110	struct mlx4_buf *buf)
	111	{
	112	dma_addr_t t;
	113
	114	if (size <= max_direct) {
	115	buf->nbufs = 1;
	116	buf->npages = 1;
	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)
	121	return -ENOMEM;
	122
	123	buf->u.direct.map = t;
	124
	125	while (t & ((1 << buf->page_shift) - 1)) {
	126	--buf->page_shift;
	127	buf->npages *= 2;
	128	}
	129
	130	memset(buf->u.direct.buf, 0, size);
	131	} else {
	132	int i;
	133
	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,
	138	GFP_KERNEL);
	139	if (!buf->u.page_list)
	140	return -ENOMEM;
	141
	142	for (i = 0; i < buf->nbufs; ++i) {
	143	buf->u.page_list[i].buf =
	144	dma_alloc_coherent(&dev->pdev->dev, PAGE_SIZE,
	145	&t, GFP_KERNEL);
	146	if (!buf->u.page_list[i].buf)
	147	goto err_free;
	148
	149	buf->u.page_list[i].map = t;
	150
	151	memset(buf->u.page_list[i].buf, 0, PAGE_SIZE);
	152	}
	153	}
	154
	155	return 0;
	156
	157	err_free:
	158	mlx4_buf_free(dev, size, buf);
	159
	160	return -ENOMEM;
	161	}
	162	EXPORT_SYMBOL_GPL(mlx4_buf_alloc);
	163
	164	void mlx4_buf_free(struct mlx4_dev dev, int size, struct mlx4_buf buf)
	165	{
	166	int i;
	167
	168	if (buf->nbufs == 1)
	169	dma_free_coherent(&dev->pdev->dev, size, buf->u.direct.buf,
	170	buf->u.direct.map);
	171	else {
	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);
	177	}
	178	}
	179	EXPORT_SYMBOL_GPL(mlx4_buf_free);