84 	blk_t max_array, num_array;  member
197 		if (fd->num_array >= fd->max_array) {  in fill_dir_block()
210 		ent = fd->harray + fd->num_array++;  in fill_dir_block()
477 	for (i=1; i < fd->num_array; i++) {  in duplicate_search_and_fix()
511 		for (j=0; j < fd->num_array; j++) {  in duplicate_search_and_fix()
586 	for (i = 0; i < fd->num_array; i++) {  in copy_dir_entries()
1044 		fd.num_array = 0;  in e2fsck_rehash_dir()
1050 	       fd.num_array, fd.dir_size, ino);  in e2fsck_rehash_dir()
1055 	if (fd.compress && fd.num_array > 1)  in e2fsck_rehash_dir()
1056 		sort_r(fd.harray+2, fd.num_array-2, sizeof(struct hash_entry),  in e2fsck_rehash_dir()
1059 		sort_r(fd.harray, fd.num_array, sizeof(struct hash_entry),  in e2fsck_rehash_dir()
1074 	if (fd.compress && fd.num_array > 1)  in e2fsck_rehash_dir()
1075 		qsort(fd.harray+2, fd.num_array-2,  in e2fsck_rehash_dir()