tx_common.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /****************************************************************************
  3. * Driver for Solarflare network controllers and boards
  4. * Copyright 2018 Solarflare Communications Inc.
  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. #include "net_driver.h"
  11. #include "efx.h"
  12. #include "nic_common.h"
  13. #include "tx_common.h"
  14. #include <net/gso.h>
  15. static unsigned int efx_tx_cb_page_count(struct efx_tx_queue *tx_queue)
  16. {
  17. return DIV_ROUND_UP(tx_queue->ptr_mask + 1,
  18. PAGE_SIZE >> EFX_TX_CB_ORDER);
  19. }
  20. int efx_probe_tx_queue(struct efx_tx_queue *tx_queue)
  21. {
  22. struct efx_nic *efx = tx_queue->efx;
  23. unsigned int entries;
  24. int rc;
  25. /* Create the smallest power-of-two aligned ring */
  26. entries = max(roundup_pow_of_two(efx->txq_entries), EFX_MIN_DMAQ_SIZE);
  27. EFX_WARN_ON_PARANOID(entries > EFX_MAX_DMAQ_SIZE);
  28. tx_queue->ptr_mask = entries - 1;
  29. netif_dbg(efx, probe, efx->net_dev,
  30. "creating TX queue %d size %#x mask %#x\n",
  31. tx_queue->queue, efx->txq_entries, tx_queue->ptr_mask);
  32. /* Allocate software ring */
  33. tx_queue->buffer = kzalloc_objs(*tx_queue->buffer, entries);
  34. if (!tx_queue->buffer)
  35. return -ENOMEM;
  36. tx_queue->cb_page = kzalloc_objs(tx_queue->cb_page[0],
  37. efx_tx_cb_page_count(tx_queue));
  38. if (!tx_queue->cb_page) {
  39. rc = -ENOMEM;
  40. goto fail1;
  41. }
  42. /* Allocate hardware ring, determine TXQ type */
  43. rc = efx_nic_probe_tx(tx_queue);
  44. if (rc)
  45. goto fail2;
  46. tx_queue->channel->tx_queue_by_type[tx_queue->type] = tx_queue;
  47. return 0;
  48. fail2:
  49. kfree(tx_queue->cb_page);
  50. tx_queue->cb_page = NULL;
  51. fail1:
  52. kfree(tx_queue->buffer);
  53. tx_queue->buffer = NULL;
  54. return rc;
  55. }
  56. void efx_init_tx_queue(struct efx_tx_queue *tx_queue)
  57. {
  58. struct efx_nic *efx = tx_queue->efx;
  59. netif_dbg(efx, drv, efx->net_dev,
  60. "initialising TX queue %d\n", tx_queue->queue);
  61. tx_queue->insert_count = 0;
  62. tx_queue->notify_count = 0;
  63. tx_queue->write_count = 0;
  64. tx_queue->packet_write_count = 0;
  65. tx_queue->old_write_count = 0;
  66. tx_queue->read_count = 0;
  67. tx_queue->old_read_count = 0;
  68. tx_queue->empty_read_count = 0 | EFX_EMPTY_COUNT_VALID;
  69. tx_queue->xmit_pending = false;
  70. tx_queue->timestamping = (efx_ptp_use_mac_tx_timestamps(efx) &&
  71. tx_queue->channel == efx_ptp_channel(efx));
  72. tx_queue->completed_timestamp_major = 0;
  73. tx_queue->completed_timestamp_minor = 0;
  74. tx_queue->old_complete_packets = tx_queue->complete_packets;
  75. tx_queue->old_complete_bytes = tx_queue->complete_bytes;
  76. tx_queue->old_tso_bursts = tx_queue->tso_bursts;
  77. tx_queue->old_tso_packets = tx_queue->tso_packets;
  78. tx_queue->xdp_tx = efx_channel_is_xdp_tx(tx_queue->channel);
  79. tx_queue->tso_version = 0;
  80. /* Set up TX descriptor ring */
  81. efx_nic_init_tx(tx_queue);
  82. tx_queue->initialised = true;
  83. }
  84. void efx_fini_tx_queue(struct efx_tx_queue *tx_queue)
  85. {
  86. struct efx_tx_buffer *buffer;
  87. netif_dbg(tx_queue->efx, drv, tx_queue->efx->net_dev,
  88. "shutting down TX queue %d\n", tx_queue->queue);
  89. tx_queue->initialised = false;
  90. if (!tx_queue->buffer)
  91. return;
  92. /* Free any buffers left in the ring */
  93. while (tx_queue->read_count != tx_queue->write_count) {
  94. unsigned int xdp_pkts_compl = 0, xdp_bytes_compl = 0;
  95. unsigned int pkts_compl = 0, bytes_compl = 0;
  96. unsigned int efv_pkts_compl = 0;
  97. buffer = &tx_queue->buffer[tx_queue->read_count & tx_queue->ptr_mask];
  98. efx_dequeue_buffer(tx_queue, buffer, &pkts_compl, &bytes_compl,
  99. &efv_pkts_compl, &xdp_pkts_compl,
  100. &xdp_bytes_compl);
  101. ++tx_queue->read_count;
  102. }
  103. tx_queue->xmit_pending = false;
  104. netdev_tx_reset_queue(tx_queue->core_txq);
  105. }
  106. void efx_remove_tx_queue(struct efx_tx_queue *tx_queue)
  107. {
  108. int i;
  109. if (!tx_queue->buffer)
  110. return;
  111. netif_dbg(tx_queue->efx, drv, tx_queue->efx->net_dev,
  112. "destroying TX queue %d\n", tx_queue->queue);
  113. efx_nic_remove_tx(tx_queue);
  114. if (tx_queue->cb_page) {
  115. for (i = 0; i < efx_tx_cb_page_count(tx_queue); i++)
  116. efx_nic_free_buffer(tx_queue->efx,
  117. &tx_queue->cb_page[i]);
  118. kfree(tx_queue->cb_page);
  119. tx_queue->cb_page = NULL;
  120. }
  121. kfree(tx_queue->buffer);
  122. tx_queue->buffer = NULL;
  123. tx_queue->channel->tx_queue_by_type[tx_queue->type] = NULL;
  124. }
  125. void efx_dequeue_buffer(struct efx_tx_queue *tx_queue,
  126. struct efx_tx_buffer *buffer,
  127. unsigned int *pkts_compl,
  128. unsigned int *bytes_compl,
  129. unsigned int *efv_pkts_compl,
  130. unsigned int *xdp_pkts,
  131. unsigned int *xdp_bytes)
  132. {
  133. if (buffer->unmap_len) {
  134. struct device *dma_dev = &tx_queue->efx->pci_dev->dev;
  135. dma_addr_t unmap_addr = buffer->dma_addr - buffer->dma_offset;
  136. if (buffer->flags & EFX_TX_BUF_MAP_SINGLE)
  137. dma_unmap_single(dma_dev, unmap_addr, buffer->unmap_len,
  138. DMA_TO_DEVICE);
  139. else
  140. dma_unmap_page(dma_dev, unmap_addr, buffer->unmap_len,
  141. DMA_TO_DEVICE);
  142. buffer->unmap_len = 0;
  143. }
  144. if (buffer->flags & EFX_TX_BUF_SKB) {
  145. struct sk_buff *skb = (struct sk_buff *)buffer->skb;
  146. if (unlikely(buffer->flags & EFX_TX_BUF_EFV)) {
  147. EFX_WARN_ON_PARANOID(!efv_pkts_compl);
  148. (*efv_pkts_compl)++;
  149. } else {
  150. EFX_WARN_ON_PARANOID(!pkts_compl || !bytes_compl);
  151. (*pkts_compl)++;
  152. (*bytes_compl) += skb->len;
  153. }
  154. if (tx_queue->timestamping &&
  155. (tx_queue->completed_timestamp_major ||
  156. tx_queue->completed_timestamp_minor)) {
  157. struct skb_shared_hwtstamps hwtstamp;
  158. hwtstamp.hwtstamp =
  159. efx_ptp_nic_to_kernel_time(tx_queue);
  160. skb_tstamp_tx(skb, &hwtstamp);
  161. tx_queue->completed_timestamp_major = 0;
  162. tx_queue->completed_timestamp_minor = 0;
  163. }
  164. dev_consume_skb_any((struct sk_buff *)buffer->skb);
  165. netif_vdbg(tx_queue->efx, tx_done, tx_queue->efx->net_dev,
  166. "TX queue %d transmission id %x complete\n",
  167. tx_queue->queue, tx_queue->read_count);
  168. } else if (buffer->flags & EFX_TX_BUF_XDP) {
  169. xdp_return_frame_rx_napi(buffer->xdpf);
  170. if (xdp_pkts)
  171. (*xdp_pkts)++;
  172. if (xdp_bytes)
  173. (*xdp_bytes) += buffer->xdpf->len;
  174. }
  175. buffer->len = 0;
  176. buffer->flags = 0;
  177. }
  178. /* Remove packets from the TX queue
  179. *
  180. * This removes packets from the TX queue, up to and including the
  181. * specified index.
  182. */
  183. static void efx_dequeue_buffers(struct efx_tx_queue *tx_queue,
  184. unsigned int index,
  185. unsigned int *pkts_compl,
  186. unsigned int *bytes_compl,
  187. unsigned int *efv_pkts_compl,
  188. unsigned int *xdp_pkts,
  189. unsigned int *xdp_bytes)
  190. {
  191. struct efx_nic *efx = tx_queue->efx;
  192. unsigned int stop_index, read_ptr;
  193. stop_index = (index + 1) & tx_queue->ptr_mask;
  194. read_ptr = tx_queue->read_count & tx_queue->ptr_mask;
  195. while (read_ptr != stop_index) {
  196. struct efx_tx_buffer *buffer = &tx_queue->buffer[read_ptr];
  197. if (!efx_tx_buffer_in_use(buffer)) {
  198. netif_err(efx, tx_err, efx->net_dev,
  199. "TX queue %d spurious TX completion id %d\n",
  200. tx_queue->queue, read_ptr);
  201. efx_schedule_reset(efx, RESET_TYPE_TX_SKIP);
  202. return;
  203. }
  204. efx_dequeue_buffer(tx_queue, buffer, pkts_compl, bytes_compl,
  205. efv_pkts_compl, xdp_pkts, xdp_bytes);
  206. ++tx_queue->read_count;
  207. read_ptr = tx_queue->read_count & tx_queue->ptr_mask;
  208. }
  209. }
  210. void efx_xmit_done_check_empty(struct efx_tx_queue *tx_queue)
  211. {
  212. if ((int)(tx_queue->read_count - tx_queue->old_write_count) >= 0) {
  213. tx_queue->old_write_count = READ_ONCE(tx_queue->write_count);
  214. if (tx_queue->read_count == tx_queue->old_write_count) {
  215. /* Ensure that read_count is flushed. */
  216. smp_mb();
  217. tx_queue->empty_read_count =
  218. tx_queue->read_count | EFX_EMPTY_COUNT_VALID;
  219. }
  220. }
  221. }
  222. int efx_xmit_done(struct efx_tx_queue *tx_queue, unsigned int index)
  223. {
  224. unsigned int fill_level, pkts_compl = 0, bytes_compl = 0;
  225. unsigned int xdp_pkts_compl = 0, xdp_bytes_compl = 0;
  226. unsigned int efv_pkts_compl = 0;
  227. struct efx_nic *efx = tx_queue->efx;
  228. EFX_WARN_ON_ONCE_PARANOID(index > tx_queue->ptr_mask);
  229. efx_dequeue_buffers(tx_queue, index, &pkts_compl, &bytes_compl,
  230. &efv_pkts_compl, &xdp_pkts_compl, &xdp_bytes_compl);
  231. tx_queue->pkts_compl += pkts_compl;
  232. tx_queue->bytes_compl += bytes_compl;
  233. tx_queue->complete_xdp_packets += xdp_pkts_compl;
  234. tx_queue->complete_xdp_bytes += xdp_bytes_compl;
  235. if (pkts_compl + efv_pkts_compl > 1)
  236. ++tx_queue->merge_events;
  237. /* See if we need to restart the netif queue. This memory
  238. * barrier ensures that we write read_count (inside
  239. * efx_dequeue_buffers()) before reading the queue status.
  240. */
  241. smp_mb();
  242. if (unlikely(netif_tx_queue_stopped(tx_queue->core_txq)) &&
  243. likely(efx->port_enabled) &&
  244. likely(netif_device_present(efx->net_dev))) {
  245. fill_level = efx_channel_tx_fill_level(tx_queue->channel);
  246. if (fill_level <= efx->txq_wake_thresh)
  247. netif_tx_wake_queue(tx_queue->core_txq);
  248. }
  249. efx_xmit_done_check_empty(tx_queue);
  250. return pkts_compl + efv_pkts_compl;
  251. }
  252. /* Remove buffers put into a tx_queue for the current packet.
  253. * None of the buffers must have an skb attached.
  254. */
  255. void efx_enqueue_unwind(struct efx_tx_queue *tx_queue,
  256. unsigned int insert_count)
  257. {
  258. unsigned int xdp_bytes_compl = 0;
  259. unsigned int xdp_pkts_compl = 0;
  260. unsigned int efv_pkts_compl = 0;
  261. struct efx_tx_buffer *buffer;
  262. unsigned int bytes_compl = 0;
  263. unsigned int pkts_compl = 0;
  264. /* Work backwards until we hit the original insert pointer value */
  265. while (tx_queue->insert_count != insert_count) {
  266. --tx_queue->insert_count;
  267. buffer = __efx_tx_queue_get_insert_buffer(tx_queue);
  268. efx_dequeue_buffer(tx_queue, buffer, &pkts_compl, &bytes_compl,
  269. &efv_pkts_compl, &xdp_pkts_compl,
  270. &xdp_bytes_compl);
  271. }
  272. }
  273. struct efx_tx_buffer *efx_tx_map_chunk(struct efx_tx_queue *tx_queue,
  274. dma_addr_t dma_addr, size_t len)
  275. {
  276. const struct efx_nic_type *nic_type = tx_queue->efx->type;
  277. struct efx_tx_buffer *buffer;
  278. unsigned int dma_len;
  279. /* Map the fragment taking account of NIC-dependent DMA limits. */
  280. do {
  281. buffer = efx_tx_queue_get_insert_buffer(tx_queue);
  282. if (nic_type->tx_limit_len)
  283. dma_len = nic_type->tx_limit_len(tx_queue, dma_addr, len);
  284. else
  285. dma_len = len;
  286. buffer->len = dma_len;
  287. buffer->dma_addr = dma_addr;
  288. buffer->flags = EFX_TX_BUF_CONT;
  289. len -= dma_len;
  290. dma_addr += dma_len;
  291. ++tx_queue->insert_count;
  292. } while (len);
  293. return buffer;
  294. }
  295. int efx_tx_tso_header_length(struct sk_buff *skb)
  296. {
  297. size_t header_len;
  298. if (skb->encapsulation)
  299. header_len = skb_inner_transport_offset(skb) +
  300. (inner_tcp_hdr(skb)->doff << 2u);
  301. else
  302. header_len = skb_transport_offset(skb) +
  303. (tcp_hdr(skb)->doff << 2u);
  304. return header_len;
  305. }
  306. /* Map all data from an SKB for DMA and create descriptors on the queue. */
  307. int efx_tx_map_data(struct efx_tx_queue *tx_queue, struct sk_buff *skb,
  308. unsigned int segment_count)
  309. {
  310. struct efx_nic *efx = tx_queue->efx;
  311. struct device *dma_dev = &efx->pci_dev->dev;
  312. unsigned int frag_index, nr_frags;
  313. dma_addr_t dma_addr, unmap_addr;
  314. unsigned short dma_flags;
  315. size_t len, unmap_len;
  316. nr_frags = skb_shinfo(skb)->nr_frags;
  317. frag_index = 0;
  318. /* Map header data. */
  319. len = skb_headlen(skb);
  320. dma_addr = dma_map_single(dma_dev, skb->data, len, DMA_TO_DEVICE);
  321. dma_flags = EFX_TX_BUF_MAP_SINGLE;
  322. unmap_len = len;
  323. unmap_addr = dma_addr;
  324. if (unlikely(dma_mapping_error(dma_dev, dma_addr)))
  325. return -EIO;
  326. if (segment_count) {
  327. /* For TSO we need to put the header in to a separate
  328. * descriptor. Map this separately if necessary.
  329. */
  330. size_t header_len = efx_tx_tso_header_length(skb);
  331. if (header_len != len) {
  332. tx_queue->tso_long_headers++;
  333. efx_tx_map_chunk(tx_queue, dma_addr, header_len);
  334. len -= header_len;
  335. dma_addr += header_len;
  336. }
  337. }
  338. /* Add descriptors for each fragment. */
  339. do {
  340. struct efx_tx_buffer *buffer;
  341. skb_frag_t *fragment;
  342. buffer = efx_tx_map_chunk(tx_queue, dma_addr, len);
  343. /* The final descriptor for a fragment is responsible for
  344. * unmapping the whole fragment.
  345. */
  346. buffer->flags = EFX_TX_BUF_CONT | dma_flags;
  347. buffer->unmap_len = unmap_len;
  348. buffer->dma_offset = buffer->dma_addr - unmap_addr;
  349. if (frag_index >= nr_frags) {
  350. /* Store SKB details with the final buffer for
  351. * the completion.
  352. */
  353. buffer->skb = skb;
  354. buffer->flags = EFX_TX_BUF_SKB | dma_flags;
  355. return 0;
  356. }
  357. /* Move on to the next fragment. */
  358. fragment = &skb_shinfo(skb)->frags[frag_index++];
  359. len = skb_frag_size(fragment);
  360. dma_addr = skb_frag_dma_map(dma_dev, fragment, 0, len,
  361. DMA_TO_DEVICE);
  362. dma_flags = 0;
  363. unmap_len = len;
  364. unmap_addr = dma_addr;
  365. if (unlikely(dma_mapping_error(dma_dev, dma_addr)))
  366. return -EIO;
  367. } while (1);
  368. }
  369. unsigned int efx_tx_max_skb_descs(struct efx_nic *efx)
  370. {
  371. /* Header and payload descriptor for each output segment, plus
  372. * one for every input fragment boundary within a segment
  373. */
  374. unsigned int max_descs = EFX_TSO_MAX_SEGS * 2 + MAX_SKB_FRAGS;
  375. /* Possibly one more per segment for option descriptors */
  376. if (efx_nic_rev(efx) >= EFX_REV_HUNT_A0)
  377. max_descs += EFX_TSO_MAX_SEGS;
  378. /* Possibly more for PCIe page boundaries within input fragments */
  379. if (PAGE_SIZE > EFX_PAGE_SIZE)
  380. max_descs += max_t(unsigned int, MAX_SKB_FRAGS,
  381. DIV_ROUND_UP(GSO_LEGACY_MAX_SIZE,
  382. EFX_PAGE_SIZE));
  383. return max_descs;
  384. }
  385. /*
  386. * Fallback to software TSO.
  387. *
  388. * This is used if we are unable to send a GSO packet through hardware TSO.
  389. * This should only ever happen due to per-queue restrictions - unsupported
  390. * packets should first be filtered by the feature flags.
  391. *
  392. * Returns 0 on success, error code otherwise.
  393. */
  394. int efx_tx_tso_fallback(struct efx_tx_queue *tx_queue, struct sk_buff *skb)
  395. {
  396. struct sk_buff *segments, *next;
  397. segments = skb_gso_segment(skb, 0);
  398. if (IS_ERR(segments))
  399. return PTR_ERR(segments);
  400. dev_consume_skb_any(skb);
  401. skb_list_walk_safe(segments, skb, next) {
  402. skb_mark_not_on_list(skb);
  403. efx_enqueue_skb(tx_queue, skb);
  404. }
  405. return 0;
  406. }