| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | regmap: cache: Sort include headers alphabetically | Xiubo Li | 2014-10-20 |
| | | | | | | | | | | | If the inlcude headers aren't sorted alphabetically, then the logical choice is to append new ones, however that creates a lot of potential for conflicts or duplicates because every change will then add new includes in the same location. Signed-off-by: Xiubo Li <Li.Xiubo@freescale.com> Signed-off-by: Mark Brown <broonie@kernel.org> | ||
| * | regmap: flat: Add flat cache type | Mark Brown | 2013-01-02 |
| While for I2C and SPI devices the overhead of using rbtree for devices with only one block of registers is negligible the same isn't always going to be true for MMIO devices where the I/O costs are very much lower. Cater for these devices by adding a simple flat array type for them where the lookups are simple array accesses, taking us right back to the original ASoC cache implementation. Thanks to Magnus Damm for the discussion which prompted this. Signed-off-by: Mark Brown <broonie@opensource.wolfsonmicro.com> | |||
 |
index : litmus-rt.git | |
| The LITMUS^RT kernel. | Bjoern Brandenburg |
| aboutsummaryrefslogtreecommitdiffstats |