2012-10-26 23:53:55 +08:00
|
|
|
#include "cache.h"
|
2017-06-15 02:07:36 +08:00
|
|
|
#include "config.h"
|
2014-10-01 18:28:42 +08:00
|
|
|
#include "lockfile.h"
|
2012-10-26 23:53:55 +08:00
|
|
|
#include "refs.h"
|
|
|
|
|
#include "pkt-line.h"
|
|
|
|
|
#include "commit.h"
|
|
|
|
|
#include "tag.h"
|
|
|
|
|
#include "exec_cmd.h"
|
|
|
|
|
#include "pack.h"
|
|
|
|
|
#include "sideband.h"
|
|
|
|
|
#include "fetch-pack.h"
|
|
|
|
|
#include "remote.h"
|
|
|
|
|
#include "run-command.h"
|
2013-07-09 04:56:53 +08:00
|
|
|
#include "connect.h"
|
2012-10-26 23:53:55 +08:00
|
|
|
#include "transport.h"
|
|
|
|
|
#include "version.h"
|
fetch-pack: avoid quadratic behavior in rev_list_push
When we call find_common to start finding common ancestors
with the remote side of a fetch, the first thing we do is
insert the tip of each ref into our rev_list linked list. We
keep the list sorted the whole time with
commit_list_insert_by_date, which means our insertion ends
up doing O(n^2) timestamp comparisons.
We could teach rev_list_push to use an unsorted list, and
then sort it once after we have added each ref. However, in
get_rev, we process the list by popping commits off the
front and adding parents back in timestamp-sorted order. So
that procedure would still operate on the large list.
Instead, we can replace the linked list with a heap-based
priority queue, which can do O(log n) insertion, making the
whole insertion procedure O(n log n).
As a result of switching to the prio_queue struct, we fix
two minor bugs:
1. When we "pop" a commit in get_rev, and when we clear
the rev_list in find_common, we do not take care to
free the "struct commit_list", and just leak its
memory. With the prio_queue implementation, the memory
management is handled for us.
2. In get_rev, we look at the head commit of the list,
possibly push its parents onto the list, and then "pop"
the front of the list off, assuming it is the same
element that we just peeked at. This is typically going
to be the case, but would not be in the face of clock
skew: the parents are inserted by date, and could
potentially be inserted at the head of the list if they
have a timestamp newer than their descendent. In this
case, we would accidentally pop the parent, and never
process it at all.
The new implementation pulls the commit off of the
queue as we examine it, and so does not suffer from
this problem.
With this patch, a fetch of a single commit into a
repository with 50,000 refs went from:
real 0m7.984s
user 0m7.852s
sys 0m0.120s
to:
real 0m2.017s
user 0m1.884s
sys 0m0.124s
Before this patch, a larger case with 370K refs still had
not completed after tens of minutes; with this patch, it
completes in about 12 seconds.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:24:21 +08:00
|
|
|
#include "prio-queue.h"
|
2013-12-05 21:02:39 +08:00
|
|
|
#include "sha1-array.h"
|
2017-05-16 01:32:20 +08:00
|
|
|
#include "oidset.h"
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
static int transfer_unpack_limit = -1;
|
|
|
|
|
static int fetch_unpack_limit = -1;
|
|
|
|
|
static int unpack_limit = 100;
|
|
|
|
|
static int prefer_ofs_delta = 1;
|
|
|
|
|
static int no_done;
|
2016-06-12 18:53:59 +08:00
|
|
|
static int deepen_since_ok;
|
2016-06-12 18:54:04 +08:00
|
|
|
static int deepen_not_ok;
|
2012-10-26 23:53:55 +08:00
|
|
|
static int fetch_fsck_objects = -1;
|
|
|
|
|
static int transfer_fsck_objects = -1;
|
|
|
|
|
static int agent_supported;
|
2013-05-26 09:16:15 +08:00
|
|
|
static struct lock_file shallow_lock;
|
|
|
|
|
static const char *alternate_shallow_file;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
2014-03-25 21:23:26 +08:00
|
|
|
/* Remember to update object flag allocation in object.h */
|
2012-10-26 23:53:55 +08:00
|
|
|
#define COMPLETE (1U << 0)
|
|
|
|
|
#define COMMON (1U << 1)
|
|
|
|
|
#define COMMON_REF (1U << 2)
|
|
|
|
|
#define SEEN (1U << 3)
|
|
|
|
|
#define POPPED (1U << 4)
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
#define ALTERNATE (1U << 5)
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
static int marked;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* After sending this many "have"s if we do not get any new ACK , we
|
|
|
|
|
* give up traversing our history.
|
|
|
|
|
*/
|
|
|
|
|
#define MAX_IN_VAIN 256
|
|
|
|
|
|
fetch-pack: avoid quadratic behavior in rev_list_push
When we call find_common to start finding common ancestors
with the remote side of a fetch, the first thing we do is
insert the tip of each ref into our rev_list linked list. We
keep the list sorted the whole time with
commit_list_insert_by_date, which means our insertion ends
up doing O(n^2) timestamp comparisons.
We could teach rev_list_push to use an unsorted list, and
then sort it once after we have added each ref. However, in
get_rev, we process the list by popping commits off the
front and adding parents back in timestamp-sorted order. So
that procedure would still operate on the large list.
Instead, we can replace the linked list with a heap-based
priority queue, which can do O(log n) insertion, making the
whole insertion procedure O(n log n).
As a result of switching to the prio_queue struct, we fix
two minor bugs:
1. When we "pop" a commit in get_rev, and when we clear
the rev_list in find_common, we do not take care to
free the "struct commit_list", and just leak its
memory. With the prio_queue implementation, the memory
management is handled for us.
2. In get_rev, we look at the head commit of the list,
possibly push its parents onto the list, and then "pop"
the front of the list off, assuming it is the same
element that we just peeked at. This is typically going
to be the case, but would not be in the face of clock
skew: the parents are inserted by date, and could
potentially be inserted at the head of the list if they
have a timestamp newer than their descendent. In this
case, we would accidentally pop the parent, and never
process it at all.
The new implementation pulls the commit off of the
queue as we examine it, and so does not suffer from
this problem.
With this patch, a fetch of a single commit into a
repository with 50,000 refs went from:
real 0m7.984s
user 0m7.852s
sys 0m0.120s
to:
real 0m2.017s
user 0m1.884s
sys 0m0.124s
Before this patch, a larger case with 370K refs still had
not completed after tens of minutes; with this patch, it
completes in about 12 seconds.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:24:21 +08:00
|
|
|
static struct prio_queue rev_list = { compare_commits_by_commit_date };
|
2015-05-22 04:23:38 +08:00
|
|
|
static int non_common_revs, multi_ack, use_sideband;
|
|
|
|
|
/* Allow specifying sha1 if it is a ref tip. */
|
|
|
|
|
#define ALLOW_TIP_SHA1 01
|
2015-05-22 04:23:39 +08:00
|
|
|
/* Allow request of a sha1 if it is reachable from a ref (possibly hidden ref). */
|
|
|
|
|
#define ALLOW_REACHABLE_SHA1 02
|
2015-05-22 04:23:38 +08:00
|
|
|
static unsigned int allow_unadvertised_object_request;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
2016-06-12 18:53:54 +08:00
|
|
|
__attribute__((format (printf, 2, 3)))
|
|
|
|
|
static inline void print_verbose(const struct fetch_pack_args *args,
|
|
|
|
|
const char *fmt, ...)
|
|
|
|
|
{
|
|
|
|
|
va_list params;
|
|
|
|
|
|
|
|
|
|
if (!args->verbose)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
va_start(params, fmt);
|
|
|
|
|
vfprintf(stderr, fmt, params);
|
|
|
|
|
va_end(params);
|
|
|
|
|
fputc('\n', stderr);
|
|
|
|
|
}
|
|
|
|
|
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
struct alternate_object_cache {
|
|
|
|
|
struct object **items;
|
|
|
|
|
size_t nr, alloc;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static void cache_one_alternate(const char *refname,
|
|
|
|
|
const struct object_id *oid,
|
|
|
|
|
void *vcache)
|
|
|
|
|
{
|
|
|
|
|
struct alternate_object_cache *cache = vcache;
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
struct object *obj = parse_object(oid);
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
|
|
|
|
|
if (!obj || (obj->flags & ALTERNATE))
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
obj->flags |= ALTERNATE;
|
|
|
|
|
ALLOC_GROW(cache->items, cache->nr + 1, cache->alloc);
|
|
|
|
|
cache->items[cache->nr++] = obj;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void for_each_cached_alternate(void (*cb)(struct object *))
|
|
|
|
|
{
|
|
|
|
|
static int initialized;
|
|
|
|
|
static struct alternate_object_cache cache;
|
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
|
|
if (!initialized) {
|
|
|
|
|
for_each_alternate_ref(cache_one_alternate, &cache);
|
|
|
|
|
initialized = 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < cache.nr; i++)
|
|
|
|
|
cb(cache.items[i]);
|
|
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
static void rev_list_push(struct commit *commit, int mark)
|
|
|
|
|
{
|
|
|
|
|
if (!(commit->object.flags & mark)) {
|
|
|
|
|
commit->object.flags |= mark;
|
|
|
|
|
|
2013-10-24 16:53:01 +08:00
|
|
|
if (parse_commit(commit))
|
|
|
|
|
return;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
fetch-pack: avoid quadratic behavior in rev_list_push
When we call find_common to start finding common ancestors
with the remote side of a fetch, the first thing we do is
insert the tip of each ref into our rev_list linked list. We
keep the list sorted the whole time with
commit_list_insert_by_date, which means our insertion ends
up doing O(n^2) timestamp comparisons.
We could teach rev_list_push to use an unsorted list, and
then sort it once after we have added each ref. However, in
get_rev, we process the list by popping commits off the
front and adding parents back in timestamp-sorted order. So
that procedure would still operate on the large list.
Instead, we can replace the linked list with a heap-based
priority queue, which can do O(log n) insertion, making the
whole insertion procedure O(n log n).
As a result of switching to the prio_queue struct, we fix
two minor bugs:
1. When we "pop" a commit in get_rev, and when we clear
the rev_list in find_common, we do not take care to
free the "struct commit_list", and just leak its
memory. With the prio_queue implementation, the memory
management is handled for us.
2. In get_rev, we look at the head commit of the list,
possibly push its parents onto the list, and then "pop"
the front of the list off, assuming it is the same
element that we just peeked at. This is typically going
to be the case, but would not be in the face of clock
skew: the parents are inserted by date, and could
potentially be inserted at the head of the list if they
have a timestamp newer than their descendent. In this
case, we would accidentally pop the parent, and never
process it at all.
The new implementation pulls the commit off of the
queue as we examine it, and so does not suffer from
this problem.
With this patch, a fetch of a single commit into a
repository with 50,000 refs went from:
real 0m7.984s
user 0m7.852s
sys 0m0.120s
to:
real 0m2.017s
user 0m1.884s
sys 0m0.124s
Before this patch, a larger case with 370K refs still had
not completed after tens of minutes; with this patch, it
completes in about 12 seconds.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:24:21 +08:00
|
|
|
prio_queue_put(&rev_list, commit);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
if (!(commit->object.flags & COMMON))
|
|
|
|
|
non_common_revs++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
static int rev_list_insert_ref(const char *refname, const struct object_id *oid)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
struct object *o = deref_tag(parse_object(oid), refname, 0);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
if (o && o->type == OBJ_COMMIT)
|
|
|
|
|
rev_list_push((struct commit *)o, SEEN);
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2015-05-26 02:39:18 +08:00
|
|
|
static int rev_list_insert_ref_oid(const char *refname, const struct object_id *oid,
|
|
|
|
|
int flag, void *cb_data)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
2017-05-01 10:28:54 +08:00
|
|
|
return rev_list_insert_ref(refname, oid);
|
2015-05-26 02:39:18 +08:00
|
|
|
}
|
|
|
|
|
|
2015-05-26 02:39:15 +08:00
|
|
|
static int clear_marks(const char *refname, const struct object_id *oid,
|
|
|
|
|
int flag, void *cb_data)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
struct object *o = deref_tag(parse_object(oid), refname, 0);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
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 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(commit, SEEN);
|
|
|
|
|
else {
|
|
|
|
|
struct commit_list *parents;
|
|
|
|
|
|
|
|
|
|
if (!ancestors_only && !(o->flags & POPPED))
|
|
|
|
|
non_common_revs--;
|
|
|
|
|
if (!o->parsed && !dont_parse)
|
|
|
|
|
if (parse_commit(commit))
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
for (parents = commit->parents;
|
|
|
|
|
parents;
|
|
|
|
|
parents = parents->next)
|
|
|
|
|
mark_common(parents->item, 0, dont_parse);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
Get the next rev to send, ignoring the common.
|
|
|
|
|
*/
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
static const struct object_id *get_rev(void)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
|
|
|
|
struct commit *commit = NULL;
|
|
|
|
|
|
|
|
|
|
while (commit == NULL) {
|
|
|
|
|
unsigned int mark;
|
|
|
|
|
struct commit_list *parents;
|
|
|
|
|
|
fetch-pack: avoid quadratic behavior in rev_list_push
When we call find_common to start finding common ancestors
with the remote side of a fetch, the first thing we do is
insert the tip of each ref into our rev_list linked list. We
keep the list sorted the whole time with
commit_list_insert_by_date, which means our insertion ends
up doing O(n^2) timestamp comparisons.
We could teach rev_list_push to use an unsorted list, and
then sort it once after we have added each ref. However, in
get_rev, we process the list by popping commits off the
front and adding parents back in timestamp-sorted order. So
that procedure would still operate on the large list.
Instead, we can replace the linked list with a heap-based
priority queue, which can do O(log n) insertion, making the
whole insertion procedure O(n log n).
As a result of switching to the prio_queue struct, we fix
two minor bugs:
1. When we "pop" a commit in get_rev, and when we clear
the rev_list in find_common, we do not take care to
free the "struct commit_list", and just leak its
memory. With the prio_queue implementation, the memory
management is handled for us.
2. In get_rev, we look at the head commit of the list,
possibly push its parents onto the list, and then "pop"
the front of the list off, assuming it is the same
element that we just peeked at. This is typically going
to be the case, but would not be in the face of clock
skew: the parents are inserted by date, and could
potentially be inserted at the head of the list if they
have a timestamp newer than their descendent. In this
case, we would accidentally pop the parent, and never
process it at all.
The new implementation pulls the commit off of the
queue as we examine it, and so does not suffer from
this problem.
With this patch, a fetch of a single commit into a
repository with 50,000 refs went from:
real 0m7.984s
user 0m7.852s
sys 0m0.120s
to:
real 0m2.017s
user 0m1.884s
sys 0m0.124s
Before this patch, a larger case with 370K refs still had
not completed after tens of minutes; with this patch, it
completes in about 12 seconds.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:24:21 +08:00
|
|
|
if (rev_list.nr == 0 || non_common_revs == 0)
|
2012-10-26 23:53:55 +08:00
|
|
|
return NULL;
|
|
|
|
|
|
fetch-pack: avoid quadratic behavior in rev_list_push
When we call find_common to start finding common ancestors
with the remote side of a fetch, the first thing we do is
insert the tip of each ref into our rev_list linked list. We
keep the list sorted the whole time with
commit_list_insert_by_date, which means our insertion ends
up doing O(n^2) timestamp comparisons.
We could teach rev_list_push to use an unsorted list, and
then sort it once after we have added each ref. However, in
get_rev, we process the list by popping commits off the
front and adding parents back in timestamp-sorted order. So
that procedure would still operate on the large list.
Instead, we can replace the linked list with a heap-based
priority queue, which can do O(log n) insertion, making the
whole insertion procedure O(n log n).
As a result of switching to the prio_queue struct, we fix
two minor bugs:
1. When we "pop" a commit in get_rev, and when we clear
the rev_list in find_common, we do not take care to
free the "struct commit_list", and just leak its
memory. With the prio_queue implementation, the memory
management is handled for us.
2. In get_rev, we look at the head commit of the list,
possibly push its parents onto the list, and then "pop"
the front of the list off, assuming it is the same
element that we just peeked at. This is typically going
to be the case, but would not be in the face of clock
skew: the parents are inserted by date, and could
potentially be inserted at the head of the list if they
have a timestamp newer than their descendent. In this
case, we would accidentally pop the parent, and never
process it at all.
The new implementation pulls the commit off of the
queue as we examine it, and so does not suffer from
this problem.
With this patch, a fetch of a single commit into a
repository with 50,000 refs went from:
real 0m7.984s
user 0m7.852s
sys 0m0.120s
to:
real 0m2.017s
user 0m1.884s
sys 0m0.124s
Before this patch, a larger case with 370K refs still had
not completed after tens of minutes; with this patch, it
completes in about 12 seconds.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:24:21 +08:00
|
|
|
commit = prio_queue_get(&rev_list);
|
2013-10-24 16:53:01 +08:00
|
|
|
parse_commit(commit);
|
2012-10-26 23:53:55 +08:00
|
|
|
parents = commit->parents;
|
|
|
|
|
|
|
|
|
|
commit->object.flags |= POPPED;
|
|
|
|
|
if (!(commit->object.flags & COMMON))
|
|
|
|
|
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(parents->item, mark);
|
|
|
|
|
if (mark & COMMON)
|
|
|
|
|
mark_common(parents->item, 1, 0);
|
|
|
|
|
parents = parents->next;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
return &commit->object.oid;
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
enum ack_type {
|
|
|
|
|
NAK = 0,
|
|
|
|
|
ACK,
|
|
|
|
|
ACK_continue,
|
|
|
|
|
ACK_common,
|
|
|
|
|
ACK_ready
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static void consume_shallow_list(struct fetch_pack_args *args, int fd)
|
|
|
|
|
{
|
2016-06-12 18:53:56 +08:00
|
|
|
if (args->stateless_rpc && args->deepen) {
|
2012-10-26 23:53:55 +08:00
|
|
|
/* If we sent a depth we will get back "duplicate"
|
|
|
|
|
* shallow and unshallow commands every time there
|
|
|
|
|
* is a block of have lines exchanged.
|
|
|
|
|
*/
|
pkt-line: provide a LARGE_PACKET_MAX static buffer
Most of the callers of packet_read_line just read into a
static 1000-byte buffer (callers which handle arbitrary
binary data already use LARGE_PACKET_MAX). This works fine
in practice, because:
1. The only variable-sized data in these lines is a ref
name, and refs tend to be a lot shorter than 1000
characters.
2. When sending ref lines, git-core always limits itself
to 1000 byte packets.
However, the only limit given in the protocol specification
in Documentation/technical/protocol-common.txt is
LARGE_PACKET_MAX; the 1000 byte limit is mentioned only in
pack-protocol.txt, and then only describing what we write,
not as a specific limit for readers.
This patch lets us bump the 1000-byte limit to
LARGE_PACKET_MAX. Even though git-core will never write a
packet where this makes a difference, there are two good
reasons to do this:
1. Other git implementations may have followed
protocol-common.txt and used a larger maximum size. We
don't bump into it in practice because it would involve
very long ref names.
2. We may want to increase the 1000-byte limit one day.
Since packets are transferred before any capabilities,
it's difficult to do this in a backwards-compatible
way. But if we bump the size of buffer the readers can
handle, eventually older versions of git will be
obsolete enough that we can justify bumping the
writers, as well. We don't have plans to do this
anytime soon, but there is no reason not to start the
clock ticking now.
Just bumping all of the reading bufs to LARGE_PACKET_MAX
would waste memory. Instead, since most readers just read
into a temporary buffer anyway, let's provide a single
static buffer that all callers can use. We can further wrap
this detail away by having the packet_read_line wrapper just
use the buffer transparently and return a pointer to the
static storage. That covers most of the cases, and the
remaining ones already read into their own LARGE_PACKET_MAX
buffers.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-02-21 04:02:57 +08:00
|
|
|
char *line;
|
|
|
|
|
while ((line = packet_read_line(fd, NULL))) {
|
2013-12-01 04:55:40 +08:00
|
|
|
if (starts_with(line, "shallow "))
|
2012-10-26 23:53:55 +08:00
|
|
|
continue;
|
2013-12-01 04:55:40 +08:00
|
|
|
if (starts_with(line, "unshallow "))
|
2012-10-26 23:53:55 +08:00
|
|
|
continue;
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("git fetch-pack: expected shallow list"));
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
static enum ack_type get_ack(int fd, struct object_id *result_oid)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
pkt-line: provide a LARGE_PACKET_MAX static buffer
Most of the callers of packet_read_line just read into a
static 1000-byte buffer (callers which handle arbitrary
binary data already use LARGE_PACKET_MAX). This works fine
in practice, because:
1. The only variable-sized data in these lines is a ref
name, and refs tend to be a lot shorter than 1000
characters.
2. When sending ref lines, git-core always limits itself
to 1000 byte packets.
However, the only limit given in the protocol specification
in Documentation/technical/protocol-common.txt is
LARGE_PACKET_MAX; the 1000 byte limit is mentioned only in
pack-protocol.txt, and then only describing what we write,
not as a specific limit for readers.
This patch lets us bump the 1000-byte limit to
LARGE_PACKET_MAX. Even though git-core will never write a
packet where this makes a difference, there are two good
reasons to do this:
1. Other git implementations may have followed
protocol-common.txt and used a larger maximum size. We
don't bump into it in practice because it would involve
very long ref names.
2. We may want to increase the 1000-byte limit one day.
Since packets are transferred before any capabilities,
it's difficult to do this in a backwards-compatible
way. But if we bump the size of buffer the readers can
handle, eventually older versions of git will be
obsolete enough that we can justify bumping the
writers, as well. We don't have plans to do this
anytime soon, but there is no reason not to start the
clock ticking now.
Just bumping all of the reading bufs to LARGE_PACKET_MAX
would waste memory. Instead, since most readers just read
into a temporary buffer anyway, let's provide a single
static buffer that all callers can use. We can further wrap
this detail away by having the packet_read_line wrapper just
use the buffer transparently and return a pointer to the
static storage. That covers most of the cases, and the
remaining ones already read into their own LARGE_PACKET_MAX
buffers.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-02-21 04:02:57 +08:00
|
|
|
int len;
|
|
|
|
|
char *line = packet_read_line(fd, &len);
|
2014-06-19 03:56:03 +08:00
|
|
|
const char *arg;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
if (!len)
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("git fetch-pack: expected ACK/NAK, got EOF"));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!strcmp(line, "NAK"))
|
|
|
|
|
return NAK;
|
2014-06-19 03:56:03 +08:00
|
|
|
if (skip_prefix(line, "ACK ", &arg)) {
|
2017-05-01 10:28:54 +08:00
|
|
|
if (!get_oid_hex(arg, result_oid)) {
|
2014-06-19 03:56:03 +08:00
|
|
|
arg += 40;
|
|
|
|
|
len -= arg - line;
|
|
|
|
|
if (len < 1)
|
fetch-pack: fix out-of-bounds buffer offset in get_ack
When we read acks from the remote, we expect either:
ACK <sha1>
or
ACK <sha1> <multi-ack-flag>
We parse the "ACK <sha1>" bit from the line, and then start
looking for the flag strings at "line+45"; if we don't have
them, we assume it's of the first type. But if we do have
the first type, then line+45 is not necessarily inside our
string at all!
It turns out that this works most of the time due to the way
we parse the packets. They should come in with a newline,
and packet_read puts an extra NUL into the buffer, so we end
up with:
ACK <sha1>\n\0
with the newline at offset 44 and the NUL at offset 45. We
then strip the newline, putting a NUL at offset 44. So
when we look at "line+45", we are looking past the end of
our string; but it's OK, because we hit the terminator from
the original string.
This breaks down, however, if the other side does not
terminate their packets with a newline. In that case, our
packet is one character shorter, and we start looking
through uninitialized memory for the flag. No known
implementation sends such a packet, so it has never come up
in practice.
This patch tightens the check by looking for a short,
flagless ACK before trying to parse the flag.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-02-21 04:00:28 +08:00
|
|
|
return ACK;
|
2014-06-19 03:56:03 +08:00
|
|
|
if (strstr(arg, "continue"))
|
2012-10-26 23:53:55 +08:00
|
|
|
return ACK_continue;
|
2014-06-19 03:56:03 +08:00
|
|
|
if (strstr(arg, "common"))
|
2012-10-26 23:53:55 +08:00
|
|
|
return ACK_common;
|
2014-06-19 03:56:03 +08:00
|
|
|
if (strstr(arg, "ready"))
|
2012-10-26 23:53:55 +08:00
|
|
|
return ACK_ready;
|
|
|
|
|
return ACK;
|
|
|
|
|
}
|
|
|
|
|
}
|
2017-04-13 02:06:02 +08:00
|
|
|
if (skip_prefix(line, "ERR ", &arg))
|
|
|
|
|
die(_("remote error: %s"), arg);
|
2016-11-12 01:21:00 +08:00
|
|
|
die(_("git fetch-pack: expected ACK/NAK, got '%s'"), line);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void send_request(struct fetch_pack_args *args,
|
|
|
|
|
int fd, struct strbuf *buf)
|
|
|
|
|
{
|
|
|
|
|
if (args->stateless_rpc) {
|
|
|
|
|
send_sideband(fd, -1, buf->buf, buf->len, LARGE_PACKET_MAX);
|
|
|
|
|
packet_flush(fd);
|
|
|
|
|
} else
|
2013-02-21 04:01:56 +08:00
|
|
|
write_or_die(fd, buf->buf, buf->len);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
static void insert_one_alternate_object(struct object *obj)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
2017-05-01 10:28:54 +08:00
|
|
|
rev_list_insert_ref(NULL, &obj->oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define INITIAL_FLUSH 16
|
|
|
|
|
#define PIPESAFE_FLUSH 32
|
2016-07-19 06:21:38 +08:00
|
|
|
#define LARGE_FLUSH 16384
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
static int next_flush(struct fetch_pack_args *args, int count)
|
|
|
|
|
{
|
2016-07-19 06:21:38 +08:00
|
|
|
if (args->stateless_rpc) {
|
|
|
|
|
if (count < LARGE_FLUSH)
|
|
|
|
|
count <<= 1;
|
|
|
|
|
else
|
|
|
|
|
count = count * 11 / 10;
|
|
|
|
|
} else {
|
|
|
|
|
if (count < PIPESAFE_FLUSH)
|
|
|
|
|
count <<= 1;
|
|
|
|
|
else
|
|
|
|
|
count += PIPESAFE_FLUSH;
|
|
|
|
|
}
|
2012-10-26 23:53:55 +08:00
|
|
|
return count;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int find_common(struct fetch_pack_args *args,
|
2017-05-01 10:28:54 +08:00
|
|
|
int fd[2], struct object_id *result_oid,
|
2012-10-26 23:53:55 +08:00
|
|
|
struct ref *refs)
|
|
|
|
|
{
|
|
|
|
|
int fetching;
|
|
|
|
|
int count = 0, flushes = 0, flush_at = INITIAL_FLUSH, retval;
|
2017-05-01 10:28:54 +08:00
|
|
|
const struct object_id *oid;
|
2012-10-26 23:53:55 +08:00
|
|
|
unsigned in_vain = 0;
|
|
|
|
|
int got_continue = 0;
|
|
|
|
|
int got_ready = 0;
|
|
|
|
|
struct strbuf req_buf = STRBUF_INIT;
|
|
|
|
|
size_t state_len = 0;
|
|
|
|
|
|
|
|
|
|
if (args->stateless_rpc && multi_ack == 1)
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("--stateless-rpc requires multi_ack_detailed"));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (marked)
|
|
|
|
|
for_each_ref(clear_marks, NULL);
|
|
|
|
|
marked = 1;
|
|
|
|
|
|
2015-05-26 02:39:18 +08:00
|
|
|
for_each_ref(rev_list_insert_ref_oid, NULL);
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
for_each_cached_alternate(insert_one_alternate_object);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
fetching = 0;
|
|
|
|
|
for ( ; refs ; refs = refs->next) {
|
2017-05-01 10:28:54 +08:00
|
|
|
struct object_id *remote = &refs->old_oid;
|
2012-10-26 23:53:55 +08:00
|
|
|
const char *remote_hex;
|
|
|
|
|
struct object *o;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* If that object is complete (i.e. it is an ancestor of a
|
|
|
|
|
* local ref), we tell them we have it but do not have to
|
|
|
|
|
* tell them about its ancestors, which they already know
|
|
|
|
|
* about.
|
|
|
|
|
*
|
|
|
|
|
* We use lookup_object here because we are only
|
|
|
|
|
* interested in the case we *know* the object is
|
|
|
|
|
* reachable and we have already scanned it.
|
|
|
|
|
*/
|
2017-05-01 10:28:54 +08:00
|
|
|
if (((o = lookup_object(remote->hash)) != NULL) &&
|
2012-10-26 23:53:55 +08:00
|
|
|
(o->flags & COMPLETE)) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
remote_hex = oid_to_hex(remote);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!fetching) {
|
|
|
|
|
struct strbuf c = STRBUF_INIT;
|
|
|
|
|
if (multi_ack == 2) strbuf_addstr(&c, " multi_ack_detailed");
|
|
|
|
|
if (multi_ack == 1) strbuf_addstr(&c, " multi_ack");
|
|
|
|
|
if (no_done) strbuf_addstr(&c, " no-done");
|
|
|
|
|
if (use_sideband == 2) strbuf_addstr(&c, " side-band-64k");
|
|
|
|
|
if (use_sideband == 1) strbuf_addstr(&c, " side-band");
|
fetch, upload-pack: --deepen=N extends shallow boundary by N commits
In git-fetch, --depth argument is always relative with the latest
remote refs. This makes it a bit difficult to cover this use case,
where the user wants to make the shallow history, say 3 levels
deeper. It would work if remote refs have not moved yet, but nobody
can guarantee that, especially when that use case is performed a
couple months after the last clone or "git fetch --depth". Also,
modifying shallow boundary using --depth does not work well with
clones created by --since or --not.
This patch fixes that. A new argument --deepen=<N> will add <N> more (*)
parent commits to the current history regardless of where remote refs
are.
Have/Want negotiation is still respected. So if remote refs move, the
server will send two chunks: one between "have" and "want" and another
to extend shallow history. In theory, the client could send no "want"s
in order to get the second chunk only. But the protocol does not allow
that. Either you send no want lines, which means ls-remote; or you
have to send at least one want line that carries deep-relative to the
server..
The main work was done by Dongcan Jiang. I fixed it up here and there.
And of course all the bugs belong to me.
(*) We could even support --deepen=<N> where <N> is negative. In that
case we can cut some history from the shallow clone. This operation
(and --depth=<shorter depth>) does not require interaction with remote
side (and more complicated to implement as a result).
Helped-by: Duy Nguyen <pclouds@gmail.com>
Helped-by: Eric Sunshine <sunshine@sunshineco.com>
Helped-by: Junio C Hamano <gitster@pobox.com>
Signed-off-by: Dongcan Jiang <dongcan.jiang@gmail.com>
Signed-off-by: Nguyễn Thái Ngọc Duy <pclouds@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-06-12 18:54:09 +08:00
|
|
|
if (args->deepen_relative) strbuf_addstr(&c, " deepen-relative");
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->use_thin_pack) strbuf_addstr(&c, " thin-pack");
|
|
|
|
|
if (args->no_progress) strbuf_addstr(&c, " no-progress");
|
|
|
|
|
if (args->include_tag) strbuf_addstr(&c, " include-tag");
|
|
|
|
|
if (prefer_ofs_delta) strbuf_addstr(&c, " ofs-delta");
|
2016-06-12 18:53:59 +08:00
|
|
|
if (deepen_since_ok) strbuf_addstr(&c, " deepen-since");
|
2016-06-12 18:54:04 +08:00
|
|
|
if (deepen_not_ok) strbuf_addstr(&c, " deepen-not");
|
2012-10-26 23:53:55 +08:00
|
|
|
if (agent_supported) strbuf_addf(&c, " agent=%s",
|
|
|
|
|
git_user_agent_sanitized());
|
|
|
|
|
packet_buf_write(&req_buf, "want %s%s\n", remote_hex, c.buf);
|
|
|
|
|
strbuf_release(&c);
|
|
|
|
|
} else
|
|
|
|
|
packet_buf_write(&req_buf, "want %s\n", remote_hex);
|
|
|
|
|
fetching++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!fetching) {
|
|
|
|
|
strbuf_release(&req_buf);
|
|
|
|
|
packet_flush(fd[1]);
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (is_repository_shallow())
|
2013-12-05 21:02:34 +08:00
|
|
|
write_shallow_commits(&req_buf, 1, NULL);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->depth > 0)
|
|
|
|
|
packet_buf_write(&req_buf, "deepen %d", args->depth);
|
2016-06-12 18:53:59 +08:00
|
|
|
if (args->deepen_since) {
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t max_age = approxidate(args->deepen_since);
|
2017-04-21 18:45:48 +08:00
|
|
|
packet_buf_write(&req_buf, "deepen-since %"PRItime, max_age);
|
2016-06-12 18:53:59 +08:00
|
|
|
}
|
2016-06-12 18:54:04 +08:00
|
|
|
if (args->deepen_not) {
|
|
|
|
|
int i;
|
|
|
|
|
for (i = 0; i < args->deepen_not->nr; i++) {
|
|
|
|
|
struct string_list_item *s = args->deepen_not->items + i;
|
|
|
|
|
packet_buf_write(&req_buf, "deepen-not %s", s->string);
|
|
|
|
|
}
|
|
|
|
|
}
|
2012-10-26 23:53:55 +08:00
|
|
|
packet_buf_flush(&req_buf);
|
|
|
|
|
state_len = req_buf.len;
|
|
|
|
|
|
2016-06-12 18:53:56 +08:00
|
|
|
if (args->deepen) {
|
pkt-line: provide a LARGE_PACKET_MAX static buffer
Most of the callers of packet_read_line just read into a
static 1000-byte buffer (callers which handle arbitrary
binary data already use LARGE_PACKET_MAX). This works fine
in practice, because:
1. The only variable-sized data in these lines is a ref
name, and refs tend to be a lot shorter than 1000
characters.
2. When sending ref lines, git-core always limits itself
to 1000 byte packets.
However, the only limit given in the protocol specification
in Documentation/technical/protocol-common.txt is
LARGE_PACKET_MAX; the 1000 byte limit is mentioned only in
pack-protocol.txt, and then only describing what we write,
not as a specific limit for readers.
This patch lets us bump the 1000-byte limit to
LARGE_PACKET_MAX. Even though git-core will never write a
packet where this makes a difference, there are two good
reasons to do this:
1. Other git implementations may have followed
protocol-common.txt and used a larger maximum size. We
don't bump into it in practice because it would involve
very long ref names.
2. We may want to increase the 1000-byte limit one day.
Since packets are transferred before any capabilities,
it's difficult to do this in a backwards-compatible
way. But if we bump the size of buffer the readers can
handle, eventually older versions of git will be
obsolete enough that we can justify bumping the
writers, as well. We don't have plans to do this
anytime soon, but there is no reason not to start the
clock ticking now.
Just bumping all of the reading bufs to LARGE_PACKET_MAX
would waste memory. Instead, since most readers just read
into a temporary buffer anyway, let's provide a single
static buffer that all callers can use. We can further wrap
this detail away by having the packet_read_line wrapper just
use the buffer transparently and return a pointer to the
static storage. That covers most of the cases, and the
remaining ones already read into their own LARGE_PACKET_MAX
buffers.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-02-21 04:02:57 +08:00
|
|
|
char *line;
|
use skip_prefix to avoid magic numbers
It's a common idiom to match a prefix and then skip past it
with a magic number, like:
if (starts_with(foo, "bar"))
foo += 3;
This is easy to get wrong, since you have to count the
prefix string yourself, and there's no compiler check if the
string changes. We can use skip_prefix to avoid the magic
numbers here.
Note that some of these conversions could be much shorter.
For example:
if (starts_with(arg, "--foo=")) {
bar = arg + 6;
continue;
}
could become:
if (skip_prefix(arg, "--foo=", &bar))
continue;
However, I have left it as:
if (skip_prefix(arg, "--foo=", &v)) {
bar = v;
continue;
}
to visually match nearby cases which need to actually
process the string. Like:
if (skip_prefix(arg, "--foo=", &v)) {
bar = atoi(v);
continue;
}
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-06-19 03:47:50 +08:00
|
|
|
const char *arg;
|
2017-05-01 10:28:54 +08:00
|
|
|
struct object_id oid;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
send_request(args, fd[1], &req_buf);
|
pkt-line: provide a LARGE_PACKET_MAX static buffer
Most of the callers of packet_read_line just read into a
static 1000-byte buffer (callers which handle arbitrary
binary data already use LARGE_PACKET_MAX). This works fine
in practice, because:
1. The only variable-sized data in these lines is a ref
name, and refs tend to be a lot shorter than 1000
characters.
2. When sending ref lines, git-core always limits itself
to 1000 byte packets.
However, the only limit given in the protocol specification
in Documentation/technical/protocol-common.txt is
LARGE_PACKET_MAX; the 1000 byte limit is mentioned only in
pack-protocol.txt, and then only describing what we write,
not as a specific limit for readers.
This patch lets us bump the 1000-byte limit to
LARGE_PACKET_MAX. Even though git-core will never write a
packet where this makes a difference, there are two good
reasons to do this:
1. Other git implementations may have followed
protocol-common.txt and used a larger maximum size. We
don't bump into it in practice because it would involve
very long ref names.
2. We may want to increase the 1000-byte limit one day.
Since packets are transferred before any capabilities,
it's difficult to do this in a backwards-compatible
way. But if we bump the size of buffer the readers can
handle, eventually older versions of git will be
obsolete enough that we can justify bumping the
writers, as well. We don't have plans to do this
anytime soon, but there is no reason not to start the
clock ticking now.
Just bumping all of the reading bufs to LARGE_PACKET_MAX
would waste memory. Instead, since most readers just read
into a temporary buffer anyway, let's provide a single
static buffer that all callers can use. We can further wrap
this detail away by having the packet_read_line wrapper just
use the buffer transparently and return a pointer to the
static storage. That covers most of the cases, and the
remaining ones already read into their own LARGE_PACKET_MAX
buffers.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-02-21 04:02:57 +08:00
|
|
|
while ((line = packet_read_line(fd[0], NULL))) {
|
use skip_prefix to avoid magic numbers
It's a common idiom to match a prefix and then skip past it
with a magic number, like:
if (starts_with(foo, "bar"))
foo += 3;
This is easy to get wrong, since you have to count the
prefix string yourself, and there's no compiler check if the
string changes. We can use skip_prefix to avoid the magic
numbers here.
Note that some of these conversions could be much shorter.
For example:
if (starts_with(arg, "--foo=")) {
bar = arg + 6;
continue;
}
could become:
if (skip_prefix(arg, "--foo=", &bar))
continue;
However, I have left it as:
if (skip_prefix(arg, "--foo=", &v)) {
bar = v;
continue;
}
to visually match nearby cases which need to actually
process the string. Like:
if (skip_prefix(arg, "--foo=", &v)) {
bar = atoi(v);
continue;
}
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-06-19 03:47:50 +08:00
|
|
|
if (skip_prefix(line, "shallow ", &arg)) {
|
2017-05-01 10:28:54 +08:00
|
|
|
if (get_oid_hex(arg, &oid))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("invalid shallow line: %s"), line);
|
2017-05-07 06:10:06 +08:00
|
|
|
register_shallow(&oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
continue;
|
|
|
|
|
}
|
use skip_prefix to avoid magic numbers
It's a common idiom to match a prefix and then skip past it
with a magic number, like:
if (starts_with(foo, "bar"))
foo += 3;
This is easy to get wrong, since you have to count the
prefix string yourself, and there's no compiler check if the
string changes. We can use skip_prefix to avoid the magic
numbers here.
Note that some of these conversions could be much shorter.
For example:
if (starts_with(arg, "--foo=")) {
bar = arg + 6;
continue;
}
could become:
if (skip_prefix(arg, "--foo=", &bar))
continue;
However, I have left it as:
if (skip_prefix(arg, "--foo=", &v)) {
bar = v;
continue;
}
to visually match nearby cases which need to actually
process the string. Like:
if (skip_prefix(arg, "--foo=", &v)) {
bar = atoi(v);
continue;
}
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-06-19 03:47:50 +08:00
|
|
|
if (skip_prefix(line, "unshallow ", &arg)) {
|
2017-05-01 10:28:54 +08:00
|
|
|
if (get_oid_hex(arg, &oid))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("invalid unshallow line: %s"), line);
|
2017-05-01 10:28:54 +08:00
|
|
|
if (!lookup_object(oid.hash))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("object not found: %s"), line);
|
2012-10-26 23:53:55 +08:00
|
|
|
/* make sure that it is parsed as shallow */
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
if (!parse_object(&oid))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("error in object: %s"), line);
|
2017-05-07 06:10:06 +08:00
|
|
|
if (unregister_shallow(&oid))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("no shallow found: %s"), line);
|
2012-10-26 23:53:55 +08:00
|
|
|
continue;
|
|
|
|
|
}
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("expected shallow/unshallow, got %s"), line);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
} else if (!args->stateless_rpc)
|
|
|
|
|
send_request(args, fd[1], &req_buf);
|
|
|
|
|
|
|
|
|
|
if (!args->stateless_rpc) {
|
|
|
|
|
/* If we aren't using the stateless-rpc interface
|
|
|
|
|
* we don't need to retain the headers.
|
|
|
|
|
*/
|
|
|
|
|
strbuf_setlen(&req_buf, 0);
|
|
|
|
|
state_len = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
flushes = 0;
|
|
|
|
|
retval = -1;
|
2017-05-01 10:28:54 +08:00
|
|
|
while ((oid = get_rev())) {
|
|
|
|
|
packet_buf_write(&req_buf, "have %s\n", oid_to_hex(oid));
|
|
|
|
|
print_verbose(args, "have %s", oid_to_hex(oid));
|
2012-10-26 23:53:55 +08:00
|
|
|
in_vain++;
|
|
|
|
|
if (flush_at <= ++count) {
|
|
|
|
|
int ack;
|
|
|
|
|
|
|
|
|
|
packet_buf_flush(&req_buf);
|
|
|
|
|
send_request(args, fd[1], &req_buf);
|
|
|
|
|
strbuf_setlen(&req_buf, state_len);
|
|
|
|
|
flushes++;
|
|
|
|
|
flush_at = next_flush(args, count);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We keep one window "ahead" of the other side, and
|
|
|
|
|
* will wait for an ACK only on the next one
|
|
|
|
|
*/
|
|
|
|
|
if (!args->stateless_rpc && count == INITIAL_FLUSH)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
consume_shallow_list(args, fd[0]);
|
|
|
|
|
do {
|
2017-05-01 10:28:54 +08:00
|
|
|
ack = get_ack(fd[0], result_oid);
|
2016-06-12 18:53:54 +08:00
|
|
|
if (ack)
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("got %s %d %s"), "ack",
|
2017-05-01 10:28:54 +08:00
|
|
|
ack, oid_to_hex(result_oid));
|
2012-10-26 23:53:55 +08:00
|
|
|
switch (ack) {
|
|
|
|
|
case ACK:
|
|
|
|
|
flushes = 0;
|
|
|
|
|
multi_ack = 0;
|
|
|
|
|
retval = 0;
|
|
|
|
|
goto done;
|
|
|
|
|
case ACK_common:
|
|
|
|
|
case ACK_ready:
|
|
|
|
|
case ACK_continue: {
|
|
|
|
|
struct commit *commit =
|
Convert lookup_commit* to struct object_id
Convert lookup_commit, lookup_commit_or_die,
lookup_commit_reference, and lookup_commit_reference_gently to take
struct object_id arguments.
Introduce a temporary in parse_object buffer in order to convert this
function. This is required since in order to convert parse_object and
parse_object_buffer, lookup_commit_reference_gently and
lookup_commit_or_die would need to be converted. Not introducing a
temporary would therefore require that lookup_commit_or_die take a
struct object_id *, but lookup_commit would take unsigned char *,
leaving a confusing and hard-to-use interface.
parse_object_buffer will lose this temporary in a later patch.
This commit was created with manual changes to commit.c, commit.h, and
object.c, plus the following semantic patch:
@@
expression E1, E2;
@@
- lookup_commit_reference_gently(E1.hash, E2)
+ lookup_commit_reference_gently(&E1, E2)
@@
expression E1, E2;
@@
- lookup_commit_reference_gently(E1->hash, E2)
+ lookup_commit_reference_gently(E1, E2)
@@
expression E1;
@@
- lookup_commit_reference(E1.hash)
+ lookup_commit_reference(&E1)
@@
expression E1;
@@
- lookup_commit_reference(E1->hash)
+ lookup_commit_reference(E1)
@@
expression E1;
@@
- lookup_commit(E1.hash)
+ lookup_commit(&E1)
@@
expression E1;
@@
- lookup_commit(E1->hash)
+ lookup_commit(E1)
@@
expression E1, E2;
@@
- lookup_commit_or_die(E1.hash, E2)
+ lookup_commit_or_die(&E1, E2)
@@
expression E1, E2;
@@
- lookup_commit_or_die(E1->hash, E2)
+ lookup_commit_or_die(E1, E2)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:10 +08:00
|
|
|
lookup_commit(result_oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!commit)
|
2017-05-01 10:28:54 +08:00
|
|
|
die(_("invalid commit %s"), oid_to_hex(result_oid));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->stateless_rpc
|
|
|
|
|
&& ack == ACK_common
|
|
|
|
|
&& !(commit->object.flags & COMMON)) {
|
|
|
|
|
/* We need to replay the have for this object
|
|
|
|
|
* on the next RPC request so the peer knows
|
|
|
|
|
* it is in common with us.
|
|
|
|
|
*/
|
2017-05-01 10:28:54 +08:00
|
|
|
const char *hex = oid_to_hex(result_oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
packet_buf_write(&req_buf, "have %s\n", hex);
|
|
|
|
|
state_len = req_buf.len;
|
2016-09-24 01:41:35 +08:00
|
|
|
/*
|
|
|
|
|
* Reset in_vain because an ack
|
|
|
|
|
* for this commit has not been
|
|
|
|
|
* seen.
|
|
|
|
|
*/
|
|
|
|
|
in_vain = 0;
|
|
|
|
|
} else if (!args->stateless_rpc
|
|
|
|
|
|| ack != ACK_common)
|
|
|
|
|
in_vain = 0;
|
2012-10-26 23:53:55 +08:00
|
|
|
mark_common(commit, 0, 1);
|
|
|
|
|
retval = 0;
|
|
|
|
|
got_continue = 1;
|
|
|
|
|
if (ack == ACK_ready) {
|
fetch-pack: avoid quadratic behavior in rev_list_push
When we call find_common to start finding common ancestors
with the remote side of a fetch, the first thing we do is
insert the tip of each ref into our rev_list linked list. We
keep the list sorted the whole time with
commit_list_insert_by_date, which means our insertion ends
up doing O(n^2) timestamp comparisons.
We could teach rev_list_push to use an unsorted list, and
then sort it once after we have added each ref. However, in
get_rev, we process the list by popping commits off the
front and adding parents back in timestamp-sorted order. So
that procedure would still operate on the large list.
Instead, we can replace the linked list with a heap-based
priority queue, which can do O(log n) insertion, making the
whole insertion procedure O(n log n).
As a result of switching to the prio_queue struct, we fix
two minor bugs:
1. When we "pop" a commit in get_rev, and when we clear
the rev_list in find_common, we do not take care to
free the "struct commit_list", and just leak its
memory. With the prio_queue implementation, the memory
management is handled for us.
2. In get_rev, we look at the head commit of the list,
possibly push its parents onto the list, and then "pop"
the front of the list off, assuming it is the same
element that we just peeked at. This is typically going
to be the case, but would not be in the face of clock
skew: the parents are inserted by date, and could
potentially be inserted at the head of the list if they
have a timestamp newer than their descendent. In this
case, we would accidentally pop the parent, and never
process it at all.
The new implementation pulls the commit off of the
queue as we examine it, and so does not suffer from
this problem.
With this patch, a fetch of a single commit into a
repository with 50,000 refs went from:
real 0m7.984s
user 0m7.852s
sys 0m0.120s
to:
real 0m2.017s
user 0m1.884s
sys 0m0.124s
Before this patch, a larger case with 370K refs still had
not completed after tens of minutes; with this patch, it
completes in about 12 seconds.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:24:21 +08:00
|
|
|
clear_prio_queue(&rev_list);
|
2012-10-26 23:53:55 +08:00
|
|
|
got_ready = 1;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
} while (ack);
|
|
|
|
|
flushes--;
|
|
|
|
|
if (got_continue && MAX_IN_VAIN < in_vain) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("giving up"));
|
2012-10-26 23:53:55 +08:00
|
|
|
break; /* give up */
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
done:
|
|
|
|
|
if (!got_ready || !no_done) {
|
|
|
|
|
packet_buf_write(&req_buf, "done\n");
|
|
|
|
|
send_request(args, fd[1], &req_buf);
|
|
|
|
|
}
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("done"));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (retval != 0) {
|
|
|
|
|
multi_ack = 0;
|
|
|
|
|
flushes++;
|
|
|
|
|
}
|
|
|
|
|
strbuf_release(&req_buf);
|
|
|
|
|
|
2014-02-06 23:10:39 +08:00
|
|
|
if (!got_ready || !no_done)
|
|
|
|
|
consume_shallow_list(args, fd[0]);
|
2012-10-26 23:53:55 +08:00
|
|
|
while (flushes || multi_ack) {
|
2017-05-01 10:28:54 +08:00
|
|
|
int ack = get_ack(fd[0], result_oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (ack) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("got %s (%d) %s"), "ack",
|
2017-05-01 10:28:54 +08:00
|
|
|
ack, oid_to_hex(result_oid));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (ack == ACK)
|
|
|
|
|
return 0;
|
|
|
|
|
multi_ack = 1;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
flushes--;
|
|
|
|
|
}
|
|
|
|
|
/* it is no error to fetch into a completely empty repo */
|
|
|
|
|
return count ? retval : 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static struct commit_list *complete;
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
static int mark_complete(const struct object_id *oid)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
struct object *o = parse_object(oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
while (o && o->type == OBJ_TAG) {
|
|
|
|
|
struct tag *t = (struct tag *) o;
|
|
|
|
|
if (!t->tagged)
|
|
|
|
|
break; /* broken repository */
|
|
|
|
|
o->flags |= COMPLETE;
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
o = parse_object(&t->tagged->oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
if (o && o->type == OBJ_COMMIT) {
|
|
|
|
|
struct commit *commit = (struct commit *)o;
|
|
|
|
|
if (!(commit->object.flags & COMPLETE)) {
|
|
|
|
|
commit->object.flags |= COMPLETE;
|
fetch-pack: avoid quadratic list insertion in mark_complete
We insert the commit pointed to by each ref one-by-one into
the "complete" commit_list using insert_by_date. Because
each insertion is O(n), we end up with O(n^2) behavior.
This typically doesn't matter, because the number of refs is
reasonably small. And even if there are a lot of refs, they
often point to a smaller set of objects (in which case the
optimization in commit ea5f220 keeps our "n" small).
However, in pathological repositories (hundreds of thousands
of refs, each pointing to a unique commit), this quadratic
behavior can make a difference. Since we do not care about
the list order until we have finished building it, we can
simply keep it unsorted during the insertion phase, then
sort it afterwards.
On a repository like the one described above, this dropped
the time to do a no-op fetch from 2.0s to 1.7s. On normal
repositories, it probably does not matter at all, but it
does not hurt to protect ourselves from pathological cases.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:16:23 +08:00
|
|
|
commit_list_insert(commit, &complete);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2015-05-26 02:39:16 +08:00
|
|
|
static int mark_complete_oid(const char *refname, const struct object_id *oid,
|
|
|
|
|
int flag, void *cb_data)
|
|
|
|
|
{
|
2017-05-01 10:28:54 +08:00
|
|
|
return mark_complete(oid);
|
2015-05-26 02:39:16 +08:00
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
static void mark_recent_complete_commits(struct fetch_pack_args *args,
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t cutoff)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
|
|
|
|
while (complete && cutoff <= complete->item->date) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Marking %s as complete"),
|
2016-06-12 18:53:54 +08:00
|
|
|
oid_to_hex(&complete->item->object.oid));
|
2012-10-26 23:53:55 +08:00
|
|
|
pop_most_recent_commit(&complete, COMPLETE);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-16 01:32:20 +08:00
|
|
|
static void add_refs_to_oidset(struct oidset *oids, struct ref *refs)
|
|
|
|
|
{
|
|
|
|
|
for (; refs; refs = refs->next)
|
|
|
|
|
oidset_insert(oids, &refs->old_oid);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int tip_oids_contain(struct oidset *tip_oids,
|
|
|
|
|
struct ref *unmatched, struct ref *newlist,
|
|
|
|
|
const struct object_id *id)
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* Note that this only looks at the ref lists the first time it's
|
|
|
|
|
* called. This works out in filter_refs() because even though it may
|
|
|
|
|
* add to "newlist" between calls, the additions will always be for
|
|
|
|
|
* oids that are already in the set.
|
|
|
|
|
*/
|
|
|
|
|
if (!tip_oids->map.tablesize) {
|
|
|
|
|
add_refs_to_oidset(tip_oids, unmatched);
|
|
|
|
|
add_refs_to_oidset(tip_oids, newlist);
|
|
|
|
|
}
|
|
|
|
|
return oidset_contains(tip_oids, id);
|
|
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
static void filter_refs(struct fetch_pack_args *args,
|
2013-01-30 06:02:15 +08:00
|
|
|
struct ref **refs,
|
|
|
|
|
struct ref **sought, int nr_sought)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
|
|
|
|
struct ref *newlist = NULL;
|
|
|
|
|
struct ref **newtail = &newlist;
|
2017-05-16 01:32:20 +08:00
|
|
|
struct ref *unmatched = NULL;
|
2012-10-26 23:53:55 +08:00
|
|
|
struct ref *ref, *next;
|
2017-05-16 01:32:20 +08:00
|
|
|
struct oidset tip_oids = OIDSET_INIT;
|
2013-01-30 06:02:15 +08:00
|
|
|
int i;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
i = 0;
|
2012-10-26 23:53:55 +08:00
|
|
|
for (ref = *refs; ref; ref = next) {
|
|
|
|
|
int keep = 0;
|
|
|
|
|
next = ref->next;
|
2013-01-30 06:02:15 +08:00
|
|
|
|
2014-06-07 01:24:48 +08:00
|
|
|
if (starts_with(ref->name, "refs/") &&
|
fetch-pack: do not filter out one-level refs
Currently fetching a one-level ref like "refs/foo" does not
work consistently. The outer "git fetch" program filters the
list of refs, checking each against check_refname_format.
Then it feeds the result to do_fetch_pack to actually
negotiate the haves/wants and get the pack. The fetch-pack
code does its own filter, and it behaves differently.
The fetch-pack filter looks for refs in "refs/", and then
feeds everything _after_ the slash (i.e., just "foo") into
check_refname_format. But check_refname_format is not
designed to look at a partial refname. It complains that the
ref has only one component, thinking it is at the root
(i.e., alongside "HEAD"), when in reality we just fed it a
partial refname.
As a result, we omit a ref like "refs/foo" from the pack
request, even though "git fetch" then tries to store the
resulting ref. If we happen to get the object anyway (e.g.,
because the ref is contained in another ref we are
fetching), then the fetch succeeds. But if it is a unique
object, we fail when trying to update "refs/foo".
We can fix this by just passing the whole refname into
check_refname_format; we know the part we were omitting is
"refs/", which is acceptable in a refname. This at least
makes the checks consistent with each other.
This problem happens most commonly with "refs/stash", which
is the only one-level ref in wide use. However, our test
does not use "refs/stash", as we may later want to restrict
it specifically (not because it is one-level, but because
of the semantics of stashes).
We may also want to do away with the multiple levels of
filtering (which can cause problems when they are out of
sync), or even forbid one-level refs entirely. However,
those decisions can come later; this fixes the most
immediate problem, which is the mismatch between the two.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-01-15 18:46:13 +08:00
|
|
|
check_refname_format(ref->name, 0))
|
2012-10-26 23:53:55 +08:00
|
|
|
; /* trash */
|
|
|
|
|
else {
|
2013-01-30 06:02:15 +08:00
|
|
|
while (i < nr_sought) {
|
|
|
|
|
int cmp = strcmp(ref->name, sought[i]->name);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (cmp < 0)
|
|
|
|
|
break; /* definitely do not have it */
|
|
|
|
|
else if (cmp == 0) {
|
|
|
|
|
keep = 1; /* definitely have it */
|
2017-02-23 00:05:57 +08:00
|
|
|
sought[i]->match_status = REF_MATCHED;
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
2013-01-30 06:02:15 +08:00
|
|
|
i++;
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
if (!keep && args->fetch_all &&
|
2016-06-12 18:53:56 +08:00
|
|
|
(!args->deepen || !starts_with(ref->name, "refs/tags/")))
|
2012-10-26 23:53:55 +08:00
|
|
|
keep = 1;
|
|
|
|
|
|
|
|
|
|
if (keep) {
|
|
|
|
|
*newtail = ref;
|
|
|
|
|
ref->next = NULL;
|
|
|
|
|
newtail = &ref->next;
|
|
|
|
|
} else {
|
2017-05-16 01:32:20 +08:00
|
|
|
ref->next = unmatched;
|
|
|
|
|
unmatched = ref;
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
/* Append unmatched requests to the list */
|
2017-02-23 00:05:57 +08:00
|
|
|
for (i = 0; i < nr_sought; i++) {
|
2017-05-01 10:28:54 +08:00
|
|
|
struct object_id oid;
|
|
|
|
|
const char *p;
|
filter_ref: avoid overwriting ref->old_sha1 with garbage
If the server supports allow_tip_sha1_in_want, then
fetch-pack's filter_refs function tries to check whether a
ref is a request for a straight sha1 by running:
if (get_sha1_hex(ref->name, ref->old_sha1))
...
I.e., we are using get_sha1_hex to ask "is this ref name a
sha1?". If it is true, then the contents of ref->old_sha1
will end up unchanged. But if it is false, then get_sha1_hex
makes no guarantees about what it has written. With a ref
name like "abcdefoo", we would overwrite 3 bytes of
ref->old_sha1 before realizing that it was not a sha1.
This is likely not a problem in practice, as anything in
refs->name (besides a sha1) will start with "refs/", meaning
that we would notice on the first character that there is a
problem. Still, we are making assumptions about the state
left in the output when get_sha1_hex returns an error (e.g.,
it could start from the end of the string, or error check
the values only once they were placed in the output). It's
better to be defensive.
We could just check that we have exactly 40 characters of
sha1. But let's be even more careful and make sure that we
have a 40-char hex refname that matches what is in old_sha1.
This is perhaps overly defensive, but spells out our
assumptions clearly.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-03-20 04:34:51 +08:00
|
|
|
|
2017-02-23 00:05:57 +08:00
|
|
|
ref = sought[i];
|
|
|
|
|
if (ref->match_status != REF_NOT_MATCHED)
|
|
|
|
|
continue;
|
2017-05-01 10:28:54 +08:00
|
|
|
if (parse_oid_hex(ref->name, &oid, &p) ||
|
|
|
|
|
*p != '\0' ||
|
|
|
|
|
oidcmp(&oid, &ref->old_oid))
|
2017-02-23 00:05:57 +08:00
|
|
|
continue;
|
2013-01-30 06:02:15 +08:00
|
|
|
|
2017-02-23 00:05:57 +08:00
|
|
|
if ((allow_unadvertised_object_request &
|
2017-05-16 01:32:20 +08:00
|
|
|
(ALLOW_TIP_SHA1 | ALLOW_REACHABLE_SHA1)) ||
|
|
|
|
|
tip_oids_contain(&tip_oids, unmatched, newlist,
|
|
|
|
|
&ref->old_oid)) {
|
2017-02-23 00:05:57 +08:00
|
|
|
ref->match_status = REF_MATCHED;
|
filter_ref: make a copy of extra "sought" entries
If the server supports allow_tip_sha1_in_want, we add any
unmatched raw-sha1 entries in our "sought" list of refs to
the list of refs we will ask the other side for. We do so by
inserting the original "struct ref" directly into our list,
rather than making a copy. This has several problems.
The most minor problem is that one cannot ever free the
resulting list; it contains structs that are copies of the
remote refs (made earlier by fetch_pack) along with sought
refs that are referenced elsewhere.
But more importantly that we set the ref->next pointer to
NULL, chopping off the remainder of any existing list that
the ref was a part of. We get the set of "sought" refs in
an array rather than a linked list, but that array is often
in turn generated from a list. The test modification in
t5516 demonstrates this. Rather than fetching just an exact
sha1, we fetch that sha1 plus another ref:
- we build a linked list of refs to fetch when do_fetch
calls get_ref_map; the exact sha1 is first, followed by
the named ref ("refs/heads/extra" in this case).
- we pass that linked list to transport_fetch_ref, which
squashes it into an array of pointers
- that array goes to fetch_pack, which calls filter_ref.
There we generate the want list from a mix of what the
remote side has advertised, and the "sought" entry for
the exact sha1. We set the sought entry's "next" pointer
to NULL.
- after we return from transport_fetch_refs, we then try
to update the refs by following the linked list. But our
list is now truncated, and we do not update
refs/heads/extra at all.
We can fix this by making a copy of the ref. There's nothing
that fetch_pack does to it that must be reflected in the
original "sought" list (and indeed, if that were the case we
would have a serious bug, because it is only exact-sha1
entries which are treated this way).
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-03-20 04:37:09 +08:00
|
|
|
*newtail = copy_ref(ref);
|
|
|
|
|
newtail = &(*newtail)->next;
|
2017-02-23 00:05:57 +08:00
|
|
|
} else {
|
|
|
|
|
ref->match_status = REF_UNADVERTISED_NOT_ALLOWED;
|
2013-01-30 06:02:15 +08:00
|
|
|
}
|
|
|
|
|
}
|
2017-05-16 01:32:20 +08:00
|
|
|
|
|
|
|
|
oidset_clear(&tip_oids);
|
|
|
|
|
for (ref = unmatched; ref; ref = next) {
|
|
|
|
|
next = ref->next;
|
|
|
|
|
free(ref);
|
|
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
*refs = newlist;
|
|
|
|
|
}
|
|
|
|
|
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
static void mark_alternate_complete(struct object *obj)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
2017-05-01 10:28:54 +08:00
|
|
|
mark_complete(&obj->oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int everything_local(struct fetch_pack_args *args,
|
2013-01-30 06:02:15 +08:00
|
|
|
struct ref **refs,
|
|
|
|
|
struct ref **sought, int nr_sought)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
|
|
|
|
struct ref *ref;
|
|
|
|
|
int retval;
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t cutoff = 0;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
save_commit_buffer = 0;
|
|
|
|
|
|
|
|
|
|
for (ref = *refs; ref; ref = ref->next) {
|
|
|
|
|
struct object *o;
|
|
|
|
|
|
2015-11-10 10:22:20 +08:00
|
|
|
if (!has_object_file(&ref->old_oid))
|
2013-01-27 11:42:09 +08:00
|
|
|
continue;
|
|
|
|
|
|
object: convert parse_object* to take struct object_id
Make parse_object, parse_object_or_die, and parse_object_buffer take a
pointer to struct object_id. Remove the temporary variables inserted
earlier, since they are no longer necessary. Transform all of the
callers using the following semantic patch:
@@
expression E1;
@@
- parse_object(E1.hash)
+ parse_object(&E1)
@@
expression E1;
@@
- parse_object(E1->hash)
+ parse_object(E1)
@@
expression E1, E2;
@@
- parse_object_or_die(E1.hash, E2)
+ parse_object_or_die(&E1, E2)
@@
expression E1, E2;
@@
- parse_object_or_die(E1->hash, E2)
+ parse_object_or_die(E1, E2)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1.hash, E2, E3, E4, E5)
+ parse_object_buffer(&E1, E2, E3, E4, E5)
@@
expression E1, E2, E3, E4, E5;
@@
- parse_object_buffer(E1->hash, E2, E3, E4, E5)
+ parse_object_buffer(E1, E2, E3, E4, E5)
Signed-off-by: brian m. carlson <sandals@crustytoothpaste.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-07 06:10:38 +08:00
|
|
|
o = parse_object(&ref->old_oid);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!o)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
/* We already have it -- which may mean that we were
|
|
|
|
|
* in sync with the other side at some time after
|
|
|
|
|
* that (it is OK if we guess wrong here).
|
|
|
|
|
*/
|
|
|
|
|
if (o->type == OBJ_COMMIT) {
|
|
|
|
|
struct commit *commit = (struct commit *)o;
|
|
|
|
|
if (!cutoff || cutoff < commit->date)
|
|
|
|
|
cutoff = commit->date;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-06-12 18:53:56 +08:00
|
|
|
if (!args->deepen) {
|
2015-05-26 02:39:16 +08:00
|
|
|
for_each_ref(mark_complete_oid, NULL);
|
fetch-pack: cache results of for_each_alternate_ref
We may run for_each_alternate_ref() twice, once in
find_common() and once in everything_local(). This operation
can be expensive, because it involves running a sub-process
which must freshly load all of the alternate's refs from
disk.
Let's cache and reuse the results between the two calls. We
can make some optimizations based on the particular use
pattern in fetch-pack to keep our memory usage down.
The first is that we only care about the sha1s, not the refs
themselves. So it's OK to store only the sha1s, and to
suppress duplicates. The natural fit would therefore be a
sha1_array.
However, sha1_array's de-duplication happens only after it
has read and sorted all entries. It still stores each
duplicate. For an alternate with a large number of refs
pointing to the same commits, this is a needless expense.
Instead, we'd prefer to eliminate duplicates before putting
them in the cache, which implies using a hash. We can
further note that fetch-pack will call parse_object() on
each alternate sha1. We can therefore keep our cache as a
set of pointers to "struct object". That gives us a place to
put our "already seen" bit with an optimized hash lookup.
And as a bonus, the object stores the sha1 for us, so
pointer-to-object is all we need.
There are two extra optimizations I didn't do here:
- we actually store an array of pointer-to-object.
Technically we could just walk the obj_hash table
looking for entries with the ALTERNATE flag set (because
our use case doesn't care about the order here).
But that hash table may be mostly composed of
non-ALTERNATE entries, so we'd waste time walking over
them. So it would be a slight win in memory use, but a
loss in CPU.
- the items we pull out of the cache are actual "struct
object"s, but then we feed "obj->sha1" to our
sub-functions, which promptly call parse_object().
This second parse is cheap, because it starts with
lookup_object() and will bail immediately when it sees
we've already parsed the object. We could save the extra
hash lookup, but it would involve refactoring the
functions we call. It may or may not be worth the
trouble.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-02-09 04:53:03 +08:00
|
|
|
for_each_cached_alternate(mark_alternate_complete);
|
fetch-pack: avoid quadratic list insertion in mark_complete
We insert the commit pointed to by each ref one-by-one into
the "complete" commit_list using insert_by_date. Because
each insertion is O(n), we end up with O(n^2) behavior.
This typically doesn't matter, because the number of refs is
reasonably small. And even if there are a lot of refs, they
often point to a smaller set of objects (in which case the
optimization in commit ea5f220 keeps our "n" small).
However, in pathological repositories (hundreds of thousands
of refs, each pointing to a unique commit), this quadratic
behavior can make a difference. Since we do not care about
the list order until we have finished building it, we can
simply keep it unsorted during the insertion phase, then
sort it afterwards.
On a repository like the one described above, this dropped
the time to do a no-op fetch from 2.0s to 1.7s. On normal
repositories, it probably does not matter at all, but it
does not hurt to protect ourselves from pathological cases.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-07-02 14:16:23 +08:00
|
|
|
commit_list_sort_by_date(&complete);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (cutoff)
|
|
|
|
|
mark_recent_complete_commits(args, cutoff);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Mark all complete remote refs as common refs.
|
|
|
|
|
* Don't mark them common yet; the server has to be told so first.
|
|
|
|
|
*/
|
|
|
|
|
for (ref = *refs; ref; ref = ref->next) {
|
2015-11-10 10:22:20 +08:00
|
|
|
struct object *o = deref_tag(lookup_object(ref->old_oid.hash),
|
2012-10-26 23:53:55 +08:00
|
|
|
NULL, 0);
|
|
|
|
|
|
|
|
|
|
if (!o || o->type != OBJ_COMMIT || !(o->flags & COMPLETE))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (!(o->flags & SEEN)) {
|
|
|
|
|
rev_list_push((struct commit *)o, COMMON_REF | SEEN);
|
|
|
|
|
|
|
|
|
|
mark_common((struct commit *)o, 1, 1);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
filter_refs(args, refs, sought, nr_sought);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
for (retval = 1, ref = *refs; ref ; ref = ref->next) {
|
2017-05-01 10:28:54 +08:00
|
|
|
const struct object_id *remote = &ref->old_oid;
|
2012-10-26 23:53:55 +08:00
|
|
|
struct object *o;
|
|
|
|
|
|
2017-05-01 10:28:54 +08:00
|
|
|
o = lookup_object(remote->hash);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!o || !(o->flags & COMPLETE)) {
|
|
|
|
|
retval = 0;
|
2017-05-01 10:28:54 +08:00
|
|
|
print_verbose(args, "want %s (%s)", oid_to_hex(remote),
|
2016-06-12 18:53:54 +08:00
|
|
|
ref->name);
|
2012-10-26 23:53:55 +08:00
|
|
|
continue;
|
|
|
|
|
}
|
2017-05-01 10:28:54 +08:00
|
|
|
print_verbose(args, _("already have %s (%s)"), oid_to_hex(remote),
|
2016-06-12 18:53:54 +08:00
|
|
|
ref->name);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int sideband_demux(int in, int out, void *data)
|
|
|
|
|
{
|
|
|
|
|
int *xd = data;
|
fetch-pack: ignore SIGPIPE in sideband demuxer
If the other side feeds us a bogus pack, index-pack (or
unpack-objects) may die early, before consuming all of its
input. As a result, the sideband demuxer may get SIGPIPE
(racily, depending on whether our data made it into the pipe
buffer or not). If this happens and we are compiled with
pthread support, it will take down the main thread, too.
This isn't the end of the world, as the main process will
just die() anyway when it sees index-pack failed. But it
does mean we don't get a chance to say "fatal: index-pack
failed" or similar. And it also means that we racily fail
t5504, as we sometimes die() and sometimes are killed by
SIGPIPE.
So let's ignore SIGPIPE while demuxing the sideband. We are
already careful to check the return value of write(), so we
won't waste time writing to a broken pipe. The caller will
notice the error return from the async thread, though in
practice we don't even get that far, as we die() as soon as
we see that index-pack failed.
The non-sideband case is already fine; we let index-pack
read straight from the socket, so there is no SIGPIPE at
all. Technically the non-threaded async case is also OK
without this (the forked async process gets SIGPIPE), but
it's not worth distinguishing from the threaded case here.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-02-24 15:44:58 +08:00
|
|
|
int ret;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
fetch-pack: ignore SIGPIPE in sideband demuxer
If the other side feeds us a bogus pack, index-pack (or
unpack-objects) may die early, before consuming all of its
input. As a result, the sideband demuxer may get SIGPIPE
(racily, depending on whether our data made it into the pipe
buffer or not). If this happens and we are compiled with
pthread support, it will take down the main thread, too.
This isn't the end of the world, as the main process will
just die() anyway when it sees index-pack failed. But it
does mean we don't get a chance to say "fatal: index-pack
failed" or similar. And it also means that we racily fail
t5504, as we sometimes die() and sometimes are killed by
SIGPIPE.
So let's ignore SIGPIPE while demuxing the sideband. We are
already careful to check the return value of write(), so we
won't waste time writing to a broken pipe. The caller will
notice the error return from the async thread, though in
practice we don't even get that far, as we die() as soon as
we see that index-pack failed.
The non-sideband case is already fine; we let index-pack
read straight from the socket, so there is no SIGPIPE at
all. Technically the non-threaded async case is also OK
without this (the forked async process gets SIGPIPE), but
it's not worth distinguishing from the threaded case here.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-02-24 15:44:58 +08:00
|
|
|
ret = recv_sideband("fetch-pack", xd[0], out);
|
2012-10-26 23:53:55 +08:00
|
|
|
close(out);
|
|
|
|
|
return ret;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int get_pack(struct fetch_pack_args *args,
|
|
|
|
|
int xd[2], char **pack_lockfile)
|
|
|
|
|
{
|
|
|
|
|
struct async demux;
|
|
|
|
|
int do_keep = args->keep_pack;
|
2015-09-25 05:07:54 +08:00
|
|
|
const char *cmd_name;
|
|
|
|
|
struct pack_header header;
|
|
|
|
|
int pass_header = 0;
|
2014-08-20 03:09:35 +08:00
|
|
|
struct child_process cmd = CHILD_PROCESS_INIT;
|
2013-05-26 09:16:17 +08:00
|
|
|
int ret;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
memset(&demux, 0, sizeof(demux));
|
|
|
|
|
if (use_sideband) {
|
|
|
|
|
/* xd[] is talking with upload-pack; subprocess reads from
|
|
|
|
|
* xd[0], spits out band#2 to stderr, and feeds us band#1
|
|
|
|
|
* through demux->out.
|
|
|
|
|
*/
|
|
|
|
|
demux.proc = sideband_demux;
|
|
|
|
|
demux.data = xd;
|
|
|
|
|
demux.out = -1;
|
2016-04-20 06:50:29 +08:00
|
|
|
demux.isolate_sigpipe = 1;
|
2012-10-26 23:53:55 +08:00
|
|
|
if (start_async(&demux))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("fetch-pack: unable to fork off sideband demultiplexer"));
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
demux.out = xd[0];
|
|
|
|
|
|
|
|
|
|
if (!args->keep_pack && unpack_limit) {
|
|
|
|
|
|
|
|
|
|
if (read_pack_header(demux.out, &header))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("protocol error: bad pack header"));
|
2015-09-25 05:07:54 +08:00
|
|
|
pass_header = 1;
|
2012-10-26 23:53:55 +08:00
|
|
|
if (ntohl(header.hdr_entries) < unpack_limit)
|
|
|
|
|
do_keep = 0;
|
|
|
|
|
else
|
|
|
|
|
do_keep = 1;
|
|
|
|
|
}
|
|
|
|
|
|
2013-05-26 09:16:15 +08:00
|
|
|
if (alternate_shallow_file) {
|
2015-09-25 05:07:54 +08:00
|
|
|
argv_array_push(&cmd.args, "--shallow-file");
|
|
|
|
|
argv_array_push(&cmd.args, alternate_shallow_file);
|
2013-05-26 09:16:15 +08:00
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
if (do_keep) {
|
|
|
|
|
if (pack_lockfile)
|
|
|
|
|
cmd.out = -1;
|
2015-09-25 05:07:54 +08:00
|
|
|
cmd_name = "index-pack";
|
|
|
|
|
argv_array_push(&cmd.args, cmd_name);
|
|
|
|
|
argv_array_push(&cmd.args, "--stdin");
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!args->quiet && !args->no_progress)
|
2015-09-25 05:07:54 +08:00
|
|
|
argv_array_push(&cmd.args, "-v");
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->use_thin_pack)
|
2015-09-25 05:07:54 +08:00
|
|
|
argv_array_push(&cmd.args, "--fix-thin");
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->lock_pack || unpack_limit) {
|
2017-04-19 05:57:42 +08:00
|
|
|
char hostname[HOST_NAME_MAX + 1];
|
2017-04-19 05:57:43 +08:00
|
|
|
if (xgethostname(hostname, sizeof(hostname)))
|
2015-09-25 05:07:54 +08:00
|
|
|
xsnprintf(hostname, sizeof(hostname), "localhost");
|
|
|
|
|
argv_array_pushf(&cmd.args,
|
|
|
|
|
"--keep=fetch-pack %"PRIuMAX " on %s",
|
|
|
|
|
(uintmax_t)getpid(), hostname);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
2013-05-26 09:16:17 +08:00
|
|
|
if (args->check_self_contained_and_connected)
|
2015-09-25 05:07:54 +08:00
|
|
|
argv_array_push(&cmd.args, "--check-self-contained-and-connected");
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
else {
|
2015-09-25 05:07:54 +08:00
|
|
|
cmd_name = "unpack-objects";
|
|
|
|
|
argv_array_push(&cmd.args, cmd_name);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->quiet || args->no_progress)
|
2015-09-25 05:07:54 +08:00
|
|
|
argv_array_push(&cmd.args, "-q");
|
2013-05-26 09:16:17 +08:00
|
|
|
args->check_self_contained_and_connected = 0;
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
2015-09-25 05:07:54 +08:00
|
|
|
|
|
|
|
|
if (pass_header)
|
|
|
|
|
argv_array_pushf(&cmd.args, "--pack_header=%"PRIu32",%"PRIu32,
|
|
|
|
|
ntohl(header.hdr_version),
|
|
|
|
|
ntohl(header.hdr_entries));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (fetch_fsck_objects >= 0
|
|
|
|
|
? fetch_fsck_objects
|
|
|
|
|
: transfer_fsck_objects >= 0
|
|
|
|
|
? transfer_fsck_objects
|
|
|
|
|
: 0)
|
2015-09-25 05:07:54 +08:00
|
|
|
argv_array_push(&cmd.args, "--strict");
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
cmd.in = demux.out;
|
|
|
|
|
cmd.git_cmd = 1;
|
|
|
|
|
if (start_command(&cmd))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("fetch-pack: unable to fork off %s"), cmd_name);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (do_keep && pack_lockfile) {
|
|
|
|
|
*pack_lockfile = index_pack_lockfile(cmd.out);
|
|
|
|
|
close(cmd.out);
|
|
|
|
|
}
|
|
|
|
|
|
2013-10-22 21:36:02 +08:00
|
|
|
if (!use_sideband)
|
|
|
|
|
/* Closed by start_command() */
|
|
|
|
|
xd[0] = -1;
|
|
|
|
|
|
2013-05-26 09:16:17 +08:00
|
|
|
ret = finish_command(&cmd);
|
|
|
|
|
if (!ret || (args->check_self_contained_and_connected && ret == 1))
|
|
|
|
|
args->self_contained_and_connected =
|
|
|
|
|
args->check_self_contained_and_connected &&
|
|
|
|
|
ret == 0;
|
|
|
|
|
else
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("%s failed"), cmd_name);
|
2012-10-26 23:53:55 +08:00
|
|
|
if (use_sideband && finish_async(&demux))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("error in sideband demultiplexer"));
|
2012-10-26 23:53:55 +08:00
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
static int cmp_ref_by_name(const void *a_, const void *b_)
|
|
|
|
|
{
|
|
|
|
|
const struct ref *a = *((const struct ref **)a_);
|
|
|
|
|
const struct ref *b = *((const struct ref **)b_);
|
|
|
|
|
return strcmp(a->name, b->name);
|
|
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
static struct ref *do_fetch_pack(struct fetch_pack_args *args,
|
|
|
|
|
int fd[2],
|
|
|
|
|
const struct ref *orig_ref,
|
2013-01-30 06:02:15 +08:00
|
|
|
struct ref **sought, int nr_sought,
|
2013-12-05 21:02:39 +08:00
|
|
|
struct shallow_info *si,
|
2012-10-26 23:53:55 +08:00
|
|
|
char **pack_lockfile)
|
|
|
|
|
{
|
|
|
|
|
struct ref *ref = copy_ref_list(orig_ref);
|
2017-05-01 10:28:54 +08:00
|
|
|
struct object_id oid;
|
2012-10-26 23:53:55 +08:00
|
|
|
const char *agent_feature;
|
|
|
|
|
int agent_len;
|
|
|
|
|
|
|
|
|
|
sort_ref_list(&ref, ref_compare_name);
|
2016-09-29 23:27:31 +08:00
|
|
|
QSORT(sought, nr_sought, cmp_ref_by_name);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
2015-06-17 19:48:14 +08:00
|
|
|
if ((args->depth > 0 || is_repository_shallow()) && !server_supports("shallow"))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("Server does not support shallow clients"));
|
2016-06-12 18:54:04 +08:00
|
|
|
if (args->depth > 0 || args->deepen_since || args->deepen_not)
|
2016-06-12 18:53:56 +08:00
|
|
|
args->deepen = 1;
|
2012-10-26 23:53:55 +08:00
|
|
|
if (server_supports("multi_ack_detailed")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports multi_ack_detailed"));
|
2012-10-26 23:53:55 +08:00
|
|
|
multi_ack = 2;
|
|
|
|
|
if (server_supports("no-done")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports no-done"));
|
2012-10-26 23:53:55 +08:00
|
|
|
if (args->stateless_rpc)
|
|
|
|
|
no_done = 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else if (server_supports("multi_ack")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports multi_ack"));
|
2012-10-26 23:53:55 +08:00
|
|
|
multi_ack = 1;
|
|
|
|
|
}
|
|
|
|
|
if (server_supports("side-band-64k")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports side-band-64k"));
|
2012-10-26 23:53:55 +08:00
|
|
|
use_sideband = 2;
|
|
|
|
|
}
|
|
|
|
|
else if (server_supports("side-band")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports side-band"));
|
2012-10-26 23:53:55 +08:00
|
|
|
use_sideband = 1;
|
|
|
|
|
}
|
2013-01-30 06:02:15 +08:00
|
|
|
if (server_supports("allow-tip-sha1-in-want")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports allow-tip-sha1-in-want"));
|
2015-05-22 04:23:38 +08:00
|
|
|
allow_unadvertised_object_request |= ALLOW_TIP_SHA1;
|
2013-01-30 06:02:15 +08:00
|
|
|
}
|
2015-05-22 04:23:39 +08:00
|
|
|
if (server_supports("allow-reachable-sha1-in-want")) {
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports allow-reachable-sha1-in-want"));
|
2015-05-22 04:23:39 +08:00
|
|
|
allow_unadvertised_object_request |= ALLOW_REACHABLE_SHA1;
|
|
|
|
|
}
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!server_supports("thin-pack"))
|
|
|
|
|
args->use_thin_pack = 0;
|
|
|
|
|
if (!server_supports("no-progress"))
|
|
|
|
|
args->no_progress = 0;
|
|
|
|
|
if (!server_supports("include-tag"))
|
|
|
|
|
args->include_tag = 0;
|
2016-06-12 18:53:54 +08:00
|
|
|
if (server_supports("ofs-delta"))
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server supports ofs-delta"));
|
2016-06-12 18:53:54 +08:00
|
|
|
else
|
2012-10-26 23:53:55 +08:00
|
|
|
prefer_ofs_delta = 0;
|
|
|
|
|
|
|
|
|
|
if ((agent_feature = server_feature_value("agent", &agent_len))) {
|
|
|
|
|
agent_supported = 1;
|
2016-06-12 18:53:54 +08:00
|
|
|
if (agent_len)
|
2016-06-12 18:53:55 +08:00
|
|
|
print_verbose(args, _("Server version is %.*s"),
|
2016-06-12 18:53:54 +08:00
|
|
|
agent_len, agent_feature);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
2016-06-12 18:53:59 +08:00
|
|
|
if (server_supports("deepen-since"))
|
|
|
|
|
deepen_since_ok = 1;
|
|
|
|
|
else if (args->deepen_since)
|
|
|
|
|
die(_("Server does not support --shallow-since"));
|
2016-06-12 18:54:04 +08:00
|
|
|
if (server_supports("deepen-not"))
|
|
|
|
|
deepen_not_ok = 1;
|
|
|
|
|
else if (args->deepen_not)
|
|
|
|
|
die(_("Server does not support --shallow-exclude"));
|
fetch, upload-pack: --deepen=N extends shallow boundary by N commits
In git-fetch, --depth argument is always relative with the latest
remote refs. This makes it a bit difficult to cover this use case,
where the user wants to make the shallow history, say 3 levels
deeper. It would work if remote refs have not moved yet, but nobody
can guarantee that, especially when that use case is performed a
couple months after the last clone or "git fetch --depth". Also,
modifying shallow boundary using --depth does not work well with
clones created by --since or --not.
This patch fixes that. A new argument --deepen=<N> will add <N> more (*)
parent commits to the current history regardless of where remote refs
are.
Have/Want negotiation is still respected. So if remote refs move, the
server will send two chunks: one between "have" and "want" and another
to extend shallow history. In theory, the client could send no "want"s
in order to get the second chunk only. But the protocol does not allow
that. Either you send no want lines, which means ls-remote; or you
have to send at least one want line that carries deep-relative to the
server..
The main work was done by Dongcan Jiang. I fixed it up here and there.
And of course all the bugs belong to me.
(*) We could even support --deepen=<N> where <N> is negative. In that
case we can cut some history from the shallow clone. This operation
(and --depth=<shorter depth>) does not require interaction with remote
side (and more complicated to implement as a result).
Helped-by: Duy Nguyen <pclouds@gmail.com>
Helped-by: Eric Sunshine <sunshine@sunshineco.com>
Helped-by: Junio C Hamano <gitster@pobox.com>
Signed-off-by: Dongcan Jiang <dongcan.jiang@gmail.com>
Signed-off-by: Nguyễn Thái Ngọc Duy <pclouds@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-06-12 18:54:09 +08:00
|
|
|
if (!server_supports("deepen-relative") && args->deepen_relative)
|
|
|
|
|
die(_("Server does not support --deepen"));
|
2012-10-26 23:53:55 +08:00
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
if (everything_local(args, &ref, sought, nr_sought)) {
|
2012-10-26 23:53:55 +08:00
|
|
|
packet_flush(fd[1]);
|
|
|
|
|
goto all_done;
|
|
|
|
|
}
|
2017-05-01 10:28:54 +08:00
|
|
|
if (find_common(args, fd, &oid, ref) < 0)
|
2012-10-26 23:53:55 +08:00
|
|
|
if (!args->keep_pack)
|
|
|
|
|
/* When cloning, it is not unusual to have
|
|
|
|
|
* no common commit.
|
|
|
|
|
*/
|
2016-06-12 18:53:55 +08:00
|
|
|
warning(_("no common commits"));
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
if (args->stateless_rpc)
|
|
|
|
|
packet_flush(fd[1]);
|
2016-06-12 18:53:56 +08:00
|
|
|
if (args->deepen)
|
2013-12-05 21:02:34 +08:00
|
|
|
setup_alternate_shallow(&shallow_lock, &alternate_shallow_file,
|
|
|
|
|
NULL);
|
2013-12-05 21:02:40 +08:00
|
|
|
else if (si->nr_ours || si->nr_theirs)
|
2013-12-05 21:02:39 +08:00
|
|
|
alternate_shallow_file = setup_temporary_shallow(si->shallow);
|
2013-08-26 10:17:26 +08:00
|
|
|
else
|
|
|
|
|
alternate_shallow_file = NULL;
|
2012-10-26 23:53:55 +08:00
|
|
|
if (get_pack(args, fd, pack_lockfile))
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("git fetch-pack: fetch failed."));
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
all_done:
|
|
|
|
|
return ref;
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-08 00:21:20 +08:00
|
|
|
static void fetch_pack_config(void)
|
2012-10-26 23:53:55 +08:00
|
|
|
{
|
2014-08-08 00:21:20 +08:00
|
|
|
git_config_get_int("fetch.unpacklimit", &fetch_unpack_limit);
|
|
|
|
|
git_config_get_int("transfer.unpacklimit", &transfer_unpack_limit);
|
|
|
|
|
git_config_get_bool("repack.usedeltabaseoffset", &prefer_ofs_delta);
|
|
|
|
|
git_config_get_bool("fetch.fsckobjects", &fetch_fsck_objects);
|
|
|
|
|
git_config_get_bool("transfer.fsckobjects", &transfer_fsck_objects);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
2014-08-08 00:21:20 +08:00
|
|
|
git_config(git_default_config, NULL);
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void fetch_pack_setup(void)
|
|
|
|
|
{
|
|
|
|
|
static int did_setup;
|
|
|
|
|
if (did_setup)
|
|
|
|
|
return;
|
2014-08-08 00:21:20 +08:00
|
|
|
fetch_pack_config();
|
2012-10-26 23:53:55 +08:00
|
|
|
if (0 <= transfer_unpack_limit)
|
|
|
|
|
unpack_limit = transfer_unpack_limit;
|
|
|
|
|
else if (0 <= fetch_unpack_limit)
|
|
|
|
|
unpack_limit = fetch_unpack_limit;
|
|
|
|
|
did_setup = 1;
|
|
|
|
|
}
|
|
|
|
|
|
2013-01-30 06:02:15 +08:00
|
|
|
static int remove_duplicates_in_refs(struct ref **ref, int nr)
|
|
|
|
|
{
|
|
|
|
|
struct string_list names = STRING_LIST_INIT_NODUP;
|
|
|
|
|
int src, dst;
|
|
|
|
|
|
|
|
|
|
for (src = dst = 0; src < nr; src++) {
|
|
|
|
|
struct string_list_item *item;
|
|
|
|
|
item = string_list_insert(&names, ref[src]->name);
|
|
|
|
|
if (item->util)
|
|
|
|
|
continue; /* already have it */
|
|
|
|
|
item->util = ref[src];
|
|
|
|
|
if (src != dst)
|
|
|
|
|
ref[dst] = ref[src];
|
|
|
|
|
dst++;
|
|
|
|
|
}
|
|
|
|
|
for (src = dst; src < nr; src++)
|
|
|
|
|
ref[src] = NULL;
|
|
|
|
|
string_list_clear(&names, 0);
|
|
|
|
|
return dst;
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-05 21:02:39 +08:00
|
|
|
static void update_shallow(struct fetch_pack_args *args,
|
2013-12-05 21:02:40 +08:00
|
|
|
struct ref **sought, int nr_sought,
|
2013-12-05 21:02:39 +08:00
|
|
|
struct shallow_info *si)
|
2013-12-05 21:02:37 +08:00
|
|
|
{
|
2017-03-31 09:40:00 +08:00
|
|
|
struct oid_array ref = OID_ARRAY_INIT;
|
2013-12-05 21:02:40 +08:00
|
|
|
int *status;
|
2013-12-05 21:02:39 +08:00
|
|
|
int i;
|
|
|
|
|
|
2016-06-12 18:53:56 +08:00
|
|
|
if (args->deepen && alternate_shallow_file) {
|
2013-12-05 21:02:37 +08:00
|
|
|
if (*alternate_shallow_file == '\0') { /* --unshallow */
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 17:38:57 +08:00
|
|
|
unlink_or_warn(git_path_shallow());
|
2013-12-05 21:02:37 +08:00
|
|
|
rollback_lock_file(&shallow_lock);
|
|
|
|
|
} else
|
|
|
|
|
commit_lock_file(&shallow_lock);
|
|
|
|
|
return;
|
|
|
|
|
}
|
2013-12-05 21:02:39 +08:00
|
|
|
|
|
|
|
|
if (!si->shallow || !si->shallow->nr)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
if (args->cloning) {
|
|
|
|
|
/*
|
|
|
|
|
* remote is shallow, but this is a clone, there are
|
|
|
|
|
* no objects in repo to worry about. Accept any
|
|
|
|
|
* shallow points that exist in the pack (iow in repo
|
|
|
|
|
* after get_pack() and reprepare_packed_git())
|
|
|
|
|
*/
|
2017-03-31 09:40:00 +08:00
|
|
|
struct oid_array extra = OID_ARRAY_INIT;
|
2017-03-27 00:01:37 +08:00
|
|
|
struct object_id *oid = si->shallow->oid;
|
2013-12-05 21:02:39 +08:00
|
|
|
for (i = 0; i < si->shallow->nr; i++)
|
2017-03-27 00:01:37 +08:00
|
|
|
if (has_object_file(&oid[i]))
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_append(&extra, &oid[i]);
|
2013-12-05 21:02:39 +08:00
|
|
|
if (extra.nr) {
|
|
|
|
|
setup_alternate_shallow(&shallow_lock,
|
|
|
|
|
&alternate_shallow_file,
|
|
|
|
|
&extra);
|
|
|
|
|
commit_lock_file(&shallow_lock);
|
|
|
|
|
}
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_clear(&extra);
|
2013-12-05 21:02:39 +08:00
|
|
|
return;
|
|
|
|
|
}
|
2013-12-05 21:02:40 +08:00
|
|
|
|
|
|
|
|
if (!si->nr_ours && !si->nr_theirs)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
remove_nonexistent_theirs_shallow(si);
|
|
|
|
|
if (!si->nr_ours && !si->nr_theirs)
|
|
|
|
|
return;
|
|
|
|
|
for (i = 0; i < nr_sought; i++)
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_append(&ref, &sought[i]->old_oid);
|
2013-12-05 21:02:40 +08:00
|
|
|
si->ref = &ref;
|
|
|
|
|
|
2013-12-05 21:02:42 +08:00
|
|
|
if (args->update_shallow) {
|
|
|
|
|
/*
|
|
|
|
|
* remote is also shallow, .git/shallow may be updated
|
|
|
|
|
* so all refs can be accepted. Make sure we only add
|
|
|
|
|
* shallow roots that are actually reachable from new
|
|
|
|
|
* refs.
|
|
|
|
|
*/
|
2017-03-31 09:40:00 +08:00
|
|
|
struct oid_array extra = OID_ARRAY_INIT;
|
2017-03-27 00:01:37 +08:00
|
|
|
struct object_id *oid = si->shallow->oid;
|
2013-12-05 21:02:42 +08:00
|
|
|
assign_shallow_commits_to_refs(si, NULL, NULL);
|
|
|
|
|
if (!si->nr_ours && !si->nr_theirs) {
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_clear(&ref);
|
2013-12-05 21:02:42 +08:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
for (i = 0; i < si->nr_ours; i++)
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_append(&extra, &oid[si->ours[i]]);
|
2013-12-05 21:02:42 +08:00
|
|
|
for (i = 0; i < si->nr_theirs; i++)
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_append(&extra, &oid[si->theirs[i]]);
|
2013-12-05 21:02:42 +08:00
|
|
|
setup_alternate_shallow(&shallow_lock,
|
|
|
|
|
&alternate_shallow_file,
|
|
|
|
|
&extra);
|
|
|
|
|
commit_lock_file(&shallow_lock);
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_clear(&extra);
|
|
|
|
|
oid_array_clear(&ref);
|
2013-12-05 21:02:42 +08:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2013-12-05 21:02:40 +08:00
|
|
|
/*
|
|
|
|
|
* remote is also shallow, check what ref is safe to update
|
|
|
|
|
* without updating .git/shallow
|
|
|
|
|
*/
|
|
|
|
|
status = xcalloc(nr_sought, sizeof(*status));
|
|
|
|
|
assign_shallow_commits_to_refs(si, NULL, status);
|
|
|
|
|
if (si->nr_ours || si->nr_theirs) {
|
|
|
|
|
for (i = 0; i < nr_sought; i++)
|
|
|
|
|
if (status[i])
|
|
|
|
|
sought[i]->status = REF_STATUS_REJECT_SHALLOW;
|
|
|
|
|
}
|
|
|
|
|
free(status);
|
2017-03-31 09:40:00 +08:00
|
|
|
oid_array_clear(&ref);
|
2013-12-05 21:02:37 +08:00
|
|
|
}
|
|
|
|
|
|
2012-10-26 23:53:55 +08:00
|
|
|
struct ref *fetch_pack(struct fetch_pack_args *args,
|
|
|
|
|
int fd[], struct child_process *conn,
|
|
|
|
|
const struct ref *ref,
|
|
|
|
|
const char *dest,
|
2013-01-30 06:02:15 +08:00
|
|
|
struct ref **sought, int nr_sought,
|
2017-03-31 09:40:00 +08:00
|
|
|
struct oid_array *shallow,
|
2012-10-26 23:53:55 +08:00
|
|
|
char **pack_lockfile)
|
|
|
|
|
{
|
|
|
|
|
struct ref *ref_cpy;
|
2013-12-05 21:02:39 +08:00
|
|
|
struct shallow_info si;
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
fetch_pack_setup();
|
2013-01-30 06:02:15 +08:00
|
|
|
if (nr_sought)
|
|
|
|
|
nr_sought = remove_duplicates_in_refs(sought, nr_sought);
|
2012-10-26 23:53:55 +08:00
|
|
|
|
|
|
|
|
if (!ref) {
|
|
|
|
|
packet_flush(fd[1]);
|
2016-06-12 18:53:55 +08:00
|
|
|
die(_("no matching remote head"));
|
2012-10-26 23:53:55 +08:00
|
|
|
}
|
2013-12-05 21:02:39 +08:00
|
|
|
prepare_shallow_info(&si, shallow);
|
|
|
|
|
ref_cpy = do_fetch_pack(args, fd, ref, sought, nr_sought,
|
|
|
|
|
&si, pack_lockfile);
|
2012-10-26 23:53:55 +08:00
|
|
|
reprepare_packed_git();
|
2013-12-05 21:02:40 +08:00
|
|
|
update_shallow(args, sought, nr_sought, &si);
|
2013-12-05 21:02:39 +08:00
|
|
|
clear_shallow_info(&si);
|
2012-10-26 23:53:55 +08:00
|
|
|
return ref_cpy;
|
|
|
|
|
}
|
2017-02-23 00:01:22 +08:00
|
|
|
|
|
|
|
|
int report_unmatched_refs(struct ref **sought, int nr_sought)
|
|
|
|
|
{
|
|
|
|
|
int i, ret = 0;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < nr_sought; i++) {
|
2017-02-23 00:05:57 +08:00
|
|
|
if (!sought[i])
|
2017-02-23 00:01:22 +08:00
|
|
|
continue;
|
2017-02-23 00:05:57 +08:00
|
|
|
switch (sought[i]->match_status) {
|
|
|
|
|
case REF_MATCHED:
|
|
|
|
|
continue;
|
|
|
|
|
case REF_NOT_MATCHED:
|
|
|
|
|
error(_("no such remote ref %s"), sought[i]->name);
|
|
|
|
|
break;
|
|
|
|
|
case REF_UNADVERTISED_NOT_ALLOWED:
|
|
|
|
|
error(_("Server does not allow request for unadvertised object %s"),
|
|
|
|
|
sought[i]->name);
|
|
|
|
|
break;
|
|
|
|
|
}
|
2017-02-23 00:01:22 +08:00
|
|
|
ret = 1;
|
|
|
|
|
}
|
|
|
|
|
return ret;
|
|
|
|
|
}
|
