1 /* 2 * Copyright (c) 2007, 2014 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 <dev/mlx4/qp.h> 37 38 #include "en.h" 39 40 41 void mlx4_en_fill_qp_context(struct mlx4_en_priv *priv, int size, int stride, 42 int is_tx, int rss, int qpn, int cqn, 43 int user_prio, struct mlx4_qp_context *context) 44 { 45 struct mlx4_en_dev *mdev = priv->mdev; 46 struct net_device *dev = priv->dev; 47 48 memset(context, 0, sizeof *context); 49 context->flags = cpu_to_be32(7 << 16 | rss << MLX4_RSS_QPC_FLAG_OFFSET); 50 context->pd = cpu_to_be32(mdev->priv_pdn); 51 context->mtu_msgmax = 0xff; 52 if (!is_tx && !rss) 53 context->rq_size_stride = ilog2(size) << 3 | (ilog2(stride) - 4); 54 if (is_tx) 55 context->sq_size_stride = ilog2(size) << 3 | (ilog2(stride) - 4); 56 else 57 context->sq_size_stride = ilog2(TXBB_SIZE) - 4; 58 context->usr_page = cpu_to_be32(mdev->priv_uar.index); 59 context->local_qpn = cpu_to_be32(qpn); 60 context->pri_path.ackto = 1 & 0x07; 61 context->pri_path.sched_queue = 0x83 | (priv->port - 1) << 6; 62 if (user_prio >= 0) { 63 context->pri_path.sched_queue |= user_prio << 3; 64 context->pri_path.feup = 1 << 6; 65 } 66 context->pri_path.counter_index = (u8)(priv->counter_index); 67 if (!rss && 68 (mdev->dev->caps.flags2 & MLX4_DEV_CAP_FLAG2_LB_SRC_CHK) && 69 context->pri_path.counter_index != 0xFF) { 70 /* disable multicast loopback to qp with same counter */ 71 context->pri_path.fl |= MLX4_FL_ETH_SRC_CHECK_MC_LB; 72 context->pri_path.vlan_control |= 73 MLX4_VLAN_CTRL_ETH_SRC_CHECK_IF_COUNTER; 74 } 75 76 context->cqn_send = cpu_to_be32(cqn); 77 context->cqn_recv = cpu_to_be32(cqn); 78 context->db_rec_addr = cpu_to_be64(priv->res.db.dma << 2); 79 if (!(dev->if_capabilities & IFCAP_VLAN_HWCSUM)) 80 context->param3 |= cpu_to_be32(1 << 30); 81 } 82 83 84 int mlx4_en_map_buffer(struct mlx4_buf *buf) 85 { 86 struct page **pages; 87 int i; 88 89 // if nbufs == 1 - there is no need to vmap 90 // if buf->direct.buf is not NULL it means that vmap was already done by mlx4_alloc_buff 91 if (buf->direct.buf != NULL || buf->nbufs == 1) 92 return 0; 93 94 pages = kmalloc(sizeof *pages * buf->nbufs, GFP_KERNEL); 95 if (!pages) 96 return -ENOMEM; 97 98 for (i = 0; i < buf->nbufs; ++i) 99 pages[i] = virt_to_page(buf->page_list[i].buf); 100 101 buf->direct.buf = vmap(pages, buf->nbufs, VM_MAP, PAGE_KERNEL); 102 kfree(pages); 103 if (!buf->direct.buf) 104 return -ENOMEM; 105 106 return 0; 107 } 108 109 void mlx4_en_unmap_buffer(struct mlx4_buf *buf) 110 { 111 if (BITS_PER_LONG == 64 || buf->nbufs == 1) 112 return; 113 114 vunmap(buf->direct.buf); 115 } 116 117 void mlx4_en_sqp_event(struct mlx4_qp *qp, enum mlx4_event event) 118 { 119 return; 120 } 121 122