Lines Matching defs:root
71 struct rb_root *root;
85 struct rb_root root;
160 #define TREE_ROOT(d, name) (&d->trees[MTDSWAP_ ## name].root)
194 if (eb->root) {
195 tp = container_of(eb->root, struct mtdswap_tree, root);
199 rb_erase(&eb->rb, eb->root);
203 static void __mtdswap_rb_add(struct rb_root *root, struct swap_eb *eb)
208 p = &root->rb_node;
219 rb_insert_color(&eb->rb, root);
224 struct rb_root *root;
226 if (eb->root == &d->trees[idx].root)
230 root = &d->trees[idx].root;
231 __mtdswap_rb_add(root, eb);
232 eb->root = root;
236 static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx)
241 p = rb_first(root);
259 eb->root = NULL;
578 eb->root = NULL;
767 if (d->trees[idx].root.rb_node != NULL)
805 struct rb_root *root;
809 root = &d->trees[i].root;
810 if (root->rb_node == NULL)
813 wear = d->max_erase_count - MTDSWAP_ECNT_MIN(root);
860 rp = &d->trees[idx].root;
864 eb->root = NULL;
1186 struct rb_root *root = &d->trees[i].root;
1188 if (root->rb_node) {
1190 min[i] = MTDSWAP_ECNT_MIN(root);
1191 max[i] = MTDSWAP_ECNT_MAX(root);
1259 struct dentry *root = d->mtd->dbg.dfs_dir;
1264 if (IS_ERR_OR_NULL(root))
1267 debugfs_create_file("mtdswap_stats", S_IRUSR, root, d, &mtdswap_fops);
1288 d->trees[i].root = RB_ROOT;