Implement skip lists for faster ordered buffer insertion
acomminos opened this issue · 1 comments
acomminos commented
A major issue right now is inserting into and merging free lists. Even though the merge implementation right now can be optimized to O(m + n), insertion into the fence-pending region list is the most significant bottleneck.
acomminos commented
Might use rb-trees instead, since wine already has an implementation.