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
58 applied to the i'th blksize-sized chunk of the input data.
70 kernels up to at least 2.3.39 didn't support holes.  Run mkcramfs
71 with -z if you want it to create files that can have holes in them.
87 (Block size in cramfs refers to the size of input data that is
88 compressed at a time.  It's intended to be somewhere around
91 The superblock ought to indicate the block size that the fs was
102 One option is to change mkcramfs to take its PAGE_CACHE_SIZE from
105 PAGE_CACHE_SIZE (4096)' to `#include <asm/page.h>'.  The disadvantage
108 PAGE_CACHE_SIZE is subject to change between kernel versions
111 The remaining options try to make cramfs more sharable.
118 The cost of swabbing is changing the code to use the le32_to_cpu
119 etc. macros as used by ext2fs.  We don't need to swab the compressed
131   3. Writer chooses blocksize; kernel adapts even to blocksize >
134 It's easy enough to change the kernel to use a smaller value than
140 The cost of option 2 relative to option 1 is that the code uses
143 they don't mind their cramfs being inaccessible to kernels with
146 Option 3 is easy to implement if we don't mind being CPU-inefficient:
147 e.g. get readpage to decompress to a buffer of size MAX_BLKSIZE (which
149 Getting readpage to read into all the covered pages is harder.
165 silicon ROMs, it might make sense to expand the inode a little from
167 by filename, so the expansion doesn't even have to be a multiple of 4