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