30 struct e_node {  struct
44 		kmem_cache_create("ntfs3_enode_cache", sizeof(struct e_node), 0,  in ntfs3_init_bitmap()  argument
136 				rb_entry(node, struct e_node, start.node));  in wnd_close()
166 static inline bool rb_insert_count(struct rb_root *root, struct e_node *e)  in rb_insert_count()
174 		struct e_node *k =  in rb_insert_count()
175 			rb_entry(parent = *p, struct e_node, count.node);  in rb_insert_count()
199 static inline bool rb_insert_start(struct rb_root *root, struct e_node *e)  in rb_insert_start()
206 		struct e_node *k;  in rb_insert_start()
210 		k = rb_entry(parent, struct e_node, start.node);  in rb_insert_start()
233 	struct e_node *e, *e0 = NULL;  in wnd_add_free_ext()
251 			e = rb_entry(n, struct e_node, start.node);  in wnd_add_free_ext()
267 			e = rb_entry(n, struct e_node, start.node);  in wnd_add_free_ext()
319 		e = rb_entry(n, struct e_node, count.node);  in wnd_add_free_ext()
324 			struct e_node *e2;  in wnd_add_free_ext()
327 			e2 = rb_entry(n, struct e_node, count.node);  in wnd_add_free_ext()
364 	struct e_node *e, *e3;  in wnd_remove_free_ext()
374 	e = rb_entry(n, struct e_node, start.node);  in wnd_remove_free_ext()
394 			e3 = rb_entry(n3, struct e_node, start.node);  in wnd_remove_free_ext()
420 			n3 ? rb_entry(n3, struct e_node, count.node)->count.key  in wnd_remove_free_ext()
435 			e3 = rb_entry(n3, struct e_node, count.node);  in wnd_remove_free_ext()
465 		e = rb_entry(rb_last(&wnd->count_tree), struct e_node,  in wnd_remove_free_ext()
864 	struct e_node *e;  in wnd_is_free()
873 	e = rb_entry(n, struct e_node, start.node);  in wnd_is_free()
900 	struct e_node *e;  in wnd_is_used()
910 	e = rb_entry(n, struct e_node, start.node);  in wnd_is_used()
963 	const struct e_node *e;  in wnd_find()
1010 		e = rb_entry(cr, struct e_node, start.node);  in wnd_find()
1025 			e = pr ? rb_entry(pr, struct e_node, start.node) : NULL;  in wnd_find()
1056 	e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node);  in wnd_find()