83 	int max_array, num_array;  member
170 		if (fd->num_array >= fd->max_array) {  in fill_dir_block()
180 		ent = fd->harray + fd->num_array++;  in fill_dir_block()
383 	for (i=1; i < fd->num_array; i++) {  in duplicate_search_and_fix()
403 		for (j=0; j < fd->num_array; j++) {  in duplicate_search_and_fix()
474 	for (i = 0; i < fd->num_array; i++) {  in copy_dir_entries()
904 		fd.num_array = 0;  in e2fsck_rehash_dir()
910 	       fd.num_array, fd.dir_size, ino);  in e2fsck_rehash_dir()
915 	if (fd.compress && fd.num_array > 1)  in e2fsck_rehash_dir()
916 		qsort(fd.harray+2, fd.num_array-2, sizeof(struct hash_entry),  in e2fsck_rehash_dir()
919 		qsort(fd.harray, fd.num_array, sizeof(struct hash_entry),  in e2fsck_rehash_dir()
934 	if (fd.compress && fd.num_array > 1)  in e2fsck_rehash_dir()
935 		qsort(fd.harray+2, fd.num_array-2,  in e2fsck_rehash_dir()