39 static int is_node_overlap(struct memtype *node, u64 start, u64 end)  in is_node_overlap()  argument
41 	if (node->start >= end || node->end <= start)  in is_node_overlap()
59 	u64 max_end = data->end, child_max_end;  in compute_subtree_max_end()
77 				u64 start, u64 end)  in RB_DECLARE_CALLBACKS()
88 		} else if (is_node_overlap(data, start, end)) {  in RB_DECLARE_CALLBACKS()
102 				u64 start, u64 end)  in memtype_rb_exact_match()  argument
106 	match = memtype_rb_lowest_match(root, start, end);  in memtype_rb_exact_match()
107 	while (match != NULL && match->start < end) {  in memtype_rb_exact_match()
110 		if (match->start == start && match->end == end)  in memtype_rb_exact_match()
124 				u64 start, u64 end,  in memtype_rb_check_conflict()  argument
132 	match = memtype_rb_lowest_match(&memtype_rbroot, start, end);  in memtype_rb_check_conflict()
139 	dprintk("Overlap at 0x%Lx-0x%Lx\n", match->start, match->end);  in memtype_rb_check_conflict()
146 		if (match->start >= end) /* Checked all possible matches */  in memtype_rb_check_conflict()
149 		if (is_node_overlap(match, start, end) &&  in memtype_rb_check_conflict()
164 		current->comm, current->pid, start, end,  in memtype_rb_check_conflict()
178 		if (data->subtree_max_end < newdata->end)  in memtype_rb_insert()
179 			data->subtree_max_end = newdata->end;  in memtype_rb_insert()
186 	newdata->subtree_max_end = newdata->end;  in memtype_rb_insert()
196 	err = memtype_rb_check_conflict(&memtype_rbroot, new->start, new->end,  in rbt_memtype_check_insert()
203 		new->subtree_max_end = new->end;  in rbt_memtype_check_insert()
209 struct memtype *rbt_memtype_erase(u64 start, u64 end)  in rbt_memtype_erase()  argument
213 	data = memtype_rb_exact_match(&memtype_rbroot, start, end);  in rbt_memtype_erase()