]>
Commit | Line | Data |
---|---|---|
64745109 LT |
1 | #include "cache.h" |
2 | #include "commit.h" | |
c4e05b1a | 3 | #include "diff.h" |
ae563542 | 4 | #include "revision.h" |
c64ed70d | 5 | #include "list-objects.h" |
5fb61b8d | 6 | #include "builtin.h" |
50e62a8e | 7 | #include "log-tree.h" |
7fefda5c | 8 | #include "graph.h" |
a2ad79ce | 9 | #include "bisect.h" |
8906300f | 10 | |
a6f68d47 | 11 | static const char rev_list_usage[] = |
1b1dd23f | 12 | "git rev-list [OPTION] <commit-id>... [ -- paths... ]\n" |
69e0c256 JH |
13 | " limiting output:\n" |
14 | " --max-count=nr\n" | |
15 | " --max-age=epoch\n" | |
16 | " --min-age=epoch\n" | |
17 | " --sparse\n" | |
18 | " --no-merges\n" | |
93b74bca | 19 | " --remove-empty\n" |
69e0c256 | 20 | " --all\n" |
a5aa930d UKK |
21 | " --branches\n" |
22 | " --tags\n" | |
23 | " --remotes\n" | |
42cabc34 | 24 | " --stdin\n" |
27350891 | 25 | " --quiet\n" |
69e0c256 | 26 | " ordering output:\n" |
69e0c256 | 27 | " --topo-order\n" |
4c8725f1 | 28 | " --date-order\n" |
7ccd3667 | 29 | " --reverse\n" |
69e0c256 JH |
30 | " formatting output:\n" |
31 | " --parents\n" | |
72276a3e | 32 | " --children\n" |
c6496575 | 33 | " --objects | --objects-edge\n" |
69e0c256 JH |
34 | " --unpacked\n" |
35 | " --header | --pretty\n" | |
9da5c2f0 | 36 | " --abbrev=nr | --no-abbrev\n" |
5c51c985 | 37 | " --abbrev-commit\n" |
b24bace5 | 38 | " --left-right\n" |
69e0c256 | 39 | " special purpose:\n" |
457f08a0 | 40 | " --bisect\n" |
50e62a8e CC |
41 | " --bisect-vars\n" |
42 | " --bisect-all" | |
69e0c256 | 43 | ; |
a6f68d47 | 44 | |
11c211fa CC |
45 | static void finish_commit(struct commit *commit, void *data); |
46 | static void show_commit(struct commit *commit, void *data) | |
81f2bb1f | 47 | { |
d797257e CC |
48 | struct rev_list_info *info = data; |
49 | struct rev_info *revs = info->revs; | |
11c211fa CC |
50 | |
51 | graph_show_commit(revs->graph); | |
7fefda5c | 52 | |
d797257e | 53 | if (info->show_timestamp) |
dc68c4ff | 54 | printf("%lu ", commit->date); |
d797257e CC |
55 | if (info->header_prefix) |
56 | fputs(info->header_prefix, stdout); | |
7528f27d | 57 | |
11c211fa | 58 | if (!revs->graph) { |
7528f27d AS |
59 | if (commit->object.flags & BOUNDARY) |
60 | putchar('-'); | |
61 | else if (commit->object.flags & UNINTERESTING) | |
62 | putchar('^'); | |
11c211fa | 63 | else if (revs->left_right) { |
7528f27d AS |
64 | if (commit->object.flags & SYMMETRIC_LEFT) |
65 | putchar('<'); | |
66 | else | |
67 | putchar('>'); | |
68 | } | |
577ed5c2 | 69 | } |
11c211fa CC |
70 | if (revs->abbrev_commit && revs->abbrev) |
71 | fputs(find_unique_abbrev(commit->object.sha1, revs->abbrev), | |
7594c4b2 | 72 | stdout); |
5c51c985 JH |
73 | else |
74 | fputs(sha1_to_hex(commit->object.sha1), stdout); | |
11c211fa | 75 | if (revs->print_parents) { |
81f2bb1f LT |
76 | struct commit_list *parents = commit->parents; |
77 | while (parents) { | |
1ed84157 | 78 | printf(" %s", sha1_to_hex(parents->item->object.sha1)); |
81f2bb1f LT |
79 | parents = parents->next; |
80 | } | |
81 | } | |
11c211fa | 82 | if (revs->children.name) { |
72276a3e JH |
83 | struct commit_list *children; |
84 | ||
11c211fa | 85 | children = lookup_decoration(&revs->children, &commit->object); |
72276a3e JH |
86 | while (children) { |
87 | printf(" %s", sha1_to_hex(children->item->object.sha1)); | |
88 | children = children->next; | |
89 | } | |
90 | } | |
11c211fa CC |
91 | show_decorations(revs, commit); |
92 | if (revs->commit_format == CMIT_FMT_ONELINE) | |
d87449c5 JH |
93 | putchar(' '); |
94 | else | |
95 | putchar('\n'); | |
96 | ||
11c211fa | 97 | if (revs->verbose_header && commit->buffer) { |
f285a2d7 | 98 | struct strbuf buf = STRBUF_INIT; |
dd2e794a TR |
99 | struct pretty_print_context ctx = {0}; |
100 | ctx.abbrev = revs->abbrev; | |
101 | ctx.date_mode = revs->date_mode; | |
102 | pretty_print_commit(revs->commit_format, commit, &buf, &ctx); | |
11c211fa | 103 | if (revs->graph) { |
7fefda5c | 104 | if (buf.len) { |
11c211fa CC |
105 | if (revs->commit_format != CMIT_FMT_ONELINE) |
106 | graph_show_oneline(revs->graph); | |
7fefda5c | 107 | |
11c211fa | 108 | graph_show_commit_msg(revs->graph, &buf); |
7fefda5c AS |
109 | |
110 | /* | |
111 | * Add a newline after the commit message. | |
112 | * | |
113 | * Usually, this newline produces a blank | |
114 | * padding line between entries, in which case | |
115 | * we need to add graph padding on this line. | |
116 | * | |
117 | * However, the commit message may not end in a | |
118 | * newline. In this case the newline simply | |
119 | * ends the last line of the commit message, | |
120 | * and we don't need any graph output. (This | |
121 | * always happens with CMIT_FMT_ONELINE, and it | |
122 | * happens with CMIT_FMT_USERFORMAT when the | |
123 | * format doesn't explicitly end in a newline.) | |
124 | */ | |
125 | if (buf.len && buf.buf[buf.len - 1] == '\n') | |
11c211fa | 126 | graph_show_padding(revs->graph); |
7fefda5c AS |
127 | putchar('\n'); |
128 | } else { | |
129 | /* | |
130 | * If the message buffer is empty, just show | |
131 | * the rest of the graph output for this | |
132 | * commit. | |
133 | */ | |
11c211fa | 134 | if (graph_show_remainder(revs->graph)) |
7fefda5c AS |
135 | putchar('\n'); |
136 | } | |
137 | } else { | |
138 | if (buf.len) | |
d797257e | 139 | printf("%s%c", buf.buf, info->hdr_termination); |
7fefda5c | 140 | } |
674d1727 | 141 | strbuf_release(&buf); |
7fefda5c | 142 | } else { |
11c211fa | 143 | if (graph_show_remainder(revs->graph)) |
7fefda5c | 144 | putchar('\n'); |
7620d39f | 145 | } |
06f59e9f | 146 | maybe_flush_or_die(stdout, "stdout"); |
11c211fa | 147 | finish_commit(commit, data); |
27350891 SP |
148 | } |
149 | ||
11c211fa | 150 | static void finish_commit(struct commit *commit, void *data) |
27350891 | 151 | { |
cb115748 LT |
152 | if (commit->parents) { |
153 | free_commit_list(commit->parents); | |
154 | commit->parents = NULL; | |
155 | } | |
4cac42b1 JH |
156 | free(commit->buffer); |
157 | commit->buffer = NULL; | |
a3437b8c JS |
158 | } |
159 | ||
cf2ab916 | 160 | static void finish_object(struct object *obj, const struct name_path *path, const char *name) |
27350891 | 161 | { |
8d2dfc49 LT |
162 | if (obj->type == OBJ_BLOB && !has_sha1_file(obj->sha1)) |
163 | die("missing blob object '%s'", sha1_to_hex(obj->sha1)); | |
27350891 SP |
164 | } |
165 | ||
cf2ab916 | 166 | static void show_object(struct object *obj, const struct name_path *path, const char *component) |
9de48752 | 167 | { |
cf2ab916 | 168 | char *name = path_name(path, component); |
c64ed70d | 169 | /* An object with name "foo\n0000000..." can be used to |
f18d244a | 170 | * confuse downstream "git pack-objects" very badly. |
c64ed70d | 171 | */ |
8d2dfc49 | 172 | const char *ep = strchr(name, '\n'); |
b9849a1a | 173 | |
cf2ab916 | 174 | finish_object(obj, path, name); |
c64ed70d | 175 | if (ep) { |
8d2dfc49 LT |
176 | printf("%s %.*s\n", sha1_to_hex(obj->sha1), |
177 | (int) (ep - name), | |
178 | name); | |
9de48752 | 179 | } |
c64ed70d | 180 | else |
8d2dfc49 | 181 | printf("%s %s\n", sha1_to_hex(obj->sha1), name); |
cf2ab916 | 182 | free(name); |
9de48752 LT |
183 | } |
184 | ||
8d1d8f83 JH |
185 | static void show_edge(struct commit *commit) |
186 | { | |
187 | printf("-%s\n", sha1_to_hex(commit->object.sha1)); | |
188 | } | |
189 | ||
9f199b15 CC |
190 | static inline int log2i(int n) |
191 | { | |
192 | int log2 = 0; | |
193 | ||
194 | for (; n > 1; n >>= 1) | |
195 | log2++; | |
196 | ||
197 | return log2; | |
198 | } | |
199 | ||
200 | static inline int exp2i(int n) | |
201 | { | |
202 | return 1 << n; | |
203 | } | |
204 | ||
205 | /* | |
206 | * Estimate the number of bisect steps left (after the current step) | |
207 | * | |
208 | * For any x between 0 included and 2^n excluded, the probability for | |
209 | * n - 1 steps left looks like: | |
210 | * | |
211 | * P(2^n + x) == (2^n - x) / (2^n + x) | |
212 | * | |
213 | * and P(2^n + x) < 0.5 means 2^n < 3x | |
214 | */ | |
1c876546 | 215 | int estimate_bisect_steps(int all) |
9f199b15 CC |
216 | { |
217 | int n, x, e; | |
218 | ||
219 | if (all < 3) | |
220 | return 0; | |
221 | ||
222 | n = log2i(all); | |
223 | e = exp2i(n); | |
224 | x = all - e; | |
225 | ||
226 | return (e < 3 * x) ? n : n - 1; | |
227 | } | |
228 | ||
280e65cb CC |
229 | void print_commit_list(struct commit_list *list, |
230 | const char *format_cur, | |
231 | const char *format_last) | |
232 | { | |
233 | for ( ; list; list = list->next) { | |
234 | const char *format = list->next ? format_cur : format_last; | |
235 | printf(format, sha1_to_hex(list->item->object.sha1)); | |
236 | } | |
237 | } | |
238 | ||
38ef7507 | 239 | static void show_tried_revs(struct commit_list *tried) |
95188648 CC |
240 | { |
241 | printf("bisect_tried='"); | |
280e65cb | 242 | print_commit_list(tried, "%s|", "%s"); |
38ef7507 | 243 | printf("'\n"); |
95188648 CC |
244 | } |
245 | ||
38ef7507 | 246 | static void print_var_str(const char *var, const char *val) |
280e65cb | 247 | { |
38ef7507 | 248 | printf("%s='%s'\n", var, val); |
280e65cb CC |
249 | } |
250 | ||
38ef7507 | 251 | static void print_var_int(const char *var, int val) |
280e65cb | 252 | { |
38ef7507 | 253 | printf("%s=%d\n", var, val); |
280e65cb CC |
254 | } |
255 | ||
13858e57 | 256 | int show_bisect_vars(struct rev_list_info *info, int reaches, int all) |
9996983c | 257 | { |
38ef7507 | 258 | int cnt, flags = info->bisect_show_flags; |
280e65cb | 259 | char hex[41] = ""; |
95188648 | 260 | struct commit_list *tried; |
d797257e | 261 | struct rev_info *revs = info->revs; |
9996983c | 262 | |
37c4c38d | 263 | if (!revs->commits && !(flags & BISECT_SHOW_TRIED)) |
9996983c CC |
264 | return 1; |
265 | ||
9af3589e CC |
266 | revs->commits = filter_skipped(revs->commits, &tried, |
267 | flags & BISECT_SHOW_ALL, | |
268 | NULL, NULL); | |
95188648 | 269 | |
9996983c | 270 | /* |
7428d754 | 271 | * revs->commits can reach "reaches" commits among |
9996983c CC |
272 | * "all" commits. If it is good, then there are |
273 | * (all-reaches) commits left to be bisected. | |
274 | * On the other hand, if it is bad, then the set | |
275 | * to bisect is "reaches". | |
276 | * A bisect set of size N has (N-1) commits further | |
277 | * to test, as we already know one bad one. | |
278 | */ | |
279 | cnt = all - reaches; | |
280 | if (cnt < reaches) | |
281 | cnt = reaches; | |
6a17fad7 | 282 | |
95188648 CC |
283 | if (revs->commits) |
284 | strcpy(hex, sha1_to_hex(revs->commits->item->object.sha1)); | |
9996983c | 285 | |
37c4c38d | 286 | if (flags & BISECT_SHOW_ALL) { |
d797257e | 287 | traverse_commit_list(revs, show_commit, show_object, info); |
9996983c CC |
288 | printf("------\n"); |
289 | } | |
290 | ||
37c4c38d | 291 | if (flags & BISECT_SHOW_TRIED) |
38ef7507 CC |
292 | show_tried_revs(tried); |
293 | ||
294 | print_var_str("bisect_rev", hex); | |
295 | print_var_int("bisect_nr", cnt - 1); | |
296 | print_var_int("bisect_good", all - reaches - 1); | |
297 | print_var_int("bisect_bad", reaches - 1); | |
298 | print_var_int("bisect_all", all); | |
299 | print_var_int("bisect_steps", estimate_bisect_steps(all)); | |
9996983c CC |
300 | |
301 | return 0; | |
302 | } | |
303 | ||
a633fca0 | 304 | int cmd_rev_list(int argc, const char **argv, const char *prefix) |
64745109 | 305 | { |
11c211fa | 306 | struct rev_info revs; |
d797257e | 307 | struct rev_list_info info; |
d9a83684 | 308 | int i; |
ff62d732 | 309 | int bisect_list = 0; |
457f08a0 | 310 | int bisect_show_vars = 0; |
50e62a8e | 311 | int bisect_find_all = 0; |
27350891 | 312 | int quiet = 0; |
64745109 | 313 | |
ef90d6d4 | 314 | git_config(git_default_config, NULL); |
a633fca0 | 315 | init_revisions(&revs, prefix); |
7594c4b2 JH |
316 | revs.abbrev = 0; |
317 | revs.commit_format = CMIT_FMT_UNSPECIFIED; | |
a4a88b2b | 318 | argc = setup_revisions(argc, argv, &revs, NULL); |
ae563542 | 319 | |
d797257e CC |
320 | memset(&info, 0, sizeof(info)); |
321 | info.revs = &revs; | |
ad3f9a71 LT |
322 | if (revs.bisect) |
323 | bisect_list = 1; | |
d797257e | 324 | |
d85fe389 | 325 | quiet = DIFF_OPT_TST(&revs.diffopt, QUIET); |
fcfda02b | 326 | for (i = 1 ; i < argc; i++) { |
cf484544 | 327 | const char *arg = argv[i]; |
fcfda02b | 328 | |
a6f68d47 | 329 | if (!strcmp(arg, "--header")) { |
7594c4b2 | 330 | revs.verbose_header = 1; |
9d97aa64 LT |
331 | continue; |
332 | } | |
dc68c4ff | 333 | if (!strcmp(arg, "--timestamp")) { |
d797257e | 334 | info.show_timestamp = 1; |
dc68c4ff JH |
335 | continue; |
336 | } | |
8b3a1e05 LT |
337 | if (!strcmp(arg, "--bisect")) { |
338 | bisect_list = 1; | |
339 | continue; | |
340 | } | |
50e62a8e CC |
341 | if (!strcmp(arg, "--bisect-all")) { |
342 | bisect_list = 1; | |
343 | bisect_find_all = 1; | |
13858e57 | 344 | info.bisect_show_flags = BISECT_SHOW_ALL; |
6e46cc0d | 345 | revs.show_decorations = 1; |
50e62a8e CC |
346 | continue; |
347 | } | |
457f08a0 JH |
348 | if (!strcmp(arg, "--bisect-vars")) { |
349 | bisect_list = 1; | |
350 | bisect_show_vars = 1; | |
351 | continue; | |
352 | } | |
ae563542 | 353 | usage(rev_list_usage); |
a6f68d47 | 354 | |
fcfda02b | 355 | } |
7594c4b2 JH |
356 | if (revs.commit_format != CMIT_FMT_UNSPECIFIED) { |
357 | /* The command line has a --pretty */ | |
d797257e | 358 | info.hdr_termination = '\n'; |
7594c4b2 | 359 | if (revs.commit_format == CMIT_FMT_ONELINE) |
d797257e | 360 | info.header_prefix = ""; |
7594c4b2 | 361 | else |
d797257e | 362 | info.header_prefix = "commit "; |
7594c4b2 | 363 | } |
db89665f JH |
364 | else if (revs.verbose_header) |
365 | /* Only --header was specified */ | |
366 | revs.commit_format = CMIT_FMT_RAW; | |
fcfda02b | 367 | |
d797257e | 368 | if ((!revs.commits && |
8c1f0b44 | 369 | (!(revs.tag_objects||revs.tree_objects||revs.blob_objects) && |
1f1e895f | 370 | !revs.pending.nr)) || |
8c1f0b44 | 371 | revs.diff) |
7b34c2fa LT |
372 | usage(rev_list_usage); |
373 | ||
0843acfd JK |
374 | save_commit_buffer = revs.verbose_header || |
375 | revs.grep_filter.pattern_list; | |
4e1dc640 JH |
376 | if (bisect_list) |
377 | revs.limited = 1; | |
9181ca2c | 378 | |
3d51e1b5 MK |
379 | if (prepare_revision_walk(&revs)) |
380 | die("revision walk setup failed"); | |
a4a88b2b | 381 | if (revs.tree_objects) |
8d1d8f83 | 382 | mark_edges_uninteresting(revs.commits, &revs, show_edge); |
a4a88b2b | 383 | |
457f08a0 JH |
384 | if (bisect_list) { |
385 | int reaches = reaches, all = all; | |
386 | ||
50e62a8e CC |
387 | revs.commits = find_bisection(revs.commits, &reaches, &all, |
388 | bisect_find_all); | |
95188648 | 389 | |
9996983c | 390 | if (bisect_show_vars) |
13858e57 | 391 | return show_bisect_vars(&info, reaches, all); |
457f08a0 | 392 | } |
7b34c2fa | 393 | |
27350891 | 394 | traverse_commit_list(&revs, |
11c211fa CC |
395 | quiet ? finish_commit : show_commit, |
396 | quiet ? finish_object : show_object, | |
d797257e | 397 | &info); |
8906300f | 398 | |
64745109 LT |
399 | return 0; |
400 | } |