Lines Matching refs:e_node
30 struct e_node { struct
44 kmem_cache_create("ntfs3_enode_cache", sizeof(struct e_node), 0, in ntfs3_init_bitmap() argument
141 rb_entry(node, struct e_node, start.node)); in wnd_close()
171 static inline bool rb_insert_count(struct rb_root *root, struct e_node *e) in rb_insert_count()
179 struct e_node *k = in rb_insert_count()
180 rb_entry(parent = *p, struct e_node, count.node); in rb_insert_count()
204 static inline bool rb_insert_start(struct rb_root *root, struct e_node *e) in rb_insert_start()
211 struct e_node *k; in rb_insert_start()
215 k = rb_entry(parent, struct e_node, start.node); in rb_insert_start()
238 struct e_node *e, *e0 = NULL; in wnd_add_free_ext()
256 e = rb_entry(n, struct e_node, start.node); in wnd_add_free_ext()
272 e = rb_entry(n, struct e_node, start.node); in wnd_add_free_ext()
324 e = rb_entry(n, struct e_node, count.node); in wnd_add_free_ext()
329 struct e_node *e2; in wnd_add_free_ext()
332 e2 = rb_entry(n, struct e_node, count.node); in wnd_add_free_ext()
369 struct e_node *e, *e3; in wnd_remove_free_ext()
379 e = rb_entry(n, struct e_node, start.node); in wnd_remove_free_ext()
399 e3 = rb_entry(n3, struct e_node, start.node); in wnd_remove_free_ext()
425 n3 ? rb_entry(n3, struct e_node, count.node)->count.key in wnd_remove_free_ext()
440 e3 = rb_entry(n3, struct e_node, count.node); in wnd_remove_free_ext()
470 e = rb_entry(rb_last(&wnd->count_tree), struct e_node, in wnd_remove_free_ext()
869 struct e_node *e; in wnd_is_free()
878 e = rb_entry(n, struct e_node, start.node); in wnd_is_free()
905 struct e_node *e; in wnd_is_used()
915 e = rb_entry(n, struct e_node, start.node); in wnd_is_used()
968 const struct e_node *e; in wnd_find()
1015 e = rb_entry(cr, struct e_node, start.node); in wnd_find()
1030 e = pr ? rb_entry(pr, struct e_node, start.node) : NULL; in wnd_find()
1061 e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node); in wnd_find()