base/regmap/regcache-rbtree.c

27 	unsigned int base_reg;
44 	*base = rbnode->base_reg;
45 	*top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride);
68 	unsigned int base_reg, top_reg;
72 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,
74 		if (reg >= base_reg && reg <= top_reg)
81 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,
83 		if (reg >= base_reg && reg <= top_reg) {
88 		} else if (reg < base_reg) {
102 	unsigned int base_reg;
112 		base_reg = rbnode->base_reg;
115 		if (base_reg >= base_reg_tmp &&
116 		    base_reg <= top_reg_tmp)
118 		else if (base_reg > top_reg_tmp)
120 		else if (base_reg < base_reg_tmp)
250 		reg_tmp = (reg - rbnode->base_reg) / map->reg_stride;
264 					   unsigned int base_reg,
274 	blklen = (top_reg - base_reg) / map->reg_stride + 1;
275 	pos = (reg - base_reg) / map->reg_stride;
276 	offset = (rbnode->base_reg - base_reg) / map->reg_stride;
309 	rbnode->base_reg = base_reg;
339 			rbnode->base_reg = range->range_min;
345 		rbnode->base_reg = reg;
384 		reg_tmp = (reg - rbnode->base_reg) / map->reg_stride;
387 		unsigned int base_reg, top_reg;
408 				&base_reg, &top_reg);
410 			if (base_reg <= max && top_reg >= min) {
411 				if (reg < base_reg)
412 					dist = base_reg - reg;
420 					new_base_reg = min(reg, base_reg);
430 			if (reg < base_reg)
456 					     (reg - rbnode->base_reg) / map->reg_stride,
471 	unsigned int base_reg, top_reg;
481 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,
483 		if (base_reg > max)
488 		if (min > base_reg)
489 			start = (min - base_reg) / map->reg_stride;
494 			end = (max - base_reg) / map->reg_stride + 1;
500 					  rbnode->base_reg, start, end);
516 	unsigned int base_reg, top_reg;
523 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,
525 		if (base_reg > max)
530 		if (min > base_reg)
531 			start = (min - base_reg) / map->reg_stride;
536 			end = (max - base_reg) / map->reg_stride + 1;