netdev - Re: [PATCH net-next] net: sched: flower: use correct ht function to prevent duplicates

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <20190411101415.01842f3a@cakuba.netronome.com>
Date:   Thu, 11 Apr 2019 10:14:15 -0700
From:   Jakub Kicinski <jakub.kicinski@...ronome.com>
To:     Vlad Buslov <vladbu@...lanox.com>
Cc:     netdev@...r.kernel.org, jhs@...atatu.com, xiyou.wangcong@...il.com,
        jiri@...nulli.us, davem@...emloft.net, lucasb@...atatu.com,
        john.hurley@...ronome.com
Subject: Re: [PATCH net-next] net: sched: flower: use correct ht function to
 prevent duplicates

On Thu, 11 Apr 2019 19:12:20 +0300, Vlad Buslov wrote:
> Implementation of function rhashtable_insert_fast() check if its internal
> helper function __rhashtable_insert_fast() returns non-NULL pointer and
> seemingly return -EEXIST in such case. However, since
> __rhashtable_insert_fast() is called with NULL key pointer, it never
> actually checks for duplicates, which means that -EEXIST is never returned
> to the user. Use rhashtable_lookup_insert_fast() hash table API instead. In
> order to verify that it works as expected and prevent the problem from
> happening in future, extend tc-tests with new test that verifies that no
> new filters with existing key can be inserted to flower classifier.
> 
> Fixes: 1f17f7742eeb ("net: sched: flower: insert filter to ht before offloading it to hw")
> Signed-off-by: Vlad Buslov <vladbu@...lanox.com>

Ah, John just posted the same patch internally this morning..

Reviewed-by: Jakub Kicinski <jakub.kicinski@...ronome.com>