Lines Matching refs:to

23 		 null-padded to a multiple of 4 bytes.
25 The order of inode traversal is described as "width-first" (not to be
33 allows cramfs_lookup to return more quickly when a filename does not
44 	padding to multiple of 4 bytes
61 	aligned to a 4-byte boundary. The block size is either blksize
64 	the block data. This is used to allow discontiguous data layout
74 applied to the i'th blksize-sized chunk of the input data if the
99 kernels up to at least 2.3.39 didn't support holes.  Run mkcramfs
100 with -z if you want it to create files that can have holes in them.
116 (Block size in cramfs refers to the size of input data that is
117 compressed at a time.  It's intended to be somewhere around
120 The superblock ought to indicate the block size that the fs was
131 One option is to change mkcramfs to take its PAGE_SIZE from
134 PAGE_SIZE (4096)' to `#include <asm/page.h>'.  The disadvantage
137 PAGE_SIZE is subject to change between kernel versions
140 The remaining options try to make cramfs more sharable.
147 The cost of swabbing is changing the code to use the le32_to_cpu
148 etc. macros as used by ext2fs.  We don't need to swab the compressed
160   3. Writer chooses blocksize; kernel adapts even to blocksize >
163 It's easy enough to change the kernel to use a smaller value than
169 The cost of option 2 relative to option 1 is that the code uses
172 they don't mind their cramfs being inaccessible to kernels with
175 Option 3 is easy to implement if we don't mind being CPU-inefficient:
176 e.g. get readpage to decompress to a buffer of size MAX_BLKSIZE (which
178 Getting readpage to read into all the covered pages is harder.
194 silicon ROMs, it might make sense to expand the inode a little from
196 by filename, so the expansion doesn't even have to be a multiple of 4