1#ifndef _QP_H 2#define _QP_H 3/* 4 * Copyright(c) 2015, 2016 Intel Corporation. 5 * 6 * This file is provided under a dual BSD/GPLv2 license. When using or 7 * redistributing this file, you may do so under either license. 8 * 9 * GPL LICENSE SUMMARY 10 * 11 * This program is free software; you can redistribute it and/or modify 12 * it under the terms of version 2 of the GNU General Public License as 13 * published by the Free Software Foundation. 14 * 15 * This program is distributed in the hope that it will be useful, but 16 * WITHOUT ANY WARRANTY; without even the implied warranty of 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 18 * General Public License for more details. 19 * 20 * BSD LICENSE 21 * 22 * Redistribution and use in source and binary forms, with or without 23 * modification, are permitted provided that the following conditions 24 * are met: 25 * 26 * - Redistributions of source code must retain the above copyright 27 * notice, this list of conditions and the following disclaimer. 28 * - Redistributions in binary form must reproduce the above copyright 29 * notice, this list of conditions and the following disclaimer in 30 * the documentation and/or other materials provided with the 31 * distribution. 32 * - Neither the name of Intel Corporation nor the names of its 33 * contributors may be used to endorse or promote products derived 34 * from this software without specific prior written permission. 35 * 36 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 37 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 38 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 39 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 40 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 41 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 42 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 43 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 44 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 45 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 46 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 47 * 48 */ 49 50#include <linux/hash.h> 51#include <rdma/rdmavt_qp.h> 52#include "verbs.h" 53#include "sdma.h" 54 55extern unsigned int hfi1_qp_table_size; 56 57/* 58 * free_ahg - clear ahg from QP 59 */ 60static inline void clear_ahg(struct rvt_qp *qp) 61{ 62 struct hfi1_qp_priv *priv = qp->priv; 63 64 priv->s_hdr->ahgcount = 0; 65 qp->s_flags &= ~(RVT_S_AHG_VALID | RVT_S_AHG_CLEAR); 66 if (priv->s_sde && qp->s_ahgidx >= 0) 67 sdma_ahg_free(priv->s_sde, qp->s_ahgidx); 68 qp->s_ahgidx = -1; 69} 70 71/** 72 * hfi1_compute_aeth - compute the AETH (syndrome + MSN) 73 * @qp: the queue pair to compute the AETH for 74 * 75 * Returns the AETH. 76 */ 77__be32 hfi1_compute_aeth(struct rvt_qp *qp); 78 79/** 80 * hfi1_create_qp - create a queue pair for a device 81 * @ibpd: the protection domain who's device we create the queue pair for 82 * @init_attr: the attributes of the queue pair 83 * @udata: user data for libibverbs.so 84 * 85 * Returns the queue pair on success, otherwise returns an errno. 86 * 87 * Called by the ib_create_qp() core verbs function. 88 */ 89struct ib_qp *hfi1_create_qp(struct ib_pd *ibpd, 90 struct ib_qp_init_attr *init_attr, 91 struct ib_udata *udata); 92/** 93 * hfi1_get_credit - flush the send work queue of a QP 94 * @qp: the qp who's send work queue to flush 95 * @aeth: the Acknowledge Extended Transport Header 96 * 97 * The QP s_lock should be held. 98 */ 99void hfi1_get_credit(struct rvt_qp *qp, u32 aeth); 100 101/** 102 * hfi1_qp_wakeup - wake up on the indicated event 103 * @qp: the QP 104 * @flag: flag the qp on which the qp is stalled 105 */ 106void hfi1_qp_wakeup(struct rvt_qp *qp, u32 flag); 107 108struct sdma_engine *qp_to_sdma_engine(struct rvt_qp *qp, u8 sc5); 109struct send_context *qp_to_send_context(struct rvt_qp *qp, u8 sc5); 110 111struct qp_iter; 112 113/** 114 * qp_iter_init - initialize the iterator for the qp hash list 115 * @dev: the hfi1_ibdev 116 */ 117struct qp_iter *qp_iter_init(struct hfi1_ibdev *dev); 118 119/** 120 * qp_iter_next - Find the next qp in the hash list 121 * @iter: the iterator for the qp hash list 122 */ 123int qp_iter_next(struct qp_iter *iter); 124 125/** 126 * qp_iter_print - print the qp information to seq_file 127 * @s: the seq_file to emit the qp information on 128 * @iter: the iterator for the qp hash list 129 */ 130void qp_iter_print(struct seq_file *s, struct qp_iter *iter); 131 132/** 133 * qp_comm_est - handle trap with QP established 134 * @qp: the QP 135 */ 136void qp_comm_est(struct rvt_qp *qp); 137 138void _hfi1_schedule_send(struct rvt_qp *qp); 139void hfi1_schedule_send(struct rvt_qp *qp); 140 141void hfi1_migrate_qp(struct rvt_qp *qp); 142 143/* 144 * Functions provided by hfi1 driver for rdmavt to use 145 */ 146void *qp_priv_alloc(struct rvt_dev_info *rdi, struct rvt_qp *qp, 147 gfp_t gfp); 148void qp_priv_free(struct rvt_dev_info *rdi, struct rvt_qp *qp); 149unsigned free_all_qps(struct rvt_dev_info *rdi); 150void notify_qp_reset(struct rvt_qp *qp); 151int get_pmtu_from_attr(struct rvt_dev_info *rdi, struct rvt_qp *qp, 152 struct ib_qp_attr *attr); 153void flush_qp_waiters(struct rvt_qp *qp); 154void notify_error_qp(struct rvt_qp *qp); 155void stop_send_queue(struct rvt_qp *qp); 156void quiesce_qp(struct rvt_qp *qp); 157u32 mtu_from_qp(struct rvt_dev_info *rdi, struct rvt_qp *qp, u32 pmtu); 158int mtu_to_path_mtu(u32 mtu); 159void hfi1_error_port_qps(struct hfi1_ibport *ibp, u8 sl); 160#endif /* _QP_H */ 161