From: David Gibson <david@gibson.dropbear.id.au>
To: Laurent Vivier <lvivier@redhat.com>
Cc: passt-dev@passt.top
Subject: Re: [PATCH v2 02/10] tap: Make L4 sequence pools per-qpair for thread safety
Date: Mon, 3 Aug 2026 15:43:15 +1000 [thread overview]
Message-ID: <anAqcZdyr8c7ghS3@zatzit> (raw)
In-Reply-To: <20260731162329.3552800-3-lvivier@redhat.com>
[-- Attachment #1: Type: text/plain, Size: 4531 bytes --]
On Fri, Jul 31, 2026 at 06:23:21PM +0200, Laurent Vivier wrote:
> The L4 sequence arrays tap4_l4[] and tap6_l4[] are used to batch
> packets with the same L4 tuple within a single tap_handler() call.
> They are global, but tap_handler() can be called concurrently from
> different worker threads with different qpairs in vhost-user mode.
>
> Make these arrays per-qpair by adding a VHOST_USER_MAX_VQS/2 first
> dimension, indexed by the qpair parameter already available in
> tap4_handler() and tap6_handler().
>
> Update tap_sock_update_pool() to initialize all qpair*seq entries.
>
> Signed-off-by: Laurent Vivier <lvivier@redhat.com>
Reviewed-by: David Gibson <david@gibson.dropbear.id.au>
> ---
> tap.c | 32 +++++++++++++++++++-------------
> 1 file changed, 19 insertions(+), 13 deletions(-)
>
> diff --git a/tap.c b/tap.c
> index 6bba436f148f..25cde67538ac 100644
> --- a/tap.c
> +++ b/tap.c
> @@ -591,7 +591,7 @@ static struct tap4_l4_t {
> struct in_addr daddr;
>
> struct pool_l4_t p;
> -} tap4_l4[TAP_SEQS /* Arbitrary: TAP_MSGS in theory, so limit in users */];
> +} tap4_l4[VHOST_USER_MAX_VQS / 2][TAP_SEQS /* Arbitrary: TAP_MSGS in theory, so limit in users */];
>
> /**
> * struct l4_seq6_t - Message sequence for one protocol handler call, IPv6
> @@ -618,7 +618,7 @@ static struct tap6_l4_t {
> uint8_t hop_limit;
>
> struct pool_l4_t p;
> -} tap6_l4[TAP_SEQS /* Arbitrary: TAP_MSGS in theory, so limit in users */];
> +} tap6_l4[VHOST_USER_MAX_VQS / 2][TAP_SEQS /* Arbitrary: TAP_MSGS in theory, so limit in users */];
>
> /**
> * tap_packet_debug() - Print debug message for packet(s) from guest/tap
> @@ -838,7 +838,7 @@ resume:
> if (seq_count == TAP_SEQS)
> break; /* Resume after flushing if i < pool_tap4[qpair]->count */
>
> - for (seq = tap4_l4 + seq_count - 1; seq >= tap4_l4; seq--) {
> + for (seq = tap4_l4[qpair] + seq_count - 1; seq >= tap4_l4[qpair]; seq--) {
> if (L4_MATCH(iph, uh, seq)) {
> if (seq->p.count >= UIO_MAXIOV)
> seq = NULL;
> @@ -846,8 +846,8 @@ resume:
> }
> }
>
> - if (!seq || seq < tap4_l4) {
> - seq = tap4_l4 + seq_count++;
> + if (!seq || seq < tap4_l4[qpair]) {
> + seq = tap4_l4[qpair] + seq_count++;
> L4_SET(iph, uh, seq);
> pool_flush((struct pool *)&seq->p);
> }
> @@ -859,7 +859,7 @@ append:
> packet_add((struct pool *)&seq->p, &data);
> }
>
> - for (j = 0, seq = tap4_l4; j < seq_count; j++, seq++) {
> + for (j = 0, seq = tap4_l4[qpair]; j < seq_count; j++, seq++) {
> const struct pool *p = (const struct pool *)&seq->p;
> size_t k;
>
> @@ -1088,7 +1088,7 @@ resume:
> if (seq_count == TAP_SEQS)
> break; /* Resume after flushing if i < pool_tap6[qpair]->count */
>
> - for (seq = tap6_l4 + seq_count - 1; seq >= tap6_l4; seq--) {
> + for (seq = tap6_l4[qpair] + seq_count - 1; seq >= tap6_l4[qpair]; seq--) {
> if (L4_MATCH(ip6h, proto, uh, seq)) {
> if (seq->p.count >= UIO_MAXIOV)
> seq = NULL;
> @@ -1096,8 +1096,8 @@ resume:
> }
> }
>
> - if (!seq || seq < tap6_l4) {
> - seq = tap6_l4 + seq_count++;
> + if (!seq || seq < tap6_l4[qpair]) {
> + seq = tap6_l4[qpair] + seq_count++;
> L4_SET(ip6h, proto, uh, seq);
> pool_flush((struct pool *)&seq->p);
> }
> @@ -1109,7 +1109,7 @@ append:
> packet_add((struct pool *)&seq->p, &data);
> }
>
> - for (j = 0, seq = tap6_l4; j < seq_count; j++, seq++) {
> + for (j = 0, seq = tap6_l4[qpair]; j < seq_count; j++, seq++) {
> const struct pool *p = (const struct pool *)&seq->p;
> size_t k;
>
> @@ -1602,9 +1602,15 @@ static void tap_sock_update_pool(void *base, size_t size)
> pool_tap6[i] = (struct pool *)&pool_tap6_storage[i];
> }
>
> - for (i = 0; i < TAP_SEQS; i++) {
> - tap4_l4[i].p = PACKET_INIT(pool_l4, UIO_MAXIOV, base, size);
> - tap6_l4[i].p = PACKET_INIT(pool_l4, UIO_MAXIOV, base, size);
> + for (i = 0; i < VHOST_USER_MAX_VQS / 2; i++) {
> + unsigned int j;
> +
> + for (j = 0; j < TAP_SEQS; j++) {
> + tap4_l4[i][j].p = PACKET_INIT(pool_l4, UIO_MAXIOV,
> + base, size);
> + tap6_l4[i][j].p = PACKET_INIT(pool_l4, UIO_MAXIOV,
> + base, size);
> + }
> }
> }
>
> --
> 2.54.0
>
--
David Gibson (he or they) | I'll have my music baroque, and my code
david AT gibson.dropbear.id.au | minimalist, thank you, not the other way
| around.
http://www.ozlabs.org/~dgibson
[-- Attachment #2: signature.asc --]
[-- Type: application/pgp-signature, Size: 833 bytes --]
next prev parent reply other threads:[~2026-08-03 5:43 UTC|newest]
Thread overview: 22+ messages / expand[flat|nested] mbox.gz Atom feed top
2026-07-31 16:23 [PATCH v2 00/10] multithreading: Prepare data structures for concurrent queue pair workers Laurent Vivier
2026-07-31 16:23 ` [PATCH v2 01/10] tap: Convert packet pools to per-queue-pair arrays for multiqueue Laurent Vivier
2026-08-03 5:41 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 02/10] tap: Make L4 sequence pools per-qpair for thread safety Laurent Vivier
2026-08-03 5:43 ` David Gibson [this message]
2026-08-03 5:55 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 03/10] tcp: Make static buffers stack-local " Laurent Vivier
2026-08-03 5:59 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 04/10] udp_vu: Make virtqueue " Laurent Vivier
2026-08-03 6:00 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 05/10] flow: Make flow timer per-caller " Laurent Vivier
2026-08-03 6:11 ` David Gibson
2026-08-03 6:35 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 06/10] tcp: Make TCP timer state per-caller and guard global tasks Laurent Vivier
2026-08-03 6:40 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 07/10] tcp: Protect init socket pools with mutex for thread safety Laurent Vivier
2026-08-03 6:53 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 08/10] tcp: Extract tcp_timer_epoll_add() helper Laurent Vivier
2026-08-03 6:54 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 09/10] flow: Add locking, per-qpair filtering, and intermediate state handling Laurent Vivier
2026-08-03 9:58 ` David Gibson
2026-07-31 16:23 ` [PATCH v2 10/10] flow: Add lazy, lock-free flow migration between queue pairs Laurent Vivier
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=anAqcZdyr8c7ghS3@zatzit \
--to=david@gibson.dropbear.id.au \
--cc=lvivier@redhat.com \
--cc=passt-dev@passt.top \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
Code repositories for project(s) associated with this public inbox
https://passt.top/passt
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for IMAP folder(s).