On Tue, Oct 17, 2023 at 1:17 PM Jakub Kicinski <kuba@xxxxxxxxxx> wrote: > > On Tue, 17 Oct 2023 11:37:52 -0700 Alexander Duyck wrote: > > > Algo is also a bit confusing, it's more like key pre-processing? > > > There's nothing toeplitz about xoring input fields. Works as well > > > for CRC32.. or XOR. > > > > I agree that the change to the algorithm doesn't necessarily have > > anything to do with toeplitz, however it is still a change to the > > algorithm by performing the extra XOR on the inputs prior to > > processing. That is why I figured it might make sense to just add a > > new hfunc value that would mean toeplitz w/ symmetric XOR. > > XOR is just one form of achieving symmetric hashing, sorting is another. Right, but there are huge algorithmic differences between the two. With sorting you don't lose any entropy, whereas with XOR you do. For example one side effect of XOR is that for every two hosts on the same IP subnet the IP subnets will cancel out. As such with the same key 192.168.0.1->192.168.0.2 will hash out essentially the same as fc::1->fc::2. > > > We can use one of the reserved fields of struct ethtool_rxfh to carry > > > this extension. I think I asked for this at some point, but there's > > > only so much repeated feedback one can send in a day :( > > > > Why add an extra reserved field when this is just a variant on a hash > > function? I view it as not being dissimilar to how we handle TSO or > > tx-checksumming. It would make sense to me to just set something like > > toeplitz-symmetric-xor to on in order to turn this on. > > It's entirely orthogonal. {sym-XOR, sym-sort} x {toep, crc, xor} - > all combinations can work. > > Forget the "is it algo or not algo" question, just purely from data > normalization perspective, in terms of the API, if combinations make > sense they should be controllable independently. > > https://en.wikipedia.org/wiki/First_normal_form I am thinking of this from a software engineering perspective. This symmetric-xor aka simplified-toeplitz is actually much cheaper to implement in software than the original. As such I would want it to be considered a separate algorithm as I could make use of something like that when having to implement RSS in QEMU for instance. Based on earlier comments it doesn't change the inputs, it just changes how I have to handle the data and the key. It starts reducing things down to something like the Intel implementation of Flow Director in terms of how the key gets generated and hashed. As far as sorting that is a different can of worms, but I would be more open to that being an input specific thing as all it would affect is the ordering of the fields, it doesn't impact how I would have to handle the key or hash the inputs.