2018-03-20 07:58:10 -07:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
|
|
|
/* Copyright (c) 2018, Intel Corporation. */
|
|
|
|
|
|
|
|
#ifndef _ICE_TXRX_H_
|
|
|
|
#define _ICE_TXRX_H_
|
|
|
|
|
2019-11-04 09:38:56 -08:00
|
|
|
#include "ice_type.h"
|
|
|
|
|
2018-03-20 07:58:10 -07:00
|
|
|
#define ICE_DFLT_IRQ_WORK 256
|
2019-10-24 01:11:22 -07:00
|
|
|
#define ICE_RXBUF_3072 3072
|
2018-03-20 07:58:13 -07:00
|
|
|
#define ICE_RXBUF_2048 2048
|
2019-10-24 01:11:22 -07:00
|
|
|
#define ICE_RXBUF_1536 1536
|
2018-03-20 07:58:13 -07:00
|
|
|
#define ICE_MAX_CHAINED_RX_BUFS 5
|
2018-03-20 07:58:14 -07:00
|
|
|
#define ICE_MAX_BUF_TXD 8
|
|
|
|
#define ICE_MIN_TX_LEN 17
|
|
|
|
|
|
|
|
/* The size limit for a transmit buffer in a descriptor is (16K - 1).
|
|
|
|
* In order to align with the read requests we will align the value to
|
|
|
|
* the nearest 4K which represents our maximum read request size.
|
|
|
|
*/
|
|
|
|
#define ICE_MAX_READ_REQ_SIZE 4096
|
|
|
|
#define ICE_MAX_DATA_PER_TXD (16 * 1024 - 1)
|
|
|
|
#define ICE_MAX_DATA_PER_TXD_ALIGNED \
|
|
|
|
(~(ICE_MAX_READ_REQ_SIZE - 1) & ICE_MAX_DATA_PER_TXD)
|
|
|
|
|
|
|
|
#define ICE_RX_BUF_WRITE 16 /* Must be power of 2 */
|
2018-03-20 07:58:13 -07:00
|
|
|
#define ICE_MAX_TXQ_PER_TXQG 128
|
|
|
|
|
2019-10-24 01:11:23 -07:00
|
|
|
/* Attempt to maximize the headroom available for incoming frames. We use a 2K
|
|
|
|
* buffer for MTUs <= 1500 and need 1536/1534 to store the data for the frame.
|
|
|
|
* This leaves us with 512 bytes of room. From that we need to deduct the
|
|
|
|
* space needed for the shared info and the padding needed to IP align the
|
|
|
|
* frame.
|
|
|
|
*
|
|
|
|
* Note: For cache line sizes 256 or larger this value is going to end
|
2020-02-06 01:20:13 -08:00
|
|
|
* up negative. In these cases we should fall back to the legacy
|
|
|
|
* receive path.
|
2019-10-24 01:11:23 -07:00
|
|
|
*/
|
|
|
|
#if (PAGE_SIZE < 8192)
|
|
|
|
#define ICE_2K_TOO_SMALL_WITH_PADDING \
|
2020-05-15 17:36:38 -07:00
|
|
|
((unsigned int)(NET_SKB_PAD + ICE_RXBUF_1536) > \
|
|
|
|
SKB_WITH_OVERHEAD(ICE_RXBUF_2048))
|
2019-10-24 01:11:23 -07:00
|
|
|
|
|
|
|
/**
|
|
|
|
* ice_compute_pad - compute the padding
|
2020-09-25 15:24:37 -07:00
|
|
|
* @rx_buf_len: buffer length
|
2019-10-24 01:11:23 -07:00
|
|
|
*
|
|
|
|
* Figure out the size of half page based on given buffer length and
|
|
|
|
* then subtract the skb_shared_info followed by subtraction of the
|
|
|
|
* actual buffer length; this in turn results in the actual space that
|
|
|
|
* is left for padding usage
|
|
|
|
*/
|
|
|
|
static inline int ice_compute_pad(int rx_buf_len)
|
|
|
|
{
|
|
|
|
int half_page_size;
|
|
|
|
|
|
|
|
half_page_size = ALIGN(rx_buf_len, PAGE_SIZE / 2);
|
|
|
|
return SKB_WITH_OVERHEAD(half_page_size) - rx_buf_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* ice_skb_pad - determine the padding that we can supply
|
|
|
|
*
|
|
|
|
* Figure out the right Rx buffer size and based on that calculate the
|
|
|
|
* padding
|
|
|
|
*/
|
|
|
|
static inline int ice_skb_pad(void)
|
|
|
|
{
|
|
|
|
int rx_buf_len;
|
|
|
|
|
|
|
|
/* If a 2K buffer cannot handle a standard Ethernet frame then
|
|
|
|
* optimize padding for a 3K buffer instead of a 1.5K buffer.
|
|
|
|
*
|
|
|
|
* For a 3K buffer we need to add enough padding to allow for
|
|
|
|
* tailroom due to NET_IP_ALIGN possibly shifting us out of
|
|
|
|
* cache-line alignment.
|
|
|
|
*/
|
|
|
|
if (ICE_2K_TOO_SMALL_WITH_PADDING)
|
|
|
|
rx_buf_len = ICE_RXBUF_3072 + SKB_DATA_ALIGN(NET_IP_ALIGN);
|
|
|
|
else
|
|
|
|
rx_buf_len = ICE_RXBUF_1536;
|
|
|
|
|
|
|
|
/* if needed make room for NET_IP_ALIGN */
|
|
|
|
rx_buf_len -= NET_IP_ALIGN;
|
|
|
|
|
|
|
|
return ice_compute_pad(rx_buf_len);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define ICE_SKB_PAD ice_skb_pad()
|
|
|
|
#else
|
|
|
|
#define ICE_2K_TOO_SMALL_WITH_PADDING false
|
|
|
|
#define ICE_SKB_PAD (NET_SKB_PAD + NET_IP_ALIGN)
|
|
|
|
#endif
|
|
|
|
|
ice: Fix tx_timeout in PF driver
Prior to this commit the driver was running into tx_timeouts when a
queue was stressed enough. This was happening because the HW tail
and SW tail (NTU) were incorrectly out of sync. Consequently this was
causing the HW head to collide with the HW tail, which to the hardware
means that all descriptors posted for Tx have been processed.
Due to the Tx logic used in the driver SW tail and HW tail are allowed
to be out of sync. This is done as an optimization because it allows the
driver to write HW tail as infrequently as possible, while still
updating the SW tail index to keep track. However, there are situations
where this results in the tail never getting updated, resulting in Tx
timeouts.
Tx HW tail write condition:
if (netif_xmit_stopped(txring_txq(tx_ring) || !skb->xmit_more)
writel(sw_tail, tx_ring->tail);
An issue was found in the Tx logic that was causing the afore mentioned
condition for updating HW tail to never happen, causing tx_timeouts.
In ice_xmit_frame_ring we calculate how many descriptors we need for the
Tx transaction based on the skb the kernel hands us. This is then passed
into ice_maybe_stop_tx along with some extra padding to determine if we
have enough descriptors available for this transaction. If we don't then
we return -EBUSY to the stack, otherwise we move on and eventually
prepare the Tx descriptors accordingly in ice_tx_map and set
next_to_watch. In ice_tx_map we make another call to ice_maybe_stop_tx
with a value of MAX_SKB_FRAGS + 4. The key here is that this value is
possibly less than the value we sent in the first call to
ice_maybe_stop_tx in ice_xmit_frame_ring. Now, if the number of unused
descriptors is between MAX_SKB_FRAGS + 4 and the value used in the first
call to ice_maybe_stop_tx in ice_xmit_frame_ring then we do not update
the HW tail because of the "Tx HW tail write condition" above. This is
because in ice_maybe_stop_tx we return success from ice_maybe_stop_tx
instead of calling __ice_maybe_stop_tx and subsequently calling
netif_stop_subqueue, which sets the __QUEUE_STATE_DEV_XOFF bit. This
bit is then checked in the "Tx HW tail write condition" by calling
netif_xmit_stopped and subsequently updating HW tail if the
afore mentioned bit is set.
In ice_clean_tx_irq, if next_to_watch is not NULL, we end up cleaning
the descriptors that HW sets the DD bit on and we have the budget. The
HW head will eventually run into the HW tail in response to the
description in the paragraph above.
The next time through ice_xmit_frame_ring we make the initial call to
ice_maybe_stop_tx with another skb from the stack. This time we do not
have enough descriptors available and we return NETDEV_TX_BUSY to the
stack and end up setting next_to_watch to NULL.
This is where we are stuck. In ice_clean_tx_irq we never clean anything
because next_to_watch is always NULL and in ice_xmit_frame_ring we never
update HW tail because we already return NETDEV_TX_BUSY to the stack and
eventually we hit a tx_timeout.
This issue was fixed by making sure that the second call to
ice_maybe_stop_tx in ice_tx_map is passed a value that is >= the value
that was used on the initial call to ice_maybe_stop_tx in
ice_xmit_frame_ring. This was done by adding the following defines to
make the logic more clear and to reduce the chance of mucking this up
again:
ICE_CACHE_LINE_BYTES 64
ICE_DESCS_PER_CACHE_LINE (ICE_CACHE_LINE_BYTES / \
sizeof(struct ice_tx_desc))
ICE_DESCS_FOR_CTX_DESC 1
ICE_DESCS_FOR_SKB_DATA_PTR 1
The ICE_CACHE_LINE_BYTES being 64 is an assumption being made so we
don't have to figure this out on every pass through the Tx path. Instead
I added a sanity check in ice_probe to verify cache line size and print
a message if it's not 64 Bytes. This will make it easier to file issues
if they are seen when the cache line size is not 64 Bytes when reading
from the GLPCI_CNF2 register.
Signed-off-by: Brett Creeley <brett.creeley@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2018-10-26 10:40:58 -07:00
|
|
|
/* We are assuming that the cache line is always 64 Bytes here for ice.
|
|
|
|
* In order to make sure that is a correct assumption there is a check in probe
|
|
|
|
* to print a warning if the read from GLPCI_CNF2 tells us that the cache line
|
|
|
|
* size is 128 bytes. We do it this way because we do not want to read the
|
|
|
|
* GLPCI_CNF2 register or a variable containing the value on every pass through
|
|
|
|
* the Tx path.
|
|
|
|
*/
|
|
|
|
#define ICE_CACHE_LINE_BYTES 64
|
|
|
|
#define ICE_DESCS_PER_CACHE_LINE (ICE_CACHE_LINE_BYTES / \
|
|
|
|
sizeof(struct ice_tx_desc))
|
|
|
|
#define ICE_DESCS_FOR_CTX_DESC 1
|
|
|
|
#define ICE_DESCS_FOR_SKB_DATA_PTR 1
|
|
|
|
/* Tx descriptors needed, worst case */
|
|
|
|
#define DESC_NEEDED (MAX_SKB_FRAGS + ICE_DESCS_FOR_CTX_DESC + \
|
|
|
|
ICE_DESCS_PER_CACHE_LINE + ICE_DESCS_FOR_SKB_DATA_PTR)
|
2018-03-20 07:58:13 -07:00
|
|
|
#define ICE_DESC_UNUSED(R) \
|
2020-05-15 17:36:38 -07:00
|
|
|
(u16)((((R)->next_to_clean > (R)->next_to_use) ? 0 : (R)->count) + \
|
|
|
|
(R)->next_to_clean - (R)->next_to_use - 1)
|
2018-03-20 07:58:13 -07:00
|
|
|
|
2018-03-20 07:58:15 -07:00
|
|
|
#define ICE_TX_FLAGS_TSO BIT(0)
|
|
|
|
#define ICE_TX_FLAGS_HW_VLAN BIT(1)
|
|
|
|
#define ICE_TX_FLAGS_SW_VLAN BIT(2)
|
2020-05-11 18:01:40 -07:00
|
|
|
/* ICE_TX_FLAGS_DUMMY_PKT is used to mark dummy packets that should be
|
|
|
|
* freed instead of returned like skb packets.
|
|
|
|
*/
|
|
|
|
#define ICE_TX_FLAGS_DUMMY_PKT BIT(3)
|
ice: enable transmit timestamps for E810 devices
Add support for enabling Tx timestamp requests for outgoing packets on
E810 devices.
The ice hardware can support multiple outstanding Tx timestamp requests.
When sending a descriptor to hardware, a Tx timestamp request is made by
setting a request bit, and assigning an index that represents which Tx
timestamp index to store the timestamp in.
Hardware makes no effort to synchronize the index use, so it is up to
software to ensure that Tx timestamp indexes are not re-used before the
timestamp is reported back.
To do this, introduce a Tx timestamp tracker which will keep track of
currently in-use indexes.
In the hot path, if a packet has a timestamp request, an index will be
requested from the tracker. Unfortunately, this does require a lock as
the indexes are shared across all queues on a PHY. There are not enough
indexes to reliably assign only 1 to each queue.
For the E810 devices, the timestamp indexes are not shared across PHYs,
so each port can have its own tracking.
Once hardware captures a timestamp, an interrupt is fired. In this
interrupt, trigger a new work item that will figure out which timestamp
was completed, and report the timestamp back to the stack.
This function loops through the Tx timestamp indexes and checks whether
there is now a valid timestamp. If so, it clears the PHY timestamp
indication in the PHY memory, locks and removes the SKB and bit in the
tracker, then reports the timestamp to the stack.
It is possible in some cases that a timestamp request will be initiated
but never completed. This might occur if the packet is dropped by
software or hardware before it reaches the PHY.
Add a task to the periodic work function that will check whether
a timestamp request is more than a few seconds old. If so, the timestamp
index is cleared in the PHY, and the SKB is released.
Just as with Rx timestamps, the Tx timestamps are only 40 bits wide, and
use the same overall logic for extending to 64 bits of nanoseconds.
With this change, E810 devices should be able to perform basic PTP
functionality.
Future changes will extend the support to cover the E822-based devices.
Signed-off-by: Jacob Keller <jacob.e.keller@intel.com>
Tested-by: Tony Brelinski <tonyx.brelinski@intel.com>
Signed-off-by: Tony Nguyen <anthony.l.nguyen@intel.com>
2021-06-09 09:39:53 -07:00
|
|
|
#define ICE_TX_FLAGS_TSYN BIT(4)
|
2020-05-06 09:32:30 -07:00
|
|
|
#define ICE_TX_FLAGS_IPV4 BIT(5)
|
|
|
|
#define ICE_TX_FLAGS_IPV6 BIT(6)
|
|
|
|
#define ICE_TX_FLAGS_TUNNEL BIT(7)
|
2018-03-20 07:58:15 -07:00
|
|
|
#define ICE_TX_FLAGS_VLAN_M 0xffff0000
|
2019-02-28 15:24:28 -08:00
|
|
|
#define ICE_TX_FLAGS_VLAN_PR_M 0xe0000000
|
|
|
|
#define ICE_TX_FLAGS_VLAN_PR_S 29
|
2018-03-20 07:58:15 -07:00
|
|
|
#define ICE_TX_FLAGS_VLAN_S 16
|
|
|
|
|
2019-11-04 09:38:56 -08:00
|
|
|
#define ICE_XDP_PASS 0
|
|
|
|
#define ICE_XDP_CONSUMED BIT(0)
|
|
|
|
#define ICE_XDP_TX BIT(1)
|
|
|
|
#define ICE_XDP_REDIR BIT(2)
|
|
|
|
|
2019-02-13 10:51:07 -08:00
|
|
|
#define ICE_RX_DMA_ATTR \
|
|
|
|
(DMA_ATTR_SKIP_CPU_SYNC | DMA_ATTR_WEAK_ORDERING)
|
|
|
|
|
2019-11-04 09:38:56 -08:00
|
|
|
#define ICE_ETH_PKT_HDR_PAD (ETH_HLEN + ETH_FCS_LEN + (VLAN_HLEN * 2))
|
|
|
|
|
|
|
|
#define ICE_TXD_LAST_DESC_CMD (ICE_TX_DESC_CMD_EOP | ICE_TX_DESC_CMD_RS)
|
|
|
|
|
2018-03-20 07:58:13 -07:00
|
|
|
struct ice_tx_buf {
|
|
|
|
struct ice_tx_desc *next_to_watch;
|
2019-11-04 09:38:56 -08:00
|
|
|
union {
|
|
|
|
struct sk_buff *skb;
|
|
|
|
void *raw_buf; /* used for XDP */
|
|
|
|
};
|
2018-03-20 07:58:13 -07:00
|
|
|
unsigned int bytecount;
|
|
|
|
unsigned short gso_segs;
|
|
|
|
u32 tx_flags;
|
|
|
|
DEFINE_DMA_UNMAP_LEN(len);
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
DEFINE_DMA_UNMAP_ADDR(dma);
|
2018-03-20 07:58:13 -07:00
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:15 -07:00
|
|
|
struct ice_tx_offload_params {
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
u64 cd_qw1;
|
|
|
|
struct ice_ring *tx_ring;
|
2018-03-20 07:58:15 -07:00
|
|
|
u32 td_cmd;
|
|
|
|
u32 td_offset;
|
|
|
|
u32 td_l2tag1;
|
|
|
|
u32 cd_tunnel_params;
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
u16 cd_l2tag2;
|
|
|
|
u8 header_len;
|
2018-03-20 07:58:15 -07:00
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:13 -07:00
|
|
|
struct ice_rx_buf {
|
2019-11-04 09:38:56 -08:00
|
|
|
union {
|
|
|
|
struct {
|
2020-05-20 21:20:57 +02:00
|
|
|
dma_addr_t dma;
|
2019-11-04 09:38:56 -08:00
|
|
|
struct page *page;
|
|
|
|
unsigned int page_offset;
|
|
|
|
u16 pagecnt_bias;
|
|
|
|
};
|
|
|
|
struct {
|
2020-05-20 21:20:57 +02:00
|
|
|
struct xdp_buff *xdp;
|
2019-11-04 09:38:56 -08:00
|
|
|
};
|
|
|
|
};
|
2018-03-20 07:58:13 -07:00
|
|
|
};
|
2018-03-20 07:58:10 -07:00
|
|
|
|
2018-03-20 07:58:14 -07:00
|
|
|
struct ice_q_stats {
|
|
|
|
u64 pkts;
|
|
|
|
u64 bytes;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ice_txq_stats {
|
|
|
|
u64 restart_q;
|
|
|
|
u64 tx_busy;
|
|
|
|
u64 tx_linearize;
|
2018-08-09 06:29:53 -07:00
|
|
|
int prev_pkt; /* negative if no pending Tx descriptors */
|
2018-03-20 07:58:14 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
struct ice_rxq_stats {
|
|
|
|
u64 non_eop_descs;
|
|
|
|
u64 alloc_page_failed;
|
|
|
|
u64 alloc_buf_failed;
|
|
|
|
};
|
|
|
|
|
2021-03-02 10:12:02 -08:00
|
|
|
enum ice_ring_state_t {
|
|
|
|
ICE_TX_XPS_INIT_DONE,
|
|
|
|
ICE_TX_NBITS,
|
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:10 -07:00
|
|
|
/* this enum matches hardware bits and is meant to be used by DYN_CTLN
|
|
|
|
* registers and QINT registers or more generally anywhere in the manual
|
|
|
|
* mentioning ITR_INDX, ITR_NONE cannot be used as an index 'n' into any
|
|
|
|
* register but instead is a special value meaning "don't update" ITR0/1/2.
|
|
|
|
*/
|
|
|
|
enum ice_dyn_idx_t {
|
|
|
|
ICE_IDX_ITR0 = 0,
|
|
|
|
ICE_IDX_ITR1 = 1,
|
|
|
|
ICE_IDX_ITR2 = 2,
|
|
|
|
ICE_ITR_NONE = 3 /* ITR_NONE must not be used as an index */
|
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:13 -07:00
|
|
|
/* Header split modes defined by DTYPE field of Rx RLAN context */
|
|
|
|
enum ice_rx_dtype {
|
|
|
|
ICE_RX_DTYPE_NO_SPLIT = 0,
|
|
|
|
ICE_RX_DTYPE_HEADER_SPLIT = 1,
|
|
|
|
ICE_RX_DTYPE_SPLIT_ALWAYS = 2,
|
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:10 -07:00
|
|
|
/* indices into GLINT_ITR registers */
|
|
|
|
#define ICE_RX_ITR ICE_IDX_ITR0
|
2018-03-20 07:58:13 -07:00
|
|
|
#define ICE_TX_ITR ICE_IDX_ITR1
|
2018-12-19 10:03:29 -08:00
|
|
|
#define ICE_ITR_8K 124
|
2018-09-19 17:43:05 -07:00
|
|
|
#define ICE_ITR_20K 50
|
2021-03-31 14:16:59 -07:00
|
|
|
#define ICE_ITR_MAX 8160 /* 0x1FE0 */
|
|
|
|
#define ICE_DFLT_TX_ITR ICE_ITR_20K
|
|
|
|
#define ICE_DFLT_RX_ITR ICE_ITR_20K
|
|
|
|
enum ice_dynamic_itr {
|
|
|
|
ITR_STATIC = 0,
|
|
|
|
ITR_DYNAMIC = 1
|
|
|
|
};
|
|
|
|
|
|
|
|
#define ITR_IS_DYNAMIC(rc) ((rc)->itr_mode == ITR_DYNAMIC)
|
2019-02-19 15:04:10 -08:00
|
|
|
#define ICE_ITR_GRAN_S 1 /* ITR granularity is always 2us */
|
2019-02-08 12:50:55 -08:00
|
|
|
#define ICE_ITR_GRAN_US BIT(ICE_ITR_GRAN_S)
|
2018-12-19 10:03:29 -08:00
|
|
|
#define ICE_ITR_MASK 0x1FFE /* ITR register value alignment mask */
|
2020-02-13 13:31:23 -08:00
|
|
|
#define ITR_REG_ALIGN(setting) ((setting) & ICE_ITR_MASK)
|
2018-03-20 07:58:10 -07:00
|
|
|
|
2018-09-19 17:23:19 -07:00
|
|
|
#define ICE_DFLT_INTRL 0
|
2019-02-28 15:25:55 -08:00
|
|
|
#define ICE_MAX_INTRL 236
|
2018-03-20 07:58:10 -07:00
|
|
|
|
2019-07-25 01:55:32 -07:00
|
|
|
#define ICE_IN_WB_ON_ITR_MODE 255
|
|
|
|
/* Sets WB_ON_ITR and assumes INTENA bit is already cleared, which allows
|
|
|
|
* setting the MSK_M bit to tell hardware to ignore the INTENA_M bit. Also,
|
|
|
|
* set the write-back latency to the usecs passed in.
|
|
|
|
*/
|
|
|
|
#define ICE_GLINT_DYN_CTL_WB_ON_ITR(usecs, itr_idx) \
|
|
|
|
((((usecs) << (GLINT_DYN_CTL_INTERVAL_S - ICE_ITR_GRAN_S)) & \
|
|
|
|
GLINT_DYN_CTL_INTERVAL_M) | \
|
|
|
|
(((itr_idx) << GLINT_DYN_CTL_ITR_INDX_S) & \
|
|
|
|
GLINT_DYN_CTL_ITR_INDX_M) | GLINT_DYN_CTL_INTENA_MSK_M | \
|
|
|
|
GLINT_DYN_CTL_WB_ON_ITR_M)
|
|
|
|
|
2018-03-20 07:58:13 -07:00
|
|
|
/* Legacy or Advanced Mode Queue */
|
|
|
|
#define ICE_TX_ADVANCED 0
|
|
|
|
#define ICE_TX_LEGACY 1
|
|
|
|
|
2018-03-20 07:58:11 -07:00
|
|
|
/* descriptor ring, associated with a VSI */
|
|
|
|
struct ice_ring {
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
/* CL1 - 1st cacheline starts here */
|
2018-03-20 07:58:11 -07:00
|
|
|
struct ice_ring *next; /* pointer to next ring in q_vector */
|
2018-03-20 07:58:13 -07:00
|
|
|
void *desc; /* Descriptor ring memory */
|
2018-03-20 07:58:11 -07:00
|
|
|
struct device *dev; /* Used for DMA mapping */
|
|
|
|
struct net_device *netdev; /* netdev ring maps to */
|
|
|
|
struct ice_vsi *vsi; /* Backreference to associated VSI */
|
|
|
|
struct ice_q_vector *q_vector; /* Backreference to associated vector */
|
2018-03-20 07:58:13 -07:00
|
|
|
u8 __iomem *tail;
|
|
|
|
union {
|
|
|
|
struct ice_tx_buf *tx_buf;
|
|
|
|
struct ice_rx_buf *rx_buf;
|
|
|
|
};
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
/* CL2 - 2nd cacheline starts here */
|
2018-03-20 07:58:11 -07:00
|
|
|
u16 q_index; /* Queue number of ring */
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
u16 q_handle; /* Queue handle per TC */
|
|
|
|
|
2019-04-16 10:24:35 -07:00
|
|
|
u8 ring_active:1; /* is ring online or not */
|
2018-03-20 07:58:13 -07:00
|
|
|
|
2018-03-20 07:58:11 -07:00
|
|
|
u16 count; /* Number of descriptors */
|
|
|
|
u16 reg_idx; /* HW register index of the ring */
|
2018-03-20 07:58:13 -07:00
|
|
|
|
|
|
|
/* used in interrupt processing */
|
|
|
|
u16 next_to_use;
|
|
|
|
u16 next_to_clean;
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
u16 next_to_alloc;
|
2018-03-20 07:58:14 -07:00
|
|
|
|
|
|
|
/* stats structs */
|
|
|
|
struct ice_q_stats stats;
|
|
|
|
struct u64_stats_sync syncp;
|
|
|
|
union {
|
|
|
|
struct ice_txq_stats tx_stats;
|
|
|
|
struct ice_rxq_stats rx_stats;
|
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:11 -07:00
|
|
|
struct rcu_head rcu; /* to avoid race on free */
|
2021-03-02 10:12:02 -08:00
|
|
|
DECLARE_BITMAP(xps_state, ICE_TX_NBITS); /* XPS Config State */
|
2019-11-04 09:38:56 -08:00
|
|
|
struct bpf_prog *xdp_prog;
|
2020-08-28 10:26:15 +02:00
|
|
|
struct xsk_buff_pool *xsk_pool;
|
2021-01-18 16:13:17 +01:00
|
|
|
u16 rx_offset;
|
2019-11-04 09:38:56 -08:00
|
|
|
/* CL3 - 3rd cacheline starts here */
|
|
|
|
struct xdp_rxq_info xdp_rxq;
|
2021-01-18 16:13:12 +01:00
|
|
|
struct sk_buff *skb;
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
/* CLX - the below items are only accessed infrequently and should be
|
|
|
|
* in their own cache line if possible
|
|
|
|
*/
|
2019-11-04 09:38:56 -08:00
|
|
|
#define ICE_TX_FLAGS_RING_XDP BIT(0)
|
2019-10-24 01:11:23 -07:00
|
|
|
#define ICE_RX_FLAGS_RING_BUILD_SKB BIT(1)
|
2019-11-04 09:38:56 -08:00
|
|
|
u8 flags;
|
ice: Reorganize tx_buf and ring structs
Use more efficient structure ordering by using the pahole tool
and a lot of code inspection to get hot cache lines to have
packed data (no holes if possible) and adjacent warm data.
ice_ring prior to this change:
/* size: 192, cachelines: 3, members: 23 */
/* sum members: 158, holes: 4, sum holes: 12 */
/* padding: 22 */
ice_ring after this change:
/* size: 192, cachelines: 3, members: 25 */
/* sum members: 162, holes: 1, sum holes: 1 */
/* padding: 29 */
ice_tx_buf prior to this change:
/* size: 48, cachelines: 1, members: 7 */
/* sum members: 38, holes: 2, sum holes: 6 */
/* padding: 4 */
/* last cacheline: 48 bytes */
ice_tx_buf after this change:
/* size: 40, cachelines: 1, members: 7 */
/* sum members: 38, holes: 1, sum holes: 2 */
/* last cacheline: 40 bytes */
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Anirudh Venkataramanan <anirudh.venkataramanan@intel.com>
Tested-by: Andrew Bowers <andrewx.bowers@intel.com>
Signed-off-by: Jeff Kirsher <jeffrey.t.kirsher@intel.com>
2019-04-16 10:24:34 -07:00
|
|
|
dma_addr_t dma; /* physical address of ring */
|
|
|
|
unsigned int size; /* length of descriptor ring in bytes */
|
|
|
|
u32 txq_teid; /* Added Tx queue TEID */
|
|
|
|
u16 rx_buf_len;
|
|
|
|
u8 dcb_tc; /* Traffic class of ring */
|
ice: enable transmit timestamps for E810 devices
Add support for enabling Tx timestamp requests for outgoing packets on
E810 devices.
The ice hardware can support multiple outstanding Tx timestamp requests.
When sending a descriptor to hardware, a Tx timestamp request is made by
setting a request bit, and assigning an index that represents which Tx
timestamp index to store the timestamp in.
Hardware makes no effort to synchronize the index use, so it is up to
software to ensure that Tx timestamp indexes are not re-used before the
timestamp is reported back.
To do this, introduce a Tx timestamp tracker which will keep track of
currently in-use indexes.
In the hot path, if a packet has a timestamp request, an index will be
requested from the tracker. Unfortunately, this does require a lock as
the indexes are shared across all queues on a PHY. There are not enough
indexes to reliably assign only 1 to each queue.
For the E810 devices, the timestamp indexes are not shared across PHYs,
so each port can have its own tracking.
Once hardware captures a timestamp, an interrupt is fired. In this
interrupt, trigger a new work item that will figure out which timestamp
was completed, and report the timestamp back to the stack.
This function loops through the Tx timestamp indexes and checks whether
there is now a valid timestamp. If so, it clears the PHY timestamp
indication in the PHY memory, locks and removes the SKB and bit in the
tracker, then reports the timestamp to the stack.
It is possible in some cases that a timestamp request will be initiated
but never completed. This might occur if the packet is dropped by
software or hardware before it reaches the PHY.
Add a task to the periodic work function that will check whether
a timestamp request is more than a few seconds old. If so, the timestamp
index is cleared in the PHY, and the SKB is released.
Just as with Rx timestamps, the Tx timestamps are only 40 bits wide, and
use the same overall logic for extending to 64 bits of nanoseconds.
With this change, E810 devices should be able to perform basic PTP
functionality.
Future changes will extend the support to cover the E822-based devices.
Signed-off-by: Jacob Keller <jacob.e.keller@intel.com>
Tested-by: Tony Brelinski <tonyx.brelinski@intel.com>
Signed-off-by: Tony Nguyen <anthony.l.nguyen@intel.com>
2021-06-09 09:39:53 -07:00
|
|
|
struct ice_ptp_tx *tx_tstamps;
|
ice: enable receive hardware timestamping
Add SIOCGHWTSTAMP and SIOCSHWTSTAMP ioctl handlers to respond to
requests to enable timestamping support. If the request is for enabling
Rx timestamps, set a bit in the Rx descriptors to indicate that receive
timestamps should be reported.
Hardware captures receive timestamps in the PHY which only captures part
of the timer, and reports only 40 bits into the Rx descriptor. The upper
32 bits represent the contents of GLTSYN_TIME_L at the point of packet
reception, while the lower 8 bits represent the upper 8 bits of
GLTSYN_TIME_0.
The networking and PTP stack expect 64 bit timestamps in nanoseconds. To
support this, implement some logic to extend the timestamps by using the
full PHC time.
If the Rx timestamp was captured prior to the PHC time, then the real
timestamp is
PHC - (lower_32_bits(PHC) - timestamp)
If the Rx timestamp was captured after the PHC time, then the real
timestamp is
PHC + (timestamp - lower_32_bits(PHC))
These calculations are correct as long as neither the PHC timestamp nor
the Rx timestamps are more than 2^32-1 nanseconds old. Further, we can
detect when the Rx timestamp is before or after the PHC as long as the
PHC timestamp is no more than 2^31-1 nanoseconds old.
In that case, we calculate the delta between the lower 32 bits of the
PHC and the Rx timestamp. If it's larger than 2^31-1 then the Rx
timestamp must have been captured in the past. If it's smaller, then the
Rx timestamp must have been captured after PHC time.
Add an ice_ptp_extend_32b_ts function that relies on a cached copy of
the PHC time and implements this algorithm to calculate the proper upper
32bits of the Rx timestamps.
Cache the PHC time periodically in all of the Rx rings. This enables
each Rx ring to simply call the extension function with a recent copy of
the PHC time. By ensuring that the PHC time is kept up to date
periodically, we ensure this algorithm doesn't use stale data and
produce incorrect results.
To cache the time, introduce a kworker and a kwork item to periodically
store the Rx time. It might seem like we should use the .do_aux_work
interface of the PTP clock. This doesn't work because all PFs must cache
this time, but only one PF owns the PTP clock device.
Thus, the ice driver will manage its own kthread instead of relying on
the PTP do_aux_work handler.
With this change, the driver can now report Rx timestamps on all
incoming packets.
Signed-off-by: Jacob Keller <jacob.e.keller@intel.com>
Tested-by: Tony Brelinski <tonyx.brelinski@intel.com>
Signed-off-by: Tony Nguyen <anthony.l.nguyen@intel.com>
2021-06-09 09:39:52 -07:00
|
|
|
u64 cached_phctime;
|
|
|
|
u8 ptp_rx:1;
|
ice: enable transmit timestamps for E810 devices
Add support for enabling Tx timestamp requests for outgoing packets on
E810 devices.
The ice hardware can support multiple outstanding Tx timestamp requests.
When sending a descriptor to hardware, a Tx timestamp request is made by
setting a request bit, and assigning an index that represents which Tx
timestamp index to store the timestamp in.
Hardware makes no effort to synchronize the index use, so it is up to
software to ensure that Tx timestamp indexes are not re-used before the
timestamp is reported back.
To do this, introduce a Tx timestamp tracker which will keep track of
currently in-use indexes.
In the hot path, if a packet has a timestamp request, an index will be
requested from the tracker. Unfortunately, this does require a lock as
the indexes are shared across all queues on a PHY. There are not enough
indexes to reliably assign only 1 to each queue.
For the E810 devices, the timestamp indexes are not shared across PHYs,
so each port can have its own tracking.
Once hardware captures a timestamp, an interrupt is fired. In this
interrupt, trigger a new work item that will figure out which timestamp
was completed, and report the timestamp back to the stack.
This function loops through the Tx timestamp indexes and checks whether
there is now a valid timestamp. If so, it clears the PHY timestamp
indication in the PHY memory, locks and removes the SKB and bit in the
tracker, then reports the timestamp to the stack.
It is possible in some cases that a timestamp request will be initiated
but never completed. This might occur if the packet is dropped by
software or hardware before it reaches the PHY.
Add a task to the periodic work function that will check whether
a timestamp request is more than a few seconds old. If so, the timestamp
index is cleared in the PHY, and the SKB is released.
Just as with Rx timestamps, the Tx timestamps are only 40 bits wide, and
use the same overall logic for extending to 64 bits of nanoseconds.
With this change, E810 devices should be able to perform basic PTP
functionality.
Future changes will extend the support to cover the E822-based devices.
Signed-off-by: Jacob Keller <jacob.e.keller@intel.com>
Tested-by: Tony Brelinski <tonyx.brelinski@intel.com>
Signed-off-by: Tony Nguyen <anthony.l.nguyen@intel.com>
2021-06-09 09:39:53 -07:00
|
|
|
u8 ptp_tx:1;
|
2018-03-20 07:58:11 -07:00
|
|
|
} ____cacheline_internodealigned_in_smp;
|
|
|
|
|
2019-10-24 01:11:23 -07:00
|
|
|
static inline bool ice_ring_uses_build_skb(struct ice_ring *ring)
|
|
|
|
{
|
|
|
|
return !!(ring->flags & ICE_RX_FLAGS_RING_BUILD_SKB);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void ice_set_ring_build_skb_ena(struct ice_ring *ring)
|
|
|
|
{
|
|
|
|
ring->flags |= ICE_RX_FLAGS_RING_BUILD_SKB;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void ice_clear_ring_build_skb_ena(struct ice_ring *ring)
|
|
|
|
{
|
|
|
|
ring->flags &= ~ICE_RX_FLAGS_RING_BUILD_SKB;
|
|
|
|
}
|
|
|
|
|
2019-11-04 09:38:56 -08:00
|
|
|
static inline bool ice_ring_is_xdp(struct ice_ring *ring)
|
|
|
|
{
|
|
|
|
return !!(ring->flags & ICE_TX_FLAGS_RING_XDP);
|
|
|
|
}
|
|
|
|
|
2018-03-20 07:58:11 -07:00
|
|
|
struct ice_ring_container {
|
2018-12-19 10:03:29 -08:00
|
|
|
/* head of linked-list of rings */
|
2018-03-20 07:58:11 -07:00
|
|
|
struct ice_ring *ring;
|
ice: replace custom AIM algorithm with kernel's DIM library
The ice driver has support for adaptive interrupt moderation, an
algorithm for tuning the interrupt rate dynamically. This algorithm
is based on various assumptions about ring size, socket buffer size,
link speed, SKB overhead, ethernet frame overhead and more.
The Linux kernel has support for a dynamic interrupt moderation
algorithm known as "dimlib". Replace the custom driver-specific
implementation of dynamic interrupt moderation with the kernel's
algorithm.
The Intel hardware has a different hardware implementation than the
originators of the dimlib code had to work with, which requires the
driver to use a slightly different set of inputs for the actual
moderation values, while getting all the advice from dimlib of
better/worse, shift left or right.
The change made for this implementation is to use a pair of values
for each of the 5 "slots" that the dimlib moderation expects, and
the driver will program those pairs when dimlib recommends a slot to
use. The currently implementation uses two tables, one for receive
and one for transmit, and the pairs of values in each slot set the
maximum delay of an interrupt and a maximum number of interrupts per
second (both expressed in microseconds).
There are two separate kinds of bugs fixed by using DIMLIB, one is
UDP single stream send was too slow, and the other is that 8K
ping-pong was going to the most aggressive moderation and has much
too high latency.
The overall result of using DIMLIB is that we meet or exceed our
performance expectations set based on the old algorithm.
Co-developed-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Jesse Brandeburg <jesse.brandeburg@intel.com>
Signed-off-by: Jacob Keller <jacob.e.keller@intel.com>
Tested-by: Tony Brelinski <tonyx.brelinski@intel.com>
Signed-off-by: Tony Nguyen <anthony.l.nguyen@intel.com>
2021-03-31 14:16:57 -07:00
|
|
|
struct dim dim; /* data for net_dim algorithm */
|
2019-02-19 15:04:05 -08:00
|
|
|
u16 itr_idx; /* index in the interrupt vector */
|
2021-03-31 14:16:59 -07:00
|
|
|
/* this matches the maximum number of ITR bits, but in usec
|
|
|
|
* values, so it is shifted left one bit (bit zero is ignored)
|
2018-12-19 10:03:29 -08:00
|
|
|
*/
|
2021-03-31 14:16:59 -07:00
|
|
|
u16 itr_setting:13;
|
|
|
|
u16 itr_reserved:2;
|
|
|
|
u16 itr_mode:1;
|
2018-03-20 07:58:11 -07:00
|
|
|
};
|
|
|
|
|
2019-12-12 03:12:58 -08:00
|
|
|
struct ice_coalesce_stored {
|
|
|
|
u16 itr_tx;
|
|
|
|
u16 itr_rx;
|
|
|
|
u8 intrl;
|
2021-03-02 10:12:05 -08:00
|
|
|
u8 tx_valid;
|
|
|
|
u8 rx_valid;
|
2019-12-12 03:12:58 -08:00
|
|
|
};
|
|
|
|
|
2018-03-20 07:58:11 -07:00
|
|
|
/* iterator for handling rings in ring container */
|
|
|
|
#define ice_for_each_ring(pos, head) \
|
|
|
|
for (pos = (head).ring; pos; pos = pos->next)
|
|
|
|
|
2019-10-24 01:11:22 -07:00
|
|
|
static inline unsigned int ice_rx_pg_order(struct ice_ring *ring)
|
|
|
|
{
|
|
|
|
#if (PAGE_SIZE < 8192)
|
|
|
|
if (ring->rx_buf_len > (PAGE_SIZE / 2))
|
|
|
|
return 1;
|
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define ice_rx_pg_size(_ring) (PAGE_SIZE << ice_rx_pg_order(_ring))
|
|
|
|
|
2019-11-04 09:38:56 -08:00
|
|
|
union ice_32b_rx_flex_desc;
|
|
|
|
|
2018-03-20 07:58:13 -07:00
|
|
|
bool ice_alloc_rx_bufs(struct ice_ring *rxr, u16 cleaned_count);
|
2018-03-20 07:58:14 -07:00
|
|
|
netdev_tx_t ice_start_xmit(struct sk_buff *skb, struct net_device *netdev);
|
2018-03-20 07:58:13 -07:00
|
|
|
void ice_clean_tx_ring(struct ice_ring *tx_ring);
|
|
|
|
void ice_clean_rx_ring(struct ice_ring *rx_ring);
|
|
|
|
int ice_setup_tx_ring(struct ice_ring *tx_ring);
|
|
|
|
int ice_setup_rx_ring(struct ice_ring *rx_ring);
|
|
|
|
void ice_free_tx_ring(struct ice_ring *tx_ring);
|
|
|
|
void ice_free_rx_ring(struct ice_ring *rx_ring);
|
2018-03-20 07:58:14 -07:00
|
|
|
int ice_napi_poll(struct napi_struct *napi, int budget);
|
2020-05-11 18:01:42 -07:00
|
|
|
int
|
|
|
|
ice_prgm_fdir_fltr(struct ice_vsi *vsi, struct ice_fltr_desc *fdir_desc,
|
|
|
|
u8 *raw_packet);
|
2020-05-11 18:01:40 -07:00
|
|
|
int ice_clean_rx_irq(struct ice_ring *rx_ring, int budget);
|
|
|
|
void ice_clean_ctrl_tx_irq(struct ice_ring *tx_ring);
|
2018-03-20 07:58:10 -07:00
|
|
|
#endif /* _ICE_TXRX_H_ */
|