Home
last modified time | relevance | path

Searched refs:rb_node (Results 1 – 15 of 15) sorted by relevance

/third_party/mesa3d/src/util/
Drb_tree.h37 struct rb_node { struct
48 struct rb_node *left; argument
51 struct rb_node *right; argument
55 static inline struct rb_node *
56 rb_node_parent(struct rb_node *n) in rb_node_parent()
58 return (struct rb_node *)(n->parent & ~(uintptr_t)1); in rb_node_parent()
67 struct rb_node *root;
107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent,
108 struct rb_node *node, bool insert_left);
119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert()
[all …]
Drb_tree.c43 rb_node_is_black(struct rb_node *n) in rb_node_is_black()
50 rb_node_is_red(struct rb_node *n) in rb_node_is_red()
56 rb_node_set_black(struct rb_node *n) in rb_node_set_black()
62 rb_node_set_red(struct rb_node *n) in rb_node_set_red()
68 rb_node_copy_color(struct rb_node *dst, struct rb_node *src) in rb_node_copy_color()
74 rb_node_set_parent(struct rb_node *n, struct rb_node *p) in rb_node_set_parent()
79 static struct rb_node *
80 rb_node_minimum(struct rb_node *node) in rb_node_minimum()
87 static struct rb_node *
88 rb_node_maximum(struct rb_node *node) in rb_node_maximum()
[all …]
Drb_tree_test.c52 struct rb_node node;
56 rb_test_node_cmp_void(const struct rb_node *n, const void *v) in rb_test_node_cmp_void()
63 rb_test_node_cmp(const struct rb_node *a, const struct rb_node *b) in rb_test_node_cmp()
163 struct rb_node *n; in validate_search()
190 struct rb_node *next = rb_node_next(n); in validate_search()
197 struct rb_node *prev = rb_node_prev(n); in validate_search()
/third_party/e2fsprogs/lib/ext2fs/
Drbtree.h101 struct rb_node struct
106 struct rb_node *rb_right; argument
107 struct rb_node *rb_left; argument
113 struct rb_node *rb_node; member
117 #define ext2fs_rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
124 static inline void ext2fs_rb_set_parent(struct rb_node *rb, struct rb_node *p) in ext2fs_rb_set_parent()
128 static inline void ext2fs_rb_set_color(struct rb_node *rb, int color) in ext2fs_rb_set_color()
138 return root->rb_node == NULL; in ext2fs_rb_empty_root()
141 static inline int ext2fs_rb_empty_node(struct rb_node *node) in ext2fs_rb_empty_node()
146 static inline void ext2fs_rb_clear_node(struct rb_node *node) in ext2fs_rb_clear_node()
[all …]
Drbtree.c25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
27 struct rb_node *right = node->rb_right; in __rb_rotate_left()
28 struct rb_node *parent = ext2fs_rb_parent(node); in __rb_rotate_left()
44 root->rb_node = right; in __rb_rotate_left()
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
51 struct rb_node *parent = ext2fs_rb_parent(node); in __rb_rotate_right()
67 root->rb_node = left; in __rb_rotate_right()
71 void ext2fs_rb_insert_color(struct rb_node *node, struct rb_root *root) in ext2fs_rb_insert_color()
73 struct rb_node *parent, *gparent; in ext2fs_rb_insert_color()
[all …]
Dblkmap64_rb.c38 struct rb_node node;
54 inline static struct bmap_rb_extent *node_to_extent(struct rb_node *node) in node_to_extent()
74 struct rb_node *node = NULL; in print_tree()
91 struct rb_node *node; in check_tree()
225 struct rb_node *node, *next; in rb_free_tree()
251 struct rb_node *dest_node, *src_node, *dest_last, **n; in rb_copy_bmap()
274 n = &dest_bp->root.rb_node; in rb_copy_bmap()
294 struct rb_node *node; in rb_truncate()
338 struct rb_node *parent = NULL, *next; in rb_test_bit()
339 struct rb_node **n = &bp->root.rb_node; in rb_test_bit()
[all …]
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
Drbtree.h43 struct rb_node { struct
44 RB_ENTRY(rb_node) __entry;
54 struct rb_node *rb_node; member
60 int panic_cmp(struct rb_node *one, struct rb_node *two);
62 RB_HEAD(linux_root, rb_node);
63 RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);
87 rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node()
88 struct rb_node **rb_link) in rb_link_node()
97 rb_replace_node(struct rb_node *victim, struct rb_node *newnode, in rb_replace_node()
100 struct rb_node *p; in rb_replace_node()
[all …]
/third_party/mesa3d/src/microsoft/compiler/
Ddxil_function.c84 struct rb_node node;
91 func_rb_node(const struct rb_node *n) in func_rb_node()
97 func_compare_to_name_and_overload(const struct rb_node *node, const void *data) in func_compare_to_name_and_overload()
130 const struct rb_node *node = rb_tree_search(mod->functions, &descr, in dxil_get_function()
138 static int func_compare_name(const struct rb_node *lhs, const struct rb_node *rhs) in func_compare_name()
/third_party/mesa3d/src/freedreno/decode/
Dbuffers.c36 struct rb_node node;
54 buffer_insert_cmp(const struct rb_node *n1, const struct rb_node *n2) in buffer_insert_cmp()
67 buffer_search_cmp(const struct rb_node *node, const void *addrptr) in buffer_search_cmp()
/third_party/mesa3d/src/intel/tools/
Daub_mem.c41 struct rb_node node;
47 struct rb_node node;
81 struct rb_node *node = rb_node_next(&entry->node); in ggtt_entry_next()
98 cmp_ggtt_entry(const struct rb_node *node, const void *addr) in cmp_ggtt_entry()
107 struct rb_node *node = rb_tree_search_sloppy(&mem->ggtt, &virt_addr, in ensure_ggtt_entry()
125 struct rb_node *node = rb_tree_search(&mem->ggtt, &virt_addr, cmp_ggtt_entry); in search_ggtt_entry()
134 cmp_phys_mem(const struct rb_node *node, const void *addr) in cmp_phys_mem()
160 struct rb_node *node = rb_tree_search_sloppy(&mem->mem, &phys_addr, cmp_phys_mem); in ensure_phys_mem()
186 struct rb_node *node = rb_tree_search(&mem->mem, &phys_addr, cmp_phys_mem); in search_phys_mem()
/third_party/mesa3d/src/freedreno/ir3/
Dir3_ra.h197 struct rb_node node;
238 ir3_rb_node_to_interval(struct rb_node *node) in ir3_rb_node_to_interval()
244 ir3_rb_node_to_interval_const(const struct rb_node *node) in ir3_rb_node_to_interval_const()
252 struct rb_node *next = rb_node_next(&interval->node); in ir3_reg_interval_next()
Dir3_ra.c52 ir3_reg_interval_cmp(const struct rb_node *node, const void *data) in ir3_reg_interval_cmp()
68 struct rb_node *node = rb_tree_search(tree, &offset, ir3_reg_interval_cmp); in ir3_reg_interval_search()
75 struct rb_node *node = in ir3_reg_interval_search_sloppy()
102 ir3_reg_interval_insert_cmp(const struct rb_node *_a, const struct rb_node *_b) in ir3_reg_interval_insert_cmp()
288 struct rb_node physreg_node;
394 rb_node_to_interval(struct rb_node *node) in rb_node_to_interval()
400 rb_node_to_interval_const(const struct rb_node *node) in rb_node_to_interval_const()
408 struct rb_node *next = rb_node_next(&interval->physreg_node); in ra_interval_next()
419 ra_interval_cmp(const struct rb_node *node, const void *data) in ra_interval_cmp()
434 struct rb_node *node = rb_tree_search_sloppy(tree, &reg, ra_interval_cmp); in ra_interval_search_sloppy()
[all …]
Dir3_spill.c52 struct rb_node node;
53 struct rb_node half_node;
365 ra_spill_interval_cmp(const struct rb_node *_a, const struct rb_node *_b) in ra_spill_interval_cmp()
375 ra_spill_interval_half_cmp(const struct rb_node *_a, const struct rb_node *_b) in ra_spill_interval_half_cmp()
/third_party/e2fsprogs/e2fsck/
Dencrypted_files.c122 struct rb_node node;
225 struct rb_node **new = &info->policies.rb_node; in get_encryption_policy_id()
226 struct rb_node *parent = NULL; in get_encryption_policy_id()
438 entry = ext2fs_rb_entry(policies->rb_node, in destroy_encryption_policy_map()
/third_party/FreeBSD/sys/compat/linuxkpi/common/src/
Dadp.c196 int panic_cmp(struct rb_node *one, struct rb_node *two) in panic_cmp()
202 RB_GENERATE(linux_root, rb_node, __entry, panic_cmp);