[linux-2.6-block.git] / drivers / net / ethernet / mellanox / mlx5 / core / alloc.c

/*
 * Copyright (c) 2013-2015, Mellanox Technologies. 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/mm.h>
#include <linux/export.h>
#include <linux/bitmap.h>
#include <linux/dma-mapping.h>
#include <linux/vmalloc.h>
#include <linux/mlx5/driver.h>

#include "mlx5_core.h"

struct mlx5_db_pgdir {
	struct list_head	list;
	unsigned long	       *bitmap;
	__be32		       *db_page;
	dma_addr_t		db_dma;
};

/* Handling for queue buffers -- we allocate a bunch of memory and
 * register it in a memory region at HCA virtual address 0.
 */

static void *mlx5_dma_zalloc_coherent_node(struct mlx5_core_dev *dev,
					   size_t size, dma_addr_t *dma_handle,
					   int node)
{
	struct mlx5_priv *priv = &dev->priv;
	int original_node;
	void *cpu_handle;

	mutex_lock(&priv->alloc_mutex);
	original_node = dev_to_node(&dev->pdev->dev);
	set_dev_node(&dev->pdev->dev, node);
	cpu_handle = dma_zalloc_coherent(&dev->pdev->dev, size,
					 dma_handle, GFP_KERNEL);
	set_dev_node(&dev->pdev->dev, original_node);
	mutex_unlock(&priv->alloc_mutex);
	return cpu_handle;
}

int mlx5_buf_alloc_node(struct mlx5_core_dev *dev, int size,
			struct mlx5_frag_buf *buf, int node)
{
	dma_addr_t t;

	buf->size = size;
	buf->npages       = 1;
	buf->page_shift   = (u8)get_order(size) + PAGE_SHIFT;

	buf->frags = kzalloc(sizeof(*buf->frags), GFP_KERNEL);
	if (!buf->frags)
		return -ENOMEM;

	buf->frags->buf   = mlx5_dma_zalloc_coherent_node(dev, size,
							  &t, node);
	if (!buf->frags->buf)
		goto err_out;

	buf->frags->map = t;

	while (t & ((1 << buf->page_shift) - 1)) {
		--buf->page_shift;
		buf->npages *= 2;
	}

	return 0;
err_out:
	kfree(buf->frags);
	return -ENOMEM;
}

int mlx5_buf_alloc(struct mlx5_core_dev *dev,
		   int size, struct mlx5_frag_buf *buf)
{
	return mlx5_buf_alloc_node(dev, size, buf, dev->priv.numa_node);
}
EXPORT_SYMBOL(mlx5_buf_alloc);

void mlx5_buf_free(struct mlx5_core_dev *dev, struct mlx5_frag_buf *buf)
{
	dma_free_coherent(&dev->pdev->dev, buf->size, buf->frags->buf,
			  buf->frags->map);

	kfree(buf->frags);
}
EXPORT_SYMBOL_GPL(mlx5_buf_free);

int mlx5_frag_buf_alloc_node(struct mlx5_core_dev *dev, int size,
			     struct mlx5_frag_buf *buf, int node)
{
	int i;

	buf->size = size;
	buf->npages = 1 << get_order(size);
	buf->page_shift = PAGE_SHIFT;
	buf->frags = kcalloc(buf->npages, sizeof(struct mlx5_buf_list),
			     GFP_KERNEL);
	if (!buf->frags)
		goto err_out;

	for (i = 0; i < buf->npages; i++) {
		struct mlx5_buf_list *frag = &buf->frags[i];
		int frag_sz = min_t(int, size, PAGE_SIZE);

		frag->buf = mlx5_dma_zalloc_coherent_node(dev, frag_sz,
							  &frag->map, node);
		if (!frag->buf)
			goto err_free_buf;
		if (frag->map & ((1 << buf->page_shift) - 1)) {
			dma_free_coherent(&dev->pdev->dev, frag_sz,
					  buf->frags[i].buf, buf->frags[i].map);
			mlx5_core_warn(dev, "unexpected map alignment: %pad, page_shift=%d\n",
				       &frag->map, buf->page_shift);
			goto err_free_buf;
		}
		size -= frag_sz;
	}

	return 0;

err_free_buf:
	while (i--)
		dma_free_coherent(&dev->pdev->dev, PAGE_SIZE, buf->frags[i].buf,
				  buf->frags[i].map);
	kfree(buf->frags);
err_out:
	return -ENOMEM;
}
EXPORT_SYMBOL_GPL(mlx5_frag_buf_alloc_node);

