1
2
3
4
5
6#ifndef DEF_RDMAVT_INCMR_H
7#define DEF_RDMAVT_INCMR_H
8
9
10
11
12
13#include <linux/percpu-refcount.h>
14
15
16
17
18
19struct rvt_seg {
20 void *vaddr;
21 size_t length;
22};
23
24
25#define RVT_SEGSZ (PAGE_SIZE / sizeof(struct rvt_seg))
26
27struct rvt_segarray {
28 struct rvt_seg segs[RVT_SEGSZ];
29};
30
31struct rvt_mregion {
32 struct ib_pd *pd;
33 u64 user_base;
34 u64 iova;
35 size_t length;
36 u32 lkey;
37 u32 offset;
38 int access_flags;
39 u32 max_segs;
40 u32 mapsz;
41 atomic_t lkey_invalid;
42 u8 page_shift;
43 u8 lkey_published;
44 struct percpu_ref refcount;
45 struct completion comp;
46 struct rvt_segarray *map[];
47};
48
49#define RVT_MAX_LKEY_TABLE_BITS 23
50
51struct rvt_lkey_table {
52
53 u32 max;
54 u32 shift;
55 struct rvt_mregion __rcu **table;
56
57
58 spinlock_t lock ____cacheline_aligned_in_smp;
59 u32 next;
60 u32 gen;
61};
62
63
64
65
66
67struct rvt_sge {
68 struct rvt_mregion *mr;
69 void *vaddr;
70 u32 sge_length;
71 u32 length;
72 u16 m;
73 u16 n;
74};
75
76struct rvt_sge_state {
77 struct rvt_sge *sg_list;
78 struct rvt_sge sge;
79 u32 total_len;
80 u8 num_sge;
81};
82
83static inline void rvt_put_mr(struct rvt_mregion *mr)
84{
85 percpu_ref_put(&mr->refcount);
86}
87
88static inline void rvt_get_mr(struct rvt_mregion *mr)
89{
90 percpu_ref_get(&mr->refcount);
91}
92
93static inline void rvt_put_ss(struct rvt_sge_state *ss)
94{
95 while (ss->num_sge) {
96 rvt_put_mr(ss->sge.mr);
97 if (--ss->num_sge)
98 ss->sge = *ss->sg_list++;
99 }
100}
101
102static inline u32 rvt_get_sge_length(struct rvt_sge *sge, u32 length)
103{
104 u32 len = sge->length;
105
106 if (len > length)
107 len = length;
108 if (len > sge->sge_length)
109 len = sge->sge_length;
110
111 return len;
112}
113
114static inline void rvt_update_sge(struct rvt_sge_state *ss, u32 length,
115 bool release)
116{
117 struct rvt_sge *sge = &ss->sge;
118
119 sge->vaddr += length;
120 sge->length -= length;
121 sge->sge_length -= length;
122 if (sge->sge_length == 0) {
123 if (release)
124 rvt_put_mr(sge->mr);
125 if (--ss->num_sge)
126 *sge = *ss->sg_list++;
127 } else if (sge->length == 0 && sge->mr->lkey) {
128 if (++sge->n >= RVT_SEGSZ) {
129 if (++sge->m >= sge->mr->mapsz)
130 return;
131 sge->n = 0;
132 }
133 sge->vaddr = sge->mr->map[sge->m]->segs[sge->n].vaddr;
134 sge->length = sge->mr->map[sge->m]->segs[sge->n].length;
135 }
136}
137
138static inline void rvt_skip_sge(struct rvt_sge_state *ss, u32 length,
139 bool release)
140{
141 struct rvt_sge *sge = &ss->sge;
142
143 while (length) {
144 u32 len = rvt_get_sge_length(sge, length);
145
146 WARN_ON_ONCE(len == 0);
147 rvt_update_sge(ss, len, release);
148 length -= len;
149 }
150}
151
152bool rvt_ss_has_lkey(struct rvt_sge_state *ss, u32 lkey);
153bool rvt_mr_has_lkey(struct rvt_mregion *mr, u32 lkey);
154
155#endif
156