Lines Matching defs:to
15 * Big-endian to little-endian byte-swapping/bitmaps by
45 * define how far ahead to read directories while searching them.
166 static struct ext3_dir_entry_2 *dx_move_dirents (char *from, char *to,
321 * Probe for a directory leaf block to search.
324 * error in the directory index, and the caller should fall back to
327 * back to userspace.
449 * This function increments the frame pointer to search the next leaf
456 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
458 * This function returns 1 if the caller should continue to search,
481 * nodes need to be read.
495 * handling. Otherwise, check to see if the hash matches the
497 * there's no point to read in the successive index pages.
507 * If the hash is HASH_NB_ALWAYS, we always go to the next
557 /* On error, skip the f_pos to the next block. */
786 /* found a match - just to be sure, do a full check */
810 * entry - you'll have to do that yourself if you want to.
813 * to brelse() it when appropriate.
845 * return. Otherwise, fall back to doing a search the
978 /* Check to see if we should continue to search */
1084 dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count)
1091 memcpy (to, de, rec_len);
1092 ((struct ext3_dir_entry_2 *) to)->rec_len =
1096 to += rec_len;
1098 return (struct ext3_dir_entry_2 *) (to - rec_len);
1103 struct ext3_dir_entry_2 *next, *to, *prev, *de = (struct ext3_dir_entry_2 *) base;
1106 prev = to = de;
1112 if (de > to)
1113 memmove(to, de, rec_len);
1114 to->rec_len = cpu_to_le16(rec_len);
1115 prev = to;
1116 to = (struct ext3_dir_entry_2 *) (((char *) to) + rec_len);
1162 split = count/2; // need to adjust to actual middle
1169 /* Fancy dance to stay within two buffers */
1208 * it points to a directory entry which is guaranteed to be large
1292 * This converts a one block unindexed directory to a 3 block indexed
1293 * directory, and adds the dentry to the indexed directory.
1374 * adds a file entry to the specified directory, using the same
1474 /* Need to split index? */
1775 * routine to check that the specified directory is empty (for rmdir)
1891 /* Only add to the head of the in-memory list if all the
1892 * previous operations succeeded. If the orphan_add is going to
1897 * This is safe: on error we're going to ignore the orphan list
1902 jbd_debug(4, "superblock will point to %lu\n", inode->i_ino);
1903 jbd_debug(4, "orphan inode %lu will point to %d\n",
1939 * transaction handle with which to update the orphan list on
1940 * disk, but we still need to remove the inode from the linked
1950 jbd_debug(4, "superblock will point to %lu\n", ino_next);
1962 jbd_debug(4, "orphan inode %lu will point to %lu\n",
2028 /* There's no need to set i_disksize: the fact that i_nlink is
2166 * otherwise has the potential to corrupt the orphan inode list.
2196 * Anybody can rename anything with this: the permission checks are left to the
2225 * Check for inode number is _not_ due to possible IO errors.
2227 * and merrily kill the link to whatever was created under the
2295 * also be pointing to a stale entry in the unused part of