Lines Matching full:entries

3 Directory Entries
8 filesystem. There can be many directory entries across the filesystem
11 such, directory entries are found by reading the data block(s)
18 By default, each directory lists its entries in an “almost-linear”
20 sense because directory entries are not split across filesystem blocks.
23 entries. The end of each per-block array is signified by reaching the
27 directory entries are signified by inode = 0. By default the filesystem
28 uses ``struct ext4_dir_entry_2`` for directory entries unless the
126 ``ext4_extended_dir_entry_2`` to ``ext4_dir_entry_2`` except for the entries
194 A linear array of directory entries isn't great for performance, so a
198 hashed btree (htree) to organize and find directory entries. For
207 directory. By ext2 custom, the '.' and '..' entries must appear at the
217 array of all ``struct ext4_dir_entry_2``; all of these entries
219 entries simply overflow into the next leaf node, and the
226 entries that can be searched; otherwise, the minor hash of the file name
229 directory entries.
233 for the htree will appear to have no entries (aside from '.' and '..')
325      - entries[0]
397      - entries[0]
428 ``count`` entries in the dx_root/dx_node structures are adjusted as