Lines Matching refs:end

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()
107 u64 start, u64 end, int match_type) in memtype_rb_match() argument
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()
120 (match->start < start) && (match->end == end)) in memtype_rb_match()
134 u64 start, u64 end, in memtype_rb_check_conflict() argument
142 match = memtype_rb_lowest_match(&memtype_rbroot, start, end); in memtype_rb_check_conflict()
149 dprintk("Overlap at 0x%Lx-0x%Lx\n", match->start, match->end); 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()
174 current->comm, current->pid, start, end, in memtype_rb_check_conflict()
188 if (data->subtree_max_end < newdata->end) in memtype_rb_insert()
189 data->subtree_max_end = newdata->end; in memtype_rb_insert()
196 newdata->subtree_max_end = newdata->end; in memtype_rb_insert()
206 err = memtype_rb_check_conflict(&memtype_rbroot, new->start, new->end, in rbt_memtype_check_insert()
213 new->subtree_max_end = new->end; in rbt_memtype_check_insert()
219 struct memtype *rbt_memtype_erase(u64 start, u64 end) in rbt_memtype_erase() argument
230 data = memtype_rb_match(&memtype_rbroot, start, end, in rbt_memtype_erase()
233 data = memtype_rb_match(&memtype_rbroot, start, end, in rbt_memtype_erase()
247 data->end = start; in rbt_memtype_erase()
248 data->subtree_max_end = data->end; in rbt_memtype_erase()