10 static char *path_name(struct name_path *path, const char *name)
14 int nlen = strlen(name);
17 for (p = path; p; p = p->up) {
19 len += p->elem_len + 1;
22 m = n + len - (nlen + 1);
24 for (p = path; p; p = p->up) {
27 memcpy(m, p->elem, p->elem_len);
34 struct object_list **add_object(struct object *obj,
35 struct object_list **p,
36 struct name_path *path,
39 struct object_list *entry = xmalloc(sizeof(*entry));
42 entry->name = path_name(path, name);
47 static void mark_blob_uninteresting(struct blob *blob)
49 if (blob->object.flags & UNINTERESTING)
51 blob->object.flags |= UNINTERESTING;
54 void mark_tree_uninteresting(struct tree *tree)
56 struct object *obj = &tree->object;
57 struct tree_entry_list *entry;
59 if (obj->flags & UNINTERESTING)
61 obj->flags |= UNINTERESTING;
62 if (!has_sha1_file(obj->sha1))
64 if (parse_tree(tree) < 0)
65 die("bad tree %s", sha1_to_hex(obj->sha1));
66 entry = tree->entries;
69 struct tree_entry_list *next = entry->next;
71 mark_tree_uninteresting(entry->item.tree);
73 mark_blob_uninteresting(entry->item.blob);
79 void mark_parents_uninteresting(struct commit *commit)
81 struct commit_list *parents = commit->parents;
84 struct commit *commit = parents->item;
85 if (!(commit->object.flags & UNINTERESTING)) {
86 commit->object.flags |= UNINTERESTING;
89 * Normally we haven't parsed the parent
90 * yet, so we won't have a parent of a parent
91 * here. However, it may turn out that we've
92 * reached this commit some other way (where it
93 * wasn't uninteresting), in which case we need
94 * to mark its parents recursively too..
97 mark_parents_uninteresting(commit);
101 * A missing commit is ok iff its parent is marked
104 * We just mark such a thing parsed, so that when
105 * it is popped next time around, we won't be trying
106 * to parse it and get an error.
108 if (!has_sha1_file(commit->object.sha1))
109 commit->object.parsed = 1;
110 parents = parents->next;
114 static void add_pending_object(struct rev_info *revs, struct object *obj, const char *name)
116 add_object(obj, &revs->pending_objects, NULL, name);
119 static struct commit *get_commit_reference(struct rev_info *revs, const char *name, const unsigned char *sha1, unsigned int flags)
121 struct object *object;
123 object = parse_object(sha1);
125 die("bad object %s", name);
128 * Tag object? Look what it points to..
130 while (object->type == tag_type) {
131 struct tag *tag = (struct tag *) object;
132 object->flags |= flags;
133 if (revs->tag_objects && !(object->flags & UNINTERESTING))
134 add_pending_object(revs, object, tag->tag);
135 object = parse_object(tag->tagged->sha1);
137 die("bad object %s", sha1_to_hex(tag->tagged->sha1));
141 * Commit object? Just return it, we'll do all the complex
144 if (object->type == commit_type) {
145 struct commit *commit = (struct commit *)object;
146 object->flags |= flags;
147 if (parse_commit(commit) < 0)
148 die("unable to parse commit %s", name);
149 if (flags & UNINTERESTING) {
150 mark_parents_uninteresting(commit);
157 * Tree object? Either mark it uniniteresting, or add it
158 * to the list of objects to look at later..
160 if (object->type == tree_type) {
161 struct tree *tree = (struct tree *)object;
162 if (!revs->tree_objects)
164 if (flags & UNINTERESTING) {
165 mark_tree_uninteresting(tree);
168 add_pending_object(revs, object, "");
173 * Blob object? You know the drill by now..
175 if (object->type == blob_type) {
176 struct blob *blob = (struct blob *)object;
177 if (!revs->blob_objects)
179 if (flags & UNINTERESTING) {
180 mark_blob_uninteresting(blob);
183 add_pending_object(revs, object, "");
186 die("%s is unknown object", name);
189 static int everybody_uninteresting(struct commit_list *orig)
191 struct commit_list *list = orig;
193 struct commit *commit = list->item;
195 if (commit->object.flags & UNINTERESTING)
202 static int tree_difference = REV_TREE_SAME;
204 static void file_add_remove(struct diff_options *options,
205 int addremove, unsigned mode,
206 const unsigned char *sha1,
207 const char *base, const char *path)
209 int diff = REV_TREE_DIFFERENT;
212 * Is it an add of a new file? It means that the old tree
213 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
214 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
215 * (and if it already was "REV_TREE_NEW", we'll keep it
216 * "REV_TREE_NEW" of course).
218 if (addremove == '+') {
219 diff = tree_difference;
220 if (diff != REV_TREE_SAME)
224 tree_difference = diff;
227 static void file_change(struct diff_options *options,
228 unsigned old_mode, unsigned new_mode,
229 const unsigned char *old_sha1,
230 const unsigned char *new_sha1,
231 const char *base, const char *path)
233 tree_difference = REV_TREE_DIFFERENT;
236 static struct diff_options diff_opt = {
238 .add_remove = file_add_remove,
239 .change = file_change,
242 int rev_compare_tree(struct tree *t1, struct tree *t2)
247 return REV_TREE_DIFFERENT;
248 tree_difference = REV_TREE_SAME;
249 if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "", &diff_opt) < 0)
250 return REV_TREE_DIFFERENT;
251 return tree_difference;
254 int rev_same_tree_as_empty(struct tree *t1)
258 struct tree_desc empty, real;
263 tree = read_object_with_reference(t1->object.sha1, "tree", &real.size, NULL);
272 retval = diff_tree(&empty, &real, "", &diff_opt);
275 return retval >= 0 && !tree_difference;
278 static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit)
280 struct commit_list **pp, *parent;
281 int tree_changed = 0;
286 if (!commit->parents) {
287 if (!rev_same_tree_as_empty(commit->tree))
288 commit->object.flags |= TREECHANGE;
292 pp = &commit->parents;
293 while ((parent = *pp) != NULL) {
294 struct commit *p = parent->item;
297 switch (rev_compare_tree(p->tree, commit->tree)) {
299 if (p->object.flags & UNINTERESTING) {
300 /* Even if a merge with an uninteresting
301 * side branch brought the entire change
302 * we are interested in, we do not want
303 * to lose the other branches of this
304 * merge, so we just keep going.
310 commit->parents = parent;
314 if (revs->remove_empty_trees &&
315 rev_same_tree_as_empty(p->tree)) {
316 /* We are adding all the specified
317 * paths from this parent, so the
318 * history beyond this parent is not
319 * interesting. Remove its parents
320 * (they are grandparents for us).
321 * IOW, we pretend this parent is a
328 case REV_TREE_DIFFERENT:
333 die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1));
336 commit->object.flags |= TREECHANGE;
339 static void add_parents_to_list(struct rev_info *revs, struct commit *commit, struct commit_list **list)
341 struct commit_list *parent = commit->parents;
344 * If the commit is uninteresting, don't try to
345 * prune parents - we want the maximal uninteresting
348 * Normally we haven't parsed the parent
349 * yet, so we won't have a parent of a parent
350 * here. However, it may turn out that we've
351 * reached this commit some other way (where it
352 * wasn't uninteresting), in which case we need
353 * to mark its parents recursively too..
355 if (commit->object.flags & UNINTERESTING) {
357 struct commit *p = parent->item;
358 parent = parent->next;
360 p->object.flags |= UNINTERESTING;
362 mark_parents_uninteresting(p);
363 if (p->object.flags & SEEN)
365 p->object.flags |= SEEN;
366 insert_by_date(p, list);
372 * Ok, the commit wasn't uninteresting. Try to
373 * simplify the commit history and find the parent
374 * that has no differences in the path set if one exists.
377 revs->prune_fn(revs, commit);
379 parent = commit->parents;
381 struct commit *p = parent->item;
383 parent = parent->next;
386 if (p->object.flags & SEEN)
388 p->object.flags |= SEEN;
389 insert_by_date(p, list);
393 static void limit_list(struct rev_info *revs)
395 struct commit_list *list = revs->commits;
396 struct commit_list *newlist = NULL;
397 struct commit_list **p = &newlist;
400 struct commit_list *entry = list;
401 struct commit *commit = list->item;
402 struct object *obj = &commit->object;
407 if (revs->max_age != -1 && (commit->date < revs->max_age))
408 obj->flags |= UNINTERESTING;
409 if (revs->unpacked && has_sha1_pack(obj->sha1))
410 obj->flags |= UNINTERESTING;
411 add_parents_to_list(revs, commit, &list);
412 if (obj->flags & UNINTERESTING) {
413 mark_parents_uninteresting(commit);
414 if (everybody_uninteresting(list))
418 if (revs->min_age != -1 && (commit->date > revs->min_age))
420 p = &commit_list_insert(commit, p)->next;
422 revs->commits = newlist;
425 static void add_one_commit(struct commit *commit, struct rev_info *revs)
427 if (!commit || (commit->object.flags & SEEN))
429 commit->object.flags |= SEEN;
430 commit_list_insert(commit, &revs->commits);
433 static int all_flags;
434 static struct rev_info *all_revs;
436 static int handle_one_ref(const char *path, const unsigned char *sha1)
438 struct commit *commit = get_commit_reference(all_revs, path, sha1, all_flags);
439 add_one_commit(commit, all_revs);
443 static void handle_all(struct rev_info *revs, unsigned flags)
447 for_each_ref(handle_one_ref);
450 void init_revisions(struct rev_info *revs)
452 memset(revs, 0, sizeof(*revs));
455 revs->prefix = setup_git_directory();
458 revs->max_count = -1;
460 revs->prune_fn = NULL;
461 revs->prune_data = NULL;
463 revs->topo_setter = topo_sort_default_setter;
464 revs->topo_getter = topo_sort_default_getter;
468 * Parse revision information, filling in the "rev_info" structure,
469 * and removing the used arguments from the argument list.
471 * Returns the number of arguments left that weren't recognized
472 * (which are also moved to the head of the argument list)
474 int setup_revisions(int argc, const char **argv, struct rev_info *revs, const char *def)
476 int i, flags, seen_dashdash;
477 const char **unrecognized = argv + 1;
480 init_revisions(revs);
482 /* First, search for "--" */
484 for (i = 1; i < argc; i++) {
485 const char *arg = argv[i];
486 if (strcmp(arg, "--"))
490 revs->prune_data = get_pathspec(revs->prefix, argv + i + 1);
496 for (i = 1; i < argc; i++) {
497 struct commit *commit;
498 const char *arg = argv[i];
499 unsigned char sha1[20];
504 if (!strncmp(arg, "--max-count=", 12)) {
505 revs->max_count = atoi(arg + 12);
508 /* accept -<digit>, like traditilnal "head" */
509 if ((*arg == '-') && isdigit(arg[1])) {
510 revs->max_count = atoi(arg + 1);
513 if (!strcmp(arg, "-n")) {
515 die("-n requires an argument");
516 revs->max_count = atoi(argv[++i]);
519 if (!strncmp(arg,"-n",2)) {
520 revs->max_count = atoi(arg + 2);
523 if (!strncmp(arg, "--max-age=", 10)) {
524 revs->max_age = atoi(arg + 10);
528 if (!strncmp(arg, "--min-age=", 10)) {
529 revs->min_age = atoi(arg + 10);
533 if (!strncmp(arg, "--since=", 8)) {
534 revs->max_age = approxidate(arg + 8);
538 if (!strncmp(arg, "--after=", 8)) {
539 revs->max_age = approxidate(arg + 8);
543 if (!strncmp(arg, "--before=", 9)) {
544 revs->min_age = approxidate(arg + 9);
548 if (!strncmp(arg, "--until=", 8)) {
549 revs->min_age = approxidate(arg + 8);
553 if (!strcmp(arg, "--all")) {
554 handle_all(revs, flags);
557 if (!strcmp(arg, "--not")) {
558 flags ^= UNINTERESTING;
561 if (!strcmp(arg, "--default")) {
563 die("bad --default argument");
567 if (!strcmp(arg, "--topo-order")) {
568 revs->topo_order = 1;
572 if (!strcmp(arg, "--date-order")) {
574 revs->topo_order = 1;
578 if (!strcmp(arg, "--dense")) {
582 if (!strcmp(arg, "--sparse")) {
586 if (!strcmp(arg, "--remove-empty")) {
587 revs->remove_empty_trees = 1;
590 if (!strncmp(arg, "--no-merges", 11)) {
594 if (!strcmp(arg, "--objects")) {
595 revs->tag_objects = 1;
596 revs->tree_objects = 1;
597 revs->blob_objects = 1;
600 if (!strcmp(arg, "--objects-edge")) {
601 revs->tag_objects = 1;
602 revs->tree_objects = 1;
603 revs->blob_objects = 1;
607 if (!strcmp(arg, "--unpacked")) {
612 *unrecognized++ = arg;
616 dotdot = strstr(arg, "..");
618 unsigned char from_sha1[20];
619 char *next = dotdot + 2;
623 if (!get_sha1(arg, from_sha1) && !get_sha1(next, sha1)) {
624 struct commit *exclude;
625 struct commit *include;
627 exclude = get_commit_reference(revs, arg, from_sha1, flags ^ UNINTERESTING);
628 include = get_commit_reference(revs, next, sha1, flags);
629 if (!exclude || !include)
630 die("Invalid revision range %s..%s", arg, next);
631 add_one_commit(exclude, revs);
632 add_one_commit(include, revs);
639 local_flags = UNINTERESTING;
642 if (get_sha1(arg, sha1) < 0) {
646 if (seen_dashdash || local_flags)
647 die("bad revision '%s'", arg);
649 /* If we didn't have a "--", all filenames must exist */
650 for (j = i; j < argc; j++) {
651 if (lstat(argv[j], &st) < 0)
652 die("'%s': %s", arg, strerror(errno));
654 revs->prune_data = get_pathspec(revs->prefix, argv + i);
657 commit = get_commit_reference(revs, arg, sha1, flags ^ local_flags);
658 add_one_commit(commit, revs);
660 if (def && !revs->commits) {
661 unsigned char sha1[20];
662 struct commit *commit;
663 if (get_sha1(def, sha1) < 0)
664 die("bad default revision '%s'", def);
665 commit = get_commit_reference(revs, def, sha1, 0);
666 add_one_commit(commit, revs);
669 if (revs->prune_data) {
670 diff_tree_setup_paths(revs->prune_data);
671 revs->prune_fn = try_to_simplify_commit;
678 void prepare_revision_walk(struct rev_info *revs)
680 sort_by_date(&revs->commits);
683 if (revs->topo_order)
684 sort_in_topological_order_fn(&revs->commits, revs->lifo,
689 static int rewrite_one(struct commit **pp)
692 struct commit *p = *pp;
693 if (p->object.flags & (TREECHANGE | UNINTERESTING))
697 *pp = p->parents->item;
701 static void rewrite_parents(struct commit *commit)
703 struct commit_list **pp = &commit->parents;
705 struct commit_list *parent = *pp;
706 if (rewrite_one(&parent->item) < 0) {
714 struct commit *get_revision(struct rev_info *revs)
716 struct commit_list *list = revs->commits;
721 /* Check the max_count ... */
722 switch (revs->max_count) {
732 struct commit *commit = revs->commits->item;
734 if (commit->object.flags & (UNINTERESTING|SHOWN))
736 if (revs->min_age != -1 && (commit->date > revs->min_age))
738 if (revs->max_age != -1 && (commit->date < revs->max_age))
740 if (revs->no_merges && commit->parents && commit->parents->next)
742 if (revs->prune_fn && revs->dense) {
743 if (!(commit->object.flags & TREECHANGE))
745 rewrite_parents(commit);
749 pop_most_recent_commit(&revs->commits, SEEN);
750 commit->object.flags |= SHOWN;
753 pop_most_recent_commit(&revs->commits, SEEN);
754 } while (revs->commits);