Pārlūkot izejas kodu

regmap: rbtree: Fixed node range check on sync

A node starting before the minimum register is no reason to reject it,
since its end could be in range. The check for the end already exists
two lines lower, so we can just remove the incorrect check.

Signed-off-by: Maarten ter Huurne <maarten@treewalker.org>
Signed-off-by: Mark Brown <broonie@linaro.org>
Maarten ter Huurne 12 gadi atpakaļ
vecāks
revīzija
f3284f9153
1 mainītis faili ar 0 papildinājumiem un 2 dzēšanām
  1. 0 2
      drivers/base/regmap/regcache-rbtree.c

+ 0 - 2
drivers/base/regmap/regcache-rbtree.c

@@ -391,8 +391,6 @@ static int regcache_rbtree_sync(struct regmap *map, unsigned int min,
 	for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) {
 	for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) {
 		rbnode = rb_entry(node, struct regcache_rbtree_node, node);
 		rbnode = rb_entry(node, struct regcache_rbtree_node, node);
 
 
-		if (rbnode->base_reg < min)
-			continue;
 		if (rbnode->base_reg > max)
 		if (rbnode->base_reg > max)
 			break;
 			break;
 		if (rbnode->base_reg + rbnode->blklen < min)
 		if (rbnode->base_reg + rbnode->blklen < min)