Commit | Line | Data |
---|---|---|
8ceee660 BH |
1 | /**************************************************************************** |
2 | * Driver for Solarflare Solarstorm network controllers and boards | |
3 | * Copyright 2005-2006 Fen Systems Ltd. | |
0a6f40c6 | 4 | * Copyright 2005-2011 Solarflare Communications Inc. |
8ceee660 BH |
5 | * |
6 | * This program is free software; you can redistribute it and/or modify it | |
7 | * under the terms of the GNU General Public License version 2 as published | |
8 | * by the Free Software Foundation, incorporated herein by reference. | |
9 | */ | |
10 | ||
11 | #include <linux/socket.h> | |
12 | #include <linux/in.h> | |
5a0e3ad6 | 13 | #include <linux/slab.h> |
8ceee660 BH |
14 | #include <linux/ip.h> |
15 | #include <linux/tcp.h> | |
16 | #include <linux/udp.h> | |
70c71606 | 17 | #include <linux/prefetch.h> |
6eb07caf | 18 | #include <linux/moduleparam.h> |
2768935a | 19 | #include <linux/iommu.h> |
8ceee660 BH |
20 | #include <net/ip.h> |
21 | #include <net/checksum.h> | |
22 | #include "net_driver.h" | |
8ceee660 | 23 | #include "efx.h" |
744093c9 | 24 | #include "nic.h" |
3273c2e8 | 25 | #include "selftest.h" |
8ceee660 BH |
26 | #include "workarounds.h" |
27 | ||
1648a23f DP |
28 | /* Preferred number of descriptors to fill at once */ |
29 | #define EFX_RX_PREFERRED_BATCH 8U | |
8ceee660 | 30 | |
2768935a DP |
31 | /* Number of RX buffers to recycle pages for. When creating the RX page recycle |
32 | * ring, this number is divided by the number of buffers per page to calculate | |
33 | * the number of pages to store in the RX page recycle ring. | |
34 | */ | |
35 | #define EFX_RECYCLE_RING_SIZE_IOMMU 4096 | |
1648a23f | 36 | #define EFX_RECYCLE_RING_SIZE_NOIOMMU (2 * EFX_RX_PREFERRED_BATCH) |
62b330ba | 37 | |
8ceee660 BH |
38 | /* Size of buffer allocated for skb header area. */ |
39 | #define EFX_SKB_HEADERS 64u | |
40 | ||
8ceee660 BH |
41 | /* This is the percentage fill level below which new RX descriptors |
42 | * will be added to the RX descriptor ring. | |
43 | */ | |
64235187 | 44 | static unsigned int rx_refill_threshold; |
8ceee660 | 45 | |
85740cdf BH |
46 | /* Each packet can consume up to ceil(max_frame_len / buffer_size) buffers */ |
47 | #define EFX_RX_MAX_FRAGS DIV_ROUND_UP(EFX_MAX_FRAME_LEN(EFX_MAX_MTU), \ | |
48 | EFX_RX_USR_BUF_SIZE) | |
49 | ||
8ceee660 BH |
50 | /* |
51 | * RX maximum head room required. | |
52 | * | |
85740cdf BH |
53 | * This must be at least 1 to prevent overflow, plus one packet-worth |
54 | * to allow pipelined receives. | |
8ceee660 | 55 | */ |
85740cdf | 56 | #define EFX_RXD_HEAD_ROOM (1 + EFX_RX_MAX_FRAGS) |
8ceee660 | 57 | |
b184f16b | 58 | static inline u8 *efx_rx_buf_va(struct efx_rx_buffer *buf) |
39c9cf07 | 59 | { |
b184f16b | 60 | return page_address(buf->page) + buf->page_offset; |
a526f140 SH |
61 | } |
62 | ||
63 | static inline u32 efx_rx_buf_hash(const u8 *eh) | |
64 | { | |
65 | /* The ethernet header is always directly after any hash. */ | |
39c9cf07 | 66 | #if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) || NET_IP_ALIGN % 4 == 0 |
a526f140 | 67 | return __le32_to_cpup((const __le32 *)(eh - 4)); |
39c9cf07 | 68 | #else |
a526f140 | 69 | const u8 *data = eh - 4; |
0beaca2c BH |
70 | return (u32)data[0] | |
71 | (u32)data[1] << 8 | | |
72 | (u32)data[2] << 16 | | |
73 | (u32)data[3] << 24; | |
39c9cf07 BH |
74 | #endif |
75 | } | |
76 | ||
85740cdf BH |
77 | static inline struct efx_rx_buffer * |
78 | efx_rx_buf_next(struct efx_rx_queue *rx_queue, struct efx_rx_buffer *rx_buf) | |
79 | { | |
80 | if (unlikely(rx_buf == efx_rx_buffer(rx_queue, rx_queue->ptr_mask))) | |
81 | return efx_rx_buffer(rx_queue, 0); | |
82 | else | |
83 | return rx_buf + 1; | |
84 | } | |
85 | ||
2768935a DP |
86 | static inline void efx_sync_rx_buffer(struct efx_nic *efx, |
87 | struct efx_rx_buffer *rx_buf, | |
88 | unsigned int len) | |
89 | { | |
90 | dma_sync_single_for_cpu(&efx->pci_dev->dev, rx_buf->dma_addr, len, | |
91 | DMA_FROM_DEVICE); | |
92 | } | |
93 | ||
1648a23f DP |
94 | void efx_rx_config_page_split(struct efx_nic *efx) |
95 | { | |
c14ff2ea | 96 | efx->rx_page_buf_step = ALIGN(efx->rx_dma_len + NET_IP_ALIGN, |
950c54df | 97 | EFX_RX_BUF_ALIGNMENT); |
1648a23f DP |
98 | efx->rx_bufs_per_page = efx->rx_buffer_order ? 1 : |
99 | ((PAGE_SIZE - sizeof(struct efx_rx_page_state)) / | |
100 | efx->rx_page_buf_step); | |
101 | efx->rx_buffer_truesize = (PAGE_SIZE << efx->rx_buffer_order) / | |
102 | efx->rx_bufs_per_page; | |
103 | efx->rx_pages_per_batch = DIV_ROUND_UP(EFX_RX_PREFERRED_BATCH, | |
104 | efx->rx_bufs_per_page); | |
105 | } | |
106 | ||
2768935a DP |
107 | /* Check the RX page recycle ring for a page that can be reused. */ |
108 | static struct page *efx_reuse_page(struct efx_rx_queue *rx_queue) | |
109 | { | |
110 | struct efx_nic *efx = rx_queue->efx; | |
111 | struct page *page; | |
112 | struct efx_rx_page_state *state; | |
113 | unsigned index; | |
114 | ||
115 | index = rx_queue->page_remove & rx_queue->page_ptr_mask; | |
116 | page = rx_queue->page_ring[index]; | |
117 | if (page == NULL) | |
118 | return NULL; | |
119 | ||
120 | rx_queue->page_ring[index] = NULL; | |
121 | /* page_remove cannot exceed page_add. */ | |
122 | if (rx_queue->page_remove != rx_queue->page_add) | |
123 | ++rx_queue->page_remove; | |
124 | ||
125 | /* If page_count is 1 then we hold the only reference to this page. */ | |
126 | if (page_count(page) == 1) { | |
127 | ++rx_queue->page_recycle_count; | |
128 | return page; | |
129 | } else { | |
130 | state = page_address(page); | |
131 | dma_unmap_page(&efx->pci_dev->dev, state->dma_addr, | |
132 | PAGE_SIZE << efx->rx_buffer_order, | |
133 | DMA_FROM_DEVICE); | |
134 | put_page(page); | |
135 | ++rx_queue->page_recycle_failed; | |
136 | } | |
137 | ||
138 | return NULL; | |
139 | } | |
140 | ||
8ceee660 | 141 | /** |
97d48a10 | 142 | * efx_init_rx_buffers - create EFX_RX_BATCH page-based RX buffers |
8ceee660 BH |
143 | * |
144 | * @rx_queue: Efx RX queue | |
8ceee660 | 145 | * |
1648a23f DP |
146 | * This allocates a batch of pages, maps them for DMA, and populates |
147 | * struct efx_rx_buffers for each one. Return a negative error code or | |
148 | * 0 on success. If a single page can be used for multiple buffers, | |
149 | * then the page will either be inserted fully, or not at all. | |
8ceee660 | 150 | */ |
97d48a10 | 151 | static int efx_init_rx_buffers(struct efx_rx_queue *rx_queue) |
8ceee660 BH |
152 | { |
153 | struct efx_nic *efx = rx_queue->efx; | |
f7d6f379 SH |
154 | struct efx_rx_buffer *rx_buf; |
155 | struct page *page; | |
b590ace0 | 156 | unsigned int page_offset; |
62b330ba | 157 | struct efx_rx_page_state *state; |
f7d6f379 SH |
158 | dma_addr_t dma_addr; |
159 | unsigned index, count; | |
160 | ||
1648a23f DP |
161 | count = 0; |
162 | do { | |
2768935a DP |
163 | page = efx_reuse_page(rx_queue); |
164 | if (page == NULL) { | |
165 | page = alloc_pages(__GFP_COLD | __GFP_COMP | GFP_ATOMIC, | |
166 | efx->rx_buffer_order); | |
167 | if (unlikely(page == NULL)) | |
168 | return -ENOMEM; | |
169 | dma_addr = | |
170 | dma_map_page(&efx->pci_dev->dev, page, 0, | |
171 | PAGE_SIZE << efx->rx_buffer_order, | |
172 | DMA_FROM_DEVICE); | |
173 | if (unlikely(dma_mapping_error(&efx->pci_dev->dev, | |
174 | dma_addr))) { | |
175 | __free_pages(page, efx->rx_buffer_order); | |
176 | return -EIO; | |
177 | } | |
178 | state = page_address(page); | |
179 | state->dma_addr = dma_addr; | |
180 | } else { | |
181 | state = page_address(page); | |
182 | dma_addr = state->dma_addr; | |
8ceee660 | 183 | } |
62b330ba | 184 | |
62b330ba | 185 | dma_addr += sizeof(struct efx_rx_page_state); |
b590ace0 | 186 | page_offset = sizeof(struct efx_rx_page_state); |
f7d6f379 | 187 | |
1648a23f DP |
188 | do { |
189 | index = rx_queue->added_count & rx_queue->ptr_mask; | |
190 | rx_buf = efx_rx_buffer(rx_queue, index); | |
c14ff2ea | 191 | rx_buf->dma_addr = dma_addr + NET_IP_ALIGN; |
1648a23f | 192 | rx_buf->page = page; |
c14ff2ea | 193 | rx_buf->page_offset = page_offset + NET_IP_ALIGN; |
1648a23f | 194 | rx_buf->len = efx->rx_dma_len; |
179ea7f0 | 195 | rx_buf->flags = 0; |
1648a23f DP |
196 | ++rx_queue->added_count; |
197 | get_page(page); | |
198 | dma_addr += efx->rx_page_buf_step; | |
199 | page_offset += efx->rx_page_buf_step; | |
200 | } while (page_offset + efx->rx_page_buf_step <= PAGE_SIZE); | |
179ea7f0 BH |
201 | |
202 | rx_buf->flags = EFX_RX_BUF_LAST_IN_PAGE; | |
1648a23f | 203 | } while (++count < efx->rx_pages_per_batch); |
8ceee660 | 204 | |
8ceee660 BH |
205 | return 0; |
206 | } | |
207 | ||
2768935a DP |
208 | /* Unmap a DMA-mapped page. This function is only called for the final RX |
209 | * buffer in a page. | |
210 | */ | |
4d566063 | 211 | static void efx_unmap_rx_buffer(struct efx_nic *efx, |
2768935a | 212 | struct efx_rx_buffer *rx_buf) |
8ceee660 | 213 | { |
2768935a DP |
214 | struct page *page = rx_buf->page; |
215 | ||
216 | if (page) { | |
217 | struct efx_rx_page_state *state = page_address(page); | |
218 | dma_unmap_page(&efx->pci_dev->dev, | |
219 | state->dma_addr, | |
220 | PAGE_SIZE << efx->rx_buffer_order, | |
221 | DMA_FROM_DEVICE); | |
8ceee660 BH |
222 | } |
223 | } | |
224 | ||
2768935a | 225 | static void efx_free_rx_buffer(struct efx_rx_buffer *rx_buf) |
8ceee660 | 226 | { |
97d48a10 | 227 | if (rx_buf->page) { |
2768935a | 228 | put_page(rx_buf->page); |
97d48a10 | 229 | rx_buf->page = NULL; |
8ceee660 BH |
230 | } |
231 | } | |
232 | ||
2768935a DP |
233 | /* Attempt to recycle the page if there is an RX recycle ring; the page can |
234 | * only be added if this is the final RX buffer, to prevent pages being used in | |
235 | * the descriptor ring and appearing in the recycle ring simultaneously. | |
236 | */ | |
237 | static void efx_recycle_rx_page(struct efx_channel *channel, | |
238 | struct efx_rx_buffer *rx_buf) | |
8ceee660 | 239 | { |
2768935a DP |
240 | struct page *page = rx_buf->page; |
241 | struct efx_rx_queue *rx_queue = efx_channel_get_rx_queue(channel); | |
242 | struct efx_nic *efx = rx_queue->efx; | |
243 | unsigned index; | |
8ceee660 | 244 | |
2768935a | 245 | /* Only recycle the page after processing the final buffer. */ |
179ea7f0 | 246 | if (!(rx_buf->flags & EFX_RX_BUF_LAST_IN_PAGE)) |
62b330ba | 247 | return; |
24455800 | 248 | |
2768935a DP |
249 | index = rx_queue->page_add & rx_queue->page_ptr_mask; |
250 | if (rx_queue->page_ring[index] == NULL) { | |
251 | unsigned read_index = rx_queue->page_remove & | |
252 | rx_queue->page_ptr_mask; | |
24455800 | 253 | |
2768935a DP |
254 | /* The next slot in the recycle ring is available, but |
255 | * increment page_remove if the read pointer currently | |
256 | * points here. | |
257 | */ | |
258 | if (read_index == index) | |
259 | ++rx_queue->page_remove; | |
260 | rx_queue->page_ring[index] = page; | |
261 | ++rx_queue->page_add; | |
262 | return; | |
263 | } | |
264 | ++rx_queue->page_recycle_full; | |
265 | efx_unmap_rx_buffer(efx, rx_buf); | |
266 | put_page(rx_buf->page); | |
24455800 SH |
267 | } |
268 | ||
2768935a DP |
269 | static void efx_fini_rx_buffer(struct efx_rx_queue *rx_queue, |
270 | struct efx_rx_buffer *rx_buf) | |
271 | { | |
272 | /* Release the page reference we hold for the buffer. */ | |
273 | if (rx_buf->page) | |
274 | put_page(rx_buf->page); | |
275 | ||
276 | /* If this is the last buffer in a page, unmap and free it. */ | |
179ea7f0 | 277 | if (rx_buf->flags & EFX_RX_BUF_LAST_IN_PAGE) { |
2768935a DP |
278 | efx_unmap_rx_buffer(rx_queue->efx, rx_buf); |
279 | efx_free_rx_buffer(rx_buf); | |
280 | } | |
281 | rx_buf->page = NULL; | |
282 | } | |
283 | ||
284 | /* Recycle the pages that are used by buffers that have just been received. */ | |
1c6d3d1d BH |
285 | static void efx_recycle_rx_pages(struct efx_channel *channel, |
286 | struct efx_rx_buffer *rx_buf, | |
287 | unsigned int n_frags) | |
24455800 | 288 | { |
f7d12cdc | 289 | struct efx_rx_queue *rx_queue = efx_channel_get_rx_queue(channel); |
24455800 | 290 | |
85740cdf | 291 | do { |
2768935a | 292 | efx_recycle_rx_page(channel, rx_buf); |
85740cdf BH |
293 | rx_buf = efx_rx_buf_next(rx_queue, rx_buf); |
294 | } while (--n_frags); | |
24455800 SH |
295 | } |
296 | ||
1c6d3d1d BH |
297 | static void efx_discard_rx_packet(struct efx_channel *channel, |
298 | struct efx_rx_buffer *rx_buf, | |
299 | unsigned int n_frags) | |
300 | { | |
301 | struct efx_rx_queue *rx_queue = efx_channel_get_rx_queue(channel); | |
302 | ||
303 | efx_recycle_rx_pages(channel, rx_buf, n_frags); | |
304 | ||
305 | do { | |
306 | efx_free_rx_buffer(rx_buf); | |
307 | rx_buf = efx_rx_buf_next(rx_queue, rx_buf); | |
308 | } while (--n_frags); | |
309 | } | |
310 | ||
8ceee660 BH |
311 | /** |
312 | * efx_fast_push_rx_descriptors - push new RX descriptors quickly | |
313 | * @rx_queue: RX descriptor queue | |
49ce9c2c | 314 | * |
8ceee660 | 315 | * This will aim to fill the RX descriptor queue up to |
da9ca505 | 316 | * @rx_queue->@max_fill. If there is insufficient atomic |
90d683af SH |
317 | * memory to do so, a slow fill will be scheduled. |
318 | * | |
319 | * The caller must provide serialisation (none is used here). In practise, | |
320 | * this means this function must run from the NAPI handler, or be called | |
321 | * when NAPI is disabled. | |
8ceee660 | 322 | */ |
90d683af | 323 | void efx_fast_push_rx_descriptors(struct efx_rx_queue *rx_queue) |
8ceee660 | 324 | { |
1648a23f DP |
325 | struct efx_nic *efx = rx_queue->efx; |
326 | unsigned int fill_level, batch_size; | |
f7d6f379 | 327 | int space, rc = 0; |
8ceee660 | 328 | |
90d683af | 329 | /* Calculate current fill level, and exit if we don't need to fill */ |
8ceee660 | 330 | fill_level = (rx_queue->added_count - rx_queue->removed_count); |
ecc910f5 | 331 | EFX_BUG_ON_PARANOID(fill_level > rx_queue->efx->rxq_entries); |
8ceee660 | 332 | if (fill_level >= rx_queue->fast_fill_trigger) |
24455800 | 333 | goto out; |
8ceee660 BH |
334 | |
335 | /* Record minimum fill level */ | |
b3475645 | 336 | if (unlikely(fill_level < rx_queue->min_fill)) { |
8ceee660 BH |
337 | if (fill_level) |
338 | rx_queue->min_fill = fill_level; | |
b3475645 | 339 | } |
8ceee660 | 340 | |
1648a23f | 341 | batch_size = efx->rx_pages_per_batch * efx->rx_bufs_per_page; |
da9ca505 | 342 | space = rx_queue->max_fill - fill_level; |
1648a23f | 343 | EFX_BUG_ON_PARANOID(space < batch_size); |
8ceee660 | 344 | |
62776d03 BH |
345 | netif_vdbg(rx_queue->efx, rx_status, rx_queue->efx->net_dev, |
346 | "RX queue %d fast-filling descriptor ring from" | |
97d48a10 | 347 | " level %d to level %d\n", |
ba1e8a35 | 348 | efx_rx_queue_index(rx_queue), fill_level, |
97d48a10 AR |
349 | rx_queue->max_fill); |
350 | ||
8ceee660 BH |
351 | |
352 | do { | |
97d48a10 | 353 | rc = efx_init_rx_buffers(rx_queue); |
f7d6f379 SH |
354 | if (unlikely(rc)) { |
355 | /* Ensure that we don't leave the rx queue empty */ | |
356 | if (rx_queue->added_count == rx_queue->removed_count) | |
357 | efx_schedule_slow_fill(rx_queue); | |
358 | goto out; | |
8ceee660 | 359 | } |
1648a23f | 360 | } while ((space -= batch_size) >= batch_size); |
8ceee660 | 361 | |
62776d03 BH |
362 | netif_vdbg(rx_queue->efx, rx_status, rx_queue->efx->net_dev, |
363 | "RX queue %d fast-filled descriptor ring " | |
ba1e8a35 | 364 | "to level %d\n", efx_rx_queue_index(rx_queue), |
62776d03 | 365 | rx_queue->added_count - rx_queue->removed_count); |
8ceee660 BH |
366 | |
367 | out: | |
24455800 SH |
368 | if (rx_queue->notified_count != rx_queue->added_count) |
369 | efx_nic_notify_rx_desc(rx_queue); | |
8ceee660 BH |
370 | } |
371 | ||
90d683af | 372 | void efx_rx_slow_fill(unsigned long context) |
8ceee660 | 373 | { |
90d683af | 374 | struct efx_rx_queue *rx_queue = (struct efx_rx_queue *)context; |
8ceee660 | 375 | |
90d683af | 376 | /* Post an event to cause NAPI to run and refill the queue */ |
2ae75dac | 377 | efx_nic_generate_fill_event(rx_queue); |
8ceee660 | 378 | ++rx_queue->slow_fill_count; |
8ceee660 BH |
379 | } |
380 | ||
4d566063 BH |
381 | static void efx_rx_packet__check_len(struct efx_rx_queue *rx_queue, |
382 | struct efx_rx_buffer *rx_buf, | |
97d48a10 | 383 | int len) |
8ceee660 BH |
384 | { |
385 | struct efx_nic *efx = rx_queue->efx; | |
386 | unsigned max_len = rx_buf->len - efx->type->rx_buffer_padding; | |
387 | ||
388 | if (likely(len <= max_len)) | |
389 | return; | |
390 | ||
391 | /* The packet must be discarded, but this is only a fatal error | |
392 | * if the caller indicated it was | |
393 | */ | |
db339569 | 394 | rx_buf->flags |= EFX_RX_PKT_DISCARD; |
8ceee660 BH |
395 | |
396 | if ((len > rx_buf->len) && EFX_WORKAROUND_8071(efx)) { | |
62776d03 BH |
397 | if (net_ratelimit()) |
398 | netif_err(efx, rx_err, efx->net_dev, | |
399 | " RX queue %d seriously overlength " | |
400 | "RX event (0x%x > 0x%x+0x%x). Leaking\n", | |
ba1e8a35 | 401 | efx_rx_queue_index(rx_queue), len, max_len, |
62776d03 | 402 | efx->type->rx_buffer_padding); |
8ceee660 BH |
403 | efx_schedule_reset(efx, RESET_TYPE_RX_RECOVERY); |
404 | } else { | |
62776d03 BH |
405 | if (net_ratelimit()) |
406 | netif_err(efx, rx_err, efx->net_dev, | |
407 | " RX queue %d overlength RX event " | |
408 | "(0x%x > 0x%x)\n", | |
ba1e8a35 | 409 | efx_rx_queue_index(rx_queue), len, max_len); |
8ceee660 BH |
410 | } |
411 | ||
ba1e8a35 | 412 | efx_rx_queue_channel(rx_queue)->n_rx_overlength++; |
8ceee660 BH |
413 | } |
414 | ||
61321d92 BH |
415 | /* Pass a received packet up through GRO. GRO can handle pages |
416 | * regardless of checksum state and skbs with a good checksum. | |
8ceee660 | 417 | */ |
85740cdf BH |
418 | static void |
419 | efx_rx_packet_gro(struct efx_channel *channel, struct efx_rx_buffer *rx_buf, | |
420 | unsigned int n_frags, u8 *eh) | |
8ceee660 | 421 | { |
da3bc071 | 422 | struct napi_struct *napi = &channel->napi_str; |
18e1d2be | 423 | gro_result_t gro_result; |
97d48a10 | 424 | struct efx_nic *efx = channel->efx; |
97d48a10 | 425 | struct sk_buff *skb; |
8ceee660 | 426 | |
97d48a10 | 427 | skb = napi_get_frags(napi); |
85740cdf BH |
428 | if (unlikely(!skb)) { |
429 | while (n_frags--) { | |
430 | put_page(rx_buf->page); | |
431 | rx_buf->page = NULL; | |
432 | rx_buf = efx_rx_buf_next(&channel->rx_queue, rx_buf); | |
433 | } | |
97d48a10 AR |
434 | return; |
435 | } | |
76620aaf | 436 | |
97d48a10 AR |
437 | if (efx->net_dev->features & NETIF_F_RXHASH) |
438 | skb->rxhash = efx_rx_buf_hash(eh); | |
97d48a10 AR |
439 | skb->ip_summed = ((rx_buf->flags & EFX_RX_PKT_CSUMMED) ? |
440 | CHECKSUM_UNNECESSARY : CHECKSUM_NONE); | |
8ceee660 | 441 | |
85740cdf BH |
442 | for (;;) { |
443 | skb_fill_page_desc(skb, skb_shinfo(skb)->nr_frags, | |
444 | rx_buf->page, rx_buf->page_offset, | |
445 | rx_buf->len); | |
446 | rx_buf->page = NULL; | |
447 | skb->len += rx_buf->len; | |
448 | if (skb_shinfo(skb)->nr_frags == n_frags) | |
449 | break; | |
3eadb7b0 | 450 | |
85740cdf BH |
451 | rx_buf = efx_rx_buf_next(&channel->rx_queue, rx_buf); |
452 | } | |
453 | ||
454 | skb->data_len = skb->len; | |
455 | skb->truesize += n_frags * efx->rx_buffer_truesize; | |
456 | ||
457 | skb_record_rx_queue(skb, channel->rx_queue.core_index); | |
8ceee660 | 458 | |
85740cdf | 459 | gro_result = napi_gro_frags(napi); |
97d48a10 AR |
460 | if (gro_result != GRO_DROP) |
461 | channel->irq_mod_score += 2; | |
462 | } | |
1241e951 | 463 | |
85740cdf | 464 | /* Allocate and construct an SKB around page fragments */ |
97d48a10 AR |
465 | static struct sk_buff *efx_rx_mk_skb(struct efx_channel *channel, |
466 | struct efx_rx_buffer *rx_buf, | |
85740cdf | 467 | unsigned int n_frags, |
97d48a10 AR |
468 | u8 *eh, int hdr_len) |
469 | { | |
470 | struct efx_nic *efx = channel->efx; | |
471 | struct sk_buff *skb; | |
18e1d2be | 472 | |
97d48a10 AR |
473 | /* Allocate an SKB to store the headers */ |
474 | skb = netdev_alloc_skb(efx->net_dev, hdr_len + EFX_PAGE_SKB_ALIGN); | |
475 | if (unlikely(skb == NULL)) | |
476 | return NULL; | |
477 | ||
478 | EFX_BUG_ON_PARANOID(rx_buf->len < hdr_len); | |
479 | ||
480 | skb_reserve(skb, EFX_PAGE_SKB_ALIGN); | |
85740cdf | 481 | memcpy(__skb_put(skb, hdr_len), eh, hdr_len); |
97d48a10 | 482 | |
85740cdf | 483 | /* Append the remaining page(s) onto the frag list */ |
97d48a10 | 484 | if (rx_buf->len > hdr_len) { |
85740cdf BH |
485 | rx_buf->page_offset += hdr_len; |
486 | rx_buf->len -= hdr_len; | |
487 | ||
488 | for (;;) { | |
489 | skb_fill_page_desc(skb, skb_shinfo(skb)->nr_frags, | |
490 | rx_buf->page, rx_buf->page_offset, | |
491 | rx_buf->len); | |
492 | rx_buf->page = NULL; | |
493 | skb->len += rx_buf->len; | |
494 | skb->data_len += rx_buf->len; | |
495 | if (skb_shinfo(skb)->nr_frags == n_frags) | |
496 | break; | |
497 | ||
498 | rx_buf = efx_rx_buf_next(&channel->rx_queue, rx_buf); | |
499 | } | |
97d48a10 AR |
500 | } else { |
501 | __free_pages(rx_buf->page, efx->rx_buffer_order); | |
85740cdf BH |
502 | rx_buf->page = NULL; |
503 | n_frags = 0; | |
18e1d2be | 504 | } |
97d48a10 | 505 | |
85740cdf | 506 | skb->truesize += n_frags * efx->rx_buffer_truesize; |
97d48a10 AR |
507 | |
508 | /* Move past the ethernet header */ | |
509 | skb->protocol = eth_type_trans(skb, efx->net_dev); | |
510 | ||
511 | return skb; | |
8ceee660 BH |
512 | } |
513 | ||
8ceee660 | 514 | void efx_rx_packet(struct efx_rx_queue *rx_queue, unsigned int index, |
85740cdf | 515 | unsigned int n_frags, unsigned int len, u16 flags) |
8ceee660 BH |
516 | { |
517 | struct efx_nic *efx = rx_queue->efx; | |
ba1e8a35 | 518 | struct efx_channel *channel = efx_rx_queue_channel(rx_queue); |
8ceee660 | 519 | struct efx_rx_buffer *rx_buf; |
8ceee660 BH |
520 | |
521 | rx_buf = efx_rx_buffer(rx_queue, index); | |
179ea7f0 | 522 | rx_buf->flags |= flags; |
8ceee660 | 523 | |
85740cdf BH |
524 | /* Validate the number of fragments and completed length */ |
525 | if (n_frags == 1) { | |
526 | efx_rx_packet__check_len(rx_queue, rx_buf, len); | |
527 | } else if (unlikely(n_frags > EFX_RX_MAX_FRAGS) || | |
528 | unlikely(len <= (n_frags - 1) * EFX_RX_USR_BUF_SIZE) || | |
529 | unlikely(len > n_frags * EFX_RX_USR_BUF_SIZE) || | |
530 | unlikely(!efx->rx_scatter)) { | |
531 | /* If this isn't an explicit discard request, either | |
532 | * the hardware or the driver is broken. | |
533 | */ | |
534 | WARN_ON(!(len == 0 && rx_buf->flags & EFX_RX_PKT_DISCARD)); | |
535 | rx_buf->flags |= EFX_RX_PKT_DISCARD; | |
536 | } | |
8ceee660 | 537 | |
62776d03 | 538 | netif_vdbg(efx, rx_status, efx->net_dev, |
85740cdf | 539 | "RX queue %d received ids %x-%x len %d %s%s\n", |
ba1e8a35 | 540 | efx_rx_queue_index(rx_queue), index, |
85740cdf | 541 | (index + n_frags - 1) & rx_queue->ptr_mask, len, |
db339569 BH |
542 | (rx_buf->flags & EFX_RX_PKT_CSUMMED) ? " [SUMMED]" : "", |
543 | (rx_buf->flags & EFX_RX_PKT_DISCARD) ? " [DISCARD]" : ""); | |
8ceee660 | 544 | |
85740cdf BH |
545 | /* Discard packet, if instructed to do so. Process the |
546 | * previous receive first. | |
547 | */ | |
db339569 | 548 | if (unlikely(rx_buf->flags & EFX_RX_PKT_DISCARD)) { |
85740cdf | 549 | efx_rx_flush_packet(channel); |
1c6d3d1d | 550 | efx_discard_rx_packet(channel, rx_buf, n_frags); |
85740cdf | 551 | return; |
8ceee660 BH |
552 | } |
553 | ||
85740cdf BH |
554 | if (n_frags == 1) |
555 | rx_buf->len = len; | |
556 | ||
2768935a DP |
557 | /* Release and/or sync the DMA mapping - assumes all RX buffers |
558 | * consumed in-order per RX queue. | |
8ceee660 | 559 | */ |
2768935a | 560 | efx_sync_rx_buffer(efx, rx_buf, rx_buf->len); |
8ceee660 BH |
561 | |
562 | /* Prefetch nice and early so data will (hopefully) be in cache by | |
563 | * the time we look at it. | |
564 | */ | |
5036b7c7 | 565 | prefetch(efx_rx_buf_va(rx_buf)); |
8ceee660 | 566 | |
b74e3e8c | 567 | rx_buf->page_offset += efx->type->rx_buffer_hash_size; |
85740cdf BH |
568 | rx_buf->len -= efx->type->rx_buffer_hash_size; |
569 | ||
570 | if (n_frags > 1) { | |
571 | /* Release/sync DMA mapping for additional fragments. | |
572 | * Fix length for last fragment. | |
573 | */ | |
574 | unsigned int tail_frags = n_frags - 1; | |
575 | ||
576 | for (;;) { | |
577 | rx_buf = efx_rx_buf_next(rx_queue, rx_buf); | |
578 | if (--tail_frags == 0) | |
579 | break; | |
2768935a | 580 | efx_sync_rx_buffer(efx, rx_buf, EFX_RX_USR_BUF_SIZE); |
85740cdf BH |
581 | } |
582 | rx_buf->len = len - (n_frags - 1) * EFX_RX_USR_BUF_SIZE; | |
2768935a | 583 | efx_sync_rx_buffer(efx, rx_buf, rx_buf->len); |
85740cdf | 584 | } |
b74e3e8c | 585 | |
1c6d3d1d | 586 | /* All fragments have been DMA-synced, so recycle pages. */ |
2768935a | 587 | rx_buf = efx_rx_buffer(rx_queue, index); |
1c6d3d1d | 588 | efx_recycle_rx_pages(channel, rx_buf, n_frags); |
2768935a | 589 | |
8ceee660 BH |
590 | /* Pipeline receives so that we give time for packet headers to be |
591 | * prefetched into cache. | |
592 | */ | |
ff734ef4 | 593 | efx_rx_flush_packet(channel); |
85740cdf BH |
594 | channel->rx_pkt_n_frags = n_frags; |
595 | channel->rx_pkt_index = index; | |
8ceee660 BH |
596 | } |
597 | ||
97d48a10 | 598 | static void efx_rx_deliver(struct efx_channel *channel, u8 *eh, |
85740cdf BH |
599 | struct efx_rx_buffer *rx_buf, |
600 | unsigned int n_frags) | |
1ddceb4c BH |
601 | { |
602 | struct sk_buff *skb; | |
97d48a10 | 603 | u16 hdr_len = min_t(u16, rx_buf->len, EFX_SKB_HEADERS); |
1ddceb4c | 604 | |
85740cdf | 605 | skb = efx_rx_mk_skb(channel, rx_buf, n_frags, eh, hdr_len); |
97d48a10 | 606 | if (unlikely(skb == NULL)) { |
2768935a | 607 | efx_free_rx_buffer(rx_buf); |
97d48a10 AR |
608 | return; |
609 | } | |
610 | skb_record_rx_queue(skb, channel->rx_queue.core_index); | |
1ddceb4c BH |
611 | |
612 | /* Set the SKB flags */ | |
613 | skb_checksum_none_assert(skb); | |
614 | ||
c31e5f9f | 615 | if (channel->type->receive_skb) |
4a74dc65 | 616 | if (channel->type->receive_skb(channel, skb)) |
97d48a10 | 617 | return; |
4a74dc65 BH |
618 | |
619 | /* Pass the packet up */ | |
620 | netif_receive_skb(skb); | |
1ddceb4c BH |
621 | } |
622 | ||
8ceee660 | 623 | /* Handle a received packet. Second half: Touches packet payload. */ |
85740cdf | 624 | void __efx_rx_packet(struct efx_channel *channel) |
8ceee660 BH |
625 | { |
626 | struct efx_nic *efx = channel->efx; | |
85740cdf BH |
627 | struct efx_rx_buffer *rx_buf = |
628 | efx_rx_buffer(&channel->rx_queue, channel->rx_pkt_index); | |
b74e3e8c | 629 | u8 *eh = efx_rx_buf_va(rx_buf); |
604f6049 | 630 | |
3273c2e8 BH |
631 | /* If we're in loopback test, then pass the packet directly to the |
632 | * loopback layer, and free the rx_buf here | |
633 | */ | |
634 | if (unlikely(efx->loopback_selftest)) { | |
a526f140 | 635 | efx_loopback_rx_packet(efx, eh, rx_buf->len); |
2768935a | 636 | efx_free_rx_buffer(rx_buf); |
85740cdf | 637 | goto out; |
3273c2e8 BH |
638 | } |
639 | ||
abfe9039 | 640 | if (unlikely(!(efx->net_dev->features & NETIF_F_RXCSUM))) |
db339569 | 641 | rx_buf->flags &= ~EFX_RX_PKT_CSUMMED; |
ab3cf6d0 | 642 | |
97d48a10 | 643 | if (!channel->type->receive_skb) |
85740cdf | 644 | efx_rx_packet_gro(channel, rx_buf, channel->rx_pkt_n_frags, eh); |
1ddceb4c | 645 | else |
85740cdf BH |
646 | efx_rx_deliver(channel, eh, rx_buf, channel->rx_pkt_n_frags); |
647 | out: | |
648 | channel->rx_pkt_n_frags = 0; | |
8ceee660 BH |
649 | } |
650 | ||
651 | int efx_probe_rx_queue(struct efx_rx_queue *rx_queue) | |
652 | { | |
653 | struct efx_nic *efx = rx_queue->efx; | |
ecc910f5 | 654 | unsigned int entries; |
8ceee660 BH |
655 | int rc; |
656 | ||
ecc910f5 SH |
657 | /* Create the smallest power-of-two aligned ring */ |
658 | entries = max(roundup_pow_of_two(efx->rxq_entries), EFX_MIN_DMAQ_SIZE); | |
659 | EFX_BUG_ON_PARANOID(entries > EFX_MAX_DMAQ_SIZE); | |
660 | rx_queue->ptr_mask = entries - 1; | |
661 | ||
62776d03 | 662 | netif_dbg(efx, probe, efx->net_dev, |
ecc910f5 SH |
663 | "creating RX queue %d size %#x mask %#x\n", |
664 | efx_rx_queue_index(rx_queue), efx->rxq_entries, | |
665 | rx_queue->ptr_mask); | |
8ceee660 BH |
666 | |
667 | /* Allocate RX buffers */ | |
c2e4e25a | 668 | rx_queue->buffer = kcalloc(entries, sizeof(*rx_queue->buffer), |
ecc910f5 | 669 | GFP_KERNEL); |
8831da7b BH |
670 | if (!rx_queue->buffer) |
671 | return -ENOMEM; | |
8ceee660 | 672 | |
152b6a62 | 673 | rc = efx_nic_probe_rx(rx_queue); |
8831da7b BH |
674 | if (rc) { |
675 | kfree(rx_queue->buffer); | |
676 | rx_queue->buffer = NULL; | |
677 | } | |
2768935a | 678 | |
8ceee660 BH |
679 | return rc; |
680 | } | |
681 | ||
debd0034 | 682 | static void efx_init_rx_recycle_ring(struct efx_nic *efx, |
683 | struct efx_rx_queue *rx_queue) | |
2768935a DP |
684 | { |
685 | unsigned int bufs_in_recycle_ring, page_ring_size; | |
686 | ||
687 | /* Set the RX recycle ring size */ | |
688 | #ifdef CONFIG_PPC64 | |
689 | bufs_in_recycle_ring = EFX_RECYCLE_RING_SIZE_IOMMU; | |
690 | #else | |
691 | if (efx->pci_dev->dev.iommu_group) | |
692 | bufs_in_recycle_ring = EFX_RECYCLE_RING_SIZE_IOMMU; | |
693 | else | |
694 | bufs_in_recycle_ring = EFX_RECYCLE_RING_SIZE_NOIOMMU; | |
695 | #endif /* CONFIG_PPC64 */ | |
696 | ||
697 | page_ring_size = roundup_pow_of_two(bufs_in_recycle_ring / | |
698 | efx->rx_bufs_per_page); | |
699 | rx_queue->page_ring = kcalloc(page_ring_size, | |
700 | sizeof(*rx_queue->page_ring), GFP_KERNEL); | |
701 | rx_queue->page_ptr_mask = page_ring_size - 1; | |
702 | } | |
703 | ||
bc3c90a2 | 704 | void efx_init_rx_queue(struct efx_rx_queue *rx_queue) |
8ceee660 | 705 | { |
ecc910f5 | 706 | struct efx_nic *efx = rx_queue->efx; |
64235187 | 707 | unsigned int max_fill, trigger, max_trigger; |
8ceee660 | 708 | |
62776d03 | 709 | netif_dbg(rx_queue->efx, drv, rx_queue->efx->net_dev, |
ba1e8a35 | 710 | "initialising RX queue %d\n", efx_rx_queue_index(rx_queue)); |
8ceee660 BH |
711 | |
712 | /* Initialise ptr fields */ | |
713 | rx_queue->added_count = 0; | |
714 | rx_queue->notified_count = 0; | |
715 | rx_queue->removed_count = 0; | |
716 | rx_queue->min_fill = -1U; | |
2768935a DP |
717 | efx_init_rx_recycle_ring(efx, rx_queue); |
718 | ||
719 | rx_queue->page_remove = 0; | |
720 | rx_queue->page_add = rx_queue->page_ptr_mask + 1; | |
721 | rx_queue->page_recycle_count = 0; | |
722 | rx_queue->page_recycle_failed = 0; | |
723 | rx_queue->page_recycle_full = 0; | |
8ceee660 BH |
724 | |
725 | /* Initialise limit fields */ | |
ecc910f5 | 726 | max_fill = efx->rxq_entries - EFX_RXD_HEAD_ROOM; |
1648a23f DP |
727 | max_trigger = |
728 | max_fill - efx->rx_pages_per_batch * efx->rx_bufs_per_page; | |
64235187 DR |
729 | if (rx_refill_threshold != 0) { |
730 | trigger = max_fill * min(rx_refill_threshold, 100U) / 100U; | |
731 | if (trigger > max_trigger) | |
732 | trigger = max_trigger; | |
733 | } else { | |
734 | trigger = max_trigger; | |
735 | } | |
8ceee660 BH |
736 | |
737 | rx_queue->max_fill = max_fill; | |
738 | rx_queue->fast_fill_trigger = trigger; | |
8ceee660 BH |
739 | |
740 | /* Set up RX descriptor ring */ | |
9f2cb71c | 741 | rx_queue->enabled = true; |
152b6a62 | 742 | efx_nic_init_rx(rx_queue); |
8ceee660 BH |
743 | } |
744 | ||
745 | void efx_fini_rx_queue(struct efx_rx_queue *rx_queue) | |
746 | { | |
747 | int i; | |
2768935a | 748 | struct efx_nic *efx = rx_queue->efx; |
8ceee660 BH |
749 | struct efx_rx_buffer *rx_buf; |
750 | ||
62776d03 | 751 | netif_dbg(rx_queue->efx, drv, rx_queue->efx->net_dev, |
ba1e8a35 | 752 | "shutting down RX queue %d\n", efx_rx_queue_index(rx_queue)); |
8ceee660 | 753 | |
9f2cb71c BH |
754 | /* A flush failure might have left rx_queue->enabled */ |
755 | rx_queue->enabled = false; | |
756 | ||
90d683af | 757 | del_timer_sync(&rx_queue->slow_fill); |
152b6a62 | 758 | efx_nic_fini_rx(rx_queue); |
8ceee660 | 759 | |
2768935a | 760 | /* Release RX buffers from the current read ptr to the write ptr */ |
8ceee660 | 761 | if (rx_queue->buffer) { |
2768935a DP |
762 | for (i = rx_queue->removed_count; i < rx_queue->added_count; |
763 | i++) { | |
764 | unsigned index = i & rx_queue->ptr_mask; | |
765 | rx_buf = efx_rx_buffer(rx_queue, index); | |
8ceee660 BH |
766 | efx_fini_rx_buffer(rx_queue, rx_buf); |
767 | } | |
768 | } | |
2768935a DP |
769 | |
770 | /* Unmap and release the pages in the recycle ring. Remove the ring. */ | |
771 | for (i = 0; i <= rx_queue->page_ptr_mask; i++) { | |
772 | struct page *page = rx_queue->page_ring[i]; | |
773 | struct efx_rx_page_state *state; | |
774 | ||
775 | if (page == NULL) | |
776 | continue; | |
777 | ||
778 | state = page_address(page); | |
779 | dma_unmap_page(&efx->pci_dev->dev, state->dma_addr, | |
780 | PAGE_SIZE << efx->rx_buffer_order, | |
781 | DMA_FROM_DEVICE); | |
782 | put_page(page); | |
783 | } | |
784 | kfree(rx_queue->page_ring); | |
785 | rx_queue->page_ring = NULL; | |
8ceee660 BH |
786 | } |
787 | ||
788 | void efx_remove_rx_queue(struct efx_rx_queue *rx_queue) | |
789 | { | |
62776d03 | 790 | netif_dbg(rx_queue->efx, drv, rx_queue->efx->net_dev, |
ba1e8a35 | 791 | "destroying RX queue %d\n", efx_rx_queue_index(rx_queue)); |
8ceee660 | 792 | |
152b6a62 | 793 | efx_nic_remove_rx(rx_queue); |
8ceee660 BH |
794 | |
795 | kfree(rx_queue->buffer); | |
796 | rx_queue->buffer = NULL; | |
8ceee660 BH |
797 | } |
798 | ||
8ceee660 | 799 | |
8ceee660 BH |
800 | module_param(rx_refill_threshold, uint, 0444); |
801 | MODULE_PARM_DESC(rx_refill_threshold, | |
64235187 | 802 | "RX descriptor ring refill threshold (%)"); |
8ceee660 | 803 |