9 #define INTERESTING (1u << 1)
10 #define COUNTED (1u << 2)
11 #define SHOWN (1u << 3)
13 static const char rev_list_usage[] =
14 "usage: git-rev-list [OPTION] commit-id <commit-id>\n"
23 " --merge-order [ --show-breaks ]";
25 static int unpacked = 0;
26 static int bisect_list = 0;
27 static int tag_objects = 0;
28 static int tree_objects = 0;
29 static int blob_objects = 0;
30 static int verbose_header = 0;
31 static int show_parents = 0;
32 static int hdr_termination = 0;
33 static const char *prefix = "";
34 static unsigned long max_age = -1;
35 static unsigned long min_age = -1;
36 static int max_count = -1;
37 static enum cmit_fmt commit_format = CMIT_FMT_RAW;
38 static int merge_order = 0;
39 static int show_breaks = 0;
40 static int stop_traversal = 0;
41 static int topo_order = 0;
43 static void show_commit(struct commit *commit)
45 commit->object.flags |= SHOWN;
48 if (commit->object.flags & DISCONTINUITY) {
50 } else if (commit->object.flags & BOUNDARY) {
54 printf("%s%s", prefix, sha1_to_hex(commit->object.sha1));
56 struct commit_list *parents = commit->parents;
58 printf(" %s", sha1_to_hex(parents->item->object.sha1));
59 parents = parents->next;
64 static char pretty_header[16384];
65 pretty_print_commit(commit_format, commit->buffer, ~0, pretty_header, sizeof(pretty_header));
66 printf("%s%c", pretty_header, hdr_termination);
71 static int filter_commit(struct commit * commit)
73 if (stop_traversal && (commit->object.flags & BOUNDARY))
75 if (commit->object.flags & (UNINTERESTING|SHOWN))
77 if (min_age != -1 && (commit->date > min_age))
79 if (max_age != -1 && (commit->date < max_age)) {
81 return merge_order?CONTINUE:STOP;
83 if (max_count != -1 && !max_count--)
88 static int process_commit(struct commit * commit)
90 int action=filter_commit(commit);
96 if (action == CONTINUE) {
105 static struct object_list **add_object(struct object *obj, struct object_list **p, const char *name)
107 struct object_list *entry = xmalloc(sizeof(*entry));
115 static struct object_list **process_blob(struct blob *blob, struct object_list **p, const char *name)
117 struct object *obj = &blob->object;
121 if (obj->flags & (UNINTERESTING | SEEN))
124 return add_object(obj, p, name);
127 static struct object_list **process_tree(struct tree *tree, struct object_list **p, const char *name)
129 struct object *obj = &tree->object;
130 struct tree_entry_list *entry;
134 if (obj->flags & (UNINTERESTING | SEEN))
136 if (parse_tree(tree) < 0)
137 die("bad tree object %s", sha1_to_hex(obj->sha1));
139 p = add_object(obj, p, name);
140 for (entry = tree->entries ; entry ; entry = entry->next) {
141 if (entry->directory)
142 p = process_tree(entry->item.tree, p, entry->name);
144 p = process_blob(entry->item.blob, p, entry->name);
149 static struct object_list *pending_objects = NULL;
151 static void show_commit_list(struct commit_list *list)
153 struct object_list *objects = NULL, **p = &objects, *pending;
155 struct commit *commit = pop_most_recent_commit(&list, SEEN);
157 p = process_tree(commit->tree, p, "");
158 if (process_commit(commit) == STOP)
161 for (pending = pending_objects; pending; pending = pending->next) {
162 struct object *obj = pending->item;
163 const char *name = pending->name;
164 if (obj->flags & (UNINTERESTING | SEEN))
166 if (obj->type == tag_type) {
168 p = add_object(obj, p, name);
171 if (obj->type == tree_type) {
172 p = process_tree((struct tree *)obj, p, name);
175 if (obj->type == blob_type) {
176 p = process_blob((struct blob *)obj, p, name);
179 die("unknown pending object %s (%s)", sha1_to_hex(obj->sha1), name);
182 printf("%s %s\n", sha1_to_hex(objects->item->sha1), objects->name);
183 objects = objects->next;
187 static void mark_blob_uninteresting(struct blob *blob)
191 if (blob->object.flags & UNINTERESTING)
193 blob->object.flags |= UNINTERESTING;
196 static void mark_tree_uninteresting(struct tree *tree)
198 struct object *obj = &tree->object;
199 struct tree_entry_list *entry;
203 if (obj->flags & UNINTERESTING)
205 obj->flags |= UNINTERESTING;
206 if (!has_sha1_file(obj->sha1))
208 if (parse_tree(tree) < 0)
209 die("bad tree %s", sha1_to_hex(obj->sha1));
210 entry = tree->entries;
212 if (entry->directory)
213 mark_tree_uninteresting(entry->item.tree);
215 mark_blob_uninteresting(entry->item.blob);
220 static void mark_parents_uninteresting(struct commit *commit)
222 struct commit_list *parents = commit->parents;
225 mark_tree_uninteresting(commit->tree);
227 struct commit *commit = parents->item;
228 commit->object.flags |= UNINTERESTING;
231 * A missing commit is ok iff its parent is marked
234 * We just mark such a thing parsed, so that when
235 * it is popped next time around, we won't be trying
236 * to parse it and get an error.
238 if (!has_sha1_file(commit->object.sha1))
239 commit->object.parsed = 1;
240 parents = parents->next;
244 static int everybody_uninteresting(struct commit_list *list)
247 struct commit *commit = list->item;
249 if (commit->object.flags & UNINTERESTING)
257 * This is a truly stupid algorithm, but it's only
258 * used for bisection, and we just don't care enough.
260 * We care just barely enough to avoid recursing for
263 static int count_distance(struct commit_list *entry)
268 struct commit *commit = entry->item;
269 struct commit_list *p;
271 if (commit->object.flags & (UNINTERESTING | COUNTED))
274 commit->object.flags |= COUNTED;
280 nr += count_distance(p);
288 static void clear_distance(struct commit_list *list)
291 struct commit *commit = list->item;
292 commit->object.flags &= ~COUNTED;
297 static struct commit_list *find_bisection(struct commit_list *list)
300 struct commit_list *p, *best;
313 int distance = count_distance(p);
314 clear_distance(list);
315 if (nr - distance < distance)
316 distance = nr - distance;
317 if (distance > closest) {
328 static struct commit_list *limit_list(struct commit_list *list)
330 struct commit_list *newlist = NULL;
331 struct commit_list **p = &newlist;
333 struct commit *commit = pop_most_recent_commit(&list, SEEN);
334 struct object *obj = &commit->object;
336 if (unpacked && has_sha1_pack(obj->sha1))
337 obj->flags |= UNINTERESTING;
338 if (obj->flags & UNINTERESTING) {
339 mark_parents_uninteresting(commit);
340 if (everybody_uninteresting(list))
344 p = &commit_list_insert(commit, p)->next;
347 newlist = find_bisection(newlist);
351 static void add_pending_object(struct object *obj, const char *name)
353 add_object(obj, &pending_objects, name);
356 static struct commit *get_commit_reference(const char *name, unsigned int flags)
358 unsigned char sha1[20];
359 struct object *object;
361 if (get_sha1(name, sha1))
362 usage(rev_list_usage);
363 object = parse_object(sha1);
365 die("bad object %s", name);
368 * Tag object? Look what it points to..
370 while (object->type == tag_type) {
371 struct tag *tag = (struct tag *) object;
372 object->flags |= flags;
373 if (tag_objects && !(object->flags & UNINTERESTING))
374 add_pending_object(object, tag->tag);
375 object = parse_object(tag->tagged->sha1);
379 * Commit object? Just return it, we'll do all the complex
382 if (object->type == commit_type) {
383 struct commit *commit = (struct commit *)object;
384 object->flags |= flags;
385 if (parse_commit(commit) < 0)
386 die("unable to parse commit %s", name);
387 if (flags & UNINTERESTING)
388 mark_parents_uninteresting(commit);
393 * Tree object? Either mark it uniniteresting, or add it
394 * to the list of objects to look at later..
396 if (object->type == tree_type) {
397 struct tree *tree = (struct tree *)object;
400 if (flags & UNINTERESTING) {
401 mark_tree_uninteresting(tree);
404 add_pending_object(object, "");
409 * Blob object? You know the drill by now..
411 if (object->type == blob_type) {
412 struct blob *blob = (struct blob *)object;
415 if (flags & UNINTERESTING) {
416 mark_blob_uninteresting(blob);
419 add_pending_object(object, "");
422 die("%s is unknown object", name);
425 int main(int argc, char **argv)
427 struct commit_list *list = NULL;
430 for (i = 1 ; i < argc; i++) {
433 struct commit *commit;
435 if (!strncmp(arg, "--max-count=", 12)) {
436 max_count = atoi(arg + 12);
439 if (!strncmp(arg, "--max-age=", 10)) {
440 max_age = atoi(arg + 10);
443 if (!strncmp(arg, "--min-age=", 10)) {
444 min_age = atoi(arg + 10);
447 if (!strcmp(arg, "--header")) {
451 if (!strncmp(arg, "--pretty", 8)) {
452 commit_format = get_commit_format(arg+8);
454 hdr_termination = '\n';
458 if (!strcmp(arg, "--parents")) {
462 if (!strcmp(arg, "--bisect")) {
466 if (!strcmp(arg, "--objects")) {
472 if (!strcmp(arg, "--unpacked")) {
477 if (!strcmp(arg, "--merge-order")) {
481 if (!strcmp(arg, "--show-breaks")) {
485 if (!strcmp(arg, "--topo-order")) {
493 flags = UNINTERESTING;
497 if (show_breaks && !merge_order)
498 usage(rev_list_usage);
499 commit = get_commit_reference(arg, flags);
502 if (commit->object.flags & SEEN)
504 commit->object.flags |= SEEN;
505 commit_list_insert(commit, &list);
511 list = limit_list(list);
513 sort_in_topological_order(&list);
514 show_commit_list(list);
516 if (sort_list_in_merge_order(list, &process_commit)) {
517 die("merge order sort failed\n");