Lines Matching defs:to
64 * Add an entry to a block directory.
75 int compact; /* need to compact leaf ents */
84 int lfloghigh=0; /* last final leaf to log */
85 int lfloglow=0; /* first final leaf to log */
91 int needlog; /* need to log header */
92 int needscan; /* need to rescan freespace */
93 __be16 *tagp; /* pointer to tag value */
120 * Set up pointers to parts of the block.
139 * the space before the first leaf entry needs to be free so it
140 * can be expanded to hold the pointer to the new entry.
153 * to hold the new leaf too?
181 * Is the biggest entry enough to avoid compaction?
189 * Will need to compact to make this work.
224 * Not trying to actually do anything, or don't have
230 * Convert to the next larger format.
276 * If we now need to rebuild the bestfree map, do so.
277 * This needs to happen before the next call to use_free.
285 * Set leaf logging boundaries to impossible state.
308 * No stale entries, will use enddup space to hold new leaf.
325 * If we now need to rebuild the bestfree map, do so.
326 * This needs to happen before the next call to use_free.
334 * Adjust pointer to the first leaf entry, we're about to move
335 * the table up one to open up space for the new leaf entry.
336 * Then adjust our index to match.
387 * Point to the new data entry.
525 * If it didn't fit, set the final offset to here & return.
538 * Set the offset to a non-existent block 1 and return.
624 * Get the offset from the leaf entry, to point to the data.
695 * Back up to the first one with the right hash value.
708 * Get pointer to the entry from the leaf.
733 * If that makes the block small enough to fit in shortform, transform it.
748 int needlog; /* need to log block header */
749 int needscan; /* need to fixup bestfree */
769 * Point to the data entry using the leaf entry.
814 * Change the inode number to the new value.
844 * Point to the data entry we need to change.
850 * Change the inode number to the new value.
877 * Convert a V2 leaf directory to a V2 block directory if possible.
896 int needlog; /* need to log data header */
897 int needscan; /* need to scan for bestfree */
901 int to; /* block/leaf to index */
913 * opportunity to remove trailing empty data blocks that may have
959 * Start converting it to block form.
980 for (from = to = 0; from < be16_to_cpu(leaf->hdr.count); from++) {
983 lep[to++] = leaf->ents[from];
985 ASSERT(to == be32_to_cpu(btp->count));
1003 * Now see if the resulting block can be shrunken to shortform.
1020 * Convert the shortform directory to block form.
1041 int needlog; /* need to log block header */
1042 int needscan; /* need to scan block freespc */
1083 * Add block 0 to the inode.
1106 * The whole thing is initialized to free by the init routine.
1165 * Need to preserve the existing offset values in the sf directory.