1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34#ifndef RXE_QUEUE_H
35#define RXE_QUEUE_H
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58struct rxe_queue_buf {
59 __u32 log2_elem_size;
60 __u32 index_mask;
61 __u32 pad_1[30];
62 __u32 producer_index;
63 __u32 pad_2[31];
64 __u32 consumer_index;
65 __u32 pad_3[31];
66 __u8 data[];
67};
68
69struct rxe_queue {
70 struct rxe_dev *rxe;
71 struct rxe_queue_buf *buf;
72 struct rxe_mmap_info *ip;
73 size_t buf_size;
74 size_t elem_size;
75 unsigned int log2_elem_size;
76 unsigned int index_mask;
77};
78
79int do_mmap_info(struct rxe_dev *rxe, struct mminfo __user *outbuf,
80 struct ib_udata *udata, struct rxe_queue_buf *buf,
81 size_t buf_size, struct rxe_mmap_info **ip_p);
82
83void rxe_queue_reset(struct rxe_queue *q);
84
85struct rxe_queue *rxe_queue_init(struct rxe_dev *rxe,
86 int *num_elem,
87 unsigned int elem_size);
88
89int rxe_queue_resize(struct rxe_queue *q, unsigned int *num_elem_p,
90 unsigned int elem_size, struct ib_udata *udata,
91 struct mminfo __user *outbuf,
92
93 spinlock_t *producer_lock,
94
95 spinlock_t *consumer_lock);
96
97void rxe_queue_cleanup(struct rxe_queue *queue);
98
99static inline int next_index(struct rxe_queue *q, int index)
100{
101 return (index + 1) & q->buf->index_mask;
102}
103
104static inline int queue_empty(struct rxe_queue *q)
105{
106 return ((q->buf->producer_index - q->buf->consumer_index)
107 & q->index_mask) == 0;
108}
109
110static inline int queue_full(struct rxe_queue *q)
111{
112 return ((q->buf->producer_index + 1 - q->buf->consumer_index)
113 & q->index_mask) == 0;
114}
115
116static inline void advance_producer(struct rxe_queue *q)
117{
118 q->buf->producer_index = (q->buf->producer_index + 1)
119 & q->index_mask;
120}
121
122static inline void advance_consumer(struct rxe_queue *q)
123{
124 q->buf->consumer_index = (q->buf->consumer_index + 1)
125 & q->index_mask;
126}
127
128static inline void *producer_addr(struct rxe_queue *q)
129{
130 return q->buf->data + ((q->buf->producer_index & q->index_mask)
131 << q->log2_elem_size);
132}
133
134static inline void *consumer_addr(struct rxe_queue *q)
135{
136 return q->buf->data + ((q->buf->consumer_index & q->index_mask)
137 << q->log2_elem_size);
138}
139
140static inline unsigned int producer_index(struct rxe_queue *q)
141{
142 return q->buf->producer_index;
143}
144
145static inline unsigned int consumer_index(struct rxe_queue *q)
146{
147 return q->buf->consumer_index;
148}
149
150static inline void *addr_from_index(struct rxe_queue *q, unsigned int index)
151{
152 return q->buf->data + ((index & q->index_mask)
153 << q->buf->log2_elem_size);
154}
155
156static inline unsigned int index_from_addr(const struct rxe_queue *q,
157 const void *addr)
158{
159 return (((u8 *)addr - q->buf->data) >> q->log2_elem_size)
160 & q->index_mask;
161}
162
163static inline unsigned int queue_count(const struct rxe_queue *q)
164{
165 return (q->buf->producer_index - q->buf->consumer_index)
166 & q->index_mask;
167}
168
169static inline void *queue_head(struct rxe_queue *q)
170{
171 return queue_empty(q) ? NULL : consumer_addr(q);
172}
173
174#endif
175