6 gitformat-index - Git index format
18 == The Git index file has the following format
20 All binary numbers are in network byte order.
21 In a repository using the traditional SHA-1, checksums and object IDs
22 (object names) mentioned below are all computed using SHA-1. Similarly,
23 in SHA-256 repositories, these values are computed using SHA-256.
24 Version 2 is described here unless stated otherwise.
26 - A 12-byte header consisting of
29 The signature is { 'D', 'I', 'R', 'C' } (stands for "dircache")
31 4-byte version number:
32 The current supported versions are 2, 3 and 4.
34 32-bit number of index entries.
36 - A number of sorted index entries (see below).
40 Extensions are identified by signature. Optional extensions can
41 be ignored if Git does not understand them.
43 4-byte extension signature. If the first byte is 'A'..'Z' the
44 extension is optional and can be ignored.
46 32-bit size of the extension
50 - Hash checksum over the content of the index file before this checksum.
54 Index entries are sorted in ascending order on the name field,
55 interpreted as a string of unsigned bytes (i.e. memcmp() order, no
56 localization, no special casing of directory separator '/'). Entries
57 with the same name are sorted by their stage field.
59 An index entry typically represents a file. However, if sparse-checkout
60 is enabled in cone mode (`core.sparseCheckoutCone` is enabled) and the
61 `extensions.sparseIndex` extension is enabled, then the index may
62 contain entries for directories outside of the sparse-checkout definition.
63 These entries have mode `040000`, include the `SKIP_WORKTREE` bit, and
64 the path ends in a directory separator.
66 32-bit ctime seconds, the last time a file's metadata changed
69 32-bit ctime nanosecond fractions
72 32-bit mtime seconds, the last time a file's data changed
75 32-bit mtime nanosecond fractions
84 32-bit mode, split into (high to low bits)
87 valid values in binary are 1000 (regular file), 1010 (symbolic link)
92 9-bit unix permission. Only 0755 and 0644 are valid for regular files.
93 Symbolic links and gitlinks have value 0 in this field.
102 This is the on-disk size from stat(2), truncated to 32-bit.
104 Object name for the represented object
106 A 16-bit 'flags' field split into (high to low bits)
108 1-bit assume-valid flag
110 1-bit extended flag (must be zero in version 2)
112 2-bit stage (during merge)
114 12-bit name length if the length is less than 0xFFF; otherwise 0xFFF
115 is stored in this field.
117 (Version 3 or later) A 16-bit field, only applicable if the
118 "extended flag" above is 1, split into (high to low bits).
120 1-bit reserved for future
122 1-bit skip-worktree flag (used by sparse checkout)
124 1-bit intent-to-add flag (used by "git add -N")
126 13-bit unused, must be zero
128 Entry path name (variable length) relative to top level directory
129 (without leading slash). '/' is used as path separator. The special
130 path components ".", ".." and ".git" (without quotes) are disallowed.
131 Trailing slash is also disallowed.
133 The exact encoding is undefined, but the '.' and '/' characters
134 are encoded in 7-bit ASCII and the encoding cannot contain a NUL
135 byte (iow, this is a UNIX pathname).
137 (Version 4) In version 4, the entry path name is prefix-compressed
138 relative to the path name for the previous entry (the very first
139 entry is encoded as if the path name for the previous entry is an
140 empty string). At the beginning of an entry, an integer N in the
141 variable width encoding (the same encoding as the offset is encoded
142 for OFS_DELTA pack entries; see linkgit:gitformat-pack[5]) is stored, followed
143 by a NUL-terminated string S. Removing N bytes from the end of the
144 path name for the previous entry, and replacing it with the string S
145 yields the path name for this entry.
147 1-8 nul bytes as necessary to pad the entry to a multiple of eight bytes
148 while keeping the name NUL-terminated.
150 (Version 4) In version 4, the padding after the pathname does not
153 Interpretation of index entries in split index mode is completely
154 different. See below for details.
160 Since the index does not record entries for directories, the cache
161 entries cannot describe tree objects that already exist in the object
162 database for regions of the index that are unchanged from an existing
163 commit. The cache tree extension stores a recursive tree structure that
164 describes the trees that already exist and completely match sections of
165 the cache entries. This speeds up tree object generation from the index
166 for a new commit by only computing the trees that are "new" to that
167 commit. It also assists when comparing the index to another tree, such
168 as `HEAD^{tree}`, since sections of the index can be skipped when a tree
169 comparison demonstrates equality.
171 The recursive tree structure uses nodes that store a number of cache
172 entries, a list of subnodes, and an object ID (OID). The OID references
173 the existing tree for that node, if it is known to exist. The subnodes
174 correspond to subdirectories that themselves have cache tree nodes. The
175 number of cache entries corresponds to the number of cache entries in
176 the index that describe paths within that tree's directory.
178 The extension tracks the full directory structure in the cache tree
179 extension, but this is generally smaller than the full cache entry list.
181 When a path is updated in index, Git invalidates all nodes of the
182 recursive cache tree corresponding to the parent directories of that
183 path. We store these tree nodes as being "invalid" by using "-1" as the
184 number of cache entries. Invalid nodes still store a span of index
185 entries, allowing Git to focus its efforts when reconstructing a full
188 The signature for this extension is { 'T', 'R', 'E', 'E' }.
190 A series of entries fill the entire extension; each of which
193 - NUL-terminated path component (relative to its parent directory);
195 - ASCII decimal number of entries in the index that is covered by the
196 tree this entry represents (entry_count);
198 - A space (ASCII 32);
200 - ASCII decimal number that represents the number of subtrees this
203 - A newline (ASCII 10); and
205 - Object name for the object that would result from writing this span
208 An entry can be in an invalidated state and is represented by having
209 a negative number in the entry_count field. In this case, there is no
210 object name and the next entry starts immediately after the newline.
211 When writing an invalid entry, -1 should always be used as entry_count.
213 The entries are written out in the top-down, depth-first order. The
214 first entry represents the root level of the repository, followed by the
215 first subtree--let's call this A--of the root level (with its name
216 relative to the root level), followed by the first subtree of A (with
217 its name relative to A), and so on. The specified number of subtrees
218 indicates when the current level of the recursive stack is complete.
222 A conflict is represented in the index as a set of higher stage entries.
223 When a conflict is resolved (e.g. with "git add path"), these higher
224 stage entries will be removed and a stage-0 entry with proper resolution
227 When these higher stage entries are removed, they are saved in the
228 resolve undo extension, so that conflicts can be recreated (e.g. with
229 "git checkout -m"), in case users want to redo a conflict resolution
232 The signature for this extension is { 'R', 'E', 'U', 'C' }.
234 A series of entries fill the entire extension; each of which
237 - NUL-terminated pathname the entry describes (relative to the root of
238 the repository, i.e. full pathname);
240 - Three NUL-terminated ASCII octal numbers, entry mode of entries in
241 stage 1 to 3 (a missing stage is represented by "0" in this field);
244 - At most three object names of the entry in stages from 1 to 3
245 (nothing is written for a missing stage).
249 In split index mode, the majority of index entries could be stored
250 in a separate file. This extension records the changes to be made on
251 top of that to produce the final index.
253 The signature for this extension is { 'l', 'i', 'n', 'k' }.
255 The extension consists of:
257 - Hash of the shared index file. The shared index file path
258 is $GIT_DIR/sharedindex.<hash>. If all bits are zero, the
259 index does not require a shared index file.
261 - An ewah-encoded delete bitmap, each bit represents an entry in the
262 shared index. If a bit is set, its corresponding entry in the
263 shared index will be removed from the final index. Note, because
264 a delete operation changes index entry positions, but we do need
265 original positions in replace phase, it's best to just mark
266 entries for removal, then do a mass deletion after replacement.
268 - An ewah-encoded replace bitmap, each bit represents an entry in
269 the shared index. If a bit is set, its corresponding entry in the
270 shared index will be replaced with an entry in this index
271 file. All replaced entries are stored in sorted order in this
272 index. The first "1" bit in the replace bitmap corresponds to the
273 first index entry, the second "1" bit to the second entry and so
274 on. Replaced entries may have empty path names to save space.
276 The remaining index entries after replaced ones will be added to the
277 final index. These added entries are also sorted by entry name then
282 Untracked cache saves the untracked file list and necessary data to
283 verify the cache. The signature for this extension is { 'U', 'N',
286 The extension starts with
288 - A sequence of NUL-terminated strings, preceded by the size of the
289 sequence in variable width encoding. Each string describes the
290 environment where the cache can be used.
292 - Stat data of $GIT_DIR/info/exclude. See "Index entry" section from
293 ctime field until "file size".
295 - Stat data of core.excludesFile
297 - 32-bit dir_flags (see struct dir_struct)
299 - Hash of $GIT_DIR/info/exclude. A null hash means the file
302 - Hash of core.excludesFile. A null hash means the file does
305 - NUL-terminated string of per-dir exclude file name. This usually
308 - The number of following directory blocks, variable width
309 encoding. If this number is zero, the extension ends here with a
312 - A number of directory blocks in depth-first-search order, each
315 - The number of untracked entries, variable width encoding.
317 - The number of sub-directory blocks, variable width encoding.
319 - The directory name terminated by NUL.
321 - A number of untracked file/dir names terminated by NUL.
323 The remaining data of each directory block is grouped by type:
325 - An ewah bitmap, the n-th bit marks whether the n-th directory has
326 valid untracked cache entries.
328 - An ewah bitmap, the n-th bit records "check-only" bit of
329 read_directory_recursive() for the n-th directory.
331 - An ewah bitmap, the n-th bit indicates whether hash and stat data
332 is valid for the n-th directory and exists in the next data.
334 - An array of stat data. The n-th data corresponds with the n-th
335 "one" bit in the previous ewah bitmap.
337 - An array of hashes. The n-th hash corresponds with the n-th "one" bit
338 in the previous ewah bitmap.
342 == File System Monitor cache
344 The file system monitor cache tracks files for which the core.fsmonitor
345 hook has told us about changes. The signature for this extension is
346 { 'F', 'S', 'M', 'N' }.
348 The extension starts with
350 - 32-bit version number: the current supported versions are 1 and 2.
353 64-bit time: the extension data reflects all changes through the given
354 time which is stored as the nanoseconds elapsed since midnight,
358 A null terminated string: an opaque token defined by the file system
359 monitor application. The extension data reflects all changes relative
362 - 32-bit bitmap size: the size of the CE_FSMONITOR_VALID bitmap.
364 - An ewah bitmap, the n-th bit indicates whether the n-th index entry
365 is not CE_FSMONITOR_VALID.
367 == End of Index Entry
369 The End of Index Entry (EOIE) is used to locate the end of the variable
370 length index entries and the beginning of the extensions. Code can take
371 advantage of this to quickly locate the index extensions without having
372 to parse through all of the index entries.
374 Because it must be able to be loaded before the variable length cache
375 entries and other index extensions, this extension must be written last.
376 The signature for this extension is { 'E', 'O', 'I', 'E' }.
378 The extension consists of:
380 - 32-bit offset to the end of the index entries
382 - Hash over the extension types and their sizes (but not
383 their contents). E.g. if we have "TREE" extension that is N-bytes
384 long, "REUC" extension that is M-bytes long, followed by "EOIE",
385 then the hash would be:
387 Hash("TREE" + <binary representation of N> +
388 "REUC" + <binary representation of M>)
390 == Index Entry Offset Table
392 The Index Entry Offset Table (IEOT) is used to help address the CPU
393 cost of loading the index by enabling multi-threading the process of
394 converting cache entries from the on-disk format to the in-memory format.
395 The signature for this extension is { 'I', 'E', 'O', 'T' }.
397 The extension consists of:
399 - 32-bit version (currently 1)
401 - A number of index offset entries each consisting of:
403 - 32-bit offset from the beginning of the file to the first cache entry
404 in this block of entries.
406 - 32-bit count of cache entries in this block
408 == Sparse Directory Entries
410 When using sparse-checkout in cone mode, some entire directories within
411 the index can be summarized by pointing to a tree object instead of the
412 entire expanded list of paths within that tree. An index containing such
413 entries is a "sparse index". Index format versions 4 and less were not
414 implemented with such entries in mind. Thus, for these versions, an
415 index containing sparse directory entries will include this extension
416 with signature { 's', 'd', 'i', 'r' }. Like the split-index extension,
417 tools should avoid interacting with a sparse index unless they understand
422 Part of the linkgit:git[1] suite