Searched refs:interval_node (Results 1 - 6 of 6) sorted by relevance

/linux-4.1.27/drivers/staging/lustre/lustre/include/
H A Dinterval_tree.h45 struct interval_node { struct
46 struct interval_node *in_left;
47 struct interval_node *in_right;
48 struct interval_node *in_parent;
65 static inline int interval_is_intree(struct interval_node *node) interval_is_intree()
70 static inline __u64 interval_low(struct interval_node *node) interval_low()
75 static inline __u64 interval_high(struct interval_node *node) interval_high()
80 static inline void interval_set(struct interval_node *node, interval_set()
98 typedef enum interval_iter (*interval_callback_t)(struct interval_node *node,
101 struct interval_node *interval_insert(struct interval_node *node,
102 struct interval_node **root);
103 void interval_erase(struct interval_node *node, struct interval_node **root);
107 enum interval_iter interval_search(struct interval_node *root,
112 enum interval_iter interval_iterate(struct interval_node *root,
114 enum interval_iter interval_iterate_reverse(struct interval_node *root,
117 void interval_expand(struct interval_node *root,
120 int interval_is_overlapped(struct interval_node *root,
122 struct interval_node *interval_find(struct interval_node *root,
H A Dlustre_dlm.h55 #include "interval_tree.h" /* for interval_node{}, ldlm_extent */
583 struct interval_node li_node; /* node for tree management */
599 struct interval_node *lit_root; /* actual ldlm_interval */
/linux-4.1.27/drivers/staging/lustre/lustre/ldlm/
H A Dinterval_tree.c50 static inline int node_is_left_child(struct interval_node *node) node_is_left_child()
56 static inline int node_is_right_child(struct interval_node *node) node_is_right_child()
62 static inline int node_is_red(struct interval_node *node) node_is_red()
67 static inline int node_is_black(struct interval_node *node) node_is_black()
105 static inline int node_compare(struct interval_node *n1, node_compare()
106 struct interval_node *n2) node_compare()
111 static inline int node_equal(struct interval_node *n1, node_equal()
112 struct interval_node *n2) node_equal()
135 static struct interval_node *interval_first(struct interval_node *node) interval_first()
144 static struct interval_node *interval_last(struct interval_node *node) interval_last()
153 static struct interval_node *interval_next(struct interval_node *node) interval_next()
164 static struct interval_node *interval_prev(struct interval_node *node) interval_prev()
178 enum interval_iter interval_iterate(struct interval_node *root, interval_iterate()
182 struct interval_node *node; interval_iterate()
195 enum interval_iter interval_iterate_reverse(struct interval_node *root, interval_iterate_reverse()
199 struct interval_node *node; interval_iterate_reverse()
214 struct interval_node *interval_find(struct interval_node *root, interval_find()
217 struct interval_node *walk = root; interval_find()
234 static void __rotate_change_maxhigh(struct interval_node *node, __rotate_change_maxhigh()
235 struct interval_node *rotate) __rotate_change_maxhigh()
249 static void __rotate_left(struct interval_node *node, __rotate_left()
250 struct interval_node **root) __rotate_left()
252 struct interval_node *right = node->in_right; __rotate_left()
253 struct interval_node *parent = node->in_parent; __rotate_left()
278 static void __rotate_right(struct interval_node *node, __rotate_right()
279 struct interval_node **root) __rotate_right()
281 struct interval_node *left = node->in_left; __rotate_right()
282 struct interval_node *parent = node->in_parent; __rotate_right()
305 struct interval_node *c = a; a = b; b = c; \
315 static void interval_insert_color(struct interval_node *node, interval_insert_color()
316 struct interval_node **root) interval_insert_color()
318 struct interval_node *parent, *gparent; interval_insert_color()
324 struct interval_node *uncle; interval_insert_color()
344 struct interval_node *uncle; interval_insert_color()
369 struct interval_node *interval_insert(struct interval_node *node, interval_insert()
370 struct interval_node **root) interval_insert()
373 struct interval_node **p, *parent = NULL; interval_insert()
405 static inline int node_is_black_or_0(struct interval_node *node) node_is_black_or_0()
410 static void interval_erase_color(struct interval_node *node, interval_erase_color()
411 struct interval_node *parent, interval_erase_color()
412 struct interval_node **root) interval_erase_color()
414 struct interval_node *tmp; interval_erase_color()
432 struct interval_node *o_left; interval_erase_color()
464 struct interval_node *o_right; interval_erase_color()
491 static void update_maxhigh(struct interval_node *node, update_maxhigh()
508 void interval_erase(struct interval_node *node, interval_erase()
509 struct interval_node **root) interval_erase()
511 struct interval_node *child, *parent; interval_erase()
521 struct interval_node *old = node; interval_erase()
580 static inline int interval_may_overlap(struct interval_node *node, interval_may_overlap()
608 enum interval_iter interval_search(struct interval_node *node, interval_search()
613 struct interval_node *parent; interval_search()
665 static enum interval_iter interval_overlap_cb(struct interval_node *n, interval_overlap_cb()
672 int interval_is_overlapped(struct interval_node *root, interval_is_overlapped()
686 * struct interval_node *tmp;
710 static inline __u64 interval_expand_low(struct interval_node *root, __u64 low) interval_expand_low()
718 static inline __u64 interval_expand_high(struct interval_node *node, __u64 high) interval_expand_high()
738 void interval_expand(struct interval_node *root, interval_expand()
H A Dldlm_extent.c164 struct interval_node *found, **root; ldlm_extent_add_lock()
H A Dldlm_lockd.c1166 ldlm_interval_slab = kmem_cache_create("interval_node", ldlm_init()
/linux-4.1.27/drivers/infiniband/hw/usnic/
H A Dusnic_uiom.c252 struct usnic_uiom_interval_node *interval_node; usnic_uiom_map_sorted_intervals() local
264 list_for_each_entry(interval_node, intervals, link) { list_for_each_entry()
268 if ((va >> PAGE_SHIFT) < interval_node->start) list_for_each_entry()
271 if ((va >> PAGE_SHIFT) == interval_node->start) { list_for_each_entry()
298 if ((va >> PAGE_SHIFT) == interval_node->last) { list_for_each_entry()

Completed in 203 milliseconds