]>
Commit | Line | Data |
---|---|---|
ae563542 LT |
1 | #include "cache.h" |
2 | #include "tag.h" | |
3 | #include "blob.h" | |
4 | #include "tree.h" | |
5 | #include "commit.h" | |
a4a88b2b | 6 | #include "diff.h" |
ae563542 LT |
7 | #include "refs.h" |
8 | #include "revision.h" | |
7fefda5c | 9 | #include "graph.h" |
8ecae9b0 | 10 | #include "grep.h" |
8860fd42 | 11 | #include "reflog-walk.h" |
d7a17cad | 12 | #include "patch-ids.h" |
f35f5603 | 13 | #include "decorate.h" |
78892e32 | 14 | #include "log-tree.h" |
894a9d33 | 15 | #include "string-list.h" |
ae563542 | 16 | |
cdcefbc9 LT |
17 | volatile show_early_output_fn_t show_early_output; |
18 | ||
cf2ab916 | 19 | char *path_name(const struct name_path *path, const char *name) |
ae563542 | 20 | { |
cf2ab916 | 21 | const struct name_path *p; |
ae563542 LT |
22 | char *n, *m; |
23 | int nlen = strlen(name); | |
24 | int len = nlen + 1; | |
25 | ||
26 | for (p = path; p; p = p->up) { | |
27 | if (p->elem_len) | |
28 | len += p->elem_len + 1; | |
29 | } | |
30 | n = xmalloc(len); | |
31 | m = n + len - (nlen + 1); | |
32 | strcpy(m, name); | |
33 | for (p = path; p; p = p->up) { | |
34 | if (p->elem_len) { | |
35 | m -= p->elem_len + 1; | |
36 | memcpy(m, p->elem, p->elem_len); | |
37 | m[p->elem_len] = '/'; | |
38 | } | |
39 | } | |
40 | return n; | |
41 | } | |
42 | ||
beba25ab JH |
43 | static int show_path_component_truncated(FILE *out, const char *name, int len) |
44 | { | |
45 | int cnt; | |
46 | for (cnt = 0; cnt < len; cnt++) { | |
47 | int ch = name[cnt]; | |
48 | if (!ch || ch == '\n') | |
49 | return -1; | |
50 | fputc(ch, out); | |
51 | } | |
52 | return len; | |
53 | } | |
54 | ||
55 | static int show_path_truncated(FILE *out, const struct name_path *path) | |
56 | { | |
57 | int emitted, ours; | |
58 | ||
59 | if (!path) | |
60 | return 0; | |
61 | emitted = show_path_truncated(out, path->up); | |
62 | if (emitted < 0) | |
63 | return emitted; | |
64 | if (emitted) | |
65 | fputc('/', out); | |
66 | ours = show_path_component_truncated(out, path->elem, path->elem_len); | |
67 | if (ours < 0) | |
68 | return ours; | |
69 | return ours || emitted; | |
70 | } | |
71 | ||
91f17516 JH |
72 | void show_object_with_name(FILE *out, struct object *obj, const struct name_path *path, const char *component) |
73 | { | |
beba25ab JH |
74 | struct name_path leaf; |
75 | leaf.up = (struct name_path *)path; | |
76 | leaf.elem = component; | |
77 | leaf.elem_len = strlen(component); | |
91f17516 | 78 | |
beba25ab JH |
79 | fprintf(out, "%s ", sha1_to_hex(obj->sha1)); |
80 | show_path_truncated(out, &leaf); | |
81 | fputc('\n', out); | |
91f17516 JH |
82 | } |
83 | ||
1f1e895f LT |
84 | void add_object(struct object *obj, |
85 | struct object_array *p, | |
86 | struct name_path *path, | |
87 | const char *name) | |
ae563542 | 88 | { |
1f1e895f | 89 | add_object_array(obj, path_name(path, name), p); |
ae563542 LT |
90 | } |
91 | ||
92 | static void mark_blob_uninteresting(struct blob *blob) | |
93 | { | |
c1ee9013 MK |
94 | if (!blob) |
95 | return; | |
ae563542 LT |
96 | if (blob->object.flags & UNINTERESTING) |
97 | return; | |
98 | blob->object.flags |= UNINTERESTING; | |
99 | } | |
100 | ||
2ac5e447 | 101 | static void mark_tree_contents_uninteresting(struct tree *tree) |
ae563542 | 102 | { |
f75e53ed | 103 | struct tree_desc desc; |
4c068a98 | 104 | struct name_entry entry; |
ae563542 | 105 | struct object *obj = &tree->object; |
ae563542 | 106 | |
ae563542 LT |
107 | if (!has_sha1_file(obj->sha1)) |
108 | return; | |
109 | if (parse_tree(tree) < 0) | |
110 | die("bad tree %s", sha1_to_hex(obj->sha1)); | |
f75e53ed | 111 | |
6fda5e51 | 112 | init_tree_desc(&desc, tree->buffer, tree->size); |
4c068a98 | 113 | while (tree_entry(&desc, &entry)) { |
4d1012c3 LT |
114 | switch (object_type(entry.mode)) { |
115 | case OBJ_TREE: | |
4c068a98 | 116 | mark_tree_uninteresting(lookup_tree(entry.sha1)); |
4d1012c3 LT |
117 | break; |
118 | case OBJ_BLOB: | |
4c068a98 | 119 | mark_blob_uninteresting(lookup_blob(entry.sha1)); |
4d1012c3 LT |
120 | break; |
121 | default: | |
122 | /* Subproject commit - not in this repository */ | |
123 | break; | |
124 | } | |
ae563542 | 125 | } |
f75e53ed LT |
126 | |
127 | /* | |
128 | * We don't care about the tree any more | |
129 | * after it has been marked uninteresting. | |
130 | */ | |
131 | free(tree->buffer); | |
132 | tree->buffer = NULL; | |
2ac5e447 JH |
133 | tree->object.parsed = 0; |
134 | } | |
135 | ||
136 | void mark_tree_uninteresting(struct tree *tree) | |
137 | { | |
138 | struct object *obj = &tree->object; | |
139 | ||
140 | if (!tree) | |
141 | return; | |
142 | if (obj->flags & UNINTERESTING) | |
143 | return; | |
144 | obj->flags |= UNINTERESTING; | |
145 | mark_tree_contents_uninteresting(tree); | |
ae563542 LT |
146 | } |
147 | ||
148 | void mark_parents_uninteresting(struct commit *commit) | |
149 | { | |
941ba8db NTND |
150 | struct commit_list *parents = NULL, *l; |
151 | ||
152 | for (l = commit->parents; l; l = l->next) | |
153 | commit_list_insert(l->item, &parents); | |
ae563542 LT |
154 | |
155 | while (parents) { | |
156 | struct commit *commit = parents->item; | |
941ba8db NTND |
157 | l = parents; |
158 | parents = parents->next; | |
159 | free(l); | |
160 | ||
161 | while (commit) { | |
162 | /* | |
163 | * A missing commit is ok iff its parent is marked | |
164 | * uninteresting. | |
165 | * | |
166 | * We just mark such a thing parsed, so that when | |
167 | * it is popped next time around, we won't be trying | |
168 | * to parse it and get an error. | |
169 | */ | |
170 | if (!has_sha1_file(commit->object.sha1)) | |
171 | commit->object.parsed = 1; | |
172 | ||
173 | if (commit->object.flags & UNINTERESTING) | |
174 | break; | |
175 | ||
d2c4af73 | 176 | commit->object.flags |= UNINTERESTING; |
ae563542 | 177 | |
d2c4af73 MU |
178 | /* |
179 | * Normally we haven't parsed the parent | |
180 | * yet, so we won't have a parent of a parent | |
181 | * here. However, it may turn out that we've | |
182 | * reached this commit some other way (where it | |
183 | * wasn't uninteresting), in which case we need | |
184 | * to mark its parents recursively too.. | |
185 | */ | |
941ba8db NTND |
186 | if (!commit->parents) |
187 | break; | |
ae563542 | 188 | |
941ba8db NTND |
189 | for (l = commit->parents->next; l; l = l->next) |
190 | commit_list_insert(l->item, &parents); | |
191 | commit = commit->parents->item; | |
192 | } | |
ae563542 LT |
193 | } |
194 | } | |
195 | ||
2d93b9fa | 196 | static void add_pending_object_with_mode(struct rev_info *revs, struct object *obj, const char *name, unsigned mode) |
ae563542 | 197 | { |
cc243c3c JH |
198 | if (!obj) |
199 | return; | |
aa27e461 | 200 | if (revs->no_walk && (obj->flags & UNINTERESTING)) |
f222abde | 201 | revs->no_walk = 0; |
105e4733 JH |
202 | if (revs->reflog_info && obj->type == OBJ_COMMIT) { |
203 | struct strbuf buf = STRBUF_INIT; | |
204 | int len = interpret_branch_name(name, &buf); | |
205 | int st; | |
206 | ||
207 | if (0 < len && name[len] && buf.len) | |
208 | strbuf_addstr(&buf, name + len); | |
209 | st = add_reflog_for_walk(revs->reflog_info, | |
210 | (struct commit *)obj, | |
211 | buf.buf[0] ? buf.buf: name); | |
212 | strbuf_release(&buf); | |
213 | if (st) | |
214 | return; | |
215 | } | |
bb6c2fba | 216 | add_object_array_with_mode(obj, name, &revs->pending, mode); |
ae563542 LT |
217 | } |
218 | ||
2d93b9fa JH |
219 | void add_pending_object(struct rev_info *revs, struct object *obj, const char *name) |
220 | { | |
221 | add_pending_object_with_mode(revs, obj, name, S_IFINVALID); | |
222 | } | |
223 | ||
3384a2df JH |
224 | void add_head_to_pending(struct rev_info *revs) |
225 | { | |
226 | unsigned char sha1[20]; | |
227 | struct object *obj; | |
228 | if (get_sha1("HEAD", sha1)) | |
229 | return; | |
230 | obj = parse_object(sha1); | |
231 | if (!obj) | |
232 | return; | |
233 | add_pending_object(revs, obj, "HEAD"); | |
234 | } | |
235 | ||
cd2bdc53 | 236 | static struct object *get_reference(struct rev_info *revs, const char *name, const unsigned char *sha1, unsigned int flags) |
ae563542 LT |
237 | { |
238 | struct object *object; | |
239 | ||
240 | object = parse_object(sha1); | |
cc243c3c JH |
241 | if (!object) { |
242 | if (revs->ignore_missing) | |
243 | return object; | |
ae563542 | 244 | die("bad object %s", name); |
cc243c3c | 245 | } |
cd2bdc53 LT |
246 | object->flags |= flags; |
247 | return object; | |
248 | } | |
249 | ||
26c3177e RS |
250 | void add_pending_sha1(struct rev_info *revs, const char *name, |
251 | const unsigned char *sha1, unsigned int flags) | |
252 | { | |
253 | struct object *object = get_reference(revs, name, sha1, flags); | |
254 | add_pending_object(revs, object, name); | |
255 | } | |
256 | ||
cd2bdc53 LT |
257 | static struct commit *handle_commit(struct rev_info *revs, struct object *object, const char *name) |
258 | { | |
259 | unsigned long flags = object->flags; | |
ae563542 LT |
260 | |
261 | /* | |
262 | * Tag object? Look what it points to.. | |
263 | */ | |
1974632c | 264 | while (object->type == OBJ_TAG) { |
ae563542 | 265 | struct tag *tag = (struct tag *) object; |
cd2bdc53 | 266 | if (revs->tag_objects && !(flags & UNINTERESTING)) |
ae563542 | 267 | add_pending_object(revs, object, tag->tag); |
9684afd9 MK |
268 | if (!tag->tagged) |
269 | die("bad tag"); | |
ae563542 | 270 | object = parse_object(tag->tagged->sha1); |
aeeae1b7 JH |
271 | if (!object) { |
272 | if (flags & UNINTERESTING) | |
273 | return NULL; | |
ae563542 | 274 | die("bad object %s", sha1_to_hex(tag->tagged->sha1)); |
aeeae1b7 | 275 | } |
ae563542 LT |
276 | } |
277 | ||
278 | /* | |
279 | * Commit object? Just return it, we'll do all the complex | |
280 | * reachability crud. | |
281 | */ | |
1974632c | 282 | if (object->type == OBJ_COMMIT) { |
ae563542 | 283 | struct commit *commit = (struct commit *)object; |
ae563542 LT |
284 | if (parse_commit(commit) < 0) |
285 | die("unable to parse commit %s", name); | |
d9a83684 | 286 | if (flags & UNINTERESTING) { |
4262c1b0 | 287 | commit->object.flags |= UNINTERESTING; |
ae563542 | 288 | mark_parents_uninteresting(commit); |
d9a83684 LT |
289 | revs->limited = 1; |
290 | } | |
0f3a290b LT |
291 | if (revs->show_source && !commit->util) |
292 | commit->util = (void *) name; | |
ae563542 LT |
293 | return commit; |
294 | } | |
295 | ||
296 | /* | |
3ea3c215 | 297 | * Tree object? Either mark it uninteresting, or add it |
ae563542 LT |
298 | * to the list of objects to look at later.. |
299 | */ | |
1974632c | 300 | if (object->type == OBJ_TREE) { |
ae563542 LT |
301 | struct tree *tree = (struct tree *)object; |
302 | if (!revs->tree_objects) | |
303 | return NULL; | |
304 | if (flags & UNINTERESTING) { | |
2ac5e447 JH |
305 | tree->object.flags |= UNINTERESTING; |
306 | mark_tree_contents_uninteresting(tree); | |
ae563542 LT |
307 | return NULL; |
308 | } | |
309 | add_pending_object(revs, object, ""); | |
310 | return NULL; | |
311 | } | |
312 | ||
313 | /* | |
314 | * Blob object? You know the drill by now.. | |
315 | */ | |
1974632c | 316 | if (object->type == OBJ_BLOB) { |
ae563542 LT |
317 | struct blob *blob = (struct blob *)object; |
318 | if (!revs->blob_objects) | |
319 | return NULL; | |
320 | if (flags & UNINTERESTING) { | |
2ac5e447 | 321 | blob->object.flags |= UNINTERESTING; |
ae563542 LT |
322 | return NULL; |
323 | } | |
324 | add_pending_object(revs, object, ""); | |
325 | return NULL; | |
326 | } | |
327 | die("%s is unknown object", name); | |
328 | } | |
329 | ||
a4a88b2b LT |
330 | static int everybody_uninteresting(struct commit_list *orig) |
331 | { | |
332 | struct commit_list *list = orig; | |
333 | while (list) { | |
334 | struct commit *commit = list->item; | |
335 | list = list->next; | |
336 | if (commit->object.flags & UNINTERESTING) | |
337 | continue; | |
338 | return 0; | |
339 | } | |
340 | return 1; | |
341 | } | |
342 | ||
0a4ba7f8 JH |
343 | /* |
344 | * The goal is to get REV_TREE_NEW as the result only if the | |
ceff8e7a LT |
345 | * diff consists of all '+' (and no other changes), REV_TREE_OLD |
346 | * if the whole diff is removal of old data, and otherwise | |
347 | * REV_TREE_DIFFERENT (of course if the trees are the same we | |
348 | * want REV_TREE_SAME). | |
349 | * That means that once we get to REV_TREE_DIFFERENT, we do not | |
350 | * have to look any further. | |
0a4ba7f8 | 351 | */ |
8efdc326 | 352 | static int tree_difference = REV_TREE_SAME; |
a4a88b2b LT |
353 | |
354 | static void file_add_remove(struct diff_options *options, | |
355 | int addremove, unsigned mode, | |
356 | const unsigned char *sha1, | |
e5450100 | 357 | int sha1_valid, |
e3d42c47 | 358 | const char *fullpath, unsigned dirty_submodule) |
a4a88b2b | 359 | { |
ceff8e7a | 360 | int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD; |
a4a88b2b | 361 | |
ceff8e7a | 362 | tree_difference |= diff; |
dd47aa31 | 363 | if (tree_difference == REV_TREE_DIFFERENT) |
8f67f8ae | 364 | DIFF_OPT_SET(options, HAS_CHANGES); |
a4a88b2b LT |
365 | } |
366 | ||
367 | static void file_change(struct diff_options *options, | |
368 | unsigned old_mode, unsigned new_mode, | |
369 | const unsigned char *old_sha1, | |
370 | const unsigned char *new_sha1, | |
e5450100 | 371 | int old_sha1_valid, int new_sha1_valid, |
e3d42c47 JL |
372 | const char *fullpath, |
373 | unsigned old_dirty_submodule, unsigned new_dirty_submodule) | |
a4a88b2b | 374 | { |
8efdc326 | 375 | tree_difference = REV_TREE_DIFFERENT; |
8f67f8ae | 376 | DIFF_OPT_SET(options, HAS_CHANGES); |
a4a88b2b LT |
377 | } |
378 | ||
3a5e8608 | 379 | static int rev_compare_tree(struct rev_info *revs, struct commit *parent, struct commit *commit) |
a4a88b2b | 380 | { |
3a5e8608 LT |
381 | struct tree *t1 = parent->tree; |
382 | struct tree *t2 = commit->tree; | |
383 | ||
a4a88b2b | 384 | if (!t1) |
8efdc326 | 385 | return REV_TREE_NEW; |
ceff8e7a LT |
386 | if (!t2) |
387 | return REV_TREE_OLD; | |
78892e32 LT |
388 | |
389 | if (revs->simplify_by_decoration) { | |
390 | /* | |
391 | * If we are simplifying by decoration, then the commit | |
392 | * is worth showing if it has a tag pointing at it. | |
393 | */ | |
394 | if (lookup_decoration(&name_decoration, &commit->object)) | |
395 | return REV_TREE_DIFFERENT; | |
396 | /* | |
397 | * A commit that is not pointed by a tag is uninteresting | |
398 | * if we are not limited by path. This means that you will | |
399 | * see the usual "commits that touch the paths" plus any | |
400 | * tagged commit by specifying both --simplify-by-decoration | |
401 | * and pathspec. | |
402 | */ | |
afe069d1 | 403 | if (!revs->prune_data.nr) |
78892e32 LT |
404 | return REV_TREE_SAME; |
405 | } | |
ceff8e7a | 406 | |
8efdc326 | 407 | tree_difference = REV_TREE_SAME; |
8f67f8ae | 408 | DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES); |
c4e05b1a | 409 | if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "", |
cd2bdc53 | 410 | &revs->pruning) < 0) |
8efdc326 | 411 | return REV_TREE_DIFFERENT; |
a4a88b2b LT |
412 | return tree_difference; |
413 | } | |
414 | ||
3a5e8608 | 415 | static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit) |
a4a88b2b LT |
416 | { |
417 | int retval; | |
418 | void *tree; | |
6fda5e51 | 419 | unsigned long size; |
a4a88b2b | 420 | struct tree_desc empty, real; |
3a5e8608 | 421 | struct tree *t1 = commit->tree; |
a4a88b2b LT |
422 | |
423 | if (!t1) | |
424 | return 0; | |
425 | ||
6fda5e51 | 426 | tree = read_object_with_reference(t1->object.sha1, tree_type, &size, NULL); |
a4a88b2b LT |
427 | if (!tree) |
428 | return 0; | |
6fda5e51 LT |
429 | init_tree_desc(&real, tree, size); |
430 | init_tree_desc(&empty, "", 0); | |
a4a88b2b | 431 | |
0a4ba7f8 | 432 | tree_difference = REV_TREE_SAME; |
8f67f8ae | 433 | DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES); |
cd2bdc53 | 434 | retval = diff_tree(&empty, &real, "", &revs->pruning); |
a4a88b2b LT |
435 | free(tree); |
436 | ||
0a4ba7f8 | 437 | return retval >= 0 && (tree_difference == REV_TREE_SAME); |
a4a88b2b LT |
438 | } |
439 | ||
440 | static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit) | |
441 | { | |
442 | struct commit_list **pp, *parent; | |
36ed1913 | 443 | int tree_changed = 0, tree_same = 0, nth_parent = 0; |
a4a88b2b | 444 | |
53b2c823 LT |
445 | /* |
446 | * If we don't do pruning, everything is interesting | |
447 | */ | |
7dc0fe3b | 448 | if (!revs->prune) |
53b2c823 | 449 | return; |
53b2c823 | 450 | |
a4a88b2b LT |
451 | if (!commit->tree) |
452 | return; | |
453 | ||
454 | if (!commit->parents) { | |
3a5e8608 | 455 | if (rev_same_tree_as_empty(revs, commit)) |
7dc0fe3b | 456 | commit->object.flags |= TREESAME; |
a4a88b2b LT |
457 | return; |
458 | } | |
459 | ||
53b2c823 LT |
460 | /* |
461 | * Normal non-merge commit? If we don't want to make the | |
462 | * history dense, we consider it always to be a change.. | |
463 | */ | |
7dc0fe3b | 464 | if (!revs->dense && !commit->parents->next) |
53b2c823 | 465 | return; |
53b2c823 | 466 | |
a4a88b2b LT |
467 | pp = &commit->parents; |
468 | while ((parent = *pp) != NULL) { | |
469 | struct commit *p = parent->item; | |
470 | ||
36ed1913 JH |
471 | /* |
472 | * Do not compare with later parents when we care only about | |
473 | * the first parent chain, in order to avoid derailing the | |
474 | * traversal to follow a side branch that brought everything | |
475 | * in the path we are limited to by the pathspec. | |
476 | */ | |
477 | if (revs->first_parent_only && nth_parent++) | |
478 | break; | |
cc0e6c5a AR |
479 | if (parse_commit(p) < 0) |
480 | die("cannot simplify commit %s (because of %s)", | |
481 | sha1_to_hex(commit->object.sha1), | |
482 | sha1_to_hex(p->object.sha1)); | |
3a5e8608 | 483 | switch (rev_compare_tree(revs, p, commit)) { |
8efdc326 | 484 | case REV_TREE_SAME: |
6631c736 | 485 | tree_same = 1; |
9202434c | 486 | if (!revs->simplify_history || (p->object.flags & UNINTERESTING)) { |
f3219fbb JH |
487 | /* Even if a merge with an uninteresting |
488 | * side branch brought the entire change | |
489 | * we are interested in, we do not want | |
490 | * to lose the other branches of this | |
491 | * merge, so we just keep going. | |
492 | */ | |
493 | pp = &parent->next; | |
494 | continue; | |
495 | } | |
a4a88b2b LT |
496 | parent->next = NULL; |
497 | commit->parents = parent; | |
7dc0fe3b | 498 | commit->object.flags |= TREESAME; |
a4a88b2b LT |
499 | return; |
500 | ||
8efdc326 FK |
501 | case REV_TREE_NEW: |
502 | if (revs->remove_empty_trees && | |
3a5e8608 | 503 | rev_same_tree_as_empty(revs, p)) { |
c348f31a JH |
504 | /* We are adding all the specified |
505 | * paths from this parent, so the | |
506 | * history beyond this parent is not | |
507 | * interesting. Remove its parents | |
508 | * (they are grandparents for us). | |
509 | * IOW, we pretend this parent is a | |
510 | * "root" commit. | |
a41e109c | 511 | */ |
cc0e6c5a AR |
512 | if (parse_commit(p) < 0) |
513 | die("cannot simplify commit %s (invalid %s)", | |
514 | sha1_to_hex(commit->object.sha1), | |
515 | sha1_to_hex(p->object.sha1)); | |
c348f31a | 516 | p->parents = NULL; |
a4a88b2b LT |
517 | } |
518 | /* fallthrough */ | |
ceff8e7a | 519 | case REV_TREE_OLD: |
8efdc326 | 520 | case REV_TREE_DIFFERENT: |
f3219fbb | 521 | tree_changed = 1; |
a4a88b2b LT |
522 | pp = &parent->next; |
523 | continue; | |
524 | } | |
525 | die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1)); | |
526 | } | |
6631c736 | 527 | if (tree_changed && !tree_same) |
7dc0fe3b LT |
528 | return; |
529 | commit->object.flags |= TREESAME; | |
a4a88b2b LT |
530 | } |
531 | ||
47e44ed1 | 532 | static void commit_list_insert_by_date_cached(struct commit *p, struct commit_list **head, |
fce87ae5 AG |
533 | struct commit_list *cached_base, struct commit_list **cache) |
534 | { | |
535 | struct commit_list *new_entry; | |
536 | ||
537 | if (cached_base && p->date < cached_base->item->date) | |
47e44ed1 | 538 | new_entry = commit_list_insert_by_date(p, &cached_base->next); |
fce87ae5 | 539 | else |
47e44ed1 | 540 | new_entry = commit_list_insert_by_date(p, head); |
fce87ae5 AG |
541 | |
542 | if (cache && (!*cache || p->date < (*cache)->item->date)) | |
543 | *cache = new_entry; | |
544 | } | |
545 | ||
546 | static int add_parents_to_list(struct rev_info *revs, struct commit *commit, | |
547 | struct commit_list **list, struct commit_list **cache_ptr) | |
a4a88b2b LT |
548 | { |
549 | struct commit_list *parent = commit->parents; | |
577ed5c2 | 550 | unsigned left_flag; |
fce87ae5 | 551 | struct commit_list *cached_base = cache_ptr ? *cache_ptr : NULL; |
a4a88b2b | 552 | |
3381c790 | 553 | if (commit->object.flags & ADDED) |
cc0e6c5a | 554 | return 0; |
3381c790 LT |
555 | commit->object.flags |= ADDED; |
556 | ||
a4a88b2b LT |
557 | /* |
558 | * If the commit is uninteresting, don't try to | |
559 | * prune parents - we want the maximal uninteresting | |
560 | * set. | |
561 | * | |
562 | * Normally we haven't parsed the parent | |
563 | * yet, so we won't have a parent of a parent | |
564 | * here. However, it may turn out that we've | |
565 | * reached this commit some other way (where it | |
566 | * wasn't uninteresting), in which case we need | |
567 | * to mark its parents recursively too.. | |
568 | */ | |
569 | if (commit->object.flags & UNINTERESTING) { | |
570 | while (parent) { | |
571 | struct commit *p = parent->item; | |
572 | parent = parent->next; | |
aeeae1b7 JH |
573 | if (p) |
574 | p->object.flags |= UNINTERESTING; | |
cc0e6c5a | 575 | if (parse_commit(p) < 0) |
aeeae1b7 | 576 | continue; |
a4a88b2b LT |
577 | if (p->parents) |
578 | mark_parents_uninteresting(p); | |
579 | if (p->object.flags & SEEN) | |
580 | continue; | |
581 | p->object.flags |= SEEN; | |
47e44ed1 | 582 | commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr); |
a4a88b2b | 583 | } |
cc0e6c5a | 584 | return 0; |
a4a88b2b LT |
585 | } |
586 | ||
587 | /* | |
588 | * Ok, the commit wasn't uninteresting. Try to | |
589 | * simplify the commit history and find the parent | |
590 | * that has no differences in the path set if one exists. | |
591 | */ | |
53b2c823 | 592 | try_to_simplify_commit(revs, commit); |
a4a88b2b | 593 | |
ba1d4505 | 594 | if (revs->no_walk) |
cc0e6c5a | 595 | return 0; |
ba1d4505 | 596 | |
577ed5c2 | 597 | left_flag = (commit->object.flags & SYMMETRIC_LEFT); |
0053e902 | 598 | |
d9c292e8 | 599 | for (parent = commit->parents; parent; parent = parent->next) { |
a4a88b2b LT |
600 | struct commit *p = parent->item; |
601 | ||
cc0e6c5a AR |
602 | if (parse_commit(p) < 0) |
603 | return -1; | |
0f3a290b LT |
604 | if (revs->show_source && !p->util) |
605 | p->util = commit->util; | |
577ed5c2 | 606 | p->object.flags |= left_flag; |
ad1012eb LH |
607 | if (!(p->object.flags & SEEN)) { |
608 | p->object.flags |= SEEN; | |
47e44ed1 | 609 | commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr); |
ad1012eb | 610 | } |
60d30b02 | 611 | if (revs->first_parent_only) |
d9c292e8 | 612 | break; |
a4a88b2b | 613 | } |
cc0e6c5a | 614 | return 0; |
a4a88b2b LT |
615 | } |
616 | ||
36d56de6 | 617 | static void cherry_pick_list(struct commit_list *list, struct rev_info *revs) |
d7a17cad JH |
618 | { |
619 | struct commit_list *p; | |
620 | int left_count = 0, right_count = 0; | |
621 | int left_first; | |
622 | struct patch_ids ids; | |
adbbb31e | 623 | unsigned cherry_flag; |
d7a17cad JH |
624 | |
625 | /* First count the commits on the left and on the right */ | |
626 | for (p = list; p; p = p->next) { | |
627 | struct commit *commit = p->item; | |
628 | unsigned flags = commit->object.flags; | |
629 | if (flags & BOUNDARY) | |
630 | ; | |
631 | else if (flags & SYMMETRIC_LEFT) | |
632 | left_count++; | |
633 | else | |
634 | right_count++; | |
635 | } | |
636 | ||
36c07975 TR |
637 | if (!left_count || !right_count) |
638 | return; | |
639 | ||
d7a17cad JH |
640 | left_first = left_count < right_count; |
641 | init_patch_ids(&ids); | |
66f13625 | 642 | ids.diffopts.pathspec = revs->diffopt.pathspec; |
d7a17cad JH |
643 | |
644 | /* Compute patch-ids for one side */ | |
645 | for (p = list; p; p = p->next) { | |
646 | struct commit *commit = p->item; | |
647 | unsigned flags = commit->object.flags; | |
648 | ||
649 | if (flags & BOUNDARY) | |
650 | continue; | |
651 | /* | |
652 | * If we have fewer left, left_first is set and we omit | |
653 | * commits on the right branch in this loop. If we have | |
654 | * fewer right, we skip the left ones. | |
655 | */ | |
656 | if (left_first != !!(flags & SYMMETRIC_LEFT)) | |
657 | continue; | |
658 | commit->util = add_commit_patch_id(commit, &ids); | |
659 | } | |
660 | ||
adbbb31e MG |
661 | /* either cherry_mark or cherry_pick are true */ |
662 | cherry_flag = revs->cherry_mark ? PATCHSAME : SHOWN; | |
663 | ||
d7a17cad JH |
664 | /* Check the other side */ |
665 | for (p = list; p; p = p->next) { | |
666 | struct commit *commit = p->item; | |
667 | struct patch_id *id; | |
668 | unsigned flags = commit->object.flags; | |
669 | ||
670 | if (flags & BOUNDARY) | |
671 | continue; | |
672 | /* | |
673 | * If we have fewer left, left_first is set and we omit | |
674 | * commits on the left branch in this loop. | |
675 | */ | |
676 | if (left_first == !!(flags & SYMMETRIC_LEFT)) | |
677 | continue; | |
678 | ||
679 | /* | |
680 | * Have we seen the same patch id? | |
681 | */ | |
682 | id = has_commit_patch_id(commit, &ids); | |
683 | if (!id) | |
684 | continue; | |
685 | id->seen = 1; | |
adbbb31e | 686 | commit->object.flags |= cherry_flag; |
d7a17cad JH |
687 | } |
688 | ||
689 | /* Now check the original side for seen ones */ | |
690 | for (p = list; p; p = p->next) { | |
691 | struct commit *commit = p->item; | |
692 | struct patch_id *ent; | |
693 | ||
694 | ent = commit->util; | |
695 | if (!ent) | |
696 | continue; | |
697 | if (ent->seen) | |
adbbb31e | 698 | commit->object.flags |= cherry_flag; |
d7a17cad JH |
699 | commit->util = NULL; |
700 | } | |
701 | ||
702 | free_patch_ids(&ids); | |
703 | } | |
704 | ||
7d004199 LT |
705 | /* How many extra uninteresting commits we want to see.. */ |
706 | #define SLOP 5 | |
707 | ||
708 | static int still_interesting(struct commit_list *src, unsigned long date, int slop) | |
3131b713 | 709 | { |
7d004199 LT |
710 | /* |
711 | * No source list at all? We're definitely done.. | |
712 | */ | |
713 | if (!src) | |
714 | return 0; | |
715 | ||
716 | /* | |
717 | * Does the destination list contain entries with a date | |
718 | * before the source list? Definitely _not_ done. | |
719 | */ | |
720 | if (date < src->item->date) | |
721 | return SLOP; | |
722 | ||
723 | /* | |
724 | * Does the source list still have interesting commits in | |
725 | * it? Definitely not done.. | |
726 | */ | |
727 | if (!everybody_uninteresting(src)) | |
728 | return SLOP; | |
729 | ||
730 | /* Ok, we're closing in.. */ | |
731 | return slop-1; | |
3131b713 LT |
732 | } |
733 | ||
ebdc94f3 JH |
734 | /* |
735 | * "rev-list --ancestry-path A..B" computes commits that are ancestors | |
736 | * of B but not ancestors of A but further limits the result to those | |
737 | * that are descendants of A. This takes the list of bottom commits and | |
738 | * the result of "A..B" without --ancestry-path, and limits the latter | |
739 | * further to the ones that can reach one of the commits in "bottom". | |
740 | */ | |
741 | static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list) | |
742 | { | |
743 | struct commit_list *p; | |
744 | struct commit_list *rlist = NULL; | |
745 | int made_progress; | |
746 | ||
747 | /* | |
748 | * Reverse the list so that it will be likely that we would | |
749 | * process parents before children. | |
750 | */ | |
751 | for (p = list; p; p = p->next) | |
752 | commit_list_insert(p->item, &rlist); | |
753 | ||
754 | for (p = bottom; p; p = p->next) | |
755 | p->item->object.flags |= TMP_MARK; | |
756 | ||
757 | /* | |
758 | * Mark the ones that can reach bottom commits in "list", | |
759 | * in a bottom-up fashion. | |
760 | */ | |
761 | do { | |
762 | made_progress = 0; | |
763 | for (p = rlist; p; p = p->next) { | |
764 | struct commit *c = p->item; | |
765 | struct commit_list *parents; | |
766 | if (c->object.flags & (TMP_MARK | UNINTERESTING)) | |
767 | continue; | |
768 | for (parents = c->parents; | |
769 | parents; | |
770 | parents = parents->next) { | |
771 | if (!(parents->item->object.flags & TMP_MARK)) | |
772 | continue; | |
773 | c->object.flags |= TMP_MARK; | |
774 | made_progress = 1; | |
775 | break; | |
776 | } | |
777 | } | |
778 | } while (made_progress); | |
779 | ||
780 | /* | |
781 | * NEEDSWORK: decide if we want to remove parents that are | |
782 | * not marked with TMP_MARK from commit->parents for commits | |
783 | * in the resulting list. We may not want to do that, though. | |
784 | */ | |
785 | ||
786 | /* | |
787 | * The ones that are not marked with TMP_MARK are uninteresting | |
788 | */ | |
789 | for (p = list; p; p = p->next) { | |
790 | struct commit *c = p->item; | |
791 | if (c->object.flags & TMP_MARK) | |
792 | continue; | |
793 | c->object.flags |= UNINTERESTING; | |
794 | } | |
795 | ||
796 | /* We are done with the TMP_MARK */ | |
797 | for (p = list; p; p = p->next) | |
798 | p->item->object.flags &= ~TMP_MARK; | |
799 | for (p = bottom; p; p = p->next) | |
800 | p->item->object.flags &= ~TMP_MARK; | |
801 | free_commit_list(rlist); | |
802 | } | |
803 | ||
804 | /* | |
805 | * Before walking the history, keep the set of "negative" refs the | |
806 | * caller has asked to exclude. | |
807 | * | |
808 | * This is used to compute "rev-list --ancestry-path A..B", as we need | |
809 | * to filter the result of "A..B" further to the ones that can actually | |
810 | * reach A. | |
811 | */ | |
c3502fa8 | 812 | static struct commit_list *collect_bottom_commits(struct rev_info *revs) |
ebdc94f3 | 813 | { |
c3502fa8 JH |
814 | struct commit_list *bottom = NULL; |
815 | int i; | |
816 | for (i = 0; i < revs->cmdline.nr; i++) { | |
817 | struct rev_cmdline_entry *elem = &revs->cmdline.rev[i]; | |
818 | if ((elem->flags & UNINTERESTING) && | |
819 | elem->item->type == OBJ_COMMIT) | |
820 | commit_list_insert((struct commit *)elem->item, &bottom); | |
821 | } | |
ebdc94f3 JH |
822 | return bottom; |
823 | } | |
824 | ||
60adf7d7 MG |
825 | /* Assumes either left_only or right_only is set */ |
826 | static void limit_left_right(struct commit_list *list, struct rev_info *revs) | |
827 | { | |
828 | struct commit_list *p; | |
829 | ||
830 | for (p = list; p; p = p->next) { | |
831 | struct commit *commit = p->item; | |
832 | ||
833 | if (revs->right_only) { | |
834 | if (commit->object.flags & SYMMETRIC_LEFT) | |
835 | commit->object.flags |= SHOWN; | |
836 | } else /* revs->left_only is set */ | |
837 | if (!(commit->object.flags & SYMMETRIC_LEFT)) | |
838 | commit->object.flags |= SHOWN; | |
839 | } | |
840 | } | |
841 | ||
cc0e6c5a | 842 | static int limit_list(struct rev_info *revs) |
a4a88b2b | 843 | { |
7d004199 LT |
844 | int slop = SLOP; |
845 | unsigned long date = ~0ul; | |
a4a88b2b LT |
846 | struct commit_list *list = revs->commits; |
847 | struct commit_list *newlist = NULL; | |
848 | struct commit_list **p = &newlist; | |
ebdc94f3 JH |
849 | struct commit_list *bottom = NULL; |
850 | ||
851 | if (revs->ancestry_path) { | |
c3502fa8 | 852 | bottom = collect_bottom_commits(revs); |
ebdc94f3 | 853 | if (!bottom) |
97b03c35 | 854 | die("--ancestry-path given but there are no bottom commits"); |
ebdc94f3 | 855 | } |
a4a88b2b LT |
856 | |
857 | while (list) { | |
858 | struct commit_list *entry = list; | |
859 | struct commit *commit = list->item; | |
860 | struct object *obj = &commit->object; | |
cdcefbc9 | 861 | show_early_output_fn_t show; |
a4a88b2b LT |
862 | |
863 | list = list->next; | |
864 | free(entry); | |
865 | ||
866 | if (revs->max_age != -1 && (commit->date < revs->max_age)) | |
867 | obj->flags |= UNINTERESTING; | |
fce87ae5 | 868 | if (add_parents_to_list(revs, commit, &list, NULL) < 0) |
cc0e6c5a | 869 | return -1; |
a4a88b2b LT |
870 | if (obj->flags & UNINTERESTING) { |
871 | mark_parents_uninteresting(commit); | |
7d004199 LT |
872 | if (revs->show_all) |
873 | p = &commit_list_insert(commit, p)->next; | |
874 | slop = still_interesting(list, date, slop); | |
875 | if (slop) | |
3131b713 | 876 | continue; |
7d004199 LT |
877 | /* If showing all, add the whole pending list to the end */ |
878 | if (revs->show_all) | |
879 | *p = list; | |
880 | break; | |
a4a88b2b LT |
881 | } |
882 | if (revs->min_age != -1 && (commit->date > revs->min_age)) | |
883 | continue; | |
7d004199 | 884 | date = commit->date; |
a4a88b2b | 885 | p = &commit_list_insert(commit, p)->next; |
cdcefbc9 LT |
886 | |
887 | show = show_early_output; | |
888 | if (!show) | |
889 | continue; | |
890 | ||
891 | show(revs, newlist); | |
892 | show_early_output = NULL; | |
a4a88b2b | 893 | } |
adbbb31e | 894 | if (revs->cherry_pick || revs->cherry_mark) |
36d56de6 | 895 | cherry_pick_list(newlist, revs); |
d7a17cad | 896 | |
60adf7d7 MG |
897 | if (revs->left_only || revs->right_only) |
898 | limit_left_right(newlist, revs); | |
899 | ||
ebdc94f3 JH |
900 | if (bottom) { |
901 | limit_to_ancestry(bottom, newlist); | |
902 | free_commit_list(bottom); | |
903 | } | |
904 | ||
a4a88b2b | 905 | revs->commits = newlist; |
cc0e6c5a | 906 | return 0; |
a4a88b2b LT |
907 | } |
908 | ||
281eee47 JH |
909 | static void add_rev_cmdline(struct rev_info *revs, |
910 | struct object *item, | |
911 | const char *name, | |
912 | int whence, | |
913 | unsigned flags) | |
914 | { | |
915 | struct rev_cmdline_info *info = &revs->cmdline; | |
916 | int nr = info->nr; | |
917 | ||
918 | ALLOC_GROW(info->rev, nr + 1, info->alloc); | |
919 | info->rev[nr].item = item; | |
920 | info->rev[nr].name = name; | |
921 | info->rev[nr].whence = whence; | |
922 | info->rev[nr].flags = flags; | |
923 | info->nr++; | |
924 | } | |
925 | ||
63049292 JH |
926 | struct all_refs_cb { |
927 | int all_flags; | |
71b03b42 | 928 | int warned_bad_reflog; |
63049292 JH |
929 | struct rev_info *all_revs; |
930 | const char *name_for_errormsg; | |
931 | }; | |
ae563542 | 932 | |
8da19775 | 933 | static int handle_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data) |
ae563542 | 934 | { |
63049292 JH |
935 | struct all_refs_cb *cb = cb_data; |
936 | struct object *object = get_reference(cb->all_revs, path, sha1, | |
937 | cb->all_flags); | |
281eee47 | 938 | add_rev_cmdline(cb->all_revs, object, path, REV_CMD_REF, cb->all_flags); |
26c3177e | 939 | add_pending_sha1(cb->all_revs, path, sha1, cb->all_flags); |
ae563542 LT |
940 | return 0; |
941 | } | |
942 | ||
d08bae7e IL |
943 | static void init_all_refs_cb(struct all_refs_cb *cb, struct rev_info *revs, |
944 | unsigned flags) | |
945 | { | |
946 | cb->all_revs = revs; | |
947 | cb->all_flags = flags; | |
948 | } | |
949 | ||
9ef6aeb0 HV |
950 | static void handle_refs(const char *submodule, struct rev_info *revs, unsigned flags, |
951 | int (*for_each)(const char *, each_ref_fn, void *)) | |
ae563542 | 952 | { |
63049292 | 953 | struct all_refs_cb cb; |
d08bae7e | 954 | init_all_refs_cb(&cb, revs, flags); |
9ef6aeb0 | 955 | for_each(submodule, handle_one_ref, &cb); |
63049292 JH |
956 | } |
957 | ||
71b03b42 | 958 | static void handle_one_reflog_commit(unsigned char *sha1, void *cb_data) |
63049292 JH |
959 | { |
960 | struct all_refs_cb *cb = cb_data; | |
71b03b42 SP |
961 | if (!is_null_sha1(sha1)) { |
962 | struct object *o = parse_object(sha1); | |
963 | if (o) { | |
964 | o->flags |= cb->all_flags; | |
281eee47 | 965 | /* ??? CMDLINEFLAGS ??? */ |
71b03b42 SP |
966 | add_pending_object(cb->all_revs, o, ""); |
967 | } | |
968 | else if (!cb->warned_bad_reflog) { | |
46efd2d9 | 969 | warning("reflog of '%s' references pruned commits", |
71b03b42 SP |
970 | cb->name_for_errormsg); |
971 | cb->warned_bad_reflog = 1; | |
972 | } | |
63049292 | 973 | } |
71b03b42 SP |
974 | } |
975 | ||
883d60fa JS |
976 | static int handle_one_reflog_ent(unsigned char *osha1, unsigned char *nsha1, |
977 | const char *email, unsigned long timestamp, int tz, | |
978 | const char *message, void *cb_data) | |
71b03b42 SP |
979 | { |
980 | handle_one_reflog_commit(osha1, cb_data); | |
981 | handle_one_reflog_commit(nsha1, cb_data); | |
63049292 JH |
982 | return 0; |
983 | } | |
984 | ||
985 | static int handle_one_reflog(const char *path, const unsigned char *sha1, int flag, void *cb_data) | |
986 | { | |
987 | struct all_refs_cb *cb = cb_data; | |
71b03b42 | 988 | cb->warned_bad_reflog = 0; |
63049292 JH |
989 | cb->name_for_errormsg = path; |
990 | for_each_reflog_ent(path, handle_one_reflog_ent, cb_data); | |
991 | return 0; | |
992 | } | |
993 | ||
994 | static void handle_reflog(struct rev_info *revs, unsigned flags) | |
995 | { | |
996 | struct all_refs_cb cb; | |
997 | cb.all_revs = revs; | |
998 | cb.all_flags = flags; | |
25b51e2c | 999 | for_each_reflog(handle_one_reflog, &cb); |
ae563542 LT |
1000 | } |
1001 | ||
281eee47 | 1002 | static int add_parents_only(struct rev_info *revs, const char *arg_, int flags) |
ea4a19e1 JH |
1003 | { |
1004 | unsigned char sha1[20]; | |
1005 | struct object *it; | |
1006 | struct commit *commit; | |
1007 | struct commit_list *parents; | |
281eee47 | 1008 | const char *arg = arg_; |
ea4a19e1 JH |
1009 | |
1010 | if (*arg == '^') { | |
1011 | flags ^= UNINTERESTING; | |
1012 | arg++; | |
1013 | } | |
cd74e473 | 1014 | if (get_sha1_committish(arg, sha1)) |
ea4a19e1 JH |
1015 | return 0; |
1016 | while (1) { | |
1017 | it = get_reference(revs, arg, sha1, 0); | |
cc243c3c JH |
1018 | if (!it && revs->ignore_missing) |
1019 | return 0; | |
1974632c | 1020 | if (it->type != OBJ_TAG) |
ea4a19e1 | 1021 | break; |
9684afd9 MK |
1022 | if (!((struct tag*)it)->tagged) |
1023 | return 0; | |
e702496e | 1024 | hashcpy(sha1, ((struct tag*)it)->tagged->sha1); |
ea4a19e1 | 1025 | } |
1974632c | 1026 | if (it->type != OBJ_COMMIT) |
ea4a19e1 JH |
1027 | return 0; |
1028 | commit = (struct commit *)it; | |
1029 | for (parents = commit->parents; parents; parents = parents->next) { | |
1030 | it = &parents->item->object; | |
1031 | it->flags |= flags; | |
281eee47 | 1032 | add_rev_cmdline(revs, it, arg_, REV_CMD_PARENTS_ONLY, flags); |
ea4a19e1 JH |
1033 | add_pending_object(revs, it, arg); |
1034 | } | |
1035 | return 1; | |
1036 | } | |
1037 | ||
db6296a5 | 1038 | void init_revisions(struct rev_info *revs, const char *prefix) |
8efdc326 FK |
1039 | { |
1040 | memset(revs, 0, sizeof(*revs)); | |
8e8f9987 | 1041 | |
6b9c58f4 | 1042 | revs->abbrev = DEFAULT_ABBREV; |
8e8f9987 | 1043 | revs->ignore_merges = 1; |
9202434c | 1044 | revs->simplify_history = 1; |
8f67f8ae | 1045 | DIFF_OPT_SET(&revs->pruning, RECURSIVE); |
90b19941 | 1046 | DIFF_OPT_SET(&revs->pruning, QUICK); |
cd2bdc53 LT |
1047 | revs->pruning.add_remove = file_add_remove; |
1048 | revs->pruning.change = file_change; | |
8efdc326 FK |
1049 | revs->lifo = 1; |
1050 | revs->dense = 1; | |
db6296a5 | 1051 | revs->prefix = prefix; |
8efdc326 FK |
1052 | revs->max_age = -1; |
1053 | revs->min_age = -1; | |
d5db6c9e | 1054 | revs->skip_count = -1; |
8efdc326 | 1055 | revs->max_count = -1; |
ad5aeede | 1056 | revs->max_parents = -1; |
8efdc326 | 1057 | |
cd2bdc53 LT |
1058 | revs->commit_format = CMIT_FMT_DEFAULT; |
1059 | ||
918d4e1c JH |
1060 | init_grep_defaults(); |
1061 | grep_init(&revs->grep_filter, prefix); | |
0843acfd | 1062 | revs->grep_filter.status_only = 1; |
0843acfd JK |
1063 | revs->grep_filter.regflags = REG_NEWLINE; |
1064 | ||
cd2bdc53 | 1065 | diff_setup(&revs->diffopt); |
c0cb4a06 | 1066 | if (prefix && !revs->diffopt.prefix) { |
cd676a51 JH |
1067 | revs->diffopt.prefix = prefix; |
1068 | revs->diffopt.prefix_length = strlen(prefix); | |
1069 | } | |
3a03cf6b JK |
1070 | |
1071 | revs->notes_opt.use_default_notes = -1; | |
8efdc326 FK |
1072 | } |
1073 | ||
0d2c9d67 RS |
1074 | static void add_pending_commit_list(struct rev_info *revs, |
1075 | struct commit_list *commit_list, | |
1076 | unsigned int flags) | |
1077 | { | |
1078 | while (commit_list) { | |
1079 | struct object *object = &commit_list->item->object; | |
1080 | object->flags |= flags; | |
1081 | add_pending_object(revs, object, sha1_to_hex(object->sha1)); | |
1082 | commit_list = commit_list->next; | |
1083 | } | |
1084 | } | |
1085 | ||
ae3e5e1e JH |
1086 | static void prepare_show_merge(struct rev_info *revs) |
1087 | { | |
1088 | struct commit_list *bases; | |
1089 | struct commit *head, *other; | |
1090 | unsigned char sha1[20]; | |
1091 | const char **prune = NULL; | |
1092 | int i, prune_num = 1; /* counting terminating NULL */ | |
1093 | ||
baf18fc2 | 1094 | if (get_sha1("HEAD", sha1)) |
ae3e5e1e | 1095 | die("--merge without HEAD?"); |
baf18fc2 NTND |
1096 | head = lookup_commit_or_die(sha1, "HEAD"); |
1097 | if (get_sha1("MERGE_HEAD", sha1)) | |
ae3e5e1e | 1098 | die("--merge without MERGE_HEAD?"); |
baf18fc2 | 1099 | other = lookup_commit_or_die(sha1, "MERGE_HEAD"); |
ae3e5e1e JH |
1100 | add_pending_object(revs, &head->object, "HEAD"); |
1101 | add_pending_object(revs, &other->object, "MERGE_HEAD"); | |
1102 | bases = get_merge_bases(head, other, 1); | |
e82447b1 JH |
1103 | add_pending_commit_list(revs, bases, UNINTERESTING); |
1104 | free_commit_list(bases); | |
1105 | head->object.flags |= SYMMETRIC_LEFT; | |
ae3e5e1e JH |
1106 | |
1107 | if (!active_nr) | |
1108 | read_cache(); | |
1109 | for (i = 0; i < active_nr; i++) { | |
1110 | struct cache_entry *ce = active_cache[i]; | |
1111 | if (!ce_stage(ce)) | |
1112 | continue; | |
eb9cb55b | 1113 | if (ce_path_match(ce, &revs->prune_data)) { |
ae3e5e1e JH |
1114 | prune_num++; |
1115 | prune = xrealloc(prune, sizeof(*prune) * prune_num); | |
1116 | prune[prune_num-2] = ce->name; | |
1117 | prune[prune_num-1] = NULL; | |
1118 | } | |
1119 | while ((i+1 < active_nr) && | |
1120 | ce_same_name(ce, active_cache[i+1])) | |
1121 | i++; | |
1122 | } | |
afe069d1 NTND |
1123 | free_pathspec(&revs->prune_data); |
1124 | init_pathspec(&revs->prune_data, prune); | |
e82447b1 | 1125 | revs->limited = 1; |
ae3e5e1e JH |
1126 | } |
1127 | ||
8e676e8b | 1128 | int handle_revision_arg(const char *arg_, struct rev_info *revs, int flags, unsigned revarg_opt) |
5d6f0935 | 1129 | { |
249c8f4a | 1130 | struct object_context oc; |
5d6f0935 JH |
1131 | char *dotdot; |
1132 | struct object *object; | |
1133 | unsigned char sha1[20]; | |
1134 | int local_flags; | |
281eee47 | 1135 | const char *arg = arg_; |
8e676e8b | 1136 | int cant_be_filename = revarg_opt & REVARG_CANNOT_BE_FILENAME; |
d5f6b1d7 | 1137 | unsigned get_sha1_flags = 0; |
5d6f0935 JH |
1138 | |
1139 | dotdot = strstr(arg, ".."); | |
1140 | if (dotdot) { | |
1141 | unsigned char from_sha1[20]; | |
1142 | const char *next = dotdot + 2; | |
1143 | const char *this = arg; | |
1144 | int symmetric = *next == '.'; | |
1145 | unsigned int flags_exclude = flags ^ UNINTERESTING; | |
003c84f6 | 1146 | static const char head_by_default[] = "HEAD"; |
281eee47 | 1147 | unsigned int a_flags; |
5d6f0935 JH |
1148 | |
1149 | *dotdot = 0; | |
1150 | next += symmetric; | |
1151 | ||
1152 | if (!*next) | |
003c84f6 | 1153 | next = head_by_default; |
5d6f0935 | 1154 | if (dotdot == arg) |
003c84f6 JH |
1155 | this = head_by_default; |
1156 | if (this == head_by_default && next == head_by_default && | |
1157 | !symmetric) { | |
1158 | /* | |
1159 | * Just ".."? That is not a range but the | |
1160 | * pathspec for the parent directory. | |
1161 | */ | |
1162 | if (!cant_be_filename) { | |
1163 | *dotdot = '.'; | |
1164 | return -1; | |
1165 | } | |
1166 | } | |
cd74e473 JH |
1167 | if (!get_sha1_committish(this, from_sha1) && |
1168 | !get_sha1_committish(next, sha1)) { | |
895c5ba3 | 1169 | struct object *a_obj, *b_obj; |
5d6f0935 JH |
1170 | |
1171 | if (!cant_be_filename) { | |
1172 | *dotdot = '.'; | |
1173 | verify_non_filename(revs->prefix, arg); | |
1174 | } | |
1175 | ||
895c5ba3 JH |
1176 | a_obj = parse_object(from_sha1); |
1177 | b_obj = parse_object(sha1); | |
1178 | if (!a_obj || !b_obj) { | |
1179 | missing: | |
1180 | if (revs->ignore_missing) | |
1181 | return 0; | |
1182 | die(symmetric | |
1183 | ? "Invalid symmetric difference expression %s" | |
1184 | : "Invalid revision range %s", arg); | |
1185 | } | |
1186 | ||
1187 | if (!symmetric) { | |
1188 | /* just A..B */ | |
1189 | a_flags = flags_exclude; | |
1190 | } else { | |
1191 | /* A...B -- find merge bases between the two */ | |
1192 | struct commit *a, *b; | |
1193 | struct commit_list *exclude; | |
1194 | ||
1195 | a = (a_obj->type == OBJ_COMMIT | |
1196 | ? (struct commit *)a_obj | |
1197 | : lookup_commit_reference(a_obj->sha1)); | |
1198 | b = (b_obj->type == OBJ_COMMIT | |
1199 | ? (struct commit *)b_obj | |
1200 | : lookup_commit_reference(b_obj->sha1)); | |
1201 | if (!a || !b) | |
1202 | goto missing; | |
5d6f0935 JH |
1203 | exclude = get_merge_bases(a, b, 1); |
1204 | add_pending_commit_list(revs, exclude, | |
1205 | flags_exclude); | |
1206 | free_commit_list(exclude); | |
895c5ba3 | 1207 | |
281eee47 | 1208 | a_flags = flags | SYMMETRIC_LEFT; |
895c5ba3 JH |
1209 | } |
1210 | ||
1211 | a_obj->flags |= a_flags; | |
1212 | b_obj->flags |= flags; | |
1213 | add_rev_cmdline(revs, a_obj, this, | |
281eee47 | 1214 | REV_CMD_LEFT, a_flags); |
895c5ba3 | 1215 | add_rev_cmdline(revs, b_obj, next, |
281eee47 | 1216 | REV_CMD_RIGHT, flags); |
895c5ba3 JH |
1217 | add_pending_object(revs, a_obj, this); |
1218 | add_pending_object(revs, b_obj, next); | |
5d6f0935 JH |
1219 | return 0; |
1220 | } | |
1221 | *dotdot = '.'; | |
1222 | } | |
1223 | dotdot = strstr(arg, "^@"); | |
1224 | if (dotdot && !dotdot[2]) { | |
1225 | *dotdot = 0; | |
1226 | if (add_parents_only(revs, arg, flags)) | |
1227 | return 0; | |
1228 | *dotdot = '^'; | |
1229 | } | |
62476c8e JH |
1230 | dotdot = strstr(arg, "^!"); |
1231 | if (dotdot && !dotdot[2]) { | |
1232 | *dotdot = 0; | |
1233 | if (!add_parents_only(revs, arg, flags ^ UNINTERESTING)) | |
1234 | *dotdot = '^'; | |
1235 | } | |
1236 | ||
5d6f0935 JH |
1237 | local_flags = 0; |
1238 | if (*arg == '^') { | |
1239 | local_flags = UNINTERESTING; | |
1240 | arg++; | |
1241 | } | |
d5f6b1d7 JH |
1242 | |
1243 | if (revarg_opt & REVARG_COMMITTISH) | |
1244 | get_sha1_flags = GET_SHA1_COMMITTISH; | |
1245 | ||
1246 | if (get_sha1_with_context(arg, get_sha1_flags, sha1, &oc)) | |
cc243c3c | 1247 | return revs->ignore_missing ? 0 : -1; |
5d6f0935 JH |
1248 | if (!cant_be_filename) |
1249 | verify_non_filename(revs->prefix, arg); | |
1250 | object = get_reference(revs, arg, sha1, flags ^ local_flags); | |
281eee47 | 1251 | add_rev_cmdline(revs, object, arg_, REV_CMD_REV, flags ^ local_flags); |
249c8f4a | 1252 | add_pending_object_with_mode(revs, object, arg, oc.mode); |
5d6f0935 JH |
1253 | return 0; |
1254 | } | |
1255 | ||
4da5af31 JH |
1256 | struct cmdline_pathspec { |
1257 | int alloc; | |
1258 | int nr; | |
1259 | const char **path; | |
1260 | }; | |
1fc561d1 | 1261 | |
4da5af31 JH |
1262 | static void append_prune_data(struct cmdline_pathspec *prune, const char **av) |
1263 | { | |
1264 | while (*av) { | |
1265 | ALLOC_GROW(prune->path, prune->nr+1, prune->alloc); | |
1266 | prune->path[prune->nr++] = *(av++); | |
1267 | } | |
1268 | } | |
60da8b15 | 1269 | |
4da5af31 JH |
1270 | static void read_pathspec_from_stdin(struct rev_info *revs, struct strbuf *sb, |
1271 | struct cmdline_pathspec *prune) | |
1272 | { | |
60da8b15 JH |
1273 | while (strbuf_getwholeline(sb, stdin, '\n') != EOF) { |
1274 | int len = sb->len; | |
1275 | if (len && sb->buf[len - 1] == '\n') | |
1276 | sb->buf[--len] = '\0'; | |
4da5af31 JH |
1277 | ALLOC_GROW(prune->path, prune->nr+1, prune->alloc); |
1278 | prune->path[prune->nr++] = xstrdup(sb->buf); | |
60da8b15 | 1279 | } |
60da8b15 JH |
1280 | } |
1281 | ||
4da5af31 JH |
1282 | static void read_revisions_from_stdin(struct rev_info *revs, |
1283 | struct cmdline_pathspec *prune) | |
1fc561d1 | 1284 | { |
63d564b3 | 1285 | struct strbuf sb; |
60da8b15 | 1286 | int seen_dashdash = 0; |
1fc561d1 | 1287 | |
63d564b3 JH |
1288 | strbuf_init(&sb, 1000); |
1289 | while (strbuf_getwholeline(&sb, stdin, '\n') != EOF) { | |
1290 | int len = sb.len; | |
1291 | if (len && sb.buf[len - 1] == '\n') | |
1292 | sb.buf[--len] = '\0'; | |
1fc561d1 AB |
1293 | if (!len) |
1294 | break; | |
60da8b15 JH |
1295 | if (sb.buf[0] == '-') { |
1296 | if (len == 2 && sb.buf[1] == '-') { | |
1297 | seen_dashdash = 1; | |
1298 | break; | |
1299 | } | |
1fc561d1 | 1300 | die("options not supported in --stdin mode"); |
60da8b15 | 1301 | } |
8e676e8b | 1302 | if (handle_revision_arg(sb.buf, revs, 0, REVARG_CANNOT_BE_FILENAME)) |
63d564b3 | 1303 | die("bad revision '%s'", sb.buf); |
1fc561d1 | 1304 | } |
60da8b15 JH |
1305 | if (seen_dashdash) |
1306 | read_pathspec_from_stdin(revs, &sb, prune); | |
63d564b3 | 1307 | strbuf_release(&sb); |
1fc561d1 AB |
1308 | } |
1309 | ||
2d10c555 | 1310 | static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what) |
bd95fcd3 | 1311 | { |
0843acfd | 1312 | append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what); |
2d10c555 JH |
1313 | } |
1314 | ||
a4d7d2c6 | 1315 | static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern) |
2d10c555 | 1316 | { |
a4d7d2c6 | 1317 | append_header_grep_pattern(&revs->grep_filter, field, pattern); |
bd95fcd3 JH |
1318 | } |
1319 | ||
1320 | static void add_message_grep(struct rev_info *revs, const char *pattern) | |
1321 | { | |
2d10c555 | 1322 | add_grep(revs, pattern, GREP_PATTERN_BODY); |
bd95fcd3 JH |
1323 | } |
1324 | ||
6b61ec05 PH |
1325 | static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv, |
1326 | int *unkc, const char **unkv) | |
02e54220 PH |
1327 | { |
1328 | const char *arg = argv[0]; | |
7d7b86f7 MM |
1329 | const char *optarg; |
1330 | int argcount; | |
02e54220 PH |
1331 | |
1332 | /* pseudo revision arguments */ | |
1333 | if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") || | |
1334 | !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") || | |
1335 | !strcmp(arg, "--reflog") || !strcmp(arg, "--not") || | |
ad3f9a71 | 1336 | !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") || |
0fc63ec4 JN |
1337 | !strcmp(arg, "--bisect") || !prefixcmp(arg, "--glob=") || |
1338 | !prefixcmp(arg, "--branches=") || !prefixcmp(arg, "--tags=") || | |
ca92e59e | 1339 | !prefixcmp(arg, "--remotes=") || !prefixcmp(arg, "--no-walk=")) |
02e54220 PH |
1340 | { |
1341 | unkv[(*unkc)++] = arg; | |
0fe8c138 | 1342 | return 1; |
02e54220 PH |
1343 | } |
1344 | ||
7d7b86f7 MM |
1345 | if ((argcount = parse_long_opt("max-count", argv, &optarg))) { |
1346 | revs->max_count = atoi(optarg); | |
5853caec | 1347 | revs->no_walk = 0; |
7d7b86f7 MM |
1348 | return argcount; |
1349 | } else if ((argcount = parse_long_opt("skip", argv, &optarg))) { | |
1350 | revs->skip_count = atoi(optarg); | |
1351 | return argcount; | |
02e54220 PH |
1352 | } else if ((*arg == '-') && isdigit(arg[1])) { |
1353 | /* accept -<digit>, like traditional "head" */ | |
1354 | revs->max_count = atoi(arg + 1); | |
5853caec | 1355 | revs->no_walk = 0; |
02e54220 PH |
1356 | } else if (!strcmp(arg, "-n")) { |
1357 | if (argc <= 1) | |
1358 | return error("-n requires an argument"); | |
1359 | revs->max_count = atoi(argv[1]); | |
5853caec | 1360 | revs->no_walk = 0; |
02e54220 PH |
1361 | return 2; |
1362 | } else if (!prefixcmp(arg, "-n")) { | |
1363 | revs->max_count = atoi(arg + 2); | |
5853caec | 1364 | revs->no_walk = 0; |
7d7b86f7 MM |
1365 | } else if ((argcount = parse_long_opt("max-age", argv, &optarg))) { |
1366 | revs->max_age = atoi(optarg); | |
1367 | return argcount; | |
1368 | } else if ((argcount = parse_long_opt("since", argv, &optarg))) { | |
1369 | revs->max_age = approxidate(optarg); | |
1370 | return argcount; | |
1371 | } else if ((argcount = parse_long_opt("after", argv, &optarg))) { | |
1372 | revs->max_age = approxidate(optarg); | |
1373 | return argcount; | |
1374 | } else if ((argcount = parse_long_opt("min-age", argv, &optarg))) { | |
1375 | revs->min_age = atoi(optarg); | |
1376 | return argcount; | |
1377 | } else if ((argcount = parse_long_opt("before", argv, &optarg))) { | |
1378 | revs->min_age = approxidate(optarg); | |
1379 | return argcount; | |
1380 | } else if ((argcount = parse_long_opt("until", argv, &optarg))) { | |
1381 | revs->min_age = approxidate(optarg); | |
1382 | return argcount; | |
02e54220 PH |
1383 | } else if (!strcmp(arg, "--first-parent")) { |
1384 | revs->first_parent_only = 1; | |
ebdc94f3 JH |
1385 | } else if (!strcmp(arg, "--ancestry-path")) { |
1386 | revs->ancestry_path = 1; | |
cb7529e1 | 1387 | revs->simplify_history = 0; |
ebdc94f3 | 1388 | revs->limited = 1; |
02e54220 PH |
1389 | } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) { |
1390 | init_reflog_walk(&revs->reflog_info); | |
1391 | } else if (!strcmp(arg, "--default")) { | |
1392 | if (argc <= 1) | |
1393 | return error("bad --default argument"); | |
1394 | revs->def = argv[1]; | |
1395 | return 2; | |
1396 | } else if (!strcmp(arg, "--merge")) { | |
1397 | revs->show_merge = 1; | |
1398 | } else if (!strcmp(arg, "--topo-order")) { | |
1399 | revs->lifo = 1; | |
1400 | revs->topo_order = 1; | |
6546b593 JH |
1401 | } else if (!strcmp(arg, "--simplify-merges")) { |
1402 | revs->simplify_merges = 1; | |
a52f0071 | 1403 | revs->topo_order = 1; |
6546b593 JH |
1404 | revs->rewrite_parents = 1; |
1405 | revs->simplify_history = 0; | |
1406 | revs->limited = 1; | |
78892e32 LT |
1407 | } else if (!strcmp(arg, "--simplify-by-decoration")) { |
1408 | revs->simplify_merges = 1; | |
a52f0071 | 1409 | revs->topo_order = 1; |
78892e32 LT |
1410 | revs->rewrite_parents = 1; |
1411 | revs->simplify_history = 0; | |
1412 | revs->simplify_by_decoration = 1; | |
1413 | revs->limited = 1; | |
1414 | revs->prune = 1; | |
33e7018c | 1415 | load_ref_decorations(DECORATE_SHORT_REFS); |
02e54220 PH |
1416 | } else if (!strcmp(arg, "--date-order")) { |
1417 | revs->lifo = 0; | |
1418 | revs->topo_order = 1; | |
1419 | } else if (!prefixcmp(arg, "--early-output")) { | |
1420 | int count = 100; | |
1421 | switch (arg[14]) { | |
1422 | case '=': | |
1423 | count = atoi(arg+15); | |
1424 | /* Fallthrough */ | |
1425 | case 0: | |
1426 | revs->topo_order = 1; | |
1427 | revs->early_output = count; | |
1428 | } | |
1429 | } else if (!strcmp(arg, "--parents")) { | |
1430 | revs->rewrite_parents = 1; | |
1431 | revs->print_parents = 1; | |
1432 | } else if (!strcmp(arg, "--dense")) { | |
1433 | revs->dense = 1; | |
1434 | } else if (!strcmp(arg, "--sparse")) { | |
1435 | revs->dense = 0; | |
1436 | } else if (!strcmp(arg, "--show-all")) { | |
1437 | revs->show_all = 1; | |
1438 | } else if (!strcmp(arg, "--remove-empty")) { | |
1439 | revs->remove_empty_trees = 1; | |
b8e8db28 | 1440 | } else if (!strcmp(arg, "--merges")) { |
ad5aeede | 1441 | revs->min_parents = 2; |
02e54220 | 1442 | } else if (!strcmp(arg, "--no-merges")) { |
ad5aeede MG |
1443 | revs->max_parents = 1; |
1444 | } else if (!prefixcmp(arg, "--min-parents=")) { | |
1445 | revs->min_parents = atoi(arg+14); | |
1446 | } else if (!prefixcmp(arg, "--no-min-parents")) { | |
1447 | revs->min_parents = 0; | |
1448 | } else if (!prefixcmp(arg, "--max-parents=")) { | |
1449 | revs->max_parents = atoi(arg+14); | |
1450 | } else if (!prefixcmp(arg, "--no-max-parents")) { | |
1451 | revs->max_parents = -1; | |
02e54220 PH |
1452 | } else if (!strcmp(arg, "--boundary")) { |
1453 | revs->boundary = 1; | |
1454 | } else if (!strcmp(arg, "--left-right")) { | |
1455 | revs->left_right = 1; | |
60adf7d7 | 1456 | } else if (!strcmp(arg, "--left-only")) { |
24852d91 | 1457 | if (revs->right_only) |
94f605ec MG |
1458 | die("--left-only is incompatible with --right-only" |
1459 | " or --cherry"); | |
60adf7d7 MG |
1460 | revs->left_only = 1; |
1461 | } else if (!strcmp(arg, "--right-only")) { | |
24852d91 JH |
1462 | if (revs->left_only) |
1463 | die("--right-only is incompatible with --left-only"); | |
60adf7d7 | 1464 | revs->right_only = 1; |
94f605ec MG |
1465 | } else if (!strcmp(arg, "--cherry")) { |
1466 | if (revs->left_only) | |
1467 | die("--cherry is incompatible with --left-only"); | |
1468 | revs->cherry_mark = 1; | |
1469 | revs->right_only = 1; | |
ad5aeede | 1470 | revs->max_parents = 1; |
94f605ec | 1471 | revs->limited = 1; |
f69c5018 TR |
1472 | } else if (!strcmp(arg, "--count")) { |
1473 | revs->count = 1; | |
adbbb31e MG |
1474 | } else if (!strcmp(arg, "--cherry-mark")) { |
1475 | if (revs->cherry_pick) | |
1476 | die("--cherry-mark is incompatible with --cherry-pick"); | |
1477 | revs->cherry_mark = 1; | |
1478 | revs->limited = 1; /* needs limit_list() */ | |
02e54220 | 1479 | } else if (!strcmp(arg, "--cherry-pick")) { |
adbbb31e MG |
1480 | if (revs->cherry_mark) |
1481 | die("--cherry-pick is incompatible with --cherry-mark"); | |
02e54220 PH |
1482 | revs->cherry_pick = 1; |
1483 | revs->limited = 1; | |
1484 | } else if (!strcmp(arg, "--objects")) { | |
1485 | revs->tag_objects = 1; | |
1486 | revs->tree_objects = 1; | |
1487 | revs->blob_objects = 1; | |
1488 | } else if (!strcmp(arg, "--objects-edge")) { | |
1489 | revs->tag_objects = 1; | |
1490 | revs->tree_objects = 1; | |
1491 | revs->blob_objects = 1; | |
1492 | revs->edge_hint = 1; | |
5a48d240 JH |
1493 | } else if (!strcmp(arg, "--verify-objects")) { |
1494 | revs->tag_objects = 1; | |
1495 | revs->tree_objects = 1; | |
1496 | revs->blob_objects = 1; | |
1497 | revs->verify_objects = 1; | |
02e54220 PH |
1498 | } else if (!strcmp(arg, "--unpacked")) { |
1499 | revs->unpacked = 1; | |
03a9683d JH |
1500 | } else if (!prefixcmp(arg, "--unpacked=")) { |
1501 | die("--unpacked=<packfile> no longer supported."); | |
02e54220 PH |
1502 | } else if (!strcmp(arg, "-r")) { |
1503 | revs->diff = 1; | |
1504 | DIFF_OPT_SET(&revs->diffopt, RECURSIVE); | |
1505 | } else if (!strcmp(arg, "-t")) { | |
1506 | revs->diff = 1; | |
1507 | DIFF_OPT_SET(&revs->diffopt, RECURSIVE); | |
1508 | DIFF_OPT_SET(&revs->diffopt, TREE_IN_RECURSIVE); | |
1509 | } else if (!strcmp(arg, "-m")) { | |
1510 | revs->ignore_merges = 0; | |
1511 | } else if (!strcmp(arg, "-c")) { | |
1512 | revs->diff = 1; | |
1513 | revs->dense_combined_merges = 0; | |
1514 | revs->combine_merges = 1; | |
1515 | } else if (!strcmp(arg, "--cc")) { | |
1516 | revs->diff = 1; | |
1517 | revs->dense_combined_merges = 1; | |
1518 | revs->combine_merges = 1; | |
1519 | } else if (!strcmp(arg, "-v")) { | |
1520 | revs->verbose_header = 1; | |
1521 | } else if (!strcmp(arg, "--pretty")) { | |
1522 | revs->verbose_header = 1; | |
66b2ed09 | 1523 | revs->pretty_given = 1; |
02e54220 | 1524 | get_commit_format(arg+8, revs); |
3a4c1a5e | 1525 | } else if (!prefixcmp(arg, "--pretty=") || !prefixcmp(arg, "--format=")) { |
7d7b86f7 MM |
1526 | /* |
1527 | * Detached form ("--pretty X" as opposed to "--pretty=X") | |
1528 | * not allowed, since the argument is optional. | |
1529 | */ | |
02e54220 | 1530 | revs->verbose_header = 1; |
66b2ed09 | 1531 | revs->pretty_given = 1; |
02e54220 | 1532 | get_commit_format(arg+9, revs); |
7249e912 | 1533 | } else if (!strcmp(arg, "--show-notes") || !strcmp(arg, "--notes")) { |
66b2ed09 JH |
1534 | revs->show_notes = 1; |
1535 | revs->show_notes_given = 1; | |
3a03cf6b | 1536 | revs->notes_opt.use_default_notes = 1; |
0c37f1fc JH |
1537 | } else if (!strcmp(arg, "--show-signature")) { |
1538 | revs->show_signature = 1; | |
7249e912 JK |
1539 | } else if (!prefixcmp(arg, "--show-notes=") || |
1540 | !prefixcmp(arg, "--notes=")) { | |
894a9d33 TR |
1541 | struct strbuf buf = STRBUF_INIT; |
1542 | revs->show_notes = 1; | |
1543 | revs->show_notes_given = 1; | |
7249e912 JK |
1544 | if (!prefixcmp(arg, "--show-notes")) { |
1545 | if (revs->notes_opt.use_default_notes < 0) | |
1546 | revs->notes_opt.use_default_notes = 1; | |
1547 | strbuf_addstr(&buf, arg+13); | |
1548 | } | |
1549 | else | |
1550 | strbuf_addstr(&buf, arg+8); | |
c063f0a9 | 1551 | expand_notes_ref(&buf); |
304cc11c | 1552 | string_list_append(&revs->notes_opt.extra_notes_refs, |
1d2f80fa | 1553 | strbuf_detach(&buf, NULL)); |
66b2ed09 JH |
1554 | } else if (!strcmp(arg, "--no-notes")) { |
1555 | revs->show_notes = 0; | |
1556 | revs->show_notes_given = 1; | |
92e0d425 JK |
1557 | revs->notes_opt.use_default_notes = -1; |
1558 | /* we have been strdup'ing ourselves, so trick | |
1559 | * string_list into free()ing strings */ | |
1560 | revs->notes_opt.extra_notes_refs.strdup_strings = 1; | |
1561 | string_list_clear(&revs->notes_opt.extra_notes_refs, 0); | |
1562 | revs->notes_opt.extra_notes_refs.strdup_strings = 0; | |
894a9d33 TR |
1563 | } else if (!strcmp(arg, "--standard-notes")) { |
1564 | revs->show_notes_given = 1; | |
3a03cf6b | 1565 | revs->notes_opt.use_default_notes = 1; |
894a9d33 | 1566 | } else if (!strcmp(arg, "--no-standard-notes")) { |
3a03cf6b | 1567 | revs->notes_opt.use_default_notes = 0; |
de84accc NS |
1568 | } else if (!strcmp(arg, "--oneline")) { |
1569 | revs->verbose_header = 1; | |
1570 | get_commit_format("oneline", revs); | |
7dccadf3 | 1571 | revs->pretty_given = 1; |
de84accc | 1572 | revs->abbrev_commit = 1; |
02e54220 PH |
1573 | } else if (!strcmp(arg, "--graph")) { |
1574 | revs->topo_order = 1; | |
1575 | revs->rewrite_parents = 1; | |
1576 | revs->graph = graph_init(revs); | |
1577 | } else if (!strcmp(arg, "--root")) { | |
1578 | revs->show_root_diff = 1; | |
1579 | } else if (!strcmp(arg, "--no-commit-id")) { | |
1580 | revs->no_commit_id = 1; | |
1581 | } else if (!strcmp(arg, "--always")) { | |
1582 | revs->always_show_header = 1; | |
1583 | } else if (!strcmp(arg, "--no-abbrev")) { | |
1584 | revs->abbrev = 0; | |
1585 | } else if (!strcmp(arg, "--abbrev")) { | |
1586 | revs->abbrev = DEFAULT_ABBREV; | |
1587 | } else if (!prefixcmp(arg, "--abbrev=")) { | |
1588 | revs->abbrev = strtoul(arg + 9, NULL, 10); | |
1589 | if (revs->abbrev < MINIMUM_ABBREV) | |
1590 | revs->abbrev = MINIMUM_ABBREV; | |
1591 | else if (revs->abbrev > 40) | |
1592 | revs->abbrev = 40; | |
1593 | } else if (!strcmp(arg, "--abbrev-commit")) { | |
1594 | revs->abbrev_commit = 1; | |
0c47695a JS |
1595 | revs->abbrev_commit_given = 1; |
1596 | } else if (!strcmp(arg, "--no-abbrev-commit")) { | |
1597 | revs->abbrev_commit = 0; | |
02e54220 PH |
1598 | } else if (!strcmp(arg, "--full-diff")) { |
1599 | revs->diff = 1; | |
1600 | revs->full_diff = 1; | |
1601 | } else if (!strcmp(arg, "--full-history")) { | |
1602 | revs->simplify_history = 0; | |
1603 | } else if (!strcmp(arg, "--relative-date")) { | |
1604 | revs->date_mode = DATE_RELATIVE; | |
f4ea32f0 | 1605 | revs->date_mode_explicit = 1; |
7d7b86f7 MM |
1606 | } else if ((argcount = parse_long_opt("date", argv, &optarg))) { |
1607 | revs->date_mode = parse_date_format(optarg); | |
f4ea32f0 | 1608 | revs->date_mode_explicit = 1; |
7d7b86f7 | 1609 | return argcount; |
02e54220 PH |
1610 | } else if (!strcmp(arg, "--log-size")) { |
1611 | revs->show_log_size = 1; | |
1612 | } | |
1613 | /* | |
1614 | * Grepping the commit log | |
1615 | */ | |
7d7b86f7 MM |
1616 | else if ((argcount = parse_long_opt("author", argv, &optarg))) { |
1617 | add_header_grep(revs, GREP_HEADER_AUTHOR, optarg); | |
1618 | return argcount; | |
1619 | } else if ((argcount = parse_long_opt("committer", argv, &optarg))) { | |
1620 | add_header_grep(revs, GREP_HEADER_COMMITTER, optarg); | |
1621 | return argcount; | |
72fd13f7 NTND |
1622 | } else if ((argcount = parse_long_opt("grep-reflog", argv, &optarg))) { |
1623 | add_header_grep(revs, GREP_HEADER_REFLOG, optarg); | |
1624 | return argcount; | |
7d7b86f7 MM |
1625 | } else if ((argcount = parse_long_opt("grep", argv, &optarg))) { |
1626 | add_message_grep(revs, optarg); | |
1627 | return argcount; | |
17bf35a3 JH |
1628 | } else if (!strcmp(arg, "--grep-debug")) { |
1629 | revs->grep_filter.debug = 1; | |
02e54220 | 1630 | } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) { |
34a4ae55 | 1631 | grep_set_pattern_type_option(GREP_PATTERN_TYPE_ERE, &revs->grep_filter); |
02e54220 | 1632 | } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) { |
0843acfd | 1633 | revs->grep_filter.regflags |= REG_ICASE; |
accccde4 | 1634 | DIFF_OPT_SET(&revs->diffopt, PICKAXE_IGNORE_CASE); |
02e54220 | 1635 | } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) { |
34a4ae55 | 1636 | grep_set_pattern_type_option(GREP_PATTERN_TYPE_FIXED, &revs->grep_filter); |
02e54220 | 1637 | } else if (!strcmp(arg, "--all-match")) { |
0843acfd | 1638 | revs->grep_filter.all_match = 1; |
7d7b86f7 MM |
1639 | } else if ((argcount = parse_long_opt("encoding", argv, &optarg))) { |
1640 | if (strcmp(optarg, "none")) | |
1641 | git_log_output_encoding = xstrdup(optarg); | |
02e54220 PH |
1642 | else |
1643 | git_log_output_encoding = ""; | |
7d7b86f7 | 1644 | return argcount; |
02e54220 PH |
1645 | } else if (!strcmp(arg, "--reverse")) { |
1646 | revs->reverse ^= 1; | |
1647 | } else if (!strcmp(arg, "--children")) { | |
1648 | revs->children.name = "children"; | |
1649 | revs->limited = 1; | |
cc243c3c JH |
1650 | } else if (!strcmp(arg, "--ignore-missing")) { |
1651 | revs->ignore_missing = 1; | |
02e54220 PH |
1652 | } else { |
1653 | int opts = diff_opt_parse(&revs->diffopt, argv, argc); | |
1654 | if (!opts) | |
1655 | unkv[(*unkc)++] = arg; | |
1656 | return opts; | |
1657 | } | |
1658 | ||
1659 | return 1; | |
1660 | } | |
1661 | ||
6b61ec05 PH |
1662 | void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx, |
1663 | const struct option *options, | |
1664 | const char * const usagestr[]) | |
1665 | { | |
1666 | int n = handle_revision_opt(revs, ctx->argc, ctx->argv, | |
1667 | &ctx->cpidx, ctx->out); | |
1668 | if (n <= 0) { | |
1669 | error("unknown option `%s'", ctx->argv[0]); | |
1670 | usage_with_options(usagestr, options); | |
1671 | } | |
1672 | ctx->argv += n; | |
1673 | ctx->argc -= n; | |
1674 | } | |
1675 | ||
9ef6aeb0 | 1676 | static int for_each_bad_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data) |
ad3f9a71 | 1677 | { |
9ef6aeb0 | 1678 | return for_each_ref_in_submodule(submodule, "refs/bisect/bad", fn, cb_data); |
ad3f9a71 LT |
1679 | } |
1680 | ||
9ef6aeb0 | 1681 | static int for_each_good_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data) |
ad3f9a71 | 1682 | { |
9ef6aeb0 | 1683 | return for_each_ref_in_submodule(submodule, "refs/bisect/good", fn, cb_data); |
ad3f9a71 LT |
1684 | } |
1685 | ||
f6aca0dc JN |
1686 | static int handle_revision_pseudo_opt(const char *submodule, |
1687 | struct rev_info *revs, | |
1688 | int argc, const char **argv, int *flags) | |
1689 | { | |
1690 | const char *arg = argv[0]; | |
1691 | const char *optarg; | |
1692 | int argcount; | |
1693 | ||
0fc63ec4 JN |
1694 | /* |
1695 | * NOTE! | |
1696 | * | |
1697 | * Commands like "git shortlog" will not accept the options below | |
1698 | * unless parse_revision_opt queues them (as opposed to erroring | |
1699 | * out). | |
1700 | * | |
1701 | * When implementing your new pseudo-option, remember to | |
1702 | * register it in the list at the top of handle_revision_opt. | |
1703 | */ | |
f6aca0dc JN |
1704 | if (!strcmp(arg, "--all")) { |
1705 | handle_refs(submodule, revs, *flags, for_each_ref_submodule); | |
1706 | handle_refs(submodule, revs, *flags, head_ref_submodule); | |
1707 | } else if (!strcmp(arg, "--branches")) { | |
1708 | handle_refs(submodule, revs, *flags, for_each_branch_ref_submodule); | |
1709 | } else if (!strcmp(arg, "--bisect")) { | |
1710 | handle_refs(submodule, revs, *flags, for_each_bad_bisect_ref); | |
1711 | handle_refs(submodule, revs, *flags ^ UNINTERESTING, for_each_good_bisect_ref); | |
1712 | revs->bisect = 1; | |
1713 | } else if (!strcmp(arg, "--tags")) { | |
1714 | handle_refs(submodule, revs, *flags, for_each_tag_ref_submodule); | |
1715 | } else if (!strcmp(arg, "--remotes")) { | |
1716 | handle_refs(submodule, revs, *flags, for_each_remote_ref_submodule); | |
1717 | } else if ((argcount = parse_long_opt("glob", argv, &optarg))) { | |
1718 | struct all_refs_cb cb; | |
1719 | init_all_refs_cb(&cb, revs, *flags); | |
1720 | for_each_glob_ref(handle_one_ref, optarg, &cb); | |
1721 | return argcount; | |
1722 | } else if (!prefixcmp(arg, "--branches=")) { | |
1723 | struct all_refs_cb cb; | |
1724 | init_all_refs_cb(&cb, revs, *flags); | |
1725 | for_each_glob_ref_in(handle_one_ref, arg + 11, "refs/heads/", &cb); | |
1726 | } else if (!prefixcmp(arg, "--tags=")) { | |
1727 | struct all_refs_cb cb; | |
1728 | init_all_refs_cb(&cb, revs, *flags); | |
1729 | for_each_glob_ref_in(handle_one_ref, arg + 7, "refs/tags/", &cb); | |
1730 | } else if (!prefixcmp(arg, "--remotes=")) { | |
1731 | struct all_refs_cb cb; | |
1732 | init_all_refs_cb(&cb, revs, *flags); | |
1733 | for_each_glob_ref_in(handle_one_ref, arg + 10, "refs/remotes/", &cb); | |
1734 | } else if (!strcmp(arg, "--reflog")) { | |
1735 | handle_reflog(revs, *flags); | |
1736 | } else if (!strcmp(arg, "--not")) { | |
1737 | *flags ^= UNINTERESTING; | |
1738 | } else if (!strcmp(arg, "--no-walk")) { | |
ca92e59e MZ |
1739 | revs->no_walk = REVISION_WALK_NO_WALK_SORTED; |
1740 | } else if (!prefixcmp(arg, "--no-walk=")) { | |
1741 | /* | |
1742 | * Detached form ("--no-walk X" as opposed to "--no-walk=X") | |
1743 | * not allowed, since the argument is optional. | |
1744 | */ | |
1745 | if (!strcmp(arg + 10, "sorted")) | |
1746 | revs->no_walk = REVISION_WALK_NO_WALK_SORTED; | |
1747 | else if (!strcmp(arg + 10, "unsorted")) | |
1748 | revs->no_walk = REVISION_WALK_NO_WALK_UNSORTED; | |
1749 | else | |
1750 | return error("invalid argument to --no-walk"); | |
f6aca0dc JN |
1751 | } else if (!strcmp(arg, "--do-walk")) { |
1752 | revs->no_walk = 0; | |
1753 | } else { | |
1754 | return 0; | |
1755 | } | |
1756 | ||
1757 | return 1; | |
1758 | } | |
1759 | ||
ae563542 LT |
1760 | /* |
1761 | * Parse revision information, filling in the "rev_info" structure, | |
1762 | * and removing the used arguments from the argument list. | |
1763 | * | |
765ac8ec LT |
1764 | * Returns the number of arguments left that weren't recognized |
1765 | * (which are also moved to the head of the argument list) | |
ae563542 | 1766 | */ |
32962c9b | 1767 | int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct setup_revision_opt *opt) |
ae563542 | 1768 | { |
8e676e8b | 1769 | int i, flags, left, seen_dashdash, read_from_stdin, got_rev_arg = 0, revarg_opt; |
4da5af31 | 1770 | struct cmdline_pathspec prune_data; |
9ef6aeb0 HV |
1771 | const char *submodule = NULL; |
1772 | ||
4da5af31 | 1773 | memset(&prune_data, 0, sizeof(prune_data)); |
9ef6aeb0 HV |
1774 | if (opt) |
1775 | submodule = opt->submodule; | |
ae563542 | 1776 | |
ae563542 | 1777 | /* First, search for "--" */ |
6d5b93f2 | 1778 | if (opt && opt->assume_dashdash) { |
ae563542 | 1779 | seen_dashdash = 1; |
6d5b93f2 CB |
1780 | } else { |
1781 | seen_dashdash = 0; | |
1782 | for (i = 1; i < argc; i++) { | |
1783 | const char *arg = argv[i]; | |
1784 | if (strcmp(arg, "--")) | |
1785 | continue; | |
1786 | argv[i] = NULL; | |
1787 | argc = i; | |
1788 | if (argv[i + 1]) | |
1789 | append_prune_data(&prune_data, argv + i + 1); | |
1790 | seen_dashdash = 1; | |
1791 | break; | |
1792 | } | |
ae563542 LT |
1793 | } |
1794 | ||
02e54220 PH |
1795 | /* Second, deal with arguments and options */ |
1796 | flags = 0; | |
d5f6b1d7 JH |
1797 | revarg_opt = opt ? opt->revarg_opt : 0; |
1798 | if (seen_dashdash) | |
1799 | revarg_opt |= REVARG_CANNOT_BE_FILENAME; | |
8b3dce56 | 1800 | read_from_stdin = 0; |
02e54220 | 1801 | for (left = i = 1; i < argc; i++) { |
ae563542 | 1802 | const char *arg = argv[i]; |
ae563542 | 1803 | if (*arg == '-') { |
cd2bdc53 | 1804 | int opts; |
02e54220 | 1805 | |
f6aca0dc JN |
1806 | opts = handle_revision_pseudo_opt(submodule, |
1807 | revs, argc - i, argv + i, | |
1808 | &flags); | |
1809 | if (opts > 0) { | |
1810 | i += opts - 1; | |
8e64006e JS |
1811 | continue; |
1812 | } | |
f6aca0dc | 1813 | |
8b3dce56 JH |
1814 | if (!strcmp(arg, "--stdin")) { |
1815 | if (revs->disable_stdin) { | |
1816 | argv[left++] = arg; | |
1817 | continue; | |
1818 | } | |
1819 | if (read_from_stdin++) | |
1820 | die("--stdin given twice?"); | |
60da8b15 | 1821 | read_revisions_from_stdin(revs, &prune_data); |
8b3dce56 JH |
1822 | continue; |
1823 | } | |
2d10c555 | 1824 | |
02e54220 | 1825 | opts = handle_revision_opt(revs, argc - i, argv + i, &left, argv); |
cd2bdc53 | 1826 | if (opts > 0) { |
cd2bdc53 LT |
1827 | i += opts - 1; |
1828 | continue; | |
1829 | } | |
02e54220 PH |
1830 | if (opts < 0) |
1831 | exit(128); | |
ae563542 LT |
1832 | continue; |
1833 | } | |
ae563542 | 1834 | |
8e676e8b JH |
1835 | |
1836 | if (handle_revision_arg(arg, revs, flags, revarg_opt)) { | |
5d6f0935 JH |
1837 | int j; |
1838 | if (seen_dashdash || *arg == '^') | |
ae563542 LT |
1839 | die("bad revision '%s'", arg); |
1840 | ||
ea92f41f JH |
1841 | /* If we didn't have a "--": |
1842 | * (1) all filenames must exist; | |
1843 | * (2) all rev-args must not be interpretable | |
1844 | * as a valid filename. | |
1845 | * but the latter we have checked in the main loop. | |
1846 | */ | |
e23d0b4a | 1847 | for (j = i; j < argc; j++) |
023e37c3 | 1848 | verify_filename(revs->prefix, argv[j], j == i); |
e23d0b4a | 1849 | |
60da8b15 | 1850 | append_prune_data(&prune_data, argv + i); |
ae563542 LT |
1851 | break; |
1852 | } | |
8fcaca3f DO |
1853 | else |
1854 | got_rev_arg = 1; | |
ae563542 | 1855 | } |
5d6f0935 | 1856 | |
4da5af31 | 1857 | if (prune_data.nr) { |
93e7d672 JH |
1858 | /* |
1859 | * If we need to introduce the magic "a lone ':' means no | |
1860 | * pathspec whatsoever", here is the place to do so. | |
1861 | * | |
1862 | * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) { | |
1863 | * prune_data.nr = 0; | |
1864 | * prune_data.alloc = 0; | |
1865 | * free(prune_data.path); | |
1866 | * prune_data.path = NULL; | |
1867 | * } else { | |
1868 | * terminate prune_data.alloc with NULL and | |
1869 | * call init_pathspec() to set revs->prune_data here. | |
1870 | * } | |
1871 | */ | |
4da5af31 JH |
1872 | ALLOC_GROW(prune_data.path, prune_data.nr+1, prune_data.alloc); |
1873 | prune_data.path[prune_data.nr++] = NULL; | |
8f2d4b19 JH |
1874 | init_pathspec(&revs->prune_data, |
1875 | get_pathspec(revs->prefix, prune_data.path)); | |
4da5af31 | 1876 | } |
5486ef0e | 1877 | |
02e54220 | 1878 | if (revs->def == NULL) |
32962c9b | 1879 | revs->def = opt ? opt->def : NULL; |
b4490059 JH |
1880 | if (opt && opt->tweak) |
1881 | opt->tweak(revs, opt); | |
02e54220 | 1882 | if (revs->show_merge) |
ae3e5e1e | 1883 | prepare_show_merge(revs); |
8fcaca3f | 1884 | if (revs->def && !revs->pending.nr && !got_rev_arg) { |
ae563542 | 1885 | unsigned char sha1[20]; |
cd2bdc53 | 1886 | struct object *object; |
249c8f4a | 1887 | struct object_context oc; |
33bd598c | 1888 | if (get_sha1_with_context(revs->def, 0, sha1, &oc)) |
02e54220 PH |
1889 | die("bad default revision '%s'", revs->def); |
1890 | object = get_reference(revs, revs->def, sha1, 0); | |
249c8f4a | 1891 | add_pending_object_with_mode(revs, object, revs->def, oc.mode); |
ae563542 | 1892 | } |
8efdc326 | 1893 | |
b7bb760d LT |
1894 | /* Did the user ask for any diff output? Run the diff! */ |
1895 | if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT) | |
1896 | revs->diff = 1; | |
1897 | ||
0faf2da7 AL |
1898 | /* Pickaxe, diff-filter and rename following need diffs */ |
1899 | if (revs->diffopt.pickaxe || | |
1900 | revs->diffopt.filter || | |
1901 | DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES)) | |
b7bb760d LT |
1902 | revs->diff = 1; |
1903 | ||
9dad9d2e | 1904 | if (revs->topo_order) |
53069686 JH |
1905 | revs->limited = 1; |
1906 | ||
afe069d1 NTND |
1907 | if (revs->prune_data.nr) { |
1908 | diff_tree_setup_paths(revs->prune_data.raw, &revs->pruning); | |
750f7b66 | 1909 | /* Can't prune commits with rename following: the paths change.. */ |
8f67f8ae | 1910 | if (!DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES)) |
53b2c823 | 1911 | revs->prune = 1; |
cd2bdc53 | 1912 | if (!revs->full_diff) |
afe069d1 | 1913 | diff_tree_setup_paths(revs->prune_data.raw, &revs->diffopt); |
8efdc326 | 1914 | } |
b4490059 | 1915 | if (revs->combine_merges) |
cd2bdc53 | 1916 | revs->ignore_merges = 0; |
cd2bdc53 | 1917 | revs->diffopt.abbrev = revs->abbrev; |
28452655 | 1918 | diff_setup_done(&revs->diffopt); |
8efdc326 | 1919 | |
918d4e1c JH |
1920 | grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED, |
1921 | &revs->grep_filter); | |
0843acfd | 1922 | compile_grep_patterns(&revs->grep_filter); |
bd95fcd3 | 1923 | |
d56651c0 SP |
1924 | if (revs->reverse && revs->reflog_info) |
1925 | die("cannot combine --reverse with --walk-reflogs"); | |
8bb65883 | 1926 | if (revs->rewrite_parents && revs->children.name) |
f35f5603 | 1927 | die("cannot combine --parents and --children"); |
d56651c0 | 1928 | |
7fefda5c AS |
1929 | /* |
1930 | * Limitations on the graph functionality | |
1931 | */ | |
1932 | if (revs->reverse && revs->graph) | |
1933 | die("cannot combine --reverse with --graph"); | |
1934 | ||
1935 | if (revs->reflog_info && revs->graph) | |
1936 | die("cannot combine --walk-reflogs with --graph"); | |
baa6378f JH |
1937 | if (!revs->reflog_info && revs->grep_filter.use_reflog_filter) |
1938 | die("cannot use --grep-reflog without --walk-reflogs"); | |
7fefda5c | 1939 | |
ae563542 LT |
1940 | return left; |
1941 | } | |
a4a88b2b | 1942 | |
f35f5603 JH |
1943 | static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child) |
1944 | { | |
1945 | struct commit_list *l = xcalloc(1, sizeof(*l)); | |
1946 | ||
1947 | l->item = child; | |
1948 | l->next = add_decoration(&revs->children, &parent->object, l); | |
1949 | } | |
1950 | ||
6546b593 JH |
1951 | static int remove_duplicate_parents(struct commit *commit) |
1952 | { | |
1953 | struct commit_list **pp, *p; | |
1954 | int surviving_parents; | |
1955 | ||
1956 | /* Examine existing parents while marking ones we have seen... */ | |
1957 | pp = &commit->parents; | |
1958 | while ((p = *pp) != NULL) { | |
1959 | struct commit *parent = p->item; | |
1960 | if (parent->object.flags & TMP_MARK) { | |
1961 | *pp = p->next; | |
1962 | continue; | |
1963 | } | |
1964 | parent->object.flags |= TMP_MARK; | |
1965 | pp = &p->next; | |
1966 | } | |
1967 | /* count them while clearing the temporary mark */ | |
1968 | surviving_parents = 0; | |
1969 | for (p = commit->parents; p; p = p->next) { | |
1970 | p->item->object.flags &= ~TMP_MARK; | |
1971 | surviving_parents++; | |
1972 | } | |
1973 | return surviving_parents; | |
1974 | } | |
1975 | ||
faf0156b JH |
1976 | struct merge_simplify_state { |
1977 | struct commit *simplified; | |
1978 | }; | |
1979 | ||
1980 | static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit) | |
1981 | { | |
1982 | struct merge_simplify_state *st; | |
1983 | ||
1984 | st = lookup_decoration(&revs->merge_simplification, &commit->object); | |
1985 | if (!st) { | |
1986 | st = xcalloc(1, sizeof(*st)); | |
1987 | add_decoration(&revs->merge_simplification, &commit->object, st); | |
1988 | } | |
1989 | return st; | |
1990 | } | |
1991 | ||
1992 | static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail) | |
6546b593 JH |
1993 | { |
1994 | struct commit_list *p; | |
faf0156b | 1995 | struct merge_simplify_state *st, *pst; |
6546b593 JH |
1996 | int cnt; |
1997 | ||
faf0156b JH |
1998 | st = locate_simplify_state(revs, commit); |
1999 | ||
6546b593 | 2000 | /* |
6546b593 JH |
2001 | * Have we handled this one? |
2002 | */ | |
faf0156b | 2003 | if (st->simplified) |
6546b593 JH |
2004 | return tail; |
2005 | ||
2006 | /* | |
2007 | * An UNINTERESTING commit simplifies to itself, so does a | |
2008 | * root commit. We do not rewrite parents of such commit | |
2009 | * anyway. | |
2010 | */ | |
2011 | if ((commit->object.flags & UNINTERESTING) || !commit->parents) { | |
faf0156b | 2012 | st->simplified = commit; |
6546b593 JH |
2013 | return tail; |
2014 | } | |
2015 | ||
2016 | /* | |
6e513ba3 JH |
2017 | * Do we know what commit all of our parents that matter |
2018 | * should be rewritten to? Otherwise we are not ready to | |
2019 | * rewrite this one yet. | |
6546b593 JH |
2020 | */ |
2021 | for (cnt = 0, p = commit->parents; p; p = p->next) { | |
faf0156b JH |
2022 | pst = locate_simplify_state(revs, p->item); |
2023 | if (!pst->simplified) { | |
6546b593 JH |
2024 | tail = &commit_list_insert(p->item, tail)->next; |
2025 | cnt++; | |
2026 | } | |
6e513ba3 JH |
2027 | if (revs->first_parent_only) |
2028 | break; | |
6546b593 | 2029 | } |
53030f8d JH |
2030 | if (cnt) { |
2031 | tail = &commit_list_insert(commit, tail)->next; | |
6546b593 | 2032 | return tail; |
53030f8d | 2033 | } |
6546b593 JH |
2034 | |
2035 | /* | |
2036 | * Rewrite our list of parents. | |
2037 | */ | |
faf0156b JH |
2038 | for (p = commit->parents; p; p = p->next) { |
2039 | pst = locate_simplify_state(revs, p->item); | |
2040 | p->item = pst->simplified; | |
6e513ba3 JH |
2041 | if (revs->first_parent_only) |
2042 | break; | |
faf0156b | 2043 | } |
6e513ba3 JH |
2044 | if (!revs->first_parent_only) |
2045 | cnt = remove_duplicate_parents(commit); | |
2046 | else | |
2047 | cnt = 1; | |
6546b593 JH |
2048 | |
2049 | /* | |
2050 | * It is possible that we are a merge and one side branch | |
2051 | * does not have any commit that touches the given paths; | |
2052 | * in such a case, the immediate parents will be rewritten | |
2053 | * to different commits. | |
2054 | * | |
2055 | * o----X X: the commit we are looking at; | |
2056 | * / / o: a commit that touches the paths; | |
2057 | * ---o----' | |
2058 | * | |
2059 | * Further reduce the parents by removing redundant parents. | |
2060 | */ | |
2061 | if (1 < cnt) { | |
2062 | struct commit_list *h = reduce_heads(commit->parents); | |
2063 | cnt = commit_list_count(h); | |
2064 | free_commit_list(commit->parents); | |
2065 | commit->parents = h; | |
2066 | } | |
2067 | ||
2068 | /* | |
2069 | * A commit simplifies to itself if it is a root, if it is | |
2070 | * UNINTERESTING, if it touches the given paths, or if it is a | |
2071 | * merge and its parents simplifies to more than one commits | |
2072 | * (the first two cases are already handled at the beginning of | |
2073 | * this function). | |
2074 | * | |
2075 | * Otherwise, it simplifies to what its sole parent simplifies to. | |
2076 | */ | |
2077 | if (!cnt || | |
2078 | (commit->object.flags & UNINTERESTING) || | |
2079 | !(commit->object.flags & TREESAME) || | |
2080 | (1 < cnt)) | |
faf0156b JH |
2081 | st->simplified = commit; |
2082 | else { | |
2083 | pst = locate_simplify_state(revs, commit->parents->item); | |
2084 | st->simplified = pst->simplified; | |
2085 | } | |
6546b593 JH |
2086 | return tail; |
2087 | } | |
2088 | ||
2089 | static void simplify_merges(struct rev_info *revs) | |
2090 | { | |
ab9d75a8 | 2091 | struct commit_list *list, *next; |
6546b593 | 2092 | struct commit_list *yet_to_do, **tail; |
ab9d75a8 | 2093 | struct commit *commit; |
6546b593 | 2094 | |
5eac739e JH |
2095 | if (!revs->prune) |
2096 | return; | |
65347030 | 2097 | |
6546b593 JH |
2098 | /* feed the list reversed */ |
2099 | yet_to_do = NULL; | |
ab9d75a8 JH |
2100 | for (list = revs->commits; list; list = next) { |
2101 | commit = list->item; | |
2102 | next = list->next; | |
2103 | /* | |
2104 | * Do not free(list) here yet; the original list | |
2105 | * is used later in this function. | |
2106 | */ | |
2107 | commit_list_insert(commit, &yet_to_do); | |
2108 | } | |
6546b593 JH |
2109 | while (yet_to_do) { |
2110 | list = yet_to_do; | |
2111 | yet_to_do = NULL; | |
2112 | tail = &yet_to_do; | |
2113 | while (list) { | |
ab9d75a8 JH |
2114 | commit = list->item; |
2115 | next = list->next; | |
6546b593 JH |
2116 | free(list); |
2117 | list = next; | |
faf0156b | 2118 | tail = simplify_one(revs, commit, tail); |
6546b593 JH |
2119 | } |
2120 | } | |
2121 | ||
2122 | /* clean up the result, removing the simplified ones */ | |
2123 | list = revs->commits; | |
2124 | revs->commits = NULL; | |
2125 | tail = &revs->commits; | |
2126 | while (list) { | |
faf0156b | 2127 | struct merge_simplify_state *st; |
ab9d75a8 JH |
2128 | |
2129 | commit = list->item; | |
2130 | next = list->next; | |
6546b593 JH |
2131 | free(list); |
2132 | list = next; | |
faf0156b JH |
2133 | st = locate_simplify_state(revs, commit); |
2134 | if (st->simplified == commit) | |
6546b593 JH |
2135 | tail = &commit_list_insert(commit, tail)->next; |
2136 | } | |
6546b593 JH |
2137 | } |
2138 | ||
f35f5603 JH |
2139 | static void set_children(struct rev_info *revs) |
2140 | { | |
2141 | struct commit_list *l; | |
2142 | for (l = revs->commits; l; l = l->next) { | |
2143 | struct commit *commit = l->item; | |
2144 | struct commit_list *p; | |
2145 | ||
2146 | for (p = commit->parents; p; p = p->next) | |
2147 | add_child(revs, p->item, commit); | |
2148 | } | |
2149 | } | |
2150 | ||
bcc0a3ea HV |
2151 | void reset_revision_walk(void) |
2152 | { | |
2153 | clear_object_flags(SEEN | ADDED | SHOWN); | |
2154 | } | |
2155 | ||
cc0e6c5a | 2156 | int prepare_revision_walk(struct rev_info *revs) |
a4a88b2b | 2157 | { |
1f1e895f | 2158 | int nr = revs->pending.nr; |
94d23673 | 2159 | struct object_array_entry *e, *list; |
2e7da8e9 | 2160 | struct commit_list **next = &revs->commits; |
cd2bdc53 | 2161 | |
94d23673 | 2162 | e = list = revs->pending.objects; |
1f1e895f LT |
2163 | revs->pending.nr = 0; |
2164 | revs->pending.alloc = 0; | |
2165 | revs->pending.objects = NULL; | |
2166 | while (--nr >= 0) { | |
94d23673 | 2167 | struct commit *commit = handle_commit(revs, e->item, e->name); |
cd2bdc53 LT |
2168 | if (commit) { |
2169 | if (!(commit->object.flags & SEEN)) { | |
2170 | commit->object.flags |= SEEN; | |
2e7da8e9 | 2171 | next = commit_list_append(commit, next); |
cd2bdc53 LT |
2172 | } |
2173 | } | |
94d23673 | 2174 | e++; |
cd2bdc53 | 2175 | } |
4a43d374 RS |
2176 | if (!revs->leak_pending) |
2177 | free(list); | |
cd2bdc53 | 2178 | |
ca92e59e MZ |
2179 | if (revs->no_walk != REVISION_WALK_NO_WALK_UNSORTED) |
2180 | commit_list_sort_by_date(&revs->commits); | |
ba1d4505 | 2181 | if (revs->no_walk) |
cc0e6c5a | 2182 | return 0; |
a4a88b2b | 2183 | if (revs->limited) |
cc0e6c5a AR |
2184 | if (limit_list(revs) < 0) |
2185 | return -1; | |
a4a88b2b | 2186 | if (revs->topo_order) |
23c17d4a | 2187 | sort_in_topological_order(&revs->commits, revs->lifo); |
6546b593 JH |
2188 | if (revs->simplify_merges) |
2189 | simplify_merges(revs); | |
f35f5603 JH |
2190 | if (revs->children.name) |
2191 | set_children(revs); | |
cc0e6c5a | 2192 | return 0; |
a4a88b2b LT |
2193 | } |
2194 | ||
cc0e6c5a AR |
2195 | enum rewrite_result { |
2196 | rewrite_one_ok, | |
2197 | rewrite_one_noparents, | |
4b05548f | 2198 | rewrite_one_error |
cc0e6c5a AR |
2199 | }; |
2200 | ||
2201 | static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp) | |
765ac8ec | 2202 | { |
fce87ae5 AG |
2203 | struct commit_list *cache = NULL; |
2204 | ||
765ac8ec LT |
2205 | for (;;) { |
2206 | struct commit *p = *pp; | |
3381c790 | 2207 | if (!revs->limited) |
fce87ae5 | 2208 | if (add_parents_to_list(revs, p, &revs->commits, &cache) < 0) |
cc0e6c5a | 2209 | return rewrite_one_error; |
6631c736 | 2210 | if (p->parents && p->parents->next) |
cc0e6c5a | 2211 | return rewrite_one_ok; |
7dc0fe3b LT |
2212 | if (p->object.flags & UNINTERESTING) |
2213 | return rewrite_one_ok; | |
2214 | if (!(p->object.flags & TREESAME)) | |
cc0e6c5a | 2215 | return rewrite_one_ok; |
765ac8ec | 2216 | if (!p->parents) |
cc0e6c5a | 2217 | return rewrite_one_noparents; |
765ac8ec LT |
2218 | *pp = p->parents->item; |
2219 | } | |
2220 | } | |
2221 | ||
cc0e6c5a | 2222 | static int rewrite_parents(struct rev_info *revs, struct commit *commit) |
765ac8ec LT |
2223 | { |
2224 | struct commit_list **pp = &commit->parents; | |
2225 | while (*pp) { | |
2226 | struct commit_list *parent = *pp; | |
cc0e6c5a AR |
2227 | switch (rewrite_one(revs, &parent->item)) { |
2228 | case rewrite_one_ok: | |
2229 | break; | |
2230 | case rewrite_one_noparents: | |
765ac8ec LT |
2231 | *pp = parent->next; |
2232 | continue; | |
cc0e6c5a AR |
2233 | case rewrite_one_error: |
2234 | return -1; | |
765ac8ec LT |
2235 | } |
2236 | pp = &parent->next; | |
2237 | } | |
11d65967 | 2238 | remove_duplicate_parents(commit); |
cc0e6c5a | 2239 | return 0; |
765ac8ec LT |
2240 | } |
2241 | ||
8ecae9b0 JH |
2242 | static int commit_match(struct commit *commit, struct rev_info *opt) |
2243 | { | |
72fd13f7 NTND |
2244 | int retval; |
2245 | struct strbuf buf = STRBUF_INIT; | |
80235ba7 | 2246 | if (!opt->grep_filter.pattern_list && !opt->grep_filter.header_list) |
8ecae9b0 | 2247 | return 1; |
baa6378f JH |
2248 | |
2249 | /* Prepend "fake" headers as needed */ | |
2250 | if (opt->grep_filter.use_reflog_filter) { | |
72fd13f7 NTND |
2251 | strbuf_addstr(&buf, "reflog "); |
2252 | get_reflog_message(&buf, opt->reflog_info); | |
2253 | strbuf_addch(&buf, '\n'); | |
72fd13f7 | 2254 | } |
baa6378f JH |
2255 | |
2256 | /* Copy the commit to temporary if we are using "fake" headers */ | |
2257 | if (buf.len) | |
2258 | strbuf_addstr(&buf, commit->buffer); | |
2259 | ||
38cfe915 NTND |
2260 | /* Append "fake" message parts as needed */ |
2261 | if (opt->show_notes) { | |
2262 | if (!buf.len) | |
2263 | strbuf_addstr(&buf, commit->buffer); | |
2264 | format_display_notes(commit->object.sha1, &buf, | |
2265 | get_log_output_encoding(), 0); | |
2266 | } | |
2267 | ||
baa6378f | 2268 | /* Find either in the commit object, or in the temporary */ |
72fd13f7 NTND |
2269 | if (buf.len) |
2270 | retval = grep_buffer(&opt->grep_filter, buf.buf, buf.len); | |
2271 | else | |
2272 | retval = grep_buffer(&opt->grep_filter, | |
2273 | commit->buffer, strlen(commit->buffer)); | |
2274 | strbuf_release(&buf); | |
2275 | return retval; | |
8ecae9b0 JH |
2276 | } |
2277 | ||
f35f5603 JH |
2278 | static inline int want_ancestry(struct rev_info *revs) |
2279 | { | |
8bb65883 | 2280 | return (revs->rewrite_parents || revs->children.name); |
f35f5603 JH |
2281 | } |
2282 | ||
beb5af43 | 2283 | enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit) |
252a7c02 LT |
2284 | { |
2285 | if (commit->object.flags & SHOWN) | |
2286 | return commit_ignore; | |
4d6acb70 | 2287 | if (revs->unpacked && has_sha1_pack(commit->object.sha1)) |
252a7c02 | 2288 | return commit_ignore; |
3131b713 LT |
2289 | if (revs->show_all) |
2290 | return commit_show; | |
252a7c02 LT |
2291 | if (commit->object.flags & UNINTERESTING) |
2292 | return commit_ignore; | |
2293 | if (revs->min_age != -1 && (commit->date > revs->min_age)) | |
2294 | return commit_ignore; | |
ad5aeede MG |
2295 | if (revs->min_parents || (revs->max_parents >= 0)) { |
2296 | int n = 0; | |
2297 | struct commit_list *p; | |
2298 | for (p = commit->parents; p; p = p->next) | |
2299 | n++; | |
2300 | if ((n < revs->min_parents) || | |
2301 | ((revs->max_parents >= 0) && (n > revs->max_parents))) | |
2302 | return commit_ignore; | |
2303 | } | |
252a7c02 LT |
2304 | if (!commit_match(commit, revs)) |
2305 | return commit_ignore; | |
53b2c823 | 2306 | if (revs->prune && revs->dense) { |
252a7c02 | 2307 | /* Commit without changes? */ |
7dc0fe3b | 2308 | if (commit->object.flags & TREESAME) { |
252a7c02 | 2309 | /* drop merges unless we want parenthood */ |
f35f5603 | 2310 | if (!want_ancestry(revs)) |
252a7c02 LT |
2311 | return commit_ignore; |
2312 | /* non-merge - always ignore it */ | |
2313 | if (!commit->parents || !commit->parents->next) | |
2314 | return commit_ignore; | |
2315 | } | |
252a7c02 LT |
2316 | } |
2317 | return commit_show; | |
2318 | } | |
2319 | ||
beb5af43 AS |
2320 | enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit) |
2321 | { | |
2322 | enum commit_action action = get_commit_action(revs, commit); | |
2323 | ||
2324 | if (action == commit_show && | |
2325 | !revs->show_all && | |
2326 | revs->prune && revs->dense && want_ancestry(revs)) { | |
2327 | if (rewrite_parents(revs, commit) < 0) | |
2328 | return commit_error; | |
2329 | } | |
2330 | return action; | |
2331 | } | |
2332 | ||
d5db6c9e | 2333 | static struct commit *get_revision_1(struct rev_info *revs) |
a4a88b2b | 2334 | { |
d5db6c9e | 2335 | if (!revs->commits) |
a4a88b2b | 2336 | return NULL; |
a4a88b2b | 2337 | |
765ac8ec | 2338 | do { |
cb115748 LT |
2339 | struct commit_list *entry = revs->commits; |
2340 | struct commit *commit = entry->item; | |
ea5ed3ab | 2341 | |
cb115748 LT |
2342 | revs->commits = entry->next; |
2343 | free(entry); | |
2a0925be | 2344 | |
ffa1eeae | 2345 | if (revs->reflog_info) { |
8860fd42 | 2346 | fake_reflog_parent(revs->reflog_info, commit); |
ffa1eeae JK |
2347 | commit->object.flags &= ~(ADDED | SEEN | SHOWN); |
2348 | } | |
8860fd42 | 2349 | |
2a0925be LT |
2350 | /* |
2351 | * If we haven't done the list limiting, we need to look at | |
be7db6e5 LT |
2352 | * the parents here. We also need to do the date-based limiting |
2353 | * that we'd otherwise have done in limit_list(). | |
2a0925be | 2354 | */ |
be7db6e5 | 2355 | if (!revs->limited) { |
744f4985 | 2356 | if (revs->max_age != -1 && |
86ab4906 JH |
2357 | (commit->date < revs->max_age)) |
2358 | continue; | |
fce87ae5 | 2359 | if (add_parents_to_list(revs, commit, &revs->commits, NULL) < 0) |
ed62089c JH |
2360 | die("Failed to traverse parents of commit %s", |
2361 | sha1_to_hex(commit->object.sha1)); | |
be7db6e5 | 2362 | } |
744f4985 | 2363 | |
252a7c02 LT |
2364 | switch (simplify_commit(revs, commit)) { |
2365 | case commit_ignore: | |
8ecae9b0 | 2366 | continue; |
252a7c02 | 2367 | case commit_error: |
ed62089c JH |
2368 | die("Failed to simplify parents of commit %s", |
2369 | sha1_to_hex(commit->object.sha1)); | |
252a7c02 LT |
2370 | default: |
2371 | return commit; | |
384e99a4 | 2372 | } |
765ac8ec LT |
2373 | } while (revs->commits); |
2374 | return NULL; | |
2375 | } | |
d5db6c9e | 2376 | |
86ab4906 JH |
2377 | static void gc_boundary(struct object_array *array) |
2378 | { | |
2379 | unsigned nr = array->nr; | |
2380 | unsigned alloc = array->alloc; | |
2381 | struct object_array_entry *objects = array->objects; | |
2382 | ||
2383 | if (alloc <= nr) { | |
2384 | unsigned i, j; | |
2385 | for (i = j = 0; i < nr; i++) { | |
2386 | if (objects[i].item->flags & SHOWN) | |
2387 | continue; | |
2388 | if (i != j) | |
2389 | objects[j] = objects[i]; | |
2390 | j++; | |
2391 | } | |
892ae6bf | 2392 | for (i = j; i < nr; i++) |
86ab4906 JH |
2393 | objects[i].item = NULL; |
2394 | array->nr = j; | |
2395 | } | |
2396 | } | |
2397 | ||
4603ec0f AS |
2398 | static void create_boundary_commit_list(struct rev_info *revs) |
2399 | { | |
2400 | unsigned i; | |
2401 | struct commit *c; | |
2402 | struct object_array *array = &revs->boundary_commits; | |
2403 | struct object_array_entry *objects = array->objects; | |
2404 | ||
2405 | /* | |
2406 | * If revs->commits is non-NULL at this point, an error occurred in | |
2407 | * get_revision_1(). Ignore the error and continue printing the | |
2408 | * boundary commits anyway. (This is what the code has always | |
2409 | * done.) | |
2410 | */ | |
2411 | if (revs->commits) { | |
2412 | free_commit_list(revs->commits); | |
2413 | revs->commits = NULL; | |
2414 | } | |
2415 | ||
2416 | /* | |
2417 | * Put all of the actual boundary commits from revs->boundary_commits | |
2418 | * into revs->commits | |
2419 | */ | |
2420 | for (i = 0; i < array->nr; i++) { | |
2421 | c = (struct commit *)(objects[i].item); | |
2422 | if (!c) | |
2423 | continue; | |
2424 | if (!(c->object.flags & CHILD_SHOWN)) | |
2425 | continue; | |
2426 | if (c->object.flags & (SHOWN | BOUNDARY)) | |
2427 | continue; | |
2428 | c->object.flags |= BOUNDARY; | |
2429 | commit_list_insert(c, &revs->commits); | |
2430 | } | |
2431 | ||
2432 | /* | |
2433 | * If revs->topo_order is set, sort the boundary commits | |
2434 | * in topological order | |
2435 | */ | |
2436 | sort_in_topological_order(&revs->commits, revs->lifo); | |
2437 | } | |
2438 | ||
7fefda5c | 2439 | static struct commit *get_revision_internal(struct rev_info *revs) |
d5db6c9e JH |
2440 | { |
2441 | struct commit *c = NULL; | |
86ab4906 JH |
2442 | struct commit_list *l; |
2443 | ||
2444 | if (revs->boundary == 2) { | |
4603ec0f AS |
2445 | /* |
2446 | * All of the normal commits have already been returned, | |
2447 | * and we are now returning boundary commits. | |
2448 | * create_boundary_commit_list() has populated | |
2449 | * revs->commits with the remaining commits to return. | |
2450 | */ | |
2451 | c = pop_commit(&revs->commits); | |
2452 | if (c) | |
2453 | c->object.flags |= SHOWN; | |
9c5e66e9 JS |
2454 | return c; |
2455 | } | |
2456 | ||
86ab4906 | 2457 | /* |
b72a1904 JK |
2458 | * If our max_count counter has reached zero, then we are done. We |
2459 | * don't simply return NULL because we still might need to show | |
2460 | * boundary commits. But we want to avoid calling get_revision_1, which | |
2461 | * might do a considerable amount of work finding the next commit only | |
2462 | * for us to throw it away. | |
2463 | * | |
2464 | * If it is non-zero, then either we don't have a max_count at all | |
2465 | * (-1), or it is still counting, in which case we decrement. | |
86ab4906 | 2466 | */ |
b72a1904 JK |
2467 | if (revs->max_count) { |
2468 | c = get_revision_1(revs); | |
2469 | if (c) { | |
2470 | while (0 < revs->skip_count) { | |
2471 | revs->skip_count--; | |
2472 | c = get_revision_1(revs); | |
2473 | if (!c) | |
2474 | break; | |
2475 | } | |
8839ac94 | 2476 | } |
86ab4906 | 2477 | |
b72a1904 JK |
2478 | if (revs->max_count > 0) |
2479 | revs->max_count--; | |
d5db6c9e | 2480 | } |
86ab4906 | 2481 | |
c33d8593 JH |
2482 | if (c) |
2483 | c->object.flags |= SHOWN; | |
2484 | ||
2485 | if (!revs->boundary) { | |
d5db6c9e | 2486 | return c; |
c33d8593 | 2487 | } |
86ab4906 JH |
2488 | |
2489 | if (!c) { | |
2490 | /* | |
2491 | * get_revision_1() runs out the commits, and | |
2492 | * we are done computing the boundaries. | |
2493 | * switch to boundary commits output mode. | |
2494 | */ | |
2495 | revs->boundary = 2; | |
4603ec0f AS |
2496 | |
2497 | /* | |
2498 | * Update revs->commits to contain the list of | |
2499 | * boundary commits. | |
2500 | */ | |
2501 | create_boundary_commit_list(revs); | |
2502 | ||
3c68d67b | 2503 | return get_revision_internal(revs); |
86ab4906 JH |
2504 | } |
2505 | ||
2506 | /* | |
2507 | * boundary commits are the commits that are parents of the | |
2508 | * ones we got from get_revision_1() but they themselves are | |
2509 | * not returned from get_revision_1(). Before returning | |
2510 | * 'c', we need to mark its parents that they could be boundaries. | |
2511 | */ | |
2512 | ||
2513 | for (l = c->parents; l; l = l->next) { | |
2514 | struct object *p; | |
2515 | p = &(l->item->object); | |
c33d8593 | 2516 | if (p->flags & (CHILD_SHOWN | SHOWN)) |
86ab4906 JH |
2517 | continue; |
2518 | p->flags |= CHILD_SHOWN; | |
2519 | gc_boundary(&revs->boundary_commits); | |
2520 | add_object_array(p, NULL, &revs->boundary_commits); | |
2521 | } | |
2522 | ||
2523 | return c; | |
d5db6c9e | 2524 | } |
7fefda5c AS |
2525 | |
2526 | struct commit *get_revision(struct rev_info *revs) | |
2527 | { | |
498bcd31 TR |
2528 | struct commit *c; |
2529 | struct commit_list *reversed; | |
2530 | ||
2531 | if (revs->reverse) { | |
2532 | reversed = NULL; | |
2533 | while ((c = get_revision_internal(revs))) { | |
2534 | commit_list_insert(c, &reversed); | |
2535 | } | |
2536 | revs->commits = reversed; | |
2537 | revs->reverse = 0; | |
2538 | revs->reverse_output_stage = 1; | |
2539 | } | |
2540 | ||
2541 | if (revs->reverse_output_stage) | |
2542 | return pop_commit(&revs->commits); | |
2543 | ||
2544 | c = get_revision_internal(revs); | |
7fefda5c AS |
2545 | if (c && revs->graph) |
2546 | graph_update(revs->graph, c); | |
2547 | return c; | |
2548 | } | |
1df2d656 MG |
2549 | |
2550 | char *get_revision_mark(const struct rev_info *revs, const struct commit *commit) | |
2551 | { | |
2552 | if (commit->object.flags & BOUNDARY) | |
2553 | return "-"; | |
2554 | else if (commit->object.flags & UNINTERESTING) | |
2555 | return "^"; | |
adbbb31e MG |
2556 | else if (commit->object.flags & PATCHSAME) |
2557 | return "="; | |
1df2d656 MG |
2558 | else if (!revs || revs->left_right) { |
2559 | if (commit->object.flags & SYMMETRIC_LEFT) | |
2560 | return "<"; | |
2561 | else | |
2562 | return ">"; | |
2563 | } else if (revs->graph) | |
2564 | return "*"; | |
adbbb31e MG |
2565 | else if (revs->cherry_mark) |
2566 | return "+"; | |
1df2d656 MG |
2567 | return ""; |
2568 | } | |
b1b47554 MG |
2569 | |
2570 | void put_revision_mark(const struct rev_info *revs, const struct commit *commit) | |
2571 | { | |
2572 | char *mark = get_revision_mark(revs, commit); | |
2573 | if (!strlen(mark)) | |
2574 | return; | |
2575 | fputs(mark, stdout); | |
2576 | putchar(' '); | |
2577 | } |