]> pilppa.org Git - linux-2.6-omap-h63xx.git/blob - drivers/infiniband/hw/ipath/ipath_srq.c
[PATCH] IB/ipath: update copyrights and other strings to reflect new company name
[linux-2.6-omap-h63xx.git] / drivers / infiniband / hw / ipath / ipath_srq.c
1 /*
2  * Copyright (c) 2006 QLogic, Inc. All rights reserved.
3  * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved.
4  *
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:
10  *
11  *     Redistribution and use in source and binary forms, with or
12  *     without modification, are permitted provided that the following
13  *     conditions are met:
14  *
15  *      - Redistributions of source code must retain the above
16  *        copyright notice, this list of conditions and the following
17  *        disclaimer.
18  *
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.
23  *
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
31  * SOFTWARE.
32  */
33
34 #include <linux/err.h>
35 #include <linux/vmalloc.h>
36
37 #include "ipath_verbs.h"
38
39 /**
40  * ipath_post_srq_receive - post a receive on a shared receive queue
41  * @ibsrq: the SRQ to post the receive on
42  * @wr: the list of work requests to post
43  * @bad_wr: the first WR to cause a problem is put here
44  *
45  * This may be called from interrupt context.
46  */
47 int ipath_post_srq_receive(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
48                            struct ib_recv_wr **bad_wr)
49 {
50         struct ipath_srq *srq = to_isrq(ibsrq);
51         struct ipath_ibdev *dev = to_idev(ibsrq->device);
52         unsigned long flags;
53         int ret;
54
55         for (; wr; wr = wr->next) {
56                 struct ipath_rwqe *wqe;
57                 u32 next;
58                 int i, j;
59
60                 if (wr->num_sge > srq->rq.max_sge) {
61                         *bad_wr = wr;
62                         ret = -ENOMEM;
63                         goto bail;
64                 }
65
66                 spin_lock_irqsave(&srq->rq.lock, flags);
67                 next = srq->rq.head + 1;
68                 if (next >= srq->rq.size)
69                         next = 0;
70                 if (next == srq->rq.tail) {
71                         spin_unlock_irqrestore(&srq->rq.lock, flags);
72                         *bad_wr = wr;
73                         ret = -ENOMEM;
74                         goto bail;
75                 }
76
77                 wqe = get_rwqe_ptr(&srq->rq, srq->rq.head);
78                 wqe->wr_id = wr->wr_id;
79                 wqe->sg_list[0].mr = NULL;
80                 wqe->sg_list[0].vaddr = NULL;
81                 wqe->sg_list[0].length = 0;
82                 wqe->sg_list[0].sge_length = 0;
83                 wqe->length = 0;
84                 for (i = 0, j = 0; i < wr->num_sge; i++) {
85                         /* Check LKEY */
86                         if (to_ipd(srq->ibsrq.pd)->user &&
87                             wr->sg_list[i].lkey == 0) {
88                                 spin_unlock_irqrestore(&srq->rq.lock,
89                                                        flags);
90                                 *bad_wr = wr;
91                                 ret = -EINVAL;
92                                 goto bail;
93                         }
94                         if (wr->sg_list[i].length == 0)
95                                 continue;
96                         if (!ipath_lkey_ok(&dev->lk_table,
97                                            &wqe->sg_list[j],
98                                            &wr->sg_list[i],
99                                            IB_ACCESS_LOCAL_WRITE)) {
100                                 spin_unlock_irqrestore(&srq->rq.lock,
101                                                        flags);
102                                 *bad_wr = wr;
103                                 ret = -EINVAL;
104                                 goto bail;
105                         }
106                         wqe->length += wr->sg_list[i].length;
107                         j++;
108                 }
109                 wqe->num_sge = j;
110                 srq->rq.head = next;
111                 spin_unlock_irqrestore(&srq->rq.lock, flags);
112         }
113         ret = 0;
114
115 bail:
116         return ret;
117 }
118
119 /**
120  * ipath_create_srq - create a shared receive queue
121  * @ibpd: the protection domain of the SRQ to create
122  * @attr: the attributes of the SRQ
123  * @udata: not used by the InfiniPath verbs driver
124  */
125 struct ib_srq *ipath_create_srq(struct ib_pd *ibpd,
126                                 struct ib_srq_init_attr *srq_init_attr,
127                                 struct ib_udata *udata)
128 {
129         struct ipath_srq *srq;
130         u32 sz;
131         struct ib_srq *ret;
132
133         if (srq_init_attr->attr.max_sge < 1) {
134                 ret = ERR_PTR(-EINVAL);
135                 goto bail;
136         }
137
138         srq = kmalloc(sizeof(*srq), GFP_KERNEL);
139         if (!srq) {
140                 ret = ERR_PTR(-ENOMEM);
141                 goto bail;
142         }
143
144         /*
145          * Need to use vmalloc() if we want to support large #s of entries.
146          */
147         srq->rq.size = srq_init_attr->attr.max_wr + 1;
148         sz = sizeof(struct ipath_sge) * srq_init_attr->attr.max_sge +
149                 sizeof(struct ipath_rwqe);
150         srq->rq.wq = vmalloc(srq->rq.size * sz);
151         if (!srq->rq.wq) {
152                 kfree(srq);
153                 ret = ERR_PTR(-ENOMEM);
154                 goto bail;
155         }
156
157         /*
158          * ib_create_srq() will initialize srq->ibsrq.
159          */
160         spin_lock_init(&srq->rq.lock);
161         srq->rq.head = 0;
162         srq->rq.tail = 0;
163         srq->rq.max_sge = srq_init_attr->attr.max_sge;
164         srq->limit = srq_init_attr->attr.srq_limit;
165
166         ret = &srq->ibsrq;
167
168 bail:
169         return ret;
170 }
171
172 /**
173  * ipath_modify_srq - modify a shared receive queue
174  * @ibsrq: the SRQ to modify
175  * @attr: the new attributes of the SRQ
176  * @attr_mask: indicates which attributes to modify
177  */
178 int ipath_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
179                      enum ib_srq_attr_mask attr_mask)
180 {
181         struct ipath_srq *srq = to_isrq(ibsrq);
182         unsigned long flags;
183         int ret;
184
185         if (attr_mask & IB_SRQ_LIMIT) {
186                 spin_lock_irqsave(&srq->rq.lock, flags);
187                 srq->limit = attr->srq_limit;
188                 spin_unlock_irqrestore(&srq->rq.lock, flags);
189         }
190         if (attr_mask & IB_SRQ_MAX_WR) {
191                 u32 size = attr->max_wr + 1;
192                 struct ipath_rwqe *wq, *p;
193                 u32 n;
194                 u32 sz;
195
196                 if (attr->max_sge < srq->rq.max_sge) {
197                         ret = -EINVAL;
198                         goto bail;
199                 }
200
201                 sz = sizeof(struct ipath_rwqe) +
202                         attr->max_sge * sizeof(struct ipath_sge);
203                 wq = vmalloc(size * sz);
204                 if (!wq) {
205                         ret = -ENOMEM;
206                         goto bail;
207                 }
208
209                 spin_lock_irqsave(&srq->rq.lock, flags);
210                 if (srq->rq.head < srq->rq.tail)
211                         n = srq->rq.size + srq->rq.head - srq->rq.tail;
212                 else
213                         n = srq->rq.head - srq->rq.tail;
214                 if (size <= n || size <= srq->limit) {
215                         spin_unlock_irqrestore(&srq->rq.lock, flags);
216                         vfree(wq);
217                         ret = -EINVAL;
218                         goto bail;
219                 }
220                 n = 0;
221                 p = wq;
222                 while (srq->rq.tail != srq->rq.head) {
223                         struct ipath_rwqe *wqe;
224                         int i;
225
226                         wqe = get_rwqe_ptr(&srq->rq, srq->rq.tail);
227                         p->wr_id = wqe->wr_id;
228                         p->length = wqe->length;
229                         p->num_sge = wqe->num_sge;
230                         for (i = 0; i < wqe->num_sge; i++)
231                                 p->sg_list[i] = wqe->sg_list[i];
232                         n++;
233                         p = (struct ipath_rwqe *)((char *) p + sz);
234                         if (++srq->rq.tail >= srq->rq.size)
235                                 srq->rq.tail = 0;
236                 }
237                 vfree(srq->rq.wq);
238                 srq->rq.wq = wq;
239                 srq->rq.size = size;
240                 srq->rq.head = n;
241                 srq->rq.tail = 0;
242                 srq->rq.max_sge = attr->max_sge;
243                 spin_unlock_irqrestore(&srq->rq.lock, flags);
244         }
245
246         ret = 0;
247
248 bail:
249         return ret;
250 }
251
252 int ipath_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr)
253 {
254         struct ipath_srq *srq = to_isrq(ibsrq);
255
256         attr->max_wr = srq->rq.size - 1;
257         attr->max_sge = srq->rq.max_sge;
258         attr->srq_limit = srq->limit;
259         return 0;
260 }
261
262 /**
263  * ipath_destroy_srq - destroy a shared receive queue
264  * @ibsrq: the SRQ to destroy
265  */
266 int ipath_destroy_srq(struct ib_srq *ibsrq)
267 {
268         struct ipath_srq *srq = to_isrq(ibsrq);
269
270         vfree(srq->rq.wq);
271         kfree(srq);
272
273         return 0;
274 }