void mlx5_frag_buf_free(struct mlx5_core_dev *dev, struct mlx5_frag_buf *buf)
{
	int size = buf->size;
	int i;

	for (i = 0; i < buf->npages; i++) {
		int frag_sz = min_t(int, size, PAGE_SIZE);

		dma_free_coherent(&dev->pdev->dev, frag_sz, buf->frags[i].buf,
				  buf->frags[i].map);
		size -= frag_sz;
	}
	kfree(buf->frags);
}
EXPORT_SYMBOL_GPL(mlx5_frag_buf_free);

static struct mlx5_db_pgdir *mlx5_alloc_db_pgdir(struct mlx5_core_dev *dev,
						 int node)
{
	u32 db_per_page = PAGE_SIZE / cache_line_size();
	struct mlx5_db_pgdir *pgdir;

	pgdir = kzalloc(sizeof(*pgdir), GFP_KERNEL);
	if (!pgdir)
		return NULL;

	pgdir->bitmap = kcalloc(BITS_TO_LONGS(db_per_page),
				sizeof(unsigned long),
				GFP_KERNEL);

	if (!pgdir->bitmap) {
		kfree(pgdir);
		return NULL;
	}

	bitmap_fill(pgdir->bitmap, db_per_page);

	pgdir->db_page = mlx5_dma_zalloc_coherent_node(dev, PAGE_SIZE,
						       &pgdir->db_dma, node);
	if (!pgdir->db_page) {
		kfree(pgdir->bitmap);
		kfree(pgdir);
		return NULL;
	}

	return pgdir;
}

static int mlx5_alloc_db_from_pgdir(struct mlx5_db_pgdir *pgdir,
				    struct mlx5_db *db)
{
	u32 db_per_page = PAGE_SIZE / cache_line_size();
	int offset;
	int i;

	i = find_first_bit(pgdir->bitmap, db_per_page);
	if (i >= db_per_page)
		return -ENOMEM;

	__clear_bit(i, pgdir->bitmap);

	db->u.pgdir = pgdir;
	db->index   = i;
	offset = db->index * cache_line_size();
	db->db      = pgdir->db_page + offset / sizeof(*pgdir->db_page);
	db->dma     = pgdir->db_dma  + offset;

	db->db[0] = 0;
	db->db[1] = 0;

	return 0;
}

int mlx5_db_alloc_node(struct mlx5_core_dev *dev, struct mlx5_db *db, int node)
{
	struct mlx5_db_pgdir *pgdir;
	int ret = 0;

	mutex_lock(&dev->priv.pgdir_mutex);

	list_for_each_entry(pgdir, &dev->priv.pgdir_list, list)
		if (!mlx5_alloc_db_from_pgdir(pgdir, db))
			goto out;

	pgdir = mlx5_alloc_db_pgdir(dev, node);
	if (!pgdir) {
		ret = -ENOMEM;
		goto out;
	}

	list_add(&pgdir->list, &dev->priv.pgdir_list);

	/* This should never fail -- we just allocated an empty page: */
	WARN_ON(mlx5_alloc_db_from_pgdir(pgdir, db));

out:
	mutex_unlock(&dev->priv.pgdir_mutex);

	return ret;
}
EXPORT_SYMBOL_GPL(mlx5_db_alloc_node);

int mlx5_db_alloc(struct mlx5_core_dev *dev, struct mlx5_db *db)
{
	return mlx5_db_alloc_node(dev, db, dev->priv.numa_node);
}
EXPORT_SYMBOL_GPL(mlx5_db_alloc);

void mlx5_db_free(struct mlx5_core_dev *dev, struct mlx5_db *db)
{
	u32 db_per_page = PAGE_SIZE / cache_line_size();

	mutex_lock(&dev->priv.pgdir_mutex);

	__set_bit(db->index, db->u.pgdir->bitmap);

	if (bitmap_full(db->u.pgdir->bitmap, db_per_page)) {
		dma_free_coherent(&(dev->pdev->dev), PAGE_SIZE,
				  db->u.pgdir->db_page, db->u.pgdir->db_dma);
		list_del(&db->u.pgdir->list);
		kfree(db->u.pgdir->bitmap);
		kfree(db->u.pgdir);
	}

	mutex_unlock(&dev->priv.pgdir_mutex);
}
EXPORT_SYMBOL_GPL(mlx5_db_free);

