drivers/infiniband/hw/mthca/mthca_srq.c

   1 /*
   2  * Copyright (c) 2005 Cisco Systems. All rights reserved.
   3  *
   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:
   9  *
  10  *     Redistribution and use in source and binary forms, with or
  11  *     without modification, are permitted provided that the following
  12  *     conditions are met:
  13  *
  14  *      - Redistributions of source code must retain the above
  15  *        copyright notice, this list of conditions and the following
  16  *        disclaimer.
  17  *
  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.
  22  *
  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
  30  * SOFTWARE.
  31  *
  32  * $Id: mthca_srq.c 3047 2005-08-10 03:59:35Z roland $
  33  */
  34
  35 #include <linux/slab.h>
  36 #include <linux/string.h>
  37
  38 #include "mthca_dev.h"
  39 #include "mthca_cmd.h"
  40 #include "mthca_memfree.h"
  41 #include "mthca_wqe.h"
  42
  43 enum {
  44         MTHCA_MAX_DIRECT_SRQ_SIZE = 4 * PAGE_SIZE
  45 };
  46
  47 struct mthca_tavor_srq_context {
  48         __be64 wqe_base_ds;     /* low 6 bits is descriptor size */
  49         __be32 state_pd;
  50         __be32 lkey;
  51         __be32 uar;
  52         __be16 limit_watermark;
  53         __be16 wqe_cnt;
  54         u32    reserved[2];
  55 };
  56
  57 struct mthca_arbel_srq_context {
  58         __be32 state_logsize_srqn;
  59         __be32 lkey;
  60         __be32 db_index;
  61         __be32 logstride_usrpage;
  62         __be64 wqe_base;
  63         __be32 eq_pd;
  64         __be16 limit_watermark;
  65         __be16 wqe_cnt;
  66         u16    reserved1;
  67         __be16 wqe_counter;
  68         u32    reserved2[3];
  69 };
  70
  71 static void *get_wqe(struct mthca_srq *srq, int n)
  72 {
  73         if (srq->is_direct)
  74                 return srq->queue.direct.buf + (n << srq->wqe_shift);
  75         else
  76                 return srq->queue.page_list[(n << srq->wqe_shift) >> PAGE_SHIFT].buf +
  77                         ((n << srq->wqe_shift) & (PAGE_SIZE - 1));
  78 }
  79
  80 /*
  81  * Return a pointer to the location within a WQE that we're using as a
  82  * link when the WQE is in the free list.  We use the imm field
  83  * because in the Tavor case, posting a WQE may overwrite the next
  84  * segment of the previous WQE, but a receive WQE will never touch the
  85  * imm field.  This avoids corrupting our free list if the previous
  86  * WQE has already completed and been put on the free list when we
  87  * post the next WQE.
  88  */
  89 static inline int *wqe_to_link(void *wqe)
  90 {
  91         return (int *) (wqe + offsetof(struct mthca_next_seg, imm));
  92 }
  93
  94 static void mthca_tavor_init_srq_context(struct mthca_dev *dev,
  95                                          struct mthca_pd *pd,
  96                                          struct mthca_srq *srq,
  97                                          struct mthca_tavor_srq_context *context)
  98 {
  99         memset(context, 0, sizeof *context);
 100
 101         context->wqe_base_ds = cpu_to_be64(1 << (srq->wqe_shift - 4));
 102         context->state_pd    = cpu_to_be32(pd->pd_num);
 103         context->lkey        = cpu_to_be32(srq->mr.ibmr.lkey);
 104
 105         if (pd->ibpd.uobject)
 106                 context->uar =
 107                         cpu_to_be32(to_mucontext(pd->ibpd.uobject->context)->uar.index);
 108         else
 109                 context->uar = cpu_to_be32(dev->driver_uar.index);
 110 }
 111
 112 static void mthca_arbel_init_srq_context(struct mthca_dev *dev,
 113                                          struct mthca_pd *pd,
 114                                          struct mthca_srq *srq,
 115                                          struct mthca_arbel_srq_context *context)
 116 {
 117         int logsize;
 118
 119         memset(context, 0, sizeof *context);
 120
 121         logsize = long_log2(srq->max) + srq->wqe_shift;
 122         context->state_logsize_srqn = cpu_to_be32(logsize << 24 | srq->srqn);
 123         context->lkey = cpu_to_be32(srq->mr.ibmr.lkey);
 124         context->db_index = cpu_to_be32(srq->db_index);
 125         context->logstride_usrpage = cpu_to_be32((srq->wqe_shift - 4) << 29);
 126         if (pd->ibpd.uobject)
 127                 context->logstride_usrpage |=
 128                         cpu_to_be32(to_mucontext(pd->ibpd.uobject->context)->uar.index);
 129         else
 130                 context->logstride_usrpage |= cpu_to_be32(dev->driver_uar.index);
 131         context->eq_pd = cpu_to_be32(MTHCA_EQ_ASYNC << 24 | pd->pd_num);
 132 }
 133
 134 static void mthca_free_srq_buf(struct mthca_dev *dev, struct mthca_srq *srq)
 135 {
 136         mthca_buf_free(dev, srq->max << srq->wqe_shift, &srq->queue,
 137                        srq->is_direct, &srq->mr);
 138         kfree(srq->wrid);
 139 }
 140
 141 static int mthca_alloc_srq_buf(struct mthca_dev *dev, struct mthca_pd *pd,
 142                                struct mthca_srq *srq)
 143 {
 144         struct mthca_data_seg *scatter;
 145         void *wqe;
 146         int err;
 147         int i;
 148
 149         if (pd->ibpd.uobject)
 150                 return 0;
 151
 152         srq->wrid = kmalloc(srq->max * sizeof (u64), GFP_KERNEL);
 153         if (!srq->wrid)
 154                 return -ENOMEM;
 155
 156         err = mthca_buf_alloc(dev, srq->max << srq->wqe_shift,
 157                               MTHCA_MAX_DIRECT_SRQ_SIZE,
 158                               &srq->queue, &srq->is_direct, pd, 1, &srq->mr);
 159         if (err) {
 160                 kfree(srq->wrid);
 161                 return err;
 162         }
 163
 164         /*
 165          * Now initialize the SRQ buffer so that all of the WQEs are
 166          * linked into the list of free WQEs.  In addition, set the
 167          * scatter list L_Keys to the sentry value of 0x100.
 168          */
 169         for (i = 0; i < srq->max; ++i) {
 170                 wqe = get_wqe(srq, i);
 171
 172                 *wqe_to_link(wqe) = i < srq->max - 1 ? i + 1 : -1;
 173
 174                 for (scatter = wqe + sizeof (struct mthca_next_seg);
 175                      (void *) scatter < wqe + (1 << srq->wqe_shift);
 176                      ++scatter)
 177                         scatter->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
 178         }
 179
 180         srq->last = get_wqe(srq, srq->max - 1);
 181
 182         return 0;
 183 }
 184
 185 int mthca_alloc_srq(struct mthca_dev *dev, struct mthca_pd *pd,
 186                     struct ib_srq_attr *attr, struct mthca_srq *srq)
 187 {
 188         struct mthca_mailbox *mailbox;
 189         u8 status;
 190         int ds;
 191         int err;
 192
 193         /* Sanity check SRQ size before proceeding */
 194         if (attr->max_wr  > dev->limits.max_srq_wqes ||
 195             attr->max_sge > dev->limits.max_srq_sge)
 196                 return -EINVAL;
 197
 198         srq->max      = attr->max_wr;
 199         srq->max_gs   = attr->max_sge;
 200         srq->counter  = 0;
 201
 202         if (mthca_is_memfree(dev))
 203                 srq->max = roundup_pow_of_two(srq->max + 1);
 204
 205         ds = max(64UL,
 206                  roundup_pow_of_two(sizeof (struct mthca_next_seg) +
 207                                     srq->max_gs * sizeof (struct mthca_data_seg)));
 208
 209         if (!mthca_is_memfree(dev) && (ds > dev->limits.max_desc_sz))
 210                 return -EINVAL;
 211
 212         srq->wqe_shift = long_log2(ds);
 213
 214         srq->srqn = mthca_alloc(&dev->srq_table.alloc);
 215         if (srq->srqn == -1)
 216                 return -ENOMEM;
 217
 218         if (mthca_is_memfree(dev)) {
 219                 err = mthca_table_get(dev, dev->srq_table.table, srq->srqn);
 220                 if (err)
 221                         goto err_out;
 222
 223                 if (!pd->ibpd.uobject) {
 224                         srq->db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_SRQ,
 225                                                        srq->srqn, &srq->db);
 226                         if (srq->db_index < 0) {
 227                                 err = -ENOMEM;
 228                                 goto err_out_icm;
 229                         }
 230                 }
 231         }
 232
 233         mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
 234         if (IS_ERR(mailbox)) {
 235                 err = PTR_ERR(mailbox);
 236                 goto err_out_db;
 237         }
 238
 239         err = mthca_alloc_srq_buf(dev, pd, srq);
 240         if (err)
 241                 goto err_out_mailbox;
 242
 243         spin_lock_init(&srq->lock);
 244         srq->refcount = 1;
 245         init_waitqueue_head(&srq->wait);
 246         mutex_init(&srq->mutex);
 247
 248         if (mthca_is_memfree(dev))
 249                 mthca_arbel_init_srq_context(dev, pd, srq, mailbox->buf);
 250         else
 251                 mthca_tavor_init_srq_context(dev, pd, srq, mailbox->buf);
 252
 253         err = mthca_SW2HW_SRQ(dev, mailbox, srq->srqn, &status);
 254
 255         if (err) {
 256                 mthca_warn(dev, "SW2HW_SRQ failed (%d)\n", err);
 257                 goto err_out_free_buf;
 258         }
 259         if (status) {
 260                 mthca_warn(dev, "SW2HW_SRQ returned status 0x%02x\n",
 261                            status);
 262                 err = -EINVAL;
 263                 goto err_out_free_buf;
 264         }
 265
 266         spin_lock_irq(&dev->srq_table.lock);
 267         if (mthca_array_set(&dev->srq_table.srq,
 268                             srq->srqn & (dev->limits.num_srqs - 1),
 269                             srq)) {
 270                 spin_unlock_irq(&dev->srq_table.lock);
 271                 goto err_out_free_srq;
 272         }
 273         spin_unlock_irq(&dev->srq_table.lock);
 274
 275         mthca_free_mailbox(dev, mailbox);
 276
 277         srq->first_free = 0;
 278         srq->last_free  = srq->max - 1;
 279
 280         attr->max_wr    = (mthca_is_memfree(dev)) ? srq->max - 1 : srq->max;
 281         attr->max_sge   = srq->max_gs;
 282
 283         return 0;
 284
 285 err_out_free_srq:
 286         err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
 287         if (err)
 288                 mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
 289         else if (status)
 290                 mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
 291
 292 err_out_free_buf:
 293         if (!pd->ibpd.uobject)
 294                 mthca_free_srq_buf(dev, srq);
 295
 296 err_out_mailbox:
 297         mthca_free_mailbox(dev, mailbox);
 298
 299 err_out_db:
 300         if (!pd->ibpd.uobject && mthca_is_memfree(dev))
 301                 mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
 302
 303 err_out_icm:
 304         mthca_table_put(dev, dev->srq_table.table, srq->srqn);
 305
 306 err_out:
 307         mthca_free(&dev->srq_table.alloc, srq->srqn);
 308
 309         return err;
 310 }
 311
 312 static inline int get_srq_refcount(struct mthca_dev *dev, struct mthca_srq *srq)
 313 {
 314         int c;
 315
 316         spin_lock_irq(&dev->srq_table.lock);
 317         c = srq->refcount;
 318         spin_unlock_irq(&dev->srq_table.lock);
 319
 320         return c;
 321 }
 322
 323 void mthca_free_srq(struct mthca_dev *dev, struct mthca_srq *srq)
 324 {
 325         struct mthca_mailbox *mailbox;
 326         int err;
 327         u8 status;
 328
 329         mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
 330         if (IS_ERR(mailbox)) {
 331                 mthca_warn(dev, "No memory for mailbox to free SRQ.\n");
 332                 return;
 333         }
 334
 335         err = mthca_HW2SW_SRQ(dev, mailbox, srq->srqn, &status);
 336         if (err)
 337                 mthca_warn(dev, "HW2SW_SRQ failed (%d)\n", err);
 338         else if (status)
 339                 mthca_warn(dev, "HW2SW_SRQ returned status 0x%02x\n", status);
 340
 341         spin_lock_irq(&dev->srq_table.lock);
 342         mthca_array_clear(&dev->srq_table.srq,
 343                           srq->srqn & (dev->limits.num_srqs - 1));
 344         --srq->refcount;
 345         spin_unlock_irq(&dev->srq_table.lock);
 346
 347         wait_event(srq->wait, !get_srq_refcount(dev, srq));
 348
 349         if (!srq->ibsrq.uobject) {
 350                 mthca_free_srq_buf(dev, srq);
 351                 if (mthca_is_memfree(dev))
 352                         mthca_free_db(dev, MTHCA_DB_TYPE_SRQ, srq->db_index);
 353         }
 354
 355         mthca_table_put(dev, dev->srq_table.table, srq->srqn);
 356         mthca_free(&dev->srq_table.alloc, srq->srqn);
 357         mthca_free_mailbox(dev, mailbox);
 358 }
 359
 360 int mthca_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
 361                      enum ib_srq_attr_mask attr_mask, struct ib_udata *udata)
 362 {
 363         struct mthca_dev *dev = to_mdev(ibsrq->device);
 364         struct mthca_srq *srq = to_msrq(ibsrq);
 365         int ret;
 366         u8 status;
 367
 368         /* We don't support resizing SRQs (yet?) */
 369         if (attr_mask & IB_SRQ_MAX_WR)
 370                 return -EINVAL;
 371
 372         if (attr_mask & IB_SRQ_LIMIT) {
 373                 u32 max_wr = mthca_is_memfree(dev) ? srq->max - 1 : srq->max;
 374                 if (attr->srq_limit > max_wr)
 375                         return -EINVAL;
 376
 377                 mutex_lock(&srq->mutex);
 378                 ret = mthca_ARM_SRQ(dev, srq->srqn, attr->srq_limit, &status);
 379                 mutex_unlock(&srq->mutex);
 380
 381                 if (ret)
 382                         return ret;
 383                 if (status)
 384                         return -EINVAL;
 385         }
 386
 387         return 0;
 388 }
 389
 390 int mthca_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *srq_attr)
 391 {
 392         struct mthca_dev *dev = to_mdev(ibsrq->device);
 393         struct mthca_srq *srq = to_msrq(ibsrq);
 394         struct mthca_mailbox *mailbox;
 395         struct mthca_arbel_srq_context *arbel_ctx;
 396         struct mthca_tavor_srq_context *tavor_ctx;
 397         u8 status;
 398         int err;
 399
 400         mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
 401         if (IS_ERR(mailbox))
 402                 return PTR_ERR(mailbox);
 403
 404         err = mthca_QUERY_SRQ(dev, srq->srqn, mailbox, &status);
 405         if (err)
 406                 goto out;
 407
 408         if (mthca_is_memfree(dev)) {
 409                 arbel_ctx = mailbox->buf;
 410                 srq_attr->srq_limit = be16_to_cpu(arbel_ctx->limit_watermark);
 411         } else {
 412                 tavor_ctx = mailbox->buf;
 413                 srq_attr->srq_limit = be16_to_cpu(tavor_ctx->limit_watermark);
 414         }
 415
 416         srq_attr->max_wr  = (mthca_is_memfree(dev)) ? srq->max - 1 : srq->max;
 417         srq_attr->max_sge = srq->max_gs;
 418
 419 out:
 420         mthca_free_mailbox(dev, mailbox);
 421
 422         return err;
 423 }
 424
 425 void mthca_srq_event(struct mthca_dev *dev, u32 srqn,
 426                      enum ib_event_type event_type)
 427 {
 428         struct mthca_srq *srq;
 429         struct ib_event event;
 430
 431         spin_lock(&dev->srq_table.lock);
 432         srq = mthca_array_get(&dev->srq_table.srq, srqn & (dev->limits.num_srqs - 1));
 433         if (srq)
 434                 ++srq->refcount;
 435         spin_unlock(&dev->srq_table.lock);
 436
 437         if (!srq) {
 438                 mthca_warn(dev, "Async event for bogus SRQ %08x\n", srqn);
 439                 return;
 440         }
 441
 442         if (!srq->ibsrq.event_handler)
 443                 goto out;
 444
 445         event.device      = &dev->ib_dev;
 446         event.event       = event_type;
 447         event.element.srq = &srq->ibsrq;
 448         srq->ibsrq.event_handler(&event, srq->ibsrq.srq_context);
 449
 450 out:
 451         spin_lock(&dev->srq_table.lock);
 452         if (!--srq->refcount)
 453                 wake_up(&srq->wait);
 454         spin_unlock(&dev->srq_table.lock);
 455 }
 456
 457 /*
 458  * This function must be called with IRQs disabled.
 459  */
 460 void mthca_free_srq_wqe(struct mthca_srq *srq, u32 wqe_addr)
 461 {
 462         int ind;
 463
 464         ind = wqe_addr >> srq->wqe_shift;
 465
 466         spin_lock(&srq->lock);
 467
 468         if (likely(srq->first_free >= 0))
 469                 *wqe_to_link(get_wqe(srq, srq->last_free)) = ind;
 470         else
 471                 srq->first_free = ind;
 472
 473         *wqe_to_link(get_wqe(srq, ind)) = -1;
 474         srq->last_free = ind;
 475
 476         spin_unlock(&srq->lock);
 477 }
 478
 479 int mthca_tavor_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
 480                               struct ib_recv_wr **bad_wr)
 481 {
 482         struct mthca_dev *dev = to_mdev(ibsrq->device);
 483         struct mthca_srq *srq = to_msrq(ibsrq);
 484         __be32 doorbell[2];
 485         unsigned long flags;
 486         int err = 0;
 487         int first_ind;
 488         int ind;
 489         int next_ind;
 490         int nreq;
 491         int i;
 492         void *wqe;
 493         void *prev_wqe;
 494
 495         spin_lock_irqsave(&srq->lock, flags);
 496
 497         first_ind = srq->first_free;
 498
 499         for (nreq = 0; wr; wr = wr->next) {
 500                 ind = srq->first_free;
 501
 502                 if (ind < 0) {
 503                         mthca_err(dev, "SRQ %06x full\n", srq->srqn);
 504                         err = -ENOMEM;
 505                         *bad_wr = wr;
 506                         break;
 507                 }
 508
 509                 wqe       = get_wqe(srq, ind);
 510                 next_ind  = *wqe_to_link(wqe);
 511
 512                 if (next_ind < 0) {
 513                         mthca_err(dev, "SRQ %06x full\n", srq->srqn);
 514                         err = -ENOMEM;
 515                         *bad_wr = wr;
 516                         break;
 517                 }
 518
 519                 prev_wqe  = srq->last;
 520                 srq->last = wqe;
 521
 522                 ((struct mthca_next_seg *) wqe)->nda_op = 0;
 523                 ((struct mthca_next_seg *) wqe)->ee_nds = 0;
 524                 /* flags field will always remain 0 */
 525
 526                 wqe += sizeof (struct mthca_next_seg);
 527
 528                 if (unlikely(wr->num_sge > srq->max_gs)) {
 529                         err = -EINVAL;
 530                         *bad_wr = wr;
 531                         srq->last = prev_wqe;
 532                         break;
 533                 }
 534
 535                 for (i = 0; i < wr->num_sge; ++i) {
 536                         ((struct mthca_data_seg *) wqe)->byte_count =
 537                                 cpu_to_be32(wr->sg_list[i].length);
 538                         ((struct mthca_data_seg *) wqe)->lkey =
 539                                 cpu_to_be32(wr->sg_list[i].lkey);
 540                         ((struct mthca_data_seg *) wqe)->addr =
 541                                 cpu_to_be64(wr->sg_list[i].addr);
 542                         wqe += sizeof (struct mthca_data_seg);
 543                 }
 544
 545                 if (i < srq->max_gs) {
 546                         ((struct mthca_data_seg *) wqe)->byte_count = 0;
 547                         ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
 548                         ((struct mthca_data_seg *) wqe)->addr = 0;
 549                 }
 550
 551                 ((struct mthca_next_seg *) prev_wqe)->nda_op =
 552                         cpu_to_be32((ind << srq->wqe_shift) | 1);
 553                 wmb();
 554                 ((struct mthca_next_seg *) prev_wqe)->ee_nds =
 555                         cpu_to_be32(MTHCA_NEXT_DBD);
 556
 557                 srq->wrid[ind]  = wr->wr_id;
 558                 srq->first_free = next_ind;
 559
 560                 ++nreq;
 561                 if (unlikely(nreq == MTHCA_TAVOR_MAX_WQES_PER_RECV_DB)) {
 562                         nreq = 0;
 563
 564                         doorbell[0] = cpu_to_be32(first_ind << srq->wqe_shift);
 565                         doorbell[1] = cpu_to_be32(srq->srqn << 8);
 566
 567                         /*
 568                          * Make sure that descriptors are written
 569                          * before doorbell is rung.
 570                          */
 571                         wmb();
 572
 573                         mthca_write64(doorbell,
 574                                       dev->kar + MTHCA_RECEIVE_DOORBELL,
 575                                       MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
 576
 577                         first_ind = srq->first_free;
 578                 }
 579         }
 580
 581         if (likely(nreq)) {
 582                 doorbell[0] = cpu_to_be32(first_ind << srq->wqe_shift);
 583                 doorbell[1] = cpu_to_be32((srq->srqn << 8) | nreq);
 584
 585                 /*
 586                  * Make sure that descriptors are written before
 587                  * doorbell is rung.
 588                  */
 589                 wmb();
 590
 591                 mthca_write64(doorbell,
 592                               dev->kar + MTHCA_RECEIVE_DOORBELL,
 593                               MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
 594         }
 595
 596         spin_unlock_irqrestore(&srq->lock, flags);
 597         return err;
 598 }
 599
 600 int mthca_arbel_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
 601                               struct ib_recv_wr **bad_wr)
 602 {
 603         struct mthca_dev *dev = to_mdev(ibsrq->device);
 604         struct mthca_srq *srq = to_msrq(ibsrq);
 605         unsigned long flags;
 606         int err = 0;
 607         int ind;
 608         int next_ind;
 609         int nreq;
 610         int i;
 611         void *wqe;
 612
 613         spin_lock_irqsave(&srq->lock, flags);
 614
 615         for (nreq = 0; wr; ++nreq, wr = wr->next) {
 616                 ind = srq->first_free;
 617
 618                 if (ind < 0) {
 619                         mthca_err(dev, "SRQ %06x full\n", srq->srqn);
 620                         err = -ENOMEM;
 621                         *bad_wr = wr;
 622                         break;
 623                 }
 624
 625                 wqe       = get_wqe(srq, ind);
 626                 next_ind  = *wqe_to_link(wqe);
 627
 628                 if (next_ind < 0) {
 629                         mthca_err(dev, "SRQ %06x full\n", srq->srqn);
 630                         err = -ENOMEM;
 631                         *bad_wr = wr;
 632                         break;
 633                 }
 634
 635                 ((struct mthca_next_seg *) wqe)->nda_op =
 636                         cpu_to_be32((next_ind << srq->wqe_shift) | 1);
 637                 ((struct mthca_next_seg *) wqe)->ee_nds = 0;
 638                 /* flags field will always remain 0 */
 639
 640                 wqe += sizeof (struct mthca_next_seg);
 641
 642                 if (unlikely(wr->num_sge > srq->max_gs)) {
 643                         err = -EINVAL;
 644                         *bad_wr = wr;
 645                         break;
 646                 }
 647
 648                 for (i = 0; i < wr->num_sge; ++i) {
 649                         ((struct mthca_data_seg *) wqe)->byte_count =
 650                                 cpu_to_be32(wr->sg_list[i].length);
 651                         ((struct mthca_data_seg *) wqe)->lkey =
 652                                 cpu_to_be32(wr->sg_list[i].lkey);
 653                         ((struct mthca_data_seg *) wqe)->addr =
 654                                 cpu_to_be64(wr->sg_list[i].addr);
 655                         wqe += sizeof (struct mthca_data_seg);
 656                 }
 657
 658                 if (i < srq->max_gs) {
 659                         ((struct mthca_data_seg *) wqe)->byte_count = 0;
 660                         ((struct mthca_data_seg *) wqe)->lkey = cpu_to_be32(MTHCA_INVAL_LKEY);
 661                         ((struct mthca_data_seg *) wqe)->addr = 0;
 662                 }
 663
 664                 srq->wrid[ind]  = wr->wr_id;
 665                 srq->first_free = next_ind;
 666         }
 667
 668         if (likely(nreq)) {
 669                 srq->counter += nreq;
 670
 671                 /*
 672                  * Make sure that descriptors are written before
 673                  * we write doorbell record.
 674                  */
 675                 wmb();
 676                 *srq->db = cpu_to_be32(srq->counter);
 677         }
 678
 679         spin_unlock_irqrestore(&srq->lock, flags);
 680         return err;
 681 }
 682
 683 int mthca_max_srq_sge(struct mthca_dev *dev)
 684 {
 685         if (mthca_is_memfree(dev))
 686                 return dev->limits.max_sg;
 687
 688         /*
 689          * SRQ allocations are based on powers of 2 for Tavor,
 690          * (although they only need to be multiples of 16 bytes).
 691          *
 692          * Therefore, we need to base the max number of sg entries on
 693          * the largest power of 2 descriptor size that is <= to the
 694          * actual max WQE descriptor size, rather than return the
 695          * max_sg value given by the firmware (which is based on WQE
 696          * sizes as multiples of 16, not powers of 2).
 697          *
 698          * If SRQ implementation is changed for Tavor to be based on
 699          * multiples of 16, the calculation below can be deleted and
 700          * the FW max_sg value returned.
 701          */
 702         return min_t(int, dev->limits.max_sg,
 703                      ((1 << (fls(dev->limits.max_desc_sz) - 1)) -
 704                       sizeof (struct mthca_next_seg)) /
 705                      sizeof (struct mthca_data_seg));
 706 }
 707
 708 int __devinit mthca_init_srq_table(struct mthca_dev *dev)
 709 {
 710         int err;
 711
 712         if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
 713                 return 0;
 714
 715         spin_lock_init(&dev->srq_table.lock);
 716
 717         err = mthca_alloc_init(&dev->srq_table.alloc,
 718                                dev->limits.num_srqs,
 719                                dev->limits.num_srqs - 1,
 720                                dev->limits.reserved_srqs);
 721         if (err)
 722                 return err;
 723
 724         err = mthca_array_init(&dev->srq_table.srq,
 725                                dev->limits.num_srqs);
 726         if (err)
 727                 mthca_alloc_cleanup(&dev->srq_table.alloc);
 728
 729         return err;
 730 }
 731
 732 void mthca_cleanup_srq_table(struct mthca_dev *dev)
 733 {
 734         if (!(dev->mthca_flags & MTHCA_FLAG_SRQ))
 735                 return;
 736
 737         mthca_array_cleanup(&dev->srq_table.srq, dev->limits.num_srqs);
 738         mthca_alloc_cleanup(&dev->srq_table.alloc);
 739 }