Commit 68049a5f authored by Ioana Ciocoi Radulescu's avatar Ioana Ciocoi Radulescu Committed by David S. Miller

dpaa2-eth: Don't account Tx confirmation frames on NAPI poll

Until now, both Rx and Tx confirmation frames handled during
NAPI poll were counted toward the NAPI budget. However, Tx
confirmations are lighter to process than Rx frames, which can
skew the amount of work actually done inside one NAPI cycle.

Update the code to only count Rx frames toward the NAPI budget
and set a separate threshold on how many Tx conf frames can be
processed in one poll cycle.

The NAPI poll routine stops when either the budget is consumed
by Rx frames or when Tx confirmation frames reach this threshold.
Signed-off-by: default avatarIoana Radulescu <ruxandra.radulescu@nxp.com>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent 9e19dabc
...@@ -289,10 +289,11 @@ static void dpaa2_eth_rx(struct dpaa2_eth_priv *priv, ...@@ -289,10 +289,11 @@ static void dpaa2_eth_rx(struct dpaa2_eth_priv *priv,
* *
* Observance of NAPI budget is not our concern, leaving that to the caller. * Observance of NAPI budget is not our concern, leaving that to the caller.
*/ */
static int consume_frames(struct dpaa2_eth_channel *ch) static int consume_frames(struct dpaa2_eth_channel *ch,
enum dpaa2_eth_fq_type *type)
{ {
struct dpaa2_eth_priv *priv = ch->priv; struct dpaa2_eth_priv *priv = ch->priv;
struct dpaa2_eth_fq *fq; struct dpaa2_eth_fq *fq = NULL;
struct dpaa2_dq *dq; struct dpaa2_dq *dq;
const struct dpaa2_fd *fd; const struct dpaa2_fd *fd;
int cleaned = 0; int cleaned = 0;
...@@ -311,12 +312,23 @@ static int consume_frames(struct dpaa2_eth_channel *ch) ...@@ -311,12 +312,23 @@ static int consume_frames(struct dpaa2_eth_channel *ch)
fd = dpaa2_dq_fd(dq); fd = dpaa2_dq_fd(dq);
fq = (struct dpaa2_eth_fq *)(uintptr_t)dpaa2_dq_fqd_ctx(dq); fq = (struct dpaa2_eth_fq *)(uintptr_t)dpaa2_dq_fqd_ctx(dq);
fq->stats.frames++;
fq->consume(priv, ch, fd, &ch->napi, fq->flowid); fq->consume(priv, ch, fd, &ch->napi, fq->flowid);
cleaned++; cleaned++;
} while (!is_last); } while (!is_last);
if (!cleaned)
return 0;
fq->stats.frames += cleaned;
ch->stats.frames += cleaned;
/* A dequeue operation only pulls frames from a single queue
* into the store. Return the frame queue type as an out param.
*/
if (type)
*type = fq->type;
return cleaned; return cleaned;
} }
...@@ -921,14 +933,16 @@ static int pull_channel(struct dpaa2_eth_channel *ch) ...@@ -921,14 +933,16 @@ static int pull_channel(struct dpaa2_eth_channel *ch)
static int dpaa2_eth_poll(struct napi_struct *napi, int budget) static int dpaa2_eth_poll(struct napi_struct *napi, int budget)
{ {
struct dpaa2_eth_channel *ch; struct dpaa2_eth_channel *ch;
int cleaned = 0, store_cleaned;
struct dpaa2_eth_priv *priv; struct dpaa2_eth_priv *priv;
int rx_cleaned = 0, txconf_cleaned = 0;
enum dpaa2_eth_fq_type type;
int store_cleaned;
int err; int err;
ch = container_of(napi, struct dpaa2_eth_channel, napi); ch = container_of(napi, struct dpaa2_eth_channel, napi);
priv = ch->priv; priv = ch->priv;
while (cleaned < budget) { do {
err = pull_channel(ch); err = pull_channel(ch);
if (unlikely(err)) if (unlikely(err))
break; break;
...@@ -936,30 +950,32 @@ static int dpaa2_eth_poll(struct napi_struct *napi, int budget) ...@@ -936,30 +950,32 @@ static int dpaa2_eth_poll(struct napi_struct *napi, int budget)
/* Refill pool if appropriate */ /* Refill pool if appropriate */
refill_pool(priv, ch, priv->bpid); refill_pool(priv, ch, priv->bpid);
store_cleaned = consume_frames(ch); store_cleaned = consume_frames(ch, &type);
cleaned += store_cleaned; if (type == DPAA2_RX_FQ)
rx_cleaned += store_cleaned;
else
txconf_cleaned += store_cleaned;
/* If we have enough budget left for a full store, /* If we either consumed the whole NAPI budget with Rx frames
* try a new pull dequeue, otherwise we're done here * or we reached the Tx confirmations threshold, we're done.
*/ */
if (store_cleaned == 0 || if (rx_cleaned >= budget ||
cleaned > budget - DPAA2_ETH_STORE_SIZE) txconf_cleaned >= DPAA2_ETH_TXCONF_PER_NAPI)
break; return budget;
} } while (store_cleaned);
if (cleaned < budget && napi_complete_done(napi, cleaned)) { /* We didn't consume the entire budget, so finish napi and
/* Re-enable data available notifications */ * re-enable data availability notifications
*/
napi_complete_done(napi, rx_cleaned);
do { do {
err = dpaa2_io_service_rearm(ch->dpio, &ch->nctx); err = dpaa2_io_service_rearm(ch->dpio, &ch->nctx);
cpu_relax(); cpu_relax();
} while (err == -EBUSY); } while (err == -EBUSY);
WARN_ONCE(err, "CDAN notifications rearm failed on core %d", WARN_ONCE(err, "CDAN notifications rearm failed on core %d",
ch->nctx.desired_cpu); ch->nctx.desired_cpu);
}
ch->stats.frames += cleaned;
return cleaned; return max(rx_cleaned, 1);
} }
static void enable_ch_napi(struct dpaa2_eth_priv *priv) static void enable_ch_napi(struct dpaa2_eth_priv *priv)
...@@ -1076,7 +1092,7 @@ static u32 drain_channel(struct dpaa2_eth_priv *priv, ...@@ -1076,7 +1092,7 @@ static u32 drain_channel(struct dpaa2_eth_priv *priv,
do { do {
pull_channel(ch); pull_channel(ch);
drained = consume_frames(ch); drained = consume_frames(ch, NULL);
total += drained; total += drained;
} while (drained); } while (drained);
......
...@@ -40,6 +40,11 @@ ...@@ -40,6 +40,11 @@
*/ */
#define DPAA2_ETH_TAILDROP_THRESH (64 * 1024) #define DPAA2_ETH_TAILDROP_THRESH (64 * 1024)
/* Maximum number of Tx confirmation frames to be processed
* in a single NAPI call
*/
#define DPAA2_ETH_TXCONF_PER_NAPI 256
/* Buffer quota per queue. Must be large enough such that for minimum sized /* Buffer quota per queue. Must be large enough such that for minimum sized
* frames taildrop kicks in before the bpool gets depleted, so we compute * frames taildrop kicks in before the bpool gets depleted, so we compute
* how many 64B frames fit inside the taildrop threshold and add a margin * how many 64B frames fit inside the taildrop threshold and add a margin
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment