]>
Commit | Line | Data |
---|---|---|
ab176ac4 DS |
1 | #include "test-tool.h" |
2 | #include "cache.h" | |
3 | #include "commit.h" | |
4 | #include "commit-reach.h" | |
5 | #include "config.h" | |
6 | #include "parse-options.h" | |
1fee1242 | 7 | #include "ref-filter.h" |
324dec01 | 8 | #include "string-list.h" |
ab176ac4 DS |
9 | #include "tag.h" |
10 | ||
324dec01 DS |
11 | static void print_sorted_commit_ids(struct commit_list *list) |
12 | { | |
13 | int i; | |
14 | struct string_list s = STRING_LIST_INIT_DUP; | |
15 | ||
16 | while (list) { | |
17 | string_list_append(&s, oid_to_hex(&list->item->object.oid)); | |
18 | list = list->next; | |
19 | } | |
20 | ||
21 | string_list_sort(&s); | |
22 | ||
23 | for (i = 0; i < s.nr; i++) | |
24 | printf("%s\n", s.items[i].string); | |
25 | ||
26 | string_list_clear(&s, 0); | |
27 | } | |
28 | ||
ab176ac4 DS |
29 | int cmd__reach(int ac, const char **av) |
30 | { | |
31 | struct object_id oid_A, oid_B; | |
5cd52de3 | 32 | struct commit *A, *B; |
1792bc12 | 33 | struct commit_list *X, *Y; |
b67f6b26 | 34 | struct object_array X_obj = OBJECT_ARRAY_INIT; |
4c7bb452 DS |
35 | struct commit **X_array, **Y_array; |
36 | int X_nr, X_alloc, Y_nr, Y_alloc; | |
ab176ac4 DS |
37 | struct strbuf buf = STRBUF_INIT; |
38 | struct repository *r = the_repository; | |
39 | ||
40 | setup_git_directory(); | |
41 | ||
42 | if (ac < 2) | |
43 | exit(1); | |
44 | ||
5cd52de3 | 45 | A = B = NULL; |
1792bc12 | 46 | X = Y = NULL; |
4c7bb452 DS |
47 | X_nr = Y_nr = 0; |
48 | X_alloc = Y_alloc = 16; | |
324dec01 | 49 | ALLOC_ARRAY(X_array, X_alloc); |
4c7bb452 | 50 | ALLOC_ARRAY(Y_array, Y_alloc); |
ab176ac4 DS |
51 | |
52 | while (strbuf_getline(&buf, stdin) != EOF) { | |
53 | struct object_id oid; | |
b67f6b26 DS |
54 | struct object *orig; |
55 | struct object *peeled; | |
ab176ac4 DS |
56 | struct commit *c; |
57 | if (buf.len < 3) | |
58 | continue; | |
59 | ||
60 | if (get_oid_committish(buf.buf + 2, &oid)) | |
61 | die("failed to resolve %s", buf.buf + 2); | |
62 | ||
b67f6b26 DS |
63 | orig = parse_object(r, &oid); |
64 | peeled = deref_tag_noverify(orig); | |
ab176ac4 | 65 | |
b67f6b26 | 66 | if (!peeled) |
ab176ac4 DS |
67 | die("failed to load commit for input %s resulting in oid %s\n", |
68 | buf.buf, oid_to_hex(&oid)); | |
69 | ||
b67f6b26 | 70 | c = object_as_type(r, peeled, OBJ_COMMIT, 0); |
ab176ac4 DS |
71 | |
72 | if (!c) | |
73 | die("failed to load commit for input %s resulting in oid %s\n", | |
74 | buf.buf, oid_to_hex(&oid)); | |
75 | ||
76 | switch (buf.buf[0]) { | |
77 | case 'A': | |
78 | oidcpy(&oid_A, &oid); | |
5cd52de3 | 79 | A = c; |
ab176ac4 DS |
80 | break; |
81 | ||
82 | case 'B': | |
83 | oidcpy(&oid_B, &oid); | |
5cd52de3 | 84 | B = c; |
ab176ac4 DS |
85 | break; |
86 | ||
6255232e DS |
87 | case 'X': |
88 | commit_list_insert(c, &X); | |
324dec01 DS |
89 | ALLOC_GROW(X_array, X_nr + 1, X_alloc); |
90 | X_array[X_nr++] = c; | |
b67f6b26 | 91 | add_object_array(orig, NULL, &X_obj); |
6255232e DS |
92 | break; |
93 | ||
1792bc12 DS |
94 | case 'Y': |
95 | commit_list_insert(c, &Y); | |
4c7bb452 DS |
96 | ALLOC_GROW(Y_array, Y_nr + 1, Y_alloc); |
97 | Y_array[Y_nr++] = c; | |
1792bc12 DS |
98 | break; |
99 | ||
ab176ac4 DS |
100 | default: |
101 | die("unexpected start of line: %c", buf.buf[0]); | |
102 | } | |
103 | } | |
104 | strbuf_release(&buf); | |
105 | ||
106 | if (!strcmp(av[1], "ref_newer")) | |
107 | printf("%s(A,B):%d\n", av[1], ref_newer(&oid_A, &oid_B)); | |
5cd52de3 DS |
108 | else if (!strcmp(av[1], "in_merge_bases")) |
109 | printf("%s(A,B):%d\n", av[1], in_merge_bases(A, B)); | |
6255232e | 110 | else if (!strcmp(av[1], "is_descendant_of")) |
c1ea625f | 111 | printf("%s(A,X):%d\n", av[1], repo_is_descendant_of(r, A, X)); |
324dec01 DS |
112 | else if (!strcmp(av[1], "get_merge_bases_many")) { |
113 | struct commit_list *list = get_merge_bases_many(A, X_nr, X_array); | |
114 | printf("%s(A,X):\n", av[1]); | |
115 | print_sorted_commit_ids(list); | |
0c89f715 DS |
116 | } else if (!strcmp(av[1], "reduce_heads")) { |
117 | struct commit_list *list = reduce_heads(X); | |
118 | printf("%s(X):\n", av[1]); | |
119 | print_sorted_commit_ids(list); | |
1792bc12 DS |
120 | } else if (!strcmp(av[1], "can_all_from_reach")) { |
121 | printf("%s(X,Y):%d\n", av[1], can_all_from_reach(X, Y, 1)); | |
b67f6b26 DS |
122 | } else if (!strcmp(av[1], "can_all_from_reach_with_flag")) { |
123 | struct commit_list *iter = Y; | |
124 | ||
125 | while (iter) { | |
126 | iter->item->object.flags |= 2; | |
127 | iter = iter->next; | |
128 | } | |
129 | ||
130 | printf("%s(X,_,_,0,0):%d\n", av[1], can_all_from_reach_with_flag(&X_obj, 2, 4, 0, 0)); | |
1fee1242 DS |
131 | } else if (!strcmp(av[1], "commit_contains")) { |
132 | struct ref_filter filter; | |
133 | struct contains_cache cache; | |
134 | init_contains_cache(&cache); | |
135 | ||
136 | if (ac > 2 && !strcmp(av[2], "--tag")) | |
137 | filter.with_commit_tag_algo = 1; | |
138 | else | |
139 | filter.with_commit_tag_algo = 0; | |
140 | ||
141 | printf("%s(_,A,X,_):%d\n", av[1], commit_contains(&filter, A, X, &cache)); | |
4c7bb452 DS |
142 | } else if (!strcmp(av[1], "get_reachable_subset")) { |
143 | const int reachable_flag = 1; | |
144 | int i, count = 0; | |
145 | struct commit_list *current; | |
146 | struct commit_list *list = get_reachable_subset(X_array, X_nr, | |
147 | Y_array, Y_nr, | |
148 | reachable_flag); | |
149 | printf("get_reachable_subset(X,Y)\n"); | |
150 | for (current = list; current; current = current->next) { | |
151 | if (!(list->item->object.flags & reachable_flag)) | |
152 | die(_("commit %s is not marked reachable"), | |
153 | oid_to_hex(&list->item->object.oid)); | |
154 | count++; | |
155 | } | |
156 | for (i = 0; i < Y_nr; i++) { | |
157 | if (Y_array[i]->object.flags & reachable_flag) | |
158 | count--; | |
159 | } | |
160 | ||
161 | if (count < 0) | |
162 | die(_("too many commits marked reachable")); | |
163 | ||
164 | print_sorted_commit_ids(list); | |
324dec01 | 165 | } |
ab176ac4 DS |
166 | |
167 | exit(0); | |
168 | } |