void mlx5_fill_page_array(struct mlx5_frag_buf *buf, __be64 *pas)
{
	u64 addr;
	int i;

	for (i = 0; i < buf->npages; i++) {
		addr = buf->frags->map + (i << buf->page_shift);

		pas[i] = cpu_to_be64(addr);
	}
}
EXPORT_SYMBOL_GPL(mlx5_fill_page_array);

void mlx5_fill_page_frag_array(struct mlx5_frag_buf *buf, __be64 *pas)
{
	int i;

	for (i = 0; i < buf->npages; i++)
		pas[i] = cpu_to_be64(buf->frags[i].map);
}
EXPORT_SYMBOL_GPL(mlx5_fill_page_frag_array);
Commit	Line	Data
e126ba97	1	/*
302bdf68	2	* Copyright (c) 2013-2015, Mellanox Technologies. All rights reserved.
e126ba97 EC	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/mm.h>
	36	#include <linux/export.h>
	37	#include <linux/bitmap.h>
	38	#include <linux/dma-mapping.h>
	39	#include <linux/vmalloc.h>
	40	#include <linux/mlx5/driver.h>
	41
	42	#include "mlx5_core.h"
	43
b47bd6ea DJ	44	struct mlx5_db_pgdir {
	45	struct list_head list;
	46	unsigned long *bitmap;
	47	__be32 *db_page;
	48	dma_addr_t db_dma;
	49	};
	50
e126ba97	51	/* Handling for queue buffers -- we allocate a bunch of memory and
64ffaa21	52	* register it in a memory region at HCA virtual address 0.
e126ba97 EC	53	*/
e126ba97 EC	54
311c7c71 SM	55	static void mlx5_dma_zalloc_coherent_node(struct mlx5_core_dev dev,
	56	size_t size, dma_addr_t *dma_handle,
	57	int node)
	58	{
	59	struct mlx5_priv *priv = &dev->priv;
	60	int original_node;
	61	void *cpu_handle;
	62
	63	mutex_lock(&priv->alloc_mutex);
	64	original_node = dev_to_node(&dev->pdev->dev);
	65	set_dev_node(&dev->pdev->dev, node);
	66	cpu_handle = dma_zalloc_coherent(&dev->pdev->dev, size,
	67	dma_handle, GFP_KERNEL);
	68	set_dev_node(&dev->pdev->dev, original_node);
	69	mutex_unlock(&priv->alloc_mutex);
	70	return cpu_handle;
	71	}
	72
	73	int mlx5_buf_alloc_node(struct mlx5_core_dev *dev, int size,
388ca8be	74	struct mlx5_frag_buf *buf, int node)
e126ba97 EC	75	{
	76	dma_addr_t t;
	77
	78	buf->size = size;
64ffaa21 AV	79	buf->npages = 1;
64ffaa21 AV	80	buf->page_shift = (u8)get_order(size) + PAGE_SHIFT;
388ca8be YC	81
	82	buf->frags = kzalloc(sizeof(*buf->frags), GFP_KERNEL);
	83	if (!buf->frags)
64ffaa21	84	return -ENOMEM;
e126ba97	85
388ca8be YC	86	buf->frags->buf = mlx5_dma_zalloc_coherent_node(dev, size,
	87	&t, node);
	88	if (!buf->frags->buf)
	89	goto err_out;
	90
	91	buf->frags->map = t;
e126ba97	92
64ffaa21 AV	93	while (t & ((1 << buf->page_shift) - 1)) {
	94	--buf->page_shift;
	95	buf->npages *= 2;
	96	}
e126ba97	97
64ffaa21	98	return 0;
388ca8be YC	99	err_out:
	100	kfree(buf->frags);
	101	return -ENOMEM;
e126ba97	102	}
311c7c71	103
388ca8be YC	104	int mlx5_buf_alloc(struct mlx5_core_dev *dev,
388ca8be YC	105	int size, struct mlx5_frag_buf *buf)
311c7c71 SM	106	{
	107	return mlx5_buf_alloc_node(dev, size, buf, dev->priv.numa_node);
	108	}
388ca8be	109	EXPORT_SYMBOL(mlx5_buf_alloc);
e126ba97	110
388ca8be	111	void mlx5_buf_free(struct mlx5_core_dev dev, struct mlx5_frag_buf buf)
e126ba97	112	{
388ca8be YC	113	dma_free_coherent(&dev->pdev->dev, buf->size, buf->frags->buf,
	114	buf->frags->map);
	115
	116	kfree(buf->frags);
e126ba97 EC	117	}
	118	EXPORT_SYMBOL_GPL(mlx5_buf_free);
	119
