drivers/infiniband/hw/ipath/ipath_keys.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 <asm/io.h>
  35
  36 #include "ipath_verbs.h"
  37 #include "ipath_kernel.h"
  38
  39 /**
  40  * ipath_alloc_lkey - allocate an lkey
  41  * @rkt: lkey table in which to allocate the lkey
  42  * @mr: memory region that this lkey protects
  43  *
  44  * Returns 1 if successful, otherwise returns 0.
  45  */
  46
  47 int ipath_alloc_lkey(struct ipath_lkey_table *rkt, struct ipath_mregion *mr)
  48 {
  49         unsigned long flags;
  50         u32 r;
  51         u32 n;
  52         int ret;
  53
  54         spin_lock_irqsave(&rkt->lock, flags);
  55
  56         /* Find the next available LKEY */
  57         r = n = rkt->next;
  58         for (;;) {
  59                 if (rkt->table[r] == NULL)
  60                         break;
  61                 r = (r + 1) & (rkt->max - 1);
  62                 if (r == n) {
  63                         spin_unlock_irqrestore(&rkt->lock, flags);
  64                         ipath_dbg("LKEY table full\n");
  65                         ret = 0;
  66                         goto bail;
  67                 }
  68         }
  69         rkt->next = (r + 1) & (rkt->max - 1);
  70         /*
  71          * Make sure lkey is never zero which is reserved to indicate an
  72          * unrestricted LKEY.
  73          */
  74         rkt->gen++;
  75         mr->lkey = (r << (32 - ib_ipath_lkey_table_size)) |
  76                 ((((1 << (24 - ib_ipath_lkey_table_size)) - 1) & rkt->gen)
  77                  << 8);
  78         if (mr->lkey == 0) {
  79                 mr->lkey |= 1 << 8;
  80                 rkt->gen++;
  81         }
  82         rkt->table[r] = mr;
  83         spin_unlock_irqrestore(&rkt->lock, flags);
  84
  85         ret = 1;
  86
  87 bail:
  88         return ret;
  89 }
  90
  91 /**
  92  * ipath_free_lkey - free an lkey
  93  * @rkt: table from which to free the lkey
  94  * @lkey: lkey id to free
  95  */
  96 void ipath_free_lkey(struct ipath_lkey_table *rkt, u32 lkey)
  97 {
  98         unsigned long flags;
  99         u32 r;
 100
 101         if (lkey == 0)
 102                 return;
 103         r = lkey >> (32 - ib_ipath_lkey_table_size);
 104         spin_lock_irqsave(&rkt->lock, flags);
 105         rkt->table[r] = NULL;
 106         spin_unlock_irqrestore(&rkt->lock, flags);
 107 }
 108
 109 /**
 110  * ipath_lkey_ok - check IB SGE for validity and initialize
 111  * @rkt: table containing lkey to check SGE against
 112  * @isge: outgoing internal SGE
 113  * @sge: SGE to check
 114  * @acc: access flags
 115  *
 116  * Return 1 if valid and successful, otherwise returns 0.
 117  *
 118  * Check the IB SGE for validity and initialize our internal version
 119  * of it.
 120  */
 121 int ipath_lkey_ok(struct ipath_qp *qp, struct ipath_sge *isge,
 122                   struct ib_sge *sge, int acc)
 123 {
 124         struct ipath_lkey_table *rkt = &to_idev(qp->ibqp.device)->lk_table;
 125         struct ipath_mregion *mr;
 126         unsigned n, m;
 127         size_t off;
 128         int ret;
 129
 130         /*
 131          * We use LKEY == zero to mean a physical kmalloc() address.
 132          * This is a bit of a hack since we rely on dma_map_single()
 133          * being reversible by calling bus_to_virt().
 134          */
 135         if (sge->lkey == 0) {
 136                 isge->mr = NULL;
 137                 isge->vaddr = (void *) sge->addr;
 138                 isge->length = sge->length;
 139                 isge->sge_length = sge->length;
 140                 ret = 1;
 141                 goto bail;
 142         }
 143         mr = rkt->table[(sge->lkey >> (32 - ib_ipath_lkey_table_size))];
 144         if (unlikely(mr == NULL || mr->lkey != sge->lkey ||
 145                      qp->ibqp.pd != mr->pd)) {
 146                 ret = 0;
 147                 goto bail;
 148         }
 149
 150         off = sge->addr - mr->user_base;
 151         if (unlikely(sge->addr < mr->user_base ||
 152                      off + sge->length > mr->length ||
 153                      (mr->access_flags & acc) != acc)) {
 154                 ret = 0;
 155                 goto bail;
 156         }
 157
 158         off += mr->offset;
 159         m = 0;
 160         n = 0;
 161         while (off >= mr->map[m]->segs[n].length) {
 162                 off -= mr->map[m]->segs[n].length;
 163                 n++;
 164                 if (n >= IPATH_SEGSZ) {
 165                         m++;
 166                         n = 0;
 167                 }
 168         }
 169         isge->mr = mr;
 170         isge->vaddr = mr->map[m]->segs[n].vaddr + off;
 171         isge->length = mr->map[m]->segs[n].length - off;
 172         isge->sge_length = sge->length;
 173         isge->m = m;
 174         isge->n = n;
 175
 176         ret = 1;
 177
 178 bail:
 179         return ret;
 180 }
 181
 182 /**
 183  * ipath_rkey_ok - check the IB virtual address, length, and RKEY
 184  * @dev: infiniband device
 185  * @ss: SGE state
 186  * @len: length of data
 187  * @vaddr: virtual address to place data
 188  * @rkey: rkey to check
 189  * @acc: access flags
 190  *
 191  * Return 1 if successful, otherwise 0.
 192  */
 193 int ipath_rkey_ok(struct ipath_qp *qp, struct ipath_sge_state *ss,
 194                   u32 len, u64 vaddr, u32 rkey, int acc)
 195 {
 196         struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
 197         struct ipath_lkey_table *rkt = &dev->lk_table;
 198         struct ipath_sge *sge = &ss->sge;
 199         struct ipath_mregion *mr;
 200         unsigned n, m;
 201         size_t off;
 202         int ret;
 203
 204         /*
 205          * We use RKEY == zero for kernel virtual addresses
 206          * (see ipath_get_dma_mr and ipath_dma.c).
 207          */
 208         if (rkey == 0) {
 209                 sge->mr = NULL;
 210                 sge->vaddr = (void *) vaddr;
 211                 sge->length = len;
 212                 sge->sge_length = len;
 213                 ss->sg_list = NULL;
 214                 ss->num_sge = 1;
 215                 ret = 1;
 216                 goto bail;
 217         }
 218
 219         mr = rkt->table[(rkey >> (32 - ib_ipath_lkey_table_size))];
 220         if (unlikely(mr == NULL || mr->lkey != rkey ||
 221                      qp->ibqp.pd != mr->pd)) {
 222                 ret = 0;
 223                 goto bail;
 224         }
 225
 226         off = vaddr - mr->iova;
 227         if (unlikely(vaddr < mr->iova || off + len > mr->length ||
 228                      (mr->access_flags & acc) == 0)) {
 229                 ret = 0;
 230                 goto bail;
 231         }
 232
 233         off += mr->offset;
 234         m = 0;
 235         n = 0;
 236         while (off >= mr->map[m]->segs[n].length) {
 237                 off -= mr->map[m]->segs[n].length;
 238                 n++;
 239                 if (n >= IPATH_SEGSZ) {
 240                         m++;
 241                         n = 0;
 242                 }
 243         }
 244         sge->mr = mr;
 245         sge->vaddr = mr->map[m]->segs[n].vaddr + off;
 246         sge->length = mr->map[m]->segs[n].length - off;
 247         sge->sge_length = len;
 248         sge->m = m;
 249         sge->n = n;
 250         ss->sg_list = NULL;
 251         ss->num_sge = 1;
 252
 253         ret = 1;
 254
 255 bail:
 256         return ret;
 257 }