2 * Copyright (c) 2006, 2007, 2008 QLogic Corporation. All rights reserved.
3 * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved.
5 * This software is available to you under a choice of one of two
6 * licenses. You may choose to be licensed under the terms of the GNU
7 * General Public License (GPL) Version 2, available from the file
8 * COPYING in the main directory of this source tree, or the
9 * OpenIB.org BSD license below:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 #include <linux/err.h>
35 #include <linux/slab.h>
36 #include <linux/vmalloc.h>
38 #include "ipath_verbs.h"
41 * ipath_post_srq_receive - post a receive on a shared receive queue
42 * @ibsrq: the SRQ to post the receive on
43 * @wr: the list of work requests to post
44 * @bad_wr: the first WR to cause a problem is put here
46 * This may be called from interrupt context.
48 int ipath_post_srq_receive(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
49 struct ib_recv_wr **bad_wr)
51 struct ipath_srq *srq = to_isrq(ibsrq);
56 for (; wr; wr = wr->next) {
57 struct ipath_rwqe *wqe;
61 if ((unsigned) wr->num_sge > srq->rq.max_sge) {
67 spin_lock_irqsave(&srq->rq.lock, flags);
70 if (next >= srq->rq.size)
72 if (next == wq->tail) {
73 spin_unlock_irqrestore(&srq->rq.lock, flags);
79 wqe = get_rwqe_ptr(&srq->rq, wq->head);
80 wqe->wr_id = wr->wr_id;
81 wqe->num_sge = wr->num_sge;
82 for (i = 0; i < wr->num_sge; i++)
83 wqe->sg_list[i] = wr->sg_list[i];
84 /* Make sure queue entry is written before the head index. */
87 spin_unlock_irqrestore(&srq->rq.lock, flags);
96 * ipath_create_srq - create a shared receive queue
97 * @ibpd: the protection domain of the SRQ to create
98 * @srq_init_attr: the attributes of the SRQ
99 * @udata: data from libipathverbs when creating a user SRQ
101 struct ib_srq *ipath_create_srq(struct ib_pd *ibpd,
102 struct ib_srq_init_attr *srq_init_attr,
103 struct ib_udata *udata)
105 struct ipath_ibdev *dev = to_idev(ibpd->device);
106 struct ipath_srq *srq;
110 if (srq_init_attr->attr.max_wr == 0) {
111 ret = ERR_PTR(-EINVAL);
115 if ((srq_init_attr->attr.max_sge > ib_ipath_max_srq_sges) ||
116 (srq_init_attr->attr.max_wr > ib_ipath_max_srq_wrs)) {
117 ret = ERR_PTR(-EINVAL);
121 srq = kmalloc(sizeof(*srq), GFP_KERNEL);
123 ret = ERR_PTR(-ENOMEM);
128 * Need to use vmalloc() if we want to support large #s of entries.
130 srq->rq.size = srq_init_attr->attr.max_wr + 1;
131 srq->rq.max_sge = srq_init_attr->attr.max_sge;
132 sz = sizeof(struct ib_sge) * srq->rq.max_sge +
133 sizeof(struct ipath_rwqe);
134 srq->rq.wq = vmalloc_user(sizeof(struct ipath_rwq) + srq->rq.size * sz);
136 ret = ERR_PTR(-ENOMEM);
141 * Return the address of the RWQ as the offset to mmap.
142 * See ipath_mmap() for details.
144 if (udata && udata->outlen >= sizeof(__u64)) {
146 u32 s = sizeof(struct ipath_rwq) + srq->rq.size * sz;
149 ipath_create_mmap_info(dev, s,
150 ibpd->uobject->context,
153 ret = ERR_PTR(-ENOMEM);
157 err = ib_copy_to_udata(udata, &srq->ip->offset,
158 sizeof(srq->ip->offset));
167 * ib_create_srq() will initialize srq->ibsrq.
169 spin_lock_init(&srq->rq.lock);
170 srq->rq.wq->head = 0;
171 srq->rq.wq->tail = 0;
172 srq->limit = srq_init_attr->attr.srq_limit;
174 spin_lock(&dev->n_srqs_lock);
175 if (dev->n_srqs_allocated == ib_ipath_max_srqs) {
176 spin_unlock(&dev->n_srqs_lock);
177 ret = ERR_PTR(-ENOMEM);
181 dev->n_srqs_allocated++;
182 spin_unlock(&dev->n_srqs_lock);
185 spin_lock_irq(&dev->pending_lock);
186 list_add(&srq->ip->pending_mmaps, &dev->pending_mmaps);
187 spin_unlock_irq(&dev->pending_lock);
204 * ipath_modify_srq - modify a shared receive queue
205 * @ibsrq: the SRQ to modify
206 * @attr: the new attributes of the SRQ
207 * @attr_mask: indicates which attributes to modify
208 * @udata: user data for ipathverbs.so
210 int ipath_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
211 enum ib_srq_attr_mask attr_mask,
212 struct ib_udata *udata)
214 struct ipath_srq *srq = to_isrq(ibsrq);
215 struct ipath_rwq *wq;
218 if (attr_mask & IB_SRQ_MAX_WR) {
219 struct ipath_rwq *owq;
220 struct ipath_rwqe *p;
221 u32 sz, size, n, head, tail;
223 /* Check that the requested sizes are below the limits. */
224 if ((attr->max_wr > ib_ipath_max_srq_wrs) ||
225 ((attr_mask & IB_SRQ_LIMIT) ?
226 attr->srq_limit : srq->limit) > attr->max_wr) {
231 sz = sizeof(struct ipath_rwqe) +
232 srq->rq.max_sge * sizeof(struct ib_sge);
233 size = attr->max_wr + 1;
234 wq = vmalloc_user(sizeof(struct ipath_rwq) + size * sz);
240 /* Check that we can write the offset to mmap. */
241 if (udata && udata->inlen >= sizeof(__u64)) {
245 ret = ib_copy_from_udata(&offset_addr, udata,
246 sizeof(offset_addr));
250 (void __user *) (unsigned long) offset_addr;
251 ret = ib_copy_to_udata(udata, &offset,
257 spin_lock_irq(&srq->rq.lock);
259 * validate head pointer value and compute
260 * the number of remaining WQEs.
264 if (head >= srq->rq.size)
267 if (tail >= srq->rq.size)
271 n += srq->rq.size - tail;
280 while (tail != head) {
281 struct ipath_rwqe *wqe;
284 wqe = get_rwqe_ptr(&srq->rq, tail);
285 p->wr_id = wqe->wr_id;
286 p->num_sge = wqe->num_sge;
287 for (i = 0; i < wqe->num_sge; i++)
288 p->sg_list[i] = wqe->sg_list[i];
290 p = (struct ipath_rwqe *)((char *) p + sz);
291 if (++tail >= srq->rq.size)
298 if (attr_mask & IB_SRQ_LIMIT)
299 srq->limit = attr->srq_limit;
300 spin_unlock_irq(&srq->rq.lock);
305 struct ipath_mmap_info *ip = srq->ip;
306 struct ipath_ibdev *dev = to_idev(srq->ibsrq.device);
307 u32 s = sizeof(struct ipath_rwq) + size * sz;
309 ipath_update_mmap_info(dev, ip, s, wq);
312 * Return the offset to mmap.
313 * See ipath_mmap() for details.
315 if (udata && udata->inlen >= sizeof(__u64)) {
316 ret = ib_copy_to_udata(udata, &ip->offset,
322 spin_lock_irq(&dev->pending_lock);
323 if (list_empty(&ip->pending_mmaps))
324 list_add(&ip->pending_mmaps,
325 &dev->pending_mmaps);
326 spin_unlock_irq(&dev->pending_lock);
328 } else if (attr_mask & IB_SRQ_LIMIT) {
329 spin_lock_irq(&srq->rq.lock);
330 if (attr->srq_limit >= srq->rq.size)
333 srq->limit = attr->srq_limit;
334 spin_unlock_irq(&srq->rq.lock);
339 spin_unlock_irq(&srq->rq.lock);
346 int ipath_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr)
348 struct ipath_srq *srq = to_isrq(ibsrq);
350 attr->max_wr = srq->rq.size - 1;
351 attr->max_sge = srq->rq.max_sge;
352 attr->srq_limit = srq->limit;
357 * ipath_destroy_srq - destroy a shared receive queue
358 * @ibsrq: the SRQ to destroy
360 int ipath_destroy_srq(struct ib_srq *ibsrq)
362 struct ipath_srq *srq = to_isrq(ibsrq);
363 struct ipath_ibdev *dev = to_idev(ibsrq->device);
365 spin_lock(&dev->n_srqs_lock);
366 dev->n_srqs_allocated--;
367 spin_unlock(&dev->n_srqs_lock);
369 kref_put(&srq->ip->ref, ipath_release_mmap_info);