Hi Stephen,
On 17/10/2024 04:23, Stephen Hemminger wrote:
On Wed, 16 Oct 2024 17:28:17 +0100
"Medvedkin, Vladimir" wrote:
Hi Stephen,
On 15/10/2024 23:29, Stephen Hemminger wrote:
On Fri, 11 Oct 2024 18:17:00 +
Vladimir Medvedkin wrote:
+
+uint32_t
+rte_thash_get_rand_poly(uint32_
On Wed, 16 Oct 2024 17:28:17 +0100
"Medvedkin, Vladimir" wrote:
> Hi Stephen,
>
> On 15/10/2024 23:29, Stephen Hemminger wrote:
> > On Fri, 11 Oct 2024 18:17:00 +
> > Vladimir Medvedkin wrote:
> >
> >> +
> >> +uint32_t
> >> +rte_thash_get_rand_poly(uint32_t poly_degree)
> >> +{
> >> + ui
Hi Stephen,
On 15/10/2024 23:29, Stephen Hemminger wrote:
On Fri, 11 Oct 2024 18:17:00 +
Vladimir Medvedkin wrote:
+
+uint32_t
+rte_thash_get_rand_poly(uint32_t poly_degree)
+{
+ uint32_t ret_poly;
+
+ if (poly_degree > 32)
+ return 0;
+
+ do
+
On Fri, 11 Oct 2024 18:17:00 +
Vladimir Medvedkin wrote:
> +
> +uint32_t
> +rte_thash_get_rand_poly(uint32_t poly_degree)
> +{
> + uint32_t ret_poly;
> +
> + if (poly_degree > 32)
> + return 0;
> +
> + do
> + ret_poly = __thash_get_rand_poly(poly_degree);
>
Current polynomial table has the following limitations:
1. It has polynomials up to degree 16
2. For each degree there are only 4 polynomials
The above results in less entropy when generating Toeplitz hash key
subsequences.
This patch replaces the current static table approach with dynamic
polyn
5 matches
Mail list logo