| blob | deeeae03eefe5f33d4f40d683f786b06d5c60057 |
1 '\" t
2 .\" Title: gitformat-pack
3 .\" Author: [FIXME: author] [see http://www.docbook.org/tdg5/en/html/author]
4 .\" Generator: DocBook XSL Stylesheets vsnapshot <http://docbook.sf.net/>
5 .\" Date: 2024-03-05
6 .\" Manual: Git Manual
7 .\" Source: Git 2.44.0.117.g43072b4ca1
8 .\" Language: English
9 .\"
10 .TH "GITFORMAT\-PACK" "5" "2024\-03\-05" "Git 2\&.44\&.0\&.117\&.g43072b" "Git Manual"
11 .\" -----------------------------------------------------------------
12 .\" * Define some portability stuff
13 .\" -----------------------------------------------------------------
14 .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15 .\" http://bugs.debian.org/507673
16 .\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
17 .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
18 .ie \n(.g .ds Aq \(aq
19 .el .ds Aq '
20 .\" -----------------------------------------------------------------
21 .\" * set default formatting
22 .\" -----------------------------------------------------------------
23 .\" disable hyphenation
24 .nh
25 .\" disable justification (adjust text to left margin only)
26 .ad l
27 .\" -----------------------------------------------------------------
28 .\" * MAIN CONTENT STARTS HERE *
29 .\" -----------------------------------------------------------------
30 .SH "NAME"
31 gitformat-pack \- Git pack format
32 .SH "SYNOPSIS"
33 .sp
34 .nf
35 $GIT_DIR/objects/pack/pack\-\fB\&.{pack,idx}
36 $GIT_DIR/objects/pack/pack\-\fR\&.rev
37 $GIT_DIR/objects/pack/pack\-*\&.mtimes
38 $GIT_DIR/objects/pack/multi\-pack\-index
39 .fi
40 .sp
41 .SH "DESCRIPTION"
42 .sp
43 The Git pack format is how Git stores most of its primary repository data\&. Over the lifetime of a repository, loose objects (if any) and smaller packs are consolidated into larger pack(s)\&. See \fBgit-gc\fR(1) and \fBgit-pack-objects\fR(1)\&.
44 .sp
45 The pack format is also used over\-the\-wire, see e\&.g\&. \fBgitprotocol-v2\fR(5), as well as being a part of other container formats in the case of \fBgitformat-bundle\fR(5)\&.
46 .SH "CHECKSUMS AND OBJECT IDS"
47 .sp
48 In a repository using the traditional SHA\-1, pack checksums, index checksums, and object IDs (object names) mentioned below are all computed using SHA\-1\&. Similarly, in SHA\-256 repositories, these values are computed using SHA\-256\&.
49 .SH "PACK\-*\&.PACK FILES HAVE THE FOLLOWING FORMAT:"
50 .sp
51 .RS 4
52 .ie n \{\
53 \h'-04'\(bu\h'+03'\c
54 .\}
55 .el \{\
56 .sp -1
57 .IP \(bu 2.3
58 .\}
59 A header appears at the beginning and consists of the following:
60 .sp
61 .if n \{\
62 .RS 4
63 .\}
64 .nf
65 4\-byte signature:
66 The signature is: {\*(AqP\*(Aq, \*(AqA\*(Aq, \*(AqC\*(Aq, \*(AqK\*(Aq}
67 .fi
68 .if n \{\
69 .RE
70 .\}
71 .sp
72 .if n \{\
73 .RS 4
74 .\}
75 .nf
76 4\-byte version number (network byte order):
77 Git currently accepts version number 2 or 3 but
78 generates version 2 only\&.
79 .fi
80 .if n \{\
81 .RE
82 .\}
83 .sp
84 .if n \{\
85 .RS 4
86 .\}
87 .nf
88 4\-byte number of objects contained in the pack (network byte order)
89 .fi
90 .if n \{\
91 .RE
92 .\}
93 .sp
94 .if n \{\
95 .RS 4
96 .\}
97 .nf
98 Observation: we cannot have more than 4G versions ;\-) and
99 more than 4G objects in a pack\&.
100 .fi
101 .if n \{\
102 .RE
103 .\}
104 .RE
105 .sp
106 .RS 4
107 .ie n \{\
108 \h'-04'\(bu\h'+03'\c
109 .\}
110 .el \{\
111 .sp -1
112 .IP \(bu 2.3
113 .\}
114 The header is followed by a number of object entries, each of which looks like this:
115 .sp
116 .if n \{\
117 .RS 4
118 .\}
119 .nf
120 (undeltified representation)
121 n\-byte type and length (3\-bit type, (n\-1)*7+4\-bit length)
122 compressed data
123 .fi
124 .if n \{\
125 .RE
126 .\}
127 .sp
128 .if n \{\
129 .RS 4
130 .\}
131 .nf
132 (deltified representation)
133 n\-byte type and length (3\-bit type, (n\-1)*7+4\-bit length)
134 base object name if OBJ_REF_DELTA or a negative relative
135 offset from the delta object\*(Aqs position in the pack if this
136 is an OBJ_OFS_DELTA object
137 compressed delta data
138 .fi
139 .if n \{\
140 .RE
141 .\}
142 .sp
143 .if n \{\
144 .RS 4
145 .\}
146 .nf
147 Observation: the length of each object is encoded in a variable
148 length format and is not constrained to 32\-bit or anything\&.
149 .fi
150 .if n \{\
151 .RE
152 .\}
153 .RE
154 .sp
155 .RS 4
156 .ie n \{\
157 \h'-04'\(bu\h'+03'\c
158 .\}
159 .el \{\
160 .sp -1
161 .IP \(bu 2.3
162 .\}
163 The trailer records a pack checksum of all of the above\&.
164 .RE
165 .SS "Object types"
166 .sp
167 Valid object types are:
168 .sp
169 .RS 4
170 .ie n \{\
171 \h'-04'\(bu\h'+03'\c
172 .\}
173 .el \{\
174 .sp -1
175 .IP \(bu 2.3
176 .\}
177 OBJ_COMMIT (1)
178 .RE
179 .sp
180 .RS 4
181 .ie n \{\
182 \h'-04'\(bu\h'+03'\c
183 .\}
184 .el \{\
185 .sp -1
186 .IP \(bu 2.3
187 .\}
188 OBJ_TREE (2)
189 .RE
190 .sp
191 .RS 4
192 .ie n \{\
193 \h'-04'\(bu\h'+03'\c
194 .\}
195 .el \{\
196 .sp -1
197 .IP \(bu 2.3
198 .\}
199 OBJ_BLOB (3)
200 .RE
201 .sp
202 .RS 4
203 .ie n \{\
204 \h'-04'\(bu\h'+03'\c
205 .\}
206 .el \{\
207 .sp -1
208 .IP \(bu 2.3
209 .\}
210 OBJ_TAG (4)
211 .RE
212 .sp
213 .RS 4
214 .ie n \{\
215 \h'-04'\(bu\h'+03'\c
216 .\}
217 .el \{\
218 .sp -1
219 .IP \(bu 2.3
220 .\}
221 OBJ_OFS_DELTA (6)
222 .RE
223 .sp
224 .RS 4
225 .ie n \{\
226 \h'-04'\(bu\h'+03'\c
227 .\}
228 .el \{\
229 .sp -1
230 .IP \(bu 2.3
231 .\}
232 OBJ_REF_DELTA (7)
233 .RE
234 .sp
235 Type 5 is reserved for future expansion\&. Type 0 is invalid\&.
236 .SS "Size encoding"
237 .sp
238 This document uses the following "size encoding" of non\-negative integers: From each byte, the seven least significant bits are used to form the resulting integer\&. As long as the most significant bit is 1, this process continues; the byte with MSB 0 provides the last seven bits\&. The seven\-bit chunks are concatenated\&. Later values are more significant\&.
239 .sp
240 This size encoding should not be confused with the "offset encoding", which is also used in this document\&.
241 .SS "Deltified representation"
242 .sp
243 Conceptually there are only four object types: commit, tree, tag and blob\&. However to save space, an object could be stored as a "delta" of another "base" object\&. These representations are assigned new types ofs\-delta and ref\-delta, which is only valid in a pack file\&.
244 .sp
245 Both ofs\-delta and ref\-delta store the "delta" to be applied to another object (called \fIbase object\fR) to reconstruct the object\&. The difference between them is, ref\-delta directly encodes base object name\&. If the base object is in the same pack, ofs\-delta encodes the offset of the base object in the pack instead\&.
246 .sp
247 The base object could also be deltified if it\(cqs in the same pack\&. Ref\-delta can also refer to an object outside the pack (i\&.e\&. the so\-called "thin pack")\&. When stored on disk however, the pack should be self contained to avoid cyclic dependency\&.
248 .sp
249 The delta data starts with the size of the base object and the size of the object to be reconstructed\&. These sizes are encoded using the size encoding from above\&. The remainder of the delta data is a sequence of instructions to reconstruct the object from the base object\&. If the base object is deltified, it must be converted to canonical form first\&. Each instruction appends more and more data to the target object until it\(cqs complete\&. There are two supported instructions so far: one for copying a byte range from the source object and one for inserting new data embedded in the instruction itself\&.
250 .sp
251 Each instruction has variable length\&. Instruction type is determined by the seventh bit of the first octet\&. The following diagrams follow the convention in RFC 1951 (Deflate compressed data format)\&.
252 .sp
253 .it 1 an-trap
254 .nr an-no-space-flag 1
255 .nr an-break-flag 1
256 .br
257 .ps +1
258 \fBInstruction to copy from base object\fR
259 .RS 4
260 .sp
261 .if n \{\
262 .RS 4
263 .\}
264 .nf
265 +\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-+\-\-\-\-\-\-\-+\-\-\-\-\-\-\-+
266 | 1xxxxxxx | offset1 | offset2 | offset3 | offset4 | size1 | size2 | size3 |
267 +\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-+\-\-\-\-\-\-\-+\-\-\-\-\-\-\-+
268 .fi
269 .if n \{\
270 .RE
271 .\}
272 .sp
273 This is the instruction format to copy a byte range from the source object\&. It encodes the offset to copy from and the number of bytes to copy\&. Offset and size are in little\-endian order\&.
274 .sp
275 All offset and size bytes are optional\&. This is to reduce the instruction size when encoding small offsets or sizes\&. The first seven bits in the first octet determine which of the next seven octets is present\&. If bit zero is set, offset1 is present\&. If bit one is set offset2 is present and so on\&.
276 .sp
277 Note that a more compact instruction does not change offset and size encoding\&. For example, if only offset2 is omitted like below, offset3 still contains bits 16\-23\&. It does not become offset2 and contains bits 8\-15 even if it\(cqs right next to offset1\&.
278 .sp
279 .if n \{\
280 .RS 4
281 .\}
282 .nf
283 +\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+
284 | 10000101 | offset1 | offset3 |
285 +\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-+
286 .fi
287 .if n \{\
288 .RE
289 .\}
290 .sp
291 In its most compact form, this instruction only takes up one byte (0x80) with both offset and size omitted, which will have default values zero\&. There is another exception: size zero is automatically converted to 0x10000\&.
292 .RE
293 .sp
294 .it 1 an-trap
295 .nr an-no-space-flag 1
296 .nr an-break-flag 1
297 .br
298 .ps +1
299 \fBInstruction to add new data\fR
300 .RS 4
301 .sp
302 .if n \{\
303 .RS 4
304 .\}
305 .nf
306 +\-\-\-\-\-\-\-\-\-\-+============+
307 | 0xxxxxxx | data |
308 +\-\-\-\-\-\-\-\-\-\-+============+
309 .fi
310 .if n \{\
311 .RE
312 .\}
313 .sp
314 This is the instruction to construct the target object without the base object\&. The following data is appended to the target object\&. The first seven bits of the first octet determine the size of data in bytes\&. The size must be non\-zero\&.
315 .RE
316 .sp
317 .it 1 an-trap
318 .nr an-no-space-flag 1
319 .nr an-break-flag 1
320 .br
321 .ps +1
322 \fBReserved instruction\fR
323 .RS 4
324 .sp
325 .if n \{\
326 .RS 4
327 .\}
328 .nf
329 +\-\-\-\-\-\-\-\-\-\-+============
330 | 00000000 |
331 +\-\-\-\-\-\-\-\-\-\-+============
332 .fi
333 .if n \{\
334 .RE
335 .\}
336 .sp
337 This is the instruction reserved for future expansion\&.
338 .RE
339 .SH "ORIGINAL (VERSION 1) PACK\-*\&.IDX FILES HAVE THE FOLLOWING FORMAT:"
340 .sp
341 .RS 4
342 .ie n \{\
343 \h'-04'\(bu\h'+03'\c
344 .\}
345 .el \{\
346 .sp -1
347 .IP \(bu 2.3
348 .\}
349 The header consists of 256 4\-byte network byte order integers\&. N\-th entry of this table records the number of objects in the corresponding pack, the first byte of whose object name is less than or equal to N\&. This is called the
350 \fIfirst\-level fan\-out\fR
351 table\&.
352 .RE
353 .sp
354 .RS 4
355 .ie n \{\
356 \h'-04'\(bu\h'+03'\c
357 .\}
358 .el \{\
359 .sp -1
360 .IP \(bu 2.3
361 .\}
362 The header is followed by sorted 24\-byte entries, one entry per object in the pack\&. Each entry is:
363 .sp
364 .if n \{\
365 .RS 4
366 .\}
367 .nf
368 4\-byte network byte order integer, recording where the
369 object is stored in the packfile as the offset from the
370 beginning\&.
371 .fi
372 .if n \{\
373 .RE
374 .\}
375 .sp
376 .if n \{\
377 .RS 4
378 .\}
379 .nf
380 one object name of the appropriate size\&.
381 .fi
382 .if n \{\
383 .RE
384 .\}
385 .RE
386 .sp
387 .RS 4
388 .ie n \{\
389 \h'-04'\(bu\h'+03'\c
390 .\}
391 .el \{\
392 .sp -1
393 .IP \(bu 2.3
394 .\}
395 The file is concluded with a trailer:
396 .sp
397 .if n \{\
398 .RS 4
399 .\}
400 .nf
401 A copy of the pack checksum at the end of the corresponding
402 packfile\&.
403 .fi
404 .if n \{\
405 .RE
406 .\}
407 .sp
408 .if n \{\
409 .RS 4
410 .\}
411 .nf
412 Index checksum of all of the above\&.
413 .fi
414 .if n \{\
415 .RE
416 .\}
417 .RE
418 .sp
419 Pack Idx file:
420 .sp
421 .if n \{\
422 .RS 4
423 .\}
424 .nf
425 \-\- +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
426 fanout | fanout[0] = 2 (for example) |\-\&.
427 table +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+ |
428 | fanout[1] | |
429 +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+ |
430 | fanout[2] | |
431 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
432 | fanout[255] = total objects |\-\-\-\&.
433 \-\- +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+ | |
434 main | offset | | |
435 index | object name 00XXXXXXXXXXXXXXXX | | |
436 table +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+ | |
437 | offset | | |
438 | object name 00XXXXXXXXXXXXXXXX | | |
439 +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+<+ |
440 \&.\-| offset | |
441 | | object name 01XXXXXXXXXXXXXXXX | |
442 | +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+ |
443 | | offset | |
444 | | object name 01XXXXXXXXXXXXXXXX | |
445 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
446 | | offset | |
447 | | object name FFXXXXXXXXXXXXXXXX | |
448 \-\-| +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+<\-\-+
449 trailer | | packfile checksum |
450 | +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
451 | | idxfile checksum |
452 | +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
453 \&.\-\-\-\-\-\-\-\&.
454 |
455 Pack file entry: <+
456 .fi
457 .if n \{\
458 .RE
459 .\}
460 .sp
461 .if n \{\
462 .RS 4
463 .\}
464 .nf
465 packed object header:
466 1\-byte size extension bit (MSB)
467 type (next 3 bit)
468 size0 (lower 4\-bit)
469 n\-byte sizeN (as long as MSB is set, each 7\-bit)
470 size0\&.\&.sizeN form 4+7+7+\&.\&.+7 bit integer, size0
471 is the least significant part, and sizeN is the
472 most significant part\&.
473 packed object data:
474 If it is not DELTA, then deflated bytes (the size above
475 is the size before compression)\&.
476 If it is REF_DELTA, then
477 base object name (the size above is the
478 size of the delta data that follows)\&.
479 delta data, deflated\&.
480 If it is OFS_DELTA, then
481 n\-byte offset (see below) interpreted as a negative
482 offset from the type\-byte of the header of the
483 ofs\-delta entry (the size above is the size of
484 the delta data that follows)\&.
485 delta data, deflated\&.
486 .fi
487 .if n \{\
488 .RE
489 .\}
490 .sp
491 .if n \{\
492 .RS 4
493 .\}
494 .nf
495 offset encoding:
496 n bytes with MSB set in all but the last one\&.
497 The offset is then the number constructed by
498 concatenating the lower 7 bit of each byte, and
499 for n >= 2 adding 2^7 + 2^14 + \&.\&.\&. + 2^(7*(n\-1))
500 to the result\&.
501 .fi
502 .if n \{\
503 .RE
504 .\}
505 .SH "VERSION 2 PACK\-*\&.IDX FILES SUPPORT PACKS LARGER THAN 4 GIB, AND"
506 .sp
507 .if n \{\
508 .RS 4
509 .\}
510 .nf
511 have some other reorganizations\&. They have the format:
512 .fi
513 .if n \{\
514 .RE
515 .\}
516 .sp
517 .RS 4
518 .ie n \{\
519 \h'-04'\(bu\h'+03'\c
520 .\}
521 .el \{\
522 .sp -1
523 .IP \(bu 2.3
524 .\}
525 A 4\-byte magic number
526 \fI\e377tOc\fR
527 which is an unreasonable fanout[0] value\&.
528 .RE
529 .sp
530 .RS 4
531 .ie n \{\
532 \h'-04'\(bu\h'+03'\c
533 .\}
534 .el \{\
535 .sp -1
536 .IP \(bu 2.3
537 .\}
538 A 4\-byte version number (= 2)
539 .RE
540 .sp
541 .RS 4
542 .ie n \{\
543 \h'-04'\(bu\h'+03'\c
544 .\}
545 .el \{\
546 .sp -1
547 .IP \(bu 2.3
548 .\}
549 A 256\-entry fan\-out table just like v1\&.
550 .RE
551 .sp
552 .RS 4
553 .ie n \{\
554 \h'-04'\(bu\h'+03'\c
555 .\}
556 .el \{\
557 .sp -1
558 .IP \(bu 2.3
559 .\}
560 A table of sorted object names\&. These are packed together without offset values to reduce the cache footprint of the binary search for a specific object name\&.
561 .RE
562 .sp
563 .RS 4
564 .ie n \{\
565 \h'-04'\(bu\h'+03'\c
566 .\}
567 .el \{\
568 .sp -1
569 .IP \(bu 2.3
570 .\}
571 A table of 4\-byte CRC32 values of the packed object data\&. This is new in v2 so compressed data can be copied directly from pack to pack during repacking without undetected data corruption\&.
572 .RE
573 .sp
574 .RS 4
575 .ie n \{\
576 \h'-04'\(bu\h'+03'\c
577 .\}
578 .el \{\
579 .sp -1
580 .IP \(bu 2.3
581 .\}
582 A table of 4\-byte offset values (in network byte order)\&. These are usually 31\-bit pack file offsets, but large offsets are encoded as an index into the next table with the msbit set\&.
583 .RE
584 .sp
585 .RS 4
586 .ie n \{\
587 \h'-04'\(bu\h'+03'\c
588 .\}
589 .el \{\
590 .sp -1
591 .IP \(bu 2.3
592 .\}
593 A table of 8\-byte offset entries (empty for pack files less than 2 GiB)\&. Pack files are organized with heavily used objects toward the front, so most object references should not need to refer to this table\&.
594 .RE
595 .sp
596 .RS 4
597 .ie n \{\
598 \h'-04'\(bu\h'+03'\c
599 .\}
600 .el \{\
601 .sp -1
602 .IP \(bu 2.3
603 .\}
604 The same trailer as a v1 pack file:
605 .sp
606 .if n \{\
607 .RS 4
608 .\}
609 .nf
610 A copy of the pack checksum at the end of the
611 corresponding packfile\&.
612 .fi
613 .if n \{\
614 .RE
615 .\}
616 .sp
617 .if n \{\
618 .RS 4
619 .\}
620 .nf
621 Index checksum of all of the above\&.
622 .fi
623 .if n \{\
624 .RE
625 .\}
626 .RE
627 .SH "PACK\-*\&.REV FILES HAVE THE FORMAT:"
628 .sp
629 .RS 4
630 .ie n \{\
631 \h'-04'\(bu\h'+03'\c
632 .\}
633 .el \{\
634 .sp -1
635 .IP \(bu 2.3
636 .\}
637 A 4\-byte magic number
638 \fI0x52494458\fR
639 (\fIRIDX\fR)\&.
640 .RE
641 .sp
642 .RS 4
643 .ie n \{\
644 \h'-04'\(bu\h'+03'\c
645 .\}
646 .el \{\
647 .sp -1
648 .IP \(bu 2.3
649 .\}
650 A 4\-byte version identifier (= 1)\&.
651 .RE
652 .sp
653 .RS 4
654 .ie n \{\
655 \h'-04'\(bu\h'+03'\c
656 .\}
657 .el \{\
658 .sp -1
659 .IP \(bu 2.3
660 .\}
661 A 4\-byte hash function identifier (= 1 for SHA\-1, 2 for SHA\-256)\&.
662 .RE
663 .sp
664 .RS 4
665 .ie n \{\
666 \h'-04'\(bu\h'+03'\c
667 .\}
668 .el \{\
669 .sp -1
670 .IP \(bu 2.3
671 .\}
672 A table of index positions (one per packed object, num_objects in total, each a 4\-byte unsigned integer in network order), sorted by their corresponding offsets in the packfile\&.
673 .RE
674 .sp
675 .RS 4
676 .ie n \{\
677 \h'-04'\(bu\h'+03'\c
678 .\}
679 .el \{\
680 .sp -1
681 .IP \(bu 2.3
682 .\}
683 A trailer, containing a:
684 .sp
685 .if n \{\
686 .RS 4
687 .\}
688 .nf
689 checksum of the corresponding packfile, and
690 .fi
691 .if n \{\
692 .RE
693 .\}
694 .sp
695 .if n \{\
696 .RS 4
697 .\}
698 .nf
699 a checksum of all of the above\&.
700 .fi
701 .if n \{\
702 .RE
703 .\}
704 .RE
705 .sp
706 All 4\-byte numbers are in network order\&.
707 .SH "PACK\-*\&.MTIMES FILES HAVE THE FORMAT:"
708 .sp
709 All 4\-byte numbers are in network byte order\&.
710 .sp
711 .RS 4
712 .ie n \{\
713 \h'-04'\(bu\h'+03'\c
714 .\}
715 .el \{\
716 .sp -1
717 .IP \(bu 2.3
718 .\}
719 A 4\-byte magic number
720 \fI0x4d544d45\fR
721 (\fIMTME\fR)\&.
722 .RE
723 .sp
724 .RS 4
725 .ie n \{\
726 \h'-04'\(bu\h'+03'\c
727 .\}
728 .el \{\
729 .sp -1
730 .IP \(bu 2.3
731 .\}
732 A 4\-byte version identifier (= 1)\&.
733 .RE
734 .sp
735 .RS 4
736 .ie n \{\
737 \h'-04'\(bu\h'+03'\c
738 .\}
739 .el \{\
740 .sp -1
741 .IP \(bu 2.3
742 .\}
743 A 4\-byte hash function identifier (= 1 for SHA\-1, 2 for SHA\-256)\&.
744 .RE
745 .sp
746 .RS 4
747 .ie n \{\
748 \h'-04'\(bu\h'+03'\c
749 .\}
750 .el \{\
751 .sp -1
752 .IP \(bu 2.3
753 .\}
754 A table of 4\-byte unsigned integers\&. The ith value is the modification time (mtime) of the ith object in the corresponding pack by lexicographic (index) order\&. The mtimes count standard epoch seconds\&.
755 .RE
756 .sp
757 .RS 4
758 .ie n \{\
759 \h'-04'\(bu\h'+03'\c
760 .\}
761 .el \{\
762 .sp -1
763 .IP \(bu 2.3
764 .\}
765 A trailer, containing a checksum of the corresponding packfile, and a checksum of all of the above (each having length according to the specified hash function)\&.
766 .RE
767 .SH "MULTI\-PACK\-INDEX (MIDX) FILES HAVE THE FOLLOWING FORMAT:"
768 .sp
769 The multi\-pack\-index files refer to multiple pack\-files and loose objects\&.
770 .sp
771 In order to allow extensions that add extra data to the MIDX, we organize the body into "chunks" and provide a lookup table at the beginning of the body\&. The header includes certain length values, such as the number of packs, the number of base MIDX files, hash lengths and types\&.
772 .sp
773 All 4\-byte numbers are in network order\&.
774 .sp
775 HEADER:
776 .sp
777 .if n \{\
778 .RS 4
779 .\}
780 .nf
781 4\-byte signature:
782 The signature is: {\*(AqM\*(Aq, \*(AqI\*(Aq, \*(AqD\*(Aq, \*(AqX\*(Aq}
783 .fi
784 .if n \{\
785 .RE
786 .\}
787 .sp
788 .if n \{\
789 .RS 4
790 .\}
791 .nf
792 1\-byte version number:
793 Git only writes or recognizes version 1\&.
794 .fi
795 .if n \{\
796 .RE
797 .\}
798 .sp
799 .if n \{\
800 .RS 4
801 .\}
802 .nf
803 1\-byte Object Id Version
804 We infer the length of object IDs (OIDs) from this value:
805 1 => SHA\-1
806 2 => SHA\-256
807 If the hash type does not match the repository\*(Aqs hash algorithm,
808 the multi\-pack\-index file should be ignored with a warning
809 presented to the user\&.
810 .fi
811 .if n \{\
812 .RE
813 .\}
814 .sp
815 .if n \{\
816 .RS 4
817 .\}
818 .nf
819 1\-byte number of "chunks"
820 .fi
821 .if n \{\
822 .RE
823 .\}
824 .sp
825 .if n \{\
826 .RS 4
827 .\}
828 .nf
829 1\-byte number of base multi\-pack\-index files:
830 This value is currently always zero\&.
831 .fi
832 .if n \{\
833 .RE
834 .\}
835 .sp
836 .if n \{\
837 .RS 4
838 .\}
839 .nf
840 4\-byte number of pack files
841 .fi
842 .if n \{\
843 .RE
844 .\}
845 .sp
846 CHUNK LOOKUP:
847 .sp
848 .if n \{\
849 .RS 4
850 .\}
851 .nf
852 (C + 1) * 12 bytes providing the chunk offsets:
853 First 4 bytes describe chunk id\&. Value 0 is a terminating label\&.
854 Other 8 bytes provide offset in current file for chunk to start\&.
855 (Chunks are provided in file\-order, so you can infer the length
856 using the next chunk position if necessary\&.)
857 .fi
858 .if n \{\
859 .RE
860 .\}
861 .sp
862 .if n \{\
863 .RS 4
864 .\}
865 .nf
866 The CHUNK LOOKUP matches the table of contents from
867 the chunk\-based file format, see linkgit:gitformat\-chunk[5]\&.
868 .fi
869 .if n \{\
870 .RE
871 .\}
872 .sp
873 .if n \{\
874 .RS 4
875 .\}
876 .nf
877 The remaining data in the body is described one chunk at a time, and
878 these chunks may be given in any order\&. Chunks are required unless
879 otherwise specified\&.
880 .fi
881 .if n \{\
882 .RE
883 .\}
884 .sp
885 CHUNK DATA:
886 .sp
887 .if n \{\
888 .RS 4
889 .\}
890 .nf
891 Packfile Names (ID: {\*(AqP\*(Aq, \*(AqN\*(Aq, \*(AqA\*(Aq, \*(AqM\*(Aq})
892 Store the names of packfiles as a sequence of NUL\-terminated
893 strings\&. There is no extra padding between the filenames,
894 and they are listed in lexicographic order\&. The chunk itself
895 is padded at the end with between 0 and 3 NUL bytes to make the
896 chunk size a multiple of 4 bytes\&.
897 .fi
898 .if n \{\
899 .RE
900 .\}
901 .sp
902 .if n \{\
903 .RS 4
904 .\}
905 .nf
906 Bitmapped Packfiles (ID: {\*(AqB\*(Aq, \*(AqT\*(Aq, \*(AqM\*(Aq, \*(AqP\*(Aq})
907 Stores a table of two 4\-byte unsigned integers in network order\&.
908 Each table entry corresponds to a single pack (in the order that
909 they appear above in the `PNAM` chunk)\&. The values for each table
910 entry are as follows:
911 \- The first bit position (in pseudo\-pack order, see below) to
912 contain an object from that pack\&.
913 \- The number of bits whose objects are selected from that pack\&.
914 .fi
915 .if n \{\
916 .RE
917 .\}
918 .sp
919 .if n \{\
920 .RS 4
921 .\}
922 .nf
923 OID Fanout (ID: {\*(AqO\*(Aq, \*(AqI\*(Aq, \*(AqD\*(Aq, \*(AqF\*(Aq})
924 The ith entry, F[i], stores the number of OIDs with first
925 byte at most i\&. Thus F[255] stores the total
926 number of objects\&.
927 .fi
928 .if n \{\
929 .RE
930 .\}
931 .sp
932 .if n \{\
933 .RS 4
934 .\}
935 .nf
936 OID Lookup (ID: {\*(AqO\*(Aq, \*(AqI\*(Aq, \*(AqD\*(Aq, \*(AqL\*(Aq})
937 The OIDs for all objects in the MIDX are stored in lexicographic
938 order in this chunk\&.
939 .fi
940 .if n \{\
941 .RE
942 .\}
943 .sp
944 .if n \{\
945 .RS 4
946 .\}
947 .nf
948 Object Offsets (ID: {\*(AqO\*(Aq, \*(AqO\*(Aq, \*(AqF\*(Aq, \*(AqF\*(Aq})
949 Stores two 4\-byte values for every object\&.
950 1: The pack\-int\-id for the pack storing this object\&.
951 2: The offset within the pack\&.
952 If all offsets are less than 2^32, then the large offset chunk
953 will not exist and offsets are stored as in IDX v1\&.
954 If there is at least one offset value larger than 2^32\-1, then
955 the large offset chunk must exist, and offsets larger than
956 2^31\-1 must be stored in it instead\&. If the large offset chunk
957 exists and the 31st bit is on, then removing that bit reveals
958 the row in the large offsets containing the 8\-byte offset of
959 this object\&.
960 .fi
961 .if n \{\
962 .RE
963 .\}
964 .sp
965 .if n \{\
966 .RS 4
967 .\}
968 .nf
969 [Optional] Object Large Offsets (ID: {\*(AqL\*(Aq, \*(AqO\*(Aq, \*(AqF\*(Aq, \*(AqF\*(Aq})
970 8\-byte offsets into large packfiles\&.
971 .fi
972 .if n \{\
973 .RE
974 .\}
975 .sp
976 .if n \{\
977 .RS 4
978 .\}
979 .nf
980 [Optional] Bitmap pack order (ID: {\*(AqR\*(Aq, \*(AqI\*(Aq, \*(AqD\*(Aq, \*(AqX\*(Aq})
981 A list of MIDX positions (one per object in the MIDX, num_objects in
982 total, each a 4\-byte unsigned integer in network byte order), sorted
983 according to their relative bitmap/pseudo\-pack positions\&.
984 .fi
985 .if n \{\
986 .RE
987 .\}
988 .sp
989 TRAILER:
990 .sp
991 .if n \{\
992 .RS 4
993 .\}
994 .nf
995 Index checksum of the above contents\&.
996 .fi
997 .if n \{\
998 .RE
999 .\}
1000 .SH "MULTI\-PACK\-INDEX REVERSE INDEXES"
1001 .sp
1002 Similar to the pack\-based reverse index, the multi\-pack index can also be used to generate a reverse index\&.
1003 .sp
1004 Instead of mapping between offset, pack\-, and index position, this reverse index maps between an object\(cqs position within the MIDX, and that object\(cqs position within a pseudo\-pack that the MIDX describes (i\&.e\&., the ith entry of the multi\-pack reverse index holds the MIDX position of ith object in pseudo\-pack order)\&.
1005 .sp
1006 To clarify the difference between these orderings, consider a multi\-pack reachability bitmap (which does not yet exist, but is what we are building towards here)\&. Each bit needs to correspond to an object in the MIDX, and so we need an efficient mapping from bit position to MIDX position\&.
1007 .sp
1008 One solution is to let bits occupy the same position in the oid\-sorted index stored by the MIDX\&. But because oids are effectively random, their resulting reachability bitmaps would have no locality, and thus compress poorly\&. (This is the reason that single\-pack bitmaps use the pack ordering, and not the \&.idx ordering, for the same purpose\&.)
1009 .sp
1010 So we\(cqd like to define an ordering for the whole MIDX based around pack ordering, which has far better locality (and thus compresses more efficiently)\&. We can think of a pseudo\-pack created by the concatenation of all of the packs in the MIDX\&. E\&.g\&., if we had a MIDX with three packs (a, b, c), with 10, 15, and 20 objects respectively, we can imagine an ordering of the objects like:
1011 .sp
1012 .if n \{\
1013 .RS 4
1014 .\}
1015 .nf
1016 |a,0|a,1|\&.\&.\&.|a,9|b,0|b,1|\&.\&.\&.|b,14|c,0|c,1|\&.\&.\&.|c,19|
1017 .fi
1018 .if n \{\
1019 .RE
1020 .\}
1021 .sp
1022 where the ordering of the packs is defined by the MIDX\(cqs pack list, and then the ordering of objects within each pack is the same as the order in the actual packfile\&.
1023 .sp
1024 Given the list of packs and their counts of objects, you can na\(:ively reconstruct that pseudo\-pack ordering (e\&.g\&., the object at position 27 must be (c,1) because packs "a" and "b" consumed 25 of the slots)\&. But there\(cqs a catch\&. Objects may be duplicated between packs, in which case the MIDX only stores one pointer to the object (and thus we\(cqd want only one slot in the bitmap)\&.
1025 .sp
1026 Callers could handle duplicates themselves by reading objects in order of their bit\-position, but that\(cqs linear in the number of objects, and much too expensive for ordinary bitmap lookups\&. Building a reverse index solves this, since it is the logical inverse of the index, and that index has already removed duplicates\&. But, building a reverse index on the fly can be expensive\&. Since we already have an on\-disk format for pack\-based reverse indexes, let\(cqs reuse it for the MIDX\(cqs pseudo\-pack, too\&.
1027 .sp
1028 Objects from the MIDX are ordered as follows to string together the pseudo\-pack\&. Let \fBpack(o)\fR return the pack from which \fBo\fR was selected by the MIDX, and define an ordering of packs based on their numeric ID (as stored by the MIDX)\&. Let \fBoffset(o)\fR return the object offset of \fBo\fR within \fBpack(o)\fR\&. Then, compare \fBo1\fR and \fBo2\fR as follows:
1029 .sp
1030 .RS 4
1031 .ie n \{\
1032 \h'-04'\(bu\h'+03'\c
1033 .\}
1034 .el \{\
1035 .sp -1
1036 .IP \(bu 2.3
1037 .\}
1038 If one of
1039 \fBpack(o1)\fR
1040 and
1041 \fBpack(o2)\fR
1042 is preferred and the other is not, then the preferred one sorts first\&.
1043 .sp
1044 (This is a detail that allows the MIDX bitmap to determine which pack should be used by the pack\-reuse mechanism, since it can ask the MIDX for the pack containing the object at bit position 0)\&.
1045 .RE
1046 .sp
1047 .RS 4
1048 .ie n \{\
1049 \h'-04'\(bu\h'+03'\c
1050 .\}
1051 .el \{\
1052 .sp -1
1053 .IP \(bu 2.3
1054 .\}
1055 If
1056 \fBpack(o1) \(!= pack(o2)\fR, then sort the two objects in descending order based on the pack ID\&.
1057 .RE
1058 .sp
1059 .RS 4
1060 .ie n \{\
1061 \h'-04'\(bu\h'+03'\c
1062 .\}
1063 .el \{\
1064 .sp -1
1065 .IP \(bu 2.3
1066 .\}
1067 Otherwise,
1068 \fBpack(o1) = pack(o2)\fR, and the objects are sorted in pack\-order (i\&.e\&.,
1069 \fBo1\fR
1070 sorts ahead of
1071 \fBo2\fR
1072 exactly when
1073 \fBoffset(o1) < offset(o2)\fR)\&.
1074 .RE
1075 .sp
1076 In short, a MIDX\(cqs pseudo\-pack is the de\-duplicated concatenation of objects in packs stored by the MIDX, laid out in pack order, and the packs arranged in MIDX order (with the preferred pack coming first)\&.
1077 .sp
1078 The MIDX\(cqs reverse index is stored in the optional \fIRIDX\fR chunk within the MIDX itself\&.
1079 .SS "\fBBTMP\fR chunk"
1080 .sp
1081 The Bitmapped Packfiles (\fBBTMP\fR) chunk encodes additional information about the objects in the multi\-pack index\(cqs reachability bitmap\&. Recall that objects from the MIDX are arranged in "pseudo\-pack" order (see above) for reachability bitmaps\&.
1082 .sp
1083 From the example above, suppose we have packs "a", "b", and "c", with 10, 15, and 20 objects, respectively\&. In pseudo\-pack order, those would be arranged as follows:
1084 .sp
1085 .if n \{\
1086 .RS 4
1087 .\}
1088 .nf
1089 |a,0|a,1|\&.\&.\&.|a,9|b,0|b,1|\&.\&.\&.|b,14|c,0|c,1|\&.\&.\&.|c,19|
1090 .fi
1091 .if n \{\
1092 .RE
1093 .\}
1094 .sp
1095 When working with single\-pack bitmaps (or, equivalently, multi\-pack reachability bitmaps with a preferred pack), \fBgit-pack-objects\fR(1) performs \(lqverbatim\(rq reuse, attempting to reuse chunks of the bitmapped or preferred packfile instead of adding objects to the packing list\&.
1096 .sp
1097 When a chunk of bytes is reused from an existing pack, any objects contained therein do not need to be added to the packing list, saving memory and CPU time\&. But a chunk from an existing packfile can only be reused when the following conditions are met:
1098 .sp
1099 .RS 4
1100 .ie n \{\
1101 \h'-04'\(bu\h'+03'\c
1102 .\}
1103 .el \{\
1104 .sp -1
1105 .IP \(bu 2.3
1106 .\}
1107 The chunk contains only objects which were requested by the caller (i\&.e\&. does not contain any objects which the caller didn\(cqt ask for explicitly or implicitly)\&.
1108 .RE
1109 .sp
1110 .RS 4
1111 .ie n \{\
1112 \h'-04'\(bu\h'+03'\c
1113 .\}
1114 .el \{\
1115 .sp -1
1116 .IP \(bu 2.3
1117 .\}
1118 All objects stored in non\-thin packs as offset\- or reference\-deltas also include their base object in the resulting pack\&.
1119 .RE
1120 .sp
1121 The \fBBTMP\fR chunk encodes the necessary information in order to implement multi\-pack reuse over a set of packfiles as described above\&. Specifically, the \fBBTMP\fR chunk encodes three pieces of information (all 32\-bit unsigned integers in network byte\-order) for each packfile \fBp\fR that is stored in the MIDX, as follows:
1122 .PP
1123 \fBbitmap_pos\fR
1124 .RS 4
1125 The first bit position (in pseudo\-pack order) in the multi\-pack index\(cqs reachability bitmap occupied by an object from
1126 \fBp\fR\&.
1127 .RE
1128 .PP
1129 \fBbitmap_nr\fR
1130 .RS 4
1131 The number of bit positions (including the one at
1132 \fBbitmap_pos\fR) that encode objects from that pack
1133 \fBp\fR\&.
1134 .RE
1135 .sp
1136 For example, the \fBBTMP\fR chunk corresponding to the above example (with packs \(lqa\(rq, \(lqb\(rq, and \(lqc\(rq) would look like:
1137 .TS
1138 allbox tab(:);
1139 lt lt lt
1140 lt lt lt
1141 lt lt lt
1142 lt lt lt.
1143 T{
1144 .sp
1145 T}:T{
1146 .sp
1147 \fBbitmap_pos\fR
1148 T}:T{
1149 .sp
1150 \fBbitmap_nr\fR
1151 T}
1152 T{
1153 .sp
1154 packfile \(lqa\(rq
1155 T}:T{
1156 .sp
1157 \fB0\fR
1158 T}:T{
1159 .sp
1160 \fB10\fR
1161 T}
1162 T{
1163 .sp
1164 packfile \(lqb\(rq
1165 T}:T{
1166 .sp
1167 \fB10\fR
1168 T}:T{
1169 .sp
1170 \fB15\fR
1171 T}
1172 T{
1173 .sp
1174 packfile \(lqc\(rq
1175 T}:T{
1176 .sp
1177 \fB25\fR
1178 T}:T{
1179 .sp
1180 \fB20\fR
1181 T}
1182 .TE
1183 .sp 1
1184 .sp
1185 With this information in place, we can treat each packfile as individually reusable in the same fashion as verbatim pack reuse is performed on individual packs prior to the implementation of the \fBBTMP\fR chunk\&.
1186 .SH "CRUFT PACKS"
1187 .sp
1188 The cruft packs feature offer an alternative to Git\(cqs traditional mechanism of removing unreachable objects\&. This document provides an overview of Git\(cqs pruning mechanism, and how a cruft pack can be used instead to accomplish the same\&.
1189 .SS "Background"
1190 .sp
1191 To remove unreachable objects from your repository, Git offers \fBgit repack \-Ad\fR (see \fBgit-repack\fR(1))\&. Quoting from the documentation:
1192 .sp
1193 .if n \{\
1194 .RS 4
1195 .\}
1196 .nf
1197 [\&.\&.\&.] unreachable objects in a previous pack become loose, unpacked objects,
1198 instead of being left in the old pack\&. [\&.\&.\&.] loose unreachable objects will be
1199 pruned according to normal expiry rules with the next \*(Aqgit gc\*(Aq invocation\&.
1200 .fi
1201 .if n \{\
1202 .RE
1203 .\}
1204 .sp
1205 .sp
1206 Unreachable objects aren\(cqt removed immediately, since doing so could race with an incoming push which may reference an object which is about to be deleted\&. Instead, those unreachable objects are stored as loose objects and stay that way until they are older than the expiration window, at which point they are removed by \fBgit-prune\fR(1)\&.
1207 .sp
1208 Git must store these unreachable objects loose in order to keep track of their per\-object mtimes\&. If these unreachable objects were written into one big pack, then either freshening that pack (because an object contained within it was re\-written) or creating a new pack of unreachable objects would cause the pack\(cqs mtime to get updated, and the objects within it would never leave the expiration window\&. Instead, objects are stored loose in order to keep track of the individual object mtimes and avoid a situation where all cruft objects are freshened at once\&.
1209 .sp
1210 This can lead to undesirable situations when a repository contains many unreachable objects which have not yet left the grace period\&. Having large directories in the shards of \fB\&.git/objects\fR can lead to decreased performance in the repository\&. But given enough unreachable objects, this can lead to inode starvation and degrade the performance of the whole system\&. Since we can never pack those objects, these repositories often take up a large amount of disk space, since we can only zlib compress them, but not store them in delta chains\&.
1211 .SS "Cruft packs"
1212 .sp
1213 A cruft pack eliminates the need for storing unreachable objects in a loose state by including the per\-object mtimes in a separate file alongside a single pack containing all loose objects\&.
1214 .sp
1215 A cruft pack is written by \fBgit repack \-\-cruft\fR when generating a new pack\&. \fBgit-pack-objects\fR(1)\*(Aqs \fB\-\-cruft\fR option\&. Note that \fBgit repack \-\-cruft\fR is a classic all\-into\-one repack, meaning that everything in the resulting pack is reachable, and everything else is unreachable\&. Once written, the \fB\-\-cruft\fR option instructs \fBgit repack\fR to generate another pack containing only objects not packed in the previous step (which equates to packing all unreachable objects together)\&. This progresses as follows:
1216 .sp
1217 .RS 4
1218 .ie n \{\
1219 \h'-04' 1.\h'+01'\c
1220 .\}
1221 .el \{\
1222 .sp -1
1223 .IP " 1." 4.2
1224 .\}
1225 Enumerate every object, marking any object which is (a) not contained in a kept\-pack, and (b) whose mtime is within the grace period as a traversal tip\&.
1226 .RE
1227 .sp
1228 .RS 4
1229 .ie n \{\
1230 \h'-04' 2.\h'+01'\c
1231 .\}
1232 .el \{\
1233 .sp -1
1234 .IP " 2." 4.2
1235 .\}
1236 Perform a reachability traversal based on the tips gathered in the previous step, adding every object along the way to the pack\&.
1237 .RE
1238 .sp
1239 .RS 4
1240 .ie n \{\
1241 \h'-04' 3.\h'+01'\c
1242 .\}
1243 .el \{\
1244 .sp -1
1245 .IP " 3." 4.2
1246 .\}
1247 Write the pack out, along with a
1248 \fB\&.mtimes\fR
1249 file that records the per\-object timestamps\&.
1250 .RE
1251 .sp
1252 This mode is invoked internally by \fBgit-repack\fR(1) when instructed to write a cruft pack\&. Crucially, the set of in\-core kept packs is exactly the set of packs which will not be deleted by the repack; in other words, they contain all of the repository\(cqs reachable objects\&.
1253 .sp
1254 When a repository already has a cruft pack, \fBgit repack \-\-cruft\fR typically only adds objects to it\&. An exception to this is when \fBgit repack\fR is given the \fB\-\-cruft\-expiration\fR option, which allows the generated cruft pack to omit expired objects instead of waiting for \fBgit-gc\fR(1) to expire those objects later on\&.
1255 .sp
1256 It is \fBgit-gc\fR(1) that is typically responsible for removing expired unreachable objects\&.
1257 .SS "Alternatives"
1258 .sp
1259 Notable alternatives to this design include:
1260 .sp
1261 .RS 4
1262 .ie n \{\
1263 \h'-04'\(bu\h'+03'\c
1264 .\}
1265 .el \{\
1266 .sp -1
1267 .IP \(bu 2.3
1268 .\}
1269 The location of the per\-object mtime data\&.
1270 .RE
1271 .sp
1272 On the location of mtime data, a new auxiliary file tied to the pack was chosen to avoid complicating the \fB\&.idx\fR format\&. If the \fB\&.idx\fR format were ever to gain support for optional chunks of data, it may make sense to consolidate the \fB\&.mtimes\fR format into the \fB\&.idx\fR itself\&.
1273 .SH "GIT"
1274 .sp
1275 Part of the \fBgit\fR(1) suite