ivide is a shift, either of
which can be done in one cycle flat.
AFAIK, however, the main CPU cost of the hash function in Cake is not the hash
itself, but the packet dissection required to obtain the data it operates on.
This is something a profile would shed more light on.
- Jonathan Morton
tags" may not be always such a bad thing depending on how it works
> itself out.
That sort of thing is explicitly catered for by the triple-isolate algorithm.
I don’t want to rely on particular hash behaviour to achieve an inferior
result. I’d much rather have a good hash with maxim
ncur the cost of a division, which is very much non-trivial on
ARM CPUs, which are increasingly common in CPE.
- Jonathan Morton
___
Lede-dev mailing list
Lede-dev@lists.infradead.org
http://lists.infradead.org/mailman/listinfo/lede-dev
number of buckets is 1024, but Cake uses
the full 32-bit hash as a “tag” for hash collision detection without having to
store and compare the entire 5-tuple.
- Jonathan Morton
___
Lede-dev mailing list
Lede-dev@lists.infradead.org
http://lists.
