Lines Matching defs:node
23 #include "node.h"
398 * This function balances dirty node and dentry pages.
415 * dir/node pages without enough free segments.
995 struct rb_node *node = dcc->root.rb_root.rb_node;
998 while (node) {
999 dc = rb_entry(node, struct discard_cmd, rb_node);
1002 node = node->rb_left;
1004 node = node->rb_right;
1058 /* lookup prev node for merging backward later */
1062 /* lookup next node for merging frontward later */
1372 /* look up rb tree to find parent node */
1461 struct rb_node *node;
1516 node = rb_next(&prev_dc->rb_node);
1517 next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);
1573 struct rb_node *node;
1590 node = rb_next(&dc->rb_node);
1593 dc = rb_entry_safe(node, struct discard_cmd, rb_node);
2995 /* For node segments, let's do SSR more intensively */
3168 struct rb_node *node;
3194 node = rb_next(&dc->rb_node);
3197 dc = rb_entry_safe(node, struct discard_cmd, rb_node);
4668 f2fs_err(sbi, "SIT is corrupted node# %u vs %u",