1c1b5228 TT	120	int mlx5_frag_buf_alloc_node(struct mlx5_core_dev *dev, int size,
	121	struct mlx5_frag_buf *buf, int node)
	122	{
	123	int i;
	124
	125	buf->size = size;
	126	buf->npages = 1 << get_order(size);
	127	buf->page_shift = PAGE_SHIFT;
	128	buf->frags = kcalloc(buf->npages, sizeof(struct mlx5_buf_list),
	129	GFP_KERNEL);
	130	if (!buf->frags)
	131	goto err_out;
	132
	133	for (i = 0; i < buf->npages; i++) {
	134	struct mlx5_buf_list *frag = &buf->frags[i];
	135	int frag_sz = min_t(int, size, PAGE_SIZE);
	136
	137	frag->buf = mlx5_dma_zalloc_coherent_node(dev, frag_sz,
	138	&frag->map, node);
	139	if (!frag->buf)
	140	goto err_free_buf;
	141	if (frag->map & ((1 << buf->page_shift) - 1)) {
	142	dma_free_coherent(&dev->pdev->dev, frag_sz,
	143	buf->frags[i].buf, buf->frags[i].map);
9afd8952 AB	144	mlx5_core_warn(dev, "unexpected map alignment: %pad, page_shift=%d\n",
9afd8952 AB	145	&frag->map, buf->page_shift);
1c1b5228 TT	146	goto err_free_buf;
	147	}
	148	size -= frag_sz;
	149	}
	150
	151	return 0;
	152
	153	err_free_buf:
	154	while (i--)
	155	dma_free_coherent(&dev->pdev->dev, PAGE_SIZE, buf->frags[i].buf,
	156	buf->frags[i].map);
	157	kfree(buf->frags);
	158	err_out:
	159	return -ENOMEM;
	160	}
388ca8be	161	EXPORT_SYMBOL_GPL(mlx5_frag_buf_alloc_node);
1c1b5228 TT	162
	163	void mlx5_frag_buf_free(struct mlx5_core_dev dev, struct mlx5_frag_buf buf)
	164	{
	165	int size = buf->size;
	166	int i;
	167
	168	for (i = 0; i < buf->npages; i++) {
	169	int frag_sz = min_t(int, size, PAGE_SIZE);
	170
	171	dma_free_coherent(&dev->pdev->dev, frag_sz, buf->frags[i].buf,
	172	buf->frags[i].map);
	173	size -= frag_sz;
	174	}
	175	kfree(buf->frags);
	176	}
388ca8be	177	EXPORT_SYMBOL_GPL(mlx5_frag_buf_free);
1c1b5228	178
311c7c71 SM	179	static struct mlx5_db_pgdir mlx5_alloc_db_pgdir(struct mlx5_core_dev dev,
311c7c71 SM	180	int node)
e126ba97	181	{
b47bd6ea	182	u32 db_per_page = PAGE_SIZE / cache_line_size();
e126ba97 EC	183	struct mlx5_db_pgdir *pgdir;
	184
	185	pgdir = kzalloc(sizeof(*pgdir), GFP_KERNEL);
	186	if (!pgdir)
	187	return NULL;
	188
b47bd6ea DJ	189	pgdir->bitmap = kcalloc(BITS_TO_LONGS(db_per_page),
	190	sizeof(unsigned long),
	191	GFP_KERNEL);
	192
	193	if (!pgdir->bitmap) {
	194	kfree(pgdir);
	195	return NULL;
	196	}
	197
	198	bitmap_fill(pgdir->bitmap, db_per_page);
311c7c71 SM	199
	200	pgdir->db_page = mlx5_dma_zalloc_coherent_node(dev, PAGE_SIZE,
	201	&pgdir->db_dma, node);
e126ba97	202	if (!pgdir->db_page) {
b47bd6ea	203	kfree(pgdir->bitmap);
e126ba97 EC	204	kfree(pgdir);
	205	return NULL;
	206	}
	207
	208	return pgdir;
	209	}
	210
	211	static int mlx5_alloc_db_from_pgdir(struct mlx5_db_pgdir *pgdir,
	212	struct mlx5_db *db)
	213	{
b47bd6ea	214	u32 db_per_page = PAGE_SIZE / cache_line_size();
e126ba97 EC	215	int offset;
	216	int i;
	217
b47bd6ea DJ	218	i = find_first_bit(pgdir->bitmap, db_per_page);
b47bd6ea DJ	219	if (i >= db_per_page)
e126ba97 EC	220	return -ENOMEM;
	221
	222	__clear_bit(i, pgdir->bitmap);
	223
	224	db->u.pgdir = pgdir;
	225	db->index = i;
b47bd6ea	226	offset = db->index * cache_line_size();
e126ba97 EC	227	db->db = pgdir->db_page + offset / sizeof(*pgdir->db_page);
	228	db->dma = pgdir->db_dma + offset;
	229
b812b544 SM	230	db->db[0] = 0;
	231	db->db[1] = 0;
	232
e126ba97 EC	233	return 0;
	234	}
	235
