2 * Copyright (c) 2005 Cisco Systems. All rights reserved.
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:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
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.
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
32 * $Id: mthca_srq.c 3047 2005-08-10 03:59:35Z roland $
35 #include "mthca_dev.h"
36 #include "mthca_cmd.h"
37 #include "mthca_memfree.h"
38 #include "mthca_wqe.h"
41 MTHCA_MAX_DIRECT_SRQ_SIZE = 4 * PAGE_SIZE
44 struct mthca_tavor_srq_context {
45 __be64 wqe_base_ds; /* low 6 bits is descriptor size */
53 struct mthca_arbel_srq_context {
54 __be32 state_logsize_srqn;
57 __be32 logstride_usrpage;
60 __be16 limit_watermark;
67 static void *get_wqe(struct mthca_srq *srq, int n)
70 return srq->queue.direct.buf + (n << srq->wqe_shift);
72 return srq->queue.page_list[(n << srq->wqe_shift) >> PAGE_SHIFT].buf +
73 ((n << srq->wqe_shift) & (PAGE_SIZE - 1));
77 * Return a pointer to the location within a WQE that we're using as a
78 * link when the WQE is in the free list. We use an offset of 4
79 * because in the Tavor case, posting a WQE may overwrite the first
80 * four bytes of the previous WQE. The offset avoids corrupting our
81 * free list if the WQE has already completed and been put on the free
82 * list when we post the next WQE.
84 static inline int *wqe_to_link(void *wqe)
86 return (int *) (wqe + 4);
89 static void mthca_tavor_init_srq_context(struct mthca_dev *dev,
91 struct mthca_srq *srq,
92 struct mthca_tavor_srq_context *context)
94 memset(context, 0, sizeof *context);
96 context->wqe_base_ds = cpu_to_be64(1 << (srq->wqe_shift - 4));
97 context->state_pd = cpu_to_be32(pd->pd_num);
98 context->lkey = cpu_to_be32(srq->mr.ibmr.lkey);
100 if (pd->ibpd.uobject)
102 cpu_to_be32(to_mucontext(pd->ibpd.uobject->context)->uar.index);
104 context->uar = cpu_to_be32(dev->driver_uar.index);
107 static void mthca_arbel_init_srq_context(struct mthca_dev *dev,
109 struct mthca_srq *srq,
110 struct mthca_arbel_srq_context *context)
114 memset(context, 0, sizeof *context);
116 logsize = long_log2(srq->max) + srq->wqe_shift;
117 context->state_logsize_srqn = cpu_to_be32(logsize << 24 | srq->srqn);
118 context->lkey = cpu_to_be32(srq->mr.ibmr.lkey);
119 context->db_index = cpu_to_be32(srq->db_index);
120 context->logstride_usrpage = cpu_to_be32((srq->wqe_shift - 4) << 29);
121 if (pd->ibpd.uobject)
122 context->logstride_usrpage |=
123 cpu_to_be32(to_mucontext(pd->ibpd.uobject->context)->uar.index);
125 context->logstride_usrpage |= cpu_to_be32(dev->driver_uar.index);
126 context->eq_pd = cpu_to_be32(MTHCA_EQ_ASYNC << 24 | pd->pd_num);
129 static void mthca_free_srq_buf(struct mthca_dev *dev, struct mthca_srq *srq)
131 mthca_buf_free(dev, srq->max << srq->wqe_shift, &srq->queue,
132 srq->is_direct, &srq->mr);
136 static int mthca_alloc_srq_buf(struct mthca_dev *dev, struct mthca_pd *pd,
137 struct mthca_srq *srq)
139 struct mthca_data_seg *scatter;
144 if (pd->ibpd.uobject)
147 srq->wrid = kmalloc(srq->max * sizeof (u64), GFP_KERNEL);
151 err = mthca_buf_alloc(dev, srq->max << srq->wqe_shift,
152 MTHCA_MAX_DIRECT_SRQ_SIZE,
153 &srq->queue, &srq->is_direct, pd, 1, &srq->mr);
160 * Now initialize the SRQ buffer so that all of the WQEs are
161 * linked into the list of free WQEs. In addition, set the
162 * scatter list L_Keys to the sentry value of 0x100.
164 for (i = 0; i < srq->max; ++i) {
165 wqe = get_wqe(srq, i);
167 *wqe_to_link(wqe) = i < srq->max - 1 ? i + 1 : -1;
169 for (scatter = wqe + sizeof (struct mthca_next_seg);
170 (void *) scatter < wqe + (1 << srq->wqe_shift);
172 scatter->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
175 srq->last = get_wqe(srq, srq->max - 1);
180 int mthca_alloc_srq(struct mthca_dev *dev, struct mthca_pd *pd,
181 struct ib_srq_attr *attr, struct mthca_srq *srq)
183 struct mthca_mailbox *mailbox;
188 /* Sanity check SRQ size before proceeding */
189 if (attr->max_wr > 16 << 20 || attr->max_sge > 64)
192 srq->max = attr->max_wr;
193 srq->max_gs = attr->max_sge;
196 if (mthca_is_memfree(dev))
197 srq->max = roundup_pow_of_two(srq->max + 1);
200 roundup_pow_of_two(sizeof (struct mthca_next_seg) +
201 srq->max_gs * sizeof (struct mthca_data_seg)));
202 srq->wqe_shift = long_log2(ds);
204 srq->srqn = mthca_alloc(&dev->srq_table.alloc);
208 if (mthca_is_memfree(dev)) {
209 err = mthca_table_get(dev, dev->srq_table.table, srq->srqn);
213 if (!pd->ibpd.uobject) {
214 srq->db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_SRQ,
215 srq->srqn, &srq->db);
216 if (srq->db_index < 0) {
223 mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
224 if (IS_ERR(mailbox)) {
225 err = PTR_ERR(mailbox);
229 err = mthca_alloc_srq_buf(dev, pd, srq);
231 goto err_out_mailbox;
233 spin_lock_init(&srq->lock);
234 atomic_set(&srq->refcount, 1);
235 init_waitqueue_head(&srq->wait);
237 if (mthca_is_memfree(dev))
238 mthca_arbel_init_srq_context(dev, pd, srq, mailbox->buf);
240 mthca_tavor_init_srq_context(dev, pd, srq, mailbox->buf);
242 err = mthca_SW2HW_SRQ(dev, mailbox, srq->srqn, &status);
245 mthca_warn(dev, "SW2HW_SRQ failed (%d)\n", err);
246 goto err_out_free_buf;
249 mthca_warn(dev, "SW2HW_SRQ returned status 0x%02x\n",
252 goto err_out_free_buf;
255 spin_lock_irq(&dev->srq_table.lock);
256 if (mthca_array_set(&dev->srq_table.srq,
257 srq->srqn & (dev->limits.num_srqs - 1),
259 spin_unlock_irq(&dev->srq_table.lock);
260 goto err_out_free_srq;
262 spin_unlock_irq(&dev->srq_table.lock);
264 mthca_free_mailbox(dev, mailbox);
267 srq->last_free = srq->max - 1;
272 err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
274 mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
276 mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
279 if (!pd->ibpd.uobject)
280 mthca_free_srq_buf(dev, srq);
283 mthca_free_mailbox(dev, mailbox);
286 if (!pd->ibpd.uobject && mthca_is_memfree(dev))
287 mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
290 mthca_table_put(dev, dev->srq_table.table, srq->srqn);
293 mthca_free(&dev->srq_table.alloc, srq->srqn);
298 void mthca_free_srq(struct mthca_dev *dev, struct mthca_srq *srq)
300 struct mthca_mailbox *mailbox;
304 mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
305 if (IS_ERR(mailbox)) {
306 mthca_warn(dev, "No memory for mailbox to free SRQ.\n");
310 err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
312 mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
314 mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
316 spin_lock_irq(&dev->srq_table.lock);
317 mthca_array_clear(&dev->srq_table.srq,
318 srq->srqn & (dev->limits.num_srqs - 1));
319 spin_unlock_irq(&dev->srq_table.lock);
321 atomic_dec(&srq->refcount);
322 wait_event(srq->wait, !atomic_read(&srq->refcount));
324 if (!srq->ibsrq.uobject) {
325 mthca_free_srq_buf(dev, srq);
326 if (mthca_is_memfree(dev))
327 mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
330 mthca_table_put(dev, dev->srq_table.table, srq->srqn);
331 mthca_free(&dev->srq_table.alloc, srq->srqn);
332 mthca_free_mailbox(dev, mailbox);
335 void mthca_srq_event(struct mthca_dev *dev, u32 srqn,
336 enum ib_event_type event_type)
338 struct mthca_srq *srq;
339 struct ib_event event;
341 spin_lock(&dev->srq_table.lock);
342 srq = mthca_array_get(&dev->srq_table.srq, srqn & (dev->limits.num_srqs - 1));
344 atomic_inc(&srq->refcount);
345 spin_unlock(&dev->srq_table.lock);
348 mthca_warn(dev, "Async event for bogus SRQ %08x\n", srqn);
352 if (!srq->ibsrq.event_handler)
355 event.device = &dev->ib_dev;
356 event.event = event_type;
357 event.element.srq = &srq->ibsrq;
358 srq->ibsrq.event_handler(&event, srq->ibsrq.srq_context);
361 if (atomic_dec_and_test(&srq->refcount))
366 * This function must be called with IRQs disabled.
368 void mthca_free_srq_wqe(struct mthca_srq *srq, u32 wqe_addr)
372 ind = wqe_addr >> srq->wqe_shift;
374 spin_lock(&srq->lock);
376 if (likely(srq->first_free >= 0))
377 *wqe_to_link(get_wqe(srq, srq->last_free)) = ind;
379 srq->first_free = ind;
381 *wqe_to_link(get_wqe(srq, ind)) = -1;
382 srq->last_free = ind;
384 spin_unlock(&srq->lock);
387 int mthca_tavor_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
388 struct ib_recv_wr **bad_wr)
390 struct mthca_dev *dev = to_mdev(ibsrq->device);
391 struct mthca_srq *srq = to_msrq(ibsrq);
402 spin_lock_irqsave(&srq->lock, flags);
404 first_ind = srq->first_free;
406 for (nreq = 0; wr; ++nreq, wr = wr->next) {
407 ind = srq->first_free;
410 mthca_err(dev, "SRQ %06x full\n", srq->srqn);
416 wqe = get_wqe(srq, ind);
417 next_ind = *wqe_to_link(wqe);
418 prev_wqe = srq->last;
421 ((struct mthca_next_seg *) wqe)->nda_op = 0;
422 ((struct mthca_next_seg *) wqe)->ee_nds = 0;
423 /* flags field will always remain 0 */
425 wqe += sizeof (struct mthca_next_seg);
427 if (unlikely(wr->num_sge > srq->max_gs)) {
430 srq->last = prev_wqe;
434 for (i = 0; i < wr->num_sge; ++i) {
435 ((struct mthca_data_seg *) wqe)->byte_count =
436 cpu_to_be32(wr->sg_list[i].length);
437 ((struct mthca_data_seg *) wqe)->lkey =
438 cpu_to_be32(wr->sg_list[i].lkey);
439 ((struct mthca_data_seg *) wqe)->addr =
440 cpu_to_be64(wr->sg_list[i].addr);
441 wqe += sizeof (struct mthca_data_seg);
444 if (i < srq->max_gs) {
445 ((struct mthca_data_seg *) wqe)->byte_count = 0;
446 ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
447 ((struct mthca_data_seg *) wqe)->addr = 0;
450 ((struct mthca_next_seg *) prev_wqe)->nda_op =
451 cpu_to_be32((ind << srq->wqe_shift) | 1);
453 ((struct mthca_next_seg *) prev_wqe)->ee_nds =
454 cpu_to_be32(MTHCA_NEXT_DBD);
456 srq->wrid[ind] = wr->wr_id;
457 srq->first_free = next_ind;
463 doorbell[0] = cpu_to_be32(first_ind << srq->wqe_shift);
464 doorbell[1] = cpu_to_be32((srq->srqn << 8) | nreq);
467 * Make sure that descriptors are written before
472 mthca_write64(doorbell,
473 dev->kar + MTHCA_RECEIVE_DOORBELL,
474 MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
477 spin_unlock_irqrestore(&srq->lock, flags);
481 int mthca_arbel_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
482 struct ib_recv_wr **bad_wr)
484 struct mthca_dev *dev = to_mdev(ibsrq->device);
485 struct mthca_srq *srq = to_msrq(ibsrq);
494 spin_lock_irqsave(&srq->lock, flags);
496 for (nreq = 0; wr; ++nreq, wr = wr->next) {
497 ind = srq->first_free;
500 mthca_err(dev, "SRQ %06x full\n", srq->srqn);
506 wqe = get_wqe(srq, ind);
507 next_ind = *wqe_to_link(wqe);
509 ((struct mthca_next_seg *) wqe)->nda_op =
510 cpu_to_be32((next_ind << srq->wqe_shift) | 1);
511 ((struct mthca_next_seg *) wqe)->ee_nds = 0;
512 /* flags field will always remain 0 */
514 wqe += sizeof (struct mthca_next_seg);
516 if (unlikely(wr->num_sge > srq->max_gs)) {
522 for (i = 0; i < wr->num_sge; ++i) {
523 ((struct mthca_data_seg *) wqe)->byte_count =
524 cpu_to_be32(wr->sg_list[i].length);
525 ((struct mthca_data_seg *) wqe)->lkey =
526 cpu_to_be32(wr->sg_list[i].lkey);
527 ((struct mthca_data_seg *) wqe)->addr =
528 cpu_to_be64(wr->sg_list[i].addr);
529 wqe += sizeof (struct mthca_data_seg);
532 if (i < srq->max_gs) {
533 ((struct mthca_data_seg *) wqe)->byte_count = 0;
534 ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
535 ((struct mthca_data_seg *) wqe)->addr = 0;
538 srq->wrid[ind] = wr->wr_id;
539 srq->first_free = next_ind;
543 srq->counter += nreq;
546 * Make sure that descriptors are written before
547 * we write doorbell record.
550 *srq->db = cpu_to_be32(srq->counter);
553 spin_unlock_irqrestore(&srq->lock, flags);
557 int __devinit mthca_init_srq_table(struct mthca_dev *dev)
561 if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
564 spin_lock_init(&dev->srq_table.lock);
566 err = mthca_alloc_init(&dev->srq_table.alloc,
567 dev->limits.num_srqs,
568 dev->limits.num_srqs - 1,
569 dev->limits.reserved_srqs);
573 err = mthca_array_init(&dev->srq_table.srq,
574 dev->limits.num_srqs);
576 mthca_alloc_cleanup(&dev->srq_table.alloc);
581 void __devexit mthca_cleanup_srq_table(struct mthca_dev *dev)
583 if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
586 mthca_array_cleanup(&dev->srq_table.srq, dev->limits.num_srqs);
587 mthca_alloc_cleanup(&dev->srq_table.alloc);