<feed xmlns='http://www.w3.org/2005/Atom'>
<title>linux/drivers/base/regmap/regcache-flat.c, branch v4.5</title>
<subtitle>Mirror of https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git/
</subtitle>
<id>https://git.shady.money/linux/atom?h=v4.5</id>
<link rel='self' href='https://git.shady.money/linux/atom?h=v4.5'/>
<link rel='alternate' type='text/html' href='https://git.shady.money/linux/'/>
<updated>2015-11-20T12:27:57Z</updated>
<entry>
<title>regmap: replace kzalloc with kcalloc</title>
<updated>2015-11-20T12:27:57Z</updated>
<author>
<name>lixiubo</name>
<email>lixiubo@cmss.chinamobile.com</email>
</author>
<published>2015-11-20T10:06:29Z</published>
<link rel='alternate' type='text/html' href='https://git.shady.money/linux/commit/?id=eeda1bd69d5d8a020ce191f717b94ca99707daad'/>
<id>urn:sha1:eeda1bd69d5d8a020ce191f717b94ca99707daad</id>
<content type='text'>
Replace kzalloc with specialized function kcalloc when the size is
a multiplication of : number * sizeof

Signed-off-by: lixiubo &lt;lixiubo@cmss.chinamobile.com&gt;
Signed-off-by: Mark Brown &lt;broonie@kernel.org&gt;
</content>
</entry>
<entry>
<title>regmap: cache: Sort include headers alphabetically</title>
<updated>2014-10-20T11:25:06Z</updated>
<author>
<name>Xiubo Li</name>
<email>Li.Xiubo@freescale.com</email>
</author>
<published>2014-10-09T09:02:52Z</published>
<link rel='alternate' type='text/html' href='https://git.shady.money/linux/commit/?id=e39be3a31b8f16d92fff096e92b593a9bffecb93'/>
<id>urn:sha1:e39be3a31b8f16d92fff096e92b593a9bffecb93</id>
<content type='text'>
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 &lt;Li.Xiubo@freescale.com&gt;
Signed-off-by: Mark Brown &lt;broonie@kernel.org&gt;
</content>
</entry>
<entry>
<title>regmap: flat: Add flat cache type</title>
<updated>2013-01-02T10:58:53Z</updated>
<author>
<name>Mark Brown</name>
<email>broonie@opensource.wolfsonmicro.com</email>
</author>
<published>2012-12-19T14:51:55Z</published>
<link rel='alternate' type='text/html' href='https://git.shady.money/linux/commit/?id=2ac902ce17f9dfa0d4d1f0818be147b5d2515fb7'/>
<id>urn:sha1:2ac902ce17f9dfa0d4d1f0818be147b5d2515fb7</id>
<content type='text'>
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 &lt;broonie@opensource.wolfsonmicro.com&gt;
</content>
</entry>
</feed>
