60 	int max_array, num_array;  member
139 		if (fd->num_array >= fd->max_array) {  in fill_dir_block()
149 		ent = fd->harray + fd->num_array++;  in fill_dir_block()
350 	for (i=1; i < fd->num_array; i++) {  in duplicate_search_and_fix()
370 		for (j=0; j < fd->num_array; j++) {  in duplicate_search_and_fix()
438 	for (i = 0; i < fd->num_array; i++) {  in copy_dir_entries()
731 	fd.num_array = 0;  in e2fsck_rehash_dir()
763 		fd.num_array = 0;  in e2fsck_rehash_dir()
769 	       fd.num_array, fd.dir_size, ino);  in e2fsck_rehash_dir()
775 		qsort(fd.harray+2, fd.num_array-2, sizeof(struct hash_entry),  in e2fsck_rehash_dir()
778 		qsort(fd.harray, fd.num_array, sizeof(struct hash_entry),  in e2fsck_rehash_dir()
794 		qsort(fd.harray+2, fd.num_array-2,  in e2fsck_rehash_dir()