Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 284469
b: refs/heads/master
c: 89cab5b
h: refs/heads/master
i:
  284467: 72508ba
v: v3
  • Loading branch information
Phillip Lougher committed Dec 30, 2011
1 parent 4b934dd commit ababb62
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: e552a596687bf0e1802c744a7bb113afbd2bf4d4
refs/heads/master: 89cab5b5727d3139adc247e3a3d4ee5b10e3eda5
6 changes: 3 additions & 3 deletions trunk/Documentation/filesystems/squashfs.txt
Original file line number Diff line number Diff line change
Expand Up @@ -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
-----------------------
Expand Down Expand Up @@ -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.
Expand Down

0 comments on commit ababb62

Please sign in to comment.