Lines Matching defs:to
17 * Big-endian to little-endian byte-swapping/bitmaps by
60 * ext2_get_inode(), so we need to check that to avoid freeing random disk
159 static inline int verify_chain(Indirect *from, Indirect *to)
161 while (from <= to && from->key == *from->p)
163 return (from > to);
169 * @i_block: block number to be parsed
170 * @offsets: array to store the offsets in
171 * @boundary: set this non-zero if the referred-to block is likely to be
178 * pointer to (n+1)th node in the nth one. If @block is out of range
182 * we need to know is the capacity of indirect blocks (taken from the
192 * i_block would have to be negative in the very beginning, so we would not
236 * ext2_get_branch - read the chain of indirect blocks leading to data
240 * @chain: place to store the result
244 * if everything went OK or the pointer to the last filled triple
249 * for i>0) and chain[i].bh points to the buffer_head of i-th indirect
256 * (pointer to last triple returned, *@err == 0)
262 * the whole chain, all way to the data (returns %NULL, *err == 0).
312 * + if there is a block to the left of our position - allocate near it.
316 * In the latter case we colour the starting block by the callers PID to
332 /* Try to find previous block */
342 * It is going to be refered from inode itself? OK, just put it into
357 * @partial: pointer to the last triple within a chain
358 * @goal: place to store the result.
380 * failing that at least try to get decent locality.
396 * @num: depth of the chain (number of blocks to allocate)
397 * @offsets: offsets (in the blocks) to store the pointers to next.
398 * @branch: place to store the chain in.
401 * links them into chain and (if we are synchronous) writes them to disk.
405 * we had read the existing part of chain and partial points to the last
410 * be placed into *branch->p to fill that gap.
440 * the pointer to new one, then send parent to disk.
455 /* We used to sync bh here if IS_SYNC(inode).
483 * This function verifies that chain (up to the missing link) had not
486 * chain to new block and return 0. Otherwise (== chain had been changed)
500 /* Verify that place we are splicing to is still there and vacant */
535 * Allocation strategy is simple: if we have to allocate something, we will
536 * have to go the whole way to leaf. So let's do it before attaching anything
537 * to tree, set linkage between the newborn blocks, write them if sync is
606 * we need to clear the block
647 unsigned from, unsigned to)
649 return block_prepare_write(page,from,to,ext2_get_block);
654 unsigned from, unsigned to)
656 return nobh_prepare_write(page,from,to,ext2_get_block);
736 * @chain: place to store the pointers to partial indirect blocks
737 * @top: place to the (detached) top of branch
741 * When we do truncate() we may have to clean the ends of several indirect
744 * it is on the path to the first completely truncated data block, indeed).
745 * We have to free the top of that path along with everything to the right
749 * point might try to populate it.
752 * number of its root in *@top, pointers to buffer_heads of partially
753 * truncated blocks - in @chain[].bh and pointers to their last elements
755 * to last filled element of @chain.
757 * The work left to caller to do the actual freeing of subtrees:
782 * fine, it should all survive and (new) top doesn't belong to us.
795 * it's easier to cheat and just decrement partial->p.
833 /* accumulate blocks to free if they're contiguous */
858 * @depth: depth of the branches to free
1035 "unable to read inode block - inode=%lu, block=%lu",
1058 /* Propagate flags from i_flags to EXT2_I(inode)->i_flags */
1106 /* We now have enough fields to check if the inode was active or not.
1107 * This is needed because nfsd might try to access dead inodes
1206 * initialise them to zero for new inodes. */
1255 * created, add a flag to the superblock.