2018-03-24 07:44:52 +00:00
|
|
|
#include "test-tool.h"
|
2023-02-24 00:09:27 +00:00
|
|
|
#include "hex.h"
|
2017-03-26 02:42:38 +00:00
|
|
|
#include "refs.h"
|
2023-03-21 06:26:05 +00:00
|
|
|
#include "setup.h"
|
2017-04-24 10:01:23 +00:00
|
|
|
#include "worktree.h"
|
2023-05-16 06:34:06 +00:00
|
|
|
#include "object-store-ll.h"
|
2023-05-16 06:33:59 +00:00
|
|
|
#include "path.h"
|
2018-04-12 00:21:09 +00:00
|
|
|
#include "repository.h"
|
2023-05-16 06:34:06 +00:00
|
|
|
#include "strbuf.h"
|
2023-05-12 21:34:42 +00:00
|
|
|
#include "revision.h"
|
2017-03-26 02:42:38 +00:00
|
|
|
|
2021-12-07 13:38:14 +00:00
|
|
|
struct flag_definition {
|
|
|
|
const char *name;
|
|
|
|
uint64_t mask;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define FLAG_DEF(x) \
|
|
|
|
{ \
|
|
|
|
#x, (x) \
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int parse_flags(const char *str, struct flag_definition *defs)
|
|
|
|
{
|
|
|
|
struct string_list masks = STRING_LIST_INIT_DUP;
|
|
|
|
int i = 0;
|
|
|
|
unsigned int result = 0;
|
|
|
|
|
|
|
|
if (!strcmp(str, "0"))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
string_list_split(&masks, str, ',', 64);
|
|
|
|
for (; i < masks.nr; i++) {
|
|
|
|
const char *name = masks.items[i].string;
|
|
|
|
struct flag_definition *def = defs;
|
|
|
|
int found = 0;
|
|
|
|
while (def->name) {
|
|
|
|
if (!strcmp(def->name, name)) {
|
|
|
|
result |= def->mask;
|
|
|
|
found = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
def++;
|
|
|
|
}
|
|
|
|
if (!found)
|
|
|
|
die("unknown flag \"%s\"", name);
|
|
|
|
}
|
|
|
|
|
|
|
|
string_list_clear(&masks, 0);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct flag_definition empty_flags[] = { { NULL, 0 } };
|
|
|
|
|
2017-03-26 02:42:38 +00:00
|
|
|
static const char *notnull(const char *arg, const char *name)
|
|
|
|
{
|
|
|
|
if (!arg)
|
|
|
|
die("%s required", name);
|
|
|
|
return arg;
|
|
|
|
}
|
|
|
|
|
2021-12-07 13:38:14 +00:00
|
|
|
static unsigned int arg_flags(const char *arg, const char *name,
|
|
|
|
struct flag_definition *defs)
|
2017-03-26 02:42:38 +00:00
|
|
|
{
|
2021-12-07 13:38:14 +00:00
|
|
|
return parse_flags(notnull(arg, name), defs);
|
2017-03-26 02:42:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static const char **get_store(const char **argv, struct ref_store **refs)
|
|
|
|
{
|
|
|
|
const char *gitdir;
|
|
|
|
|
|
|
|
if (!argv[0]) {
|
|
|
|
die("ref store required");
|
|
|
|
} else if (!strcmp(argv[0], "main")) {
|
2018-04-12 00:21:09 +00:00
|
|
|
*refs = get_main_ref_store(the_repository);
|
2017-03-26 02:42:38 +00:00
|
|
|
} else if (skip_prefix(argv[0], "submodule:", &gitdir)) {
|
|
|
|
struct strbuf sb = STRBUF_INIT;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = strbuf_git_path_submodule(&sb, gitdir, "objects/");
|
|
|
|
if (ret)
|
|
|
|
die("strbuf_git_path_submodule failed: %d", ret);
|
|
|
|
add_to_alternates_memory(sb.buf);
|
|
|
|
strbuf_release(&sb);
|
|
|
|
|
|
|
|
*refs = get_submodule_ref_store(gitdir);
|
2017-04-24 10:01:23 +00:00
|
|
|
} else if (skip_prefix(argv[0], "worktree:", &gitdir)) {
|
2020-06-19 23:35:44 +00:00
|
|
|
struct worktree **p, **worktrees = get_worktrees();
|
2017-04-24 10:01:23 +00:00
|
|
|
|
|
|
|
for (p = worktrees; *p; p++) {
|
|
|
|
struct worktree *wt = *p;
|
|
|
|
|
|
|
|
if (!wt->id) {
|
|
|
|
/* special case for main worktree */
|
|
|
|
if (!strcmp(gitdir, "main"))
|
|
|
|
break;
|
|
|
|
} else if (!strcmp(gitdir, wt->id))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!*p)
|
|
|
|
die("no such worktree: %s", gitdir);
|
|
|
|
|
|
|
|
*refs = get_worktree_ref_store(*p);
|
2022-07-01 10:37:39 +00:00
|
|
|
free_worktrees(worktrees);
|
2017-03-26 02:42:38 +00:00
|
|
|
} else
|
|
|
|
die("unknown backend %s", argv[0]);
|
|
|
|
|
|
|
|
if (!*refs)
|
|
|
|
die("no ref store");
|
|
|
|
|
|
|
|
/* consume store-specific optional arguments if needed */
|
|
|
|
|
|
|
|
return argv + 1;
|
|
|
|
}
|
|
|
|
|
2021-12-07 13:38:14 +00:00
|
|
|
static struct flag_definition pack_flags[] = { FLAG_DEF(PACK_REFS_PRUNE),
|
|
|
|
FLAG_DEF(PACK_REFS_ALL),
|
|
|
|
{ NULL, 0 } };
|
2017-03-26 02:42:38 +00:00
|
|
|
|
|
|
|
static int cmd_pack_refs(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
2021-12-07 13:38:14 +00:00
|
|
|
unsigned int flags = arg_flags(*argv++, "flags", pack_flags);
|
2023-05-12 21:34:42 +00:00
|
|
|
static struct ref_exclusions exclusions = REF_EXCLUSIONS_INIT;
|
|
|
|
static struct string_list included_refs = STRING_LIST_INIT_NODUP;
|
|
|
|
struct pack_refs_opts pack_opts = { .flags = flags,
|
|
|
|
.exclusions = &exclusions,
|
|
|
|
.includes = &included_refs };
|
|
|
|
|
|
|
|
if (pack_opts.flags & PACK_REFS_ALL)
|
|
|
|
string_list_append(pack_opts.includes, "*");
|
2017-03-26 02:42:38 +00:00
|
|
|
|
2023-05-12 21:34:41 +00:00
|
|
|
return refs_pack_refs(refs, &pack_opts);
|
2017-03-26 02:42:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_create_symref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
const char *target = notnull(*argv++, "target");
|
|
|
|
const char *logmsg = *argv++;
|
|
|
|
|
|
|
|
return refs_create_symref(refs, refname, target, logmsg);
|
|
|
|
}
|
|
|
|
|
2021-12-07 13:38:14 +00:00
|
|
|
static struct flag_definition transaction_flags[] = {
|
|
|
|
FLAG_DEF(REF_NO_DEREF),
|
|
|
|
FLAG_DEF(REF_FORCE_CREATE_REFLOG),
|
2021-12-07 13:38:17 +00:00
|
|
|
FLAG_DEF(REF_SKIP_OID_VERIFICATION),
|
2021-12-07 13:38:18 +00:00
|
|
|
FLAG_DEF(REF_SKIP_REFNAME_VERIFICATION),
|
2021-12-07 13:38:14 +00:00
|
|
|
{ NULL, 0 }
|
|
|
|
};
|
|
|
|
|
2017-03-26 02:42:38 +00:00
|
|
|
static int cmd_delete_refs(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
2021-12-07 13:38:14 +00:00
|
|
|
unsigned int flags = arg_flags(*argv++, "flags", transaction_flags);
|
2017-05-22 14:17:38 +00:00
|
|
|
const char *msg = *argv++;
|
2017-03-26 02:42:38 +00:00
|
|
|
struct string_list refnames = STRING_LIST_INIT_NODUP;
|
2021-12-07 13:38:15 +00:00
|
|
|
int result;
|
2017-03-26 02:42:38 +00:00
|
|
|
|
|
|
|
while (*argv)
|
|
|
|
string_list_append(&refnames, *argv++);
|
|
|
|
|
2021-12-07 13:38:15 +00:00
|
|
|
result = refs_delete_refs(refs, msg, &refnames, flags);
|
|
|
|
string_list_clear(&refnames, 0);
|
|
|
|
return result;
|
2017-03-26 02:42:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_rename_ref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *oldref = notnull(*argv++, "oldref");
|
|
|
|
const char *newref = notnull(*argv++, "newref");
|
|
|
|
const char *logmsg = *argv++;
|
|
|
|
|
|
|
|
return refs_rename_ref(refs, oldref, newref, logmsg);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int each_ref(const char *refname, const struct object_id *oid,
|
2022-08-25 17:09:48 +00:00
|
|
|
int flags, void *cb_data UNUSED)
|
2017-03-26 02:42:38 +00:00
|
|
|
{
|
|
|
|
printf("%s %s 0x%x\n", oid_to_hex(oid), refname, flags);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_for_each_ref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *prefix = notnull(*argv++, "prefix");
|
|
|
|
|
|
|
|
return refs_for_each_ref_in(refs, prefix, each_ref, NULL);
|
|
|
|
}
|
|
|
|
|
refs/packed-backend.c: implement jump lists to avoid excluded pattern(s)
When iterating through the `packed-refs` file in order to answer a query
like:
$ git for-each-ref --exclude=refs/__hidden__
it would be useful to avoid walking over all of the entries in
`refs/__hidden__/*` when possible, since we know that the ref-filter
code is going to throw them away anyways.
In certain circumstances, doing so is possible. The algorithm for doing
so is as follows:
- For each excluded pattern, find the first record that matches it,
and the first record that *doesn't* match it (i.e. the location
you'd next want to consider when excluding that pattern).
- Sort the set of excluded regions from the previous step in ascending
order of the first location within the `packed-refs` file that
matches.
- Clean up the results from the previous step: discard empty regions,
and combine adjacent regions. The set of regions which remains is
referred to as the "jump list", and never contains any references
which should be included in the result set.
Then when iterating through the `packed-refs` file, if `iter->pos` is
ever contained in one of the regions from the previous steps, advance
`iter->pos` past the end of that region, and continue enumeration.
Note that we only perform this optimization when none of the excluded
pattern(s) have special meta-characters in them. For a pattern like
"refs/foo[ac]", the excluded regions ("refs/fooa", "refs/fooc", and
everything underneath them) are not connected. A future implementation
that handles this case may split the character class (pretending as if
two patterns were excluded: "refs/fooa", and "refs/fooc").
There are a few other gotchas worth considering. First, note that the
jump list is sorted, so once we jump past a region, we can avoid
considering it (or any regions preceding it) again. The member
`jump_pos` is used to track the first next-possible region to jump
through.
Second, note that the jump list is best-effort, since we do not handle
loose references, and because of the meta-character issue above. The
jump list may not skip past all references which won't appear in the
results, but will never skip over a reference which does appear in the
result set.
In repositories with a large number of hidden references, the speed-up
can be significant. Tests here are done with a copy of linux.git with a
reference "refs/pull/N" pointing at every commit, as in:
$ git rev-list HEAD | awk '{ print "create refs/pull/" NR " " $0 }' |
git update-ref --stdin
$ git pack-refs --all
, it is significantly faster to have `for-each-ref` jump over the
excluded references, as opposed to filtering them out after the fact:
$ hyperfine \
'git for-each-ref --format="%(objectname) %(refname)" | grep -vE "^[0-9a-f]{40} refs/pull/"' \
'git.prev for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"' \
'git.compile for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"'
Benchmark 1: git for-each-ref --format="%(objectname) %(refname)" | grep -vE "^[0-9a-f]{40} refs/pull/"
Time (mean ± σ): 798.1 ms ± 3.3 ms [User: 687.6 ms, System: 146.4 ms]
Range (min … max): 794.5 ms … 805.5 ms 10 runs
Benchmark 2: git.prev for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"
Time (mean ± σ): 98.9 ms ± 1.4 ms [User: 93.1 ms, System: 5.7 ms]
Range (min … max): 97.0 ms … 104.0 ms 29 runs
Benchmark 3: git.compile for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"
Time (mean ± σ): 4.5 ms ± 0.2 ms [User: 0.7 ms, System: 3.8 ms]
Range (min … max): 4.1 ms … 5.8 ms 524 runs
Summary
'git.compile for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"' ran
21.87 ± 1.05 times faster than 'git.prev for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"'
176.52 ± 8.19 times faster than 'git for-each-ref --format="%(objectname) %(refname)" | grep -vE "^[0-9a-f]{40} refs/pull/"'
(Comparing stock git and this patch isn't quite fair, since an earlier
commit in this series adds a naive implementation of the `--exclude`
option. `git.prev` is built from the previous commit and includes this
naive implementation).
Using the jump list is fairly straightforward (see the changes to
`refs/packed-backend.c::next_record()`), but constructing the list is
not. To ensure that the construction is correct, add a new suite of
tests in t1419 covering various corner cases (overlapping regions,
partially overlapping regions, adjacent regions, etc.).
Co-authored-by: Jeff King <peff@peff.net>
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Taylor Blau <me@ttaylorr.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2023-07-10 21:12:28 +00:00
|
|
|
static int cmd_for_each_ref__exclude(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *prefix = notnull(*argv++, "prefix");
|
|
|
|
const char **exclude_patterns = argv;
|
|
|
|
|
|
|
|
return refs_for_each_fullref_in(refs, prefix, exclude_patterns, each_ref,
|
|
|
|
NULL);
|
|
|
|
}
|
|
|
|
|
2017-03-26 02:42:38 +00:00
|
|
|
static int cmd_resolve_ref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
2021-05-31 16:56:17 +00:00
|
|
|
struct object_id oid = *null_oid();
|
2017-03-26 02:42:38 +00:00
|
|
|
const char *refname = notnull(*argv++, "refname");
|
2021-12-07 13:38:14 +00:00
|
|
|
int resolve_flags = arg_flags(*argv++, "resolve-flags", empty_flags);
|
2017-03-26 02:42:38 +00:00
|
|
|
int flags;
|
|
|
|
const char *ref;
|
|
|
|
|
2021-10-16 09:39:27 +00:00
|
|
|
ref = refs_resolve_ref_unsafe(refs, refname, resolve_flags,
|
2022-01-26 14:37:01 +00:00
|
|
|
&oid, &flags);
|
2017-11-06 05:24:27 +00:00
|
|
|
printf("%s %s 0x%x\n", oid_to_hex(&oid), ref ? ref : "(null)", flags);
|
2017-03-26 02:42:38 +00:00
|
|
|
return ref ? 0 : 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_verify_ref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
struct strbuf err = STRBUF_INIT;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = refs_verify_refname_available(refs, refname, NULL, NULL, &err);
|
|
|
|
if (err.len)
|
|
|
|
puts(err.buf);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2023-03-28 20:57:25 +00:00
|
|
|
static int cmd_for_each_reflog(struct ref_store *refs,
|
|
|
|
const char **argv UNUSED)
|
2017-03-26 02:42:38 +00:00
|
|
|
{
|
|
|
|
return refs_for_each_reflog(refs, each_ref, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int each_reflog(struct object_id *old_oid, struct object_id *new_oid,
|
2017-04-26 19:29:31 +00:00
|
|
|
const char *committer, timestamp_t timestamp,
|
2022-08-25 17:09:48 +00:00
|
|
|
int tz, const char *msg, void *cb_data UNUSED)
|
2017-03-26 02:42:38 +00:00
|
|
|
{
|
2021-12-02 17:36:32 +00:00
|
|
|
printf("%s %s %s %" PRItime " %+05d%s%s", oid_to_hex(old_oid),
|
|
|
|
oid_to_hex(new_oid), committer, timestamp, tz,
|
|
|
|
*msg == '\n' ? "" : "\t", msg);
|
2017-03-26 02:42:38 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_for_each_reflog_ent(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
|
|
|
|
return refs_for_each_reflog_ent(refs, refname, each_reflog, refs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_for_each_reflog_ent_reverse(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
|
|
|
|
return refs_for_each_reflog_ent_reverse(refs, refname, each_reflog, refs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_reflog_exists(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
|
|
|
|
return !refs_reflog_exists(refs, refname);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_create_reflog(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
struct strbuf err = STRBUF_INIT;
|
|
|
|
int ret;
|
|
|
|
|
2021-11-22 14:19:08 +00:00
|
|
|
ret = refs_create_reflog(refs, refname, &err);
|
2017-03-26 02:42:38 +00:00
|
|
|
if (err.len)
|
|
|
|
puts(err.buf);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_delete_reflog(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
|
|
|
|
return refs_delete_reflog(refs, refname);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_delete_ref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *msg = notnull(*argv++, "msg");
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
|
|
|
const char *sha1_buf = notnull(*argv++, "old-sha1");
|
2021-12-07 13:38:14 +00:00
|
|
|
unsigned int flags = arg_flags(*argv++, "flags", transaction_flags);
|
2017-10-15 22:06:50 +00:00
|
|
|
struct object_id old_oid;
|
2017-03-26 02:42:38 +00:00
|
|
|
|
2017-10-15 22:06:50 +00:00
|
|
|
if (get_oid_hex(sha1_buf, &old_oid))
|
2021-12-21 13:15:00 +00:00
|
|
|
die("cannot parse %s as %s", sha1_buf, the_hash_algo->name);
|
2017-03-26 02:42:38 +00:00
|
|
|
|
2017-10-15 22:06:50 +00:00
|
|
|
return refs_delete_ref(refs, msg, refname, &old_oid, flags);
|
2017-03-26 02:42:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int cmd_update_ref(struct ref_store *refs, const char **argv)
|
|
|
|
{
|
|
|
|
const char *msg = notnull(*argv++, "msg");
|
|
|
|
const char *refname = notnull(*argv++, "refname");
|
2019-01-06 15:46:37 +00:00
|
|
|
const char *new_sha1_buf = notnull(*argv++, "new-sha1");
|
2017-03-26 02:42:38 +00:00
|
|
|
const char *old_sha1_buf = notnull(*argv++, "old-sha1");
|
2021-12-07 13:38:14 +00:00
|
|
|
unsigned int flags = arg_flags(*argv++, "flags", transaction_flags);
|
2017-10-15 22:06:51 +00:00
|
|
|
struct object_id old_oid;
|
|
|
|
struct object_id new_oid;
|
2017-03-26 02:42:38 +00:00
|
|
|
|
2021-12-21 13:15:00 +00:00
|
|
|
if (get_oid_hex(old_sha1_buf, &old_oid))
|
|
|
|
die("cannot parse %s as %s", old_sha1_buf, the_hash_algo->name);
|
|
|
|
if (get_oid_hex(new_sha1_buf, &new_oid))
|
|
|
|
die("cannot parse %s as %s", new_sha1_buf, the_hash_algo->name);
|
2017-03-26 02:42:38 +00:00
|
|
|
|
|
|
|
return refs_update_ref(refs, msg, refname,
|
2017-10-15 22:06:51 +00:00
|
|
|
&new_oid, &old_oid,
|
2017-03-26 02:42:38 +00:00
|
|
|
flags, UPDATE_REFS_DIE_ON_ERR);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct command {
|
|
|
|
const char *name;
|
|
|
|
int (*func)(struct ref_store *refs, const char **argv);
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct command commands[] = {
|
|
|
|
{ "pack-refs", cmd_pack_refs },
|
|
|
|
{ "create-symref", cmd_create_symref },
|
|
|
|
{ "delete-refs", cmd_delete_refs },
|
|
|
|
{ "rename-ref", cmd_rename_ref },
|
|
|
|
{ "for-each-ref", cmd_for_each_ref },
|
refs/packed-backend.c: implement jump lists to avoid excluded pattern(s)
When iterating through the `packed-refs` file in order to answer a query
like:
$ git for-each-ref --exclude=refs/__hidden__
it would be useful to avoid walking over all of the entries in
`refs/__hidden__/*` when possible, since we know that the ref-filter
code is going to throw them away anyways.
In certain circumstances, doing so is possible. The algorithm for doing
so is as follows:
- For each excluded pattern, find the first record that matches it,
and the first record that *doesn't* match it (i.e. the location
you'd next want to consider when excluding that pattern).
- Sort the set of excluded regions from the previous step in ascending
order of the first location within the `packed-refs` file that
matches.
- Clean up the results from the previous step: discard empty regions,
and combine adjacent regions. The set of regions which remains is
referred to as the "jump list", and never contains any references
which should be included in the result set.
Then when iterating through the `packed-refs` file, if `iter->pos` is
ever contained in one of the regions from the previous steps, advance
`iter->pos` past the end of that region, and continue enumeration.
Note that we only perform this optimization when none of the excluded
pattern(s) have special meta-characters in them. For a pattern like
"refs/foo[ac]", the excluded regions ("refs/fooa", "refs/fooc", and
everything underneath them) are not connected. A future implementation
that handles this case may split the character class (pretending as if
two patterns were excluded: "refs/fooa", and "refs/fooc").
There are a few other gotchas worth considering. First, note that the
jump list is sorted, so once we jump past a region, we can avoid
considering it (or any regions preceding it) again. The member
`jump_pos` is used to track the first next-possible region to jump
through.
Second, note that the jump list is best-effort, since we do not handle
loose references, and because of the meta-character issue above. The
jump list may not skip past all references which won't appear in the
results, but will never skip over a reference which does appear in the
result set.
In repositories with a large number of hidden references, the speed-up
can be significant. Tests here are done with a copy of linux.git with a
reference "refs/pull/N" pointing at every commit, as in:
$ git rev-list HEAD | awk '{ print "create refs/pull/" NR " " $0 }' |
git update-ref --stdin
$ git pack-refs --all
, it is significantly faster to have `for-each-ref` jump over the
excluded references, as opposed to filtering them out after the fact:
$ hyperfine \
'git for-each-ref --format="%(objectname) %(refname)" | grep -vE "^[0-9a-f]{40} refs/pull/"' \
'git.prev for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"' \
'git.compile for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"'
Benchmark 1: git for-each-ref --format="%(objectname) %(refname)" | grep -vE "^[0-9a-f]{40} refs/pull/"
Time (mean ± σ): 798.1 ms ± 3.3 ms [User: 687.6 ms, System: 146.4 ms]
Range (min … max): 794.5 ms … 805.5 ms 10 runs
Benchmark 2: git.prev for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"
Time (mean ± σ): 98.9 ms ± 1.4 ms [User: 93.1 ms, System: 5.7 ms]
Range (min … max): 97.0 ms … 104.0 ms 29 runs
Benchmark 3: git.compile for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"
Time (mean ± σ): 4.5 ms ± 0.2 ms [User: 0.7 ms, System: 3.8 ms]
Range (min … max): 4.1 ms … 5.8 ms 524 runs
Summary
'git.compile for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"' ran
21.87 ± 1.05 times faster than 'git.prev for-each-ref --format="%(objectname) %(refname)" --exclude="refs/pull"'
176.52 ± 8.19 times faster than 'git for-each-ref --format="%(objectname) %(refname)" | grep -vE "^[0-9a-f]{40} refs/pull/"'
(Comparing stock git and this patch isn't quite fair, since an earlier
commit in this series adds a naive implementation of the `--exclude`
option. `git.prev` is built from the previous commit and includes this
naive implementation).
Using the jump list is fairly straightforward (see the changes to
`refs/packed-backend.c::next_record()`), but constructing the list is
not. To ensure that the construction is correct, add a new suite of
tests in t1419 covering various corner cases (overlapping regions,
partially overlapping regions, adjacent regions, etc.).
Co-authored-by: Jeff King <peff@peff.net>
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Taylor Blau <me@ttaylorr.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2023-07-10 21:12:28 +00:00
|
|
|
{ "for-each-ref--exclude", cmd_for_each_ref__exclude },
|
2017-03-26 02:42:38 +00:00
|
|
|
{ "resolve-ref", cmd_resolve_ref },
|
|
|
|
{ "verify-ref", cmd_verify_ref },
|
|
|
|
{ "for-each-reflog", cmd_for_each_reflog },
|
|
|
|
{ "for-each-reflog-ent", cmd_for_each_reflog_ent },
|
|
|
|
{ "for-each-reflog-ent-reverse", cmd_for_each_reflog_ent_reverse },
|
|
|
|
{ "reflog-exists", cmd_reflog_exists },
|
|
|
|
{ "create-reflog", cmd_create_reflog },
|
|
|
|
{ "delete-reflog", cmd_delete_reflog },
|
|
|
|
/*
|
|
|
|
* backend transaction functions can't be tested separately
|
|
|
|
*/
|
|
|
|
{ "delete-ref", cmd_delete_ref },
|
|
|
|
{ "update-ref", cmd_update_ref },
|
|
|
|
{ NULL, NULL }
|
|
|
|
};
|
|
|
|
|
2023-03-28 20:57:25 +00:00
|
|
|
int cmd__ref_store(int argc UNUSED, const char **argv)
|
2017-03-26 02:42:38 +00:00
|
|
|
{
|
|
|
|
struct ref_store *refs;
|
|
|
|
const char *func;
|
|
|
|
struct command *cmd;
|
|
|
|
|
|
|
|
setup_git_directory();
|
|
|
|
|
|
|
|
argv = get_store(argv + 1, &refs);
|
|
|
|
|
|
|
|
func = *argv++;
|
|
|
|
if (!func)
|
|
|
|
die("ref function required");
|
|
|
|
for (cmd = commands; cmd->name; cmd++) {
|
|
|
|
if (!strcmp(func, cmd->name))
|
|
|
|
return cmd->func(refs, argv);
|
|
|
|
}
|
|
|
|
die("unknown function %s", func);
|
|
|
|
return 0;
|
|
|
|
}
|