4 * Copyright(c) 2015, 2016 Intel Corporation.
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.
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.
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.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
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
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.
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.
50 #include <linux/hash.h>
51 #include <rdma/rdmavt_qp.h>
55 extern unsigned int hfi1_qp_table_size;
57 extern const struct rvt_operation_params hfi1_post_parms[];
60 * free_ahg - clear ahg from QP
62 static inline void clear_ahg(struct rvt_qp *qp)
64 struct hfi1_qp_priv *priv = qp->priv;
66 priv->s_ahg->ahgcount = 0;
67 qp->s_flags &= ~(RVT_S_AHG_VALID | RVT_S_AHG_CLEAR);
68 if (priv->s_sde && qp->s_ahgidx >= 0)
69 sdma_ahg_free(priv->s_sde, qp->s_ahgidx);
74 * hfi1_compute_aeth - compute the AETH (syndrome + MSN)
75 * @qp: the queue pair to compute the AETH for
79 __be32 hfi1_compute_aeth(struct rvt_qp *qp);
82 * hfi1_create_qp - create a queue pair for a device
83 * @ibpd: the protection domain who's device we create the queue pair for
84 * @init_attr: the attributes of the queue pair
85 * @udata: user data for libibverbs.so
87 * Returns the queue pair on success, otherwise returns an errno.
89 * Called by the ib_create_qp() core verbs function.
91 struct ib_qp *hfi1_create_qp(struct ib_pd *ibpd,
92 struct ib_qp_init_attr *init_attr,
93 struct ib_udata *udata);
95 * hfi1_get_credit - flush the send work queue of a QP
96 * @qp: the qp who's send work queue to flush
97 * @aeth: the Acknowledge Extended Transport Header
99 * The QP s_lock should be held.
101 void hfi1_get_credit(struct rvt_qp *qp, u32 aeth);
104 * hfi1_qp_wakeup - wake up on the indicated event
106 * @flag: flag the qp on which the qp is stalled
108 void hfi1_qp_wakeup(struct rvt_qp *qp, u32 flag);
110 struct sdma_engine *qp_to_sdma_engine(struct rvt_qp *qp, u8 sc5);
111 struct send_context *qp_to_send_context(struct rvt_qp *qp, u8 sc5);
116 * qp_iter_init - initialize the iterator for the qp hash list
117 * @dev: the hfi1_ibdev
119 struct qp_iter *qp_iter_init(struct hfi1_ibdev *dev);
122 * qp_iter_next - Find the next qp in the hash list
123 * @iter: the iterator for the qp hash list
125 int qp_iter_next(struct qp_iter *iter);
128 * qp_iter_print - print the qp information to seq_file
129 * @s: the seq_file to emit the qp information on
130 * @iter: the iterator for the qp hash list
132 void qp_iter_print(struct seq_file *s, struct qp_iter *iter);
135 * qp_comm_est - handle trap with QP established
138 void qp_comm_est(struct rvt_qp *qp);
140 void _hfi1_schedule_send(struct rvt_qp *qp);
141 void hfi1_schedule_send(struct rvt_qp *qp);
143 void hfi1_migrate_qp(struct rvt_qp *qp);
146 * Functions provided by hfi1 driver for rdmavt to use
148 void *qp_priv_alloc(struct rvt_dev_info *rdi, struct rvt_qp *qp,
150 void qp_priv_free(struct rvt_dev_info *rdi, struct rvt_qp *qp);
151 unsigned free_all_qps(struct rvt_dev_info *rdi);
152 void notify_qp_reset(struct rvt_qp *qp);
153 int get_pmtu_from_attr(struct rvt_dev_info *rdi, struct rvt_qp *qp,
154 struct ib_qp_attr *attr);
155 void flush_qp_waiters(struct rvt_qp *qp);
156 void notify_error_qp(struct rvt_qp *qp);
157 void stop_send_queue(struct rvt_qp *qp);
158 void quiesce_qp(struct rvt_qp *qp);
159 u32 mtu_from_qp(struct rvt_dev_info *rdi, struct rvt_qp *qp, u32 pmtu);
160 int mtu_to_path_mtu(u32 mtu);
161 void hfi1_error_port_qps(struct hfi1_ibport *ibp, u8 sl);