311c7c71	236	int mlx5_db_alloc_node(struct mlx5_core_dev dev, struct mlx5_db db, int node)
e126ba97 EC	237	{
	238	struct mlx5_db_pgdir *pgdir;
	239	int ret = 0;
	240
	241	mutex_lock(&dev->priv.pgdir_mutex);
	242
	243	list_for_each_entry(pgdir, &dev->priv.pgdir_list, list)
	244	if (!mlx5_alloc_db_from_pgdir(pgdir, db))
	245	goto out;
	246
311c7c71	247	pgdir = mlx5_alloc_db_pgdir(dev, node);
e126ba97 EC	248	if (!pgdir) {
	249	ret = -ENOMEM;
	250	goto out;
	251	}
	252
	253	list_add(&pgdir->list, &dev->priv.pgdir_list);
	254
	255	/* This should never fail -- we just allocated an empty page: */
	256	WARN_ON(mlx5_alloc_db_from_pgdir(pgdir, db));
	257
	258	out:
	259	mutex_unlock(&dev->priv.pgdir_mutex);
	260
	261	return ret;
	262	}
311c7c71 SM	263	EXPORT_SYMBOL_GPL(mlx5_db_alloc_node);
	264
	265	int mlx5_db_alloc(struct mlx5_core_dev dev, struct mlx5_db db)
	266	{
	267	return mlx5_db_alloc_node(dev, db, dev->priv.numa_node);
	268	}
e126ba97 EC	269	EXPORT_SYMBOL_GPL(mlx5_db_alloc);
	270
	271	void mlx5_db_free(struct mlx5_core_dev dev, struct mlx5_db db)
	272	{
b47bd6ea	273	u32 db_per_page = PAGE_SIZE / cache_line_size();
ad5b39a9	274
e126ba97 EC	275	mutex_lock(&dev->priv.pgdir_mutex);
	276
	277	__set_bit(db->index, db->u.pgdir->bitmap);
	278
b47bd6ea	279	if (bitmap_full(db->u.pgdir->bitmap, db_per_page)) {
e126ba97 EC	280	dma_free_coherent(&(dev->pdev->dev), PAGE_SIZE,
	281	db->u.pgdir->db_page, db->u.pgdir->db_dma);
	282	list_del(&db->u.pgdir->list);
b47bd6ea	283	kfree(db->u.pgdir->bitmap);
e126ba97 EC	284	kfree(db->u.pgdir);
	285	}
	286
	287	mutex_unlock(&dev->priv.pgdir_mutex);
	288	}
	289	EXPORT_SYMBOL_GPL(mlx5_db_free);
	290
388ca8be	291	void mlx5_fill_page_array(struct mlx5_frag_buf buf, __be64 pas)
e126ba97 EC	292	{
	293	u64 addr;
	294	int i;
	295
	296	for (i = 0; i < buf->npages; i++) {
388ca8be	297	addr = buf->frags->map + (i << buf->page_shift);
e126ba97 EC	298
	299	pas[i] = cpu_to_be64(addr);
	300	}
	301	}
	302	EXPORT_SYMBOL_GPL(mlx5_fill_page_array);
1c1b5228 TT	303
	304	void mlx5_fill_page_frag_array(struct mlx5_frag_buf buf, __be64 pas)
	305	{
	306	int i;
	307
	308	for (i = 0; i < buf->npages; i++)
	309	pas[i] = cpu_to_be64(buf->frags[i].map);
	310	}
	311	EXPORT_SYMBOL_GPL(mlx5_fill_page_frag_array);