sort_info
struct ext2fs_htree_sort_entry *sort_info;
sort_info = (struct ext2fs_htree_sort_entry *)
sort_info--;
sort_info->h_size = ep->e2d_reclen;
sort_info->h_offset = htole16((char *)ep - block1);
&sort_info->h_hash, NULL);
sort_info->h_hash = htole32(sort_info->h_hash);
qsort(sort_info, entry_cnt, sizeof(struct ext2fs_htree_sort_entry),
if (le16toh(sort_info[i].h_size) + size > blksize / 2)
size += le16toh(sort_info[i].h_size);
*split_hash = le32toh(sort_info[i + 1].h_hash);
if (*split_hash == le32toh(sort_info[i].h_hash))
le16toh(sort_info[k].h_offset));
const struct sort_info *info;
const struct sort_info *sort_info)
compare = sort_info->si_compare;
const struct sort_info *
const struct sort_info *info;
const struct sort_info *get_sort_info(const char *name);
struct sort_info;
const struct sort_info *);
const struct sort_info *new_sort_info;
sort_info = new_sort_info;
const struct sort_info *sort_info = NULL;
if ((sort_info = get_sort_info(order_name)) == NULL) {
sort_info = get_sort_info(NULL);
get_process_info(&system_info, &ps, sort_info);