linux/drivers/base/regmap/regmap-debugfs.c, branch v3.8

regmap: debugfs: Fix seeking from the cache

2013-01-16T15:33:36Z

We don't want to bomb out early if we failed to get the cache any more, just soldier on instead and we won't get confused and always return the first block. Reported-by: Philipp Zabel

regmap: debugfs: Make sure we store the last entry in the offset cache

2013-01-08T20:52:51Z

Signed-off-by: Mark Brown

regmap: debugfs: Ensure a correct return value for empty caches

2013-01-08T20:52:49Z

This should never happen in the real world. Signed-off-by: Mark Brown

regmap: debugfs: Discard the cache if we fail to allocate an entry

2013-01-08T20:52:46Z

Rather than trying to soldier on with a partially allocated cache just throw the cache away and pretend we don't have one in case we can get a full cache next time around. Signed-off-by: Mark Brown

regmap: debugfs: Fix check for block start in cached seeks

2013-01-08T20:52:45Z

Check for the block we were asked to start from, not the position we're in. Signed-off-by: Mark Brown

regmap: debugfs: Fix attempts to read nonexistant register blocks

2013-01-08T20:52:45Z

Return the start of the last block we tried to read rather than a position, and also make sure we update the byte position while we're at it. Without this reads that go into nonexistant areas get confused. Signed-off-by: Mark Brown

regmap: debugfs: Cache offsets of valid regions for dump

2012-12-10T16:29:47Z

Avoid doing a linear scan of the entire register map for each read() of the debugfs register dump by recording the offsets where valid registers exist when we first read the registers file. This assumes the set of valid registers never changes, if this is not the case invalidation of the cache will be required. This could be further improved for large blocks of contiguous registers by calculating the register we will read from within the block - currently we do a linear scan of the block. An rbtree may also be worthwhile. Signed-off-by: Mark Brown

regmap: debugfs: Factor out initial seek

2012-12-10T16:29:47Z

In preparation for doing things a bit more quickly than a linear scan factor out the initial seek from the debugfs register dump. Signed-off-by: Mark Brown

regmap: debugfs: Avoid overflows for very small reads

2012-12-10T16:29:39Z

If count is less than the size of a register then we may hit integer wraparound when trying to move backwards to check if we're still in the buffer. Instead move the position forwards to check if it's still in the buffer, we are unlikely to be able to allocate a buffer sufficiently big to overflow here. Signed-off-by: Mark Brown Cc: stable@vger.kernel.org

regmap: Cache register and value sizes for debugfs

2012-12-06T06:10:21Z

No point in calculating them every time. Signed-off-by: Mark Brown