On Tue, 2005-07-19 at 16:29 -0700, Libor Michalek wrote: > > > Thanks. I've applied the patch since it's better then what was there. > > > However, the longer term solution needs to use a full hash table, the > > > linear list is problematic when there are a lot of connections, and each > > > port_get() needs to traverse the entire list to check for collisions. > > > > Or a tree? > > A tree would be fine as well, I was just thinking anything that has > a src_port lookup time of O(log n) instead of O(n). Also the tcp code > uses it's own hash table for it's port lookup. (net/ipv4/tcp_ipv4.c) > That seems like it might be overkill...
Is anyone looking at moving this over to use rbtree.h? If not, I will take a look. -tduffy
signature.asc
Description: This is a digitally signed message part
_______________________________________________ openib-general mailing list [email protected] http://openib.org/mailman/listinfo/openib-general To unsubscribe, please visit http://openib.org/mailman/listinfo/openib-general
