1#include "cache.h"
2#include "commit.h"
3#include "diff.h"
4#include "revision.h"
5#include "list-objects.h"
6#include "pack.h"
7#include "pack-bitmap.h"
8#include "builtin.h"
9#include "log-tree.h"
10#include "graph.h"
11#include "bisect.h"
12static const char rev_list_usage[] =
14"git rev-list [OPTION] <commit-id>... [ -- paths... ]\n"
15" limiting output:\n"
16" --max-count=<n>\n"
17" --max-age=<epoch>\n"
18" --min-age=<epoch>\n"
19" --sparse\n"
20" --no-merges\n"
21" --min-parents=<n>\n"
22" --no-min-parents\n"
23" --max-parents=<n>\n"
24" --no-max-parents\n"
25" --remove-empty\n"
26" --all\n"
27" --branches\n"
28" --tags\n"
29" --remotes\n"
30" --stdin\n"
31" --quiet\n"
32" ordering output:\n"
33" --topo-order\n"
34" --date-order\n"
35" --reverse\n"
36" formatting output:\n"
37" --parents\n"
38" --children\n"
39" --objects | --objects-edge\n"
40" --unpacked\n"
41" --header | --pretty\n"
42" --abbrev=<n> | --no-abbrev\n"
43" --abbrev-commit\n"
44" --left-right\n"
45" --count\n"
46" special purpose:\n"
47" --bisect\n"
48" --bisect-vars\n"
49" --bisect-all"
50;
51static void finish_commit(struct commit *commit, void *data);
53static void show_commit(struct commit *commit, void *data)
54{
55 struct rev_list_info *info = data;
56 struct rev_info *revs = info->revs;
57 if (info->flags & REV_LIST_QUIET) {
59 finish_commit(commit, data);
60 return;
61 }
62 graph_show_commit(revs->graph);
64 if (revs->count) {
66 if (commit->object.flags & PATCHSAME)
67 revs->count_same++;
68 else if (commit->object.flags & SYMMETRIC_LEFT)
69 revs->count_left++;
70 else
71 revs->count_right++;
72 finish_commit(commit, data);
73 return;
74 }
75 if (info->show_timestamp)
77 printf("%lu ", commit->date);
78 if (info->header_prefix)
79 fputs(info->header_prefix, stdout);
80 if (!revs->graph)
82 fputs(get_revision_mark(revs, commit), stdout);
83 if (revs->abbrev_commit && revs->abbrev)
84 fputs(find_unique_abbrev(commit->object.sha1, revs->abbrev),
85 stdout);
86 else
87 fputs(sha1_to_hex(commit->object.sha1), stdout);
88 if (revs->print_parents) {
89 struct commit_list *parents = commit->parents;
90 while (parents) {
91 printf(" %s", sha1_to_hex(parents->item->object.sha1));
92 parents = parents->next;
93 }
94 }
95 if (revs->children.name) {
96 struct commit_list *children;
97 children = lookup_decoration(&revs->children, &commit->object);
99 while (children) {
100 printf(" %s", sha1_to_hex(children->item->object.sha1));
101 children = children->next;
102 }
103 }
104 show_decorations(revs, commit);
105 if (revs->commit_format == CMIT_FMT_ONELINE)
106 putchar(' ');
107 else
108 putchar('\n');
109 if (revs->verbose_header && get_cached_commit_buffer(commit, NULL)) {
111 struct strbuf buf = STRBUF_INIT;
112 struct pretty_print_context ctx = {0};
113 ctx.abbrev = revs->abbrev;
114 ctx.date_mode = revs->date_mode;
115 ctx.date_mode_explicit = revs->date_mode_explicit;
116 ctx.fmt = revs->commit_format;
117 ctx.output_encoding = get_log_output_encoding();
118 pretty_print_commit(&ctx, commit, &buf);
119 if (revs->graph) {
120 if (buf.len) {
121 if (revs->commit_format != CMIT_FMT_ONELINE)
122 graph_show_oneline(revs->graph);
123 graph_show_commit_msg(revs->graph, &buf);
125 /*
127 * Add a newline after the commit message.
128 *
129 * Usually, this newline produces a blank
130 * padding line between entries, in which case
131 * we need to add graph padding on this line.
132 *
133 * However, the commit message may not end in a
134 * newline. In this case the newline simply
135 * ends the last line of the commit message,
136 * and we don't need any graph output. (This
137 * always happens with CMIT_FMT_ONELINE, and it
138 * happens with CMIT_FMT_USERFORMAT when the
139 * format doesn't explicitly end in a newline.)
140 */
141 if (buf.len && buf.buf[buf.len - 1] == '\n')
142 graph_show_padding(revs->graph);
143 putchar('\n');
144 } else {
145 /*
146 * If the message buffer is empty, just show
147 * the rest of the graph output for this
148 * commit.
149 */
150 if (graph_show_remainder(revs->graph))
151 putchar('\n');
152 if (revs->commit_format == CMIT_FMT_ONELINE)
153 putchar('\n');
154 }
155 } else {
156 if (revs->commit_format != CMIT_FMT_USERFORMAT ||
157 buf.len) {
158 fwrite(buf.buf, 1, buf.len, stdout);
159 putchar(info->hdr_termination);
160 }
161 }
162 strbuf_release(&buf);
163 } else {
164 if (graph_show_remainder(revs->graph))
165 putchar('\n');
166 }
167 maybe_flush_or_die(stdout, "stdout");
168 finish_commit(commit, data);
169}
170static void finish_commit(struct commit *commit, void *data)
172{
173 if (commit->parents) {
174 free_commit_list(commit->parents);
175 commit->parents = NULL;
176 }
177 free_commit_buffer(commit);
178}
179static void finish_object(struct object *obj,
181 const struct name_path *path, const char *name,
182 void *cb_data)
183{
184 struct rev_list_info *info = cb_data;
185 if (obj->type == OBJ_BLOB && !has_sha1_file(obj->sha1))
186 die("missing blob object '%s'", sha1_to_hex(obj->sha1));
187 if (info->revs->verify_objects && !obj->parsed && obj->type != OBJ_COMMIT)
188 parse_object(obj->sha1);
189}
190static void show_object(struct object *obj,
192 const struct name_path *path, const char *component,
193 void *cb_data)
194{
195 struct rev_list_info *info = cb_data;
196 finish_object(obj, path, component, cb_data);
197 if (info->flags & REV_LIST_QUIET)
198 return;
199 show_object_with_name(stdout, obj, path, component);
200}
201static void show_edge(struct commit *commit)
203{
204 printf("-%s\n", sha1_to_hex(commit->object.sha1));
205}
206static void print_var_str(const char *var, const char *val)
208{
209 printf("%s='%s'\n", var, val);
210}
211static void print_var_int(const char *var, int val)
213{
214 printf("%s=%d\n", var, val);
215}
216static int show_bisect_vars(struct rev_list_info *info, int reaches, int all)
218{
219 int cnt, flags = info->flags;
220 char hex[41] = "";
221 struct commit_list *tried;
222 struct rev_info *revs = info->revs;
223 if (!revs->commits)
225 return 1;
226 revs->commits = filter_skipped(revs->commits, &tried,
228 flags & BISECT_SHOW_ALL,
229 NULL, NULL);
230 /*
232 * revs->commits can reach "reaches" commits among
233 * "all" commits. If it is good, then there are
234 * (all-reaches) commits left to be bisected.
235 * On the other hand, if it is bad, then the set
236 * to bisect is "reaches".
237 * A bisect set of size N has (N-1) commits further
238 * to test, as we already know one bad one.
239 */
240 cnt = all - reaches;
241 if (cnt < reaches)
242 cnt = reaches;
243 if (revs->commits)
245 strcpy(hex, sha1_to_hex(revs->commits->item->object.sha1));
246 if (flags & BISECT_SHOW_ALL) {
248 traverse_commit_list(revs, show_commit, show_object, info);
249 printf("------\n");
250 }
251 print_var_str("bisect_rev", hex);
253 print_var_int("bisect_nr", cnt - 1);
254 print_var_int("bisect_good", all - reaches - 1);
255 print_var_int("bisect_bad", reaches - 1);
256 print_var_int("bisect_all", all);
257 print_var_int("bisect_steps", estimate_bisect_steps(all));
258 return 0;
260}
261static int show_object_fast(
263 const unsigned char *sha1,
264 enum object_type type,
265 int exclude,
266 uint32_t name_hash,
267 struct packed_git *found_pack,
268 off_t found_offset)
269{
270 fprintf(stdout, "%s\n", sha1_to_hex(sha1));
271 return 1;
272}
273int cmd_rev_list(int argc, const char **argv, const char *prefix)
275{
276 struct rev_info revs;
277 struct rev_list_info info;
278 int i;
279 int bisect_list = 0;
280 int bisect_show_vars = 0;
281 int bisect_find_all = 0;
282 int use_bitmap_index = 0;
283 git_config(git_default_config, NULL);
285 init_revisions(&revs, prefix);
286 revs.abbrev = DEFAULT_ABBREV;
287 revs.commit_format = CMIT_FMT_UNSPECIFIED;
288 argc = setup_revisions(argc, argv, &revs, NULL);
289 memset(&info, 0, sizeof(info));
291 info.revs = &revs;
292 if (revs.bisect)
293 bisect_list = 1;
294 if (DIFF_OPT_TST(&revs.diffopt, QUICK))
296 info.flags |= REV_LIST_QUIET;
297 for (i = 1 ; i < argc; i++) {
298 const char *arg = argv[i];
299 if (!strcmp(arg, "--header")) {
301 revs.verbose_header = 1;
302 continue;
303 }
304 if (!strcmp(arg, "--timestamp")) {
305 info.show_timestamp = 1;
306 continue;
307 }
308 if (!strcmp(arg, "--bisect")) {
309 bisect_list = 1;
310 continue;
311 }
312 if (!strcmp(arg, "--bisect-all")) {
313 bisect_list = 1;
314 bisect_find_all = 1;
315 info.flags |= BISECT_SHOW_ALL;
316 revs.show_decorations = 1;
317 continue;
318 }
319 if (!strcmp(arg, "--bisect-vars")) {
320 bisect_list = 1;
321 bisect_show_vars = 1;
322 continue;
323 }
324 if (!strcmp(arg, "--use-bitmap-index")) {
325 use_bitmap_index = 1;
326 continue;
327 }
328 if (!strcmp(arg, "--test-bitmap")) {
329 test_bitmap_walk(&revs);
330 return 0;
331 }
332 usage(rev_list_usage);
333 }
335 if (revs.commit_format != CMIT_FMT_UNSPECIFIED) {
336 /* The command line has a --pretty */
337 info.hdr_termination = '\n';
338 if (revs.commit_format == CMIT_FMT_ONELINE)
339 info.header_prefix = "";
340 else
341 info.header_prefix = "commit ";
342 }
343 else if (revs.verbose_header)
344 /* Only --header was specified */
345 revs.commit_format = CMIT_FMT_RAW;
346 if ((!revs.commits &&
348 (!(revs.tag_objects || revs.tree_objects || revs.blob_objects) &&
349 !revs.pending.nr)) ||
350 revs.diff)
351 usage(rev_list_usage);
352 if (revs.show_notes)
354 die(_("rev-list does not support display of notes"));
355 save_commit_buffer = (revs.verbose_header ||
357 revs.grep_filter.pattern_list ||
358 revs.grep_filter.header_list);
359 if (bisect_list)
360 revs.limited = 1;
361 if (use_bitmap_index && !revs.prune) {
363 if (revs.count && !revs.left_right && !revs.cherry_mark) {
364 uint32_t commit_count;
365 if (!prepare_bitmap_walk(&revs)) {
366 count_bitmap_commit_list(&commit_count, NULL, NULL, NULL);
367 printf("%d\n", commit_count);
368 return 0;
369 }
370 } else if (revs.tag_objects && revs.tree_objects && revs.blob_objects) {
371 if (!prepare_bitmap_walk(&revs)) {
372 traverse_bitmap_commit_list(&show_object_fast);
373 return 0;
374 }
375 }
376 }
377 if (prepare_revision_walk(&revs))
379 die("revision walk setup failed");
380 if (revs.tree_objects)
381 mark_edges_uninteresting(&revs, show_edge);
382 if (bisect_list) {
384 int reaches = reaches, all = all;
385 revs.commits = find_bisection(revs.commits, &reaches, &all,
387 bisect_find_all);
388 if (bisect_show_vars)
390 return show_bisect_vars(&info, reaches, all);
391 }
392 traverse_commit_list(&revs, show_commit, show_object, &info);
394 if (revs.count) {
396 if (revs.left_right && revs.cherry_mark)
397 printf("%d\t%d\t%d\n", revs.count_left, revs.count_right, revs.count_same);
398 else if (revs.left_right)
399 printf("%d\t%d\n", revs.count_left, revs.count_right);
400 else if (revs.cherry_mark)
401 printf("%d\t%d\n", revs.count_left + revs.count_right, revs.count_same);
402 else
403 printf("%d\n", revs.count_left + revs.count_right);
404 }
405 return 0;
407}