Lines Matching refs:node
534 struct rb_node *node;
538 for (node = rb_first(&cache->rb_root); node; node = rb_next(node)) {
539 ent = rb_entry(node, struct mlx5_cache_ent, node);
691 /* Figure out where to put new node */
693 cur = rb_entry(*new, struct mlx5_cache_ent, node);
706 /* Add new node and rebalance tree. */
707 rb_link_node(&ent->node, parent, new);
708 rb_insert_color(&ent->node, &cache->rb_root);
717 struct rb_node *node = dev->cache.rb_root.rb_node;
724 while (node) {
725 cur = rb_entry(node, struct mlx5_cache_ent, node);
729 node = node->rb_left;
732 node = node->rb_right;
945 ent = rb_entry(cur, struct mlx5_cache_ent, node);
971 struct rb_node *node;
1003 for (node = rb_first(root); node; node = rb_next(node)) {
1004 ent = rb_entry(node, struct mlx5_cache_ent, node);
1023 struct rb_node *node;
1030 for (node = rb_first(root); node; node = rb_next(node)) {
1031 ent = rb_entry(node, struct mlx5_cache_ent, node);
1050 node = rb_first(root);
1051 while (node) {
1052 ent = rb_entry(node, struct mlx5_cache_ent, node);
1053 node = rb_next(node);
1055 rb_erase(&ent->node, root);