SAFE public projects git trees. - safe/jmp/linux-2.6/blob - drivers/infiniband/hw/ipath/ipath_qp.c

   1 /*
   2  * Copyright (c) 2006, 2007, 2008 QLogic Corporation. 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 #include "ipath_kernel.h"
  39
  40 #define BITS_PER_PAGE           (PAGE_SIZE*BITS_PER_BYTE)
  41 #define BITS_PER_PAGE_MASK      (BITS_PER_PAGE-1)
  42 #define mk_qpn(qpt, map, off)   (((map) - (qpt)->map) * BITS_PER_PAGE + \
  43                                  (off))
  44 #define find_next_offset(map, off) find_next_zero_bit((map)->page, \
  45                                                       BITS_PER_PAGE, off)
  46
  47 /*
  48  * Convert the AETH credit code into the number of credits.
  49  */
  50 static u32 credit_table[31] = {
  51         0,                      /* 0 */
  52         1,                      /* 1 */
  53         2,                      /* 2 */
  54         3,                      /* 3 */
  55         4,                      /* 4 */
  56         6,                      /* 5 */
  57         8,                      /* 6 */
  58         12,                     /* 7 */
  59         16,                     /* 8 */
  60         24,                     /* 9 */
  61         32,                     /* A */
  62         48,                     /* B */
  63         64,                     /* C */
  64         96,                     /* D */
  65         128,                    /* E */
  66         192,                    /* F */
  67         256,                    /* 10 */
  68         384,                    /* 11 */
  69         512,                    /* 12 */
  70         768,                    /* 13 */
  71         1024,                   /* 14 */
  72         1536,                   /* 15 */
  73         2048,                   /* 16 */
  74         3072,                   /* 17 */
  75         4096,                   /* 18 */
  76         6144,                   /* 19 */
  77         8192,                   /* 1A */
  78         12288,                  /* 1B */
  79         16384,                  /* 1C */
  80         24576,                  /* 1D */
  81         32768                   /* 1E */
  82 };
  83
  84
  85 static void get_map_page(struct ipath_qp_table *qpt, struct qpn_map *map)
  86 {
  87         unsigned long page = get_zeroed_page(GFP_KERNEL);
  88         unsigned long flags;
  89
  90         /*
  91          * Free the page if someone raced with us installing it.
  92          */
  93
  94         spin_lock_irqsave(&qpt->lock, flags);
  95         if (map->page)
  96                 free_page(page);
  97         else
  98                 map->page = (void *)page;
  99         spin_unlock_irqrestore(&qpt->lock, flags);
 100 }
 101
 102
 103 static int alloc_qpn(struct ipath_qp_table *qpt, enum ib_qp_type type)
 104 {
 105         u32 i, offset, max_scan, qpn;
 106         struct qpn_map *map;
 107         u32 ret = -1;
 108
 109         if (type == IB_QPT_SMI)
 110                 ret = 0;
 111         else if (type == IB_QPT_GSI)
 112                 ret = 1;
 113
 114         if (ret != -1) {
 115                 map = &qpt->map[0];
 116                 if (unlikely(!map->page)) {
 117                         get_map_page(qpt, map);
 118                         if (unlikely(!map->page)) {
 119                                 ret = -ENOMEM;
 120                                 goto bail;
 121                         }
 122                 }
 123                 if (!test_and_set_bit(ret, map->page))
 124                         atomic_dec(&map->n_free);
 125                 else
 126                         ret = -EBUSY;
 127                 goto bail;
 128         }
 129
 130         qpn = qpt->last + 1;
 131         if (qpn >= QPN_MAX)
 132                 qpn = 2;
 133         offset = qpn & BITS_PER_PAGE_MASK;
 134         map = &qpt->map[qpn / BITS_PER_PAGE];
 135         max_scan = qpt->nmaps - !offset;
 136         for (i = 0;;) {
 137                 if (unlikely(!map->page)) {
 138                         get_map_page(qpt, map);
 139                         if (unlikely(!map->page))
 140                                 break;
 141                 }
 142                 if (likely(atomic_read(&map->n_free))) {
 143                         do {
 144                                 if (!test_and_set_bit(offset, map->page)) {
 145                                         atomic_dec(&map->n_free);
 146                                         qpt->last = qpn;
 147                                         ret = qpn;
 148                                         goto bail;
 149                                 }
 150                                 offset = find_next_offset(map, offset);
 151                                 qpn = mk_qpn(qpt, map, offset);
 152                                 /*
 153                                  * This test differs from alloc_pidmap().
 154                                  * If find_next_offset() does find a zero
 155                                  * bit, we don't need to check for QPN
 156                                  * wrapping around past our starting QPN.
 157                                  * We just need to be sure we don't loop
 158                                  * forever.
 159                                  */
 160                         } while (offset < BITS_PER_PAGE && qpn < QPN_MAX);
 161                 }
 162                 /*
 163                  * In order to keep the number of pages allocated to a
 164                  * minimum, we scan the all existing pages before increasing
 165                  * the size of the bitmap table.
 166                  */
 167                 if (++i > max_scan) {
 168                         if (qpt->nmaps == QPNMAP_ENTRIES)
 169                                 break;
 170                         map = &qpt->map[qpt->nmaps++];
 171                         offset = 0;
 172                 } else if (map < &qpt->map[qpt->nmaps]) {
 173                         ++map;
 174                         offset = 0;
 175                 } else {
 176                         map = &qpt->map[0];
 177                         offset = 2;
 178                 }
 179                 qpn = mk_qpn(qpt, map, offset);
 180         }
 181
 182         ret = -ENOMEM;
 183
 184 bail:
 185         return ret;
 186 }
 187
 188 static void free_qpn(struct ipath_qp_table *qpt, u32 qpn)
 189 {
 190         struct qpn_map *map;
 191
 192         map = qpt->map + qpn / BITS_PER_PAGE;
 193         if (map->page)
 194                 clear_bit(qpn & BITS_PER_PAGE_MASK, map->page);
 195         atomic_inc(&map->n_free);
 196 }
 197
 198 /**
 199  * ipath_alloc_qpn - allocate a QP number
 200  * @qpt: the QP table
 201  * @qp: the QP
 202  * @type: the QP type (IB_QPT_SMI and IB_QPT_GSI are special)
 203  *
 204  * Allocate the next available QPN and put the QP into the hash table.
 205  * The hash table holds a reference to the QP.
 206  */
 207 static int ipath_alloc_qpn(struct ipath_qp_table *qpt, struct ipath_qp *qp,
 208                            enum ib_qp_type type)
 209 {
 210         unsigned long flags;
 211         int ret;
 212
 213         ret = alloc_qpn(qpt, type);
 214         if (ret < 0)
 215                 goto bail;
 216         qp->ibqp.qp_num = ret;
 217
 218         /* Add the QP to the hash table. */
 219         spin_lock_irqsave(&qpt->lock, flags);
 220
 221         ret %= qpt->max;
 222         qp->next = qpt->table[ret];
 223         qpt->table[ret] = qp;
 224         atomic_inc(&qp->refcount);
 225
 226         spin_unlock_irqrestore(&qpt->lock, flags);
 227         ret = 0;
 228
 229 bail:
 230         return ret;
 231 }
 232
 233 /**
 234  * ipath_free_qp - remove a QP from the QP table
 235  * @qpt: the QP table
 236  * @qp: the QP to remove
 237  *
 238  * Remove the QP from the table so it can't be found asynchronously by
 239  * the receive interrupt routine.
 240  */
 241 static void ipath_free_qp(struct ipath_qp_table *qpt, struct ipath_qp *qp)
 242 {
 243         struct ipath_qp *q, **qpp;
 244         unsigned long flags;
 245         int fnd = 0;
 246
 247         spin_lock_irqsave(&qpt->lock, flags);
 248
 249         /* Remove QP from the hash table. */
 250         qpp = &qpt->table[qp->ibqp.qp_num % qpt->max];
 251         for (; (q = *qpp) != NULL; qpp = &q->next) {
 252                 if (q == qp) {
 253                         *qpp = qp->next;
 254                         qp->next = NULL;
 255                         atomic_dec(&qp->refcount);
 256                         fnd = 1;
 257                         break;
 258                 }
 259         }
 260
 261         spin_unlock_irqrestore(&qpt->lock, flags);
 262
 263         if (!fnd)
 264                 return;
 265
 266         free_qpn(qpt, qp->ibqp.qp_num);
 267
 268         wait_event(qp->wait, !atomic_read(&qp->refcount));
 269 }
 270
 271 /**
 272  * ipath_free_all_qps - remove all QPs from the table
 273  * @qpt: the QP table to empty
 274  */
 275 void ipath_free_all_qps(struct ipath_qp_table *qpt)
 276 {
 277         unsigned long flags;
 278         struct ipath_qp *qp, *nqp;
 279         u32 n;
 280
 281         for (n = 0; n < qpt->max; n++) {
 282                 spin_lock_irqsave(&qpt->lock, flags);
 283                 qp = qpt->table[n];
 284                 qpt->table[n] = NULL;
 285                 spin_unlock_irqrestore(&qpt->lock, flags);
 286
 287                 while (qp) {
 288                         nqp = qp->next;
 289                         free_qpn(qpt, qp->ibqp.qp_num);
 290                         if (!atomic_dec_and_test(&qp->refcount) ||
 291                             !ipath_destroy_qp(&qp->ibqp))
 292                                 ipath_dbg("QP memory leak!\n");
 293                         qp = nqp;
 294                 }
 295         }
 296
 297         for (n = 0; n < ARRAY_SIZE(qpt->map); n++) {
 298                 if (qpt->map[n].page)
 299                         free_page((unsigned long)qpt->map[n].page);
 300         }
 301 }
 302
 303 /**
 304  * ipath_lookup_qpn - return the QP with the given QPN
 305  * @qpt: the QP table
 306  * @qpn: the QP number to look up
 307  *
 308  * The caller is responsible for decrementing the QP reference count
 309  * when done.
 310  */
 311 struct ipath_qp *ipath_lookup_qpn(struct ipath_qp_table *qpt, u32 qpn)
 312 {
 313         unsigned long flags;
 314         struct ipath_qp *qp;
 315
 316         spin_lock_irqsave(&qpt->lock, flags);
 317
 318         for (qp = qpt->table[qpn % qpt->max]; qp; qp = qp->next) {
 319                 if (qp->ibqp.qp_num == qpn) {
 320                         atomic_inc(&qp->refcount);
 321                         break;
 322                 }
 323         }
 324
 325         spin_unlock_irqrestore(&qpt->lock, flags);
 326         return qp;
 327 }
 328
 329 /**
 330  * ipath_reset_qp - initialize the QP state to the reset state
 331  * @qp: the QP to reset
 332  * @type: the QP type
 333  */
 334 static void ipath_reset_qp(struct ipath_qp *qp, enum ib_qp_type type)
 335 {
 336         qp->remote_qpn = 0;
 337         qp->qkey = 0;
 338         qp->qp_access_flags = 0;
 339         qp->s_busy = 0;
 340         qp->s_flags &= IPATH_S_SIGNAL_REQ_WR;
 341         qp->s_hdrwords = 0;
 342         qp->s_wqe = NULL;
 343         qp->s_pkt_delay = 0;
 344         qp->s_psn = 0;
 345         qp->r_psn = 0;
 346         qp->r_msn = 0;
 347         if (type == IB_QPT_RC) {
 348                 qp->s_state = IB_OPCODE_RC_SEND_LAST;
 349                 qp->r_state = IB_OPCODE_RC_SEND_LAST;
 350         } else {
 351                 qp->s_state = IB_OPCODE_UC_SEND_LAST;
 352                 qp->r_state = IB_OPCODE_UC_SEND_LAST;
 353         }
 354         qp->s_ack_state = IB_OPCODE_RC_ACKNOWLEDGE;
 355         qp->r_nak_state = 0;
 356         qp->r_wrid_valid = 0;
 357         qp->s_rnr_timeout = 0;
 358         qp->s_head = 0;
 359         qp->s_tail = 0;
 360         qp->s_cur = 0;
 361         qp->s_last = 0;
 362         qp->s_ssn = 1;
 363         qp->s_lsn = 0;
 364         qp->s_wait_credit = 0;
 365         memset(qp->s_ack_queue, 0, sizeof(qp->s_ack_queue));
 366         qp->r_head_ack_queue = 0;
 367         qp->s_tail_ack_queue = 0;
 368         qp->s_num_rd_atomic = 0;
 369         if (qp->r_rq.wq) {
 370                 qp->r_rq.wq->head = 0;
 371                 qp->r_rq.wq->tail = 0;
 372         }
 373         qp->r_reuse_sge = 0;
 374 }
 375
 376 /**
 377  * ipath_error_qp - put a QP into an error state
 378  * @qp: the QP to put into an error state
 379  * @err: the receive completion error to signal if a RWQE is active
 380  *
 381  * Flushes both send and receive work queues.
 382  * Returns true if last WQE event should be generated.
 383  * The QP s_lock should be held and interrupts disabled.
 384  */
 385
 386 int ipath_error_qp(struct ipath_qp *qp, enum ib_wc_status err)
 387 {
 388         struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
 389         struct ib_wc wc;
 390         int ret = 0;
 391
 392         ipath_dbg("QP%d/%d in error state (%d)\n",
 393                   qp->ibqp.qp_num, qp->remote_qpn, err);
 394
 395         spin_lock(&dev->pending_lock);
 396         if (!list_empty(&qp->timerwait))
 397                 list_del_init(&qp->timerwait);
 398         if (!list_empty(&qp->piowait))
 399                 list_del_init(&qp->piowait);
 400         spin_unlock(&dev->pending_lock);
 401
 402         wc.vendor_err = 0;
 403         wc.byte_len = 0;
 404         wc.imm_data = 0;
 405         wc.qp = &qp->ibqp;
 406         wc.src_qp = 0;
 407         wc.wc_flags = 0;
 408         wc.pkey_index = 0;
 409         wc.slid = 0;
 410         wc.sl = 0;
 411         wc.dlid_path_bits = 0;
 412         wc.port_num = 0;
 413         if (qp->r_wrid_valid) {
 414                 qp->r_wrid_valid = 0;
 415                 wc.wr_id = qp->r_wr_id;
 416                 wc.opcode = IB_WC_RECV;
 417                 wc.status = err;
 418                 ipath_cq_enter(to_icq(qp->ibqp.recv_cq), &wc, 1);
 419         }
 420         wc.status = IB_WC_WR_FLUSH_ERR;
 421
 422         while (qp->s_last != qp->s_head) {
 423                 struct ipath_swqe *wqe = get_swqe_ptr(qp, qp->s_last);
 424
 425                 wc.wr_id = wqe->wr.wr_id;
 426                 wc.opcode = ib_ipath_wc_opcode[wqe->wr.opcode];
 427                 if (++qp->s_last >= qp->s_size)
 428                         qp->s_last = 0;
 429                 ipath_cq_enter(to_icq(qp->ibqp.send_cq), &wc, 1);
 430         }
 431         qp->s_cur = qp->s_tail = qp->s_head;
 432         qp->s_hdrwords = 0;
 433         qp->s_ack_state = IB_OPCODE_RC_ACKNOWLEDGE;
 434
 435         if (qp->r_rq.wq) {
 436                 struct ipath_rwq *wq;
 437                 u32 head;
 438                 u32 tail;
 439
 440                 spin_lock(&qp->r_rq.lock);
 441
 442                 /* sanity check pointers before trusting them */
 443                 wq = qp->r_rq.wq;
 444                 head = wq->head;
 445                 if (head >= qp->r_rq.size)
 446                         head = 0;
 447                 tail = wq->tail;
 448                 if (tail >= qp->r_rq.size)
 449                         tail = 0;
 450                 wc.opcode = IB_WC_RECV;
 451                 while (tail != head) {
 452                         wc.wr_id = get_rwqe_ptr(&qp->r_rq, tail)->wr_id;
 453                         if (++tail >= qp->r_rq.size)
 454                                 tail = 0;
 455                         ipath_cq_enter(to_icq(qp->ibqp.recv_cq), &wc, 1);
 456                 }
 457                 wq->tail = tail;
 458
 459                 spin_unlock(&qp->r_rq.lock);
 460         } else if (qp->ibqp.event_handler)
 461                 ret = 1;
 462
 463         return ret;
 464 }
 465
 466 /**
 467  * ipath_modify_qp - modify the attributes of a queue pair
 468  * @ibqp: the queue pair who's attributes we're modifying
 469  * @attr: the new attributes
 470  * @attr_mask: the mask of attributes to modify
 471  * @udata: user data for ipathverbs.so
 472  *
 473  * Returns 0 on success, otherwise returns an errno.
 474  */
 475 int ipath_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
 476                     int attr_mask, struct ib_udata *udata)
 477 {
 478         struct ipath_ibdev *dev = to_idev(ibqp->device);
 479         struct ipath_qp *qp = to_iqp(ibqp);
 480         enum ib_qp_state cur_state, new_state;
 481         unsigned long flags;
 482         int lastwqe = 0;
 483         int ret;
 484
 485         spin_lock_irqsave(&qp->s_lock, flags);
 486
 487         cur_state = attr_mask & IB_QP_CUR_STATE ?
 488                 attr->cur_qp_state : qp->state;
 489         new_state = attr_mask & IB_QP_STATE ? attr->qp_state : cur_state;
 490
 491         if (!ib_modify_qp_is_ok(cur_state, new_state, ibqp->qp_type,
 492                                 attr_mask))
 493                 goto inval;
 494
 495         if (attr_mask & IB_QP_AV) {
 496                 if (attr->ah_attr.dlid == 0 ||
 497                     attr->ah_attr.dlid >= IPATH_MULTICAST_LID_BASE)
 498                         goto inval;
 499
 500                 if ((attr->ah_attr.ah_flags & IB_AH_GRH) &&
 501                     (attr->ah_attr.grh.sgid_index > 1))
 502                         goto inval;
 503         }
 504
 505         if (attr_mask & IB_QP_PKEY_INDEX)
 506                 if (attr->pkey_index >= ipath_get_npkeys(dev->dd))
 507                         goto inval;
 508
 509         if (attr_mask & IB_QP_MIN_RNR_TIMER)
 510                 if (attr->min_rnr_timer > 31)
 511                         goto inval;
 512
 513         if (attr_mask & IB_QP_PORT)
 514                 if (attr->port_num == 0 ||
 515                     attr->port_num > ibqp->device->phys_port_cnt)
 516                         goto inval;
 517
 518         /*
 519          * don't allow invalid Path MTU values or greater than 2048
 520          * unless we are configured for a 4KB MTU
 521          */
 522         if ((attr_mask & IB_QP_PATH_MTU) &&
 523                 (ib_mtu_enum_to_int(attr->path_mtu) == -1 ||
 524                 (attr->path_mtu > IB_MTU_2048 && !ipath_mtu4096)))
 525                 goto inval;
 526
 527         if (attr_mask & IB_QP_PATH_MIG_STATE)
 528                 if (attr->path_mig_state != IB_MIG_MIGRATED &&
 529                     attr->path_mig_state != IB_MIG_REARM)
 530                         goto inval;
 531
 532         if (attr_mask & IB_QP_MAX_DEST_RD_ATOMIC)
 533                 if (attr->max_dest_rd_atomic > IPATH_MAX_RDMA_ATOMIC)
 534                         goto inval;
 535
 536         switch (new_state) {
 537         case IB_QPS_RESET:
 538                 ipath_reset_qp(qp, ibqp->qp_type);
 539                 break;
 540
 541         case IB_QPS_ERR:
 542                 lastwqe = ipath_error_qp(qp, IB_WC_WR_FLUSH_ERR);
 543                 break;
 544
 545         default:
 546                 break;
 547
 548         }
 549
 550         if (attr_mask & IB_QP_PKEY_INDEX)
 551                 qp->s_pkey_index = attr->pkey_index;
 552
 553         if (attr_mask & IB_QP_DEST_QPN)
 554                 qp->remote_qpn = attr->dest_qp_num;
 555
 556         if (attr_mask & IB_QP_SQ_PSN) {
 557                 qp->s_psn = qp->s_next_psn = attr->sq_psn;
 558                 qp->s_last_psn = qp->s_next_psn - 1;
 559         }
 560
 561         if (attr_mask & IB_QP_RQ_PSN)
 562                 qp->r_psn = attr->rq_psn;
 563
 564         if (attr_mask & IB_QP_ACCESS_FLAGS)
 565                 qp->qp_access_flags = attr->qp_access_flags;
 566
 567         if (attr_mask & IB_QP_AV) {
 568                 qp->remote_ah_attr = attr->ah_attr;
 569                 qp->s_dmult = ipath_ib_rate_to_mult(attr->ah_attr.static_rate);
 570         }
 571
 572         if (attr_mask & IB_QP_PATH_MTU)
 573                 qp->path_mtu = attr->path_mtu;
 574
 575         if (attr_mask & IB_QP_RETRY_CNT)
 576                 qp->s_retry = qp->s_retry_cnt = attr->retry_cnt;
 577
 578         if (attr_mask & IB_QP_RNR_RETRY) {
 579                 qp->s_rnr_retry = attr->rnr_retry;
 580                 if (qp->s_rnr_retry > 7)
 581                         qp->s_rnr_retry = 7;
 582                 qp->s_rnr_retry_cnt = qp->s_rnr_retry;
 583         }
 584
 585         if (attr_mask & IB_QP_MIN_RNR_TIMER)
 586                 qp->r_min_rnr_timer = attr->min_rnr_timer;
 587
 588         if (attr_mask & IB_QP_TIMEOUT)
 589                 qp->timeout = attr->timeout;
 590
 591         if (attr_mask & IB_QP_QKEY)
 592                 qp->qkey = attr->qkey;
 593
 594         if (attr_mask & IB_QP_MAX_DEST_RD_ATOMIC)
 595                 qp->r_max_rd_atomic = attr->max_dest_rd_atomic;
 596
 597         if (attr_mask & IB_QP_MAX_QP_RD_ATOMIC)
 598                 qp->s_max_rd_atomic = attr->max_rd_atomic;
 599
 600         qp->state = new_state;
 601         spin_unlock_irqrestore(&qp->s_lock, flags);
 602
 603         if (lastwqe) {
 604                 struct ib_event ev;
 605
 606                 ev.device = qp->ibqp.device;
 607                 ev.element.qp = &qp->ibqp;
 608                 ev.event = IB_EVENT_QP_LAST_WQE_REACHED;
 609                 qp->ibqp.event_handler(&ev, qp->ibqp.qp_context);
 610         }
 611         ret = 0;
 612         goto bail;
 613
 614 inval:
 615         spin_unlock_irqrestore(&qp->s_lock, flags);
 616         ret = -EINVAL;
 617
 618 bail:
 619         return ret;
 620 }
 621
 622 int ipath_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
 623                    int attr_mask, struct ib_qp_init_attr *init_attr)
 624 {
 625         struct ipath_qp *qp = to_iqp(ibqp);
 626
 627         attr->qp_state = qp->state;
 628         attr->cur_qp_state = attr->qp_state;
 629         attr->path_mtu = qp->path_mtu;
 630         attr->path_mig_state = 0;
 631         attr->qkey = qp->qkey;
 632         attr->rq_psn = qp->r_psn;
 633         attr->sq_psn = qp->s_next_psn;
 634         attr->dest_qp_num = qp->remote_qpn;
 635         attr->qp_access_flags = qp->qp_access_flags;
 636         attr->cap.max_send_wr = qp->s_size - 1;
 637         attr->cap.max_recv_wr = qp->ibqp.srq ? 0 : qp->r_rq.size - 1;
 638         attr->cap.max_send_sge = qp->s_max_sge;
 639         attr->cap.max_recv_sge = qp->r_rq.max_sge;
 640         attr->cap.max_inline_data = 0;
 641         attr->ah_attr = qp->remote_ah_attr;
 642         memset(&attr->alt_ah_attr, 0, sizeof(attr->alt_ah_attr));
 643         attr->pkey_index = qp->s_pkey_index;
 644         attr->alt_pkey_index = 0;
 645         attr->en_sqd_async_notify = 0;
 646         attr->sq_draining = 0;
 647         attr->max_rd_atomic = qp->s_max_rd_atomic;
 648         attr->max_dest_rd_atomic = qp->r_max_rd_atomic;
 649         attr->min_rnr_timer = qp->r_min_rnr_timer;
 650         attr->port_num = 1;
 651         attr->timeout = qp->timeout;
 652         attr->retry_cnt = qp->s_retry_cnt;
 653         attr->rnr_retry = qp->s_rnr_retry_cnt;
 654         attr->alt_port_num = 0;
 655         attr->alt_timeout = 0;
 656
 657         init_attr->event_handler = qp->ibqp.event_handler;
 658         init_attr->qp_context = qp->ibqp.qp_context;
 659         init_attr->send_cq = qp->ibqp.send_cq;
 660         init_attr->recv_cq = qp->ibqp.recv_cq;
 661         init_attr->srq = qp->ibqp.srq;
 662         init_attr->cap = attr->cap;
 663         if (qp->s_flags & IPATH_S_SIGNAL_REQ_WR)
 664                 init_attr->sq_sig_type = IB_SIGNAL_REQ_WR;
 665         else
 666                 init_attr->sq_sig_type = IB_SIGNAL_ALL_WR;
 667         init_attr->qp_type = qp->ibqp.qp_type;
 668         init_attr->port_num = 1;
 669         return 0;
 670 }
 671
 672 /**
 673  * ipath_compute_aeth - compute the AETH (syndrome + MSN)
 674  * @qp: the queue pair to compute the AETH for
 675  *
 676  * Returns the AETH.
 677  */
 678 __be32 ipath_compute_aeth(struct ipath_qp *qp)
 679 {
 680         u32 aeth = qp->r_msn & IPATH_MSN_MASK;
 681
 682         if (qp->ibqp.srq) {
 683                 /*
 684                  * Shared receive queues don't generate credits.
 685                  * Set the credit field to the invalid value.
 686                  */
 687                 aeth |= IPATH_AETH_CREDIT_INVAL << IPATH_AETH_CREDIT_SHIFT;
 688         } else {
 689                 u32 min, max, x;
 690                 u32 credits;
 691                 struct ipath_rwq *wq = qp->r_rq.wq;
 692                 u32 head;
 693                 u32 tail;
 694
 695                 /* sanity check pointers before trusting them */
 696                 head = wq->head;
 697                 if (head >= qp->r_rq.size)
 698                         head = 0;
 699                 tail = wq->tail;
 700                 if (tail >= qp->r_rq.size)
 701                         tail = 0;
 702                 /*
 703                  * Compute the number of credits available (RWQEs).
 704                  * XXX Not holding the r_rq.lock here so there is a small
 705                  * chance that the pair of reads are not atomic.
 706                  */
 707                 credits = head - tail;
 708                 if ((int)credits < 0)
 709                         credits += qp->r_rq.size;
 710                 /*
 711                  * Binary search the credit table to find the code to
 712                  * use.
 713                  */
 714                 min = 0;
 715                 max = 31;
 716                 for (;;) {
 717                         x = (min + max) / 2;
 718                         if (credit_table[x] == credits)
 719                                 break;
 720                         if (credit_table[x] > credits)
 721                                 max = x;
 722                         else if (min == x)
 723                                 break;
 724                         else
 725                                 min = x;
 726                 }
 727                 aeth |= x << IPATH_AETH_CREDIT_SHIFT;
 728         }
 729         return cpu_to_be32(aeth);
 730 }
 731
 732 /**
 733  * ipath_create_qp - create a queue pair for a device
 734  * @ibpd: the protection domain who's device we create the queue pair for
 735  * @init_attr: the attributes of the queue pair
 736  * @udata: unused by InfiniPath
 737  *
 738  * Returns the queue pair on success, otherwise returns an errno.
 739  *
 740  * Called by the ib_create_qp() core verbs function.
 741  */
 742 struct ib_qp *ipath_create_qp(struct ib_pd *ibpd,
 743                               struct ib_qp_init_attr *init_attr,
 744                               struct ib_udata *udata)
 745 {
 746         struct ipath_qp *qp;
 747         int err;
 748         struct ipath_swqe *swq = NULL;
 749         struct ipath_ibdev *dev;
 750         size_t sz;
 751         struct ib_qp *ret;
 752
 753         if (init_attr->create_flags) {
 754                 ret = ERR_PTR(-EINVAL);
 755                 goto bail;
 756         }
 757
 758         if (init_attr->cap.max_send_sge > ib_ipath_max_sges ||
 759             init_attr->cap.max_send_wr > ib_ipath_max_qp_wrs) {
 760                 ret = ERR_PTR(-EINVAL);
 761                 goto bail;
 762         }
 763
 764         /* Check receive queue parameters if no SRQ is specified. */
 765         if (!init_attr->srq) {
 766                 if (init_attr->cap.max_recv_sge > ib_ipath_max_sges ||
 767                     init_attr->cap.max_recv_wr > ib_ipath_max_qp_wrs) {
 768                         ret = ERR_PTR(-EINVAL);
 769                         goto bail;
 770                 }
 771                 if (init_attr->cap.max_send_sge +
 772                     init_attr->cap.max_send_wr +
 773                     init_attr->cap.max_recv_sge +
 774                     init_attr->cap.max_recv_wr == 0) {
 775                         ret = ERR_PTR(-EINVAL);
 776                         goto bail;
 777                 }
 778         }
 779
 780         switch (init_attr->qp_type) {
 781         case IB_QPT_UC:
 782         case IB_QPT_RC:
 783         case IB_QPT_UD:
 784         case IB_QPT_SMI:
 785         case IB_QPT_GSI:
 786                 sz = sizeof(struct ipath_sge) *
 787                         init_attr->cap.max_send_sge +
 788                         sizeof(struct ipath_swqe);
 789                 swq = vmalloc((init_attr->cap.max_send_wr + 1) * sz);
 790                 if (swq == NULL) {
 791                         ret = ERR_PTR(-ENOMEM);
 792                         goto bail;
 793                 }
 794                 sz = sizeof(*qp);
 795                 if (init_attr->srq) {
 796                         struct ipath_srq *srq = to_isrq(init_attr->srq);
 797
 798                         sz += sizeof(*qp->r_sg_list) *
 799                                 srq->rq.max_sge;
 800                 } else
 801                         sz += sizeof(*qp->r_sg_list) *
 802                                 init_attr->cap.max_recv_sge;
 803                 qp = kmalloc(sz, GFP_KERNEL);
 804                 if (!qp) {
 805                         ret = ERR_PTR(-ENOMEM);
 806                         goto bail_swq;
 807                 }
 808                 if (init_attr->srq) {
 809                         sz = 0;
 810                         qp->r_rq.size = 0;
 811                         qp->r_rq.max_sge = 0;
 812                         qp->r_rq.wq = NULL;
 813                         init_attr->cap.max_recv_wr = 0;
 814                         init_attr->cap.max_recv_sge = 0;
 815                 } else {
 816                         qp->r_rq.size = init_attr->cap.max_recv_wr + 1;
 817                         qp->r_rq.max_sge = init_attr->cap.max_recv_sge;
 818                         sz = (sizeof(struct ib_sge) * qp->r_rq.max_sge) +
 819                                 sizeof(struct ipath_rwqe);
 820                         qp->r_rq.wq = vmalloc_user(sizeof(struct ipath_rwq) +
 821                                               qp->r_rq.size * sz);
 822                         if (!qp->r_rq.wq) {
 823                                 ret = ERR_PTR(-ENOMEM);
 824                                 goto bail_qp;
 825                         }
 826                 }
 827
 828                 /*
 829                  * ib_create_qp() will initialize qp->ibqp
 830                  * except for qp->ibqp.qp_num.
 831                  */
 832                 spin_lock_init(&qp->s_lock);
 833                 spin_lock_init(&qp->r_rq.lock);
 834                 atomic_set(&qp->refcount, 0);
 835                 init_waitqueue_head(&qp->wait);
 836                 tasklet_init(&qp->s_task, ipath_do_send, (unsigned long)qp);
 837                 INIT_LIST_HEAD(&qp->piowait);
 838                 INIT_LIST_HEAD(&qp->timerwait);
 839                 qp->state = IB_QPS_RESET;
 840                 qp->s_wq = swq;
 841                 qp->s_size = init_attr->cap.max_send_wr + 1;
 842                 qp->s_max_sge = init_attr->cap.max_send_sge;
 843                 if (init_attr->sq_sig_type == IB_SIGNAL_REQ_WR)
 844                         qp->s_flags = IPATH_S_SIGNAL_REQ_WR;
 845                 else
 846                         qp->s_flags = 0;
 847                 dev = to_idev(ibpd->device);
 848                 err = ipath_alloc_qpn(&dev->qp_table, qp,
 849                                       init_attr->qp_type);
 850                 if (err) {
 851                         ret = ERR_PTR(err);
 852                         vfree(qp->r_rq.wq);
 853                         goto bail_qp;
 854                 }
 855                 qp->ip = NULL;
 856                 qp->s_tx = NULL;
 857                 ipath_reset_qp(qp, init_attr->qp_type);
 858                 break;
 859
 860         default:
 861                 /* Don't support raw QPs */
 862                 ret = ERR_PTR(-ENOSYS);
 863                 goto bail;
 864         }
 865
 866         init_attr->cap.max_inline_data = 0;
 867
 868         /*
 869          * Return the address of the RWQ as the offset to mmap.
 870          * See ipath_mmap() for details.
 871          */
 872         if (udata && udata->outlen >= sizeof(__u64)) {
 873                 if (!qp->r_rq.wq) {
 874                         __u64 offset = 0;
 875
 876                         err = ib_copy_to_udata(udata, &offset,
 877                                                sizeof(offset));
 878                         if (err) {
 879                                 ret = ERR_PTR(err);
 880                                 goto bail_ip;
 881                         }
 882                 } else {
 883                         u32 s = sizeof(struct ipath_rwq) +
 884                                 qp->r_rq.size * sz;
 885
 886                         qp->ip =
 887                             ipath_create_mmap_info(dev, s,
 888                                                    ibpd->uobject->context,
 889                                                    qp->r_rq.wq);
 890                         if (!qp->ip) {
 891                                 ret = ERR_PTR(-ENOMEM);
 892                                 goto bail_ip;
 893                         }
 894
 895                         err = ib_copy_to_udata(udata, &(qp->ip->offset),
 896                                                sizeof(qp->ip->offset));
 897                         if (err) {
 898                                 ret = ERR_PTR(err);
 899                                 goto bail_ip;
 900                         }
 901                 }
 902         }
 903
 904         spin_lock(&dev->n_qps_lock);
 905         if (dev->n_qps_allocated == ib_ipath_max_qps) {
 906                 spin_unlock(&dev->n_qps_lock);
 907                 ret = ERR_PTR(-ENOMEM);
 908                 goto bail_ip;
 909         }
 910
 911         dev->n_qps_allocated++;
 912         spin_unlock(&dev->n_qps_lock);
 913
 914         if (qp->ip) {
 915                 spin_lock_irq(&dev->pending_lock);
 916                 list_add(&qp->ip->pending_mmaps, &dev->pending_mmaps);
 917                 spin_unlock_irq(&dev->pending_lock);
 918         }
 919
 920         ret = &qp->ibqp;
 921         goto bail;
 922
 923 bail_ip:
 924         if (qp->ip)
 925                 kref_put(&qp->ip->ref, ipath_release_mmap_info);
 926         else
 927                 vfree(qp->r_rq.wq);
 928         ipath_free_qp(&dev->qp_table, qp);
 929 bail_qp:
 930         kfree(qp);
 931 bail_swq:
 932         vfree(swq);
 933 bail:
 934         return ret;
 935 }
 936
 937 /**
 938  * ipath_destroy_qp - destroy a queue pair
 939  * @ibqp: the queue pair to destroy
 940  *
 941  * Returns 0 on success.
 942  *
 943  * Note that this can be called while the QP is actively sending or
 944  * receiving!
 945  */
 946 int ipath_destroy_qp(struct ib_qp *ibqp)
 947 {
 948         struct ipath_qp *qp = to_iqp(ibqp);
 949         struct ipath_ibdev *dev = to_idev(ibqp->device);
 950         unsigned long flags;
 951
 952         spin_lock_irqsave(&qp->s_lock, flags);
 953         qp->state = IB_QPS_ERR;
 954         spin_unlock_irqrestore(&qp->s_lock, flags);
 955         spin_lock(&dev->n_qps_lock);
 956         dev->n_qps_allocated--;
 957         spin_unlock(&dev->n_qps_lock);
 958
 959         /* Stop the sending tasklet. */
 960         tasklet_kill(&qp->s_task);
 961
 962         if (qp->s_tx) {
 963                 atomic_dec(&qp->refcount);
 964                 if (qp->s_tx->txreq.flags & IPATH_SDMA_TXREQ_F_FREEBUF)
 965                         kfree(qp->s_tx->txreq.map_addr);
 966         }
 967
 968         /* Make sure the QP isn't on the timeout list. */
 969         spin_lock_irqsave(&dev->pending_lock, flags);
 970         if (!list_empty(&qp->timerwait))
 971                 list_del_init(&qp->timerwait);
 972         if (!list_empty(&qp->piowait))
 973                 list_del_init(&qp->piowait);
 974         if (qp->s_tx)
 975                 list_add(&qp->s_tx->txreq.list, &dev->txreq_free);
 976         spin_unlock_irqrestore(&dev->pending_lock, flags);
 977
 978         /*
 979          * Make sure that the QP is not in the QPN table so receive
 980          * interrupts will discard packets for this QP.  XXX Also remove QP
 981          * from multicast table.
 982          */
 983         if (atomic_read(&qp->refcount) != 0)
 984                 ipath_free_qp(&dev->qp_table, qp);
 985
 986         if (qp->ip)
 987                 kref_put(&qp->ip->ref, ipath_release_mmap_info);
 988         else
 989                 vfree(qp->r_rq.wq);
 990         vfree(qp->s_wq);
 991         kfree(qp);
 992         return 0;
 993 }
 994
 995 /**
 996  * ipath_init_qp_table - initialize the QP table for a device
 997  * @idev: the device who's QP table we're initializing
 998  * @size: the size of the QP table
 999  *
1000  * Returns 0 on success, otherwise returns an errno.
1001  */
1002 int ipath_init_qp_table(struct ipath_ibdev *idev, int size)
1003 {
1004         int i;
1005         int ret;
1006
1007         idev->qp_table.last = 1;        /* QPN 0 and 1 are special. */
1008         idev->qp_table.max = size;
1009         idev->qp_table.nmaps = 1;
1010         idev->qp_table.table = kzalloc(size * sizeof(*idev->qp_table.table),
1011                                        GFP_KERNEL);
1012         if (idev->qp_table.table == NULL) {
1013                 ret = -ENOMEM;
1014                 goto bail;
1015         }
1016
1017         for (i = 0; i < ARRAY_SIZE(idev->qp_table.map); i++) {
1018                 atomic_set(&idev->qp_table.map[i].n_free, BITS_PER_PAGE);
1019                 idev->qp_table.map[i].page = NULL;
1020         }
1021
1022         ret = 0;
1023
1024 bail:
1025         return ret;
1026 }
1027
1028 /**
1029  * ipath_sqerror_qp - put a QP's send queue into an error state
1030  * @qp: QP who's send queue will be put into an error state
1031  * @wc: the WC responsible for putting the QP in this state
1032  *
1033  * Flushes the send work queue.
1034  * The QP s_lock should be held and interrupts disabled.
1035  */
1036
1037 void ipath_sqerror_qp(struct ipath_qp *qp, struct ib_wc *wc)
1038 {
1039         struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
1040         struct ipath_swqe *wqe = get_swqe_ptr(qp, qp->s_last);
1041
1042         ipath_dbg("Send queue error on QP%d/%d: err: %d\n",
1043                   qp->ibqp.qp_num, qp->remote_qpn, wc->status);
1044
1045         spin_lock(&dev->pending_lock);
1046         if (!list_empty(&qp->timerwait))
1047                 list_del_init(&qp->timerwait);
1048         if (!list_empty(&qp->piowait))
1049                 list_del_init(&qp->piowait);
1050         spin_unlock(&dev->pending_lock);
1051
1052         ipath_cq_enter(to_icq(qp->ibqp.send_cq), wc, 1);
1053         if (++qp->s_last >= qp->s_size)
1054                 qp->s_last = 0;
1055
1056         wc->status = IB_WC_WR_FLUSH_ERR;
1057
1058         while (qp->s_last != qp->s_head) {
1059                 wqe = get_swqe_ptr(qp, qp->s_last);
1060                 wc->wr_id = wqe->wr.wr_id;
1061                 wc->opcode = ib_ipath_wc_opcode[wqe->wr.opcode];
1062                 ipath_cq_enter(to_icq(qp->ibqp.send_cq), wc, 1);
1063                 if (++qp->s_last >= qp->s_size)
1064                         qp->s_last = 0;
1065         }
1066         qp->s_cur = qp->s_tail = qp->s_head;
1067         qp->state = IB_QPS_SQE;
1068 }
1069
1070 /**
1071  * ipath_get_credit - flush the send work queue of a QP
1072  * @qp: the qp who's send work queue to flush
1073  * @aeth: the Acknowledge Extended Transport Header
1074  *
1075  * The QP s_lock should be held.
1076  */
1077 void ipath_get_credit(struct ipath_qp *qp, u32 aeth)
1078 {
1079         u32 credit = (aeth >> IPATH_AETH_CREDIT_SHIFT) & IPATH_AETH_CREDIT_MASK;
1080
1081         /*
1082          * If the credit is invalid, we can send
1083          * as many packets as we like.  Otherwise, we have to
1084          * honor the credit field.
1085          */
1086         if (credit == IPATH_AETH_CREDIT_INVAL)
1087                 qp->s_lsn = (u32) -1;
1088         else if (qp->s_lsn != (u32) -1) {
1089                 /* Compute new LSN (i.e., MSN + credit) */
1090                 credit = (aeth + credit_table[credit]) & IPATH_MSN_MASK;
1091                 if (ipath_cmp24(credit, qp->s_lsn) > 0)
1092                         qp->s_lsn = credit;
1093         }
1094
1095         /* Restart sending if it was blocked due to lack of credits. */
1096         if (qp->s_cur != qp->s_head &&
1097             (qp->s_lsn == (u32) -1 ||
1098              ipath_cmp24(get_swqe_ptr(qp, qp->s_cur)->ssn,
1099                          qp->s_lsn + 1) <= 0))
1100                 tasklet_hi_schedule(&qp->s_task);
1101 }