blob: ba1b93226caa4472ca67fa1d5dade05ee271b53a [file] [log] [blame]
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -08001/*
Bryan O'Sullivan759d5762006-07-01 04:35:49 -07002 * Copyright (c) 2006 QLogic, Inc. All rights reserved.
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -08003 * 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"
Bryan O'Sullivanb55f4f02006-08-25 11:24:33 -070037#include "ipath_kernel.h"
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -080038
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
47int 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);
Bryan O'Sullivanb55f4f02006-08-25 11:24:33 -070064 ipath_dbg(KERN_INFO "LKEY table full\n");
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -080065 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
87bail:
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 */
96void 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 */
121int ipath_lkey_ok(struct ipath_lkey_table *rkt, struct ipath_sge *isge,
122 struct ib_sge *sge, int acc)
123{
124 struct ipath_mregion *mr;
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700125 unsigned n, m;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800126 size_t off;
127 int ret;
128
129 /*
130 * We use LKEY == zero to mean a physical kmalloc() address.
131 * This is a bit of a hack since we rely on dma_map_single()
132 * being reversible by calling bus_to_virt().
133 */
134 if (sge->lkey == 0) {
135 isge->mr = NULL;
136 isge->vaddr = bus_to_virt(sge->addr);
137 isge->length = sge->length;
138 isge->sge_length = sge->length;
139 ret = 1;
140 goto bail;
141 }
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800142 mr = rkt->table[(sge->lkey >> (32 - ib_ipath_lkey_table_size))];
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800143 if (unlikely(mr == NULL || mr->lkey != sge->lkey)) {
144 ret = 0;
145 goto bail;
146 }
147
148 off = sge->addr - mr->user_base;
149 if (unlikely(sge->addr < mr->user_base ||
150 off + sge->length > mr->length ||
151 (mr->access_flags & acc) != acc)) {
152 ret = 0;
153 goto bail;
154 }
155
156 off += mr->offset;
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700157 m = 0;
158 n = 0;
159 while (off >= mr->map[m]->segs[n].length) {
160 off -= mr->map[m]->segs[n].length;
161 n++;
162 if (n >= IPATH_SEGSZ) {
163 m++;
164 n = 0;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800165 }
166 }
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700167 isge->mr = mr;
168 isge->vaddr = mr->map[m]->segs[n].vaddr + off;
169 isge->length = mr->map[m]->segs[n].length - off;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800170 isge->sge_length = sge->length;
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700171 isge->m = m;
172 isge->n = n;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800173
174 ret = 1;
175
176bail:
177 return ret;
178}
179
180/**
181 * ipath_rkey_ok - check the IB virtual address, length, and RKEY
182 * @dev: infiniband device
183 * @ss: SGE state
184 * @len: length of data
185 * @vaddr: virtual address to place data
186 * @rkey: rkey to check
187 * @acc: access flags
188 *
189 * Return 1 if successful, otherwise 0.
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800190 */
191int ipath_rkey_ok(struct ipath_ibdev *dev, struct ipath_sge_state *ss,
192 u32 len, u64 vaddr, u32 rkey, int acc)
193{
194 struct ipath_lkey_table *rkt = &dev->lk_table;
195 struct ipath_sge *sge = &ss->sge;
196 struct ipath_mregion *mr;
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700197 unsigned n, m;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800198 size_t off;
199 int ret;
200
Ralph Campbellc9f79bd2006-07-17 18:19:54 -0700201 /*
202 * We use RKEY == zero for physical addresses
203 * (see ipath_get_dma_mr).
204 */
205 if (rkey == 0) {
206 sge->mr = NULL;
207 sge->vaddr = phys_to_virt(vaddr);
208 sge->length = len;
209 sge->sge_length = len;
210 ss->sg_list = NULL;
211 ss->num_sge = 1;
212 ret = 1;
213 goto bail;
214 }
215
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800216 mr = rkt->table[(rkey >> (32 - ib_ipath_lkey_table_size))];
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800217 if (unlikely(mr == NULL || mr->lkey != rkey)) {
218 ret = 0;
219 goto bail;
220 }
221
222 off = vaddr - mr->iova;
223 if (unlikely(vaddr < mr->iova || off + len > mr->length ||
224 (mr->access_flags & acc) == 0)) {
225 ret = 0;
226 goto bail;
227 }
228
229 off += mr->offset;
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700230 m = 0;
231 n = 0;
232 while (off >= mr->map[m]->segs[n].length) {
233 off -= mr->map[m]->segs[n].length;
234 n++;
235 if (n >= IPATH_SEGSZ) {
236 m++;
237 n = 0;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800238 }
239 }
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700240 sge->mr = mr;
241 sge->vaddr = mr->map[m]->segs[n].vaddr + off;
242 sge->length = mr->map[m]->segs[n].length - off;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800243 sge->sge_length = len;
Bryan O'Sullivan12eef412006-07-01 04:36:10 -0700244 sge->m = m;
245 sge->n = n;
Bryan O'Sullivancef1cce2006-03-29 15:23:36 -0800246 ss->sg_list = NULL;
247 ss->num_sge = 1;
248
249 ret = 1;
250
251bail:
252 return ret;
253}