Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
73 changes: 0 additions & 73 deletions commit-reach.c
Original file line number Diff line number Diff line change
Expand Up @@ -964,79 +964,6 @@ int can_all_from_reach(struct commit_list *from, struct commit_list *to,
return result;
}

struct commit_list *get_reachable_subset(struct commit **from, size_t nr_from,
struct commit **to, size_t nr_to,
unsigned int reachable_flag)
{
struct commit **item;
struct commit *current;
struct commit_list *found_commits = NULL;
struct commit **to_last = to + nr_to;
struct commit **from_last = from + nr_from;
timestamp_t min_generation = GENERATION_NUMBER_INFINITY;
int num_to_find = 0;

struct prio_queue queue = { compare_commits_by_gen_then_commit_date };

for (item = to; item < to_last; item++) {
timestamp_t generation;
struct commit *c = *item;

repo_parse_commit(the_repository, c);
generation = commit_graph_generation(c);
if (generation < min_generation)
min_generation = generation;

if (!(c->object.flags & PARENT1)) {
c->object.flags |= PARENT1;
num_to_find++;
}
}

for (item = from; item < from_last; item++) {
struct commit *c = *item;
if (!(c->object.flags & PARENT2)) {
c->object.flags |= PARENT2;
repo_parse_commit(the_repository, c);

prio_queue_put(&queue, *item);
}
}

while (num_to_find && (current = prio_queue_get(&queue)) != NULL) {
struct commit_list *parents;

if (current->object.flags & PARENT1) {
current->object.flags &= ~PARENT1;
current->object.flags |= reachable_flag;
commit_list_insert(current, &found_commits);
num_to_find--;
}

for (parents = current->parents; parents; parents = parents->next) {
struct commit *p = parents->item;

repo_parse_commit(the_repository, p);

if (commit_graph_generation(p) < min_generation)
continue;

if (p->object.flags & PARENT2)
continue;

p->object.flags |= PARENT2;
prio_queue_put(&queue, p);
}
}

clear_prio_queue(&queue);

clear_commit_marks_many(nr_to, to, PARENT1);
clear_commit_marks_many(nr_from, from, PARENT2);

return found_commits;
}

define_commit_slab(bit_arrays, struct bitmap *);
static struct bit_arrays bit_arrays;

Expand Down
12 changes: 0 additions & 12 deletions commit-reach.h
Original file line number Diff line number Diff line change
Expand Up @@ -97,18 +97,6 @@ int can_all_from_reach(struct commit_list *from, struct commit_list *to,
int commit_date_cutoff);


/*
* Return a list of commits containing the commits in the 'to' array
* that are reachable from at least one commit in the 'from' array.
* Also add the given 'flag' to each of the commits in the returned list.
*
* This method uses the PARENT1 and PARENT2 flags during its operation,
* so be sure these flags are not set before calling the method.
*/
struct commit_list *get_reachable_subset(struct commit **from, size_t nr_from,
struct commit **to, size_t nr_to,
unsigned int reachable_flag);

