Searched refs:uinterval_node (Results 1 – 4 of 4) sorted by relevance
| /external/mesa3d/src/util/ |
| D | rb_tree.c | 561 const struct uinterval_node *a = rb_node_data(struct uinterval_node, _a, node); in uinterval_node_cmp()
562 const struct uinterval_node *b = rb_node_data(struct uinterval_node, _b, node); in uinterval_node_cmp()
570 const struct uinterval_node *node = rb_node_data(struct uinterval_node, _node, node); in uinterval_search_cmp()
579 const struct uinterval_node *node = rb_node_data(struct uinterval_node, _node, node); in uinterval_max_cmp()
588 struct uinterval_node *node = rb_node_data(struct uinterval_node, _node, node); in uinterval_update_max()
591 struct uinterval_node *left = rb_node_data(struct uinterval_node, node->node.left, node); in uinterval_update_max()
595 struct uinterval_node *right = rb_node_data(struct uinterval_node, node->node.right, node); in uinterval_update_max()
601 uinterval_tree_insert(struct rb_tree *tree, struct uinterval_node *node) in uinterval_tree_insert()
608 uinterval_tree_remove(struct rb_tree *tree, struct uinterval_node *node) in uinterval_tree_remove()
613 struct uinterval_node *
[all …]
|
| D | rb_tree.h | 411 struct uinterval_node { struct
422 void uinterval_tree_insert(struct rb_tree *tree, struct uinterval_node *node); argument
425 void uinterval_tree_remove(struct rb_tree *tree, struct uinterval_node *node);
428 struct uinterval_node *uinterval_tree_first(struct rb_tree *tree,
432 struct uinterval_node *uinterval_node_next(struct uinterval_node *node,
454 (iter = rb_node_data(type, (struct uinterval_node *)__node, field), true); \
455 __node = (type *)uinterval_node_next((struct uinterval_node *)__node, interval))
|
| /external/mesa3d/src/freedreno/ir3/ |
| D | ir3_reconvergence.c | 68 struct uinterval_node node;
|
| /external/mesa3d/src/util/tests/ |
| D | rb_tree_test.cpp | 288 struct uinterval_node node;
|