Searched refs:less (Results 1 – 4 of 4) sorted by relevance
| /include/linux/ |
| A D | rbtree_latch.h | 65 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b); member
77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()
89 if (less(ltn, ltp)) in __lt_insert()
149 __lt_insert(node, root, 0, ops->less); in latch_tree_insert()
151 __lt_insert(node, root, 1, ops->less); in latch_tree_insert()
|
| A D | rbtree.h | 166 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add_cached()
174 if (less(node, parent)) { in rb_add_cached()
196 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
203 if (less(node, parent)) in rb_add()
|
| A D | min_heap.h | 48 bool (*less)(const void *lhs, const void *rhs, void *args); member
273 b = func->less(data + c, data + d, args) ? c : d; in __min_heap_sift_down_inline()
280 while (b != a && func->less(data + a, data + b, args)) in __min_heap_sift_down_inline()
311 if (func->less(data + b, data + a, args)) in __min_heap_sift_up_inline()
|
| A D | rbtree_augmented.h | 65 bool (*less)(struct rb_node *, const struct rb_node *), in rb_add_augmented_cached()
74 if (less(node, parent)) { in rb_add_augmented_cached()
|
Completed in 8 milliseconds