156 		struct qib_sge *isge, struct ib_sge *sge, int acc)  in qib_lkey_ok()  argument
167 	if (sge->lkey == 0) {  in qib_lkey_ok()
180 		isge->vaddr = (void *) sge->addr;  in qib_lkey_ok()
181 		isge->length = sge->length;  in qib_lkey_ok()
182 		isge->sge_length = sge->length;  in qib_lkey_ok()
188 		rkt->table[(sge->lkey >> (32 - ib_qib_lkey_table_size))]);  in qib_lkey_ok()
189 	if (unlikely(!mr || mr->lkey != sge->lkey || mr->pd != &pd->ibpd))  in qib_lkey_ok()
192 	off = sge->addr - mr->user_base;  in qib_lkey_ok()
193 	if (unlikely(sge->addr < mr->user_base ||  in qib_lkey_ok()
194 		     off + sge->length > mr->length ||  in qib_lkey_ok()
229 	isge->sge_length = sge->length;  in qib_lkey_ok()
252 int qib_rkey_ok(struct qib_qp *qp, struct qib_sge *sge,  in qib_rkey_ok()  argument
278 		sge->mr = mr;  in qib_rkey_ok()
279 		sge->vaddr = (void *) vaddr;  in qib_rkey_ok()
280 		sge->length = len;  in qib_rkey_ok()
281 		sge->sge_length = len;  in qib_rkey_ok()
282 		sge->m = 0;  in qib_rkey_ok()
283 		sge->n = 0;  in qib_rkey_ok()
325 	sge->mr = mr;  in qib_rkey_ok()
326 	sge->vaddr = mr->map[m]->segs[n].vaddr + off;  in qib_rkey_ok()
327 	sge->length = mr->map[m]->segs[n].length - off;  in qib_rkey_ok()
328 	sge->sge_length = len;  in qib_rkey_ok()
329 	sge->m = m;  in qib_rkey_ok()
330 	sge->n = n;  in qib_rkey_ok()