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 (parse_tree(tree) < 0)
207 die("bad tree %s", sha1_to_hex(obj->sha1));
208 entry = tree->entries;
210 if (entry->directory)
211 mark_tree_uninteresting(entry->item.tree);
213 mark_blob_uninteresting(entry->item.blob);
218 static void mark_parents_uninteresting(struct commit *commit)
220 struct commit_list *parents = commit->parents;
223 mark_tree_uninteresting(commit->tree);
225 struct commit *commit = parents->item;
226 commit->object.flags |= UNINTERESTING;
227 parents = parents->next;
231 static int everybody_uninteresting(struct commit_list *list)
234 struct commit *commit = list->item;
236 if (commit->object.flags & UNINTERESTING)
244 * This is a truly stupid algorithm, but it's only
245 * used for bisection, and we just don't care enough.
247 * We care just barely enough to avoid recursing for
250 static int count_distance(struct commit_list *entry)
255 struct commit *commit = entry->item;
256 struct commit_list *p;
258 if (commit->object.flags & (UNINTERESTING | COUNTED))
261 commit->object.flags |= COUNTED;
267 nr += count_distance(p);
275 static void clear_distance(struct commit_list *list)
278 struct commit *commit = list->item;
279 commit->object.flags &= ~COUNTED;
284 static struct commit_list *find_bisection(struct commit_list *list)
287 struct commit_list *p, *best;
300 int distance = count_distance(p);
301 clear_distance(list);
302 if (nr - distance < distance)
303 distance = nr - distance;
304 if (distance > closest) {
315 static struct commit_list *limit_list(struct commit_list *list)
317 struct commit_list *newlist = NULL;
318 struct commit_list **p = &newlist;
320 struct commit *commit = pop_most_recent_commit(&list, SEEN);
321 struct object *obj = &commit->object;
323 if (unpacked && has_sha1_pack(obj->sha1))
324 obj->flags |= UNINTERESTING;
325 if (obj->flags & UNINTERESTING) {
326 mark_parents_uninteresting(commit);
327 if (everybody_uninteresting(list))
331 p = &commit_list_insert(commit, p)->next;
334 newlist = find_bisection(newlist);
338 static void add_pending_object(struct object *obj, const char *name)
340 add_object(obj, &pending_objects, name);
343 static struct commit *get_commit_reference(const char *name, unsigned int flags)
345 unsigned char sha1[20];
346 struct object *object;
348 if (get_sha1(name, sha1))
349 usage(rev_list_usage);
350 object = parse_object(sha1);
352 die("bad object %s", name);
355 * Tag object? Look what it points to..
357 if (object->type == tag_type) {
358 struct tag *tag = (struct tag *) object;
359 object->flags |= flags;
360 if (tag_objects && !(object->flags & UNINTERESTING))
361 add_pending_object(object, tag->tag);
362 object = tag->tagged;
366 * Commit object? Just return it, we'll do all the complex
369 if (object->type == commit_type) {
370 struct commit *commit = (struct commit *)object;
371 object->flags |= flags;
372 if (parse_commit(commit) < 0)
373 die("unable to parse commit %s", name);
378 * Tree object? Either mark it uniniteresting, or add it
379 * to the list of objects to look at later..
381 if (object->type == tree_type) {
382 struct tree *tree = (struct tree *)object;
385 if (flags & UNINTERESTING) {
386 mark_tree_uninteresting(tree);
389 add_pending_object(object, "");
394 * Blob object? You know the drill by now..
396 if (object->type == blob_type) {
397 struct blob *blob = (struct blob *)object;
400 if (flags & UNINTERESTING) {
401 mark_blob_uninteresting(blob);
404 add_pending_object(object, "");
407 die("%s is unknown object", name);
410 int main(int argc, char **argv)
412 struct commit_list *list = NULL;
415 for (i = 1 ; i < argc; i++) {
418 struct commit *commit;
420 if (!strncmp(arg, "--max-count=", 12)) {
421 max_count = atoi(arg + 12);
424 if (!strncmp(arg, "--max-age=", 10)) {
425 max_age = atoi(arg + 10);
428 if (!strncmp(arg, "--min-age=", 10)) {
429 min_age = atoi(arg + 10);
432 if (!strcmp(arg, "--header")) {
436 if (!strncmp(arg, "--pretty", 8)) {
437 commit_format = get_commit_format(arg+8);
439 hdr_termination = '\n';
443 if (!strcmp(arg, "--parents")) {
447 if (!strcmp(arg, "--bisect")) {
451 if (!strcmp(arg, "--objects")) {
457 if (!strcmp(arg, "--unpacked")) {
462 if (!strcmp(arg, "--merge-order")) {
466 if (!strcmp(arg, "--show-breaks")) {
470 if (!strcmp(arg, "--topo-order")) {
478 flags = UNINTERESTING;
482 if (show_breaks && !merge_order)
483 usage(rev_list_usage);
484 commit = get_commit_reference(arg, flags);
487 if (commit->object.flags & SEEN)
489 commit->object.flags |= SEEN;
490 commit_list_insert(commit, &list);
496 list = limit_list(list);
498 sort_in_topological_order(&list);
499 show_commit_list(list);
501 if (sort_list_in_merge_order(list, &process_commit)) {
502 die("merge order sort failed\n");