b2b21412ae
There were various flaws in it that motivated its removal: - No hash collision handling mechanism. In case that would happen, the behavior of the network connection would be unknown. This is the main drawback - The lookup is not that much more efficient than the default one. The only difference of gain is in connection comparison (a u32t comparison vs a full connection compare). But the list handling is the same. It's made worse by the presence of a negatives match array which can be easily filled in and becomes then fully usless, appart from consuming CPU. As well as adding a new connection: it requires the whole cache to be cleared which is unefficient. - Not memory efficient, even compared to a proper hash table. Two arrays instead of one etc... All of this could be fixed by using a proper hash table, though it remains to be seen if such object could fit in Zephyr core. Signed-off-by: Tomasz Bursztyka <tomasz.bursztyka@linux.intel.com> |
||
|---|---|---|
| .. | ||
| src | ||
| CMakeLists.txt | ||
| prj.conf | ||
| testcase.yaml | ||