On Wed, Feb 28, 2018 at 2:19 PM, Andy Shevchenko <[email protected]> wrote: > On Wed, Feb 28, 2018 at 9:44 PM, Frank Rowand <[email protected]> wrote: >> On 02/28/18 11:31, Andy Shevchenko wrote: >>> On Wed, Feb 28, 2018 at 9:04 PM, <[email protected]> wrote: > >>> The question is why O(1) is so important? O(log(n)) wouldn't work? >> >> O(1) is not critical. It was just a nice side result. >> >> >>> Using radix_tree() I suppose allows to dynamically extend or shrink >>> the cache which would work with DT overlays. >> >> The memory usage of the phandle cache in this patch is fairly small. >> The memory overhead of a radix_tree() would not be justified. > > OTOH the advantage I mentioned isn't a good argument?
Yes, but still one that ignores memory usage. I'll take whatever solution doesn't undo this[1]. Rob [1] https://lwn.net/Articles/735839/
