31 	unsigned int base_reg;  member
48 	*base = rbnode->base_reg;  in regcache_rbtree_get_base_top_reg()
49 	*top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride);  in regcache_rbtree_get_base_top_reg()
72 	unsigned int base_reg, top_reg;  in regcache_rbtree_lookup()  local
76 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,  in regcache_rbtree_lookup()
78 		if (reg >= base_reg && reg <= top_reg)  in regcache_rbtree_lookup()
85 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,  in regcache_rbtree_lookup()
87 		if (reg >= base_reg && reg <= top_reg) {  in regcache_rbtree_lookup()
92 		} else if (reg < base_reg) {  in regcache_rbtree_lookup()
106 	unsigned int base_reg;  in regcache_rbtree_insert()  local
116 		base_reg = rbnode->base_reg;  in regcache_rbtree_insert()
119 		if (base_reg >= base_reg_tmp &&  in regcache_rbtree_insert()
120 		    base_reg <= top_reg_tmp)  in regcache_rbtree_insert()
122 		else if (base_reg > top_reg_tmp)  in regcache_rbtree_insert()
124 		else if (base_reg < base_reg_tmp)  in regcache_rbtree_insert()
264 		reg_tmp = (reg - rbnode->base_reg) / map->reg_stride;  in regcache_rbtree_read()
278 					   unsigned int base_reg,  in regcache_rbtree_insert_to_block()  argument
288 	blklen = (top_reg - base_reg) / map->reg_stride + 1;  in regcache_rbtree_insert_to_block()
289 	pos = (reg - base_reg) / map->reg_stride;  in regcache_rbtree_insert_to_block()
290 	offset = (rbnode->base_reg - base_reg) / map->reg_stride;  in regcache_rbtree_insert_to_block()
324 	rbnode->base_reg = base_reg;  in regcache_rbtree_insert_to_block()
354 			rbnode->base_reg = range->range_min;  in regcache_rbtree_node_alloc()
360 		rbnode->base_reg = reg;  in regcache_rbtree_node_alloc()
399 		reg_tmp = (reg - rbnode->base_reg) / map->reg_stride;  in regcache_rbtree_write()
402 		unsigned int base_reg, top_reg;  in regcache_rbtree_write()  local
423 				&base_reg, &top_reg);  in regcache_rbtree_write()
425 			if (base_reg <= max && top_reg >= min) {  in regcache_rbtree_write()
426 				if (reg < base_reg)  in regcache_rbtree_write()
427 					dist = base_reg - reg;  in regcache_rbtree_write()
435 					new_base_reg = min(reg, base_reg);  in regcache_rbtree_write()
445 			if (reg < base_reg)  in regcache_rbtree_write()
471 					     reg - rbnode->base_reg, value);  in regcache_rbtree_write()
485 	unsigned int base_reg, top_reg;  in regcache_rbtree_sync()  local
493 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,  in regcache_rbtree_sync()
495 		if (base_reg > max)  in regcache_rbtree_sync()
500 		if (min > base_reg)  in regcache_rbtree_sync()
501 			start = (min - base_reg) / map->reg_stride;  in regcache_rbtree_sync()
506 			end = (max - base_reg) / map->reg_stride + 1;  in regcache_rbtree_sync()
512 					  rbnode->base_reg, start, end);  in regcache_rbtree_sync()
526 	unsigned int base_reg, top_reg;  in regcache_rbtree_drop()  local
533 		regcache_rbtree_get_base_top_reg(map, rbnode, &base_reg,  in regcache_rbtree_drop()
535 		if (base_reg > max)  in regcache_rbtree_drop()
540 		if (min > base_reg)  in regcache_rbtree_drop()
541 			start = (min - base_reg) / map->reg_stride;  in regcache_rbtree_drop()
546 			end = (max - base_reg) / map->reg_stride + 1;  in regcache_rbtree_drop()