[PATCH] net/tap: Modified TAP BPF program as per the Kernel-version upgrade requirements.

[Stephen Hemminger]

On Fri, 12 Jan 2024 19:18:21 +0530
madhuker.mythri at oracle.com wrote:

> -	queue = rsskey->queues[(hash % rsskey->nb_queues) &
> -				       (TAP_MAX_QUEUES - 1)];
> -	skb->cb[1] = QUEUE_OFFSET + queue;
> -	/* printt(">>>>> rss_l3_l4 hash=0x%x queue=%u\n", hash, queue); */
> +	hash = (hash % rsskey->nb_queues) & (TAP_MAX_QUEUES - 1);
> +#pragma clang loop unroll(full)
> +	for (k = 0; k < TAP_MAX_QUEUES; k++) {
> +		if(k == hash)
> +			queue = rsskey->queues[k];
> +	}
>  

Why introduce another loop here. Original code was fine
and bounded.