IB/mlx5: Implement fragmented completion queue (CQ)
[linux-2.6-block.git] / drivers / net / ethernet / mellanox / mlx5 / core / wq.h
CommitLineData
e586b3b0
AV
1/*
2 * Copyright (c) 2013-2015, Mellanox Technologies, Ltd. All rights reserved.
3 *
4 * This software is available to you under a choice of one of two
5 * licenses. You may choose to be licensed under the terms of the GNU
6 * General Public License (GPL) Version 2, available from the file
7 * COPYING in the main directory of this source tree, or the
8 * OpenIB.org BSD license below:
9 *
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
12 * conditions are met:
13 *
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer.
17 *
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials
21 * provided with the distribution.
22 *
23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30 * SOFTWARE.
31 */
32
33#ifndef __MLX5_WQ_H__
34#define __MLX5_WQ_H__
35
36#include <linux/mlx5/mlx5_ifc.h>
4b673793 37#include <linux/mlx5/cq.h>
3f2b7edd 38#include <linux/mlx5/qp.h>
e586b3b0
AV
39
40struct mlx5_wq_param {
41 int linear;
311c7c71
SM
42 int buf_numa_node;
43 int db_numa_node;
e586b3b0
AV
44};
45
46struct mlx5_wq_ctrl {
47 struct mlx5_core_dev *mdev;
388ca8be 48 struct mlx5_frag_buf buf;
e586b3b0
AV
49 struct mlx5_db db;
50};
51
1c1b5228
TT
52struct mlx5_frag_wq_ctrl {
53 struct mlx5_core_dev *mdev;
54 struct mlx5_frag_buf frag_buf;
55 struct mlx5_db db;
56};
57
e586b3b0
AV
58struct mlx5_wq_cyc {
59 void *buf;
60 __be32 *db;
61 u16 sz_m1;
62 u8 log_stride;
63};
64
3f2b7edd
IT
65struct mlx5_wq_qp {
66 struct mlx5_wq_cyc rq;
67 struct mlx5_wq_cyc sq;
68};
69
e586b3b0 70struct mlx5_cqwq {
388ca8be
YC
71 struct mlx5_frag_buf_ctrl fbc;
72 __be32 *db;
73 u32 cc; /* consumer counter */
e586b3b0
AV
74};
75
76struct mlx5_wq_ll {
77 void *buf;
78 __be32 *db;
79 __be16 *tail_next;
80 u16 sz_m1;
81 u16 head;
82 u16 wqe_ctr;
83 u16 cur_sz;
84 u8 log_stride;
85};
86
87int mlx5_wq_cyc_create(struct mlx5_core_dev *mdev, struct mlx5_wq_param *param,
88 void *wqc, struct mlx5_wq_cyc *wq,
89 struct mlx5_wq_ctrl *wq_ctrl);
90u32 mlx5_wq_cyc_get_size(struct mlx5_wq_cyc *wq);
91
3f2b7edd
IT
92int mlx5_wq_qp_create(struct mlx5_core_dev *mdev, struct mlx5_wq_param *param,
93 void *qpc, struct mlx5_wq_qp *wq,
94 struct mlx5_wq_ctrl *wq_ctrl);
95
e586b3b0
AV
96int mlx5_cqwq_create(struct mlx5_core_dev *mdev, struct mlx5_wq_param *param,
97 void *cqc, struct mlx5_cqwq *wq,
1c1b5228 98 struct mlx5_frag_wq_ctrl *wq_ctrl);
e586b3b0
AV
99u32 mlx5_cqwq_get_size(struct mlx5_cqwq *wq);
100
101int mlx5_wq_ll_create(struct mlx5_core_dev *mdev, struct mlx5_wq_param *param,
102 void *wqc, struct mlx5_wq_ll *wq,
103 struct mlx5_wq_ctrl *wq_ctrl);
104u32 mlx5_wq_ll_get_size(struct mlx5_wq_ll *wq);
105
106void mlx5_wq_destroy(struct mlx5_wq_ctrl *wq_ctrl);
1c1b5228 107void mlx5_cqwq_destroy(struct mlx5_frag_wq_ctrl *wq_ctrl);
e586b3b0
AV
108
109static inline u16 mlx5_wq_cyc_ctr2ix(struct mlx5_wq_cyc *wq, u16 ctr)
110{
111 return ctr & wq->sz_m1;
112}
113
114static inline void *mlx5_wq_cyc_get_wqe(struct mlx5_wq_cyc *wq, u16 ix)
115{
116 return wq->buf + (ix << wq->log_stride);
117}
118
119static inline int mlx5_wq_cyc_cc_bigger(u16 cc1, u16 cc2)
120{
121 int equal = (cc1 == cc2);
122 int smaller = 0x8000 & (cc1 - cc2);
123
124 return !equal && !smaller;
125}
126
127static inline u32 mlx5_cqwq_get_ci(struct mlx5_cqwq *wq)
128{
388ca8be 129 return wq->cc & wq->fbc.sz_m1;
e586b3b0
AV
130}
131
132static inline void *mlx5_cqwq_get_wqe(struct mlx5_cqwq *wq, u32 ix)
133{
388ca8be 134 return mlx5_frag_buf_get_wqe(&wq->fbc, ix);
e586b3b0
AV
135}
136
137static inline u32 mlx5_cqwq_get_wrap_cnt(struct mlx5_cqwq *wq)
138{
388ca8be 139 return wq->cc >> wq->fbc.log_sz;
e586b3b0
AV
140}
141
142static inline void mlx5_cqwq_pop(struct mlx5_cqwq *wq)
143{
144 wq->cc++;
145}
146
147static inline void mlx5_cqwq_update_db_record(struct mlx5_cqwq *wq)
148{
149 *wq->db = cpu_to_be32(wq->cc & 0xffffff);
150}
151
4b673793
IT
152static inline struct mlx5_cqe64 *mlx5_cqwq_get_cqe(struct mlx5_cqwq *wq)
153{
154 u32 ci = mlx5_cqwq_get_ci(wq);
155 struct mlx5_cqe64 *cqe = mlx5_cqwq_get_wqe(wq, ci);
156 u8 cqe_ownership_bit = cqe->op_own & MLX5_CQE_OWNER_MASK;
157 u8 sw_ownership_val = mlx5_cqwq_get_wrap_cnt(wq) & 1;
158
159 if (cqe_ownership_bit != sw_ownership_val)
160 return NULL;
161
162 /* ensure cqe content is read after cqe ownership bit */
163 dma_rmb();
164
165 return cqe;
166}
167
e586b3b0
AV
168static inline int mlx5_wq_ll_is_full(struct mlx5_wq_ll *wq)
169{
170 return wq->cur_sz == wq->sz_m1;
171}
172
173static inline int mlx5_wq_ll_is_empty(struct mlx5_wq_ll *wq)
174{
175 return !wq->cur_sz;
176}
177
178static inline void *mlx5_wq_ll_get_wqe(struct mlx5_wq_ll *wq, u16 ix)
179{
180 return wq->buf + (ix << wq->log_stride);
181}
182
183static inline void mlx5_wq_ll_push(struct mlx5_wq_ll *wq, u16 head_next)
184{
185 wq->head = head_next;
186 wq->wqe_ctr++;
187 wq->cur_sz++;
188}
189
190static inline void mlx5_wq_ll_pop(struct mlx5_wq_ll *wq, __be16 ix,
191 __be16 *next_tail_next)
192{
193 *wq->tail_next = ix;
194 wq->tail_next = next_tail_next;
195 wq->cur_sz--;
196}
197
198static inline void mlx5_wq_ll_update_db_record(struct mlx5_wq_ll *wq)
199{
200 *wq->db = cpu_to_be32(wq->wqe_ctr);
201}
202
203#endif /* __MLX5_WQ_H__ */