On Mon, Feb 27, 2006 at 07:34:59PM +0200, Michael S. Tsirkin wrote: > I started preparing a stable linux SDP implementation, > with the eye towards mainline inclusion. > > The idea is to get to a drastically simple code base and get this admitted in > mainline, then add enhancements. > > The plan (as compared to existing SDP implementation) includes: > - Use CMA API > - Reuse generic code from sock.c > SO_SNDBUF/SO_RCVBUF should work properly > - Use sock_lock_t and simple spin_lock_bh for socket locking > - Use skbuff and standard skbuff queues (in struct sock) > for incoming/outgoing messages > - Implement transport-level queues by simple circular buffer, > attach BSDH by s/g > - Set socket bits to signal the need for control messages > - Single CQ, perform all CQ polling from interrupt context > - Code must be sparse-clean, keep network data in __beXX structures > - Proper use of DMA API > - Use sysfs for statistics, entry per socket
this one sounds a bit fishy. with lots of sockets you'll eat up far too much memory I susect. But let's look at the code once it's there. else this list sounds like where sdp needs to head for. _______________________________________________ openib-general mailing list [email protected] http://openib.org/mailman/listinfo/openib-general To unsubscribe, please visit http://openib.org/mailman/listinfo/openib-general
