Lines Matching refs:node
143 struct rb_node node;
279 struct rb_node node;
1133 struct dm_integrity_range *range = container_of(*n, struct dm_integrity_range, node);
1137 n = &range->node.rb_left;
1139 n = &range->node.rb_right;
1145 rb_link_node(&new_range->node, parent, n);
1146 rb_insert_color(&new_range->node, &ic->in_progress);
1153 rb_erase(&range->node, &ic->in_progress);
1198 static void init_journal_node(struct journal_node *node)
1200 RB_CLEAR_NODE(&node->node);
1201 node->sector = (sector_t)-1;
1204 static void add_journal_node(struct dm_integrity_c *ic, struct journal_node *node, sector_t sector)
1209 node->sector = sector;
1210 BUG_ON(!RB_EMPTY_NODE(&node->node));
1218 j = container_of(parent, struct journal_node, node);
1220 link = &j->node.rb_left;
1222 link = &j->node.rb_right;
1225 rb_link_node(&node->node, parent, link);
1226 rb_insert_color(&node->node, &ic->journal_tree_root);
1229 static void remove_journal_node(struct dm_integrity_c *ic, struct journal_node *node)
1231 BUG_ON(RB_EMPTY_NODE(&node->node));
1232 rb_erase(&node->node, &ic->journal_tree_root);
1233 init_journal_node(node);
1244 struct journal_node *j = container_of(n, struct journal_node, node);
1250 n = j->node.rb_left;
1252 n = j->node.rb_right;
1261 struct journal_node *node, *next_node;
1266 node = &ic->journal_tree[pos];
1267 if (unlikely(RB_EMPTY_NODE(&node->node)))
1269 if (unlikely(node->sector != sector))
1272 next = rb_next(&node->node);
1276 next_node = container_of(next, struct journal_node, node);
1280 static bool find_newer_committed_node(struct dm_integrity_c *ic, struct journal_node *node)
1286 BUG_ON(RB_EMPTY_NODE(&node->node));
1288 next = rb_next(&node->node);
1292 next_node = container_of(next, struct journal_node, node);
1294 if (next_node->sector != node->sector)