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