613 		struct indx_node *n = fnd->nodes[i];  in fnd_clear()
625 static int fnd_push(struct ntfs_fnd *fnd, struct indx_node *n,  in fnd_push()
639 static struct indx_node *fnd_pop(struct ntfs_fnd *fnd)  in fnd_pop()
641 	struct indx_node *n;  in fnd_pop()
860 static struct indx_node *indx_new(struct ntfs_index *indx,  in indx_new()
866 	struct indx_node *r;  in indx_new()
874 	r = kzalloc(sizeof(struct indx_node), GFP_NOFS);  in indx_new()
942 		      struct indx_node *node, int sync)  in indx_write()
957 	      struct indx_node **node)  in indx_read()
965 	struct indx_node *in = *node;  in indx_read()
969 		in = kzalloc(sizeof(struct indx_node), GFP_NOFS);  in indx_read()
1046 	struct indx_node *node;  in indx_find()
1111 	struct indx_node *n = NULL;  in indx_find_sort()
1221 	struct indx_node *n = NULL;  in indx_find_raw()
1479 	struct indx_node *n;  in indx_insert_into_root()
1689 	struct indx_node *n2 = NULL;  in indx_insert_into_buffer()
1690 	struct indx_node *n1 = fnd->nodes[level];  in indx_insert_into_buffer()
1885 static struct indx_node *indx_find_buffer(struct ntfs_index *indx,  in indx_find_buffer()
1888 					  __le64 vbn, struct indx_node *n)  in indx_find_buffer()
1892 	struct indx_node *r;  in indx_find_buffer()
1997 	struct indx_node *n;  in indx_free_children()
2053 	struct indx_node *n;  in indx_get_entry_to_replace()
2146 	struct indx_node *n, *n2d = NULL;  in indx_delete_entry()
2304 		struct indx_node *in;  in indx_delete_entry()
2327 		struct indx_node *in = fnd->nodes[level - 1];  in indx_delete_entry()