314 	struct ext4_dir_entry *d, *top;  in get_dirent_tail()  local
317 	top = (struct ext4_dir_entry *)(bh->b_data +  in get_dirent_tail()
320 	while (d < top && d->rec_len)  in get_dirent_tail()
324 	if (d != top)  in get_dirent_tail()
991 	struct ext4_dir_entry_2 *de, *top;  in htree_dirblock_to_tree()  local
1002 	top = (struct ext4_dir_entry_2 *) ((char *) de +  in htree_dirblock_to_tree()
1021 	for (; de < top; de = ext4_next_entry(de, dir->i_sb->s_blocksize)) {  in htree_dirblock_to_tree()
1235 	struct dx_map_entry *p, *q, *top = map + count - 1;  in dx_sort_map()  local
1242 		for (p = top, q = p - count; q >= map; p--, q--)  in dx_sort_map()
1249 		q = top;  in dx_sort_map()
1926 	char *top;  in ext4_find_dest_de()  local
1929 	top = buf + buf_size - reclen;  in ext4_find_dest_de()
1930 	while ((char *) de <= top) {  in ext4_find_dest_de()
1943 	if ((char *) de > top)  in ext4_find_dest_de()
2045 	char		*data2, *top;  in make_indexed_dir()  local
2089 	top = data2 + len;  in make_indexed_dir()
2090 	while ((char *)(de2 = ext4_next_entry(de, blocksize)) < top)  in make_indexed_dir()