2 * Copyright (c) 2006, 2007, 2009 QLogic Corporation. All rights reserved.
3 * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved.
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:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
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.
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
37 * qib_alloc_lkey - allocate an lkey
38 * @mr: memory region that this lkey protects
39 * @dma_region: 0->normal key, 1->restricted DMA key
41 * Returns 0 if successful, otherwise returns -errno.
43 * Increments mr reference count as required.
45 * Sets the lkey field mr for non-dma regions.
49 int qib_alloc_lkey(struct rvt_mregion *mr, int dma_region)
55 struct qib_ibdev *dev = to_idev(mr->pd->device);
56 struct rvt_lkey_table *rkt = &dev->lk_table;
58 spin_lock_irqsave(&rkt->lock, flags);
60 /* special case for dma_mr lkey == 0 */
62 struct rvt_mregion *tmr;
64 tmr = rcu_access_pointer(dev->dma_mr);
67 rcu_assign_pointer(dev->dma_mr, mr);
68 mr->lkey_published = 1;
73 /* Find the next available LKEY */
77 if (rkt->table[r] == NULL)
79 r = (r + 1) & (rkt->max - 1);
83 rkt->next = (r + 1) & (rkt->max - 1);
85 * Make sure lkey is never zero which is reserved to indicate an
90 * bits are capped in qib_verbs.c to insure enough bits
91 * for generation number
93 mr->lkey = (r << (32 - ib_rvt_lkey_table_size)) |
94 ((((1 << (24 - ib_rvt_lkey_table_size)) - 1) & rkt->gen)
101 rcu_assign_pointer(rkt->table[r], mr);
102 mr->lkey_published = 1;
104 spin_unlock_irqrestore(&rkt->lock, flags);
108 spin_unlock_irqrestore(&rkt->lock, flags);
114 * qib_free_lkey - free an lkey
115 * @mr: mr to free from tables
117 void qib_free_lkey(struct rvt_mregion *mr)
122 struct qib_ibdev *dev = to_idev(mr->pd->device);
123 struct rvt_lkey_table *rkt = &dev->lk_table;
125 spin_lock_irqsave(&rkt->lock, flags);
126 if (!mr->lkey_published)
129 RCU_INIT_POINTER(dev->dma_mr, NULL);
131 r = lkey >> (32 - ib_rvt_lkey_table_size);
132 RCU_INIT_POINTER(rkt->table[r], NULL);
135 mr->lkey_published = 0;
137 spin_unlock_irqrestore(&rkt->lock, flags);
141 * qib_rkey_ok - check the IB virtual address, length, and RKEY
142 * @qp: qp for validation
144 * @len: length of data
145 * @vaddr: virtual address to place data
146 * @rkey: rkey to check
149 * Return 1 if successful, otherwise 0.
151 * increments the reference count upon success
153 int qib_rkey_ok(struct rvt_qp *qp, struct rvt_sge *sge,
154 u32 len, u64 vaddr, u32 rkey, int acc)
156 struct rvt_lkey_table *rkt = &to_idev(qp->ibqp.device)->lk_table;
157 struct rvt_mregion *mr;
162 * We use RKEY == zero for kernel virtual addresses
163 * (see qib_get_dma_mr and qib_dma.c).
167 struct rvt_pd *pd = ibpd_to_rvtpd(qp->ibqp.pd);
168 struct qib_ibdev *dev = to_idev(pd->ibpd.device);
172 mr = rcu_dereference(dev->dma_mr);
175 if (unlikely(!atomic_inc_not_zero(&mr->refcount)))
180 sge->vaddr = (void *) vaddr;
182 sge->sge_length = len;
188 mr = rcu_dereference(
189 rkt->table[(rkey >> (32 - ib_rvt_lkey_table_size))]);
190 if (unlikely(!mr || mr->lkey != rkey || qp->ibqp.pd != mr->pd))
193 off = vaddr - mr->iova;
194 if (unlikely(vaddr < mr->iova || off + len > mr->length ||
195 (mr->access_flags & acc) == 0))
197 if (unlikely(!atomic_inc_not_zero(&mr->refcount)))
202 if (mr->page_shift) {
204 page sizes are uniform power of 2 so no loop is necessary
205 entries_spanned_by_off is the number of times the loop below
208 size_t entries_spanned_by_off;
210 entries_spanned_by_off = off >> mr->page_shift;
211 off -= (entries_spanned_by_off << mr->page_shift);
212 m = entries_spanned_by_off / RVT_SEGSZ;
213 n = entries_spanned_by_off % RVT_SEGSZ;
217 while (off >= mr->map[m]->segs[n].length) {
218 off -= mr->map[m]->segs[n].length;
220 if (n >= RVT_SEGSZ) {
227 sge->vaddr = mr->map[m]->segs[n].vaddr + off;
228 sge->length = mr->map[m]->segs[n].length - off;
229 sge->sge_length = len;