>>> On 15.12.15 at 03:05, <shuai.r...@linux.intel.com> wrote: > This patch refactors struct rangeset to base it on the red-black > tree structure, instead of on the current doubly linked list. By > now, ioreq leverages rangeset to keep track of the IO/memory > resources to be emulated. Yet when number of ranges inside one > ioreq server is very high, traversing a doubly linked list could > be time consuming. With this patch, the time complexity for > searching a rangeset can be improved from O(n) to O(log(n)). > Interfaces of rangeset still remain the same, and no new APIs > introduced.
So this indeed addresses one of the two original concerns. But what about the other (resource use due to thousands of ranges in use by a single VM)? IOW I'm still unconvinced this is the way to go. Jan _______________________________________________ Xen-devel mailing list Xen-devel@lists.xen.org http://lists.xen.org/xen-devel
