On 07/17/2012 01:16 PM, Mark Brown wrote: > On Fri, Sep 02, 2011 at 10:16:06PM +0200, Lars-Peter Clausen wrote: > >> I have some patches for the rbtree register cache code, which reduce some of >> it's complexity and also implements the adjacent node merging and allows >> smaller holes in the rbnodes register block if the block is smaller then an >> rbnode. Currently these patches are based on the ASoC register cache code, >> but >> they should be easy to rework onto of the regmap register cache code. > > Dimitris just reminded me about what you said here - do you still have > those patches floating around? This would really useful and would > make some other optimistations like not cacheing default values much > easier.
Yes, I still have it, but it's on a machine which is currently broken and I wont get the replacement part until next week. - Lars -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [email protected] More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
