mirror of
https://github.com/git/git.git
synced 2024-06-11 01:06:34 +02:00
fetch-pack: introduce negotiator API
Introduce the new files fetch-negotiator.{h,c}, which contains an API behind which the details of negotiation are abstracted. Currently, only one algorithm is available: the existing one. This patch is written to be easily reviewed: static functions are moved verbatim from fetch-pack.c to negotiator/default.c, and it can be seen that the lines replaced by negotiator->X() calls are present in the X() functions respectively. Signed-off-by: Jonathan Tan <jonathantanmy@google.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
parent
d093bc7582
commit
ec06283844
2
Makefile
2
Makefile
|
@ -859,6 +859,7 @@ LIB_OBJS += ewah/ewah_bitmap.o
|
||||||
LIB_OBJS += ewah/ewah_io.o
|
LIB_OBJS += ewah/ewah_io.o
|
||||||
LIB_OBJS += ewah/ewah_rlw.o
|
LIB_OBJS += ewah/ewah_rlw.o
|
||||||
LIB_OBJS += exec-cmd.o
|
LIB_OBJS += exec-cmd.o
|
||||||
|
LIB_OBJS += fetch-negotiator.o
|
||||||
LIB_OBJS += fetch-object.o
|
LIB_OBJS += fetch-object.o
|
||||||
LIB_OBJS += fetch-pack.o
|
LIB_OBJS += fetch-pack.o
|
||||||
LIB_OBJS += fsck.o
|
LIB_OBJS += fsck.o
|
||||||
|
@ -891,6 +892,7 @@ LIB_OBJS += merge-blobs.o
|
||||||
LIB_OBJS += merge-recursive.o
|
LIB_OBJS += merge-recursive.o
|
||||||
LIB_OBJS += mergesort.o
|
LIB_OBJS += mergesort.o
|
||||||
LIB_OBJS += name-hash.o
|
LIB_OBJS += name-hash.o
|
||||||
|
LIB_OBJS += negotiator/default.o
|
||||||
LIB_OBJS += notes.o
|
LIB_OBJS += notes.o
|
||||||
LIB_OBJS += notes-cache.o
|
LIB_OBJS += notes-cache.o
|
||||||
LIB_OBJS += notes-merge.o
|
LIB_OBJS += notes-merge.o
|
||||||
|
|
|
@ -0,0 +1,8 @@
|
||||||
|
#include "git-compat-util.h"
|
||||||
|
#include "fetch-negotiator.h"
|
||||||
|
#include "negotiator/default.h"
|
||||||
|
|
||||||
|
void fetch_negotiator_init(struct fetch_negotiator *negotiator)
|
||||||
|
{
|
||||||
|
default_negotiator_init(negotiator);
|
||||||
|
}
|
|
@ -0,0 +1,57 @@
|
||||||
|
#ifndef FETCH_NEGOTIATOR
|
||||||
|
#define FETCH_NEGOTIATOR
|
||||||
|
|
||||||
|
struct commit;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* An object that supplies the information needed to negotiate the contents of
|
||||||
|
* the to-be-sent packfile during a fetch.
|
||||||
|
*
|
||||||
|
* To set up the negotiator, call fetch_negotiator_init(), then known_common()
|
||||||
|
* (0 or more times), then add_tip() (0 or more times).
|
||||||
|
*
|
||||||
|
* Then, when "have" lines are required, call next(). Call ack() to report what
|
||||||
|
* the server tells us.
|
||||||
|
*
|
||||||
|
* Once negotiation is done, call release(). The negotiator then cannot be used
|
||||||
|
* (unless reinitialized with fetch_negotiator_init()).
|
||||||
|
*/
|
||||||
|
struct fetch_negotiator {
|
||||||
|
/*
|
||||||
|
* Before negotiation starts, indicate that the server is known to have
|
||||||
|
* this commit.
|
||||||
|
*/
|
||||||
|
void (*known_common)(struct fetch_negotiator *, struct commit *);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Once this function is invoked, known_common() cannot be invoked any
|
||||||
|
* more.
|
||||||
|
*
|
||||||
|
* Indicate that this commit and all its ancestors are to be checked
|
||||||
|
* for commonality with the server.
|
||||||
|
*/
|
||||||
|
void (*add_tip)(struct fetch_negotiator *, struct commit *);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Once this function is invoked, known_common() and add_tip() cannot
|
||||||
|
* be invoked any more.
|
||||||
|
*
|
||||||
|
* Return the next commit that the client should send as a "have" line.
|
||||||
|
*/
|
||||||
|
const struct object_id *(*next)(struct fetch_negotiator *);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Inform the negotiator that the server has the given commit. This
|
||||||
|
* method must only be called on commits returned by next().
|
||||||
|
*/
|
||||||
|
int (*ack)(struct fetch_negotiator *, struct commit *);
|
||||||
|
|
||||||
|
void (*release)(struct fetch_negotiator *);
|
||||||
|
|
||||||
|
/* internal use */
|
||||||
|
void *data;
|
||||||
|
};
|
||||||
|
|
||||||
|
void fetch_negotiator_init(struct fetch_negotiator *negotiator);
|
||||||
|
|
||||||
|
#endif
|
205
fetch-pack.c
205
fetch-pack.c
|
@ -15,10 +15,10 @@
|
||||||
#include "connect.h"
|
#include "connect.h"
|
||||||
#include "transport.h"
|
#include "transport.h"
|
||||||
#include "version.h"
|
#include "version.h"
|
||||||
#include "prio-queue.h"
|
|
||||||
#include "sha1-array.h"
|
#include "sha1-array.h"
|
||||||
#include "oidset.h"
|
#include "oidset.h"
|
||||||
#include "packfile.h"
|
#include "packfile.h"
|
||||||
|
#include "fetch-negotiator.h"
|
||||||
|
|
||||||
static int transfer_unpack_limit = -1;
|
static int transfer_unpack_limit = -1;
|
||||||
static int fetch_unpack_limit = -1;
|
static int fetch_unpack_limit = -1;
|
||||||
|
@ -36,13 +36,7 @@ static const char *alternate_shallow_file;
|
||||||
|
|
||||||
/* Remember to update object flag allocation in object.h */
|
/* Remember to update object flag allocation in object.h */
|
||||||
#define COMPLETE (1U << 0)
|
#define COMPLETE (1U << 0)
|
||||||
#define COMMON (1U << 1)
|
#define ALTERNATE (1U << 1)
|
||||||
#define COMMON_REF (1U << 2)
|
|
||||||
#define SEEN (1U << 3)
|
|
||||||
#define POPPED (1U << 4)
|
|
||||||
#define ALTERNATE (1U << 5)
|
|
||||||
|
|
||||||
static int marked;
|
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* After sending this many "have"s if we do not get any new ACK , we
|
* After sending this many "have"s if we do not get any new ACK , we
|
||||||
|
@ -50,11 +44,6 @@ static int marked;
|
||||||
*/
|
*/
|
||||||
#define MAX_IN_VAIN 256
|
#define MAX_IN_VAIN 256
|
||||||
|
|
||||||
struct negotiation_state {
|
|
||||||
struct prio_queue rev_list;
|
|
||||||
int non_common_revs;
|
|
||||||
};
|
|
||||||
|
|
||||||
static int multi_ack, use_sideband;
|
static int multi_ack, use_sideband;
|
||||||
/* Allow specifying sha1 if it is a ref tip. */
|
/* Allow specifying sha1 if it is a ref tip. */
|
||||||
#define ALLOW_TIP_SHA1 01
|
#define ALLOW_TIP_SHA1 01
|
||||||
|
@ -97,8 +86,8 @@ static void cache_one_alternate(const char *refname,
|
||||||
cache->items[cache->nr++] = obj;
|
cache->items[cache->nr++] = obj;
|
||||||
}
|
}
|
||||||
|
|
||||||
static void for_each_cached_alternate(struct negotiation_state *ns,
|
static void for_each_cached_alternate(struct fetch_negotiator *negotiator,
|
||||||
void (*cb)(struct negotiation_state *,
|
void (*cb)(struct fetch_negotiator *,
|
||||||
struct object *))
|
struct object *))
|
||||||
{
|
{
|
||||||
static int initialized;
|
static int initialized;
|
||||||
|
@ -111,33 +100,17 @@ static void for_each_cached_alternate(struct negotiation_state *ns,
|
||||||
}
|
}
|
||||||
|
|
||||||
for (i = 0; i < cache.nr; i++)
|
for (i = 0; i < cache.nr; i++)
|
||||||
cb(ns, cache.items[i]);
|
cb(negotiator, cache.items[i]);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void rev_list_push(struct negotiation_state *ns,
|
static int rev_list_insert_ref(struct fetch_negotiator *negotiator,
|
||||||
struct commit *commit, int mark)
|
|
||||||
{
|
|
||||||
if (!(commit->object.flags & mark)) {
|
|
||||||
commit->object.flags |= mark;
|
|
||||||
|
|
||||||
if (parse_commit(commit))
|
|
||||||
return;
|
|
||||||
|
|
||||||
prio_queue_put(&ns->rev_list, commit);
|
|
||||||
|
|
||||||
if (!(commit->object.flags & COMMON))
|
|
||||||
ns->non_common_revs++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static int rev_list_insert_ref(struct negotiation_state *ns,
|
|
||||||
const char *refname,
|
const char *refname,
|
||||||
const struct object_id *oid)
|
const struct object_id *oid)
|
||||||
{
|
{
|
||||||
struct object *o = deref_tag(parse_object(oid), refname, 0);
|
struct object *o = deref_tag(parse_object(oid), refname, 0);
|
||||||
|
|
||||||
if (o && o->type == OBJ_COMMIT)
|
if (o && o->type == OBJ_COMMIT)
|
||||||
rev_list_push(ns, (struct commit *)o, SEEN);
|
negotiator->add_tip(negotiator, (struct commit *)o);
|
||||||
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -148,98 +121,6 @@ static int rev_list_insert_ref_oid(const char *refname, const struct object_id *
|
||||||
return rev_list_insert_ref(cb_data, refname, oid);
|
return rev_list_insert_ref(cb_data, refname, oid);
|
||||||
}
|
}
|
||||||
|
|
||||||
static int clear_marks(const char *refname, const struct object_id *oid,
|
|
||||||
int flag, void *cb_data)
|
|
||||||
{
|
|
||||||
struct object *o = deref_tag(parse_object(oid), refname, 0);
|
|
||||||
|
|
||||||
if (o && o->type == OBJ_COMMIT)
|
|
||||||
clear_commit_marks((struct commit *)o,
|
|
||||||
COMMON | COMMON_REF | SEEN | POPPED);
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
This function marks a rev and its ancestors as common.
|
|
||||||
In some cases, it is desirable to mark only the ancestors (for example
|
|
||||||
when only the server does not yet know that they are common).
|
|
||||||
*/
|
|
||||||
|
|
||||||
static void mark_common(struct negotiation_state *ns, struct commit *commit,
|
|
||||||
int ancestors_only, int dont_parse)
|
|
||||||
{
|
|
||||||
if (commit != NULL && !(commit->object.flags & COMMON)) {
|
|
||||||
struct object *o = (struct object *)commit;
|
|
||||||
|
|
||||||
if (!ancestors_only)
|
|
||||||
o->flags |= COMMON;
|
|
||||||
|
|
||||||
if (!(o->flags & SEEN))
|
|
||||||
rev_list_push(ns, commit, SEEN);
|
|
||||||
else {
|
|
||||||
struct commit_list *parents;
|
|
||||||
|
|
||||||
if (!ancestors_only && !(o->flags & POPPED))
|
|
||||||
ns->non_common_revs--;
|
|
||||||
if (!o->parsed && !dont_parse)
|
|
||||||
if (parse_commit(commit))
|
|
||||||
return;
|
|
||||||
|
|
||||||
for (parents = commit->parents;
|
|
||||||
parents;
|
|
||||||
parents = parents->next)
|
|
||||||
mark_common(ns, parents->item, 0,
|
|
||||||
dont_parse);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
Get the next rev to send, ignoring the common.
|
|
||||||
*/
|
|
||||||
|
|
||||||
static const struct object_id *get_rev(struct negotiation_state *ns)
|
|
||||||
{
|
|
||||||
struct commit *commit = NULL;
|
|
||||||
|
|
||||||
while (commit == NULL) {
|
|
||||||
unsigned int mark;
|
|
||||||
struct commit_list *parents;
|
|
||||||
|
|
||||||
if (ns->rev_list.nr == 0 || ns->non_common_revs == 0)
|
|
||||||
return NULL;
|
|
||||||
|
|
||||||
commit = prio_queue_get(&ns->rev_list);
|
|
||||||
parse_commit(commit);
|
|
||||||
parents = commit->parents;
|
|
||||||
|
|
||||||
commit->object.flags |= POPPED;
|
|
||||||
if (!(commit->object.flags & COMMON))
|
|
||||||
ns->non_common_revs--;
|
|
||||||
|
|
||||||
if (commit->object.flags & COMMON) {
|
|
||||||
/* do not send "have", and ignore ancestors */
|
|
||||||
commit = NULL;
|
|
||||||
mark = COMMON | SEEN;
|
|
||||||
} else if (commit->object.flags & COMMON_REF)
|
|
||||||
/* send "have", and ignore ancestors */
|
|
||||||
mark = COMMON | SEEN;
|
|
||||||
else
|
|
||||||
/* send "have", also for its ancestors */
|
|
||||||
mark = SEEN;
|
|
||||||
|
|
||||||
while (parents) {
|
|
||||||
if (!(parents->item->object.flags & SEEN))
|
|
||||||
rev_list_push(ns, parents->item, mark);
|
|
||||||
if (mark & COMMON)
|
|
||||||
mark_common(ns, parents->item, 1, 0);
|
|
||||||
parents = parents->next;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return &commit->object.oid;
|
|
||||||
}
|
|
||||||
|
|
||||||
enum ack_type {
|
enum ack_type {
|
||||||
NAK = 0,
|
NAK = 0,
|
||||||
ACK,
|
ACK,
|
||||||
|
@ -306,10 +187,10 @@ static void send_request(struct fetch_pack_args *args,
|
||||||
write_or_die(fd, buf->buf, buf->len);
|
write_or_die(fd, buf->buf, buf->len);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void insert_one_alternate_object(struct negotiation_state *ns,
|
static void insert_one_alternate_object(struct fetch_negotiator *negotiator,
|
||||||
struct object *obj)
|
struct object *obj)
|
||||||
{
|
{
|
||||||
rev_list_insert_ref(ns, NULL, &obj->oid);
|
rev_list_insert_ref(negotiator, NULL, &obj->oid);
|
||||||
}
|
}
|
||||||
|
|
||||||
#define INITIAL_FLUSH 16
|
#define INITIAL_FLUSH 16
|
||||||
|
@ -332,7 +213,7 @@ static int next_flush(int stateless_rpc, int count)
|
||||||
return count;
|
return count;
|
||||||
}
|
}
|
||||||
|
|
||||||
static int find_common(struct negotiation_state *ns,
|
static int find_common(struct fetch_negotiator *negotiator,
|
||||||
struct fetch_pack_args *args,
|
struct fetch_pack_args *args,
|
||||||
int fd[2], struct object_id *result_oid,
|
int fd[2], struct object_id *result_oid,
|
||||||
struct ref *refs)
|
struct ref *refs)
|
||||||
|
@ -349,8 +230,8 @@ static int find_common(struct negotiation_state *ns,
|
||||||
if (args->stateless_rpc && multi_ack == 1)
|
if (args->stateless_rpc && multi_ack == 1)
|
||||||
die(_("--stateless-rpc requires multi_ack_detailed"));
|
die(_("--stateless-rpc requires multi_ack_detailed"));
|
||||||
|
|
||||||
for_each_ref(rev_list_insert_ref_oid, ns);
|
for_each_ref(rev_list_insert_ref_oid, negotiator);
|
||||||
for_each_cached_alternate(ns, insert_one_alternate_object);
|
for_each_cached_alternate(negotiator, insert_one_alternate_object);
|
||||||
|
|
||||||
fetching = 0;
|
fetching = 0;
|
||||||
for ( ; refs ; refs = refs->next) {
|
for ( ; refs ; refs = refs->next) {
|
||||||
|
@ -468,7 +349,7 @@ static int find_common(struct negotiation_state *ns,
|
||||||
retval = -1;
|
retval = -1;
|
||||||
if (args->no_dependents)
|
if (args->no_dependents)
|
||||||
goto done;
|
goto done;
|
||||||
while ((oid = get_rev(ns))) {
|
while ((oid = negotiator->next(negotiator))) {
|
||||||
packet_buf_write(&req_buf, "have %s\n", oid_to_hex(oid));
|
packet_buf_write(&req_buf, "have %s\n", oid_to_hex(oid));
|
||||||
print_verbose(args, "have %s", oid_to_hex(oid));
|
print_verbose(args, "have %s", oid_to_hex(oid));
|
||||||
in_vain++;
|
in_vain++;
|
||||||
|
@ -508,8 +389,7 @@ static int find_common(struct negotiation_state *ns,
|
||||||
int was_common;
|
int was_common;
|
||||||
if (!commit)
|
if (!commit)
|
||||||
die(_("invalid commit %s"), oid_to_hex(result_oid));
|
die(_("invalid commit %s"), oid_to_hex(result_oid));
|
||||||
was_common = commit->object.flags & COMMON;
|
was_common = negotiator->ack(negotiator, commit);
|
||||||
mark_common(ns, commit, 0, 1);
|
|
||||||
if (args->stateless_rpc
|
if (args->stateless_rpc
|
||||||
&& ack == ACK_common
|
&& ack == ACK_common
|
||||||
&& !was_common) {
|
&& !was_common) {
|
||||||
|
@ -718,7 +598,7 @@ static void filter_refs(struct fetch_pack_args *args,
|
||||||
*refs = newlist;
|
*refs = newlist;
|
||||||
}
|
}
|
||||||
|
|
||||||
static void mark_alternate_complete(struct negotiation_state *unused,
|
static void mark_alternate_complete(struct fetch_negotiator *unused,
|
||||||
struct object *obj)
|
struct object *obj)
|
||||||
{
|
{
|
||||||
mark_complete(&obj->oid);
|
mark_complete(&obj->oid);
|
||||||
|
@ -756,7 +636,7 @@ static int add_loose_objects_to_set(const struct object_id *oid,
|
||||||
* earliest commit time of the objects in refs that are commits and that we know
|
* earliest commit time of the objects in refs that are commits and that we know
|
||||||
* the commit time of.
|
* the commit time of.
|
||||||
*/
|
*/
|
||||||
static void mark_complete_and_common_ref(struct negotiation_state *ns,
|
static void mark_complete_and_common_ref(struct fetch_negotiator *negotiator,
|
||||||
struct fetch_pack_args *args,
|
struct fetch_pack_args *args,
|
||||||
struct ref **refs)
|
struct ref **refs)
|
||||||
{
|
{
|
||||||
|
@ -825,12 +705,8 @@ static void mark_complete_and_common_ref(struct negotiation_state *ns,
|
||||||
if (!o || o->type != OBJ_COMMIT || !(o->flags & COMPLETE))
|
if (!o || o->type != OBJ_COMMIT || !(o->flags & COMPLETE))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (!(o->flags & SEEN)) {
|
negotiator->known_common(negotiator,
|
||||||
rev_list_push(ns, (struct commit *)o,
|
(struct commit *)o);
|
||||||
COMMON_REF | SEEN);
|
|
||||||
|
|
||||||
mark_common(ns, (struct commit *)o, 1, 1);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1012,7 +888,8 @@ static struct ref *do_fetch_pack(struct fetch_pack_args *args,
|
||||||
struct object_id oid;
|
struct object_id oid;
|
||||||
const char *agent_feature;
|
const char *agent_feature;
|
||||||
int agent_len;
|
int agent_len;
|
||||||
struct negotiation_state ns = { { compare_commits_by_commit_date } };
|
struct fetch_negotiator negotiator;
|
||||||
|
fetch_negotiator_init(&negotiator);
|
||||||
|
|
||||||
sort_ref_list(&ref, ref_compare_name);
|
sort_ref_list(&ref, ref_compare_name);
|
||||||
QSORT(sought, nr_sought, cmp_ref_by_name);
|
QSORT(sought, nr_sought, cmp_ref_by_name);
|
||||||
|
@ -1085,16 +962,13 @@ static struct ref *do_fetch_pack(struct fetch_pack_args *args,
|
||||||
if (!server_supports("deepen-relative") && args->deepen_relative)
|
if (!server_supports("deepen-relative") && args->deepen_relative)
|
||||||
die(_("Server does not support --deepen"));
|
die(_("Server does not support --deepen"));
|
||||||
|
|
||||||
if (marked)
|
mark_complete_and_common_ref(&negotiator, args, &ref);
|
||||||
for_each_ref(clear_marks, NULL);
|
|
||||||
marked = 1;
|
|
||||||
mark_complete_and_common_ref(&ns, args, &ref);
|
|
||||||
filter_refs(args, &ref, sought, nr_sought);
|
filter_refs(args, &ref, sought, nr_sought);
|
||||||
if (everything_local(args, &ref)) {
|
if (everything_local(args, &ref)) {
|
||||||
packet_flush(fd[1]);
|
packet_flush(fd[1]);
|
||||||
goto all_done;
|
goto all_done;
|
||||||
}
|
}
|
||||||
if (find_common(&ns, args, fd, &oid, ref) < 0)
|
if (find_common(&negotiator, args, fd, &oid, ref) < 0)
|
||||||
if (!args->keep_pack)
|
if (!args->keep_pack)
|
||||||
/* When cloning, it is not unusual to have
|
/* When cloning, it is not unusual to have
|
||||||
* no common commit.
|
* no common commit.
|
||||||
|
@ -1114,7 +988,7 @@ static struct ref *do_fetch_pack(struct fetch_pack_args *args,
|
||||||
die(_("git fetch-pack: fetch failed."));
|
die(_("git fetch-pack: fetch failed."));
|
||||||
|
|
||||||
all_done:
|
all_done:
|
||||||
clear_prio_queue(&ns.rev_list);
|
negotiator.release(&negotiator);
|
||||||
return ref;
|
return ref;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1176,14 +1050,15 @@ static void add_common(struct strbuf *req_buf, struct oidset *common)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static int add_haves(struct negotiation_state *ns, struct strbuf *req_buf,
|
static int add_haves(struct fetch_negotiator *negotiator,
|
||||||
|
struct strbuf *req_buf,
|
||||||
int *haves_to_send, int *in_vain)
|
int *haves_to_send, int *in_vain)
|
||||||
{
|
{
|
||||||
int ret = 0;
|
int ret = 0;
|
||||||
int haves_added = 0;
|
int haves_added = 0;
|
||||||
const struct object_id *oid;
|
const struct object_id *oid;
|
||||||
|
|
||||||
while ((oid = get_rev(ns))) {
|
while ((oid = negotiator->next(negotiator))) {
|
||||||
packet_buf_write(req_buf, "have %s\n", oid_to_hex(oid));
|
packet_buf_write(req_buf, "have %s\n", oid_to_hex(oid));
|
||||||
if (++haves_added >= *haves_to_send)
|
if (++haves_added >= *haves_to_send)
|
||||||
break;
|
break;
|
||||||
|
@ -1202,7 +1077,7 @@ static int add_haves(struct negotiation_state *ns, struct strbuf *req_buf,
|
||||||
return ret;
|
return ret;
|
||||||
}
|
}
|
||||||
|
|
||||||
static int send_fetch_request(struct negotiation_state *ns, int fd_out,
|
static int send_fetch_request(struct fetch_negotiator *negotiator, int fd_out,
|
||||||
const struct fetch_pack_args *args,
|
const struct fetch_pack_args *args,
|
||||||
const struct ref *wants, struct oidset *common,
|
const struct ref *wants, struct oidset *common,
|
||||||
int *haves_to_send, int *in_vain)
|
int *haves_to_send, int *in_vain)
|
||||||
|
@ -1259,7 +1134,7 @@ static int send_fetch_request(struct negotiation_state *ns, int fd_out,
|
||||||
add_common(&req_buf, common);
|
add_common(&req_buf, common);
|
||||||
|
|
||||||
/* Add initial haves */
|
/* Add initial haves */
|
||||||
ret = add_haves(ns, &req_buf, haves_to_send, in_vain);
|
ret = add_haves(negotiator, &req_buf, haves_to_send, in_vain);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Send request */
|
/* Send request */
|
||||||
|
@ -1296,7 +1171,7 @@ static int process_section_header(struct packet_reader *reader,
|
||||||
return ret;
|
return ret;
|
||||||
}
|
}
|
||||||
|
|
||||||
static int process_acks(struct negotiation_state *ns,
|
static int process_acks(struct fetch_negotiator *negotiator,
|
||||||
struct packet_reader *reader,
|
struct packet_reader *reader,
|
||||||
struct oidset *common)
|
struct oidset *common)
|
||||||
{
|
{
|
||||||
|
@ -1317,7 +1192,7 @@ static int process_acks(struct negotiation_state *ns,
|
||||||
struct commit *commit;
|
struct commit *commit;
|
||||||
oidset_insert(common, &oid);
|
oidset_insert(common, &oid);
|
||||||
commit = lookup_commit(&oid);
|
commit = lookup_commit(&oid);
|
||||||
mark_common(ns, commit, 0, 1);
|
negotiator->ack(negotiator, commit);
|
||||||
}
|
}
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
@ -1395,7 +1270,8 @@ static struct ref *do_fetch_pack_v2(struct fetch_pack_args *args,
|
||||||
struct packet_reader reader;
|
struct packet_reader reader;
|
||||||
int in_vain = 0;
|
int in_vain = 0;
|
||||||
int haves_to_send = INITIAL_FLUSH;
|
int haves_to_send = INITIAL_FLUSH;
|
||||||
struct negotiation_state ns = { { compare_commits_by_commit_date } };
|
struct fetch_negotiator negotiator;
|
||||||
|
fetch_negotiator_init(&negotiator);
|
||||||
packet_reader_init(&reader, fd[0], NULL, 0,
|
packet_reader_init(&reader, fd[0], NULL, 0,
|
||||||
PACKET_READ_CHOMP_NEWLINE);
|
PACKET_READ_CHOMP_NEWLINE);
|
||||||
|
|
||||||
|
@ -1411,24 +1287,21 @@ static struct ref *do_fetch_pack_v2(struct fetch_pack_args *args,
|
||||||
if (args->depth > 0 || args->deepen_since || args->deepen_not)
|
if (args->depth > 0 || args->deepen_since || args->deepen_not)
|
||||||
args->deepen = 1;
|
args->deepen = 1;
|
||||||
|
|
||||||
if (marked)
|
|
||||||
for_each_ref(clear_marks, NULL);
|
|
||||||
marked = 1;
|
|
||||||
|
|
||||||
/* Filter 'ref' by 'sought' and those that aren't local */
|
/* Filter 'ref' by 'sought' and those that aren't local */
|
||||||
mark_complete_and_common_ref(&ns, args, &ref);
|
mark_complete_and_common_ref(&negotiator, args, &ref);
|
||||||
filter_refs(args, &ref, sought, nr_sought);
|
filter_refs(args, &ref, sought, nr_sought);
|
||||||
if (everything_local(args, &ref))
|
if (everything_local(args, &ref))
|
||||||
state = FETCH_DONE;
|
state = FETCH_DONE;
|
||||||
else
|
else
|
||||||
state = FETCH_SEND_REQUEST;
|
state = FETCH_SEND_REQUEST;
|
||||||
|
|
||||||
for_each_ref(rev_list_insert_ref_oid, &ns);
|
for_each_ref(rev_list_insert_ref_oid, &negotiator);
|
||||||
for_each_cached_alternate(&ns,
|
for_each_cached_alternate(&negotiator,
|
||||||
insert_one_alternate_object);
|
insert_one_alternate_object);
|
||||||
break;
|
break;
|
||||||
case FETCH_SEND_REQUEST:
|
case FETCH_SEND_REQUEST:
|
||||||
if (send_fetch_request(&ns, fd[1], args, ref, &common,
|
if (send_fetch_request(&negotiator, fd[1], args, ref,
|
||||||
|
&common,
|
||||||
&haves_to_send, &in_vain))
|
&haves_to_send, &in_vain))
|
||||||
state = FETCH_GET_PACK;
|
state = FETCH_GET_PACK;
|
||||||
else
|
else
|
||||||
|
@ -1436,7 +1309,7 @@ static struct ref *do_fetch_pack_v2(struct fetch_pack_args *args,
|
||||||
break;
|
break;
|
||||||
case FETCH_PROCESS_ACKS:
|
case FETCH_PROCESS_ACKS:
|
||||||
/* Process ACKs/NAKs */
|
/* Process ACKs/NAKs */
|
||||||
switch (process_acks(&ns, &reader, &common)) {
|
switch (process_acks(&negotiator, &reader, &common)) {
|
||||||
case 2:
|
case 2:
|
||||||
state = FETCH_GET_PACK;
|
state = FETCH_GET_PACK;
|
||||||
break;
|
break;
|
||||||
|
@ -1465,7 +1338,7 @@ static struct ref *do_fetch_pack_v2(struct fetch_pack_args *args,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
clear_prio_queue(&ns.rev_list);
|
negotiator.release(&negotiator);
|
||||||
oidset_clear(&common);
|
oidset_clear(&common);
|
||||||
return ref;
|
return ref;
|
||||||
}
|
}
|
||||||
|
|
|
@ -0,0 +1,176 @@
|
||||||
|
#include "cache.h"
|
||||||
|
#include "default.h"
|
||||||
|
#include "../commit.h"
|
||||||
|
#include "../fetch-negotiator.h"
|
||||||
|
#include "../prio-queue.h"
|
||||||
|
#include "../refs.h"
|
||||||
|
#include "../tag.h"
|
||||||
|
|
||||||
|
/* Remember to update object flag allocation in object.h */
|
||||||
|
#define COMMON (1U << 2)
|
||||||
|
#define COMMON_REF (1U << 3)
|
||||||
|
#define SEEN (1U << 4)
|
||||||
|
#define POPPED (1U << 5)
|
||||||
|
|
||||||
|
static int marked;
|
||||||
|
|
||||||
|
struct negotiation_state {
|
||||||
|
struct prio_queue rev_list;
|
||||||
|
int non_common_revs;
|
||||||
|
};
|
||||||
|
|
||||||
|
static void rev_list_push(struct negotiation_state *ns,
|
||||||
|
struct commit *commit, int mark)
|
||||||
|
{
|
||||||
|
if (!(commit->object.flags & mark)) {
|
||||||
|
commit->object.flags |= mark;
|
||||||
|
|
||||||
|
if (parse_commit(commit))
|
||||||
|
return;
|
||||||
|
|
||||||
|
prio_queue_put(&ns->rev_list, commit);
|
||||||
|
|
||||||
|
if (!(commit->object.flags & COMMON))
|
||||||
|
ns->non_common_revs++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static int clear_marks(const char *refname, const struct object_id *oid,
|
||||||
|
int flag, void *cb_data)
|
||||||
|
{
|
||||||
|
struct object *o = deref_tag(parse_object(oid), refname, 0);
|
||||||
|
|
||||||
|
if (o && o->type == OBJ_COMMIT)
|
||||||
|
clear_commit_marks((struct commit *)o,
|
||||||
|
COMMON | COMMON_REF | SEEN | POPPED);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This function marks a rev and its ancestors as common.
|
||||||
|
* In some cases, it is desirable to mark only the ancestors (for example
|
||||||
|
* when only the server does not yet know that they are common).
|
||||||
|
*/
|
||||||
|
static void mark_common(struct negotiation_state *ns, struct commit *commit,
|
||||||
|
int ancestors_only, int dont_parse)
|
||||||
|
{
|
||||||
|
if (commit != NULL && !(commit->object.flags & COMMON)) {
|
||||||
|
struct object *o = (struct object *)commit;
|
||||||
|
|
||||||
|
if (!ancestors_only)
|
||||||
|
o->flags |= COMMON;
|
||||||
|
|
||||||
|
if (!(o->flags & SEEN))
|
||||||
|
rev_list_push(ns, commit, SEEN);
|
||||||
|
else {
|
||||||
|
struct commit_list *parents;
|
||||||
|
|
||||||
|
if (!ancestors_only && !(o->flags & POPPED))
|
||||||
|
ns->non_common_revs--;
|
||||||
|
if (!o->parsed && !dont_parse)
|
||||||
|
if (parse_commit(commit))
|
||||||
|
return;
|
||||||
|
|
||||||
|
for (parents = commit->parents;
|
||||||
|
parents;
|
||||||
|
parents = parents->next)
|
||||||
|
mark_common(ns, parents->item, 0,
|
||||||
|
dont_parse);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Get the next rev to send, ignoring the common.
|
||||||
|
*/
|
||||||
|
static const struct object_id *get_rev(struct negotiation_state *ns)
|
||||||
|
{
|
||||||
|
struct commit *commit = NULL;
|
||||||
|
|
||||||
|
while (commit == NULL) {
|
||||||
|
unsigned int mark;
|
||||||
|
struct commit_list *parents;
|
||||||
|
|
||||||
|
if (ns->rev_list.nr == 0 || ns->non_common_revs == 0)
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
commit = prio_queue_get(&ns->rev_list);
|
||||||
|
parse_commit(commit);
|
||||||
|
parents = commit->parents;
|
||||||
|
|
||||||
|
commit->object.flags |= POPPED;
|
||||||
|
if (!(commit->object.flags & COMMON))
|
||||||
|
ns->non_common_revs--;
|
||||||
|
|
||||||
|
if (commit->object.flags & COMMON) {
|
||||||
|
/* do not send "have", and ignore ancestors */
|
||||||
|
commit = NULL;
|
||||||
|
mark = COMMON | SEEN;
|
||||||
|
} else if (commit->object.flags & COMMON_REF)
|
||||||
|
/* send "have", and ignore ancestors */
|
||||||
|
mark = COMMON | SEEN;
|
||||||
|
else
|
||||||
|
/* send "have", also for its ancestors */
|
||||||
|
mark = SEEN;
|
||||||
|
|
||||||
|
while (parents) {
|
||||||
|
if (!(parents->item->object.flags & SEEN))
|
||||||
|
rev_list_push(ns, parents->item, mark);
|
||||||
|
if (mark & COMMON)
|
||||||
|
mark_common(ns, parents->item, 1, 0);
|
||||||
|
parents = parents->next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return &commit->object.oid;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void known_common(struct fetch_negotiator *n, struct commit *c)
|
||||||
|
{
|
||||||
|
if (!(c->object.flags & SEEN)) {
|
||||||
|
rev_list_push(n->data, c, COMMON_REF | SEEN);
|
||||||
|
mark_common(n->data, c, 1, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void add_tip(struct fetch_negotiator *n, struct commit *c)
|
||||||
|
{
|
||||||
|
n->known_common = NULL;
|
||||||
|
rev_list_push(n->data, c, SEEN);
|
||||||
|
}
|
||||||
|
|
||||||
|
static const struct object_id *next(struct fetch_negotiator *n)
|
||||||
|
{
|
||||||
|
n->known_common = NULL;
|
||||||
|
n->add_tip = NULL;
|
||||||
|
return get_rev(n->data);
|
||||||
|
}
|
||||||
|
|
||||||
|
static int ack(struct fetch_negotiator *n, struct commit *c)
|
||||||
|
{
|
||||||
|
int known_to_be_common = !!(c->object.flags & COMMON);
|
||||||
|
mark_common(n->data, c, 0, 1);
|
||||||
|
return known_to_be_common;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void release(struct fetch_negotiator *n)
|
||||||
|
{
|
||||||
|
clear_prio_queue(&((struct negotiation_state *)n->data)->rev_list);
|
||||||
|
FREE_AND_NULL(n->data);
|
||||||
|
}
|
||||||
|
|
||||||
|
void default_negotiator_init(struct fetch_negotiator *negotiator)
|
||||||
|
{
|
||||||
|
struct negotiation_state *ns;
|
||||||
|
negotiator->known_common = known_common;
|
||||||
|
negotiator->add_tip = add_tip;
|
||||||
|
negotiator->next = next;
|
||||||
|
negotiator->ack = ack;
|
||||||
|
negotiator->release = release;
|
||||||
|
negotiator->data = ns = xcalloc(1, sizeof(*ns));
|
||||||
|
ns->rev_list.compare = compare_commits_by_commit_date;
|
||||||
|
|
||||||
|
if (marked)
|
||||||
|
for_each_ref(clear_marks, NULL);
|
||||||
|
marked = 1;
|
||||||
|
}
|
|
@ -0,0 +1,8 @@
|
||||||
|
#ifndef NEGOTIATOR_DEFAULT_H
|
||||||
|
#define NEGOTIATOR_DEFAULT_H
|
||||||
|
|
||||||
|
struct fetch_negotiator;
|
||||||
|
|
||||||
|
void default_negotiator_init(struct fetch_negotiator *negotiator);
|
||||||
|
|
||||||
|
#endif
|
3
object.h
3
object.h
|
@ -28,7 +28,8 @@ struct object_array {
|
||||||
/*
|
/*
|
||||||
* object flag allocation:
|
* object flag allocation:
|
||||||
* revision.h: 0---------10 26
|
* revision.h: 0---------10 26
|
||||||
* fetch-pack.c: 0----5
|
* fetch-pack.c: 01
|
||||||
|
* negotiator/default.c: 2--5
|
||||||
* walker.c: 0-2
|
* walker.c: 0-2
|
||||||
* upload-pack.c: 4 11----------------19
|
* upload-pack.c: 4 11----------------19
|
||||||
* builtin/blame.c: 12-13
|
* builtin/blame.c: 12-13
|
||||||
|
|
Loading…
Reference in New Issue