Lines Matching +full:entry +full:- +full:name
1 .. SPDX-License-Identifier: GPL-2.0
4 -----------------
9 that reference the same inode number--these are known as hard links, and
12 associated with a directory file for the particular directory entry that
18 By default, each directory lists its entries in an “almost-linear”
23 entries. The end of each per-block array is signified by reaching the
24 end of the block; the last entry in the block has a record length that
32 The original directory entry format is ``struct ext4_dir_entry``, which
36 .. list-table::
38 :header-rows: 1
40 * - Offset
41 - Size
42 - Name
43 - Description
44 * - 0x0
45 - \_\_le32
46 - inode
47 - Number of the inode that this directory entry points to.
48 * - 0x4
49 - \_\_le16
50 - rec\_len
51 - Length of this directory entry. Must be a multiple of 4.
52 * - 0x6
53 - \_\_le16
54 - name\_len
55 - Length of the file name.
56 * - 0x8
57 - char
58 - name[EXT4\_NAME\_LEN]
59 - File name.
62 entry format shortens the name\_len field and uses the space for a file
68 .. list-table::
70 :header-rows: 1
72 * - Offset
73 - Size
74 - Name
75 - Description
76 * - 0x0
77 - \_\_le32
78 - inode
79 - Number of the inode that this directory entry points to.
80 * - 0x4
81 - \_\_le16
82 - rec\_len
83 - Length of this directory entry.
84 * - 0x6
85 - \_\_u8
86 - name\_len
87 - Length of the file name.
88 * - 0x7
89 - \_\_u8
90 - file\_type
91 - File type code, see ftype_ table below.
92 * - 0x8
93 - char
94 - name[EXT4\_NAME\_LEN]
95 - File name.
101 .. list-table::
103 :header-rows: 1
105 * - Value
106 - Description
107 * - 0x0
108 - Unknown.
109 * - 0x1
110 - Regular file.
111 * - 0x2
112 - Directory.
113 * - 0x3
114 - Character device file.
115 * - 0x4
116 - Block device file.
117 * - 0x5
118 - FIFO.
119 * - 0x6
120 - Socket.
121 * - 0x7
122 - Symbolic link.
126 hold the checksum. The directory entry is 12 bytes long. The inode
127 number and name\_len fields are set to zero to fool old software into
128 ignoring an apparently empty directory entry, and the checksum is stored
129 in the place where the name normally goes. The structure is
132 .. list-table::
134 :header-rows: 1
136 * - Offset
137 - Size
138 - Name
139 - Description
140 * - 0x0
141 - \_\_le32
142 - det\_reserved\_zero1
143 - Inode number, which must be zero.
144 * - 0x4
145 - \_\_le16
146 - det\_rec\_len
147 - Length of this directory entry, which must be 12.
148 * - 0x6
149 - \_\_u8
150 - det\_reserved\_zero2
151 - Length of the file name, which must be zero.
152 * - 0x7
153 - \_\_u8
154 - det\_reserved\_ft
155 - File type, which must be 0xDE.
156 * - 0x8
157 - \_\_le32
158 - det\_checksum
159 - Directory leaf block checksum.
163 the entire directory entry block up to (but not including) the fake
164 directory entry.
171 balanced tree keyed off a hash of the directory entry name. If the
174 backwards read-only compatibility with ext2, this tree is actually
177 entry table was signified with an entry pointing to inode 0; this is
178 (ab)used to fool the old linear-scan algorithm into thinking that the
185 the root node contains metadata about the tree and finally a hash->block
187 ``dx_root.info.indirect_levels`` is non-zero then the htree has two
191 minor\_hash->block map to find leafe nodes. Leaf nodes contain a linear
195 least-significant bit of the hash (in the interior node map) that gets
199 the desired file name and uses it to find the corresponding block
201 entries that can be searched; otherwise, the minor hash of the file name
214 .. list-table::
216 :header-rows: 1
218 * - Offset
219 - Type
220 - Name
221 - Description
222 * - 0x0
223 - \_\_le32
224 - dot.inode
225 - inode number of this directory.
226 * - 0x4
227 - \_\_le16
228 - dot.rec\_len
229 - Length of this record, 12.
230 * - 0x6
231 - u8
232 - dot.name\_len
233 - Length of the name, 1.
234 * - 0x7
235 - u8
236 - dot.file\_type
237 - File type of this entry, 0x2 (directory) (if the feature flag is set).
238 * - 0x8
239 - char
240 - dot.name[4]
241 - “.\\0\\0\\0”
242 * - 0xC
243 - \_\_le32
244 - dotdot.inode
245 - inode number of parent directory.
246 * - 0x10
247 - \_\_le16
248 - dotdot.rec\_len
249 - block\_size - 12. The record length is long enough to cover all htree
251 * - 0x12
252 - u8
253 - dotdot.name\_len
254 - Length of the name, 2.
255 * - 0x13
256 - u8
257 - dotdot.file\_type
258 - File type of this entry, 0x2 (directory) (if the feature flag is set).
259 * - 0x14
260 - char
261 - dotdot\_name[4]
262 - “..\\0\\0”
263 * - 0x18
264 - \_\_le32
265 - struct dx\_root\_info.reserved\_zero
266 - Zero.
267 * - 0x1C
268 - u8
269 - struct dx\_root\_info.hash\_version
270 - Hash type, see dirhash_ table below.
271 * - 0x1D
272 - u8
273 - struct dx\_root\_info.info\_length
274 - Length of the tree information, 0x8.
275 * - 0x1E
276 - u8
277 - struct dx\_root\_info.indirect\_levels
278 - Depth of the htree. Cannot be larger than 3 if the INCOMPAT\_LARGEDIR
280 * - 0x1F
281 - u8
282 - struct dx\_root\_info.unused\_flags
283 -
284 * - 0x20
285 - \_\_le16
286 - limit
287 - Maximum number of dx\_entries that can follow this header, plus 1 for
289 * - 0x22
290 - \_\_le16
291 - count
292 - Actual number of dx\_entries that follow this header, plus 1 for the
294 * - 0x24
295 - \_\_le32
296 - block
297 - The block number (within the directory file) that goes with hash=0.
298 * - 0x28
299 - struct dx\_entry
300 - entries[0]
301 - As many 8-byte ``struct dx_entry`` as fits in the rest of the data block.
307 .. list-table::
309 :header-rows: 1
311 * - Value
312 - Description
313 * - 0x0
314 - Legacy.
315 * - 0x1
316 - Half MD4.
317 * - 0x2
318 - Tea.
319 * - 0x3
320 - Legacy, unsigned.
321 * - 0x4
322 - Half MD4, unsigned.
323 * - 0x5
324 - Tea, unsigned.
329 .. list-table::
331 :header-rows: 1
333 * - Offset
334 - Type
335 - Name
336 - Description
337 * - 0x0
338 - \_\_le32
339 - fake.inode
340 - Zero, to make it look like this entry is not in use.
341 * - 0x4
342 - \_\_le16
343 - fake.rec\_len
344 - The size of the block, in order to hide all of the dx\_node data.
345 * - 0x6
346 - u8
347 - name\_len
348 - Zero. There is no name for this “unused” directory entry.
349 * - 0x7
350 - u8
351 - file\_type
352 - Zero. There is no file type for this “unused” directory entry.
353 * - 0x8
354 - \_\_le16
355 - limit
356 - Maximum number of dx\_entries that can follow this header, plus 1 for
358 * - 0xA
359 - \_\_le16
360 - count
361 - Actual number of dx\_entries that follow this header, plus 1 for the
363 * - 0xE
364 - \_\_le32
365 - block
366 - The block number (within the directory file) that goes with the lowest
368 * - 0x12
369 - struct dx\_entry
370 - entries[0]
371 - As many 8-byte ``struct dx_entry`` as fits in the rest of the data block.
377 .. list-table::
379 :header-rows: 1
381 * - Offset
382 - Type
383 - Name
384 - Description
385 * - 0x0
386 - \_\_le32
387 - hash
388 - Hash code.
389 * - 0x4
390 - \_\_le32
391 - block
392 - Block number (within the directory file, not filesystem blocks) of the
403 the dx\_tail, the user is notified to run e2fsck -D to rebuild the
407 .. list-table::
409 :header-rows: 1
411 * - Offset
412 - Type
413 - Name
414 - Description
415 * - 0x0
416 - u32
417 - dt\_reserved
418 - Zero.
419 * - 0x4
420 - \_\_le32
421 - dt\_checksum
422 - Checksum of the htree directory block.