41 	u32 rn_last; /* inclusive */  member
52 	return rn->rn_last - rn->rn_start + 1;  in rn_size()
108 #define LAST(node)  ((node)->rn_last)
144 		if (rn->rn_start < start && rn->rn_last > last) {  in range_tree_clear()
145 			u32 old_last = rn->rn_last;  in range_tree_clear()
149 			rn->rn_last = start - 1;  in range_tree_clear()
159 			new_rn->rn_last = old_last;  in range_tree_clear()
164 			rn->rn_last = start - 1;  in range_tree_clear()
166 		} else if (rn->rn_last > last) {  in range_tree_clear()
191 	if (left && left->rn_start <= start && left->rn_last >= last)  in is_range_tree_set()
206 	if (left && left->rn_start <= start && left->rn_last >= last)  in range_tree_set()
216 	if (left && left->rn_last + 1 != start)  in range_tree_set()
228 		left->rn_last = right->rn_last;  in range_tree_set()
236 		left->rn_last = last;  in range_tree_set()
250 		left->rn_last = last;  in range_tree_set()