cocci & cache.h: apply variable section of "pending" index-compatibility

Mostly apply the part of "index-compatibility.pending.cocci" that
renames the global variables like "active_nr", which are a shorthand
to referencing (in that case) a struct member as "the_index.cache_nr".

In doing so move more of "index-compatibility.pending.cocci" to
"index-compatibility.cocci".

In the case of "active_nr" we'd have a textual conflict with
"ab/various-leak-fixes" in "next"[1]. Let's exclude that specific case
while moving the rule over from "pending".

1. 407b94280f (commit: discard partial cache before (re-)reading it,
   2022-11-08)

Signed-off-by: Ævar Arnfjörð Bjarmason <avarab@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
Ævar Arnfjörð Bjarmason 2022-11-19 14:07:34 +01:00 committed by Junio C Hamano
parent 031b2033e0
commit dc594180d9
19 changed files with 132 additions and 129 deletions

View file

@ -42,8 +42,8 @@ static int chmod_pathspec(struct pathspec *pathspec, char flip, int show_only)
{ {
int i, ret = 0; int i, ret = 0;
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
struct cache_entry *ce = active_cache[i]; struct cache_entry *ce = the_index.cache[i];
int err; int err;
if (!include_sparse && if (!include_sparse &&
@ -159,8 +159,8 @@ static int renormalize_tracked_files(const struct pathspec *pathspec, int flags)
{ {
int i, retval = 0; int i, retval = 0;
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
struct cache_entry *ce = active_cache[i]; struct cache_entry *ce = the_index.cache[i];
if (!include_sparse && if (!include_sparse &&
(ce_skip_worktree(ce) || (ce_skip_worktree(ce) ||

View file

@ -75,8 +75,8 @@ static int checkout_file(const char *name, const char *prefix)
if (pos < 0) if (pos < 0)
pos = -pos - 1; pos = -pos - 1;
while (pos < active_nr) { while (pos < the_index.cache_nr) {
struct cache_entry *ce = active_cache[pos]; struct cache_entry *ce = the_index.cache[pos];
if (ce_namelen(ce) != namelen || if (ce_namelen(ce) != namelen ||
memcmp(ce->name, name, namelen)) memcmp(ce->name, name, namelen))
break; break;
@ -136,8 +136,8 @@ static int checkout_all(const char *prefix, int prefix_length)
int i, errs = 0; int i, errs = 0;
struct cache_entry *last_ce = NULL; struct cache_entry *last_ce = NULL;
for (i = 0; i < active_nr ; i++) { for (i = 0; i < the_index.cache_nr ; i++) {
struct cache_entry *ce = active_cache[i]; struct cache_entry *ce = the_index.cache[i];
if (S_ISSPARSEDIR(ce->ce_mode)) { if (S_ISSPARSEDIR(ce->ce_mode)) {
if (!ce_skip_worktree(ce)) if (!ce_skip_worktree(ce))
@ -151,7 +151,7 @@ static int checkout_all(const char *prefix, int prefix_length)
*/ */
if (ignore_skip_worktree) { if (ignore_skip_worktree) {
ensure_full_index(&the_index); ensure_full_index(&the_index);
ce = active_cache[i]; ce = the_index.cache[i];
} }
} }

View file

@ -150,7 +150,7 @@ static int update_some(const struct object_id *oid, struct strbuf *base,
*/ */
pos = cache_name_pos(ce->name, ce->ce_namelen); pos = cache_name_pos(ce->name, ce->ce_namelen);
if (pos >= 0) { if (pos >= 0) {
struct cache_entry *old = active_cache[pos]; struct cache_entry *old = the_index.cache[pos];
if (ce->ce_mode == old->ce_mode && if (ce->ce_mode == old->ce_mode &&
!ce_intent_to_add(old) && !ce_intent_to_add(old) &&
oideq(&ce->oid, &old->oid)) { oideq(&ce->oid, &old->oid)) {
@ -179,8 +179,8 @@ static int read_tree_some(struct tree *tree, const struct pathspec *pathspec)
static int skip_same_name(const struct cache_entry *ce, int pos) static int skip_same_name(const struct cache_entry *ce, int pos)
{ {
while (++pos < active_nr && while (++pos < the_index.cache_nr &&
!strcmp(active_cache[pos]->name, ce->name)) !strcmp(the_index.cache[pos]->name, ce->name))
; /* skip */ ; /* skip */
return pos; return pos;
} }
@ -188,9 +188,9 @@ static int skip_same_name(const struct cache_entry *ce, int pos)
static int check_stage(int stage, const struct cache_entry *ce, int pos, static int check_stage(int stage, const struct cache_entry *ce, int pos,
int overlay_mode) int overlay_mode)
{ {
while (pos < active_nr && while (pos < the_index.cache_nr &&
!strcmp(active_cache[pos]->name, ce->name)) { !strcmp(the_index.cache[pos]->name, ce->name)) {
if (ce_stage(active_cache[pos]) == stage) if (ce_stage(the_index.cache[pos]) == stage)
return 0; return 0;
pos++; pos++;
} }
@ -207,8 +207,8 @@ static int check_stages(unsigned stages, const struct cache_entry *ce, int pos)
unsigned seen = 0; unsigned seen = 0;
const char *name = ce->name; const char *name = ce->name;
while (pos < active_nr) { while (pos < the_index.cache_nr) {
ce = active_cache[pos]; ce = the_index.cache[pos];
if (strcmp(name, ce->name)) if (strcmp(name, ce->name))
break; break;
seen |= (1 << ce_stage(ce)); seen |= (1 << ce_stage(ce));
@ -224,10 +224,10 @@ static int checkout_stage(int stage, const struct cache_entry *ce, int pos,
const struct checkout *state, int *nr_checkouts, const struct checkout *state, int *nr_checkouts,
int overlay_mode) int overlay_mode)
{ {
while (pos < active_nr && while (pos < the_index.cache_nr &&
!strcmp(active_cache[pos]->name, ce->name)) { !strcmp(the_index.cache[pos]->name, ce->name)) {
if (ce_stage(active_cache[pos]) == stage) if (ce_stage(the_index.cache[pos]) == stage)
return checkout_entry(active_cache[pos], state, return checkout_entry(the_index.cache[pos], state,
NULL, nr_checkouts); NULL, nr_checkouts);
pos++; pos++;
} }
@ -244,7 +244,7 @@ static int checkout_stage(int stage, const struct cache_entry *ce, int pos,
static int checkout_merged(int pos, const struct checkout *state, static int checkout_merged(int pos, const struct checkout *state,
int *nr_checkouts, struct mem_pool *ce_mem_pool) int *nr_checkouts, struct mem_pool *ce_mem_pool)
{ {
struct cache_entry *ce = active_cache[pos]; struct cache_entry *ce = the_index.cache[pos];
const char *path = ce->name; const char *path = ce->name;
mmfile_t ancestor, ours, theirs; mmfile_t ancestor, ours, theirs;
enum ll_merge_result merge_status; enum ll_merge_result merge_status;
@ -257,7 +257,7 @@ static int checkout_merged(int pos, const struct checkout *state,
int renormalize = 0; int renormalize = 0;
memset(threeway, 0, sizeof(threeway)); memset(threeway, 0, sizeof(threeway));
while (pos < active_nr) { while (pos < the_index.cache_nr) {
int stage; int stage;
stage = ce_stage(ce); stage = ce_stage(ce);
if (!stage || strcmp(path, ce->name)) if (!stage || strcmp(path, ce->name))
@ -266,7 +266,7 @@ static int checkout_merged(int pos, const struct checkout *state,
if (stage == 2) if (stage == 2)
mode = create_ce_mode(ce->ce_mode); mode = create_ce_mode(ce->ce_mode);
pos++; pos++;
ce = active_cache[pos]; ce = the_index.cache[pos];
} }
if (is_null_oid(&threeway[1]) || is_null_oid(&threeway[2])) if (is_null_oid(&threeway[1]) || is_null_oid(&threeway[2]))
return error(_("path '%s' does not have necessary versions"), path); return error(_("path '%s' does not have necessary versions"), path);
@ -392,8 +392,8 @@ static int checkout_worktree(const struct checkout_opts *opts,
if (pc_workers > 1) if (pc_workers > 1)
init_parallel_checkout(); init_parallel_checkout();
for (pos = 0; pos < active_nr; pos++) { for (pos = 0; pos < the_index.cache_nr; pos++) {
struct cache_entry *ce = active_cache[pos]; struct cache_entry *ce = the_index.cache[pos];
if (ce->ce_flags & CE_MATCHED) { if (ce->ce_flags & CE_MATCHED) {
if (!ce_stage(ce)) { if (!ce_stage(ce)) {
errs |= checkout_entry(ce, &state, errs |= checkout_entry(ce, &state,
@ -541,13 +541,13 @@ static int checkout_paths(const struct checkout_opts *opts,
* Make sure all pathspecs participated in locating the paths * Make sure all pathspecs participated in locating the paths
* to be checked out. * to be checked out.
*/ */
for (pos = 0; pos < active_nr; pos++) for (pos = 0; pos < the_index.cache_nr; pos++)
if (opts->overlay_mode) if (opts->overlay_mode)
mark_ce_for_checkout_overlay(active_cache[pos], mark_ce_for_checkout_overlay(the_index.cache[pos],
ps_matched, ps_matched,
opts); opts);
else else
mark_ce_for_checkout_no_overlay(active_cache[pos], mark_ce_for_checkout_no_overlay(the_index.cache[pos],
ps_matched, ps_matched,
opts); opts);
@ -562,8 +562,8 @@ static int checkout_paths(const struct checkout_opts *opts,
unmerge_marked_index(&the_index); unmerge_marked_index(&the_index);
/* Any unmerged paths? */ /* Any unmerged paths? */
for (pos = 0; pos < active_nr; pos++) { for (pos = 0; pos < the_index.cache_nr; pos++) {
const struct cache_entry *ce = active_cache[pos]; const struct cache_entry *ce = the_index.cache[pos];
if (ce->ce_flags & CE_MATCHED) { if (ce->ce_flags & CE_MATCHED) {
if (!ce_stage(ce)) if (!ce_stage(ce))
continue; continue;
@ -868,7 +868,7 @@ static int merge_working_tree(const struct checkout_opts *opts,
} }
} }
if (!cache_tree_fully_valid(active_cache_tree)) if (!cache_tree_fully_valid(the_index.cache_tree))
cache_tree_update(&the_index, WRITE_TREE_SILENT | WRITE_TREE_REPAIR); cache_tree_update(&the_index, WRITE_TREE_SILENT | WRITE_TREE_REPAIR);
if (write_locked_index(&the_index, &lock_file, COMMIT_LOCK)) if (write_locked_index(&the_index, &lock_file, COMMIT_LOCK))

View file

@ -272,8 +272,8 @@ static int list_paths(struct string_list *list, const char *with_tree,
/* TODO: audit for interaction with sparse-index. */ /* TODO: audit for interaction with sparse-index. */
ensure_full_index(&the_index); ensure_full_index(&the_index);
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
const struct cache_entry *ce = active_cache[i]; const struct cache_entry *ce = the_index.cache[i];
struct string_list_item *item; struct string_list_item *item;
if (ce->ce_flags & CE_UPDATE) if (ce->ce_flags & CE_UPDATE)
@ -461,8 +461,8 @@ static const char *prepare_index(const char **argv, const char *prefix,
if (!only && !pathspec.nr) { if (!only && !pathspec.nr) {
hold_locked_index(&index_lock, LOCK_DIE_ON_ERROR); hold_locked_index(&index_lock, LOCK_DIE_ON_ERROR);
refresh_cache_or_die(refresh_flags); refresh_cache_or_die(refresh_flags);
if (active_cache_changed if (the_index.cache_changed
|| !cache_tree_fully_valid(active_cache_tree)) || !cache_tree_fully_valid(the_index.cache_tree))
update_main_cache_tree(WRITE_TREE_SILENT); update_main_cache_tree(WRITE_TREE_SILENT);
if (write_locked_index(&the_index, &index_lock, if (write_locked_index(&the_index, &index_lock,
COMMIT_LOCK | SKIP_IF_UNCHANGED)) COMMIT_LOCK | SKIP_IF_UNCHANGED))
@ -998,10 +998,10 @@ static int prepare_to_commit(const char *index_file, const char *prefix,
/* TODO: audit for interaction with sparse-index. */ /* TODO: audit for interaction with sparse-index. */
ensure_full_index(&the_index); ensure_full_index(&the_index);
for (i = 0; i < active_nr; i++) for (i = 0; i < the_index.cache_nr; i++)
if (ce_intent_to_add(active_cache[i])) if (ce_intent_to_add(the_index.cache[i]))
ita_nr++; ita_nr++;
committable = active_nr - ita_nr > 0; committable = the_index.cache_nr - ita_nr > 0;
} else { } else {
/* /*
* Unless the user did explicitly request a submodule * Unless the user did explicitly request a submodule
@ -1823,7 +1823,7 @@ int cmd_commit(int argc, const char **argv, const char *prefix)
append_merge_tag_headers(parents, &tail); append_merge_tag_headers(parents, &tail);
} }
if (commit_tree_extended(sb.buf, sb.len, &active_cache_tree->oid, if (commit_tree_extended(sb.buf, sb.len, &the_index.cache_tree->oid,
parents, &oid, author_ident.buf, NULL, parents, &oid, author_ident.buf, NULL,
sign_commit, extra)) { sign_commit, extra)) {
rollback_index_files(); rollback_index_files();

View file

@ -961,26 +961,26 @@ int cmd_fsck(int argc, const char **argv, const char *prefix)
read_cache(); read_cache();
/* TODO: audit for interaction with sparse-index. */ /* TODO: audit for interaction with sparse-index. */
ensure_full_index(&the_index); ensure_full_index(&the_index);
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
unsigned int mode; unsigned int mode;
struct blob *blob; struct blob *blob;
struct object *obj; struct object *obj;
mode = active_cache[i]->ce_mode; mode = the_index.cache[i]->ce_mode;
if (S_ISGITLINK(mode)) if (S_ISGITLINK(mode))
continue; continue;
blob = lookup_blob(the_repository, blob = lookup_blob(the_repository,
&active_cache[i]->oid); &the_index.cache[i]->oid);
if (!blob) if (!blob)
continue; continue;
obj = &blob->object; obj = &blob->object;
obj->flags |= USED; obj->flags |= USED;
fsck_put_object_name(&fsck_walk_options, &obj->oid, fsck_put_object_name(&fsck_walk_options, &obj->oid,
":%s", active_cache[i]->name); ":%s", the_index.cache[i]->name);
mark_object_reachable(obj); mark_object_reachable(obj);
} }
if (active_cache_tree) if (the_index.cache_tree)
fsck_cache_tree(active_cache_tree); fsck_cache_tree(the_index.cache_tree);
fsck_resolve_undo(&the_index); fsck_resolve_undo(&the_index);
} }

View file

@ -14,11 +14,11 @@ static int merge_entry(int pos, const char *path)
char ownbuf[4][60]; char ownbuf[4][60];
struct child_process cmd = CHILD_PROCESS_INIT; struct child_process cmd = CHILD_PROCESS_INIT;
if (pos >= active_nr) if (pos >= the_index.cache_nr)
die("git merge-index: %s not in the cache", path); die("git merge-index: %s not in the cache", path);
found = 0; found = 0;
do { do {
const struct cache_entry *ce = active_cache[pos]; const struct cache_entry *ce = the_index.cache[pos];
int stage = ce_stage(ce); int stage = ce_stage(ce);
if (strcmp(ce->name, path)) if (strcmp(ce->name, path))
@ -28,7 +28,7 @@ static int merge_entry(int pos, const char *path)
xsnprintf(ownbuf[stage], sizeof(ownbuf[stage]), "%o", ce->ce_mode); xsnprintf(ownbuf[stage], sizeof(ownbuf[stage]), "%o", ce->ce_mode);
arguments[stage] = hexbuf[stage]; arguments[stage] = hexbuf[stage];
arguments[stage + 4] = ownbuf[stage]; arguments[stage + 4] = ownbuf[stage];
} while (++pos < active_nr); } while (++pos < the_index.cache_nr);
if (!found) if (!found)
die("git merge-index: %s not in the cache", path); die("git merge-index: %s not in the cache", path);
@ -62,8 +62,8 @@ static void merge_all(void)
int i; int i;
/* TODO: audit for interaction with sparse-index. */ /* TODO: audit for interaction with sparse-index. */
ensure_full_index(&the_index); ensure_full_index(&the_index);
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
const struct cache_entry *ce = active_cache[i]; const struct cache_entry *ce = the_index.cache[i];
if (!ce_stage(ce)) if (!ce_stage(ce))
continue; continue;
i += merge_entry(i, ce->name)-1; i += merge_entry(i, ce->name)-1;

View file

@ -694,7 +694,7 @@ static int read_tree_trivial(struct object_id *common, struct object_id *head,
if (!trees[nr_trees++]) if (!trees[nr_trees++])
return -1; return -1;
opts.fn = threeway_merge; opts.fn = threeway_merge;
cache_tree_free(&active_cache_tree); cache_tree_free(&the_index.cache_tree);
for (i = 0; i < nr_trees; i++) { for (i = 0; i < nr_trees; i++) {
parse_tree(trees[i]); parse_tree(trees[i]);
init_tree_desc(t+i, trees[i]->buffer, trees[i]->size); init_tree_desc(t+i, trees[i]->buffer, trees[i]->size);
@ -784,8 +784,8 @@ static int count_unmerged_entries(void)
{ {
int i, ret = 0; int i, ret = 0;
for (i = 0; i < active_nr; i++) for (i = 0; i < the_index.cache_nr; i++)
if (ce_stage(active_cache[i])) if (ce_stage(the_index.cache[i]))
ret++; ret++;
return ret; return ret;

View file

@ -87,7 +87,7 @@ static void prepare_move_submodule(const char *src, int first,
const char **submodule_gitfile) const char **submodule_gitfile)
{ {
struct strbuf submodule_dotgit = STRBUF_INIT; struct strbuf submodule_dotgit = STRBUF_INIT;
if (!S_ISGITLINK(active_cache[first]->ce_mode)) if (!S_ISGITLINK(the_index.cache[first]->ce_mode))
die(_("Directory %s is in index and no submodule?"), src); die(_("Directory %s is in index and no submodule?"), src);
if (!is_staging_gitmodules_ok(&the_index)) if (!is_staging_gitmodules_ok(&the_index))
die(_("Please stage your changes to .gitmodules or stash them to proceed")); die(_("Please stage your changes to .gitmodules or stash them to proceed"));
@ -111,8 +111,8 @@ static int index_range_of_same_dir(const char *src, int length,
die(_("%.*s is in index"), len_w_slash, src_w_slash); die(_("%.*s is in index"), len_w_slash, src_w_slash);
first = -1 - first; first = -1 - first;
for (last = first; last < active_nr; last++) { for (last = first; last < the_index.cache_nr; last++) {
const char *path = active_cache[last]->name; const char *path = the_index.cache[last]->name;
if (strncmp(path, src_w_slash, len_w_slash)) if (strncmp(path, src_w_slash, len_w_slash))
break; break;
} }
@ -143,7 +143,7 @@ static int empty_dir_has_sparse_contents(const char *name)
pos = -pos - 1; pos = -pos - 1;
if (pos >= the_index.cache_nr) if (pos >= the_index.cache_nr)
goto free_return; goto free_return;
ce = active_cache[pos]; ce = the_index.cache[pos];
if (strncmp(with_slash, ce->name, length)) if (strncmp(with_slash, ce->name, length))
goto free_return; goto free_return;
if (ce_skip_worktree(ce)) if (ce_skip_worktree(ce))
@ -268,7 +268,7 @@ int cmd_mv(int argc, const char **argv, const char *prefix)
bad = _("bad source"); bad = _("bad source");
goto act_on_entry; goto act_on_entry;
} }
ce = active_cache[pos]; ce = the_index.cache[pos];
if (!ce_skip_worktree(ce)) { if (!ce_skip_worktree(ce)) {
bad = _("bad source"); bad = _("bad source");
goto act_on_entry; goto act_on_entry;
@ -331,7 +331,7 @@ int cmd_mv(int argc, const char **argv, const char *prefix)
dst_len = strlen(dst); dst_len = strlen(dst);
for (j = 0; j < last - first; j++) { for (j = 0; j < last - first; j++) {
const struct cache_entry *ce = active_cache[first + j]; const struct cache_entry *ce = the_index.cache[first + j];
const char *path = ce->name; const char *path = ce->name;
source[argc + j] = path; source[argc + j] = path;
destination[argc + j] = destination[argc + j] =
@ -472,7 +472,8 @@ int cmd_mv(int argc, const char **argv, const char *prefix)
assert(pos >= 0); assert(pos >= 0);
if (!(mode & SPARSE) && !lstat(src, &st)) if (!(mode & SPARSE) && !lstat(src, &st))
sparse_and_dirty = ie_modified(&the_index, sparse_and_dirty = ie_modified(&the_index,
active_cache[pos], &st, the_index.cache[pos],
&st,
0); 0);
rename_index_entry_at(&the_index, pos, dst); rename_index_entry_at(&the_index, pos, dst);
@ -489,7 +490,7 @@ int cmd_mv(int argc, const char **argv, const char *prefix)
path_in_sparse_checkout(dst, &the_index)) { path_in_sparse_checkout(dst, &the_index)) {
/* from out-of-cone to in-cone */ /* from out-of-cone to in-cone */
int dst_pos = cache_name_pos(dst, strlen(dst)); int dst_pos = cache_name_pos(dst, strlen(dst));
struct cache_entry *dst_ce = active_cache[dst_pos]; struct cache_entry *dst_ce = the_index.cache[dst_pos];
dst_ce->ce_flags &= ~CE_SKIP_WORKTREE; dst_ce->ce_flags &= ~CE_SKIP_WORKTREE;
@ -500,7 +501,7 @@ int cmd_mv(int argc, const char **argv, const char *prefix)
!path_in_sparse_checkout(dst, &the_index)) { !path_in_sparse_checkout(dst, &the_index)) {
/* from in-cone to out-of-cone */ /* from in-cone to out-of-cone */
int dst_pos = cache_name_pos(dst, strlen(dst)); int dst_pos = cache_name_pos(dst, strlen(dst));
struct cache_entry *dst_ce = active_cache[dst_pos]; struct cache_entry *dst_ce = the_index.cache[dst_pos];
/* /*
* if src is clean, it will suffice to remove it * if src is clean, it will suffice to remove it

View file

@ -253,7 +253,7 @@ int cmd_read_tree(int argc, const char **argv, const char *cmd_prefix)
if (nr_trees == 1 && !opts.prefix) if (nr_trees == 1 && !opts.prefix)
opts.skip_cache_tree_update = 1; opts.skip_cache_tree_update = 1;
cache_tree_free(&active_cache_tree); cache_tree_free(&the_index.cache_tree);
for (i = 0; i < nr_trees; i++) { for (i = 0; i < nr_trees; i++) {
struct tree *tree = trees[i]; struct tree *tree = trees[i];
parse_tree(tree); parse_tree(tree);

View file

@ -161,7 +161,7 @@ static void update_index_from_diff(struct diff_queue_struct *q,
* to properly construct the reset sparse directory. * to properly construct the reset sparse directory.
*/ */
pos = cache_name_pos(one->path, strlen(one->path)); pos = cache_name_pos(one->path, strlen(one->path));
if ((pos >= 0 && ce_skip_worktree(active_cache[pos])) || if ((pos >= 0 && ce_skip_worktree(the_index.cache[pos])) ||
(pos < 0 && !path_in_sparse_checkout(one->path, &the_index))) (pos < 0 && !path_in_sparse_checkout(one->path, &the_index)))
ce->ce_flags |= CE_SKIP_WORKTREE; ce->ce_flags |= CE_SKIP_WORKTREE;

View file

@ -35,8 +35,8 @@ static int get_ours_cache_pos(const char *path, int pos)
{ {
int i = -pos - 1; int i = -pos - 1;
while ((i < active_nr) && !strcmp(active_cache[i]->name, path)) { while ((i < the_index.cache_nr) && !strcmp(the_index.cache[i]->name, path)) {
if (ce_stage(active_cache[i]) == 2) if (ce_stage(the_index.cache[i]) == 2)
return i; return i;
i++; i++;
} }
@ -78,7 +78,7 @@ static void submodules_absorb_gitdir_if_needed(void)
if (pos < 0) if (pos < 0)
continue; continue;
} }
ce = active_cache[pos]; ce = the_index.cache[pos];
if (!S_ISGITLINK(ce->ce_mode) || if (!S_ISGITLINK(ce->ce_mode) ||
!file_exists(ce->name) || !file_exists(ce->name) ||
@ -127,11 +127,11 @@ static int check_local_mod(struct object_id *head, int index_only)
if (pos < 0) if (pos < 0)
continue; continue;
if (!S_ISGITLINK(active_cache[pos]->ce_mode) || if (!S_ISGITLINK(the_index.cache[pos]->ce_mode) ||
is_empty_dir(name)) is_empty_dir(name))
continue; continue;
} }
ce = active_cache[pos]; ce = the_index.cache[pos];
if (lstat(ce->name, &st) < 0) { if (lstat(ce->name, &st) < 0) {
if (!is_missing_file_error(errno)) if (!is_missing_file_error(errno))
@ -303,8 +303,8 @@ int cmd_rm(int argc, const char **argv, const char *prefix)
if (pathspec_needs_expanded_index(&the_index, &pathspec)) if (pathspec_needs_expanded_index(&the_index, &pathspec))
ensure_full_index(&the_index); ensure_full_index(&the_index);
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
const struct cache_entry *ce = active_cache[i]; const struct cache_entry *ce = the_index.cache[i];
if (!include_sparse && if (!include_sparse &&
(ce_skip_worktree(ce) || (ce_skip_worktree(ce) ||

View file

@ -454,10 +454,10 @@ static void unstage_changes_unless_new(struct object_id *orig_tree)
* path, but left it out of the working tree, then clear the * path, but left it out of the working tree, then clear the
* SKIP_WORKTREE bit and write it to the working tree. * SKIP_WORKTREE bit and write it to the working tree.
*/ */
if (pos >= 0 && ce_skip_worktree(active_cache[pos])) { if (pos >= 0 && ce_skip_worktree(the_index.cache[pos])) {
struct stat st; struct stat st;
ce = active_cache[pos]; ce = the_index.cache[pos];
if (!lstat(ce->name, &st)) { if (!lstat(ce->name, &st)) {
/* Conflicting path present; relocate it */ /* Conflicting path present; relocate it */
struct strbuf new_path = STRBUF_INIT; struct strbuf new_path = STRBUF_INIT;
@ -1520,8 +1520,8 @@ static int do_push_stash(const struct pathspec *ps, const char *stash_msg, int q
/* TODO: audit for interaction with sparse-index. */ /* TODO: audit for interaction with sparse-index. */
ensure_full_index(&the_index); ensure_full_index(&the_index);
for (i = 0; i < active_nr; i++) for (i = 0; i < the_index.cache_nr; i++)
ce_path_match(&the_index, active_cache[i], ps, ce_path_match(&the_index, the_index.cache[i], ps,
ps_matched); ps_matched);
if (report_path_error(ps_matched, ps)) { if (report_path_error(ps_matched, ps)) {

View file

@ -199,8 +199,8 @@ static int module_list_compute(const char **argv,
if (read_cache() < 0) if (read_cache() < 0)
die(_("index file corrupt")); die(_("index file corrupt"));
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
const struct cache_entry *ce = active_cache[i]; const struct cache_entry *ce = the_index.cache[i];
if (!match_pathspec(&the_index, pathspec, ce->name, ce_namelen(ce), if (!match_pathspec(&the_index, pathspec, ce->name, ce_namelen(ce),
0, ps_matched, 1) || 0, ps_matched, 1) ||
@ -209,8 +209,8 @@ static int module_list_compute(const char **argv,
ALLOC_GROW(list->entries, list->nr + 1, list->alloc); ALLOC_GROW(list->entries, list->nr + 1, list->alloc);
list->entries[list->nr++] = ce; list->entries[list->nr++] = ce;
while (i + 1 < active_nr && while (i + 1 < the_index.cache_nr &&
!strcmp(ce->name, active_cache[i + 1]->name)) !strcmp(ce->name, the_index.cache[i + 1]->name))
/* /*
* Skip entries with the same name in different stages * Skip entries with the same name in different stages
* to make sure an entry is returned only once. * to make sure an entry is returned only once.
@ -3255,15 +3255,15 @@ static void die_on_index_match(const char *path, int force)
* need to check ps_matched[0] to know if a cache * need to check ps_matched[0] to know if a cache
* entry matched. * entry matched.
*/ */
for (i = 0; i < active_nr; i++) { for (i = 0; i < the_index.cache_nr; i++) {
ce_path_match(&the_index, active_cache[i], &ps, ce_path_match(&the_index, the_index.cache[i], &ps,
ps_matched); ps_matched);
if (ps_matched[0]) { if (ps_matched[0]) {
if (!force) if (!force)
die(_("'%s' already exists in the index"), die(_("'%s' already exists in the index"),
path); path);
if (!S_ISGITLINK(active_cache[i]->ce_mode)) if (!S_ISGITLINK(the_index.cache[i]->ce_mode))
die(_("'%s' already exists in the index " die(_("'%s' already exists in the index "
"and is not a submodule"), path); "and is not a submodule"), path);
break; break;

View file

@ -239,14 +239,14 @@ static int mark_ce_flags(const char *path, int flag, int mark)
int namelen = strlen(path); int namelen = strlen(path);
int pos = cache_name_pos(path, namelen); int pos = cache_name_pos(path, namelen);
if (0 <= pos) { if (0 <= pos) {
mark_fsmonitor_invalid(&the_index, active_cache[pos]); mark_fsmonitor_invalid(&the_index, the_index.cache[pos]);
if (mark) if (mark)
active_cache[pos]->ce_flags |= flag; the_index.cache[pos]->ce_flags |= flag;
else else
active_cache[pos]->ce_flags &= ~flag; the_index.cache[pos]->ce_flags &= ~flag;
active_cache[pos]->ce_flags |= CE_UPDATE_IN_BASE; the_index.cache[pos]->ce_flags |= CE_UPDATE_IN_BASE;
cache_tree_invalidate_path(&the_index, path); cache_tree_invalidate_path(&the_index, path);
active_cache_changed |= CE_ENTRY_CHANGED; the_index.cache_changed |= CE_ENTRY_CHANGED;
return 0; return 0;
} }
return -1; return -1;
@ -335,7 +335,7 @@ static int process_directory(const char *path, int len, struct stat *st)
/* Exact match: file or existing gitlink */ /* Exact match: file or existing gitlink */
if (pos >= 0) { if (pos >= 0) {
const struct cache_entry *ce = active_cache[pos]; const struct cache_entry *ce = the_index.cache[pos];
if (S_ISGITLINK(ce->ce_mode)) { if (S_ISGITLINK(ce->ce_mode)) {
/* Do nothing to the index if there is no HEAD! */ /* Do nothing to the index if there is no HEAD! */
@ -350,8 +350,8 @@ static int process_directory(const char *path, int len, struct stat *st)
/* Inexact match: is there perhaps a subdirectory match? */ /* Inexact match: is there perhaps a subdirectory match? */
pos = -pos-1; pos = -pos-1;
while (pos < active_nr) { while (pos < the_index.cache_nr) {
const struct cache_entry *ce = active_cache[pos++]; const struct cache_entry *ce = the_index.cache[pos++];
if (strncmp(ce->name, path, len)) if (strncmp(ce->name, path, len))
break; break;
@ -382,7 +382,7 @@ static int process_path(const char *path, struct stat *st, int stat_errno)
return error("'%s' is beyond a symbolic link", path); return error("'%s' is beyond a symbolic link", path);
pos = cache_name_pos(path, len); pos = cache_name_pos(path, len);
ce = pos < 0 ? NULL : active_cache[pos]; ce = pos < 0 ? NULL : the_index.cache[pos];
if (ce && ce_skip_worktree(ce)) { if (ce && ce_skip_worktree(ce)) {
/* /*
* working directory version is assumed "good" * working directory version is assumed "good"
@ -444,7 +444,7 @@ static void chmod_path(char flip, const char *path)
pos = cache_name_pos(path, strlen(path)); pos = cache_name_pos(path, strlen(path));
if (pos < 0) if (pos < 0)
goto fail; goto fail;
ce = active_cache[pos]; ce = the_index.cache[pos];
if (chmod_index_entry(&the_index, ce, flip) < 0) if (chmod_index_entry(&the_index, ce, flip) < 0)
goto fail; goto fail;
@ -642,8 +642,8 @@ static int unresolve_one(const char *path)
if (0 <= pos) { if (0 <= pos) {
/* already merged */ /* already merged */
pos = unmerge_index_entry_at(&the_index, pos); pos = unmerge_index_entry_at(&the_index, pos);
if (pos < active_nr) { if (pos < the_index.cache_nr) {
const struct cache_entry *ce = active_cache[pos]; const struct cache_entry *ce = the_index.cache[pos];
if (ce_stage(ce) && if (ce_stage(ce) &&
ce_namelen(ce) == namelen && ce_namelen(ce) == namelen &&
!memcmp(ce->name, path, namelen)) !memcmp(ce->name, path, namelen))
@ -656,8 +656,8 @@ static int unresolve_one(const char *path)
* want to do anything in the former case. * want to do anything in the former case.
*/ */
pos = -pos-1; pos = -pos-1;
if (pos < active_nr) { if (pos < the_index.cache_nr) {
const struct cache_entry *ce = active_cache[pos]; const struct cache_entry *ce = the_index.cache[pos];
if (ce_namelen(ce) == namelen && if (ce_namelen(ce) == namelen &&
!memcmp(ce->name, path, namelen)) { !memcmp(ce->name, path, namelen)) {
fprintf(stderr, fprintf(stderr,
@ -752,8 +752,8 @@ static int do_reupdate(const char **paths,
*/ */
has_head = 0; has_head = 0;
redo: redo:
for (pos = 0; pos < active_nr; pos++) { for (pos = 0; pos < the_index.cache_nr; pos++) {
const struct cache_entry *ce = active_cache[pos]; const struct cache_entry *ce = the_index.cache[pos];
struct cache_entry *old = NULL; struct cache_entry *old = NULL;
int save_nr; int save_nr;
char *path; char *path;
@ -782,12 +782,12 @@ static int do_reupdate(const char **paths,
* path anymore, in which case, under 'allow_remove', * path anymore, in which case, under 'allow_remove',
* or worse yet 'allow_replace', active_nr may decrease. * or worse yet 'allow_replace', active_nr may decrease.
*/ */
save_nr = active_nr; save_nr = the_index.cache_nr;
path = xstrdup(ce->name); path = xstrdup(ce->name);
update_one(path); update_one(path);
free(path); free(path);
discard_cache_entry(old); discard_cache_entry(old);
if (save_nr != active_nr) if (save_nr != the_index.cache_nr)
goto redo; goto redo;
} }
clear_pathspec(&pathspec); clear_pathspec(&pathspec);
@ -813,7 +813,7 @@ static int refresh(struct refresh_params *o, unsigned int flag)
* refresh_cache() as these are no actual errors. * refresh_cache() as these are no actual errors.
* cmd_status() does the same. * cmd_status() does the same.
*/ */
active_cache_changed |= SOMETHING_CHANGED; the_index.cache_changed |= SOMETHING_CHANGED;
} }
return 0; return 0;
} }
@ -951,7 +951,7 @@ static enum parse_opt_result unresolve_callback(
*has_errors = do_unresolve(ctx->argc, ctx->argv, *has_errors = do_unresolve(ctx->argc, ctx->argv,
prefix, prefix ? strlen(prefix) : 0); prefix, prefix ? strlen(prefix) : 0);
if (*has_errors) if (*has_errors)
active_cache_changed = 0; the_index.cache_changed = 0;
ctx->argv += ctx->argc - 1; ctx->argv += ctx->argc - 1;
ctx->argc = 1; ctx->argc = 1;
@ -972,7 +972,7 @@ static enum parse_opt_result reupdate_callback(
setup_work_tree(); setup_work_tree();
*has_errors = do_reupdate(ctx->argv + 1, prefix); *has_errors = do_reupdate(ctx->argv + 1, prefix);
if (*has_errors) if (*has_errors)
active_cache_changed = 0; the_index.cache_changed = 0;
ctx->argv += ctx->argc - 1; ctx->argv += ctx->argc - 1;
ctx->argc = 1; ctx->argc = 1;
@ -1178,7 +1178,7 @@ int cmd_update_index(int argc, const char **argv, const char *prefix)
INDEX_FORMAT_LB, INDEX_FORMAT_UB); INDEX_FORMAT_LB, INDEX_FORMAT_UB);
if (the_index.version != preferred_index_format) if (the_index.version != preferred_index_format)
active_cache_changed |= SOMETHING_CHANGED; the_index.cache_changed |= SOMETHING_CHANGED;
the_index.version = preferred_index_format; the_index.version = preferred_index_format;
} }
@ -1290,7 +1290,7 @@ int cmd_update_index(int argc, const char **argv, const char *prefix)
report(_("fsmonitor disabled")); report(_("fsmonitor disabled"));
} }
if (active_cache_changed || force_write) { if (the_index.cache_changed || force_write) {
if (newfd < 0) { if (newfd < 0) {
if (refresh_args.flags & REFRESH_QUIET) if (refresh_args.flags & REFRESH_QUIET)
exit(128); exit(128);

View file

@ -436,10 +436,7 @@ void prefetch_cache_entries(const struct index_state *istate,
#ifdef USE_THE_INDEX_COMPATIBILITY_MACROS #ifdef USE_THE_INDEX_COMPATIBILITY_MACROS
extern struct index_state the_index; extern struct index_state the_index;
#define active_cache (the_index.cache)
#define active_nr (the_index.cache_nr) #define active_nr (the_index.cache_nr)
#define active_cache_changed (the_index.cache_changed)
#define active_cache_tree (the_index.cache_tree)
#define read_cache() repo_read_index(the_repository) #define read_cache() repo_read_index(the_repository)
#define read_cache_from(path) read_index_from(&the_index, (path), (get_git_dir())) #define read_cache_from(path) read_index_from(&the_index, (path), (get_git_dir()))

View file

@ -1,3 +1,25 @@
// the_index.* variables
@@
@@
(
- active_cache
+ the_index.cache
|
- active_cache_changed
+ the_index.cache_changed
|
- active_cache_tree
+ the_index.cache_tree
)
@@
identifier f != prepare_to_commit;
@@
f(...) {<...
- active_nr
+ the_index.cache_nr
...>}
// "the_repository" simple cases // "the_repository" simple cases
@@ @@
@@ @@

View file

@ -1,20 +1,3 @@
// the_index.* variables
@@
@@
(
- active_cache
+ the_index.cache
|
- active_nr
+ the_index.cache_nr
|
- active_cache_changed
+ the_index.cache_changed
|
- active_cache_tree
+ the_index.cache_tree
)
// "the_repository" simple cases // "the_repository" simple cases
@@ @@
@@ @@

View file

@ -67,7 +67,7 @@ int cmd__dump_cache_tree(int ac, const char **av)
istate = the_index; istate = the_index;
istate.cache_tree = another; istate.cache_tree = another;
cache_tree_update(&istate, WRITE_TREE_DRY_RUN); cache_tree_update(&istate, WRITE_TREE_DRY_RUN);
ret = dump_cache_tree(active_cache_tree, another, ""); ret = dump_cache_tree(the_index.cache_tree, another, "");
cache_tree_free(&another); cache_tree_free(&another);
return ret; return ret;

View file

@ -12,8 +12,8 @@ int cmd__scrap_cache_tree(int ac, const char **av)
hold_locked_index(&index_lock, LOCK_DIE_ON_ERROR); hold_locked_index(&index_lock, LOCK_DIE_ON_ERROR);
if (read_cache() < 0) if (read_cache() < 0)
die("unable to read index file"); die("unable to read index file");
cache_tree_free(&active_cache_tree); cache_tree_free(&the_index.cache_tree);
active_cache_tree = NULL; the_index.cache_tree = NULL;
if (write_locked_index(&the_index, &index_lock, COMMIT_LOCK)) if (write_locked_index(&the_index, &index_lock, COMMIT_LOCK))
die("unable to write index file"); die("unable to write index file");
return 0; return 0;