30 struct e_node {  struct
44 					      sizeof(struct e_node), 0,  in ntfs3_init_bitmap()  argument
137 				rb_entry(node, struct e_node, start.node));  in wnd_close()
167 static inline bool rb_insert_count(struct rb_root *root, struct e_node *e)  in rb_insert_count()
175 		struct e_node *k =  in rb_insert_count()
176 			rb_entry(parent = *p, struct e_node, count.node);  in rb_insert_count()
200 static inline bool rb_insert_start(struct rb_root *root, struct e_node *e)  in rb_insert_start()
207 		struct e_node *k;  in rb_insert_start()
211 		k = rb_entry(parent, struct e_node, start.node);  in rb_insert_start()
234 	struct e_node *e, *e0 = NULL;  in wnd_add_free_ext()
252 			e = rb_entry(n, struct e_node, start.node);  in wnd_add_free_ext()
268 			e = rb_entry(n, struct e_node, start.node);  in wnd_add_free_ext()
320 		e = rb_entry(n, struct e_node, count.node);  in wnd_add_free_ext()
325 			struct e_node *e2;  in wnd_add_free_ext()
328 			e2 = rb_entry(n, struct e_node, count.node);  in wnd_add_free_ext()
365 	struct e_node *e, *e3;  in wnd_remove_free_ext()
375 	e = rb_entry(n, struct e_node, start.node);  in wnd_remove_free_ext()
395 			e3 = rb_entry(n3, struct e_node, start.node);  in wnd_remove_free_ext()
421 			n3 ? rb_entry(n3, struct e_node, count.node)->count.key :  in wnd_remove_free_ext()
436 			e3 = rb_entry(n3, struct e_node, count.node);  in wnd_remove_free_ext()
466 		e = rb_entry(rb_last(&wnd->count_tree), struct e_node,  in wnd_remove_free_ext()
897 	struct e_node *e;  in wnd_is_free()
906 	e = rb_entry(n, struct e_node, start.node);  in wnd_is_free()
933 	struct e_node *e;  in wnd_is_used()
943 	e = rb_entry(n, struct e_node, start.node);  in wnd_is_used()
995 	const struct e_node *e;  in wnd_find()
1042 		e = rb_entry(cr, struct e_node, start.node);  in wnd_find()
1057 			e = pr ? rb_entry(pr, struct e_node, start.node) : NULL;  in wnd_find()
1088 	e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node);  in wnd_find()