зеркало из https://github.com/microsoft/git.git
shallow.c: implement a generic shallow boundary finder based on rev-list
Instead of a custom commit walker like get_shallow_commits(), this new function uses rev-list to mark NOT_SHALLOW to all reachable commits, except borders. The definition of reachable is to be defined by the protocol later. This makes it more flexible to define shallow boundary. The way we find border is paint all reachable commits NOT_SHALLOW. Any of them that "touches" commits without NOT_SHALLOW flag are considered shallow (e.g. zero parents via grafting mechanism). Shallow commits and their true parents are all marked SHALLOW. Then NOT_SHALLOW is removed from shallow commits at the end. There is an interesting observation. With a generic walker, we can produce all kinds of shallow cutting. In the following graph, every commit but "x" is reachable. "b" is a parent of "a". x -- a -- o / / x -- c -- b -- o After this function is run, "a" and "c" are both considered shallow commits. After grafting occurs at the client side, what we see is a -- o / c -- b -- o Notice that because of grafting, "a" has zero parents, so "b" is no longer a parent of "a". This is unfortunate and may be solved in two ways. The first is change the way shallow grafting works and keep "a -- b" connection if "b" exists and always ends at shallow commits (iow, no loose ends). This is hard to detect, or at least not cheap to do. The second way is mark one "x" as shallow commit instead of "a" and produce this graph at client side: x -- a -- o / / c -- b -- o More commits, but simpler grafting rules. Signed-off-by: Nguyễn Thái Ngọc Duy <pclouds@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
Родитель
79891cb90a
Коммит
3d9ff4d736
2
commit.h
2
commit.h
|
@ -258,6 +258,8 @@ extern int for_each_commit_graft(each_commit_graft_fn, void *);
|
||||||
extern int is_repository_shallow(void);
|
extern int is_repository_shallow(void);
|
||||||
extern struct commit_list *get_shallow_commits(struct object_array *heads,
|
extern struct commit_list *get_shallow_commits(struct object_array *heads,
|
||||||
int depth, int shallow_flag, int not_shallow_flag);
|
int depth, int shallow_flag, int not_shallow_flag);
|
||||||
|
extern struct commit_list *get_shallow_commits_by_rev_list(
|
||||||
|
int ac, const char **av, int shallow_flag, int not_shallow_flag);
|
||||||
extern void set_alternate_shallow_file(const char *path, int override);
|
extern void set_alternate_shallow_file(const char *path, int override);
|
||||||
extern int write_shallow_commits(struct strbuf *out, int use_pack_protocol,
|
extern int write_shallow_commits(struct strbuf *out, int use_pack_protocol,
|
||||||
const struct sha1_array *extra);
|
const struct sha1_array *extra);
|
||||||
|
|
78
shallow.c
78
shallow.c
|
@ -10,6 +10,8 @@
|
||||||
#include "diff.h"
|
#include "diff.h"
|
||||||
#include "revision.h"
|
#include "revision.h"
|
||||||
#include "commit-slab.h"
|
#include "commit-slab.h"
|
||||||
|
#include "revision.h"
|
||||||
|
#include "list-objects.h"
|
||||||
|
|
||||||
static int is_shallow = -1;
|
static int is_shallow = -1;
|
||||||
static struct stat_validity shallow_stat;
|
static struct stat_validity shallow_stat;
|
||||||
|
@ -137,6 +139,82 @@ struct commit_list *get_shallow_commits(struct object_array *heads, int depth,
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void show_commit(struct commit *commit, void *data)
|
||||||
|
{
|
||||||
|
commit_list_insert(commit, data);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Given rev-list arguments, run rev-list. All reachable commits
|
||||||
|
* except border ones are marked with not_shallow_flag. Border commits
|
||||||
|
* are marked with shallow_flag. The list of border/shallow commits
|
||||||
|
* are also returned.
|
||||||
|
*/
|
||||||
|
struct commit_list *get_shallow_commits_by_rev_list(int ac, const char **av,
|
||||||
|
int shallow_flag,
|
||||||
|
int not_shallow_flag)
|
||||||
|
{
|
||||||
|
struct commit_list *result = NULL, *p;
|
||||||
|
struct commit_list *not_shallow_list = NULL;
|
||||||
|
struct rev_info revs;
|
||||||
|
int both_flags = shallow_flag | not_shallow_flag;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* SHALLOW (excluded) and NOT_SHALLOW (included) should not be
|
||||||
|
* set at this point. But better be safe than sorry.
|
||||||
|
*/
|
||||||
|
clear_object_flags(both_flags);
|
||||||
|
|
||||||
|
is_repository_shallow(); /* make sure shallows are read */
|
||||||
|
|
||||||
|
init_revisions(&revs, NULL);
|
||||||
|
save_commit_buffer = 0;
|
||||||
|
setup_revisions(ac, av, &revs, NULL);
|
||||||
|
|
||||||
|
if (prepare_revision_walk(&revs))
|
||||||
|
die("revision walk setup failed");
|
||||||
|
traverse_commit_list(&revs, show_commit, NULL, ¬_shallow_list);
|
||||||
|
|
||||||
|
/* Mark all reachable commits as NOT_SHALLOW */
|
||||||
|
for (p = not_shallow_list; p; p = p->next)
|
||||||
|
p->item->object.flags |= not_shallow_flag;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* mark border commits SHALLOW + NOT_SHALLOW.
|
||||||
|
* We cannot clear NOT_SHALLOW right now. Imagine border
|
||||||
|
* commit A is processed first, then commit B, whose parent is
|
||||||
|
* A, later. If NOT_SHALLOW on A is cleared at step 1, B
|
||||||
|
* itself is considered border at step 2, which is incorrect.
|
||||||
|
*/
|
||||||
|
for (p = not_shallow_list; p; p = p->next) {
|
||||||
|
struct commit *c = p->item;
|
||||||
|
struct commit_list *parent;
|
||||||
|
|
||||||
|
if (parse_commit(c))
|
||||||
|
die("unable to parse commit %s",
|
||||||
|
oid_to_hex(&c->object.oid));
|
||||||
|
|
||||||
|
for (parent = c->parents; parent; parent = parent->next)
|
||||||
|
if (!(parent->item->object.flags & not_shallow_flag)) {
|
||||||
|
c->object.flags |= shallow_flag;
|
||||||
|
commit_list_insert(c, &result);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
free_commit_list(not_shallow_list);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Now we can clean up NOT_SHALLOW on border commits. Having
|
||||||
|
* both flags set can confuse the caller.
|
||||||
|
*/
|
||||||
|
for (p = result; p; p = p->next) {
|
||||||
|
struct object *o = &p->item->object;
|
||||||
|
if ((o->flags & both_flags) == both_flags)
|
||||||
|
o->flags &= ~not_shallow_flag;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
static void check_shallow_file_for_update(void)
|
static void check_shallow_file_for_update(void)
|
||||||
{
|
{
|
||||||
if (is_shallow == -1)
|
if (is_shallow == -1)
|
||||||
|
|
Загрузка…
Ссылка в новой задаче