Sean> The problem is that it results in walking the list every
Sean> time the user wants to see the next segment. This is an
Sean> O(n^2) operation. In any case I can think of, all that's
Sean> needed is a single walk through the list to copy the
Sean> userspace MAD data into the appropriate data segments. In
Sean> this case I think it makes sense to expose the list
Sean> implementation to gain the extra performance.
If we want to keep the internals hidden, then we could expose some
sort of iterator object that clients can use to walk the list in O(n).
- R.
_______________________________________________
openib-general mailing list
[email protected]
http://openib.org/mailman/listinfo/openib-general
To unsubscribe, please visit http://openib.org/mailman/listinfo/openib-general
