2 * Copyright (c) 2014, Cisco Systems, Inc. All rights reserved.
4 * This program is free software; you may redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; version 2 of the License.
8 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
9 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
10 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
11 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
12 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
13 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
14 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
19 #include <linux/init.h>
20 #include <linux/list.h>
21 #include <linux/slab.h>
22 #include <linux/list_sort.h>
24 #include <linux/interval_tree_generic.h>
25 #include "usnic_uiom_interval_tree.h"
27 #define START(node) ((node)->start)
28 #define LAST(node) ((node)->last)
30 #define MAKE_NODE(node, start, end, ref_cnt, flags, err, err_out) \
32 node = usnic_uiom_interval_node_alloc(start, \
33 end, ref_cnt, flags); \
40 #define MARK_FOR_ADD(node, list) (list_add_tail(&node->link, list))
42 #define MAKE_NODE_AND_APPEND(node, start, end, ref_cnt, flags, err, \
45 MAKE_NODE(node, start, end, \
46 ref_cnt, flags, err, \
48 MARK_FOR_ADD(node, list); \
51 #define FLAGS_EQUAL(flags1, flags2, mask) \
52 (((flags1) & (mask)) == ((flags2) & (mask)))
54 static struct usnic_uiom_interval_node*
55 usnic_uiom_interval_node_alloc(long int start, long int last, int ref_cnt,
58 struct usnic_uiom_interval_node *interval = kzalloc(sizeof(*interval),
63 interval->start = start;
64 interval->last = last;
65 interval->flags = flags;
66 interval->ref_cnt = ref_cnt;
71 static int interval_cmp(void *priv, struct list_head *a, struct list_head *b)
73 struct usnic_uiom_interval_node *node_a, *node_b;
75 node_a = list_entry(a, struct usnic_uiom_interval_node, link);
76 node_b = list_entry(b, struct usnic_uiom_interval_node, link);
79 if (node_a->start < node_b->start)
81 else if (node_a->start > node_b->start)
88 find_intervals_intersection_sorted(struct rb_root *root, unsigned long start,
90 struct list_head *list)
92 struct usnic_uiom_interval_node *node;
96 for (node = usnic_uiom_interval_tree_iter_first(root, start, last);
98 node = usnic_uiom_interval_tree_iter_next(node, start, last))
99 list_add_tail(&node->link, list);
101 list_sort(NULL, list, interval_cmp);
104 int usnic_uiom_get_intervals_diff(unsigned long start, unsigned long last,
105 int flags, int flag_mask,
106 struct rb_root *root,
107 struct list_head *diff_set)
109 struct usnic_uiom_interval_node *interval, *tmp;
111 long int pivot = start;
112 LIST_HEAD(intersection_set);
114 INIT_LIST_HEAD(diff_set);
116 find_intervals_intersection_sorted(root, start, last,
119 list_for_each_entry(interval, &intersection_set, link) {
120 if (pivot < interval->start) {
121 MAKE_NODE_AND_APPEND(tmp, pivot, interval->start - 1,
122 1, flags, err, err_out,
124 pivot = interval->start;
128 * Invariant: Set [start, pivot] is either in diff_set or root,
132 if (pivot > interval->last) {
134 } else if (pivot <= interval->last &&
135 FLAGS_EQUAL(interval->flags, flags,
137 pivot = interval->last + 1;
142 MAKE_NODE_AND_APPEND(tmp, pivot, last, 1, flags, err, err_out,
148 list_for_each_entry_safe(interval, tmp, diff_set, link) {
149 list_del(&interval->link);
156 void usnic_uiom_put_interval_set(struct list_head *intervals)
158 struct usnic_uiom_interval_node *interval, *tmp;
159 list_for_each_entry_safe(interval, tmp, intervals, link)
163 int usnic_uiom_insert_interval(struct rb_root *root, unsigned long start,
164 unsigned long last, int flags)
166 struct usnic_uiom_interval_node *interval, *tmp;
167 unsigned long istart, ilast;
168 int iref_cnt, iflags;
169 unsigned long lpivot = start;
172 LIST_HEAD(intersection_set);
174 find_intervals_intersection_sorted(root, start, last,
177 list_for_each_entry(interval, &intersection_set, link) {
179 * Invariant - lpivot is the left edge of next interval to be
182 istart = interval->start;
183 ilast = interval->last;
184 iref_cnt = interval->ref_cnt;
185 iflags = interval->flags;
187 if (istart < lpivot) {
188 MAKE_NODE_AND_APPEND(tmp, istart, lpivot - 1, iref_cnt,
189 iflags, err, err_out, &to_add);
190 } else if (istart > lpivot) {
191 MAKE_NODE_AND_APPEND(tmp, lpivot, istart - 1, 1, flags,
192 err, err_out, &to_add);
199 MAKE_NODE_AND_APPEND(tmp, lpivot, last, iref_cnt + 1,
200 iflags | flags, err, err_out,
202 MAKE_NODE_AND_APPEND(tmp, last + 1, ilast, iref_cnt,
203 iflags, err, err_out, &to_add);
205 MAKE_NODE_AND_APPEND(tmp, lpivot, ilast, iref_cnt + 1,
206 iflags | flags, err, err_out,
214 MAKE_NODE_AND_APPEND(tmp, lpivot, last, 1, flags, err, err_out,
217 list_for_each_entry_safe(interval, tmp, &intersection_set, link) {
218 usnic_uiom_interval_tree_remove(interval, root);
222 list_for_each_entry(interval, &to_add, link)
223 usnic_uiom_interval_tree_insert(interval, root);
228 list_for_each_entry_safe(interval, tmp, &to_add, link)
234 void usnic_uiom_remove_interval(struct rb_root *root, unsigned long start,
235 unsigned long last, struct list_head *removed)
237 struct usnic_uiom_interval_node *interval;
239 for (interval = usnic_uiom_interval_tree_iter_first(root, start, last);
241 interval = usnic_uiom_interval_tree_iter_next(interval,
244 if (--interval->ref_cnt == 0)
245 list_add_tail(&interval->link, removed);
248 list_for_each_entry(interval, removed, link)
249 usnic_uiom_interval_tree_remove(interval, root);
252 INTERVAL_TREE_DEFINE(struct usnic_uiom_interval_node, rb,
253 unsigned long, __subtree_last,
254 START, LAST, , usnic_uiom_interval_tree)