diff options
| author | Phillip Lougher <phillip@squashfs.org.uk> | 2011-12-29 17:54:17 +0400 |
|---|---|---|
| committer | Phillip Lougher <phillip@squashfs.org.uk> | 2011-12-30 05:20:24 +0400 |
| commit | 89cab5b5727d3139adc247e3a3d4ee5b10e3eda5 (patch) | |
| tree | 99b2f74af59b1a480ada485a424d5236813532f6 /Documentation/filesystems/squashfs.txt | |
| parent | e552a596687bf0e1802c744a7bb113afbd2bf4d4 (diff) | |
| download | linux-89cab5b5727d3139adc247e3a3d4ee5b10e3eda5.tar.xz | |
Squashfs: Update documentation to include xattrs
One paragraph was not updated when xattrs were added to Squashfs.
Signed-off-by: Phillip Lougher <phillip@squashfs.org.uk>
Diffstat (limited to 'Documentation/filesystems/squashfs.txt')
| -rw-r--r-- | Documentation/filesystems/squashfs.txt | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Documentation/filesystems/squashfs.txt b/Documentation/filesystems/squashfs.txt index 7db3ebda5a4c..403c090aca39 100644 --- a/Documentation/filesystems/squashfs.txt +++ b/Documentation/filesystems/squashfs.txt @@ -93,8 +93,8 @@ byte alignment: 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 -written the completed inode, directory, fragment, export and uid/gid lookup -tables are written. +written the completed inode, directory, fragment, export, uid/gid lookup and +xattr tables are written. 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 alphabetically larger than the filename being looked up. At this point the 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. This scheme has the advantage that it doesn't require extra memory overhead and doesn't require much extra storage on disk. |