109 	struct memtype *match;  in memtype_rb_match()  local
111 	match = memtype_rb_lowest_match(root, start, end);  in memtype_rb_match()
112 	while (match != NULL && match->start < end) {  in memtype_rb_match()
116 		    (match->start == start) && (match->end == end))  in memtype_rb_match()
117 			return match;  in memtype_rb_match()
120 		    (match->start < start) && (match->end == end))  in memtype_rb_match()
121 			return match;  in memtype_rb_match()
123 		node = rb_next(&match->rb);  in memtype_rb_match()
125 			match = rb_entry(node, struct memtype, rb);  in memtype_rb_match()
127 			match = NULL;  in memtype_rb_match()
139 	struct memtype *match;  in memtype_rb_check_conflict()  local
142 	match = memtype_rb_lowest_match(&memtype_rbroot, start, end);  in memtype_rb_check_conflict()
143 	if (match == NULL)  in memtype_rb_check_conflict()
146 	if (match->type != found_type && newtype == NULL)  in memtype_rb_check_conflict()
149 	dprintk("Overlap at 0x%Lx-0x%Lx\n", match->start, match->end);  in memtype_rb_check_conflict()
150 	found_type = match->type;  in memtype_rb_check_conflict()
152 	node = rb_next(&match->rb);  in memtype_rb_check_conflict()
154 		match = rb_entry(node, struct memtype, rb);  in memtype_rb_check_conflict()
156 		if (match->start >= end) /* Checked all possible matches */  in memtype_rb_check_conflict()
159 		if (is_node_overlap(match, start, end) &&  in memtype_rb_check_conflict()
160 		    match->type != found_type) {  in memtype_rb_check_conflict()
164 		node = rb_next(&match->rb);  in memtype_rb_check_conflict()
175 		cattr_name(found_type), cattr_name(match->type));  in memtype_rb_check_conflict()