Techwizz/kernel-fxtec-pro1x
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Squashfs: Update documentation to include xattrs

Browse source 
One paragraph was not updated when xattrs were added to Squashfs.

Signed-off-by: Phillip Lougher <phillip@squashfs.org.uk>
This commit is contained in:
Phillip Lougher 2011-12-29 13:54:17 +00:00
parent e552a59668
commit 89cab5b572
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
Documentation/filesystems/squashfs.txt
View file

@ -93,8 +93,8 @@ byte alignment:
Compressed data blocks are written to the filesystem as files are read from Compressed data blocks are written to the filesystem as files are read from
the source directory, and checked for duplicates. Once all file data has been the source directory, and checked for duplicates. Once all file data has been
written the completed inode, directory, fragment, export and uid/gid lookup written the completed inode, directory, fragment, export, uid/gid lookup and
tables are written. xattr tables are written.
3.1 Compression options 3.1 Compression options
----------------------- -----------------------
@ -151,7 +151,7 @@ in each metadata block. Directories are sorted in alphabetical order,
and at lookup the index is scanned linearly looking for the first filename and at lookup the index is scanned linearly looking for the first filename
alphabetically larger than the filename being looked up. At this point the alphabetically larger than the filename being looked up. At this point the
location of the metadata block the filename is in has been found. location of the metadata block the filename is in has been found.
The general idea of the index is ensure only one metadata block needs to be The general idea of the index is to ensure only one metadata block needs to be
decompressed to do a lookup irrespective of the length of the directory. decompressed to do a lookup irrespective of the length of the directory.
This scheme has the advantage that it doesn't require extra memory overhead This scheme has the advantage that it doesn't require extra memory overhead
and doesn't require much extra storage on disk. and doesn't require much extra storage on disk.