-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
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>
- Loading branch information
Mark Brown
committed
Jan 2, 2013
1 parent
a49f0d1
commit 2ac902c
Showing
5 changed files
with
77 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,72 @@ | ||
/* | ||
* Register cache access API - flat caching support | ||
* | ||
* Copyright 2012 Wolfson Microelectronics plc | ||
* | ||
* Author: Mark Brown <broonie@opensource.wolfsonmicro.com> | ||
* | ||
* This program is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU General Public License version 2 as | ||
* published by the Free Software Foundation. | ||
*/ | ||
|
||
#include <linux/slab.h> | ||
#include <linux/device.h> | ||
#include <linux/seq_file.h> | ||
|
||
#include "internal.h" | ||
|
||
static int regcache_flat_init(struct regmap *map) | ||
{ | ||
int i; | ||
unsigned int *cache; | ||
|
||
map->cache = kzalloc(sizeof(unsigned int) * (map->max_register + 1), | ||
GFP_KERNEL); | ||
if (!map->cache) | ||
return -ENOMEM; | ||
|
||
cache = map->cache; | ||
|
||
for (i = 0; i < map->num_reg_defaults; i++) | ||
cache[map->reg_defaults[i].reg] = map->reg_defaults[i].def; | ||
|
||
return 0; | ||
} | ||
|
||
static int regcache_flat_exit(struct regmap *map) | ||
{ | ||
kfree(map->cache); | ||
map->cache = NULL; | ||
|
||
return 0; | ||
} | ||
|
||
static int regcache_flat_read(struct regmap *map, | ||
unsigned int reg, unsigned int *value) | ||
{ | ||
unsigned int *cache = map->cache; | ||
|
||
*value = cache[reg]; | ||
|
||
return 0; | ||
} | ||
|
||
static int regcache_flat_write(struct regmap *map, unsigned int reg, | ||
unsigned int value) | ||
{ | ||
unsigned int *cache = map->cache; | ||
|
||
cache[reg] = value; | ||
|
||
return 0; | ||
} | ||
|
||
struct regcache_ops regcache_flat_ops = { | ||
.type = REGCACHE_FLAT, | ||
.name = "flat", | ||
.init = regcache_flat_init, | ||
.exit = regcache_flat_exit, | ||
.read = regcache_flat_read, | ||
.write = regcache_flat_write, | ||
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters