• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2007 Mellanox Technologies. 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 
34 #include <linux/slab.h>
35 #include <linux/vmalloc.h>
36 #include <linux/mlx4/qp.h>
37 
38 #include "mlx4_en.h"
39 
mlx4_en_fill_qp_context(struct mlx4_en_priv * priv,int size,int stride,int is_tx,int rss,int qpn,int cqn,struct mlx4_qp_context * context)40 void mlx4_en_fill_qp_context(struct mlx4_en_priv *priv, int size, int stride,
41 			     int is_tx, int rss, int qpn, int cqn,
42 			     struct mlx4_qp_context *context)
43 {
44 	struct mlx4_en_dev *mdev = priv->mdev;
45 
46 	memset(context, 0, sizeof *context);
47 	context->flags = cpu_to_be32(7 << 16 | rss << MLX4_RSS_QPC_FLAG_OFFSET);
48 	context->pd = cpu_to_be32(mdev->priv_pdn);
49 	context->mtu_msgmax = 0xff;
50 	if (!is_tx && !rss)
51 		context->rq_size_stride = ilog2(size) << 3 | (ilog2(stride) - 4);
52 	if (is_tx)
53 		context->sq_size_stride = ilog2(size) << 3 | (ilog2(stride) - 4);
54 	else
55 		context->sq_size_stride = ilog2(TXBB_SIZE) - 4;
56 	context->usr_page = cpu_to_be32(mdev->priv_uar.index);
57 	context->local_qpn = cpu_to_be32(qpn);
58 	context->pri_path.ackto = 1 & 0x07;
59 	context->pri_path.sched_queue = 0x83 | (priv->port - 1) << 6;
60 	context->pri_path.counter_index = 0xff;
61 	context->cqn_send = cpu_to_be32(cqn);
62 	context->cqn_recv = cpu_to_be32(cqn);
63 	context->db_rec_addr = cpu_to_be64(priv->res.db.dma << 2);
64 }
65 
66 
mlx4_en_map_buffer(struct mlx4_buf * buf)67 int mlx4_en_map_buffer(struct mlx4_buf *buf)
68 {
69 	struct page **pages;
70 	int i;
71 
72 	if (BITS_PER_LONG == 64 || buf->nbufs == 1)
73 		return 0;
74 
75 	pages = kmalloc(sizeof *pages * buf->nbufs, GFP_KERNEL);
76 	if (!pages)
77 		return -ENOMEM;
78 
79 	for (i = 0; i < buf->nbufs; ++i)
80 		pages[i] = virt_to_page(buf->page_list[i].buf);
81 
82 	buf->direct.buf = vmap(pages, buf->nbufs, VM_MAP, PAGE_KERNEL);
83 	kfree(pages);
84 	if (!buf->direct.buf)
85 		return -ENOMEM;
86 
87 	return 0;
88 }
89 
mlx4_en_unmap_buffer(struct mlx4_buf * buf)90 void mlx4_en_unmap_buffer(struct mlx4_buf *buf)
91 {
92 	if (BITS_PER_LONG == 64 || buf->nbufs == 1)
93 		return;
94 
95 	vunmap(buf->direct.buf);
96 }
97 
mlx4_en_sqp_event(struct mlx4_qp * qp,enum mlx4_event event)98 void mlx4_en_sqp_event(struct mlx4_qp *qp, enum mlx4_event event)
99 {
100     return;
101 }
102 
103