40 	u32 rn_start;  member
52 	return rn->rn_last - rn->rn_start + 1;  in rn_size()
82 	return rn->rn_start;  in range_tree_find()
107 #define START(node) ((node)->rn_start)
144 		if (rn->rn_start < start && rn->rn_last > last) {  in range_tree_clear()
158 			new_rn->rn_start = last + 1;  in range_tree_clear()
161 		} else if (rn->rn_start < start) {  in range_tree_clear()
169 			rn->rn_start = last + 1;  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()
221 	if (right && right->rn_start != last + 1)  in range_tree_set()
241 		right->rn_start = start;  in range_tree_set()
249 		left->rn_start = start;  in range_tree_set()