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 > dev->limits.max_srq_wqes ||
190 attr->max_sge > dev->limits.max_sg)
193 srq->max = attr->max_wr;
194 srq->max_gs = attr->max_sge;
197 if (mthca_is_memfree(dev))
198 srq->max = roundup_pow_of_two(srq->max + 1);
201 roundup_pow_of_two(sizeof (struct mthca_next_seg) +
202 srq->max_gs * sizeof (struct mthca_data_seg)));
203 srq->wqe_shift = long_log2(ds);
205 srq->srqn = mthca_alloc(&dev->srq_table.alloc);
209 if (mthca_is_memfree(dev)) {
210 err = mthca_table_get(dev, dev->srq_table.table, srq->srqn);
214 if (!pd->ibpd.uobject) {
215 srq->db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_SRQ,
216 srq->srqn, &srq->db);
217 if (srq->db_index < 0) {
224 mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
225 if (IS_ERR(mailbox)) {
226 err = PTR_ERR(mailbox);
230 err = mthca_alloc_srq_buf(dev, pd, srq);
232 goto err_out_mailbox;
234 spin_lock_init(&srq->lock);
235 atomic_set(&srq->refcount, 1);
236 init_waitqueue_head(&srq->wait);
238 if (mthca_is_memfree(dev))
239 mthca_arbel_init_srq_context(dev, pd, srq, mailbox->buf);
241 mthca_tavor_init_srq_context(dev, pd, srq, mailbox->buf);
243 err = mthca_SW2HW_SRQ(dev, mailbox, srq->srqn, &status);
246 mthca_warn(dev, "SW2HW_SRQ failed (%d)\n", err);
247 goto err_out_free_buf;
250 mthca_warn(dev, "SW2HW_SRQ returned status 0x%02x\n",
253 goto err_out_free_buf;
256 spin_lock_irq(&dev->srq_table.lock);
257 if (mthca_array_set(&dev->srq_table.srq,
258 srq->srqn & (dev->limits.num_srqs - 1),
260 spin_unlock_irq(&dev->srq_table.lock);
261 goto err_out_free_srq;
263 spin_unlock_irq(&dev->srq_table.lock);
265 mthca_free_mailbox(dev, mailbox);
268 srq->last_free = srq->max - 1;
273 err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
275 mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
277 mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
280 if (!pd->ibpd.uobject)
281 mthca_free_srq_buf(dev, srq);
284 mthca_free_mailbox(dev, mailbox);
287 if (!pd->ibpd.uobject && mthca_is_memfree(dev))
288 mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
291 mthca_table_put(dev, dev->srq_table.table, srq->srqn);
294 mthca_free(&dev->srq_table.alloc, srq->srqn);
299 void mthca_free_srq(struct mthca_dev *dev, struct mthca_srq *srq)
301 struct mthca_mailbox *mailbox;
305 mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
306 if (IS_ERR(mailbox)) {
307 mthca_warn(dev, "No memory for mailbox to free SRQ.\n");
311 err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
313 mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
315 mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
317 spin_lock_irq(&dev->srq_table.lock);
318 mthca_array_clear(&dev->srq_table.srq,
319 srq->srqn & (dev->limits.num_srqs - 1));
320 spin_unlock_irq(&dev->srq_table.lock);
322 atomic_dec(&srq->refcount);
323 wait_event(srq->wait, !atomic_read(&srq->refcount));
325 if (!srq->ibsrq.uobject) {
326 mthca_free_srq_buf(dev, srq);
327 if (mthca_is_memfree(dev))
328 mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
331 mthca_table_put(dev, dev->srq_table.table, srq->srqn);
332 mthca_free(&dev->srq_table.alloc, srq->srqn);
333 mthca_free_mailbox(dev, mailbox);
336 int mthca_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
337 enum ib_srq_attr_mask attr_mask)
339 struct mthca_dev *dev = to_mdev(ibsrq->device);
340 struct mthca_srq *srq = to_msrq(ibsrq);
344 /* We don't support resizing SRQs (yet?) */
345 if (attr_mask & IB_SRQ_MAX_WR)
348 if (attr_mask & IB_SRQ_LIMIT) {
349 ret = mthca_ARM_SRQ(dev, srq->srqn, attr->srq_limit, &status);
359 void mthca_srq_event(struct mthca_dev *dev, u32 srqn,
360 enum ib_event_type event_type)
362 struct mthca_srq *srq;
363 struct ib_event event;
365 spin_lock(&dev->srq_table.lock);
366 srq = mthca_array_get(&dev->srq_table.srq, srqn & (dev->limits.num_srqs - 1));
368 atomic_inc(&srq->refcount);
369 spin_unlock(&dev->srq_table.lock);
372 mthca_warn(dev, "Async event for bogus SRQ %08x\n", srqn);
376 if (!srq->ibsrq.event_handler)
379 event.device = &dev->ib_dev;
380 event.event = event_type;
381 event.element.srq = &srq->ibsrq;
382 srq->ibsrq.event_handler(&event, srq->ibsrq.srq_context);
385 if (atomic_dec_and_test(&srq->refcount))
390 * This function must be called with IRQs disabled.
392 void mthca_free_srq_wqe(struct mthca_srq *srq, u32 wqe_addr)
396 ind = wqe_addr >> srq->wqe_shift;
398 spin_lock(&srq->lock);
400 if (likely(srq->first_free >= 0))
401 *wqe_to_link(get_wqe(srq, srq->last_free)) = ind;
403 srq->first_free = ind;
405 *wqe_to_link(get_wqe(srq, ind)) = -1;
406 srq->last_free = ind;
408 spin_unlock(&srq->lock);
411 int mthca_tavor_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
412 struct ib_recv_wr **bad_wr)
414 struct mthca_dev *dev = to_mdev(ibsrq->device);
415 struct mthca_srq *srq = to_msrq(ibsrq);
426 spin_lock_irqsave(&srq->lock, flags);
428 first_ind = srq->first_free;
430 for (nreq = 0; wr; ++nreq, wr = wr->next) {
431 ind = srq->first_free;
434 mthca_err(dev, "SRQ %06x full\n", srq->srqn);
440 wqe = get_wqe(srq, ind);
441 next_ind = *wqe_to_link(wqe);
444 mthca_err(dev, "SRQ %06x full\n", srq->srqn);
450 prev_wqe = srq->last;
453 ((struct mthca_next_seg *) wqe)->nda_op = 0;
454 ((struct mthca_next_seg *) wqe)->ee_nds = 0;
455 /* flags field will always remain 0 */
457 wqe += sizeof (struct mthca_next_seg);
459 if (unlikely(wr->num_sge > srq->max_gs)) {
462 srq->last = prev_wqe;
466 for (i = 0; i < wr->num_sge; ++i) {
467 ((struct mthca_data_seg *) wqe)->byte_count =
468 cpu_to_be32(wr->sg_list[i].length);
469 ((struct mthca_data_seg *) wqe)->lkey =
470 cpu_to_be32(wr->sg_list[i].lkey);
471 ((struct mthca_data_seg *) wqe)->addr =
472 cpu_to_be64(wr->sg_list[i].addr);
473 wqe += sizeof (struct mthca_data_seg);
476 if (i < srq->max_gs) {
477 ((struct mthca_data_seg *) wqe)->byte_count = 0;
478 ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
479 ((struct mthca_data_seg *) wqe)->addr = 0;
482 ((struct mthca_next_seg *) prev_wqe)->nda_op =
483 cpu_to_be32((ind << srq->wqe_shift) | 1);
485 ((struct mthca_next_seg *) prev_wqe)->ee_nds =
486 cpu_to_be32(MTHCA_NEXT_DBD);
488 srq->wrid[ind] = wr->wr_id;
489 srq->first_free = next_ind;
495 doorbell[0] = cpu_to_be32(first_ind << srq->wqe_shift);
496 doorbell[1] = cpu_to_be32((srq->srqn << 8) | nreq);
499 * Make sure that descriptors are written before
504 mthca_write64(doorbell,
505 dev->kar + MTHCA_RECEIVE_DOORBELL,
506 MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
509 spin_unlock_irqrestore(&srq->lock, flags);
513 int mthca_arbel_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
514 struct ib_recv_wr **bad_wr)
516 struct mthca_dev *dev = to_mdev(ibsrq->device);
517 struct mthca_srq *srq = to_msrq(ibsrq);
526 spin_lock_irqsave(&srq->lock, flags);
528 for (nreq = 0; wr; ++nreq, wr = wr->next) {
529 ind = srq->first_free;
532 mthca_err(dev, "SRQ %06x full\n", srq->srqn);
538 wqe = get_wqe(srq, ind);
539 next_ind = *wqe_to_link(wqe);
542 mthca_err(dev, "SRQ %06x full\n", srq->srqn);
548 ((struct mthca_next_seg *) wqe)->nda_op =
549 cpu_to_be32((next_ind << srq->wqe_shift) | 1);
550 ((struct mthca_next_seg *) wqe)->ee_nds = 0;
551 /* flags field will always remain 0 */
553 wqe += sizeof (struct mthca_next_seg);
555 if (unlikely(wr->num_sge > srq->max_gs)) {
561 for (i = 0; i < wr->num_sge; ++i) {
562 ((struct mthca_data_seg *) wqe)->byte_count =
563 cpu_to_be32(wr->sg_list[i].length);
564 ((struct mthca_data_seg *) wqe)->lkey =
565 cpu_to_be32(wr->sg_list[i].lkey);
566 ((struct mthca_data_seg *) wqe)->addr =
567 cpu_to_be64(wr->sg_list[i].addr);
568 wqe += sizeof (struct mthca_data_seg);
571 if (i < srq->max_gs) {
572 ((struct mthca_data_seg *) wqe)->byte_count = 0;
573 ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
574 ((struct mthca_data_seg *) wqe)->addr = 0;
577 srq->wrid[ind] = wr->wr_id;
578 srq->first_free = next_ind;
582 srq->counter += nreq;
585 * Make sure that descriptors are written before
586 * we write doorbell record.
589 *srq->db = cpu_to_be32(srq->counter);
592 spin_unlock_irqrestore(&srq->lock, flags);
596 int __devinit mthca_init_srq_table(struct mthca_dev *dev)
600 if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
603 spin_lock_init(&dev->srq_table.lock);
605 err = mthca_alloc_init(&dev->srq_table.alloc,
606 dev->limits.num_srqs,
607 dev->limits.num_srqs - 1,
608 dev->limits.reserved_srqs);
612 err = mthca_array_init(&dev->srq_table.srq,
613 dev->limits.num_srqs);
615 mthca_alloc_cleanup(&dev->srq_table.alloc);
620 void __devexit mthca_cleanup_srq_table(struct mthca_dev *dev)
622 if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
625 mthca_array_cleanup(&dev->srq_table.srq, dev->limits.num_srqs);
626 mthca_alloc_cleanup(&dev->srq_table.alloc);