[openib-general] DAPL for openib

[Michael S. Tsirkin]

Hello!
Quoting r. Roland Dreier (roland at topspin.com) "Re: [openib-general] DAPL for openib":
>     Michael> What was the data structure you had in mind for this?  On
>     Michael> linux tree is the easiest I think , but thats not O(1).
>     Michael> If you want to, a tree can keep mutiple identical items I
>     Michael> think.
> 
> I think the O(1) data structure Sean has in mind is a dispatch table :)

Wouldnt it be a bit big? For 8 bit values for class/version and
128 methods 256*256*128 * sizeof(void*) --> 32 MByte on a 32 bit machine?