struct ahead_behind_count {
/**
* As input, the *_index members indicate which positions in
Expand Down
19 changes: 9 additions & 10 deletions remote.c
Original file line number Diff line number Diff line change
Expand Up @@ -1459,9 +1459,8 @@ static void add_missing_tags(struct ref *src, struct ref **dst, struct ref ***ds
* sent to the other side.
*/
if (sent_tips.nr) {
const int reachable_flag = 1;
struct commit_list *found_commits;
struct commit_stack src_commits = COMMIT_STACK_INIT;
struct commit_list *bases = NULL;

for_each_string_list_item(item, &src_tag) {
struct ref *ref = item->util;
Expand All @@ -1479,11 +1478,12 @@ static void add_missing_tags(struct ref *src, struct ref **dst, struct ref ***ds
commit_stack_push(&src_commits, commit);
}

found_commits = get_reachable_subset(sent_tips.items,
sent_tips.nr,
src_commits.items,
src_commits.nr,
reachable_flag);
for (size_t i = 0; i < sent_tips.nr; i++)
commit_list_insert(sent_tips.items[i], &bases);
tips_reachable_from_bases(the_repository,
bases, src_commits.items,
src_commits.nr, TMP_MARK);
commit_list_free(bases);

for_each_string_list_item(item, &src_tag) {
struct ref *dst_ref;
Expand All @@ -1503,7 +1503,7 @@ static void add_missing_tags(struct ref *src, struct ref **dst, struct ref ***ds
* Is this tag, which they do not have, reachable from
* any of the commits we are sending?
*/
if (!(commit->object.flags & reachable_flag))
if (!(commit->object.flags & TMP_MARK))
continue;

/* Add it in */
Expand All @@ -1513,9 +1513,8 @@ static void add_missing_tags(struct ref *src, struct ref **dst, struct ref ***ds
}

clear_commit_marks_many(src_commits.nr, src_commits.items,
reachable_flag);
TMP_MARK);
commit_stack_clear(&src_commits);
commit_list_free(found_commits);
}

string_list_clear(&src_tag, 0);
Expand Down
38 changes: 18 additions & 20 deletions t/helper/test-reach.c
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,7 @@
#include "hex.h"
#include "object-name.h"
#include "ref-filter.h"
#include "revision.h"
#include "setup.h"
#include "string-list.h"
#include "tag.h"
Expand Down Expand Up @@ -149,29 +150,26 @@ int cmd__reach(int ac, const char **av)

printf("%s(_,A,X,_):%d\n", av[1], commit_contains(&filter, A, X, &cache));
clear_contains_cache(&cache);
} else if (!strcmp(av[1], "get_reachable_subset")) {
const int reachable_flag = 1;
int count = 0;
struct commit_list *current;
struct commit_list *list = get_reachable_subset(X_stack.items, X_stack.nr,
Y_stack.items, Y_stack.nr,
reachable_flag);
printf("get_reachable_subset(X,Y)\n");
for (current = list; current; current = current->next) {
if (!(list->item->object.flags & reachable_flag))
die(_("commit %s is not marked reachable"),
oid_to_hex(&list->item->object.oid));
count++;
}
for (size_t i = 0; i < Y_stack.nr; i++) {
if (Y_stack.items[i]->object.flags & reachable_flag)
count--;
}
} else if (!strcmp(av[1], "tips_reachable_from_bases")) {
struct commit_list *list = NULL;
struct commit_list *bases = NULL;

if (count < 0)
die(_("too many commits marked reachable"));
for (size_t i = 0; i < X_stack.nr; i++)
commit_list_insert(X_stack.items[i], &bases);
tips_reachable_from_bases(the_repository,
bases, Y_stack.items,
Y_stack.nr, TMP_MARK);
commit_list_free(bases);

printf("tips_reachable_from_bases(X,Y)\n");
for (size_t i = 0; i < Y_stack.nr; i++) {
if (Y_stack.items[i]->object.flags & TMP_MARK)
commit_list_insert(Y_stack.items[i], &list);
}
print_sorted_commit_ids(list);

clear_commit_marks_many(Y_stack.nr, Y_stack.items,
TMP_MARK);
commit_list_free(list);
}

Expand Down
18 changes: 9 additions & 9 deletions t/t6600-test-reach.sh
Original file line number Diff line number Diff line change
Expand Up @@ -391,7 +391,7 @@ test_expect_success 'rev-list: symmetric difference topo-order' '
run_all_modes git rev-list --topo-order commit-3-8...commit-6-6
'

test_expect_success 'get_reachable_subset:all' '
test_expect_success 'tips_reachable_from_bases:all' '
cat >input <<-\EOF &&
X:commit-9-1
X:commit-8-3
Expand All @@ -403,15 +403,15 @@ test_expect_success 'get_reachable_subset:all' '
Y:commit-5-6
EOF
(
echo "get_reachable_subset(X,Y)" &&
echo "tips_reachable_from_bases(X,Y)" &&
git rev-parse commit-3-3 \
commit-1-7 \
commit-5-6 | sort
) >expect &&
test_all_modes get_reachable_subset
test_all_modes tips_reachable_from_bases
'

test_expect_success 'get_reachable_subset:some' '
test_expect_success 'tips_reachable_from_bases:some' '
cat >input <<-\EOF &&
X:commit-9-1
X:commit-8-3
Expand All @@ -422,14 +422,14 @@ test_expect_success 'get_reachable_subset:some' '
Y:commit-5-6
EOF
(
echo "get_reachable_subset(X,Y)" &&
echo "tips_reachable_from_bases(X,Y)" &&
git rev-parse commit-3-3 \
commit-1-7 | sort
) >expect &&
test_all_modes get_reachable_subset
test_all_modes tips_reachable_from_bases
'

test_expect_success 'get_reachable_subset:none' '
test_expect_success 'tips_reachable_from_bases:none' '
cat >input <<-\EOF &&
X:commit-9-1
X:commit-8-3
Expand All @@ -439,8 +439,8 @@ test_expect_success 'get_reachable_subset:none' '
Y:commit-7-6
Y:commit-2-8
EOF
echo "get_reachable_subset(X,Y)" >expect &&
test_all_modes get_reachable_subset
echo "tips_reachable_from_bases(X,Y)" >expect &&
test_all_modes tips_reachable_from_bases
'

test_expect_success 'for-each-ref ahead-behind:linear' '
Expand Down
Loading