30 		mi = rb_entry(pr, struct mft_inode, node);  in ni_ins_mi()
44 	return rb_entry(ins, struct mft_inode, node);  in ni_ins_mi()
60 	ni_ins_mi(ni, &ni->mi_tree, mi->rno, &mi->node);  in ni_add_mi()
68 	rb_erase(&mi->node, &ni->mi_tree);  in ni_remove_mi()
103 	struct rb_node *node;  in ni_clear()  local
112 	for (node = rb_first(&ni->mi_tree); node;) {  in ni_clear()
113 		struct rb_node *next = rb_next(node);  in ni_clear()
114 		struct mft_inode *mi = rb_entry(node, struct mft_inode, node);  in ni_clear()
116 		rb_erase(node, &ni->mi_tree);  in ni_clear()
118 		node = next;  in ni_clear()
899 	struct rb_node *node;  in ni_ins_attr_ext()  local
940 	for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {  in ni_ins_attr_ext()
941 		mi = rb_entry(node, struct mft_inode, node);  in ni_ins_attr_ext()
1197 	struct rb_node *node;  in ni_expand_mft_list()  local
1207 	for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {  in ni_expand_mft_list()
1208 		mi = rb_entry(node, struct mft_inode, node);  in ni_expand_mft_list()
1522 	struct rb_node *node;  in ni_delete_all()  local
1570 	for (node = rb_first(&ni->mi_tree); node;) {  in ni_delete_all()
1571 		struct rb_node *next = rb_next(node);  in ni_delete_all()
1572 		struct mft_inode *mi = rb_entry(node, struct mft_inode, node);  in ni_delete_all()
1581 		node = next;  in ni_delete_all()
3055 	struct rb_node *node;  in ni_is_dirty()  local
3061 	for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {  in ni_is_dirty()
3062 		if (rb_entry(node, struct mft_inode, node)->dirty)  in ni_is_dirty()
3196 	struct rb_node *node, *next;  in ni_write_inode()  local
3286 	for (node = rb_first(&ni->mi_tree); node; node = next) {  in ni_write_inode()
3287 		struct mft_inode *mi = rb_entry(node, struct mft_inode, node);  in ni_write_inode()
3290 		next = rb_next(node);  in ni_write_inode()
3306 			rb_erase(node, &ni->mi_tree);  in ni_write_inode()