Lines Matching refs:node
153 struct rb_node node;
291 struct rb_node node;
1235 struct dm_integrity_range *range = container_of(*n, struct dm_integrity_range, node);
1239 n = &range->node.rb_left;
1241 n = &range->node.rb_right;
1246 rb_link_node(&new_range->node, parent, n);
1247 rb_insert_color(&new_range->node, &ic->in_progress);
1254 rb_erase(&range->node, &ic->in_progress);
1300 static void init_journal_node(struct journal_node *node)
1302 RB_CLEAR_NODE(&node->node);
1303 node->sector = (sector_t)-1;
1306 static void add_journal_node(struct dm_integrity_c *ic, struct journal_node *node, sector_t sector)
1311 node->sector = sector;
1312 BUG_ON(!RB_EMPTY_NODE(&node->node));
1321 j = container_of(parent, struct journal_node, node);
1323 link = &j->node.rb_left;
1325 link = &j->node.rb_right;
1328 rb_link_node(&node->node, parent, link);
1329 rb_insert_color(&node->node, &ic->journal_tree_root);
1332 static void remove_journal_node(struct dm_integrity_c *ic, struct journal_node *node)
1334 BUG_ON(RB_EMPTY_NODE(&node->node));
1335 rb_erase(&node->node, &ic->journal_tree_root);
1336 init_journal_node(node);
1348 struct journal_node *j = container_of(n, struct journal_node, node);
1355 n = j->node.rb_left;
1357 n = j->node.rb_right;
1365 struct journal_node *node, *next_node;
1370 node = &ic->journal_tree[pos];
1371 if (unlikely(RB_EMPTY_NODE(&node->node)))
1373 if (unlikely(node->sector != sector))
1376 next = rb_next(&node->node);
1380 next_node = container_of(next, struct journal_node, node);
1384 static bool find_newer_committed_node(struct dm_integrity_c *ic, struct journal_node *node)
1390 BUG_ON(RB_EMPTY_NODE(&node->node));
1392 next = rb_next(&node->node);
1396 next_node = container_of(next, struct journal_node, node);
1398 if (next_node->sector != node->sector)