2 * GIT - The information manager from hell
4 * Copyright (C) Linus Torvalds, 2005
6 #define NO_THE_INDEX_COMPATIBILITY_MACROS
13 #include "cache-tree.h"
16 #include "object-store.h"
20 #include "resolve-undo.h"
23 #include "split-index.h"
25 #include "fsmonitor.h"
26 #include "thread-utils.h"
28 /* Mask for the name length in ce_flags in the on-disk index */
30 #define CE_NAMEMASK (0x0fff)
34 * The first letter should be 'A'..'Z' for extensions that are not
35 * necessary for a correct operation (i.e. optimization data).
36 * When new extensions are added that _needs_ to be understood in
37 * order to correctly interpret the index file, pick character that
38 * is outside the range, to cause the reader to abort.
41 #define CACHE_EXT(s) ( (s[0]<<24)|(s[1]<<16)|(s[2]<<8)|(s[3]) )
42 #define CACHE_EXT_TREE 0x54524545 /* "TREE" */
43 #define CACHE_EXT_RESOLVE_UNDO 0x52455543 /* "REUC" */
44 #define CACHE_EXT_LINK 0x6c696e6b /* "link" */
45 #define CACHE_EXT_UNTRACKED 0x554E5452 /* "UNTR" */
46 #define CACHE_EXT_FSMONITOR 0x46534D4E /* "FSMN" */
47 #define CACHE_EXT_ENDOFINDEXENTRIES 0x454F4945 /* "EOIE" */
49 /* changes that can be kept in $GIT_DIR/index (basically all extensions) */
50 #define EXTMASK (RESOLVE_UNDO_CHANGED | CACHE_TREE_CHANGED | \
51 CE_ENTRY_ADDED | CE_ENTRY_REMOVED | CE_ENTRY_CHANGED | \
52 SPLIT_INDEX_ORDERED | UNTRACKED_CHANGED | FSMONITOR_CHANGED)
56 * This is an estimate of the pathname length in the index. We use
57 * this for V4 index files to guess the un-deltafied size of the index
58 * in memory because of pathname deltafication. This is not required
59 * for V2/V3 index formats because their pathnames are not compressed.
60 * If the initial amount of memory set aside is not sufficient, the
61 * mem pool will allocate extra memory.
63 #define CACHE_ENTRY_PATH_LENGTH 80
65 static inline struct cache_entry
*mem_pool__ce_alloc(struct mem_pool
*mem_pool
, size_t len
)
67 struct cache_entry
*ce
;
68 ce
= mem_pool_alloc(mem_pool
, cache_entry_size(len
));
69 ce
->mem_pool_allocated
= 1;
73 static inline struct cache_entry
*mem_pool__ce_calloc(struct mem_pool
*mem_pool
, size_t len
)
75 struct cache_entry
* ce
;
76 ce
= mem_pool_calloc(mem_pool
, 1, cache_entry_size(len
));
77 ce
->mem_pool_allocated
= 1;
81 static struct mem_pool
*find_mem_pool(struct index_state
*istate
)
83 struct mem_pool
**pool_ptr
;
85 if (istate
->split_index
&& istate
->split_index
->base
)
86 pool_ptr
= &istate
->split_index
->base
->ce_mem_pool
;
88 pool_ptr
= &istate
->ce_mem_pool
;
91 mem_pool_init(pool_ptr
, 0);
96 struct index_state the_index
;
97 static const char *alternate_index_output
;
99 static void set_index_entry(struct index_state
*istate
, int nr
, struct cache_entry
*ce
)
101 istate
->cache
[nr
] = ce
;
102 add_name_hash(istate
, ce
);
105 static void replace_index_entry(struct index_state
*istate
, int nr
, struct cache_entry
*ce
)
107 struct cache_entry
*old
= istate
->cache
[nr
];
109 replace_index_entry_in_base(istate
, old
, ce
);
110 remove_name_hash(istate
, old
);
111 discard_cache_entry(old
);
112 ce
->ce_flags
&= ~CE_HASHED
;
113 set_index_entry(istate
, nr
, ce
);
114 ce
->ce_flags
|= CE_UPDATE_IN_BASE
;
115 mark_fsmonitor_invalid(istate
, ce
);
116 istate
->cache_changed
|= CE_ENTRY_CHANGED
;
119 void rename_index_entry_at(struct index_state
*istate
, int nr
, const char *new_name
)
121 struct cache_entry
*old_entry
= istate
->cache
[nr
], *new_entry
;
122 int namelen
= strlen(new_name
);
124 new_entry
= make_empty_cache_entry(istate
, namelen
);
125 copy_cache_entry(new_entry
, old_entry
);
126 new_entry
->ce_flags
&= ~CE_HASHED
;
127 new_entry
->ce_namelen
= namelen
;
128 new_entry
->index
= 0;
129 memcpy(new_entry
->name
, new_name
, namelen
+ 1);
131 cache_tree_invalidate_path(istate
, old_entry
->name
);
132 untracked_cache_remove_from_index(istate
, old_entry
->name
);
133 remove_index_entry_at(istate
, nr
);
134 add_index_entry(istate
, new_entry
, ADD_CACHE_OK_TO_ADD
|ADD_CACHE_OK_TO_REPLACE
);
137 void fill_stat_data(struct stat_data
*sd
, struct stat
*st
)
139 sd
->sd_ctime
.sec
= (unsigned int)st
->st_ctime
;
140 sd
->sd_mtime
.sec
= (unsigned int)st
->st_mtime
;
141 sd
->sd_ctime
.nsec
= ST_CTIME_NSEC(*st
);
142 sd
->sd_mtime
.nsec
= ST_MTIME_NSEC(*st
);
143 sd
->sd_dev
= st
->st_dev
;
144 sd
->sd_ino
= st
->st_ino
;
145 sd
->sd_uid
= st
->st_uid
;
146 sd
->sd_gid
= st
->st_gid
;
147 sd
->sd_size
= st
->st_size
;
150 int match_stat_data(const struct stat_data
*sd
, struct stat
*st
)
154 if (sd
->sd_mtime
.sec
!= (unsigned int)st
->st_mtime
)
155 changed
|= MTIME_CHANGED
;
156 if (trust_ctime
&& check_stat
&&
157 sd
->sd_ctime
.sec
!= (unsigned int)st
->st_ctime
)
158 changed
|= CTIME_CHANGED
;
161 if (check_stat
&& sd
->sd_mtime
.nsec
!= ST_MTIME_NSEC(*st
))
162 changed
|= MTIME_CHANGED
;
163 if (trust_ctime
&& check_stat
&&
164 sd
->sd_ctime
.nsec
!= ST_CTIME_NSEC(*st
))
165 changed
|= CTIME_CHANGED
;
169 if (sd
->sd_uid
!= (unsigned int) st
->st_uid
||
170 sd
->sd_gid
!= (unsigned int) st
->st_gid
)
171 changed
|= OWNER_CHANGED
;
172 if (sd
->sd_ino
!= (unsigned int) st
->st_ino
)
173 changed
|= INODE_CHANGED
;
178 * st_dev breaks on network filesystems where different
179 * clients will have different views of what "device"
180 * the filesystem is on
182 if (check_stat
&& sd
->sd_dev
!= (unsigned int) st
->st_dev
)
183 changed
|= INODE_CHANGED
;
186 if (sd
->sd_size
!= (unsigned int) st
->st_size
)
187 changed
|= DATA_CHANGED
;
193 * This only updates the "non-critical" parts of the directory
194 * cache, ie the parts that aren't tracked by GIT, and only used
195 * to validate the cache.
197 void fill_stat_cache_info(struct cache_entry
*ce
, struct stat
*st
)
199 fill_stat_data(&ce
->ce_stat_data
, st
);
201 if (assume_unchanged
)
202 ce
->ce_flags
|= CE_VALID
;
204 if (S_ISREG(st
->st_mode
)) {
205 ce_mark_uptodate(ce
);
206 mark_fsmonitor_valid(ce
);
210 static int ce_compare_data(const struct cache_entry
*ce
, struct stat
*st
)
213 int fd
= git_open_cloexec(ce
->name
, O_RDONLY
);
216 struct object_id oid
;
217 if (!index_fd(&oid
, fd
, st
, OBJ_BLOB
, ce
->name
, 0))
218 match
= !oideq(&oid
, &ce
->oid
);
219 /* index_fd() closed the file descriptor already */
224 static int ce_compare_link(const struct cache_entry
*ce
, size_t expected_size
)
229 enum object_type type
;
230 struct strbuf sb
= STRBUF_INIT
;
232 if (strbuf_readlink(&sb
, ce
->name
, expected_size
))
235 buffer
= read_object_file(&ce
->oid
, &type
, &size
);
238 match
= memcmp(buffer
, sb
.buf
, size
);
245 static int ce_compare_gitlink(const struct cache_entry
*ce
)
247 struct object_id oid
;
250 * We don't actually require that the .git directory
251 * under GITLINK directory be a valid git directory. It
252 * might even be missing (in case nobody populated that
255 * If so, we consider it always to match.
257 if (resolve_gitlink_ref(ce
->name
, "HEAD", &oid
) < 0)
259 return !oideq(&oid
, &ce
->oid
);
262 static int ce_modified_check_fs(const struct cache_entry
*ce
, struct stat
*st
)
264 switch (st
->st_mode
& S_IFMT
) {
266 if (ce_compare_data(ce
, st
))
270 if (ce_compare_link(ce
, xsize_t(st
->st_size
)))
274 if (S_ISGITLINK(ce
->ce_mode
))
275 return ce_compare_gitlink(ce
) ? DATA_CHANGED
: 0;
276 /* else fallthrough */
283 static int ce_match_stat_basic(const struct cache_entry
*ce
, struct stat
*st
)
285 unsigned int changed
= 0;
287 if (ce
->ce_flags
& CE_REMOVE
)
288 return MODE_CHANGED
| DATA_CHANGED
| TYPE_CHANGED
;
290 switch (ce
->ce_mode
& S_IFMT
) {
292 changed
|= !S_ISREG(st
->st_mode
) ? TYPE_CHANGED
: 0;
293 /* We consider only the owner x bit to be relevant for
296 if (trust_executable_bit
&&
297 (0100 & (ce
->ce_mode
^ st
->st_mode
)))
298 changed
|= MODE_CHANGED
;
301 if (!S_ISLNK(st
->st_mode
) &&
302 (has_symlinks
|| !S_ISREG(st
->st_mode
)))
303 changed
|= TYPE_CHANGED
;
306 /* We ignore most of the st_xxx fields for gitlinks */
307 if (!S_ISDIR(st
->st_mode
))
308 changed
|= TYPE_CHANGED
;
309 else if (ce_compare_gitlink(ce
))
310 changed
|= DATA_CHANGED
;
313 die("internal error: ce_mode is %o", ce
->ce_mode
);
316 changed
|= match_stat_data(&ce
->ce_stat_data
, st
);
318 /* Racily smudged entry? */
319 if (!ce
->ce_stat_data
.sd_size
) {
320 if (!is_empty_blob_sha1(ce
->oid
.hash
))
321 changed
|= DATA_CHANGED
;
327 static int is_racy_stat(const struct index_state
*istate
,
328 const struct stat_data
*sd
)
330 return (istate
->timestamp
.sec
&&
332 /* nanosecond timestamped files can also be racy! */
333 (istate
->timestamp
.sec
< sd
->sd_mtime
.sec
||
334 (istate
->timestamp
.sec
== sd
->sd_mtime
.sec
&&
335 istate
->timestamp
.nsec
<= sd
->sd_mtime
.nsec
))
337 istate
->timestamp
.sec
<= sd
->sd_mtime
.sec
342 static int is_racy_timestamp(const struct index_state
*istate
,
343 const struct cache_entry
*ce
)
345 return (!S_ISGITLINK(ce
->ce_mode
) &&
346 is_racy_stat(istate
, &ce
->ce_stat_data
));
349 int match_stat_data_racy(const struct index_state
*istate
,
350 const struct stat_data
*sd
, struct stat
*st
)
352 if (is_racy_stat(istate
, sd
))
353 return MTIME_CHANGED
;
354 return match_stat_data(sd
, st
);
357 int ie_match_stat(struct index_state
*istate
,
358 const struct cache_entry
*ce
, struct stat
*st
,
359 unsigned int options
)
361 unsigned int changed
;
362 int ignore_valid
= options
& CE_MATCH_IGNORE_VALID
;
363 int ignore_skip_worktree
= options
& CE_MATCH_IGNORE_SKIP_WORKTREE
;
364 int assume_racy_is_modified
= options
& CE_MATCH_RACY_IS_DIRTY
;
365 int ignore_fsmonitor
= options
& CE_MATCH_IGNORE_FSMONITOR
;
367 if (!ignore_fsmonitor
)
368 refresh_fsmonitor(istate
);
370 * If it's marked as always valid in the index, it's
371 * valid whatever the checked-out copy says.
373 * skip-worktree has the same effect with higher precedence
375 if (!ignore_skip_worktree
&& ce_skip_worktree(ce
))
377 if (!ignore_valid
&& (ce
->ce_flags
& CE_VALID
))
379 if (!ignore_fsmonitor
&& (ce
->ce_flags
& CE_FSMONITOR_VALID
))
383 * Intent-to-add entries have not been added, so the index entry
384 * by definition never matches what is in the work tree until it
385 * actually gets added.
387 if (ce_intent_to_add(ce
))
388 return DATA_CHANGED
| TYPE_CHANGED
| MODE_CHANGED
;
390 changed
= ce_match_stat_basic(ce
, st
);
393 * Within 1 second of this sequence:
394 * echo xyzzy >file && git-update-index --add file
395 * running this command:
397 * would give a falsely clean cache entry. The mtime and
398 * length match the cache, and other stat fields do not change.
400 * We could detect this at update-index time (the cache entry
401 * being registered/updated records the same time as "now")
402 * and delay the return from git-update-index, but that would
403 * effectively mean we can make at most one commit per second,
404 * which is not acceptable. Instead, we check cache entries
405 * whose mtime are the same as the index file timestamp more
406 * carefully than others.
408 if (!changed
&& is_racy_timestamp(istate
, ce
)) {
409 if (assume_racy_is_modified
)
410 changed
|= DATA_CHANGED
;
412 changed
|= ce_modified_check_fs(ce
, st
);
418 int ie_modified(struct index_state
*istate
,
419 const struct cache_entry
*ce
,
420 struct stat
*st
, unsigned int options
)
422 int changed
, changed_fs
;
424 changed
= ie_match_stat(istate
, ce
, st
, options
);
428 * If the mode or type has changed, there's no point in trying
429 * to refresh the entry - it's not going to match
431 if (changed
& (MODE_CHANGED
| TYPE_CHANGED
))
435 * Immediately after read-tree or update-index --cacheinfo,
436 * the length field is zero, as we have never even read the
437 * lstat(2) information once, and we cannot trust DATA_CHANGED
438 * returned by ie_match_stat() which in turn was returned by
439 * ce_match_stat_basic() to signal that the filesize of the
440 * blob changed. We have to actually go to the filesystem to
441 * see if the contents match, and if so, should answer "unchanged".
443 * The logic does not apply to gitlinks, as ce_match_stat_basic()
444 * already has checked the actual HEAD from the filesystem in the
445 * subproject. If ie_match_stat() already said it is different,
446 * then we know it is.
448 if ((changed
& DATA_CHANGED
) &&
449 (S_ISGITLINK(ce
->ce_mode
) || ce
->ce_stat_data
.sd_size
!= 0))
452 changed_fs
= ce_modified_check_fs(ce
, st
);
454 return changed
| changed_fs
;
458 int base_name_compare(const char *name1
, int len1
, int mode1
,
459 const char *name2
, int len2
, int mode2
)
461 unsigned char c1
, c2
;
462 int len
= len1
< len2
? len1
: len2
;
465 cmp
= memcmp(name1
, name2
, len
);
470 if (!c1
&& S_ISDIR(mode1
))
472 if (!c2
&& S_ISDIR(mode2
))
474 return (c1
< c2
) ? -1 : (c1
> c2
) ? 1 : 0;
478 * df_name_compare() is identical to base_name_compare(), except it
479 * compares conflicting directory/file entries as equal. Note that
480 * while a directory name compares as equal to a regular file, they
481 * then individually compare _differently_ to a filename that has
482 * a dot after the basename (because '\0' < '.' < '/').
484 * This is used by routines that want to traverse the git namespace
485 * but then handle conflicting entries together when possible.
487 int df_name_compare(const char *name1
, int len1
, int mode1
,
488 const char *name2
, int len2
, int mode2
)
490 int len
= len1
< len2
? len1
: len2
, cmp
;
491 unsigned char c1
, c2
;
493 cmp
= memcmp(name1
, name2
, len
);
496 /* Directories and files compare equal (same length, same name) */
500 if (!c1
&& S_ISDIR(mode1
))
503 if (!c2
&& S_ISDIR(mode2
))
505 if (c1
== '/' && !c2
)
507 if (c2
== '/' && !c1
)
512 int name_compare(const char *name1
, size_t len1
, const char *name2
, size_t len2
)
514 size_t min_len
= (len1
< len2
) ? len1
: len2
;
515 int cmp
= memcmp(name1
, name2
, min_len
);
525 int cache_name_stage_compare(const char *name1
, int len1
, int stage1
, const char *name2
, int len2
, int stage2
)
529 cmp
= name_compare(name1
, len1
, name2
, len2
);
540 static int index_name_stage_pos(const struct index_state
*istate
, const char *name
, int namelen
, int stage
)
545 last
= istate
->cache_nr
;
546 while (last
> first
) {
547 int next
= (last
+ first
) >> 1;
548 struct cache_entry
*ce
= istate
->cache
[next
];
549 int cmp
= cache_name_stage_compare(name
, namelen
, stage
, ce
->name
, ce_namelen(ce
), ce_stage(ce
));
561 int index_name_pos(const struct index_state
*istate
, const char *name
, int namelen
)
563 return index_name_stage_pos(istate
, name
, namelen
, 0);
566 int remove_index_entry_at(struct index_state
*istate
, int pos
)
568 struct cache_entry
*ce
= istate
->cache
[pos
];
570 record_resolve_undo(istate
, ce
);
571 remove_name_hash(istate
, ce
);
572 save_or_free_index_entry(istate
, ce
);
573 istate
->cache_changed
|= CE_ENTRY_REMOVED
;
575 if (pos
>= istate
->cache_nr
)
577 MOVE_ARRAY(istate
->cache
+ pos
, istate
->cache
+ pos
+ 1,
578 istate
->cache_nr
- pos
);
583 * Remove all cache entries marked for removal, that is where
584 * CE_REMOVE is set in ce_flags. This is much more effective than
585 * calling remove_index_entry_at() for each entry to be removed.
587 void remove_marked_cache_entries(struct index_state
*istate
)
589 struct cache_entry
**ce_array
= istate
->cache
;
592 for (i
= j
= 0; i
< istate
->cache_nr
; i
++) {
593 if (ce_array
[i
]->ce_flags
& CE_REMOVE
) {
594 remove_name_hash(istate
, ce_array
[i
]);
595 save_or_free_index_entry(istate
, ce_array
[i
]);
598 ce_array
[j
++] = ce_array
[i
];
600 if (j
== istate
->cache_nr
)
602 istate
->cache_changed
|= CE_ENTRY_REMOVED
;
603 istate
->cache_nr
= j
;
606 int remove_file_from_index(struct index_state
*istate
, const char *path
)
608 int pos
= index_name_pos(istate
, path
, strlen(path
));
611 cache_tree_invalidate_path(istate
, path
);
612 untracked_cache_remove_from_index(istate
, path
);
613 while (pos
< istate
->cache_nr
&& !strcmp(istate
->cache
[pos
]->name
, path
))
614 remove_index_entry_at(istate
, pos
);
618 static int compare_name(struct cache_entry
*ce
, const char *path
, int namelen
)
620 return namelen
!= ce_namelen(ce
) || memcmp(path
, ce
->name
, namelen
);
623 static int index_name_pos_also_unmerged(struct index_state
*istate
,
624 const char *path
, int namelen
)
626 int pos
= index_name_pos(istate
, path
, namelen
);
627 struct cache_entry
*ce
;
632 /* maybe unmerged? */
634 if (pos
>= istate
->cache_nr
||
635 compare_name((ce
= istate
->cache
[pos
]), path
, namelen
))
638 /* order of preference: stage 2, 1, 3 */
639 if (ce_stage(ce
) == 1 && pos
+ 1 < istate
->cache_nr
&&
640 ce_stage((ce
= istate
->cache
[pos
+ 1])) == 2 &&
641 !compare_name(ce
, path
, namelen
))
646 static int different_name(struct cache_entry
*ce
, struct cache_entry
*alias
)
648 int len
= ce_namelen(ce
);
649 return ce_namelen(alias
) != len
|| memcmp(ce
->name
, alias
->name
, len
);
653 * If we add a filename that aliases in the cache, we will use the
654 * name that we already have - but we don't want to update the same
655 * alias twice, because that implies that there were actually two
656 * different files with aliasing names!
658 * So we use the CE_ADDED flag to verify that the alias was an old
659 * one before we accept it as
661 static struct cache_entry
*create_alias_ce(struct index_state
*istate
,
662 struct cache_entry
*ce
,
663 struct cache_entry
*alias
)
666 struct cache_entry
*new_entry
;
668 if (alias
->ce_flags
& CE_ADDED
)
669 die("Will not add file alias '%s' ('%s' already exists in index)", ce
->name
, alias
->name
);
671 /* Ok, create the new entry using the name of the existing alias */
672 len
= ce_namelen(alias
);
673 new_entry
= make_empty_cache_entry(istate
, len
);
674 memcpy(new_entry
->name
, alias
->name
, len
);
675 copy_cache_entry(new_entry
, ce
);
676 save_or_free_index_entry(istate
, ce
);
680 void set_object_name_for_intent_to_add_entry(struct cache_entry
*ce
)
682 struct object_id oid
;
683 if (write_object_file("", 0, blob_type
, &oid
))
684 die("cannot create an empty blob in the object database");
685 oidcpy(&ce
->oid
, &oid
);
688 int add_to_index(struct index_state
*istate
, const char *path
, struct stat
*st
, int flags
)
690 int namelen
, was_same
;
691 mode_t st_mode
= st
->st_mode
;
692 struct cache_entry
*ce
, *alias
= NULL
;
693 unsigned ce_option
= CE_MATCH_IGNORE_VALID
|CE_MATCH_IGNORE_SKIP_WORKTREE
|CE_MATCH_RACY_IS_DIRTY
;
694 int verbose
= flags
& (ADD_CACHE_VERBOSE
| ADD_CACHE_PRETEND
);
695 int pretend
= flags
& ADD_CACHE_PRETEND
;
696 int intent_only
= flags
& ADD_CACHE_INTENT
;
697 int add_option
= (ADD_CACHE_OK_TO_ADD
|ADD_CACHE_OK_TO_REPLACE
|
698 (intent_only
? ADD_CACHE_NEW_ONLY
: 0));
699 int newflags
= HASH_WRITE_OBJECT
;
701 if (flags
& HASH_RENORMALIZE
)
702 newflags
|= HASH_RENORMALIZE
;
704 if (!S_ISREG(st_mode
) && !S_ISLNK(st_mode
) && !S_ISDIR(st_mode
))
705 return error("%s: can only add regular files, symbolic links or git-directories", path
);
707 namelen
= strlen(path
);
708 if (S_ISDIR(st_mode
)) {
709 while (namelen
&& path
[namelen
-1] == '/')
712 ce
= make_empty_cache_entry(istate
, namelen
);
713 memcpy(ce
->name
, path
, namelen
);
714 ce
->ce_namelen
= namelen
;
716 fill_stat_cache_info(ce
, st
);
718 ce
->ce_flags
|= CE_INTENT_TO_ADD
;
721 if (trust_executable_bit
&& has_symlinks
) {
722 ce
->ce_mode
= create_ce_mode(st_mode
);
724 /* If there is an existing entry, pick the mode bits and type
725 * from it, otherwise assume unexecutable regular file.
727 struct cache_entry
*ent
;
728 int pos
= index_name_pos_also_unmerged(istate
, path
, namelen
);
730 ent
= (0 <= pos
) ? istate
->cache
[pos
] : NULL
;
731 ce
->ce_mode
= ce_mode_from_stat(ent
, st_mode
);
734 /* When core.ignorecase=true, determine if a directory of the same name but differing
735 * case already exists within the Git repository. If it does, ensure the directory
736 * case of the file being added to the repository matches (is folded into) the existing
737 * entry's directory case.
740 adjust_dirname_case(istate
, ce
->name
);
742 if (!(flags
& HASH_RENORMALIZE
)) {
743 alias
= index_file_exists(istate
, ce
->name
,
744 ce_namelen(ce
), ignore_case
);
747 !ie_match_stat(istate
, alias
, st
, ce_option
)) {
748 /* Nothing changed, really */
749 if (!S_ISGITLINK(alias
->ce_mode
))
750 ce_mark_uptodate(alias
);
751 alias
->ce_flags
|= CE_ADDED
;
753 discard_cache_entry(ce
);
758 if (index_path(&ce
->oid
, path
, st
, newflags
)) {
759 discard_cache_entry(ce
);
760 return error("unable to index file %s", path
);
763 set_object_name_for_intent_to_add_entry(ce
);
765 if (ignore_case
&& alias
&& different_name(ce
, alias
))
766 ce
= create_alias_ce(istate
, ce
, alias
);
767 ce
->ce_flags
|= CE_ADDED
;
769 /* It was suspected to be racily clean, but it turns out to be Ok */
772 oideq(&alias
->oid
, &ce
->oid
) &&
773 ce
->ce_mode
== alias
->ce_mode
);
776 discard_cache_entry(ce
);
777 else if (add_index_entry(istate
, ce
, add_option
)) {
778 discard_cache_entry(ce
);
779 return error("unable to add %s to index", path
);
781 if (verbose
&& !was_same
)
782 printf("add '%s'\n", path
);
786 int add_file_to_index(struct index_state
*istate
, const char *path
, int flags
)
789 if (lstat(path
, &st
))
790 die_errno("unable to stat '%s'", path
);
791 return add_to_index(istate
, path
, &st
, flags
);
794 struct cache_entry
*make_empty_cache_entry(struct index_state
*istate
, size_t len
)
796 return mem_pool__ce_calloc(find_mem_pool(istate
), len
);
799 struct cache_entry
*make_empty_transient_cache_entry(size_t len
)
801 return xcalloc(1, cache_entry_size(len
));
804 struct cache_entry
*make_cache_entry(struct index_state
*istate
,
806 const struct object_id
*oid
,
809 unsigned int refresh_options
)
811 struct cache_entry
*ce
, *ret
;
814 if (!verify_path(path
, mode
)) {
815 error("Invalid path '%s'", path
);
820 ce
= make_empty_cache_entry(istate
, len
);
822 oidcpy(&ce
->oid
, oid
);
823 memcpy(ce
->name
, path
, len
);
824 ce
->ce_flags
= create_ce_flags(stage
);
825 ce
->ce_namelen
= len
;
826 ce
->ce_mode
= create_ce_mode(mode
);
828 ret
= refresh_cache_entry(&the_index
, ce
, refresh_options
);
830 discard_cache_entry(ce
);
834 struct cache_entry
*make_transient_cache_entry(unsigned int mode
, const struct object_id
*oid
,
835 const char *path
, int stage
)
837 struct cache_entry
*ce
;
840 if (!verify_path(path
, mode
)) {
841 error("Invalid path '%s'", path
);
846 ce
= make_empty_transient_cache_entry(len
);
848 oidcpy(&ce
->oid
, oid
);
849 memcpy(ce
->name
, path
, len
);
850 ce
->ce_flags
= create_ce_flags(stage
);
851 ce
->ce_namelen
= len
;
852 ce
->ce_mode
= create_ce_mode(mode
);
858 * Chmod an index entry with either +x or -x.
860 * Returns -1 if the chmod for the particular cache entry failed (if it's
861 * not a regular file), -2 if an invalid flip argument is passed in, 0
864 int chmod_index_entry(struct index_state
*istate
, struct cache_entry
*ce
,
867 if (!S_ISREG(ce
->ce_mode
))
874 ce
->ce_mode
&= ~0111;
879 cache_tree_invalidate_path(istate
, ce
->name
);
880 ce
->ce_flags
|= CE_UPDATE_IN_BASE
;
881 mark_fsmonitor_invalid(istate
, ce
);
882 istate
->cache_changed
|= CE_ENTRY_CHANGED
;
887 int ce_same_name(const struct cache_entry
*a
, const struct cache_entry
*b
)
889 int len
= ce_namelen(a
);
890 return ce_namelen(b
) == len
&& !memcmp(a
->name
, b
->name
, len
);
894 * We fundamentally don't like some paths: we don't want
895 * dot or dot-dot anywhere, and for obvious reasons don't
896 * want to recurse into ".git" either.
898 * Also, we don't want double slashes or slashes at the
899 * end that can make pathnames ambiguous.
901 static int verify_dotfile(const char *rest
, unsigned mode
)
904 * The first character was '.', but that
905 * has already been discarded, we now test
909 /* "." is not allowed */
910 if (*rest
== '\0' || is_dir_sep(*rest
))
915 * ".git" followed by NUL or slash is bad. Note that we match
916 * case-insensitively here, even if ignore_case is not set.
917 * This outlaws ".GIT" everywhere out of an abundance of caution,
918 * since there's really no good reason to allow it.
920 * Once we've seen ".git", we can also find ".gitmodules", etc (also
921 * case-insensitively).
925 if (rest
[1] != 'i' && rest
[1] != 'I')
927 if (rest
[2] != 't' && rest
[2] != 'T')
929 if (rest
[3] == '\0' || is_dir_sep(rest
[3]))
933 if (skip_iprefix(rest
, "modules", &rest
) &&
934 (*rest
== '\0' || is_dir_sep(*rest
)))
939 if (rest
[1] == '\0' || is_dir_sep(rest
[1]))
945 int verify_path(const char *path
, unsigned mode
)
949 if (has_dos_drive_prefix(path
))
959 if (is_hfs_dotgit(path
))
962 if (is_hfs_dotgitmodules(path
))
967 if (is_ntfs_dotgit(path
))
970 if (is_ntfs_dotgitmodules(path
))
976 if ((c
== '.' && !verify_dotfile(path
, mode
)) ||
977 is_dir_sep(c
) || c
== '\0')
985 * Do we have another file that has the beginning components being a
986 * proper superset of the name we're trying to add?
988 static int has_file_name(struct index_state
*istate
,
989 const struct cache_entry
*ce
, int pos
, int ok_to_replace
)
992 int len
= ce_namelen(ce
);
993 int stage
= ce_stage(ce
);
994 const char *name
= ce
->name
;
996 while (pos
< istate
->cache_nr
) {
997 struct cache_entry
*p
= istate
->cache
[pos
++];
999 if (len
>= ce_namelen(p
))
1001 if (memcmp(name
, p
->name
, len
))
1003 if (ce_stage(p
) != stage
)
1005 if (p
->name
[len
] != '/')
1007 if (p
->ce_flags
& CE_REMOVE
)
1012 remove_index_entry_at(istate
, --pos
);
1019 * Like strcmp(), but also return the offset of the first change.
1020 * If strings are equal, return the length.
1022 int strcmp_offset(const char *s1
, const char *s2
, size_t *first_change
)
1027 return strcmp(s1
, s2
);
1029 for (k
= 0; s1
[k
] == s2
[k
]; k
++)
1034 return (unsigned char)s1
[k
] - (unsigned char)s2
[k
];
1038 * Do we have another file with a pathname that is a proper
1039 * subset of the name we're trying to add?
1041 * That is, is there another file in the index with a path
1042 * that matches a sub-directory in the given entry?
1044 static int has_dir_name(struct index_state
*istate
,
1045 const struct cache_entry
*ce
, int pos
, int ok_to_replace
)
1048 int stage
= ce_stage(ce
);
1049 const char *name
= ce
->name
;
1050 const char *slash
= name
+ ce_namelen(ce
);
1055 * We are frequently called during an iteration on a sorted
1056 * list of pathnames and while building a new index. Therefore,
1057 * there is a high probability that this entry will eventually
1058 * be appended to the index, rather than inserted in the middle.
1059 * If we can confirm that, we can avoid binary searches on the
1060 * components of the pathname.
1062 * Compare the entry's full path with the last path in the index.
1064 if (istate
->cache_nr
> 0) {
1065 cmp_last
= strcmp_offset(name
,
1066 istate
->cache
[istate
->cache_nr
- 1]->name
,
1069 if (len_eq_last
== 0) {
1071 * The entry sorts AFTER the last one in the
1072 * index and their paths have no common prefix,
1073 * so there cannot be a F/D conflict.
1078 * The entry sorts AFTER the last one in the
1079 * index, but has a common prefix. Fall through
1080 * to the loop below to disect the entry's path
1081 * and see where the difference is.
1084 } else if (cmp_last
== 0) {
1086 * The entry exactly matches the last one in the
1087 * index, but because of multiple stage and CE_REMOVE
1088 * items, we fall through and let the regular search
1098 if (*--slash
== '/')
1100 if (slash
<= ce
->name
)
1107 * (len + 1) is a directory boundary (including
1108 * the trailing slash). And since the loop is
1109 * decrementing "slash", the first iteration is
1110 * the longest directory prefix; subsequent
1111 * iterations consider parent directories.
1114 if (len
+ 1 <= len_eq_last
) {
1116 * The directory prefix (including the trailing
1117 * slash) also appears as a prefix in the last
1118 * entry, so the remainder cannot collide (because
1119 * strcmp said the whole path was greater).
1124 * LT: last: xxx/file_A
1130 if (len
> len_eq_last
) {
1132 * This part of the directory prefix (excluding
1133 * the trailing slash) is longer than the known
1134 * equal portions, so this sub-directory cannot
1135 * collide with a file.
1143 if (istate
->cache_nr
> 0 &&
1144 ce_namelen(istate
->cache
[istate
->cache_nr
- 1]) > len
) {
1146 * The directory prefix lines up with part of
1147 * a longer file or directory name, but sorts
1148 * after it, so this sub-directory cannot
1149 * collide with a file.
1151 * last: xxx/yy-file (because '-' sorts before '/')
1158 * This is a possible collision. Fall through and
1159 * let the regular search code handle it.
1166 pos
= index_name_stage_pos(istate
, name
, len
, stage
);
1169 * Found one, but not so fast. This could
1170 * be a marker that says "I was here, but
1171 * I am being removed". Such an entry is
1172 * not a part of the resulting tree, and
1173 * it is Ok to have a directory at the same
1176 if (!(istate
->cache
[pos
]->ce_flags
& CE_REMOVE
)) {
1180 remove_index_entry_at(istate
, pos
);
1188 * Trivial optimization: if we find an entry that
1189 * already matches the sub-directory, then we know
1190 * we're ok, and we can exit.
1192 while (pos
< istate
->cache_nr
) {
1193 struct cache_entry
*p
= istate
->cache
[pos
];
1194 if ((ce_namelen(p
) <= len
) ||
1195 (p
->name
[len
] != '/') ||
1196 memcmp(p
->name
, name
, len
))
1197 break; /* not our subdirectory */
1198 if (ce_stage(p
) == stage
&& !(p
->ce_flags
& CE_REMOVE
))
1200 * p is at the same stage as our entry, and
1201 * is a subdirectory of what we are looking
1202 * at, so we cannot have conflicts at our
1203 * level or anything shorter.
1212 /* We may be in a situation where we already have path/file and path
1213 * is being added, or we already have path and path/file is being
1214 * added. Either one would result in a nonsense tree that has path
1215 * twice when git-write-tree tries to write it out. Prevent it.
1217 * If ok-to-replace is specified, we remove the conflicting entries
1218 * from the cache so the caller should recompute the insert position.
1219 * When this happens, we return non-zero.
1221 static int check_file_directory_conflict(struct index_state
*istate
,
1222 const struct cache_entry
*ce
,
1223 int pos
, int ok_to_replace
)
1228 * When ce is an "I am going away" entry, we allow it to be added
1230 if (ce
->ce_flags
& CE_REMOVE
)
1234 * We check if the path is a sub-path of a subsequent pathname
1235 * first, since removing those will not change the position
1238 retval
= has_file_name(istate
, ce
, pos
, ok_to_replace
);
1241 * Then check if the path might have a clashing sub-directory
1244 return retval
+ has_dir_name(istate
, ce
, pos
, ok_to_replace
);
1247 static int add_index_entry_with_check(struct index_state
*istate
, struct cache_entry
*ce
, int option
)
1250 int ok_to_add
= option
& ADD_CACHE_OK_TO_ADD
;
1251 int ok_to_replace
= option
& ADD_CACHE_OK_TO_REPLACE
;
1252 int skip_df_check
= option
& ADD_CACHE_SKIP_DFCHECK
;
1253 int new_only
= option
& ADD_CACHE_NEW_ONLY
;
1255 if (!(option
& ADD_CACHE_KEEP_CACHE_TREE
))
1256 cache_tree_invalidate_path(istate
, ce
->name
);
1259 * If this entry's path sorts after the last entry in the index,
1260 * we can avoid searching for it.
1262 if (istate
->cache_nr
> 0 &&
1263 strcmp(ce
->name
, istate
->cache
[istate
->cache_nr
- 1]->name
) > 0)
1264 pos
= -istate
->cache_nr
- 1;
1266 pos
= index_name_stage_pos(istate
, ce
->name
, ce_namelen(ce
), ce_stage(ce
));
1268 /* existing match? Just replace it. */
1271 replace_index_entry(istate
, pos
, ce
);
1276 if (!(option
& ADD_CACHE_KEEP_CACHE_TREE
))
1277 untracked_cache_add_to_index(istate
, ce
->name
);
1280 * Inserting a merged entry ("stage 0") into the index
1281 * will always replace all non-merged entries..
1283 if (pos
< istate
->cache_nr
&& ce_stage(ce
) == 0) {
1284 while (ce_same_name(istate
->cache
[pos
], ce
)) {
1286 if (!remove_index_entry_at(istate
, pos
))
1293 if (!verify_path(ce
->name
, ce
->ce_mode
))
1294 return error("Invalid path '%s'", ce
->name
);
1296 if (!skip_df_check
&&
1297 check_file_directory_conflict(istate
, ce
, pos
, ok_to_replace
)) {
1299 return error("'%s' appears as both a file and as a directory",
1301 pos
= index_name_stage_pos(istate
, ce
->name
, ce_namelen(ce
), ce_stage(ce
));
1307 int add_index_entry(struct index_state
*istate
, struct cache_entry
*ce
, int option
)
1311 if (option
& ADD_CACHE_JUST_APPEND
)
1312 pos
= istate
->cache_nr
;
1315 ret
= add_index_entry_with_check(istate
, ce
, option
);
1321 /* Make sure the array is big enough .. */
1322 ALLOC_GROW(istate
->cache
, istate
->cache_nr
+ 1, istate
->cache_alloc
);
1326 if (istate
->cache_nr
> pos
+ 1)
1327 MOVE_ARRAY(istate
->cache
+ pos
+ 1, istate
->cache
+ pos
,
1328 istate
->cache_nr
- pos
- 1);
1329 set_index_entry(istate
, pos
, ce
);
1330 istate
->cache_changed
|= CE_ENTRY_ADDED
;
1335 * "refresh" does not calculate a new sha1 file or bring the
1336 * cache up-to-date for mode/content changes. But what it
1337 * _does_ do is to "re-match" the stat information of a file
1338 * with the cache, so that you can refresh the cache for a
1339 * file that hasn't been changed but where the stat entry is
1342 * For example, you'd want to do this after doing a "git-read-tree",
1343 * to link up the stat cache details with the proper files.
1345 static struct cache_entry
*refresh_cache_ent(struct index_state
*istate
,
1346 struct cache_entry
*ce
,
1347 unsigned int options
, int *err
,
1351 struct cache_entry
*updated
;
1353 int refresh
= options
& CE_MATCH_REFRESH
;
1354 int ignore_valid
= options
& CE_MATCH_IGNORE_VALID
;
1355 int ignore_skip_worktree
= options
& CE_MATCH_IGNORE_SKIP_WORKTREE
;
1356 int ignore_missing
= options
& CE_MATCH_IGNORE_MISSING
;
1357 int ignore_fsmonitor
= options
& CE_MATCH_IGNORE_FSMONITOR
;
1359 if (!refresh
|| ce_uptodate(ce
))
1362 if (!ignore_fsmonitor
)
1363 refresh_fsmonitor(istate
);
1365 * CE_VALID or CE_SKIP_WORKTREE means the user promised us
1366 * that the change to the work tree does not matter and told
1369 if (!ignore_skip_worktree
&& ce_skip_worktree(ce
)) {
1370 ce_mark_uptodate(ce
);
1373 if (!ignore_valid
&& (ce
->ce_flags
& CE_VALID
)) {
1374 ce_mark_uptodate(ce
);
1377 if (!ignore_fsmonitor
&& (ce
->ce_flags
& CE_FSMONITOR_VALID
)) {
1378 ce_mark_uptodate(ce
);
1382 if (has_symlink_leading_path(ce
->name
, ce_namelen(ce
))) {
1390 if (lstat(ce
->name
, &st
) < 0) {
1391 if (ignore_missing
&& errno
== ENOENT
)
1398 changed
= ie_match_stat(istate
, ce
, &st
, options
);
1400 *changed_ret
= changed
;
1403 * The path is unchanged. If we were told to ignore
1404 * valid bit, then we did the actual stat check and
1405 * found that the entry is unmodified. If the entry
1406 * is not marked VALID, this is the place to mark it
1407 * valid again, under "assume unchanged" mode.
1409 if (ignore_valid
&& assume_unchanged
&&
1410 !(ce
->ce_flags
& CE_VALID
))
1411 ; /* mark this one VALID again */
1414 * We do not mark the index itself "modified"
1415 * because CE_UPTODATE flag is in-core only;
1416 * we are not going to write this change out.
1418 if (!S_ISGITLINK(ce
->ce_mode
)) {
1419 ce_mark_uptodate(ce
);
1420 mark_fsmonitor_valid(ce
);
1426 if (ie_modified(istate
, ce
, &st
, options
)) {
1432 updated
= make_empty_cache_entry(istate
, ce_namelen(ce
));
1433 copy_cache_entry(updated
, ce
);
1434 memcpy(updated
->name
, ce
->name
, ce
->ce_namelen
+ 1);
1435 fill_stat_cache_info(updated
, &st
);
1437 * If ignore_valid is not set, we should leave CE_VALID bit
1438 * alone. Otherwise, paths marked with --no-assume-unchanged
1439 * (i.e. things to be edited) will reacquire CE_VALID bit
1440 * automatically, which is not really what we want.
1442 if (!ignore_valid
&& assume_unchanged
&&
1443 !(ce
->ce_flags
& CE_VALID
))
1444 updated
->ce_flags
&= ~CE_VALID
;
1446 /* istate->cache_changed is updated in the caller */
1450 static void show_file(const char * fmt
, const char * name
, int in_porcelain
,
1451 int * first
, const char *header_msg
)
1453 if (in_porcelain
&& *first
&& header_msg
) {
1454 printf("%s\n", header_msg
);
1460 int refresh_index(struct index_state
*istate
, unsigned int flags
,
1461 const struct pathspec
*pathspec
,
1462 char *seen
, const char *header_msg
)
1466 int really
= (flags
& REFRESH_REALLY
) != 0;
1467 int allow_unmerged
= (flags
& REFRESH_UNMERGED
) != 0;
1468 int quiet
= (flags
& REFRESH_QUIET
) != 0;
1469 int not_new
= (flags
& REFRESH_IGNORE_MISSING
) != 0;
1470 int ignore_submodules
= (flags
& REFRESH_IGNORE_SUBMODULES
) != 0;
1472 int in_porcelain
= (flags
& REFRESH_IN_PORCELAIN
);
1473 unsigned int options
= (CE_MATCH_REFRESH
|
1474 (really
? CE_MATCH_IGNORE_VALID
: 0) |
1475 (not_new
? CE_MATCH_IGNORE_MISSING
: 0));
1476 const char *modified_fmt
;
1477 const char *deleted_fmt
;
1478 const char *typechange_fmt
;
1479 const char *added_fmt
;
1480 const char *unmerged_fmt
;
1482 trace_performance_enter();
1483 modified_fmt
= (in_porcelain
? "M\t%s\n" : "%s: needs update\n");
1484 deleted_fmt
= (in_porcelain
? "D\t%s\n" : "%s: needs update\n");
1485 typechange_fmt
= (in_porcelain
? "T\t%s\n" : "%s needs update\n");
1486 added_fmt
= (in_porcelain
? "A\t%s\n" : "%s needs update\n");
1487 unmerged_fmt
= (in_porcelain
? "U\t%s\n" : "%s: needs merge\n");
1488 for (i
= 0; i
< istate
->cache_nr
; i
++) {
1489 struct cache_entry
*ce
, *new_entry
;
1490 int cache_errno
= 0;
1494 ce
= istate
->cache
[i
];
1495 if (ignore_submodules
&& S_ISGITLINK(ce
->ce_mode
))
1498 if (pathspec
&& !ce_path_match(&the_index
, ce
, pathspec
, seen
))
1502 while ((i
< istate
->cache_nr
) &&
1503 ! strcmp(istate
->cache
[i
]->name
, ce
->name
))
1509 show_file(unmerged_fmt
, ce
->name
, in_porcelain
,
1510 &first
, header_msg
);
1518 new_entry
= refresh_cache_ent(istate
, ce
, options
, &cache_errno
, &changed
);
1519 if (new_entry
== ce
)
1524 if (really
&& cache_errno
== EINVAL
) {
1525 /* If we are doing --really-refresh that
1526 * means the index is not valid anymore.
1528 ce
->ce_flags
&= ~CE_VALID
;
1529 ce
->ce_flags
|= CE_UPDATE_IN_BASE
;
1530 mark_fsmonitor_invalid(istate
, ce
);
1531 istate
->cache_changed
|= CE_ENTRY_CHANGED
;
1536 if (cache_errno
== ENOENT
)
1538 else if (ce_intent_to_add(ce
))
1539 fmt
= added_fmt
; /* must be before other checks */
1540 else if (changed
& TYPE_CHANGED
)
1541 fmt
= typechange_fmt
;
1545 ce
->name
, in_porcelain
, &first
, header_msg
);
1550 replace_index_entry(istate
, i
, new_entry
);
1552 trace_performance_leave("refresh index");
1556 struct cache_entry
*refresh_cache_entry(struct index_state
*istate
,
1557 struct cache_entry
*ce
,
1558 unsigned int options
)
1560 return refresh_cache_ent(istate
, ce
, options
, NULL
, NULL
);
1564 /*****************************************************************
1566 *****************************************************************/
1568 #define INDEX_FORMAT_DEFAULT 3
1570 static unsigned int get_index_format_default(void)
1572 char *envversion
= getenv("GIT_INDEX_VERSION");
1575 unsigned int version
= INDEX_FORMAT_DEFAULT
;
1578 if (!git_config_get_int("index.version", &value
))
1580 if (version
< INDEX_FORMAT_LB
|| INDEX_FORMAT_UB
< version
) {
1581 warning(_("index.version set, but the value is invalid.\n"
1582 "Using version %i"), INDEX_FORMAT_DEFAULT
);
1583 return INDEX_FORMAT_DEFAULT
;
1588 version
= strtoul(envversion
, &endp
, 10);
1590 version
< INDEX_FORMAT_LB
|| INDEX_FORMAT_UB
< version
) {
1591 warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n"
1592 "Using version %i"), INDEX_FORMAT_DEFAULT
);
1593 version
= INDEX_FORMAT_DEFAULT
;
1599 * dev/ino/uid/gid/size are also just tracked to the low 32 bits
1600 * Again - this is just a (very strong in practice) heuristic that
1601 * the inode hasn't changed.
1603 * We save the fields in big-endian order to allow using the
1604 * index file over NFS transparently.
1606 struct ondisk_cache_entry
{
1607 struct cache_time ctime
;
1608 struct cache_time mtime
;
1615 unsigned char sha1
[20];
1617 char name
[FLEX_ARRAY
]; /* more */
1621 * This struct is used when CE_EXTENDED bit is 1
1622 * The struct must match ondisk_cache_entry exactly from
1625 struct ondisk_cache_entry_extended
{
1626 struct cache_time ctime
;
1627 struct cache_time mtime
;
1634 unsigned char sha1
[20];
1637 char name
[FLEX_ARRAY
]; /* more */
1640 /* These are only used for v3 or lower */
1641 #define align_padding_size(size, len) ((size + (len) + 8) & ~7) - (size + len)
1642 #define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7)
1643 #define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len)
1644 #define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len)
1645 #define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \
1646 ondisk_cache_entry_extended_size(ce_namelen(ce)) : \
1647 ondisk_cache_entry_size(ce_namelen(ce)))
1649 /* Allow fsck to force verification of the index checksum. */
1650 int verify_index_checksum
;
1652 /* Allow fsck to force verification of the cache entry order. */
1653 int verify_ce_order
;
1655 static int verify_hdr(const struct cache_header
*hdr
, unsigned long size
)
1658 unsigned char hash
[GIT_MAX_RAWSZ
];
1661 if (hdr
->hdr_signature
!= htonl(CACHE_SIGNATURE
))
1662 return error("bad signature");
1663 hdr_version
= ntohl(hdr
->hdr_version
);
1664 if (hdr_version
< INDEX_FORMAT_LB
|| INDEX_FORMAT_UB
< hdr_version
)
1665 return error("bad index version %d", hdr_version
);
1667 if (!verify_index_checksum
)
1670 the_hash_algo
->init_fn(&c
);
1671 the_hash_algo
->update_fn(&c
, hdr
, size
- the_hash_algo
->rawsz
);
1672 the_hash_algo
->final_fn(hash
, &c
);
1673 if (!hasheq(hash
, (unsigned char *)hdr
+ size
- the_hash_algo
->rawsz
))
1674 return error("bad index file sha1 signature");
1678 static int read_index_extension(struct index_state
*istate
,
1679 const char *ext
, const char *data
, unsigned long sz
)
1681 switch (CACHE_EXT(ext
)) {
1682 case CACHE_EXT_TREE
:
1683 istate
->cache_tree
= cache_tree_read(data
, sz
);
1685 case CACHE_EXT_RESOLVE_UNDO
:
1686 istate
->resolve_undo
= resolve_undo_read(data
, sz
);
1688 case CACHE_EXT_LINK
:
1689 if (read_link_extension(istate
, data
, sz
))
1692 case CACHE_EXT_UNTRACKED
:
1693 istate
->untracked
= read_untracked_extension(data
, sz
);
1695 case CACHE_EXT_FSMONITOR
:
1696 read_fsmonitor_extension(istate
, data
, sz
);
1698 case CACHE_EXT_ENDOFINDEXENTRIES
:
1699 /* already handled in do_read_index() */
1702 if (*ext
< 'A' || 'Z' < *ext
)
1703 return error("index uses %.4s extension, which we do not understand",
1705 fprintf(stderr
, "ignoring %.4s extension\n", ext
);
1711 int hold_locked_index(struct lock_file
*lk
, int lock_flags
)
1713 return hold_lock_file_for_update(lk
, get_index_file(), lock_flags
);
1716 int read_index(struct index_state
*istate
)
1718 return read_index_from(istate
, get_index_file(), get_git_dir());
1721 static struct cache_entry
*create_from_disk(struct index_state
*istate
,
1722 struct ondisk_cache_entry
*ondisk
,
1723 unsigned long *ent_size
,
1724 const struct cache_entry
*previous_ce
)
1726 struct cache_entry
*ce
;
1732 * Adjacent cache entries tend to share the leading paths, so it makes
1733 * sense to only store the differences in later entries. In the v4
1734 * on-disk format of the index, each on-disk cache entry stores the
1735 * number of bytes to be stripped from the end of the previous name,
1736 * and the bytes to append to the result, to come up with its name.
1738 int expand_name_field
= istate
->version
== 4;
1740 /* On-disk flags are just 16 bits */
1741 flags
= get_be16(&ondisk
->flags
);
1742 len
= flags
& CE_NAMEMASK
;
1744 if (flags
& CE_EXTENDED
) {
1745 struct ondisk_cache_entry_extended
*ondisk2
;
1747 ondisk2
= (struct ondisk_cache_entry_extended
*)ondisk
;
1748 extended_flags
= get_be16(&ondisk2
->flags2
) << 16;
1749 /* We do not yet understand any bit out of CE_EXTENDED_FLAGS */
1750 if (extended_flags
& ~CE_EXTENDED_FLAGS
)
1751 die("Unknown index entry format %08x", extended_flags
);
1752 flags
|= extended_flags
;
1753 name
= ondisk2
->name
;
1756 name
= ondisk
->name
;
1758 if (expand_name_field
) {
1759 const unsigned char *cp
= (const unsigned char *)name
;
1760 size_t strip_len
, previous_len
;
1762 previous_len
= previous_ce
? previous_ce
->ce_namelen
: 0;
1763 strip_len
= decode_varint(&cp
);
1764 if (previous_len
< strip_len
) {
1766 die(_("malformed name field in the index, near path '%s'"),
1769 die(_("malformed name field in the index in the first path"));
1771 copy_len
= previous_len
- strip_len
;
1772 name
= (const char *)cp
;
1775 if (len
== CE_NAMEMASK
) {
1777 if (expand_name_field
)
1781 ce
= mem_pool__ce_alloc(istate
->ce_mem_pool
, len
);
1783 ce
->ce_stat_data
.sd_ctime
.sec
= get_be32(&ondisk
->ctime
.sec
);
1784 ce
->ce_stat_data
.sd_mtime
.sec
= get_be32(&ondisk
->mtime
.sec
);
1785 ce
->ce_stat_data
.sd_ctime
.nsec
= get_be32(&ondisk
->ctime
.nsec
);
1786 ce
->ce_stat_data
.sd_mtime
.nsec
= get_be32(&ondisk
->mtime
.nsec
);
1787 ce
->ce_stat_data
.sd_dev
= get_be32(&ondisk
->dev
);
1788 ce
->ce_stat_data
.sd_ino
= get_be32(&ondisk
->ino
);
1789 ce
->ce_mode
= get_be32(&ondisk
->mode
);
1790 ce
->ce_stat_data
.sd_uid
= get_be32(&ondisk
->uid
);
1791 ce
->ce_stat_data
.sd_gid
= get_be32(&ondisk
->gid
);
1792 ce
->ce_stat_data
.sd_size
= get_be32(&ondisk
->size
);
1793 ce
->ce_flags
= flags
& ~CE_NAMEMASK
;
1794 ce
->ce_namelen
= len
;
1796 hashcpy(ce
->oid
.hash
, ondisk
->sha1
);
1798 if (expand_name_field
) {
1800 memcpy(ce
->name
, previous_ce
->name
, copy_len
);
1801 memcpy(ce
->name
+ copy_len
, name
, len
+ 1 - copy_len
);
1802 *ent_size
= (name
- ((char *)ondisk
)) + len
+ 1 - copy_len
;
1804 memcpy(ce
->name
, name
, len
+ 1);
1805 *ent_size
= ondisk_ce_size(ce
);
1810 static void check_ce_order(struct index_state
*istate
)
1814 if (!verify_ce_order
)
1817 for (i
= 1; i
< istate
->cache_nr
; i
++) {
1818 struct cache_entry
*ce
= istate
->cache
[i
- 1];
1819 struct cache_entry
*next_ce
= istate
->cache
[i
];
1820 int name_compare
= strcmp(ce
->name
, next_ce
->name
);
1822 if (0 < name_compare
)
1823 die("unordered stage entries in index");
1824 if (!name_compare
) {
1826 die("multiple stage entries for merged file '%s'",
1828 if (ce_stage(ce
) > ce_stage(next_ce
))
1829 die("unordered stage entries for '%s'",
1835 static void tweak_untracked_cache(struct index_state
*istate
)
1837 switch (git_config_get_untracked_cache()) {
1838 case -1: /* keep: do nothing */
1841 remove_untracked_cache(istate
);
1844 add_untracked_cache(istate
);
1846 default: /* unknown value: do nothing */
1851 static void tweak_split_index(struct index_state
*istate
)
1853 switch (git_config_get_split_index()) {
1854 case -1: /* unset: do nothing */
1857 remove_split_index(istate
);
1860 add_split_index(istate
);
1862 default: /* unknown value: do nothing */
1867 static void post_read_index_from(struct index_state
*istate
)
1869 check_ce_order(istate
);
1870 tweak_untracked_cache(istate
);
1871 tweak_split_index(istate
);
1872 tweak_fsmonitor(istate
);
1875 static size_t estimate_cache_size_from_compressed(unsigned int entries
)
1877 return entries
* (sizeof(struct cache_entry
) + CACHE_ENTRY_PATH_LENGTH
);
1880 static size_t estimate_cache_size(size_t ondisk_size
, unsigned int entries
)
1882 long per_entry
= sizeof(struct cache_entry
) - sizeof(struct ondisk_cache_entry
);
1885 * Account for potential alignment differences.
1887 per_entry
+= align_padding_size(sizeof(struct cache_entry
), -sizeof(struct ondisk_cache_entry
));
1888 return ondisk_size
+ entries
* per_entry
;
1891 static size_t read_eoie_extension(const char *mmap
, size_t mmap_size
);
1892 static void write_eoie_extension(struct strbuf
*sb
, git_hash_ctx
*eoie_context
, size_t offset
);
1894 struct load_index_extensions
1899 struct index_state
*istate
;
1902 unsigned long src_offset
;
1905 static void *load_index_extensions(void *_data
)
1907 struct load_index_extensions
*p
= _data
;
1908 unsigned long src_offset
= p
->src_offset
;
1910 while (src_offset
<= p
->mmap_size
- the_hash_algo
->rawsz
- 8) {
1911 /* After an array of active_nr index entries,
1912 * there can be arbitrary number of extended
1913 * sections, each of which is prefixed with
1914 * extension name (4-byte) and section length
1915 * in 4-byte network byte order.
1917 uint32_t extsize
= get_be32(p
->mmap
+ src_offset
+ 4);
1918 if (read_index_extension(p
->istate
,
1919 p
->mmap
+ src_offset
,
1920 p
->mmap
+ src_offset
+ 8,
1922 munmap((void *)p
->mmap
, p
->mmap_size
);
1923 die(_("index file corrupt"));
1926 src_offset
+= extsize
;
1932 /* remember to discard_cache() before reading a different cache! */
1933 int do_read_index(struct index_state
*istate
, const char *path
, int must_exist
)
1937 unsigned long src_offset
;
1938 const struct cache_header
*hdr
;
1941 const struct cache_entry
*previous_ce
= NULL
;
1942 struct load_index_extensions p
;
1943 size_t extension_offset
= 0;
1948 if (istate
->initialized
)
1949 return istate
->cache_nr
;
1951 istate
->timestamp
.sec
= 0;
1952 istate
->timestamp
.nsec
= 0;
1953 fd
= open(path
, O_RDONLY
);
1955 if (!must_exist
&& errno
== ENOENT
)
1957 die_errno("%s: index file open failed", path
);
1961 die_errno("cannot stat the open index");
1963 mmap_size
= xsize_t(st
.st_size
);
1964 if (mmap_size
< sizeof(struct cache_header
) + the_hash_algo
->rawsz
)
1965 die("index file smaller than expected");
1967 mmap
= xmmap(NULL
, mmap_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
1968 if (mmap
== MAP_FAILED
)
1969 die_errno("unable to map index file");
1972 hdr
= (const struct cache_header
*)mmap
;
1973 if (verify_hdr(hdr
, mmap_size
) < 0)
1976 hashcpy(istate
->oid
.hash
, (const unsigned char *)hdr
+ mmap_size
- the_hash_algo
->rawsz
);
1977 istate
->version
= ntohl(hdr
->hdr_version
);
1978 istate
->cache_nr
= ntohl(hdr
->hdr_entries
);
1979 istate
->cache_alloc
= alloc_nr(istate
->cache_nr
);
1980 istate
->cache
= xcalloc(istate
->cache_alloc
, sizeof(*istate
->cache
));
1981 istate
->initialized
= 1;
1985 p
.mmap_size
= mmap_size
;
1988 nr_threads
= git_config_get_index_threads();
1990 nr_threads
= online_cpus();
1992 if (nr_threads
> 1) {
1993 extension_offset
= read_eoie_extension(mmap
, mmap_size
);
1994 if (extension_offset
) {
1997 p
.src_offset
= extension_offset
;
1998 err
= pthread_create(&p
.pthread
, NULL
, load_index_extensions
, &p
);
2000 die(_("unable to create load_index_extensions thread: %s"), strerror(err
));
2007 if (istate
->version
== 4) {
2008 mem_pool_init(&istate
->ce_mem_pool
,
2009 estimate_cache_size_from_compressed(istate
->cache_nr
));
2011 mem_pool_init(&istate
->ce_mem_pool
,
2012 estimate_cache_size(mmap_size
, istate
->cache_nr
));
2015 src_offset
= sizeof(*hdr
);
2016 for (i
= 0; i
< istate
->cache_nr
; i
++) {
2017 struct ondisk_cache_entry
*disk_ce
;
2018 struct cache_entry
*ce
;
2019 unsigned long consumed
;
2021 disk_ce
= (struct ondisk_cache_entry
*)(mmap
+ src_offset
);
2022 ce
= create_from_disk(istate
, disk_ce
, &consumed
, previous_ce
);
2023 set_index_entry(istate
, i
, ce
);
2025 src_offset
+= consumed
;
2028 istate
->timestamp
.sec
= st
.st_mtime
;
2029 istate
->timestamp
.nsec
= ST_MTIME_NSEC(st
);
2031 /* if we created a thread, join it otherwise load the extensions on the primary thread */
2033 if (extension_offset
) {
2034 int ret
= pthread_join(p
.pthread
, NULL
);
2036 die(_("unable to join load_index_extensions thread: %s"), strerror(ret
));
2039 if (!extension_offset
) {
2040 p
.src_offset
= src_offset
;
2041 load_index_extensions(&p
);
2043 munmap((void *)mmap
, mmap_size
);
2044 return istate
->cache_nr
;
2047 munmap((void *)mmap
, mmap_size
);
2048 die("index file corrupt");
2052 * Signal that the shared index is used by updating its mtime.
2054 * This way, shared index can be removed if they have not been used
2057 static void freshen_shared_index(const char *shared_index
, int warn
)
2059 if (!check_and_freshen_file(shared_index
, 1) && warn
)
2060 warning("could not freshen shared index '%s'", shared_index
);
2063 int read_index_from(struct index_state
*istate
, const char *path
,
2066 struct split_index
*split_index
;
2071 /* istate->initialized covers both .git/index and .git/sharedindex.xxx */
2072 if (istate
->initialized
)
2073 return istate
->cache_nr
;
2075 trace_performance_enter();
2076 ret
= do_read_index(istate
, path
, 0);
2077 trace_performance_leave("read cache %s", path
);
2079 split_index
= istate
->split_index
;
2080 if (!split_index
|| is_null_oid(&split_index
->base_oid
)) {
2081 post_read_index_from(istate
);
2085 trace_performance_enter();
2086 if (split_index
->base
)
2087 discard_index(split_index
->base
);
2089 split_index
->base
= xcalloc(1, sizeof(*split_index
->base
));
2091 base_oid_hex
= oid_to_hex(&split_index
->base_oid
);
2092 base_path
= xstrfmt("%s/sharedindex.%s", gitdir
, base_oid_hex
);
2093 ret
= do_read_index(split_index
->base
, base_path
, 1);
2094 if (!oideq(&split_index
->base_oid
, &split_index
->base
->oid
))
2095 die("broken index, expect %s in %s, got %s",
2096 base_oid_hex
, base_path
,
2097 oid_to_hex(&split_index
->base
->oid
));
2099 freshen_shared_index(base_path
, 0);
2100 merge_base_index(istate
);
2101 post_read_index_from(istate
);
2103 trace_performance_leave("read cache %s", base_path
);
2107 int is_index_unborn(struct index_state
*istate
)
2109 return (!istate
->cache_nr
&& !istate
->timestamp
.sec
);
2112 int discard_index(struct index_state
*istate
)
2115 * Cache entries in istate->cache[] should have been allocated
2116 * from the memory pool associated with this index, or from an
2117 * associated split_index. There is no need to free individual
2118 * cache entries. validate_cache_entries can detect when this
2119 * assertion does not hold.
2121 validate_cache_entries(istate
);
2123 resolve_undo_clear_index(istate
);
2124 istate
->cache_nr
= 0;
2125 istate
->cache_changed
= 0;
2126 istate
->timestamp
.sec
= 0;
2127 istate
->timestamp
.nsec
= 0;
2128 free_name_hash(istate
);
2129 cache_tree_free(&(istate
->cache_tree
));
2130 istate
->initialized
= 0;
2131 FREE_AND_NULL(istate
->cache
);
2132 istate
->cache_alloc
= 0;
2133 discard_split_index(istate
);
2134 free_untracked_cache(istate
->untracked
);
2135 istate
->untracked
= NULL
;
2137 if (istate
->ce_mem_pool
) {
2138 mem_pool_discard(istate
->ce_mem_pool
, should_validate_cache_entries());
2139 istate
->ce_mem_pool
= NULL
;
2146 * Validate the cache entries of this index.
2147 * All cache entries associated with this index
2148 * should have been allocated by the memory pool
2149 * associated with this index, or by a referenced
2152 void validate_cache_entries(const struct index_state
*istate
)
2156 if (!should_validate_cache_entries() ||!istate
|| !istate
->initialized
)
2159 for (i
= 0; i
< istate
->cache_nr
; i
++) {
2161 die("internal error: cache entry is not allocated from expected memory pool");
2162 } else if (!istate
->ce_mem_pool
||
2163 !mem_pool_contains(istate
->ce_mem_pool
, istate
->cache
[i
])) {
2164 if (!istate
->split_index
||
2165 !istate
->split_index
->base
||
2166 !istate
->split_index
->base
->ce_mem_pool
||
2167 !mem_pool_contains(istate
->split_index
->base
->ce_mem_pool
, istate
->cache
[i
])) {
2168 die("internal error: cache entry is not allocated from expected memory pool");
2173 if (istate
->split_index
)
2174 validate_cache_entries(istate
->split_index
->base
);
2177 int unmerged_index(const struct index_state
*istate
)
2180 for (i
= 0; i
< istate
->cache_nr
; i
++) {
2181 if (ce_stage(istate
->cache
[i
]))
2187 int index_has_changes(const struct index_state
*istate
,
2191 struct object_id cmp
;
2194 if (istate
!= &the_index
) {
2195 BUG("index_has_changes cannot yet accept istate != &the_index; do_diff_cache needs updating first.");
2198 cmp
= tree
->object
.oid
;
2199 if (tree
|| !get_oid_tree("HEAD", &cmp
)) {
2200 struct diff_options opt
;
2203 opt
.flags
.exit_with_status
= 1;
2205 opt
.flags
.quick
= 1;
2206 do_diff_cache(&cmp
, &opt
);
2208 for (i
= 0; sb
&& i
< diff_queued_diff
.nr
; i
++) {
2210 strbuf_addch(sb
, ' ');
2211 strbuf_addstr(sb
, diff_queued_diff
.queue
[i
]->two
->path
);
2214 return opt
.flags
.has_changes
!= 0;
2216 for (i
= 0; sb
&& i
< istate
->cache_nr
; i
++) {
2218 strbuf_addch(sb
, ' ');
2219 strbuf_addstr(sb
, istate
->cache
[i
]->name
);
2221 return !!istate
->cache_nr
;
2225 #define WRITE_BUFFER_SIZE 8192
2226 static unsigned char write_buffer
[WRITE_BUFFER_SIZE
];
2227 static unsigned long write_buffer_len
;
2229 static int ce_write_flush(git_hash_ctx
*context
, int fd
)
2231 unsigned int buffered
= write_buffer_len
;
2233 the_hash_algo
->update_fn(context
, write_buffer
, buffered
);
2234 if (write_in_full(fd
, write_buffer
, buffered
) < 0)
2236 write_buffer_len
= 0;
2241 static int ce_write(git_hash_ctx
*context
, int fd
, void *data
, unsigned int len
)
2244 unsigned int buffered
= write_buffer_len
;
2245 unsigned int partial
= WRITE_BUFFER_SIZE
- buffered
;
2248 memcpy(write_buffer
+ buffered
, data
, partial
);
2249 buffered
+= partial
;
2250 if (buffered
== WRITE_BUFFER_SIZE
) {
2251 write_buffer_len
= buffered
;
2252 if (ce_write_flush(context
, fd
))
2256 write_buffer_len
= buffered
;
2258 data
= (char *) data
+ partial
;
2263 static int write_index_ext_header(git_hash_ctx
*context
, git_hash_ctx
*eoie_context
,
2264 int fd
, unsigned int ext
, unsigned int sz
)
2269 the_hash_algo
->update_fn(eoie_context
, &ext
, 4);
2270 the_hash_algo
->update_fn(eoie_context
, &sz
, 4);
2272 return ((ce_write(context
, fd
, &ext
, 4) < 0) ||
2273 (ce_write(context
, fd
, &sz
, 4) < 0)) ? -1 : 0;
2276 static int ce_flush(git_hash_ctx
*context
, int fd
, unsigned char *hash
)
2278 unsigned int left
= write_buffer_len
;
2281 write_buffer_len
= 0;
2282 the_hash_algo
->update_fn(context
, write_buffer
, left
);
2285 /* Flush first if not enough space for hash signature */
2286 if (left
+ the_hash_algo
->rawsz
> WRITE_BUFFER_SIZE
) {
2287 if (write_in_full(fd
, write_buffer
, left
) < 0)
2292 /* Append the hash signature at the end */
2293 the_hash_algo
->final_fn(write_buffer
+ left
, context
);
2294 hashcpy(hash
, write_buffer
+ left
);
2295 left
+= the_hash_algo
->rawsz
;
2296 return (write_in_full(fd
, write_buffer
, left
) < 0) ? -1 : 0;
2299 static void ce_smudge_racily_clean_entry(struct cache_entry
*ce
)
2302 * The only thing we care about in this function is to smudge the
2303 * falsely clean entry due to touch-update-touch race, so we leave
2304 * everything else as they are. We are called for entries whose
2305 * ce_stat_data.sd_mtime match the index file mtime.
2307 * Note that this actually does not do much for gitlinks, for
2308 * which ce_match_stat_basic() always goes to the actual
2309 * contents. The caller checks with is_racy_timestamp() which
2310 * always says "no" for gitlinks, so we are not called for them ;-)
2314 if (lstat(ce
->name
, &st
) < 0)
2316 if (ce_match_stat_basic(ce
, &st
))
2318 if (ce_modified_check_fs(ce
, &st
)) {
2319 /* This is "racily clean"; smudge it. Note that this
2320 * is a tricky code. At first glance, it may appear
2321 * that it can break with this sequence:
2323 * $ echo xyzzy >frotz
2324 * $ git-update-index --add frotz
2327 * $ echo filfre >nitfol
2328 * $ git-update-index --add nitfol
2330 * but it does not. When the second update-index runs,
2331 * it notices that the entry "frotz" has the same timestamp
2332 * as index, and if we were to smudge it by resetting its
2333 * size to zero here, then the object name recorded
2334 * in index is the 6-byte file but the cached stat information
2335 * becomes zero --- which would then match what we would
2336 * obtain from the filesystem next time we stat("frotz").
2338 * However, the second update-index, before calling
2339 * this function, notices that the cached size is 6
2340 * bytes and what is on the filesystem is an empty
2341 * file, and never calls us, so the cached size information
2342 * for "frotz" stays 6 which does not match the filesystem.
2344 ce
->ce_stat_data
.sd_size
= 0;
2348 /* Copy miscellaneous fields but not the name */
2349 static void copy_cache_entry_to_ondisk(struct ondisk_cache_entry
*ondisk
,
2350 struct cache_entry
*ce
)
2354 ondisk
->ctime
.sec
= htonl(ce
->ce_stat_data
.sd_ctime
.sec
);
2355 ondisk
->mtime
.sec
= htonl(ce
->ce_stat_data
.sd_mtime
.sec
);
2356 ondisk
->ctime
.nsec
= htonl(ce
->ce_stat_data
.sd_ctime
.nsec
);
2357 ondisk
->mtime
.nsec
= htonl(ce
->ce_stat_data
.sd_mtime
.nsec
);
2358 ondisk
->dev
= htonl(ce
->ce_stat_data
.sd_dev
);
2359 ondisk
->ino
= htonl(ce
->ce_stat_data
.sd_ino
);
2360 ondisk
->mode
= htonl(ce
->ce_mode
);
2361 ondisk
->uid
= htonl(ce
->ce_stat_data
.sd_uid
);
2362 ondisk
->gid
= htonl(ce
->ce_stat_data
.sd_gid
);
2363 ondisk
->size
= htonl(ce
->ce_stat_data
.sd_size
);
2364 hashcpy(ondisk
->sha1
, ce
->oid
.hash
);
2366 flags
= ce
->ce_flags
& ~CE_NAMEMASK
;
2367 flags
|= (ce_namelen(ce
) >= CE_NAMEMASK
? CE_NAMEMASK
: ce_namelen(ce
));
2368 ondisk
->flags
= htons(flags
);
2369 if (ce
->ce_flags
& CE_EXTENDED
) {
2370 struct ondisk_cache_entry_extended
*ondisk2
;
2371 ondisk2
= (struct ondisk_cache_entry_extended
*)ondisk
;
2372 ondisk2
->flags2
= htons((ce
->ce_flags
& CE_EXTENDED_FLAGS
) >> 16);
2376 static int ce_write_entry(git_hash_ctx
*c
, int fd
, struct cache_entry
*ce
,
2377 struct strbuf
*previous_name
, struct ondisk_cache_entry
*ondisk
)
2381 unsigned int saved_namelen
;
2382 int stripped_name
= 0;
2383 static unsigned char padding
[8] = { 0x00 };
2385 if (ce
->ce_flags
& CE_STRIP_NAME
) {
2386 saved_namelen
= ce_namelen(ce
);
2391 if (ce
->ce_flags
& CE_EXTENDED
)
2392 size
= offsetof(struct ondisk_cache_entry_extended
, name
);
2394 size
= offsetof(struct ondisk_cache_entry
, name
);
2396 if (!previous_name
) {
2397 int len
= ce_namelen(ce
);
2398 copy_cache_entry_to_ondisk(ondisk
, ce
);
2399 result
= ce_write(c
, fd
, ondisk
, size
);
2401 result
= ce_write(c
, fd
, ce
->name
, len
);
2403 result
= ce_write(c
, fd
, padding
, align_padding_size(size
, len
));
2405 int common
, to_remove
, prefix_size
;
2406 unsigned char to_remove_vi
[16];
2408 (ce
->name
[common
] &&
2409 common
< previous_name
->len
&&
2410 ce
->name
[common
] == previous_name
->buf
[common
]);
2412 ; /* still matching */
2413 to_remove
= previous_name
->len
- common
;
2414 prefix_size
= encode_varint(to_remove
, to_remove_vi
);
2416 copy_cache_entry_to_ondisk(ondisk
, ce
);
2417 result
= ce_write(c
, fd
, ondisk
, size
);
2419 result
= ce_write(c
, fd
, to_remove_vi
, prefix_size
);
2421 result
= ce_write(c
, fd
, ce
->name
+ common
, ce_namelen(ce
) - common
);
2423 result
= ce_write(c
, fd
, padding
, 1);
2425 strbuf_splice(previous_name
, common
, to_remove
,
2426 ce
->name
+ common
, ce_namelen(ce
) - common
);
2428 if (stripped_name
) {
2429 ce
->ce_namelen
= saved_namelen
;
2430 ce
->ce_flags
&= ~CE_STRIP_NAME
;
2437 * This function verifies if index_state has the correct sha1 of the
2438 * index file. Don't die if we have any other failure, just return 0.
2440 static int verify_index_from(const struct index_state
*istate
, const char *path
)
2445 unsigned char hash
[GIT_MAX_RAWSZ
];
2447 if (!istate
->initialized
)
2450 fd
= open(path
, O_RDONLY
);
2457 if (st
.st_size
< sizeof(struct cache_header
) + the_hash_algo
->rawsz
)
2460 n
= pread_in_full(fd
, hash
, the_hash_algo
->rawsz
, st
.st_size
- the_hash_algo
->rawsz
);
2461 if (n
!= the_hash_algo
->rawsz
)
2464 if (!hasheq(istate
->oid
.hash
, hash
))
2475 static int verify_index(const struct index_state
*istate
)
2477 return verify_index_from(istate
, get_index_file());
2480 static int has_racy_timestamp(struct index_state
*istate
)
2482 int entries
= istate
->cache_nr
;
2485 for (i
= 0; i
< entries
; i
++) {
2486 struct cache_entry
*ce
= istate
->cache
[i
];
2487 if (is_racy_timestamp(istate
, ce
))
2493 void update_index_if_able(struct index_state
*istate
, struct lock_file
*lockfile
)
2495 if ((istate
->cache_changed
|| has_racy_timestamp(istate
)) &&
2496 verify_index(istate
))
2497 write_locked_index(istate
, lockfile
, COMMIT_LOCK
);
2499 rollback_lock_file(lockfile
);
2503 * On success, `tempfile` is closed. If it is the temporary file
2504 * of a `struct lock_file`, we will therefore effectively perform
2505 * a 'close_lock_file_gently()`. Since that is an implementation
2506 * detail of lockfiles, callers of `do_write_index()` should not
2509 static int do_write_index(struct index_state
*istate
, struct tempfile
*tempfile
,
2510 int strip_extensions
)
2512 uint64_t start
= getnanotime();
2513 int newfd
= tempfile
->fd
;
2514 git_hash_ctx c
, eoie_c
;
2515 struct cache_header hdr
;
2516 int i
, err
= 0, removed
, extended
, hdr_version
;
2517 struct cache_entry
**cache
= istate
->cache
;
2518 int entries
= istate
->cache_nr
;
2520 struct ondisk_cache_entry_extended ondisk
;
2521 struct strbuf previous_name_buf
= STRBUF_INIT
, *previous_name
;
2522 int drop_cache_tree
= istate
->drop_cache_tree
;
2525 for (i
= removed
= extended
= 0; i
< entries
; i
++) {
2526 if (cache
[i
]->ce_flags
& CE_REMOVE
)
2529 /* reduce extended entries if possible */
2530 cache
[i
]->ce_flags
&= ~CE_EXTENDED
;
2531 if (cache
[i
]->ce_flags
& CE_EXTENDED_FLAGS
) {
2533 cache
[i
]->ce_flags
|= CE_EXTENDED
;
2537 if (!istate
->version
) {
2538 istate
->version
= get_index_format_default();
2539 if (git_env_bool("GIT_TEST_SPLIT_INDEX", 0))
2540 init_split_index(istate
);
2543 /* demote version 3 to version 2 when the latter suffices */
2544 if (istate
->version
== 3 || istate
->version
== 2)
2545 istate
->version
= extended
? 3 : 2;
2547 hdr_version
= istate
->version
;
2549 hdr
.hdr_signature
= htonl(CACHE_SIGNATURE
);
2550 hdr
.hdr_version
= htonl(hdr_version
);
2551 hdr
.hdr_entries
= htonl(entries
- removed
);
2553 the_hash_algo
->init_fn(&c
);
2554 if (ce_write(&c
, newfd
, &hdr
, sizeof(hdr
)) < 0)
2557 offset
= lseek(newfd
, 0, SEEK_CUR
);
2560 offset
+= write_buffer_len
;
2561 previous_name
= (hdr_version
== 4) ? &previous_name_buf
: NULL
;
2563 for (i
= 0; i
< entries
; i
++) {
2564 struct cache_entry
*ce
= cache
[i
];
2565 if (ce
->ce_flags
& CE_REMOVE
)
2567 if (!ce_uptodate(ce
) && is_racy_timestamp(istate
, ce
))
2568 ce_smudge_racily_clean_entry(ce
);
2569 if (is_null_oid(&ce
->oid
)) {
2570 static const char msg
[] = "cache entry has null sha1: %s";
2571 static int allow
= -1;
2574 allow
= git_env_bool("GIT_ALLOW_NULL_SHA1", 0);
2576 warning(msg
, ce
->name
);
2578 err
= error(msg
, ce
->name
);
2580 drop_cache_tree
= 1;
2582 if (ce_write_entry(&c
, newfd
, ce
, previous_name
, (struct ondisk_cache_entry
*)&ondisk
) < 0)
2588 strbuf_release(&previous_name_buf
);
2593 /* Write extension data here */
2594 offset
= lseek(newfd
, 0, SEEK_CUR
);
2597 offset
+= write_buffer_len
;
2598 the_hash_algo
->init_fn(&eoie_c
);
2600 if (!strip_extensions
&& istate
->split_index
) {
2601 struct strbuf sb
= STRBUF_INIT
;
2603 err
= write_link_extension(&sb
, istate
) < 0 ||
2604 write_index_ext_header(&c
, &eoie_c
, newfd
, CACHE_EXT_LINK
,
2606 ce_write(&c
, newfd
, sb
.buf
, sb
.len
) < 0;
2607 strbuf_release(&sb
);
2611 if (!strip_extensions
&& !drop_cache_tree
&& istate
->cache_tree
) {
2612 struct strbuf sb
= STRBUF_INIT
;
2614 cache_tree_write(&sb
, istate
->cache_tree
);
2615 err
= write_index_ext_header(&c
, &eoie_c
, newfd
, CACHE_EXT_TREE
, sb
.len
) < 0
2616 || ce_write(&c
, newfd
, sb
.buf
, sb
.len
) < 0;
2617 strbuf_release(&sb
);
2621 if (!strip_extensions
&& istate
->resolve_undo
) {
2622 struct strbuf sb
= STRBUF_INIT
;
2624 resolve_undo_write(&sb
, istate
->resolve_undo
);
2625 err
= write_index_ext_header(&c
, &eoie_c
, newfd
, CACHE_EXT_RESOLVE_UNDO
,
2627 || ce_write(&c
, newfd
, sb
.buf
, sb
.len
) < 0;
2628 strbuf_release(&sb
);
2632 if (!strip_extensions
&& istate
->untracked
) {
2633 struct strbuf sb
= STRBUF_INIT
;
2635 write_untracked_extension(&sb
, istate
->untracked
);
2636 err
= write_index_ext_header(&c
, &eoie_c
, newfd
, CACHE_EXT_UNTRACKED
,
2638 ce_write(&c
, newfd
, sb
.buf
, sb
.len
) < 0;
2639 strbuf_release(&sb
);
2643 if (!strip_extensions
&& istate
->fsmonitor_last_update
) {
2644 struct strbuf sb
= STRBUF_INIT
;
2646 write_fsmonitor_extension(&sb
, istate
);
2647 err
= write_index_ext_header(&c
, &eoie_c
, newfd
, CACHE_EXT_FSMONITOR
, sb
.len
) < 0
2648 || ce_write(&c
, newfd
, sb
.buf
, sb
.len
) < 0;
2649 strbuf_release(&sb
);
2655 * CACHE_EXT_ENDOFINDEXENTRIES must be written as the last entry before the SHA1
2656 * so that it can be found and processed before all the index entries are
2657 * read. Write it out regardless of the strip_extensions parameter as we need it
2658 * when loading the shared index.
2661 struct strbuf sb
= STRBUF_INIT
;
2663 write_eoie_extension(&sb
, &eoie_c
, offset
);
2664 err
= write_index_ext_header(&c
, NULL
, newfd
, CACHE_EXT_ENDOFINDEXENTRIES
, sb
.len
) < 0
2665 || ce_write(&c
, newfd
, sb
.buf
, sb
.len
) < 0;
2666 strbuf_release(&sb
);
2671 if (ce_flush(&c
, newfd
, istate
->oid
.hash
))
2673 if (close_tempfile_gently(tempfile
)) {
2674 error(_("could not close '%s'"), tempfile
->filename
.buf
);
2677 if (stat(tempfile
->filename
.buf
, &st
))
2679 istate
->timestamp
.sec
= (unsigned int)st
.st_mtime
;
2680 istate
->timestamp
.nsec
= ST_MTIME_NSEC(st
);
2681 trace_performance_since(start
, "write index, changed mask = %x", istate
->cache_changed
);
2685 void set_alternate_index_output(const char *name
)
2687 alternate_index_output
= name
;
2690 static int commit_locked_index(struct lock_file
*lk
)
2692 if (alternate_index_output
)
2693 return commit_lock_file_to(lk
, alternate_index_output
);
2695 return commit_lock_file(lk
);
2698 static int do_write_locked_index(struct index_state
*istate
, struct lock_file
*lock
,
2701 int ret
= do_write_index(istate
, lock
->tempfile
, 0);
2704 if (flags
& COMMIT_LOCK
)
2705 return commit_locked_index(lock
);
2706 return close_lock_file_gently(lock
);
2709 static int write_split_index(struct index_state
*istate
,
2710 struct lock_file
*lock
,
2714 prepare_to_write_split_index(istate
);
2715 ret
= do_write_locked_index(istate
, lock
, flags
);
2716 finish_writing_split_index(istate
);
2720 static const char *shared_index_expire
= "2.weeks.ago";
2722 static unsigned long get_shared_index_expire_date(void)
2724 static unsigned long shared_index_expire_date
;
2725 static int shared_index_expire_date_prepared
;
2727 if (!shared_index_expire_date_prepared
) {
2728 git_config_get_expiry("splitindex.sharedindexexpire",
2729 &shared_index_expire
);
2730 shared_index_expire_date
= approxidate(shared_index_expire
);
2731 shared_index_expire_date_prepared
= 1;
2734 return shared_index_expire_date
;
2737 static int should_delete_shared_index(const char *shared_index_path
)
2740 unsigned long expiration
;
2742 /* Check timestamp */
2743 expiration
= get_shared_index_expire_date();
2746 if (stat(shared_index_path
, &st
))
2747 return error_errno(_("could not stat '%s'"), shared_index_path
);
2748 if (st
.st_mtime
> expiration
)
2754 static int clean_shared_index_files(const char *current_hex
)
2757 DIR *dir
= opendir(get_git_dir());
2760 return error_errno(_("unable to open git dir: %s"), get_git_dir());
2762 while ((de
= readdir(dir
)) != NULL
) {
2763 const char *sha1_hex
;
2764 const char *shared_index_path
;
2765 if (!skip_prefix(de
->d_name
, "sharedindex.", &sha1_hex
))
2767 if (!strcmp(sha1_hex
, current_hex
))
2769 shared_index_path
= git_path("%s", de
->d_name
);
2770 if (should_delete_shared_index(shared_index_path
) > 0 &&
2771 unlink(shared_index_path
))
2772 warning_errno(_("unable to unlink: %s"), shared_index_path
);
2779 static int write_shared_index(struct index_state
*istate
,
2780 struct tempfile
**temp
)
2782 struct split_index
*si
= istate
->split_index
;
2785 move_cache_to_base_index(istate
);
2786 ret
= do_write_index(si
->base
, *temp
, 1);
2789 ret
= adjust_shared_perm(get_tempfile_path(*temp
));
2791 error("cannot fix permission bits on %s", get_tempfile_path(*temp
));
2794 ret
= rename_tempfile(temp
,
2795 git_path("sharedindex.%s", oid_to_hex(&si
->base
->oid
)));
2797 oidcpy(&si
->base_oid
, &si
->base
->oid
);
2798 clean_shared_index_files(oid_to_hex(&si
->base
->oid
));
2804 static const int default_max_percent_split_change
= 20;
2806 static int too_many_not_shared_entries(struct index_state
*istate
)
2808 int i
, not_shared
= 0;
2809 int max_split
= git_config_get_max_percent_split_change();
2811 switch (max_split
) {
2813 /* not or badly configured: use the default value */
2814 max_split
= default_max_percent_split_change
;
2817 return 1; /* 0% means always write a new shared index */
2819 return 0; /* 100% means never write a new shared index */
2821 break; /* just use the configured value */
2824 /* Count not shared entries */
2825 for (i
= 0; i
< istate
->cache_nr
; i
++) {
2826 struct cache_entry
*ce
= istate
->cache
[i
];
2831 return (int64_t)istate
->cache_nr
* max_split
< (int64_t)not_shared
* 100;
2834 int write_locked_index(struct index_state
*istate
, struct lock_file
*lock
,
2837 int new_shared_index
, ret
;
2838 struct split_index
*si
= istate
->split_index
;
2840 if (git_env_bool("GIT_TEST_CHECK_CACHE_TREE", 0))
2841 cache_tree_verify(istate
);
2843 if ((flags
& SKIP_IF_UNCHANGED
) && !istate
->cache_changed
) {
2844 if (flags
& COMMIT_LOCK
)
2845 rollback_lock_file(lock
);
2849 if (istate
->fsmonitor_last_update
)
2850 fill_fsmonitor_bitmap(istate
);
2852 if (!si
|| alternate_index_output
||
2853 (istate
->cache_changed
& ~EXTMASK
)) {
2855 oidclr(&si
->base_oid
);
2856 ret
= do_write_locked_index(istate
, lock
, flags
);
2860 if (git_env_bool("GIT_TEST_SPLIT_INDEX", 0)) {
2861 int v
= si
->base_oid
.hash
[0];
2863 istate
->cache_changed
|= SPLIT_INDEX_ORDERED
;
2865 if (too_many_not_shared_entries(istate
))
2866 istate
->cache_changed
|= SPLIT_INDEX_ORDERED
;
2868 new_shared_index
= istate
->cache_changed
& SPLIT_INDEX_ORDERED
;
2870 if (new_shared_index
) {
2871 struct tempfile
*temp
;
2874 temp
= mks_tempfile(git_path("sharedindex_XXXXXX"));
2876 oidclr(&si
->base_oid
);
2877 ret
= do_write_locked_index(istate
, lock
, flags
);
2880 ret
= write_shared_index(istate
, &temp
);
2882 saved_errno
= errno
;
2883 if (is_tempfile_active(temp
))
2884 delete_tempfile(&temp
);
2885 errno
= saved_errno
;
2891 ret
= write_split_index(istate
, lock
, flags
);
2893 /* Freshen the shared index only if the split-index was written */
2894 if (!ret
&& !new_shared_index
) {
2895 const char *shared_index
= git_path("sharedindex.%s",
2896 oid_to_hex(&si
->base_oid
));
2897 freshen_shared_index(shared_index
, 1);
2901 if (flags
& COMMIT_LOCK
)
2902 rollback_lock_file(lock
);
2907 * Read the index file that is potentially unmerged into given
2908 * index_state, dropping any unmerged entries to stage #0 (potentially
2909 * resulting in a path appearing as both a file and a directory in the
2910 * index; the caller is responsible to clear out the extra entries
2911 * before writing the index to a tree). Returns true if the index is
2912 * unmerged. Callers who want to refuse to work from an unmerged
2913 * state can call this and check its return value, instead of calling
2916 int read_index_unmerged(struct index_state
*istate
)
2922 for (i
= 0; i
< istate
->cache_nr
; i
++) {
2923 struct cache_entry
*ce
= istate
->cache
[i
];
2924 struct cache_entry
*new_ce
;
2930 len
= ce_namelen(ce
);
2931 new_ce
= make_empty_cache_entry(istate
, len
);
2932 memcpy(new_ce
->name
, ce
->name
, len
);
2933 new_ce
->ce_flags
= create_ce_flags(0) | CE_CONFLICTED
;
2934 new_ce
->ce_namelen
= len
;
2935 new_ce
->ce_mode
= ce
->ce_mode
;
2936 if (add_index_entry(istate
, new_ce
, ADD_CACHE_SKIP_DFCHECK
))
2937 return error("%s: cannot drop to stage #0",
2944 * Returns 1 if the path is an "other" path with respect to
2945 * the index; that is, the path is not mentioned in the index at all,
2946 * either as a file, a directory with some files in the index,
2947 * or as an unmerged entry.
2949 * We helpfully remove a trailing "/" from directories so that
2950 * the output of read_directory can be used as-is.
2952 int index_name_is_other(const struct index_state
*istate
, const char *name
,
2956 if (namelen
&& name
[namelen
- 1] == '/')
2958 pos
= index_name_pos(istate
, name
, namelen
);
2960 return 0; /* exact match */
2962 if (pos
< istate
->cache_nr
) {
2963 struct cache_entry
*ce
= istate
->cache
[pos
];
2964 if (ce_namelen(ce
) == namelen
&&
2965 !memcmp(ce
->name
, name
, namelen
))
2966 return 0; /* Yup, this one exists unmerged */
2971 void *read_blob_data_from_index(const struct index_state
*istate
,
2972 const char *path
, unsigned long *size
)
2976 enum object_type type
;
2980 pos
= index_name_pos(istate
, path
, len
);
2983 * We might be in the middle of a merge, in which
2984 * case we would read stage #2 (ours).
2988 (pos
< 0 && i
< istate
->cache_nr
&&
2989 !strcmp(istate
->cache
[i
]->name
, path
));
2991 if (ce_stage(istate
->cache
[i
]) == 2)
2996 data
= read_object_file(&istate
->cache
[pos
]->oid
, &type
, &sz
);
2997 if (!data
|| type
!= OBJ_BLOB
) {
3006 void stat_validity_clear(struct stat_validity
*sv
)
3008 FREE_AND_NULL(sv
->sd
);
3011 int stat_validity_check(struct stat_validity
*sv
, const char *path
)
3015 if (stat(path
, &st
) < 0)
3016 return sv
->sd
== NULL
;
3019 return S_ISREG(st
.st_mode
) && !match_stat_data(sv
->sd
, &st
);
3022 void stat_validity_update(struct stat_validity
*sv
, int fd
)
3026 if (fstat(fd
, &st
) < 0 || !S_ISREG(st
.st_mode
))
3027 stat_validity_clear(sv
);
3030 sv
->sd
= xcalloc(1, sizeof(struct stat_data
));
3031 fill_stat_data(sv
->sd
, &st
);
3035 void move_index_extensions(struct index_state
*dst
, struct index_state
*src
)
3037 dst
->untracked
= src
->untracked
;
3038 src
->untracked
= NULL
;
3039 dst
->cache_tree
= src
->cache_tree
;
3040 src
->cache_tree
= NULL
;
3043 struct cache_entry
*dup_cache_entry(const struct cache_entry
*ce
,
3044 struct index_state
*istate
)
3046 unsigned int size
= ce_size(ce
);
3047 int mem_pool_allocated
;
3048 struct cache_entry
*new_entry
= make_empty_cache_entry(istate
, ce_namelen(ce
));
3049 mem_pool_allocated
= new_entry
->mem_pool_allocated
;
3051 memcpy(new_entry
, ce
, size
);
3052 new_entry
->mem_pool_allocated
= mem_pool_allocated
;
3056 void discard_cache_entry(struct cache_entry
*ce
)
3058 if (ce
&& should_validate_cache_entries())
3059 memset(ce
, 0xCD, cache_entry_size(ce
->ce_namelen
));
3061 if (ce
&& ce
->mem_pool_allocated
)
3067 int should_validate_cache_entries(void)
3069 static int validate_index_cache_entries
= -1;
3071 if (validate_index_cache_entries
< 0) {
3072 if (getenv("GIT_TEST_VALIDATE_INDEX_CACHE_ENTRIES"))
3073 validate_index_cache_entries
= 1;
3075 validate_index_cache_entries
= 0;
3078 return validate_index_cache_entries
;
3081 #define EOIE_SIZE (4 + GIT_SHA1_RAWSZ) /* <4-byte offset> + <20-byte hash> */
3082 #define EOIE_SIZE_WITH_HEADER (4 + 4 + EOIE_SIZE) /* <4-byte signature> + <4-byte length> + EOIE_SIZE */
3084 static size_t read_eoie_extension(const char *mmap
, size_t mmap_size
)
3087 * The end of index entries (EOIE) extension is guaranteed to be last
3088 * so that it can be found by scanning backwards from the EOF.
3095 const char *index
, *eoie
;
3097 size_t offset
, src_offset
;
3098 unsigned char hash
[GIT_MAX_RAWSZ
];
3101 /* ensure we have an index big enough to contain an EOIE extension */
3102 if (mmap_size
< sizeof(struct cache_header
) + EOIE_SIZE_WITH_HEADER
+ the_hash_algo
->rawsz
)
3105 /* validate the extension signature */
3106 index
= eoie
= mmap
+ mmap_size
- EOIE_SIZE_WITH_HEADER
- the_hash_algo
->rawsz
;
3107 if (CACHE_EXT(index
) != CACHE_EXT_ENDOFINDEXENTRIES
)
3109 index
+= sizeof(uint32_t);
3111 /* validate the extension size */
3112 extsize
= get_be32(index
);
3113 if (extsize
!= EOIE_SIZE
)
3115 index
+= sizeof(uint32_t);
3118 * Validate the offset we're going to look for the first extension
3119 * signature is after the index header and before the eoie extension.
3121 offset
= get_be32(index
);
3122 if (mmap
+ offset
< mmap
+ sizeof(struct cache_header
))
3124 if (mmap
+ offset
>= eoie
)
3126 index
+= sizeof(uint32_t);
3129 * The hash is computed over extension types and their sizes (but not
3130 * their contents). E.g. if we have "TREE" extension that is N-bytes
3131 * long, "REUC" extension that is M-bytes long, followed by "EOIE",
3132 * then the hash would be:
3134 * SHA-1("TREE" + <binary representation of N> +
3135 * "REUC" + <binary representation of M>)
3137 src_offset
= offset
;
3138 the_hash_algo
->init_fn(&c
);
3139 while (src_offset
< mmap_size
- the_hash_algo
->rawsz
- EOIE_SIZE_WITH_HEADER
) {
3140 /* After an array of active_nr index entries,
3141 * there can be arbitrary number of extended
3142 * sections, each of which is prefixed with
3143 * extension name (4-byte) and section length
3144 * in 4-byte network byte order.
3147 memcpy(&extsize
, mmap
+ src_offset
+ 4, 4);
3148 extsize
= ntohl(extsize
);
3150 /* verify the extension size isn't so large it will wrap around */
3151 if (src_offset
+ 8 + extsize
< src_offset
)
3154 the_hash_algo
->update_fn(&c
, mmap
+ src_offset
, 8);
3157 src_offset
+= extsize
;
3159 the_hash_algo
->final_fn(hash
, &c
);
3160 if (!hasheq(hash
, (const unsigned char *)index
))
3163 /* Validate that the extension offsets returned us back to the eoie extension. */
3164 if (src_offset
!= mmap_size
- the_hash_algo
->rawsz
- EOIE_SIZE_WITH_HEADER
)
3170 static void write_eoie_extension(struct strbuf
*sb
, git_hash_ctx
*eoie_context
, size_t offset
)
3173 unsigned char hash
[GIT_MAX_RAWSZ
];
3176 put_be32(&buffer
, offset
);
3177 strbuf_add(sb
, &buffer
, sizeof(uint32_t));
3180 the_hash_algo
->final_fn(hash
, eoie_context
);
3181 strbuf_add(sb
, hash
, the_hash_algo
->rawsz
);