ena_eth_com.h revision 1.1 1 1.1 jdolecek /*-
2 1.1 jdolecek * BSD LICENSE
3 1.1 jdolecek *
4 1.1 jdolecek * Copyright (c) 2015-2017 Amazon.com, Inc. or its affiliates.
5 1.1 jdolecek * All rights reserved.
6 1.1 jdolecek *
7 1.1 jdolecek * Redistribution and use in source and binary forms, with or without
8 1.1 jdolecek * modification, are permitted provided that the following conditions
9 1.1 jdolecek * are met:
10 1.1 jdolecek *
11 1.1 jdolecek * * Redistributions of source code must retain the above copyright
12 1.1 jdolecek * notice, this list of conditions and the following disclaimer.
13 1.1 jdolecek * * Redistributions in binary form must reproduce the above copyright
14 1.1 jdolecek * notice, this list of conditions and the following disclaimer in
15 1.1 jdolecek * the documentation and/or other materials provided with the
16 1.1 jdolecek * distribution.
17 1.1 jdolecek * * Neither the name of copyright holder nor the names of its
18 1.1 jdolecek * contributors may be used to endorse or promote products derived
19 1.1 jdolecek * from this software without specific prior written permission.
20 1.1 jdolecek *
21 1.1 jdolecek * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 1.1 jdolecek * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 1.1 jdolecek * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 1.1 jdolecek * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 1.1 jdolecek * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 1.1 jdolecek * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 1.1 jdolecek * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 1.1 jdolecek * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 1.1 jdolecek * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 1.1 jdolecek * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 1.1 jdolecek * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 1.1 jdolecek */
33 1.1 jdolecek
34 1.1 jdolecek #ifndef ENA_ETH_COM_H_
35 1.1 jdolecek #define ENA_ETH_COM_H_
36 1.1 jdolecek
37 1.1 jdolecek #if defined(__cplusplus)
38 1.1 jdolecek extern "C" {
39 1.1 jdolecek #endif
40 1.1 jdolecek #include "ena_com.h"
41 1.1 jdolecek
42 1.1 jdolecek /* head update threshold in units of (queue size / ENA_COMP_HEAD_THRESH) */
43 1.1 jdolecek #define ENA_COMP_HEAD_THRESH 4
44 1.1 jdolecek
45 1.1 jdolecek struct ena_com_tx_ctx {
46 1.1 jdolecek struct ena_com_tx_meta ena_meta;
47 1.1 jdolecek struct ena_com_buf *ena_bufs;
48 1.1 jdolecek /* For LLQ, header buffer - pushed to the device mem space */
49 1.1 jdolecek void *push_header;
50 1.1 jdolecek
51 1.1 jdolecek enum ena_eth_io_l3_proto_index l3_proto;
52 1.1 jdolecek enum ena_eth_io_l4_proto_index l4_proto;
53 1.1 jdolecek u16 num_bufs;
54 1.1 jdolecek u16 req_id;
55 1.1 jdolecek /* For regular queue, indicate the size of the header
56 1.1 jdolecek * For LLQ, indicate the size of the pushed buffer
57 1.1 jdolecek */
58 1.1 jdolecek u16 header_len;
59 1.1 jdolecek
60 1.1 jdolecek u8 meta_valid;
61 1.1 jdolecek u8 tso_enable;
62 1.1 jdolecek u8 l3_csum_enable;
63 1.1 jdolecek u8 l4_csum_enable;
64 1.1 jdolecek u8 l4_csum_partial;
65 1.1 jdolecek u8 df; /* Don't fragment */
66 1.1 jdolecek };
67 1.1 jdolecek
68 1.1 jdolecek struct ena_com_rx_ctx {
69 1.1 jdolecek struct ena_com_rx_buf_info *ena_bufs;
70 1.1 jdolecek enum ena_eth_io_l3_proto_index l3_proto;
71 1.1 jdolecek enum ena_eth_io_l4_proto_index l4_proto;
72 1.1 jdolecek bool l3_csum_err;
73 1.1 jdolecek bool l4_csum_err;
74 1.1 jdolecek /* fragmented packet */
75 1.1 jdolecek bool frag;
76 1.1 jdolecek u32 hash;
77 1.1 jdolecek u16 descs;
78 1.1 jdolecek int max_bufs;
79 1.1 jdolecek };
80 1.1 jdolecek
81 1.1 jdolecek int ena_com_prepare_tx(struct ena_com_io_sq *io_sq,
82 1.1 jdolecek struct ena_com_tx_ctx *ena_tx_ctx,
83 1.1 jdolecek int *nb_hw_desc);
84 1.1 jdolecek
85 1.1 jdolecek int ena_com_rx_pkt(struct ena_com_io_cq *io_cq,
86 1.1 jdolecek struct ena_com_io_sq *io_sq,
87 1.1 jdolecek struct ena_com_rx_ctx *ena_rx_ctx);
88 1.1 jdolecek
89 1.1 jdolecek int ena_com_add_single_rx_desc(struct ena_com_io_sq *io_sq,
90 1.1 jdolecek struct ena_com_buf *ena_buf,
91 1.1 jdolecek u16 req_id);
92 1.1 jdolecek
93 1.1 jdolecek int ena_com_tx_comp_req_id_get(struct ena_com_io_cq *io_cq, u16 *req_id);
94 1.1 jdolecek
95 1.1 jdolecek static inline void ena_com_unmask_intr(struct ena_com_io_cq *io_cq,
96 1.1 jdolecek struct ena_eth_io_intr_reg *intr_reg)
97 1.1 jdolecek {
98 1.1 jdolecek ENA_REG_WRITE32(io_cq->bus, intr_reg->intr_control, io_cq->unmask_reg);
99 1.1 jdolecek }
100 1.1 jdolecek
101 1.1 jdolecek static inline int ena_com_free_desc(struct ena_com_io_sq *io_sq)
102 1.1 jdolecek {
103 1.1 jdolecek u16 tail, next_to_comp, cnt;
104 1.1 jdolecek
105 1.1 jdolecek next_to_comp = io_sq->next_to_comp;
106 1.1 jdolecek tail = io_sq->tail;
107 1.1 jdolecek cnt = tail - next_to_comp;
108 1.1 jdolecek
109 1.1 jdolecek return io_sq->q_depth - 1 - cnt;
110 1.1 jdolecek }
111 1.1 jdolecek
112 1.1 jdolecek /* Check if the submission queue has enough space to hold required_buffers */
113 1.1 jdolecek static inline bool ena_com_sq_have_enough_space(struct ena_com_io_sq *io_sq,
114 1.1 jdolecek u16 required_buffers)
115 1.1 jdolecek {
116 1.1 jdolecek int temp;
117 1.1 jdolecek
118 1.1 jdolecek if (io_sq->mem_queue_type == ENA_ADMIN_PLACEMENT_POLICY_HOST)
119 1.1 jdolecek return ena_com_free_desc(io_sq) >= required_buffers;
120 1.1 jdolecek
121 1.1 jdolecek /* This calculation doesn't need to be 100% accurate. So to reduce
122 1.1 jdolecek * the calculation overhead just Subtract 2 lines from the free descs
123 1.1 jdolecek * (one for the header line and one to compensate the devision
124 1.1 jdolecek * down calculation.
125 1.1 jdolecek */
126 1.1 jdolecek temp = required_buffers / io_sq->llq_info.descs_per_entry + 2;
127 1.1 jdolecek
128 1.1 jdolecek return ena_com_free_desc(io_sq) > temp;
129 1.1 jdolecek }
130 1.1 jdolecek
131 1.1 jdolecek static inline int ena_com_write_sq_doorbell(struct ena_com_io_sq *io_sq)
132 1.1 jdolecek {
133 1.1 jdolecek u16 tail;
134 1.1 jdolecek
135 1.1 jdolecek tail = io_sq->tail;
136 1.1 jdolecek
137 1.1 jdolecek ena_trc_dbg("write submission queue doorbell for queue: %d tail: %d\n",
138 1.1 jdolecek io_sq->qid, tail);
139 1.1 jdolecek
140 1.1 jdolecek ENA_REG_WRITE32(io_sq->bus, tail, io_sq->db_addr);
141 1.1 jdolecek
142 1.1 jdolecek return 0;
143 1.1 jdolecek }
144 1.1 jdolecek
145 1.1 jdolecek static inline int ena_com_update_dev_comp_head(struct ena_com_io_cq *io_cq)
146 1.1 jdolecek {
147 1.1 jdolecek u16 unreported_comp, head;
148 1.1 jdolecek bool need_update;
149 1.1 jdolecek
150 1.1 jdolecek head = io_cq->head;
151 1.1 jdolecek unreported_comp = head - io_cq->last_head_update;
152 1.1 jdolecek need_update = unreported_comp > (io_cq->q_depth / ENA_COMP_HEAD_THRESH);
153 1.1 jdolecek
154 1.1 jdolecek if (io_cq->cq_head_db_reg && need_update) {
155 1.1 jdolecek ena_trc_dbg("Write completion queue doorbell for queue %d: head: %d\n",
156 1.1 jdolecek io_cq->qid, head);
157 1.1 jdolecek ENA_REG_WRITE32(io_cq->bus, head, io_cq->cq_head_db_reg);
158 1.1 jdolecek io_cq->last_head_update = head;
159 1.1 jdolecek }
160 1.1 jdolecek
161 1.1 jdolecek return 0;
162 1.1 jdolecek }
163 1.1 jdolecek
164 1.1 jdolecek static inline void ena_com_update_numa_node(struct ena_com_io_cq *io_cq,
165 1.1 jdolecek u8 numa_node)
166 1.1 jdolecek {
167 1.1 jdolecek struct ena_eth_io_numa_node_cfg_reg numa_cfg;
168 1.1 jdolecek
169 1.1 jdolecek if (!io_cq->numa_node_cfg_reg)
170 1.1 jdolecek return;
171 1.1 jdolecek
172 1.1 jdolecek numa_cfg.numa_cfg = (numa_node & ENA_ETH_IO_NUMA_NODE_CFG_REG_NUMA_MASK)
173 1.1 jdolecek | ENA_ETH_IO_NUMA_NODE_CFG_REG_ENABLED_MASK;
174 1.1 jdolecek
175 1.1 jdolecek ENA_REG_WRITE32(io_cq->bus, numa_cfg.numa_cfg, io_cq->numa_node_cfg_reg);
176 1.1 jdolecek }
177 1.1 jdolecek
178 1.1 jdolecek static inline void ena_com_comp_ack(struct ena_com_io_sq *io_sq, u16 elem)
179 1.1 jdolecek {
180 1.1 jdolecek io_sq->next_to_comp += elem;
181 1.1 jdolecek }
182 1.1 jdolecek
183 1.1 jdolecek #if defined(__cplusplus)
184 1.1 jdolecek }
185 1.1 jdolecek #endif
186 1.1 jdolecek #endif /* ENA_ETH_COM_H_ */
187