On Tue, Mar 26, 2013 at 09:33:51AM -0700, Tejun Heo wrote: > not be too bad. The optimal would be bitmap + hashtable, I suppose.
Oops, with more restricted (or at least dynamically adjusted) ID space, that is. The problem with idr is that it can get pretty wasteful if the IDs become very scattered - the worst case being one ID per each idr_layer (the internal allocation block). That said, even cyclic allocation should yield somewhat clustered IDs, so I don't think it'd be too bad. Thanks. -- tejun -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
