]>
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" |
12da1d1f | 16 | #include "line-log.h" |
d72fbe81 | 17 | #include "mailmap.h" |
53d00b39 | 18 | #include "commit-slab.h" |
429bb40a | 19 | #include "dir.h" |
4fe10219 | 20 | #include "cache-tree.h" |
ae563542 | 21 | |
cdcefbc9 LT |
22 | volatile show_early_output_fn_t show_early_output; |
23 | ||
cf2ab916 | 24 | char *path_name(const struct name_path *path, const char *name) |
ae563542 | 25 | { |
cf2ab916 | 26 | const struct name_path *p; |
ae563542 LT |
27 | char *n, *m; |
28 | int nlen = strlen(name); | |
29 | int len = nlen + 1; | |
30 | ||
31 | for (p = path; p; p = p->up) { | |
32 | if (p->elem_len) | |
33 | len += p->elem_len + 1; | |
34 | } | |
35 | n = xmalloc(len); | |
36 | m = n + len - (nlen + 1); | |
37 | strcpy(m, name); | |
38 | for (p = path; p; p = p->up) { | |
39 | if (p->elem_len) { | |
40 | m -= p->elem_len + 1; | |
41 | memcpy(m, p->elem, p->elem_len); | |
42 | m[p->elem_len] = '/'; | |
43 | } | |
44 | } | |
45 | return n; | |
46 | } | |
47 | ||
beba25ab JH |
48 | static int show_path_component_truncated(FILE *out, const char *name, int len) |
49 | { | |
50 | int cnt; | |
51 | for (cnt = 0; cnt < len; cnt++) { | |
52 | int ch = name[cnt]; | |
53 | if (!ch || ch == '\n') | |
54 | return -1; | |
55 | fputc(ch, out); | |
56 | } | |
57 | return len; | |
58 | } | |
59 | ||
60 | static int show_path_truncated(FILE *out, const struct name_path *path) | |
61 | { | |
62 | int emitted, ours; | |
63 | ||
64 | if (!path) | |
65 | return 0; | |
66 | emitted = show_path_truncated(out, path->up); | |
67 | if (emitted < 0) | |
68 | return emitted; | |
69 | if (emitted) | |
70 | fputc('/', out); | |
71 | ours = show_path_component_truncated(out, path->elem, path->elem_len); | |
72 | if (ours < 0) | |
73 | return ours; | |
74 | return ours || emitted; | |
75 | } | |
76 | ||
ff5f5f26 MH |
77 | void show_object_with_name(FILE *out, struct object *obj, |
78 | const struct name_path *path, const char *component) | |
91f17516 | 79 | { |
beba25ab JH |
80 | struct name_path leaf; |
81 | leaf.up = (struct name_path *)path; | |
82 | leaf.elem = component; | |
83 | leaf.elem_len = strlen(component); | |
91f17516 | 84 | |
beba25ab JH |
85 | fprintf(out, "%s ", sha1_to_hex(obj->sha1)); |
86 | show_path_truncated(out, &leaf); | |
87 | fputc('\n', out); | |
91f17516 JH |
88 | } |
89 | ||
ae563542 LT |
90 | static void mark_blob_uninteresting(struct blob *blob) |
91 | { | |
c1ee9013 MK |
92 | if (!blob) |
93 | return; | |
ae563542 LT |
94 | if (blob->object.flags & UNINTERESTING) |
95 | return; | |
96 | blob->object.flags |= UNINTERESTING; | |
97 | } | |
98 | ||
2ac5e447 | 99 | static void mark_tree_contents_uninteresting(struct tree *tree) |
ae563542 | 100 | { |
f75e53ed | 101 | struct tree_desc desc; |
4c068a98 | 102 | struct name_entry entry; |
ae563542 | 103 | struct object *obj = &tree->object; |
ae563542 | 104 | |
ae563542 LT |
105 | if (!has_sha1_file(obj->sha1)) |
106 | return; | |
107 | if (parse_tree(tree) < 0) | |
108 | die("bad tree %s", sha1_to_hex(obj->sha1)); | |
f75e53ed | 109 | |
6fda5e51 | 110 | init_tree_desc(&desc, tree->buffer, tree->size); |
4c068a98 | 111 | while (tree_entry(&desc, &entry)) { |
4d1012c3 LT |
112 | switch (object_type(entry.mode)) { |
113 | case OBJ_TREE: | |
4c068a98 | 114 | mark_tree_uninteresting(lookup_tree(entry.sha1)); |
4d1012c3 LT |
115 | break; |
116 | case OBJ_BLOB: | |
4c068a98 | 117 | mark_blob_uninteresting(lookup_blob(entry.sha1)); |
4d1012c3 LT |
118 | break; |
119 | default: | |
120 | /* Subproject commit - not in this repository */ | |
121 | break; | |
122 | } | |
ae563542 | 123 | } |
f75e53ed LT |
124 | |
125 | /* | |
126 | * We don't care about the tree any more | |
127 | * after it has been marked uninteresting. | |
128 | */ | |
6e454b9a | 129 | free_tree_buffer(tree); |
ae563542 LT |
130 | } |
131 | ||
2ac5e447 JH |
132 | void mark_tree_uninteresting(struct tree *tree) |
133 | { | |
134 | struct object *obj = &tree->object; | |
135 | ||
136 | if (!tree) | |
137 | return; | |
138 | if (obj->flags & UNINTERESTING) | |
139 | return; | |
140 | obj->flags |= UNINTERESTING; | |
141 | mark_tree_contents_uninteresting(tree); | |
ae563542 LT |
142 | } |
143 | ||
144 | void mark_parents_uninteresting(struct commit *commit) | |
145 | { | |
941ba8db NTND |
146 | struct commit_list *parents = NULL, *l; |
147 | ||
148 | for (l = commit->parents; l; l = l->next) | |
149 | commit_list_insert(l->item, &parents); | |
ae563542 LT |
150 | |
151 | while (parents) { | |
152 | struct commit *commit = parents->item; | |
941ba8db NTND |
153 | l = parents; |
154 | parents = parents->next; | |
155 | free(l); | |
156 | ||
157 | while (commit) { | |
158 | /* | |
159 | * A missing commit is ok iff its parent is marked | |
160 | * uninteresting. | |
161 | * | |
162 | * We just mark such a thing parsed, so that when | |
163 | * it is popped next time around, we won't be trying | |
164 | * to parse it and get an error. | |
165 | */ | |
166 | if (!has_sha1_file(commit->object.sha1)) | |
167 | commit->object.parsed = 1; | |
168 | ||
169 | if (commit->object.flags & UNINTERESTING) | |
170 | break; | |
171 | ||
d2c4af73 | 172 | commit->object.flags |= UNINTERESTING; |
ae563542 | 173 | |
d2c4af73 MU |
174 | /* |
175 | * Normally we haven't parsed the parent | |
176 | * yet, so we won't have a parent of a parent | |
177 | * here. However, it may turn out that we've | |
178 | * reached this commit some other way (where it | |
179 | * wasn't uninteresting), in which case we need | |
180 | * to mark its parents recursively too.. | |
181 | */ | |
941ba8db NTND |
182 | if (!commit->parents) |
183 | break; | |
ae563542 | 184 | |
941ba8db NTND |
185 | for (l = commit->parents->next; l; l = l->next) |
186 | commit_list_insert(l->item, &parents); | |
187 | commit = commit->parents->item; | |
188 | } | |
ae563542 LT |
189 | } |
190 | } | |
191 | ||
20739490 | 192 | static void add_pending_object_with_path(struct rev_info *revs, |
ff5f5f26 | 193 | struct object *obj, |
20739490 JK |
194 | const char *name, unsigned mode, |
195 | const char *path) | |
ae563542 | 196 | { |
cc243c3c JH |
197 | if (!obj) |
198 | return; | |
aa27e461 | 199 | if (revs->no_walk && (obj->flags & UNINTERESTING)) |
f222abde | 200 | revs->no_walk = 0; |
105e4733 JH |
201 | if (revs->reflog_info && obj->type == OBJ_COMMIT) { |
202 | struct strbuf buf = STRBUF_INIT; | |
cf99a761 | 203 | int len = interpret_branch_name(name, 0, &buf); |
105e4733 JH |
204 | int st; |
205 | ||
206 | if (0 < len && name[len] && buf.len) | |
207 | strbuf_addstr(&buf, name + len); | |
208 | st = add_reflog_for_walk(revs->reflog_info, | |
209 | (struct commit *)obj, | |
210 | buf.buf[0] ? buf.buf: name); | |
211 | strbuf_release(&buf); | |
212 | if (st) | |
213 | return; | |
214 | } | |
20739490 JK |
215 | add_object_array_with_path(obj, name, &revs->pending, mode, path); |
216 | } | |
217 | ||
218 | static void add_pending_object_with_mode(struct rev_info *revs, | |
219 | struct object *obj, | |
220 | const char *name, unsigned mode) | |
221 | { | |
222 | add_pending_object_with_path(revs, obj, name, mode, NULL); | |
ae563542 LT |
223 | } |
224 | ||
ff5f5f26 MH |
225 | void add_pending_object(struct rev_info *revs, |
226 | struct object *obj, const char *name) | |
2d93b9fa JH |
227 | { |
228 | add_pending_object_with_mode(revs, obj, name, S_IFINVALID); | |
229 | } | |
230 | ||
3384a2df JH |
231 | void add_head_to_pending(struct rev_info *revs) |
232 | { | |
233 | unsigned char sha1[20]; | |
234 | struct object *obj; | |
235 | if (get_sha1("HEAD", sha1)) | |
236 | return; | |
237 | obj = parse_object(sha1); | |
238 | if (!obj) | |
239 | return; | |
240 | add_pending_object(revs, obj, "HEAD"); | |
241 | } | |
242 | ||
ff5f5f26 MH |
243 | static struct object *get_reference(struct rev_info *revs, const char *name, |
244 | const unsigned char *sha1, | |
245 | unsigned int flags) | |
ae563542 LT |
246 | { |
247 | struct object *object; | |
248 | ||
249 | object = parse_object(sha1); | |
cc243c3c JH |
250 | if (!object) { |
251 | if (revs->ignore_missing) | |
252 | return object; | |
ae563542 | 253 | die("bad object %s", name); |
cc243c3c | 254 | } |
cd2bdc53 LT |
255 | object->flags |= flags; |
256 | return object; | |
257 | } | |
258 | ||
26c3177e RS |
259 | void add_pending_sha1(struct rev_info *revs, const char *name, |
260 | const unsigned char *sha1, unsigned int flags) | |
261 | { | |
262 | struct object *object = get_reference(revs, name, sha1, flags); | |
263 | add_pending_object(revs, object, name); | |
264 | } | |
265 | ||
ff5f5f26 | 266 | static struct commit *handle_commit(struct rev_info *revs, |
20739490 | 267 | struct object_array_entry *entry) |
cd2bdc53 | 268 | { |
20739490 JK |
269 | struct object *object = entry->item; |
270 | const char *name = entry->name; | |
271 | const char *path = entry->path; | |
272 | unsigned int mode = entry->mode; | |
cd2bdc53 | 273 | unsigned long flags = object->flags; |
ae563542 LT |
274 | |
275 | /* | |
276 | * Tag object? Look what it points to.. | |
277 | */ | |
1974632c | 278 | while (object->type == OBJ_TAG) { |
ae563542 | 279 | struct tag *tag = (struct tag *) object; |
cd2bdc53 | 280 | if (revs->tag_objects && !(flags & UNINTERESTING)) |
ae563542 | 281 | add_pending_object(revs, object, tag->tag); |
9684afd9 MK |
282 | if (!tag->tagged) |
283 | die("bad tag"); | |
ae563542 | 284 | object = parse_object(tag->tagged->sha1); |
aeeae1b7 JH |
285 | if (!object) { |
286 | if (flags & UNINTERESTING) | |
287 | return NULL; | |
ae563542 | 288 | die("bad object %s", sha1_to_hex(tag->tagged->sha1)); |
aeeae1b7 | 289 | } |
a7435286 | 290 | object->flags |= flags; |
20739490 JK |
291 | /* |
292 | * We'll handle the tagged object by looping or dropping | |
293 | * through to the non-tag handlers below. Do not | |
294 | * propagate data from the tag's pending entry. | |
295 | */ | |
296 | name = ""; | |
297 | path = NULL; | |
298 | mode = 0; | |
ae563542 LT |
299 | } |
300 | ||
301 | /* | |
302 | * Commit object? Just return it, we'll do all the complex | |
303 | * reachability crud. | |
304 | */ | |
1974632c | 305 | if (object->type == OBJ_COMMIT) { |
ae563542 | 306 | struct commit *commit = (struct commit *)object; |
ae563542 LT |
307 | if (parse_commit(commit) < 0) |
308 | die("unable to parse commit %s", name); | |
d9a83684 | 309 | if (flags & UNINTERESTING) { |
ae563542 | 310 | mark_parents_uninteresting(commit); |
d9a83684 LT |
311 | revs->limited = 1; |
312 | } | |
0f3a290b | 313 | if (revs->show_source && !commit->util) |
1da1e07c | 314 | commit->util = xstrdup(name); |
ae563542 LT |
315 | return commit; |
316 | } | |
317 | ||
318 | /* | |
3ea3c215 | 319 | * Tree object? Either mark it uninteresting, or add it |
ae563542 LT |
320 | * to the list of objects to look at later.. |
321 | */ | |
1974632c | 322 | if (object->type == OBJ_TREE) { |
ae563542 LT |
323 | struct tree *tree = (struct tree *)object; |
324 | if (!revs->tree_objects) | |
325 | return NULL; | |
326 | if (flags & UNINTERESTING) { | |
2ac5e447 | 327 | mark_tree_contents_uninteresting(tree); |
ae563542 LT |
328 | return NULL; |
329 | } | |
20739490 | 330 | add_pending_object_with_path(revs, object, name, mode, path); |
ae563542 LT |
331 | return NULL; |
332 | } | |
333 | ||
334 | /* | |
335 | * Blob object? You know the drill by now.. | |
336 | */ | |
1974632c | 337 | if (object->type == OBJ_BLOB) { |
ae563542 LT |
338 | if (!revs->blob_objects) |
339 | return NULL; | |
a7435286 | 340 | if (flags & UNINTERESTING) |
ae563542 | 341 | return NULL; |
20739490 | 342 | add_pending_object_with_path(revs, object, name, mode, path); |
ae563542 LT |
343 | return NULL; |
344 | } | |
345 | die("%s is unknown object", name); | |
346 | } | |
347 | ||
b6e8a3b5 JK |
348 | static int everybody_uninteresting(struct commit_list *orig, |
349 | struct commit **interesting_cache) | |
a4a88b2b LT |
350 | { |
351 | struct commit_list *list = orig; | |
b6e8a3b5 JK |
352 | |
353 | if (*interesting_cache) { | |
354 | struct commit *commit = *interesting_cache; | |
355 | if (!(commit->object.flags & UNINTERESTING)) | |
356 | return 0; | |
357 | } | |
358 | ||
a4a88b2b LT |
359 | while (list) { |
360 | struct commit *commit = list->item; | |
361 | list = list->next; | |
362 | if (commit->object.flags & UNINTERESTING) | |
363 | continue; | |
b6e8a3b5 JK |
364 | if (interesting_cache) |
365 | *interesting_cache = commit; | |
a4a88b2b LT |
366 | return 0; |
367 | } | |
368 | return 1; | |
369 | } | |
370 | ||
4d826608 KB |
371 | /* |
372 | * A definition of "relevant" commit that we can use to simplify limited graphs | |
373 | * by eliminating side branches. | |
374 | * | |
375 | * A "relevant" commit is one that is !UNINTERESTING (ie we are including it | |
376 | * in our list), or that is a specified BOTTOM commit. Then after computing | |
377 | * a limited list, during processing we can generally ignore boundary merges | |
378 | * coming from outside the graph, (ie from irrelevant parents), and treat | |
379 | * those merges as if they were single-parent. TREESAME is defined to consider | |
380 | * only relevant parents, if any. If we are TREESAME to our on-graph parents, | |
381 | * we don't care if we were !TREESAME to non-graph parents. | |
382 | * | |
383 | * Treating bottom commits as relevant ensures that a limited graph's | |
384 | * connection to the actual bottom commit is not viewed as a side branch, but | |
385 | * treated as part of the graph. For example: | |
386 | * | |
387 | * ....Z...A---X---o---o---B | |
388 | * . / | |
389 | * W---Y | |
390 | * | |
391 | * When computing "A..B", the A-X connection is at least as important as | |
392 | * Y-X, despite A being flagged UNINTERESTING. | |
393 | * | |
394 | * And when computing --ancestry-path "A..B", the A-X connection is more | |
395 | * important than Y-X, despite both A and Y being flagged UNINTERESTING. | |
396 | */ | |
397 | static inline int relevant_commit(struct commit *commit) | |
398 | { | |
399 | return (commit->object.flags & (UNINTERESTING | BOTTOM)) != UNINTERESTING; | |
400 | } | |
401 | ||
402 | /* | |
403 | * Return a single relevant commit from a parent list. If we are a TREESAME | |
404 | * commit, and this selects one of our parents, then we can safely simplify to | |
405 | * that parent. | |
406 | */ | |
407 | static struct commit *one_relevant_parent(const struct rev_info *revs, | |
408 | struct commit_list *orig) | |
409 | { | |
410 | struct commit_list *list = orig; | |
411 | struct commit *relevant = NULL; | |
412 | ||
413 | if (!orig) | |
414 | return NULL; | |
415 | ||
416 | /* | |
417 | * For 1-parent commits, or if first-parent-only, then return that | |
418 | * first parent (even if not "relevant" by the above definition). | |
419 | * TREESAME will have been set purely on that parent. | |
420 | */ | |
421 | if (revs->first_parent_only || !orig->next) | |
422 | return orig->item; | |
423 | ||
424 | /* | |
425 | * For multi-parent commits, identify a sole relevant parent, if any. | |
426 | * If we have only one relevant parent, then TREESAME will be set purely | |
427 | * with regard to that parent, and we can simplify accordingly. | |
428 | * | |
429 | * If we have more than one relevant parent, or no relevant parents | |
430 | * (and multiple irrelevant ones), then we can't select a parent here | |
431 | * and return NULL. | |
432 | */ | |
433 | while (list) { | |
434 | struct commit *commit = list->item; | |
435 | list = list->next; | |
436 | if (relevant_commit(commit)) { | |
437 | if (relevant) | |
438 | return NULL; | |
439 | relevant = commit; | |
440 | } | |
441 | } | |
442 | return relevant; | |
443 | } | |
444 | ||
0a4ba7f8 JH |
445 | /* |
446 | * The goal is to get REV_TREE_NEW as the result only if the | |
ceff8e7a LT |
447 | * diff consists of all '+' (and no other changes), REV_TREE_OLD |
448 | * if the whole diff is removal of old data, and otherwise | |
449 | * REV_TREE_DIFFERENT (of course if the trees are the same we | |
450 | * want REV_TREE_SAME). | |
451 | * That means that once we get to REV_TREE_DIFFERENT, we do not | |
452 | * have to look any further. | |
0a4ba7f8 | 453 | */ |
8efdc326 | 454 | static int tree_difference = REV_TREE_SAME; |
a4a88b2b LT |
455 | |
456 | static void file_add_remove(struct diff_options *options, | |
457 | int addremove, unsigned mode, | |
458 | const unsigned char *sha1, | |
e5450100 | 459 | int sha1_valid, |
e3d42c47 | 460 | const char *fullpath, unsigned dirty_submodule) |
a4a88b2b | 461 | { |
ceff8e7a | 462 | int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD; |
a4a88b2b | 463 | |
ceff8e7a | 464 | tree_difference |= diff; |
dd47aa31 | 465 | if (tree_difference == REV_TREE_DIFFERENT) |
8f67f8ae | 466 | DIFF_OPT_SET(options, HAS_CHANGES); |
a4a88b2b LT |
467 | } |
468 | ||
469 | static void file_change(struct diff_options *options, | |
470 | unsigned old_mode, unsigned new_mode, | |
471 | const unsigned char *old_sha1, | |
472 | const unsigned char *new_sha1, | |
e5450100 | 473 | int old_sha1_valid, int new_sha1_valid, |
e3d42c47 JL |
474 | const char *fullpath, |
475 | unsigned old_dirty_submodule, unsigned new_dirty_submodule) | |
a4a88b2b | 476 | { |
8efdc326 | 477 | tree_difference = REV_TREE_DIFFERENT; |
8f67f8ae | 478 | DIFF_OPT_SET(options, HAS_CHANGES); |
a4a88b2b LT |
479 | } |
480 | ||
ff5f5f26 MH |
481 | static int rev_compare_tree(struct rev_info *revs, |
482 | struct commit *parent, struct commit *commit) | |
a4a88b2b | 483 | { |
3a5e8608 LT |
484 | struct tree *t1 = parent->tree; |
485 | struct tree *t2 = commit->tree; | |
486 | ||
a4a88b2b | 487 | if (!t1) |
8efdc326 | 488 | return REV_TREE_NEW; |
ceff8e7a LT |
489 | if (!t2) |
490 | return REV_TREE_OLD; | |
78892e32 LT |
491 | |
492 | if (revs->simplify_by_decoration) { | |
493 | /* | |
494 | * If we are simplifying by decoration, then the commit | |
495 | * is worth showing if it has a tag pointing at it. | |
496 | */ | |
2608c249 | 497 | if (get_name_decoration(&commit->object)) |
78892e32 LT |
498 | return REV_TREE_DIFFERENT; |
499 | /* | |
500 | * A commit that is not pointed by a tag is uninteresting | |
501 | * if we are not limited by path. This means that you will | |
502 | * see the usual "commits that touch the paths" plus any | |
503 | * tagged commit by specifying both --simplify-by-decoration | |
504 | * and pathspec. | |
505 | */ | |
afe069d1 | 506 | if (!revs->prune_data.nr) |
78892e32 LT |
507 | return REV_TREE_SAME; |
508 | } | |
ceff8e7a | 509 | |
8efdc326 | 510 | tree_difference = REV_TREE_SAME; |
8f67f8ae | 511 | DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES); |
c4e05b1a | 512 | if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "", |
cd2bdc53 | 513 | &revs->pruning) < 0) |
8efdc326 | 514 | return REV_TREE_DIFFERENT; |
a4a88b2b LT |
515 | return tree_difference; |
516 | } | |
517 | ||
3a5e8608 | 518 | static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit) |
a4a88b2b LT |
519 | { |
520 | int retval; | |
3a5e8608 | 521 | struct tree *t1 = commit->tree; |
a4a88b2b LT |
522 | |
523 | if (!t1) | |
524 | return 0; | |
525 | ||
0a4ba7f8 | 526 | tree_difference = REV_TREE_SAME; |
8f67f8ae | 527 | DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES); |
6275c91c | 528 | retval = diff_tree_sha1(NULL, t1->object.sha1, "", &revs->pruning); |
a4a88b2b | 529 | |
0a4ba7f8 | 530 | return retval >= 0 && (tree_difference == REV_TREE_SAME); |
a4a88b2b LT |
531 | } |
532 | ||
d0af663e KB |
533 | struct treesame_state { |
534 | unsigned int nparents; | |
535 | unsigned char treesame[FLEX_ARRAY]; | |
536 | }; | |
537 | ||
538 | static struct treesame_state *initialise_treesame(struct rev_info *revs, struct commit *commit) | |
539 | { | |
540 | unsigned n = commit_list_count(commit->parents); | |
541 | struct treesame_state *st = xcalloc(1, sizeof(*st) + n); | |
542 | st->nparents = n; | |
543 | add_decoration(&revs->treesame, &commit->object, st); | |
544 | return st; | |
545 | } | |
546 | ||
547 | /* | |
548 | * Must be called immediately after removing the nth_parent from a commit's | |
549 | * parent list, if we are maintaining the per-parent treesame[] decoration. | |
550 | * This does not recalculate the master TREESAME flag - update_treesame() | |
551 | * should be called to update it after a sequence of treesame[] modifications | |
552 | * that may have affected it. | |
553 | */ | |
554 | static int compact_treesame(struct rev_info *revs, struct commit *commit, unsigned nth_parent) | |
555 | { | |
556 | struct treesame_state *st; | |
557 | int old_same; | |
558 | ||
559 | if (!commit->parents) { | |
560 | /* | |
561 | * Have just removed the only parent from a non-merge. | |
562 | * Different handling, as we lack decoration. | |
563 | */ | |
564 | if (nth_parent != 0) | |
565 | die("compact_treesame %u", nth_parent); | |
566 | old_same = !!(commit->object.flags & TREESAME); | |
567 | if (rev_same_tree_as_empty(revs, commit)) | |
568 | commit->object.flags |= TREESAME; | |
569 | else | |
570 | commit->object.flags &= ~TREESAME; | |
571 | return old_same; | |
572 | } | |
573 | ||
574 | st = lookup_decoration(&revs->treesame, &commit->object); | |
575 | if (!st || nth_parent >= st->nparents) | |
576 | die("compact_treesame %u", nth_parent); | |
577 | ||
578 | old_same = st->treesame[nth_parent]; | |
579 | memmove(st->treesame + nth_parent, | |
580 | st->treesame + nth_parent + 1, | |
581 | st->nparents - nth_parent - 1); | |
582 | ||
583 | /* | |
584 | * If we've just become a non-merge commit, update TREESAME | |
585 | * immediately, and remove the no-longer-needed decoration. | |
586 | * If still a merge, defer update until update_treesame(). | |
587 | */ | |
588 | if (--st->nparents == 1) { | |
589 | if (commit->parents->next) | |
590 | die("compact_treesame parents mismatch"); | |
591 | if (st->treesame[0] && revs->dense) | |
592 | commit->object.flags |= TREESAME; | |
593 | else | |
594 | commit->object.flags &= ~TREESAME; | |
595 | free(add_decoration(&revs->treesame, &commit->object, NULL)); | |
596 | } | |
597 | ||
598 | return old_same; | |
599 | } | |
600 | ||
601 | static unsigned update_treesame(struct rev_info *revs, struct commit *commit) | |
602 | { | |
603 | if (commit->parents && commit->parents->next) { | |
604 | unsigned n; | |
605 | struct treesame_state *st; | |
4d826608 KB |
606 | struct commit_list *p; |
607 | unsigned relevant_parents; | |
608 | unsigned relevant_change, irrelevant_change; | |
d0af663e KB |
609 | |
610 | st = lookup_decoration(&revs->treesame, &commit->object); | |
611 | if (!st) | |
612 | die("update_treesame %s", sha1_to_hex(commit->object.sha1)); | |
4d826608 KB |
613 | relevant_parents = 0; |
614 | relevant_change = irrelevant_change = 0; | |
615 | for (p = commit->parents, n = 0; p; n++, p = p->next) { | |
616 | if (relevant_commit(p->item)) { | |
617 | relevant_change |= !st->treesame[n]; | |
618 | relevant_parents++; | |
619 | } else | |
620 | irrelevant_change |= !st->treesame[n]; | |
d0af663e | 621 | } |
4d826608 KB |
622 | if (relevant_parents ? relevant_change : irrelevant_change) |
623 | commit->object.flags &= ~TREESAME; | |
624 | else | |
625 | commit->object.flags |= TREESAME; | |
d0af663e KB |
626 | } |
627 | ||
628 | return commit->object.flags & TREESAME; | |
629 | } | |
630 | ||
4d826608 KB |
631 | static inline int limiting_can_increase_treesame(const struct rev_info *revs) |
632 | { | |
633 | /* | |
634 | * TREESAME is irrelevant unless prune && dense; | |
635 | * if simplify_history is set, we can't have a mixture of TREESAME and | |
636 | * !TREESAME INTERESTING parents (and we don't have treesame[] | |
637 | * decoration anyway); | |
638 | * if first_parent_only is set, then the TREESAME flag is locked | |
639 | * against the first parent (and again we lack treesame[] decoration). | |
640 | */ | |
641 | return revs->prune && revs->dense && | |
642 | !revs->simplify_history && | |
643 | !revs->first_parent_only; | |
644 | } | |
645 | ||
a4a88b2b LT |
646 | static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit) |
647 | { | |
648 | struct commit_list **pp, *parent; | |
d0af663e | 649 | struct treesame_state *ts = NULL; |
4d826608 KB |
650 | int relevant_change = 0, irrelevant_change = 0; |
651 | int relevant_parents, nth_parent; | |
a4a88b2b | 652 | |
53b2c823 LT |
653 | /* |
654 | * If we don't do pruning, everything is interesting | |
655 | */ | |
7dc0fe3b | 656 | if (!revs->prune) |
53b2c823 | 657 | return; |
53b2c823 | 658 | |
a4a88b2b LT |
659 | if (!commit->tree) |
660 | return; | |
661 | ||
662 | if (!commit->parents) { | |
3a5e8608 | 663 | if (rev_same_tree_as_empty(revs, commit)) |
7dc0fe3b | 664 | commit->object.flags |= TREESAME; |
a4a88b2b LT |
665 | return; |
666 | } | |
667 | ||
53b2c823 LT |
668 | /* |
669 | * Normal non-merge commit? If we don't want to make the | |
670 | * history dense, we consider it always to be a change.. | |
671 | */ | |
7dc0fe3b | 672 | if (!revs->dense && !commit->parents->next) |
53b2c823 | 673 | return; |
53b2c823 | 674 | |
4d826608 | 675 | for (pp = &commit->parents, nth_parent = 0, relevant_parents = 0; |
d0af663e KB |
676 | (parent = *pp) != NULL; |
677 | pp = &parent->next, nth_parent++) { | |
a4a88b2b | 678 | struct commit *p = parent->item; |
4d826608 KB |
679 | if (relevant_commit(p)) |
680 | relevant_parents++; | |
a4a88b2b | 681 | |
d0af663e KB |
682 | if (nth_parent == 1) { |
683 | /* | |
684 | * This our second loop iteration - so we now know | |
685 | * we're dealing with a merge. | |
686 | * | |
687 | * Do not compare with later parents when we care only about | |
688 | * the first parent chain, in order to avoid derailing the | |
689 | * traversal to follow a side branch that brought everything | |
690 | * in the path we are limited to by the pathspec. | |
691 | */ | |
692 | if (revs->first_parent_only) | |
693 | break; | |
694 | /* | |
695 | * If this will remain a potentially-simplifiable | |
696 | * merge, remember per-parent treesame if needed. | |
697 | * Initialise the array with the comparison from our | |
698 | * first iteration. | |
699 | */ | |
700 | if (revs->treesame.name && | |
701 | !revs->simplify_history && | |
702 | !(commit->object.flags & UNINTERESTING)) { | |
703 | ts = initialise_treesame(revs, commit); | |
4d826608 | 704 | if (!(irrelevant_change || relevant_change)) |
d0af663e KB |
705 | ts->treesame[0] = 1; |
706 | } | |
707 | } | |
cc0e6c5a AR |
708 | if (parse_commit(p) < 0) |
709 | die("cannot simplify commit %s (because of %s)", | |
710 | sha1_to_hex(commit->object.sha1), | |
711 | sha1_to_hex(p->object.sha1)); | |
3a5e8608 | 712 | switch (rev_compare_tree(revs, p, commit)) { |
8efdc326 | 713 | case REV_TREE_SAME: |
141efdba | 714 | if (!revs->simplify_history || !relevant_commit(p)) { |
f3219fbb JH |
715 | /* Even if a merge with an uninteresting |
716 | * side branch brought the entire change | |
717 | * we are interested in, we do not want | |
718 | * to lose the other branches of this | |
719 | * merge, so we just keep going. | |
720 | */ | |
d0af663e KB |
721 | if (ts) |
722 | ts->treesame[nth_parent] = 1; | |
f3219fbb JH |
723 | continue; |
724 | } | |
a4a88b2b LT |
725 | parent->next = NULL; |
726 | commit->parents = parent; | |
7dc0fe3b | 727 | commit->object.flags |= TREESAME; |
a4a88b2b LT |
728 | return; |
729 | ||
8efdc326 FK |
730 | case REV_TREE_NEW: |
731 | if (revs->remove_empty_trees && | |
3a5e8608 | 732 | rev_same_tree_as_empty(revs, p)) { |
c348f31a JH |
733 | /* We are adding all the specified |
734 | * paths from this parent, so the | |
735 | * history beyond this parent is not | |
736 | * interesting. Remove its parents | |
737 | * (they are grandparents for us). | |
738 | * IOW, we pretend this parent is a | |
739 | * "root" commit. | |
a41e109c | 740 | */ |
cc0e6c5a AR |
741 | if (parse_commit(p) < 0) |
742 | die("cannot simplify commit %s (invalid %s)", | |
743 | sha1_to_hex(commit->object.sha1), | |
744 | sha1_to_hex(p->object.sha1)); | |
c348f31a | 745 | p->parents = NULL; |
a4a88b2b LT |
746 | } |
747 | /* fallthrough */ | |
ceff8e7a | 748 | case REV_TREE_OLD: |
8efdc326 | 749 | case REV_TREE_DIFFERENT: |
4d826608 KB |
750 | if (relevant_commit(p)) |
751 | relevant_change = 1; | |
752 | else | |
753 | irrelevant_change = 1; | |
a4a88b2b LT |
754 | continue; |
755 | } | |
756 | die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1)); | |
757 | } | |
4d826608 KB |
758 | |
759 | /* | |
760 | * TREESAME is straightforward for single-parent commits. For merge | |
761 | * commits, it is most useful to define it so that "irrelevant" | |
762 | * parents cannot make us !TREESAME - if we have any relevant | |
763 | * parents, then we only consider TREESAMEness with respect to them, | |
764 | * allowing irrelevant merges from uninteresting branches to be | |
765 | * simplified away. Only if we have only irrelevant parents do we | |
766 | * base TREESAME on them. Note that this logic is replicated in | |
767 | * update_treesame, which should be kept in sync. | |
768 | */ | |
769 | if (relevant_parents ? !relevant_change : !irrelevant_change) | |
770 | commit->object.flags |= TREESAME; | |
a4a88b2b LT |
771 | } |
772 | ||
47e44ed1 | 773 | static void commit_list_insert_by_date_cached(struct commit *p, struct commit_list **head, |
fce87ae5 AG |
774 | struct commit_list *cached_base, struct commit_list **cache) |
775 | { | |
776 | struct commit_list *new_entry; | |
777 | ||
778 | if (cached_base && p->date < cached_base->item->date) | |
47e44ed1 | 779 | new_entry = commit_list_insert_by_date(p, &cached_base->next); |
fce87ae5 | 780 | else |
47e44ed1 | 781 | new_entry = commit_list_insert_by_date(p, head); |
fce87ae5 AG |
782 | |
783 | if (cache && (!*cache || p->date < (*cache)->item->date)) | |
784 | *cache = new_entry; | |
785 | } | |
786 | ||
787 | static int add_parents_to_list(struct rev_info *revs, struct commit *commit, | |
788 | struct commit_list **list, struct commit_list **cache_ptr) | |
a4a88b2b LT |
789 | { |
790 | struct commit_list *parent = commit->parents; | |
577ed5c2 | 791 | unsigned left_flag; |
fce87ae5 | 792 | struct commit_list *cached_base = cache_ptr ? *cache_ptr : NULL; |
a4a88b2b | 793 | |
3381c790 | 794 | if (commit->object.flags & ADDED) |
cc0e6c5a | 795 | return 0; |
3381c790 LT |
796 | commit->object.flags |= ADDED; |
797 | ||
a330de31 VM |
798 | if (revs->include_check && |
799 | !revs->include_check(commit, revs->include_check_data)) | |
800 | return 0; | |
801 | ||
a4a88b2b LT |
802 | /* |
803 | * If the commit is uninteresting, don't try to | |
804 | * prune parents - we want the maximal uninteresting | |
805 | * set. | |
806 | * | |
807 | * Normally we haven't parsed the parent | |
808 | * yet, so we won't have a parent of a parent | |
809 | * here. However, it may turn out that we've | |
810 | * reached this commit some other way (where it | |
811 | * wasn't uninteresting), in which case we need | |
812 | * to mark its parents recursively too.. | |
813 | */ | |
814 | if (commit->object.flags & UNINTERESTING) { | |
815 | while (parent) { | |
816 | struct commit *p = parent->item; | |
817 | parent = parent->next; | |
aeeae1b7 JH |
818 | if (p) |
819 | p->object.flags |= UNINTERESTING; | |
cc0e6c5a | 820 | if (parse_commit(p) < 0) |
aeeae1b7 | 821 | continue; |
a4a88b2b LT |
822 | if (p->parents) |
823 | mark_parents_uninteresting(p); | |
824 | if (p->object.flags & SEEN) | |
825 | continue; | |
826 | p->object.flags |= SEEN; | |
47e44ed1 | 827 | commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr); |
a4a88b2b | 828 | } |
cc0e6c5a | 829 | return 0; |
a4a88b2b LT |
830 | } |
831 | ||
832 | /* | |
833 | * Ok, the commit wasn't uninteresting. Try to | |
834 | * simplify the commit history and find the parent | |
835 | * that has no differences in the path set if one exists. | |
836 | */ | |
53b2c823 | 837 | try_to_simplify_commit(revs, commit); |
a4a88b2b | 838 | |
ba1d4505 | 839 | if (revs->no_walk) |
cc0e6c5a | 840 | return 0; |
ba1d4505 | 841 | |
577ed5c2 | 842 | left_flag = (commit->object.flags & SYMMETRIC_LEFT); |
0053e902 | 843 | |
d9c292e8 | 844 | for (parent = commit->parents; parent; parent = parent->next) { |
a4a88b2b LT |
845 | struct commit *p = parent->item; |
846 | ||
cc0e6c5a AR |
847 | if (parse_commit(p) < 0) |
848 | return -1; | |
0f3a290b LT |
849 | if (revs->show_source && !p->util) |
850 | p->util = commit->util; | |
577ed5c2 | 851 | p->object.flags |= left_flag; |
ad1012eb LH |
852 | if (!(p->object.flags & SEEN)) { |
853 | p->object.flags |= SEEN; | |
47e44ed1 | 854 | commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr); |
ad1012eb | 855 | } |
60d30b02 | 856 | if (revs->first_parent_only) |
d9c292e8 | 857 | break; |
a4a88b2b | 858 | } |
cc0e6c5a | 859 | return 0; |
a4a88b2b LT |
860 | } |
861 | ||
36d56de6 | 862 | static void cherry_pick_list(struct commit_list *list, struct rev_info *revs) |
d7a17cad JH |
863 | { |
864 | struct commit_list *p; | |
865 | int left_count = 0, right_count = 0; | |
866 | int left_first; | |
867 | struct patch_ids ids; | |
adbbb31e | 868 | unsigned cherry_flag; |
d7a17cad JH |
869 | |
870 | /* First count the commits on the left and on the right */ | |
871 | for (p = list; p; p = p->next) { | |
872 | struct commit *commit = p->item; | |
873 | unsigned flags = commit->object.flags; | |
874 | if (flags & BOUNDARY) | |
875 | ; | |
876 | else if (flags & SYMMETRIC_LEFT) | |
877 | left_count++; | |
878 | else | |
879 | right_count++; | |
880 | } | |
881 | ||
36c07975 TR |
882 | if (!left_count || !right_count) |
883 | return; | |
884 | ||
d7a17cad JH |
885 | left_first = left_count < right_count; |
886 | init_patch_ids(&ids); | |
66f13625 | 887 | ids.diffopts.pathspec = revs->diffopt.pathspec; |
d7a17cad JH |
888 | |
889 | /* Compute patch-ids for one side */ | |
890 | for (p = list; p; p = p->next) { | |
891 | struct commit *commit = p->item; | |
892 | unsigned flags = commit->object.flags; | |
893 | ||
894 | if (flags & BOUNDARY) | |
895 | continue; | |
896 | /* | |
897 | * If we have fewer left, left_first is set and we omit | |
898 | * commits on the right branch in this loop. If we have | |
899 | * fewer right, we skip the left ones. | |
900 | */ | |
901 | if (left_first != !!(flags & SYMMETRIC_LEFT)) | |
902 | continue; | |
903 | commit->util = add_commit_patch_id(commit, &ids); | |
904 | } | |
905 | ||
adbbb31e MG |
906 | /* either cherry_mark or cherry_pick are true */ |
907 | cherry_flag = revs->cherry_mark ? PATCHSAME : SHOWN; | |
908 | ||
d7a17cad JH |
909 | /* Check the other side */ |
910 | for (p = list; p; p = p->next) { | |
911 | struct commit *commit = p->item; | |
912 | struct patch_id *id; | |
913 | unsigned flags = commit->object.flags; | |
914 | ||
915 | if (flags & BOUNDARY) | |
916 | continue; | |
917 | /* | |
918 | * If we have fewer left, left_first is set and we omit | |
919 | * commits on the left branch in this loop. | |
920 | */ | |
921 | if (left_first == !!(flags & SYMMETRIC_LEFT)) | |
922 | continue; | |
923 | ||
924 | /* | |
925 | * Have we seen the same patch id? | |
926 | */ | |
927 | id = has_commit_patch_id(commit, &ids); | |
928 | if (!id) | |
929 | continue; | |
930 | id->seen = 1; | |
adbbb31e | 931 | commit->object.flags |= cherry_flag; |
d7a17cad JH |
932 | } |
933 | ||
934 | /* Now check the original side for seen ones */ | |
935 | for (p = list; p; p = p->next) { | |
936 | struct commit *commit = p->item; | |
937 | struct patch_id *ent; | |
938 | ||
939 | ent = commit->util; | |
940 | if (!ent) | |
941 | continue; | |
942 | if (ent->seen) | |
adbbb31e | 943 | commit->object.flags |= cherry_flag; |
d7a17cad JH |
944 | commit->util = NULL; |
945 | } | |
946 | ||
947 | free_patch_ids(&ids); | |
948 | } | |
949 | ||
7d004199 LT |
950 | /* How many extra uninteresting commits we want to see.. */ |
951 | #define SLOP 5 | |
952 | ||
b6e8a3b5 JK |
953 | static int still_interesting(struct commit_list *src, unsigned long date, int slop, |
954 | struct commit **interesting_cache) | |
3131b713 | 955 | { |
7d004199 LT |
956 | /* |
957 | * No source list at all? We're definitely done.. | |
958 | */ | |
959 | if (!src) | |
960 | return 0; | |
961 | ||
962 | /* | |
963 | * Does the destination list contain entries with a date | |
964 | * before the source list? Definitely _not_ done. | |
965 | */ | |
c19d1b4e | 966 | if (date <= src->item->date) |
7d004199 LT |
967 | return SLOP; |
968 | ||
969 | /* | |
970 | * Does the source list still have interesting commits in | |
971 | * it? Definitely not done.. | |
972 | */ | |
b6e8a3b5 | 973 | if (!everybody_uninteresting(src, interesting_cache)) |
7d004199 LT |
974 | return SLOP; |
975 | ||
976 | /* Ok, we're closing in.. */ | |
977 | return slop-1; | |
3131b713 LT |
978 | } |
979 | ||
ebdc94f3 JH |
980 | /* |
981 | * "rev-list --ancestry-path A..B" computes commits that are ancestors | |
982 | * of B but not ancestors of A but further limits the result to those | |
983 | * that are descendants of A. This takes the list of bottom commits and | |
984 | * the result of "A..B" without --ancestry-path, and limits the latter | |
985 | * further to the ones that can reach one of the commits in "bottom". | |
986 | */ | |
987 | static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list) | |
988 | { | |
989 | struct commit_list *p; | |
990 | struct commit_list *rlist = NULL; | |
991 | int made_progress; | |
992 | ||
993 | /* | |
994 | * Reverse the list so that it will be likely that we would | |
995 | * process parents before children. | |
996 | */ | |
997 | for (p = list; p; p = p->next) | |
998 | commit_list_insert(p->item, &rlist); | |
999 | ||
1000 | for (p = bottom; p; p = p->next) | |
1001 | p->item->object.flags |= TMP_MARK; | |
1002 | ||
1003 | /* | |
1004 | * Mark the ones that can reach bottom commits in "list", | |
1005 | * in a bottom-up fashion. | |
1006 | */ | |
1007 | do { | |
1008 | made_progress = 0; | |
1009 | for (p = rlist; p; p = p->next) { | |
1010 | struct commit *c = p->item; | |
1011 | struct commit_list *parents; | |
1012 | if (c->object.flags & (TMP_MARK | UNINTERESTING)) | |
1013 | continue; | |
1014 | for (parents = c->parents; | |
1015 | parents; | |
1016 | parents = parents->next) { | |
1017 | if (!(parents->item->object.flags & TMP_MARK)) | |
1018 | continue; | |
1019 | c->object.flags |= TMP_MARK; | |
1020 | made_progress = 1; | |
1021 | break; | |
1022 | } | |
1023 | } | |
1024 | } while (made_progress); | |
1025 | ||
1026 | /* | |
1027 | * NEEDSWORK: decide if we want to remove parents that are | |
1028 | * not marked with TMP_MARK from commit->parents for commits | |
1029 | * in the resulting list. We may not want to do that, though. | |
1030 | */ | |
1031 | ||
1032 | /* | |
1033 | * The ones that are not marked with TMP_MARK are uninteresting | |
1034 | */ | |
1035 | for (p = list; p; p = p->next) { | |
1036 | struct commit *c = p->item; | |
1037 | if (c->object.flags & TMP_MARK) | |
1038 | continue; | |
1039 | c->object.flags |= UNINTERESTING; | |
1040 | } | |
1041 | ||
1042 | /* We are done with the TMP_MARK */ | |
1043 | for (p = list; p; p = p->next) | |
1044 | p->item->object.flags &= ~TMP_MARK; | |
1045 | for (p = bottom; p; p = p->next) | |
1046 | p->item->object.flags &= ~TMP_MARK; | |
1047 | free_commit_list(rlist); | |
1048 | } | |
1049 | ||
1050 | /* | |
1051 | * Before walking the history, keep the set of "negative" refs the | |
1052 | * caller has asked to exclude. | |
1053 | * | |
1054 | * This is used to compute "rev-list --ancestry-path A..B", as we need | |
1055 | * to filter the result of "A..B" further to the ones that can actually | |
1056 | * reach A. | |
1057 | */ | |
7f34a46f | 1058 | static struct commit_list *collect_bottom_commits(struct commit_list *list) |
ebdc94f3 | 1059 | { |
7f34a46f KB |
1060 | struct commit_list *elem, *bottom = NULL; |
1061 | for (elem = list; elem; elem = elem->next) | |
1062 | if (elem->item->object.flags & BOTTOM) | |
1063 | commit_list_insert(elem->item, &bottom); | |
ebdc94f3 JH |
1064 | return bottom; |
1065 | } | |
1066 | ||
60adf7d7 MG |
1067 | /* Assumes either left_only or right_only is set */ |
1068 | static void limit_left_right(struct commit_list *list, struct rev_info *revs) | |
1069 | { | |
1070 | struct commit_list *p; | |
1071 | ||
1072 | for (p = list; p; p = p->next) { | |
1073 | struct commit *commit = p->item; | |
1074 | ||
1075 | if (revs->right_only) { | |
1076 | if (commit->object.flags & SYMMETRIC_LEFT) | |
1077 | commit->object.flags |= SHOWN; | |
1078 | } else /* revs->left_only is set */ | |
1079 | if (!(commit->object.flags & SYMMETRIC_LEFT)) | |
1080 | commit->object.flags |= SHOWN; | |
1081 | } | |
1082 | } | |
1083 | ||
cc0e6c5a | 1084 | static int limit_list(struct rev_info *revs) |
a4a88b2b | 1085 | { |
7d004199 LT |
1086 | int slop = SLOP; |
1087 | unsigned long date = ~0ul; | |
a4a88b2b LT |
1088 | struct commit_list *list = revs->commits; |
1089 | struct commit_list *newlist = NULL; | |
1090 | struct commit_list **p = &newlist; | |
ebdc94f3 | 1091 | struct commit_list *bottom = NULL; |
b6e8a3b5 | 1092 | struct commit *interesting_cache = NULL; |
ebdc94f3 JH |
1093 | |
1094 | if (revs->ancestry_path) { | |
7f34a46f | 1095 | bottom = collect_bottom_commits(list); |
ebdc94f3 | 1096 | if (!bottom) |
97b03c35 | 1097 | die("--ancestry-path given but there are no bottom commits"); |
ebdc94f3 | 1098 | } |
a4a88b2b LT |
1099 | |
1100 | while (list) { | |
1101 | struct commit_list *entry = list; | |
1102 | struct commit *commit = list->item; | |
1103 | struct object *obj = &commit->object; | |
cdcefbc9 | 1104 | show_early_output_fn_t show; |
a4a88b2b LT |
1105 | |
1106 | list = list->next; | |
1107 | free(entry); | |
1108 | ||
b6e8a3b5 JK |
1109 | if (commit == interesting_cache) |
1110 | interesting_cache = NULL; | |
1111 | ||
a4a88b2b LT |
1112 | if (revs->max_age != -1 && (commit->date < revs->max_age)) |
1113 | obj->flags |= UNINTERESTING; | |
fce87ae5 | 1114 | if (add_parents_to_list(revs, commit, &list, NULL) < 0) |
cc0e6c5a | 1115 | return -1; |
a4a88b2b LT |
1116 | if (obj->flags & UNINTERESTING) { |
1117 | mark_parents_uninteresting(commit); | |
7d004199 LT |
1118 | if (revs->show_all) |
1119 | p = &commit_list_insert(commit, p)->next; | |
b6e8a3b5 | 1120 | slop = still_interesting(list, date, slop, &interesting_cache); |
7d004199 | 1121 | if (slop) |
3131b713 | 1122 | continue; |
7d004199 LT |
1123 | /* If showing all, add the whole pending list to the end */ |
1124 | if (revs->show_all) | |
1125 | *p = list; | |
1126 | break; | |
a4a88b2b LT |
1127 | } |
1128 | if (revs->min_age != -1 && (commit->date > revs->min_age)) | |
1129 | continue; | |
7d004199 | 1130 | date = commit->date; |
a4a88b2b | 1131 | p = &commit_list_insert(commit, p)->next; |
cdcefbc9 LT |
1132 | |
1133 | show = show_early_output; | |
1134 | if (!show) | |
1135 | continue; | |
1136 | ||
1137 | show(revs, newlist); | |
1138 | show_early_output = NULL; | |
a4a88b2b | 1139 | } |
adbbb31e | 1140 | if (revs->cherry_pick || revs->cherry_mark) |
36d56de6 | 1141 | cherry_pick_list(newlist, revs); |
d7a17cad | 1142 | |
60adf7d7 MG |
1143 | if (revs->left_only || revs->right_only) |
1144 | limit_left_right(newlist, revs); | |
1145 | ||
ebdc94f3 JH |
1146 | if (bottom) { |
1147 | limit_to_ancestry(bottom, newlist); | |
1148 | free_commit_list(bottom); | |
1149 | } | |
1150 | ||
4d826608 KB |
1151 | /* |
1152 | * Check if any commits have become TREESAME by some of their parents | |
1153 | * becoming UNINTERESTING. | |
1154 | */ | |
1155 | if (limiting_can_increase_treesame(revs)) | |
1156 | for (list = newlist; list; list = list->next) { | |
1157 | struct commit *c = list->item; | |
1158 | if (c->object.flags & (UNINTERESTING | TREESAME)) | |
1159 | continue; | |
1160 | update_treesame(revs, c); | |
1161 | } | |
1162 | ||
a4a88b2b | 1163 | revs->commits = newlist; |
cc0e6c5a | 1164 | return 0; |
a4a88b2b LT |
1165 | } |
1166 | ||
df835d3a MH |
1167 | /* |
1168 | * Add an entry to refs->cmdline with the specified information. | |
1169 | * *name is copied. | |
1170 | */ | |
281eee47 JH |
1171 | static void add_rev_cmdline(struct rev_info *revs, |
1172 | struct object *item, | |
1173 | const char *name, | |
1174 | int whence, | |
1175 | unsigned flags) | |
1176 | { | |
1177 | struct rev_cmdline_info *info = &revs->cmdline; | |
1178 | int nr = info->nr; | |
1179 | ||
1180 | ALLOC_GROW(info->rev, nr + 1, info->alloc); | |
1181 | info->rev[nr].item = item; | |
df835d3a | 1182 | info->rev[nr].name = xstrdup(name); |
281eee47 JH |
1183 | info->rev[nr].whence = whence; |
1184 | info->rev[nr].flags = flags; | |
1185 | info->nr++; | |
1186 | } | |
1187 | ||
a765499a KB |
1188 | static void add_rev_cmdline_list(struct rev_info *revs, |
1189 | struct commit_list *commit_list, | |
1190 | int whence, | |
1191 | unsigned flags) | |
1192 | { | |
1193 | while (commit_list) { | |
1194 | struct object *object = &commit_list->item->object; | |
1195 | add_rev_cmdline(revs, object, sha1_to_hex(object->sha1), | |
1196 | whence, flags); | |
1197 | commit_list = commit_list->next; | |
1198 | } | |
1199 | } | |
1200 | ||
63049292 JH |
1201 | struct all_refs_cb { |
1202 | int all_flags; | |
71b03b42 | 1203 | int warned_bad_reflog; |
63049292 JH |
1204 | struct rev_info *all_revs; |
1205 | const char *name_for_errormsg; | |
1206 | }; | |
ae563542 | 1207 | |
ff32d342 | 1208 | int ref_excluded(struct string_list *ref_excludes, const char *path) |
e7b432c5 JH |
1209 | { |
1210 | struct string_list_item *item; | |
1211 | ||
ff32d342 | 1212 | if (!ref_excludes) |
e7b432c5 | 1213 | return 0; |
ff32d342 | 1214 | for_each_string_list_item(item, ref_excludes) { |
eb07894f | 1215 | if (!wildmatch(item->string, path, 0, NULL)) |
e7b432c5 JH |
1216 | return 1; |
1217 | } | |
1218 | return 0; | |
1219 | } | |
1220 | ||
a217dcbd MH |
1221 | static int handle_one_ref(const char *path, const struct object_id *oid, |
1222 | int flag, void *cb_data) | |
ae563542 | 1223 | { |
63049292 | 1224 | struct all_refs_cb *cb = cb_data; |
e7b432c5 JH |
1225 | struct object *object; |
1226 | ||
ff32d342 | 1227 | if (ref_excluded(cb->all_revs->ref_excludes, path)) |
e7b432c5 JH |
1228 | return 0; |
1229 | ||
a217dcbd | 1230 | object = get_reference(cb->all_revs, path, oid->hash, cb->all_flags); |
281eee47 | 1231 | add_rev_cmdline(cb->all_revs, object, path, REV_CMD_REF, cb->all_flags); |
a217dcbd | 1232 | add_pending_sha1(cb->all_revs, path, oid->hash, cb->all_flags); |
ae563542 LT |
1233 | return 0; |
1234 | } | |
1235 | ||
d08bae7e IL |
1236 | static void init_all_refs_cb(struct all_refs_cb *cb, struct rev_info *revs, |
1237 | unsigned flags) | |
1238 | { | |
1239 | cb->all_revs = revs; | |
1240 | cb->all_flags = flags; | |
1241 | } | |
1242 | ||
ff32d342 | 1243 | void clear_ref_exclusion(struct string_list **ref_excludes_p) |
e7b432c5 | 1244 | { |
ff32d342 JH |
1245 | if (*ref_excludes_p) { |
1246 | string_list_clear(*ref_excludes_p, 0); | |
1247 | free(*ref_excludes_p); | |
e7b432c5 | 1248 | } |
ff32d342 | 1249 | *ref_excludes_p = NULL; |
e7b432c5 JH |
1250 | } |
1251 | ||
ff32d342 | 1252 | void add_ref_exclusion(struct string_list **ref_excludes_p, const char *exclude) |
e7b432c5 | 1253 | { |
ff32d342 JH |
1254 | if (!*ref_excludes_p) { |
1255 | *ref_excludes_p = xcalloc(1, sizeof(**ref_excludes_p)); | |
1256 | (*ref_excludes_p)->strdup_strings = 1; | |
e7b432c5 | 1257 | } |
ff32d342 | 1258 | string_list_append(*ref_excludes_p, exclude); |
e7b432c5 JH |
1259 | } |
1260 | ||
9ef6aeb0 HV |
1261 | static void handle_refs(const char *submodule, struct rev_info *revs, unsigned flags, |
1262 | int (*for_each)(const char *, each_ref_fn, void *)) | |
ae563542 | 1263 | { |
63049292 | 1264 | struct all_refs_cb cb; |
d08bae7e | 1265 | init_all_refs_cb(&cb, revs, flags); |
a217dcbd | 1266 | for_each(submodule, handle_one_ref, &cb); |
63049292 JH |
1267 | } |
1268 | ||
71b03b42 | 1269 | static void handle_one_reflog_commit(unsigned char *sha1, void *cb_data) |
63049292 JH |
1270 | { |
1271 | struct all_refs_cb *cb = cb_data; | |
71b03b42 SP |
1272 | if (!is_null_sha1(sha1)) { |
1273 | struct object *o = parse_object(sha1); | |
1274 | if (o) { | |
1275 | o->flags |= cb->all_flags; | |
281eee47 | 1276 | /* ??? CMDLINEFLAGS ??? */ |
71b03b42 SP |
1277 | add_pending_object(cb->all_revs, o, ""); |
1278 | } | |
1279 | else if (!cb->warned_bad_reflog) { | |
46efd2d9 | 1280 | warning("reflog of '%s' references pruned commits", |
71b03b42 SP |
1281 | cb->name_for_errormsg); |
1282 | cb->warned_bad_reflog = 1; | |
1283 | } | |
63049292 | 1284 | } |
71b03b42 SP |
1285 | } |
1286 | ||
883d60fa JS |
1287 | static int handle_one_reflog_ent(unsigned char *osha1, unsigned char *nsha1, |
1288 | const char *email, unsigned long timestamp, int tz, | |
1289 | const char *message, void *cb_data) | |
71b03b42 SP |
1290 | { |
1291 | handle_one_reflog_commit(osha1, cb_data); | |
1292 | handle_one_reflog_commit(nsha1, cb_data); | |
63049292 JH |
1293 | return 0; |
1294 | } | |
1295 | ||
1296 | static int handle_one_reflog(const char *path, const unsigned char *sha1, int flag, void *cb_data) | |
1297 | { | |
1298 | struct all_refs_cb *cb = cb_data; | |
71b03b42 | 1299 | cb->warned_bad_reflog = 0; |
63049292 JH |
1300 | cb->name_for_errormsg = path; |
1301 | for_each_reflog_ent(path, handle_one_reflog_ent, cb_data); | |
1302 | return 0; | |
1303 | } | |
1304 | ||
718ccc97 | 1305 | void add_reflogs_to_pending(struct rev_info *revs, unsigned flags) |
63049292 JH |
1306 | { |
1307 | struct all_refs_cb cb; | |
2b2a5be3 MH |
1308 | struct each_ref_fn_sha1_adapter wrapped_handle_one_reflog = |
1309 | {handle_one_reflog, &cb}; | |
1310 | ||
63049292 JH |
1311 | cb.all_revs = revs; |
1312 | cb.all_flags = flags; | |
2b2a5be3 | 1313 | for_each_reflog(each_ref_fn_adapter, &wrapped_handle_one_reflog); |
ae563542 LT |
1314 | } |
1315 | ||
4fe10219 JK |
1316 | static void add_cache_tree(struct cache_tree *it, struct rev_info *revs, |
1317 | struct strbuf *path) | |
1318 | { | |
1319 | size_t baselen = path->len; | |
1320 | int i; | |
1321 | ||
1322 | if (it->entry_count >= 0) { | |
1323 | struct tree *tree = lookup_tree(it->sha1); | |
1324 | add_pending_object_with_path(revs, &tree->object, "", | |
1325 | 040000, path->buf); | |
1326 | } | |
1327 | ||
1328 | for (i = 0; i < it->subtree_nr; i++) { | |
1329 | struct cache_tree_sub *sub = it->down[i]; | |
1330 | strbuf_addf(path, "%s%s", baselen ? "/" : "", sub->name); | |
1331 | add_cache_tree(sub->cache_tree, revs, path); | |
1332 | strbuf_setlen(path, baselen); | |
1333 | } | |
1334 | ||
1335 | } | |
1336 | ||
1337 | void add_index_objects_to_pending(struct rev_info *revs, unsigned flags) | |
1338 | { | |
1339 | int i; | |
1340 | ||
1341 | read_cache(); | |
1342 | for (i = 0; i < active_nr; i++) { | |
1343 | struct cache_entry *ce = active_cache[i]; | |
1344 | struct blob *blob; | |
1345 | ||
1346 | if (S_ISGITLINK(ce->ce_mode)) | |
1347 | continue; | |
1348 | ||
1349 | blob = lookup_blob(ce->sha1); | |
1350 | if (!blob) | |
1351 | die("unable to add index blob to traversal"); | |
1352 | add_pending_object_with_path(revs, &blob->object, "", | |
1353 | ce->ce_mode, ce->name); | |
1354 | } | |
1355 | ||
1356 | if (active_cache_tree) { | |
1357 | struct strbuf path = STRBUF_INIT; | |
1358 | add_cache_tree(active_cache_tree, revs, &path); | |
1359 | strbuf_release(&path); | |
1360 | } | |
1361 | } | |
1362 | ||
281eee47 | 1363 | static int add_parents_only(struct rev_info *revs, const char *arg_, int flags) |
ea4a19e1 JH |
1364 | { |
1365 | unsigned char sha1[20]; | |
1366 | struct object *it; | |
1367 | struct commit *commit; | |
1368 | struct commit_list *parents; | |
281eee47 | 1369 | const char *arg = arg_; |
ea4a19e1 JH |
1370 | |
1371 | if (*arg == '^') { | |
7f34a46f | 1372 | flags ^= UNINTERESTING | BOTTOM; |
ea4a19e1 JH |
1373 | arg++; |
1374 | } | |
cd74e473 | 1375 | if (get_sha1_committish(arg, sha1)) |
ea4a19e1 JH |
1376 | return 0; |
1377 | while (1) { | |
1378 | it = get_reference(revs, arg, sha1, 0); | |
cc243c3c JH |
1379 | if (!it && revs->ignore_missing) |
1380 | return 0; | |
1974632c | 1381 | if (it->type != OBJ_TAG) |
ea4a19e1 | 1382 | break; |
9684afd9 MK |
1383 | if (!((struct tag*)it)->tagged) |
1384 | return 0; | |
e702496e | 1385 | hashcpy(sha1, ((struct tag*)it)->tagged->sha1); |
ea4a19e1 | 1386 | } |
1974632c | 1387 | if (it->type != OBJ_COMMIT) |
ea4a19e1 JH |
1388 | return 0; |
1389 | commit = (struct commit *)it; | |
1390 | for (parents = commit->parents; parents; parents = parents->next) { | |
1391 | it = &parents->item->object; | |
1392 | it->flags |= flags; | |
281eee47 | 1393 | add_rev_cmdline(revs, it, arg_, REV_CMD_PARENTS_ONLY, flags); |
ea4a19e1 JH |
1394 | add_pending_object(revs, it, arg); |
1395 | } | |
1396 | return 1; | |
1397 | } | |
1398 | ||
db6296a5 | 1399 | void init_revisions(struct rev_info *revs, const char *prefix) |
8efdc326 FK |
1400 | { |
1401 | memset(revs, 0, sizeof(*revs)); | |
8e8f9987 | 1402 | |
6b9c58f4 | 1403 | revs->abbrev = DEFAULT_ABBREV; |
8e8f9987 | 1404 | revs->ignore_merges = 1; |
9202434c | 1405 | revs->simplify_history = 1; |
8f67f8ae | 1406 | DIFF_OPT_SET(&revs->pruning, RECURSIVE); |
90b19941 | 1407 | DIFF_OPT_SET(&revs->pruning, QUICK); |
cd2bdc53 LT |
1408 | revs->pruning.add_remove = file_add_remove; |
1409 | revs->pruning.change = file_change; | |
08f704f2 | 1410 | revs->sort_order = REV_SORT_IN_GRAPH_ORDER; |
8efdc326 | 1411 | revs->dense = 1; |
db6296a5 | 1412 | revs->prefix = prefix; |
8efdc326 FK |
1413 | revs->max_age = -1; |
1414 | revs->min_age = -1; | |
d5db6c9e | 1415 | revs->skip_count = -1; |
8efdc326 | 1416 | revs->max_count = -1; |
ad5aeede | 1417 | revs->max_parents = -1; |
8efdc326 | 1418 | |
cd2bdc53 LT |
1419 | revs->commit_format = CMIT_FMT_DEFAULT; |
1420 | ||
918d4e1c JH |
1421 | init_grep_defaults(); |
1422 | grep_init(&revs->grep_filter, prefix); | |
0843acfd | 1423 | revs->grep_filter.status_only = 1; |
0843acfd JK |
1424 | revs->grep_filter.regflags = REG_NEWLINE; |
1425 | ||
cd2bdc53 | 1426 | diff_setup(&revs->diffopt); |
c0cb4a06 | 1427 | if (prefix && !revs->diffopt.prefix) { |
cd676a51 JH |
1428 | revs->diffopt.prefix = prefix; |
1429 | revs->diffopt.prefix_length = strlen(prefix); | |
1430 | } | |
3a03cf6b JK |
1431 | |
1432 | revs->notes_opt.use_default_notes = -1; | |
8efdc326 FK |
1433 | } |
1434 | ||
0d2c9d67 RS |
1435 | static void add_pending_commit_list(struct rev_info *revs, |
1436 | struct commit_list *commit_list, | |
1437 | unsigned int flags) | |
1438 | { | |
1439 | while (commit_list) { | |
1440 | struct object *object = &commit_list->item->object; | |
1441 | object->flags |= flags; | |
1442 | add_pending_object(revs, object, sha1_to_hex(object->sha1)); | |
1443 | commit_list = commit_list->next; | |
1444 | } | |
1445 | } | |
1446 | ||
ae3e5e1e JH |
1447 | static void prepare_show_merge(struct rev_info *revs) |
1448 | { | |
1449 | struct commit_list *bases; | |
1450 | struct commit *head, *other; | |
1451 | unsigned char sha1[20]; | |
1452 | const char **prune = NULL; | |
1453 | int i, prune_num = 1; /* counting terminating NULL */ | |
1454 | ||
baf18fc2 | 1455 | if (get_sha1("HEAD", sha1)) |
ae3e5e1e | 1456 | die("--merge without HEAD?"); |
baf18fc2 NTND |
1457 | head = lookup_commit_or_die(sha1, "HEAD"); |
1458 | if (get_sha1("MERGE_HEAD", sha1)) | |
ae3e5e1e | 1459 | die("--merge without MERGE_HEAD?"); |
baf18fc2 | 1460 | other = lookup_commit_or_die(sha1, "MERGE_HEAD"); |
ae3e5e1e JH |
1461 | add_pending_object(revs, &head->object, "HEAD"); |
1462 | add_pending_object(revs, &other->object, "MERGE_HEAD"); | |
2ce406cc | 1463 | bases = get_merge_bases(head, other); |
7f34a46f KB |
1464 | add_rev_cmdline_list(revs, bases, REV_CMD_MERGE_BASE, UNINTERESTING | BOTTOM); |
1465 | add_pending_commit_list(revs, bases, UNINTERESTING | BOTTOM); | |
e82447b1 JH |
1466 | free_commit_list(bases); |
1467 | head->object.flags |= SYMMETRIC_LEFT; | |
ae3e5e1e JH |
1468 | |
1469 | if (!active_nr) | |
1470 | read_cache(); | |
1471 | for (i = 0; i < active_nr; i++) { | |
9c5e6c80 | 1472 | const struct cache_entry *ce = active_cache[i]; |
ae3e5e1e JH |
1473 | if (!ce_stage(ce)) |
1474 | continue; | |
429bb40a | 1475 | if (ce_path_match(ce, &revs->prune_data, NULL)) { |
ae3e5e1e | 1476 | prune_num++; |
2756ca43 | 1477 | REALLOC_ARRAY(prune, prune_num); |
ae3e5e1e JH |
1478 | prune[prune_num-2] = ce->name; |
1479 | prune[prune_num-1] = NULL; | |
1480 | } | |
1481 | while ((i+1 < active_nr) && | |
1482 | ce_same_name(ce, active_cache[i+1])) | |
1483 | i++; | |
1484 | } | |
afe069d1 | 1485 | free_pathspec(&revs->prune_data); |
4a2d5ae2 | 1486 | parse_pathspec(&revs->prune_data, PATHSPEC_ALL_MAGIC & ~PATHSPEC_LITERAL, |
c6f1b920 | 1487 | PATHSPEC_PREFER_FULL | PATHSPEC_LITERAL_PATH, "", prune); |
e82447b1 | 1488 | revs->limited = 1; |
ae3e5e1e JH |
1489 | } |
1490 | ||
8e676e8b | 1491 | int handle_revision_arg(const char *arg_, struct rev_info *revs, int flags, unsigned revarg_opt) |
5d6f0935 | 1492 | { |
249c8f4a | 1493 | struct object_context oc; |
5d6f0935 JH |
1494 | char *dotdot; |
1495 | struct object *object; | |
1496 | unsigned char sha1[20]; | |
1497 | int local_flags; | |
281eee47 | 1498 | const char *arg = arg_; |
8e676e8b | 1499 | int cant_be_filename = revarg_opt & REVARG_CANNOT_BE_FILENAME; |
d5f6b1d7 | 1500 | unsigned get_sha1_flags = 0; |
5d6f0935 | 1501 | |
7f34a46f KB |
1502 | flags = flags & UNINTERESTING ? flags | BOTTOM : flags & ~BOTTOM; |
1503 | ||
5d6f0935 JH |
1504 | dotdot = strstr(arg, ".."); |
1505 | if (dotdot) { | |
1506 | unsigned char from_sha1[20]; | |
1507 | const char *next = dotdot + 2; | |
1508 | const char *this = arg; | |
1509 | int symmetric = *next == '.'; | |
7f34a46f | 1510 | unsigned int flags_exclude = flags ^ (UNINTERESTING | BOTTOM); |
003c84f6 | 1511 | static const char head_by_default[] = "HEAD"; |
281eee47 | 1512 | unsigned int a_flags; |
5d6f0935 JH |
1513 | |
1514 | *dotdot = 0; | |
1515 | next += symmetric; | |
1516 | ||
1517 | if (!*next) | |
003c84f6 | 1518 | next = head_by_default; |
5d6f0935 | 1519 | if (dotdot == arg) |
003c84f6 JH |
1520 | this = head_by_default; |
1521 | if (this == head_by_default && next == head_by_default && | |
1522 | !symmetric) { | |
1523 | /* | |
1524 | * Just ".."? That is not a range but the | |
1525 | * pathspec for the parent directory. | |
1526 | */ | |
1527 | if (!cant_be_filename) { | |
1528 | *dotdot = '.'; | |
1529 | return -1; | |
1530 | } | |
1531 | } | |
cd74e473 JH |
1532 | if (!get_sha1_committish(this, from_sha1) && |
1533 | !get_sha1_committish(next, sha1)) { | |
895c5ba3 | 1534 | struct object *a_obj, *b_obj; |
5d6f0935 JH |
1535 | |
1536 | if (!cant_be_filename) { | |
1537 | *dotdot = '.'; | |
1538 | verify_non_filename(revs->prefix, arg); | |
1539 | } | |
1540 | ||
895c5ba3 JH |
1541 | a_obj = parse_object(from_sha1); |
1542 | b_obj = parse_object(sha1); | |
1543 | if (!a_obj || !b_obj) { | |
1544 | missing: | |
1545 | if (revs->ignore_missing) | |
1546 | return 0; | |
1547 | die(symmetric | |
1548 | ? "Invalid symmetric difference expression %s" | |
1549 | : "Invalid revision range %s", arg); | |
1550 | } | |
1551 | ||
1552 | if (!symmetric) { | |
1553 | /* just A..B */ | |
1554 | a_flags = flags_exclude; | |
1555 | } else { | |
1556 | /* A...B -- find merge bases between the two */ | |
1557 | struct commit *a, *b; | |
1558 | struct commit_list *exclude; | |
1559 | ||
1560 | a = (a_obj->type == OBJ_COMMIT | |
1561 | ? (struct commit *)a_obj | |
1562 | : lookup_commit_reference(a_obj->sha1)); | |
1563 | b = (b_obj->type == OBJ_COMMIT | |
1564 | ? (struct commit *)b_obj | |
1565 | : lookup_commit_reference(b_obj->sha1)); | |
1566 | if (!a || !b) | |
1567 | goto missing; | |
2ce406cc | 1568 | exclude = get_merge_bases(a, b); |
a765499a KB |
1569 | add_rev_cmdline_list(revs, exclude, |
1570 | REV_CMD_MERGE_BASE, | |
1571 | flags_exclude); | |
5d6f0935 JH |
1572 | add_pending_commit_list(revs, exclude, |
1573 | flags_exclude); | |
1574 | free_commit_list(exclude); | |
895c5ba3 | 1575 | |
281eee47 | 1576 | a_flags = flags | SYMMETRIC_LEFT; |
895c5ba3 JH |
1577 | } |
1578 | ||
1579 | a_obj->flags |= a_flags; | |
1580 | b_obj->flags |= flags; | |
1581 | add_rev_cmdline(revs, a_obj, this, | |
281eee47 | 1582 | REV_CMD_LEFT, a_flags); |
895c5ba3 | 1583 | add_rev_cmdline(revs, b_obj, next, |
281eee47 | 1584 | REV_CMD_RIGHT, flags); |
895c5ba3 JH |
1585 | add_pending_object(revs, a_obj, this); |
1586 | add_pending_object(revs, b_obj, next); | |
5d6f0935 JH |
1587 | return 0; |
1588 | } | |
1589 | *dotdot = '.'; | |
1590 | } | |
1591 | dotdot = strstr(arg, "^@"); | |
1592 | if (dotdot && !dotdot[2]) { | |
1593 | *dotdot = 0; | |
1594 | if (add_parents_only(revs, arg, flags)) | |
1595 | return 0; | |
1596 | *dotdot = '^'; | |
1597 | } | |
62476c8e JH |
1598 | dotdot = strstr(arg, "^!"); |
1599 | if (dotdot && !dotdot[2]) { | |
1600 | *dotdot = 0; | |
7f34a46f | 1601 | if (!add_parents_only(revs, arg, flags ^ (UNINTERESTING | BOTTOM))) |
62476c8e JH |
1602 | *dotdot = '^'; |
1603 | } | |
1604 | ||
5d6f0935 JH |
1605 | local_flags = 0; |
1606 | if (*arg == '^') { | |
7f34a46f | 1607 | local_flags = UNINTERESTING | BOTTOM; |
5d6f0935 JH |
1608 | arg++; |
1609 | } | |
d5f6b1d7 JH |
1610 | |
1611 | if (revarg_opt & REVARG_COMMITTISH) | |
1612 | get_sha1_flags = GET_SHA1_COMMITTISH; | |
1613 | ||
1614 | if (get_sha1_with_context(arg, get_sha1_flags, sha1, &oc)) | |
cc243c3c | 1615 | return revs->ignore_missing ? 0 : -1; |
5d6f0935 JH |
1616 | if (!cant_be_filename) |
1617 | verify_non_filename(revs->prefix, arg); | |
1618 | object = get_reference(revs, arg, sha1, flags ^ local_flags); | |
281eee47 | 1619 | add_rev_cmdline(revs, object, arg_, REV_CMD_REV, flags ^ local_flags); |
249c8f4a | 1620 | add_pending_object_with_mode(revs, object, arg, oc.mode); |
5d6f0935 JH |
1621 | return 0; |
1622 | } | |
1623 | ||
4da5af31 JH |
1624 | struct cmdline_pathspec { |
1625 | int alloc; | |
1626 | int nr; | |
1627 | const char **path; | |
1628 | }; | |
1fc561d1 | 1629 | |
4da5af31 JH |
1630 | static void append_prune_data(struct cmdline_pathspec *prune, const char **av) |
1631 | { | |
1632 | while (*av) { | |
9e57ac55 | 1633 | ALLOC_GROW(prune->path, prune->nr + 1, prune->alloc); |
4da5af31 JH |
1634 | prune->path[prune->nr++] = *(av++); |
1635 | } | |
1636 | } | |
60da8b15 | 1637 | |
4da5af31 JH |
1638 | static void read_pathspec_from_stdin(struct rev_info *revs, struct strbuf *sb, |
1639 | struct cmdline_pathspec *prune) | |
1640 | { | |
60da8b15 JH |
1641 | while (strbuf_getwholeline(sb, stdin, '\n') != EOF) { |
1642 | int len = sb->len; | |
1643 | if (len && sb->buf[len - 1] == '\n') | |
1644 | sb->buf[--len] = '\0'; | |
9e57ac55 | 1645 | ALLOC_GROW(prune->path, prune->nr + 1, prune->alloc); |
4da5af31 | 1646 | prune->path[prune->nr++] = xstrdup(sb->buf); |
60da8b15 | 1647 | } |
60da8b15 JH |
1648 | } |
1649 | ||
4da5af31 JH |
1650 | static void read_revisions_from_stdin(struct rev_info *revs, |
1651 | struct cmdline_pathspec *prune) | |
1fc561d1 | 1652 | { |
63d564b3 | 1653 | struct strbuf sb; |
60da8b15 | 1654 | int seen_dashdash = 0; |
4c30d504 JK |
1655 | int save_warning; |
1656 | ||
1657 | save_warning = warn_on_object_refname_ambiguity; | |
1658 | warn_on_object_refname_ambiguity = 0; | |
1fc561d1 | 1659 | |
63d564b3 JH |
1660 | strbuf_init(&sb, 1000); |
1661 | while (strbuf_getwholeline(&sb, stdin, '\n') != EOF) { | |
1662 | int len = sb.len; | |
1663 | if (len && sb.buf[len - 1] == '\n') | |
1664 | sb.buf[--len] = '\0'; | |
1fc561d1 AB |
1665 | if (!len) |
1666 | break; | |
60da8b15 JH |
1667 | if (sb.buf[0] == '-') { |
1668 | if (len == 2 && sb.buf[1] == '-') { | |
1669 | seen_dashdash = 1; | |
1670 | break; | |
1671 | } | |
1fc561d1 | 1672 | die("options not supported in --stdin mode"); |
60da8b15 | 1673 | } |
31faeb20 | 1674 | if (handle_revision_arg(sb.buf, revs, 0, |
70d26c6e | 1675 | REVARG_CANNOT_BE_FILENAME)) |
63d564b3 | 1676 | die("bad revision '%s'", sb.buf); |
1fc561d1 | 1677 | } |
60da8b15 JH |
1678 | if (seen_dashdash) |
1679 | read_pathspec_from_stdin(revs, &sb, prune); | |
4c30d504 | 1680 | |
63d564b3 | 1681 | strbuf_release(&sb); |
4c30d504 | 1682 | warn_on_object_refname_ambiguity = save_warning; |
1fc561d1 AB |
1683 | } |
1684 | ||
2d10c555 | 1685 | static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what) |
bd95fcd3 | 1686 | { |
0843acfd | 1687 | append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what); |
2d10c555 JH |
1688 | } |
1689 | ||
a4d7d2c6 | 1690 | static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern) |
2d10c555 | 1691 | { |
a4d7d2c6 | 1692 | append_header_grep_pattern(&revs->grep_filter, field, pattern); |
bd95fcd3 JH |
1693 | } |
1694 | ||
1695 | static void add_message_grep(struct rev_info *revs, const char *pattern) | |
1696 | { | |
2d10c555 | 1697 | add_grep(revs, pattern, GREP_PATTERN_BODY); |
bd95fcd3 JH |
1698 | } |
1699 | ||
6b61ec05 PH |
1700 | static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv, |
1701 | int *unkc, const char **unkv) | |
02e54220 PH |
1702 | { |
1703 | const char *arg = argv[0]; | |
7d7b86f7 MM |
1704 | const char *optarg; |
1705 | int argcount; | |
02e54220 PH |
1706 | |
1707 | /* pseudo revision arguments */ | |
1708 | if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") || | |
1709 | !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") || | |
1710 | !strcmp(arg, "--reflog") || !strcmp(arg, "--not") || | |
ad3f9a71 | 1711 | !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") || |
59556548 | 1712 | !strcmp(arg, "--bisect") || starts_with(arg, "--glob=") || |
4fe10219 | 1713 | !strcmp(arg, "--indexed-objects") || |
07768e03 | 1714 | starts_with(arg, "--exclude=") || |
59556548 CC |
1715 | starts_with(arg, "--branches=") || starts_with(arg, "--tags=") || |
1716 | starts_with(arg, "--remotes=") || starts_with(arg, "--no-walk=")) | |
02e54220 PH |
1717 | { |
1718 | unkv[(*unkc)++] = arg; | |
0fe8c138 | 1719 | return 1; |
02e54220 PH |
1720 | } |
1721 | ||
7d7b86f7 MM |
1722 | if ((argcount = parse_long_opt("max-count", argv, &optarg))) { |
1723 | revs->max_count = atoi(optarg); | |
5853caec | 1724 | revs->no_walk = 0; |
7d7b86f7 MM |
1725 | return argcount; |
1726 | } else if ((argcount = parse_long_opt("skip", argv, &optarg))) { | |
1727 | revs->skip_count = atoi(optarg); | |
1728 | return argcount; | |
02e54220 | 1729 | } else if ((*arg == '-') && isdigit(arg[1])) { |
e3fa568c JH |
1730 | /* accept -<digit>, like traditional "head" */ |
1731 | if (strtol_i(arg + 1, 10, &revs->max_count) < 0 || | |
1732 | revs->max_count < 0) | |
1733 | die("'%s': not a non-negative integer", arg + 1); | |
5853caec | 1734 | revs->no_walk = 0; |
02e54220 PH |
1735 | } else if (!strcmp(arg, "-n")) { |
1736 | if (argc <= 1) | |
1737 | return error("-n requires an argument"); | |
1738 | revs->max_count = atoi(argv[1]); | |
5853caec | 1739 | revs->no_walk = 0; |
02e54220 | 1740 | return 2; |
59556548 | 1741 | } else if (starts_with(arg, "-n")) { |
02e54220 | 1742 | revs->max_count = atoi(arg + 2); |
5853caec | 1743 | revs->no_walk = 0; |
7d7b86f7 MM |
1744 | } else if ((argcount = parse_long_opt("max-age", argv, &optarg))) { |
1745 | revs->max_age = atoi(optarg); | |
1746 | return argcount; | |
1747 | } else if ((argcount = parse_long_opt("since", argv, &optarg))) { | |
1748 | revs->max_age = approxidate(optarg); | |
1749 | return argcount; | |
1750 | } else if ((argcount = parse_long_opt("after", argv, &optarg))) { | |
1751 | revs->max_age = approxidate(optarg); | |
1752 | return argcount; | |
1753 | } else if ((argcount = parse_long_opt("min-age", argv, &optarg))) { | |
1754 | revs->min_age = atoi(optarg); | |
1755 | return argcount; | |
1756 | } else if ((argcount = parse_long_opt("before", argv, &optarg))) { | |
1757 | revs->min_age = approxidate(optarg); | |
1758 | return argcount; | |
1759 | } else if ((argcount = parse_long_opt("until", argv, &optarg))) { | |
1760 | revs->min_age = approxidate(optarg); | |
1761 | return argcount; | |
02e54220 PH |
1762 | } else if (!strcmp(arg, "--first-parent")) { |
1763 | revs->first_parent_only = 1; | |
ebdc94f3 JH |
1764 | } else if (!strcmp(arg, "--ancestry-path")) { |
1765 | revs->ancestry_path = 1; | |
cb7529e1 | 1766 | revs->simplify_history = 0; |
ebdc94f3 | 1767 | revs->limited = 1; |
02e54220 PH |
1768 | } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) { |
1769 | init_reflog_walk(&revs->reflog_info); | |
1770 | } else if (!strcmp(arg, "--default")) { | |
1771 | if (argc <= 1) | |
1772 | return error("bad --default argument"); | |
1773 | revs->def = argv[1]; | |
1774 | return 2; | |
1775 | } else if (!strcmp(arg, "--merge")) { | |
1776 | revs->show_merge = 1; | |
1777 | } else if (!strcmp(arg, "--topo-order")) { | |
08f704f2 | 1778 | revs->sort_order = REV_SORT_IN_GRAPH_ORDER; |
02e54220 | 1779 | revs->topo_order = 1; |
6546b593 JH |
1780 | } else if (!strcmp(arg, "--simplify-merges")) { |
1781 | revs->simplify_merges = 1; | |
a52f0071 | 1782 | revs->topo_order = 1; |
6546b593 JH |
1783 | revs->rewrite_parents = 1; |
1784 | revs->simplify_history = 0; | |
1785 | revs->limited = 1; | |
78892e32 LT |
1786 | } else if (!strcmp(arg, "--simplify-by-decoration")) { |
1787 | revs->simplify_merges = 1; | |
a52f0071 | 1788 | revs->topo_order = 1; |
78892e32 LT |
1789 | revs->rewrite_parents = 1; |
1790 | revs->simplify_history = 0; | |
1791 | revs->simplify_by_decoration = 1; | |
1792 | revs->limited = 1; | |
1793 | revs->prune = 1; | |
33e7018c | 1794 | load_ref_decorations(DECORATE_SHORT_REFS); |
02e54220 | 1795 | } else if (!strcmp(arg, "--date-order")) { |
08f704f2 | 1796 | revs->sort_order = REV_SORT_BY_COMMIT_DATE; |
02e54220 | 1797 | revs->topo_order = 1; |
81c6b38b JH |
1798 | } else if (!strcmp(arg, "--author-date-order")) { |
1799 | revs->sort_order = REV_SORT_BY_AUTHOR_DATE; | |
02e54220 | 1800 | revs->topo_order = 1; |
59556548 | 1801 | } else if (starts_with(arg, "--early-output")) { |
02e54220 PH |
1802 | int count = 100; |
1803 | switch (arg[14]) { | |
1804 | case '=': | |
1805 | count = atoi(arg+15); | |
1806 | /* Fallthrough */ | |
1807 | case 0: | |
1808 | revs->topo_order = 1; | |
1809 | revs->early_output = count; | |
1810 | } | |
1811 | } else if (!strcmp(arg, "--parents")) { | |
1812 | revs->rewrite_parents = 1; | |
1813 | revs->print_parents = 1; | |
1814 | } else if (!strcmp(arg, "--dense")) { | |
1815 | revs->dense = 1; | |
1816 | } else if (!strcmp(arg, "--sparse")) { | |
1817 | revs->dense = 0; | |
1818 | } else if (!strcmp(arg, "--show-all")) { | |
1819 | revs->show_all = 1; | |
1820 | } else if (!strcmp(arg, "--remove-empty")) { | |
1821 | revs->remove_empty_trees = 1; | |
b8e8db28 | 1822 | } else if (!strcmp(arg, "--merges")) { |
ad5aeede | 1823 | revs->min_parents = 2; |
02e54220 | 1824 | } else if (!strcmp(arg, "--no-merges")) { |
ad5aeede | 1825 | revs->max_parents = 1; |
59556548 | 1826 | } else if (starts_with(arg, "--min-parents=")) { |
ad5aeede | 1827 | revs->min_parents = atoi(arg+14); |
59556548 | 1828 | } else if (starts_with(arg, "--no-min-parents")) { |
ad5aeede | 1829 | revs->min_parents = 0; |
59556548 | 1830 | } else if (starts_with(arg, "--max-parents=")) { |
ad5aeede | 1831 | revs->max_parents = atoi(arg+14); |
59556548 | 1832 | } else if (starts_with(arg, "--no-max-parents")) { |
ad5aeede | 1833 | revs->max_parents = -1; |
02e54220 PH |
1834 | } else if (!strcmp(arg, "--boundary")) { |
1835 | revs->boundary = 1; | |
1836 | } else if (!strcmp(arg, "--left-right")) { | |
1837 | revs->left_right = 1; | |
60adf7d7 | 1838 | } else if (!strcmp(arg, "--left-only")) { |
24852d91 | 1839 | if (revs->right_only) |
94f605ec MG |
1840 | die("--left-only is incompatible with --right-only" |
1841 | " or --cherry"); | |
60adf7d7 MG |
1842 | revs->left_only = 1; |
1843 | } else if (!strcmp(arg, "--right-only")) { | |
24852d91 JH |
1844 | if (revs->left_only) |
1845 | die("--right-only is incompatible with --left-only"); | |
60adf7d7 | 1846 | revs->right_only = 1; |
94f605ec MG |
1847 | } else if (!strcmp(arg, "--cherry")) { |
1848 | if (revs->left_only) | |
1849 | die("--cherry is incompatible with --left-only"); | |
1850 | revs->cherry_mark = 1; | |
1851 | revs->right_only = 1; | |
ad5aeede | 1852 | revs->max_parents = 1; |
94f605ec | 1853 | revs->limited = 1; |
f69c5018 TR |
1854 | } else if (!strcmp(arg, "--count")) { |
1855 | revs->count = 1; | |
adbbb31e MG |
1856 | } else if (!strcmp(arg, "--cherry-mark")) { |
1857 | if (revs->cherry_pick) | |
1858 | die("--cherry-mark is incompatible with --cherry-pick"); | |
1859 | revs->cherry_mark = 1; | |
1860 | revs->limited = 1; /* needs limit_list() */ | |
02e54220 | 1861 | } else if (!strcmp(arg, "--cherry-pick")) { |
adbbb31e MG |
1862 | if (revs->cherry_mark) |
1863 | die("--cherry-pick is incompatible with --cherry-mark"); | |
02e54220 PH |
1864 | revs->cherry_pick = 1; |
1865 | revs->limited = 1; | |
1866 | } else if (!strcmp(arg, "--objects")) { | |
1867 | revs->tag_objects = 1; | |
1868 | revs->tree_objects = 1; | |
1869 | revs->blob_objects = 1; | |
1870 | } else if (!strcmp(arg, "--objects-edge")) { | |
1871 | revs->tag_objects = 1; | |
1872 | revs->tree_objects = 1; | |
1873 | revs->blob_objects = 1; | |
1874 | revs->edge_hint = 1; | |
1684c1b2 | 1875 | } else if (!strcmp(arg, "--objects-edge-aggressive")) { |
1876 | revs->tag_objects = 1; | |
1877 | revs->tree_objects = 1; | |
1878 | revs->blob_objects = 1; | |
1879 | revs->edge_hint = 1; | |
1880 | revs->edge_hint_aggressive = 1; | |
5a48d240 JH |
1881 | } else if (!strcmp(arg, "--verify-objects")) { |
1882 | revs->tag_objects = 1; | |
1883 | revs->tree_objects = 1; | |
1884 | revs->blob_objects = 1; | |
1885 | revs->verify_objects = 1; | |
02e54220 PH |
1886 | } else if (!strcmp(arg, "--unpacked")) { |
1887 | revs->unpacked = 1; | |
59556548 | 1888 | } else if (starts_with(arg, "--unpacked=")) { |
03a9683d | 1889 | die("--unpacked=<packfile> no longer supported."); |
02e54220 PH |
1890 | } else if (!strcmp(arg, "-r")) { |
1891 | revs->diff = 1; | |
1892 | DIFF_OPT_SET(&revs->diffopt, RECURSIVE); | |
1893 | } else if (!strcmp(arg, "-t")) { | |
1894 | revs->diff = 1; | |
1895 | DIFF_OPT_SET(&revs->diffopt, RECURSIVE); | |
1896 | DIFF_OPT_SET(&revs->diffopt, TREE_IN_RECURSIVE); | |
1897 | } else if (!strcmp(arg, "-m")) { | |
1898 | revs->ignore_merges = 0; | |
1899 | } else if (!strcmp(arg, "-c")) { | |
1900 | revs->diff = 1; | |
1901 | revs->dense_combined_merges = 0; | |
1902 | revs->combine_merges = 1; | |
1903 | } else if (!strcmp(arg, "--cc")) { | |
1904 | revs->diff = 1; | |
1905 | revs->dense_combined_merges = 1; | |
1906 | revs->combine_merges = 1; | |
1907 | } else if (!strcmp(arg, "-v")) { | |
1908 | revs->verbose_header = 1; | |
1909 | } else if (!strcmp(arg, "--pretty")) { | |
1910 | revs->verbose_header = 1; | |
66b2ed09 | 1911 | revs->pretty_given = 1; |
ae18165f | 1912 | get_commit_format(NULL, revs); |
59556548 | 1913 | } else if (starts_with(arg, "--pretty=") || starts_with(arg, "--format=")) { |
7d7b86f7 MM |
1914 | /* |
1915 | * Detached form ("--pretty X" as opposed to "--pretty=X") | |
1916 | * not allowed, since the argument is optional. | |
1917 | */ | |
02e54220 | 1918 | revs->verbose_header = 1; |
66b2ed09 | 1919 | revs->pretty_given = 1; |
02e54220 | 1920 | get_commit_format(arg+9, revs); |
7249e912 | 1921 | } else if (!strcmp(arg, "--show-notes") || !strcmp(arg, "--notes")) { |
66b2ed09 JH |
1922 | revs->show_notes = 1; |
1923 | revs->show_notes_given = 1; | |
3a03cf6b | 1924 | revs->notes_opt.use_default_notes = 1; |
0c37f1fc JH |
1925 | } else if (!strcmp(arg, "--show-signature")) { |
1926 | revs->show_signature = 1; | |
1b32dece NTND |
1927 | } else if (!strcmp(arg, "--show-linear-break") || |
1928 | starts_with(arg, "--show-linear-break=")) { | |
1929 | if (starts_with(arg, "--show-linear-break=")) | |
1930 | revs->break_bar = xstrdup(arg + 20); | |
1931 | else | |
1932 | revs->break_bar = " .........."; | |
1933 | revs->track_linear = 1; | |
1934 | revs->track_first_time = 1; | |
59556548 CC |
1935 | } else if (starts_with(arg, "--show-notes=") || |
1936 | starts_with(arg, "--notes=")) { | |
894a9d33 TR |
1937 | struct strbuf buf = STRBUF_INIT; |
1938 | revs->show_notes = 1; | |
1939 | revs->show_notes_given = 1; | |
59556548 | 1940 | if (starts_with(arg, "--show-notes")) { |
7249e912 JK |
1941 | if (revs->notes_opt.use_default_notes < 0) |
1942 | revs->notes_opt.use_default_notes = 1; | |
1943 | strbuf_addstr(&buf, arg+13); | |
1944 | } | |
1945 | else | |
1946 | strbuf_addstr(&buf, arg+8); | |
c063f0a9 | 1947 | expand_notes_ref(&buf); |
304cc11c | 1948 | string_list_append(&revs->notes_opt.extra_notes_refs, |
1d2f80fa | 1949 | strbuf_detach(&buf, NULL)); |
66b2ed09 JH |
1950 | } else if (!strcmp(arg, "--no-notes")) { |
1951 | revs->show_notes = 0; | |
1952 | revs->show_notes_given = 1; | |
92e0d425 JK |
1953 | revs->notes_opt.use_default_notes = -1; |
1954 | /* we have been strdup'ing ourselves, so trick | |
1955 | * string_list into free()ing strings */ | |
1956 | revs->notes_opt.extra_notes_refs.strdup_strings = 1; | |
1957 | string_list_clear(&revs->notes_opt.extra_notes_refs, 0); | |
1958 | revs->notes_opt.extra_notes_refs.strdup_strings = 0; | |
894a9d33 TR |
1959 | } else if (!strcmp(arg, "--standard-notes")) { |
1960 | revs->show_notes_given = 1; | |
3a03cf6b | 1961 | revs->notes_opt.use_default_notes = 1; |
894a9d33 | 1962 | } else if (!strcmp(arg, "--no-standard-notes")) { |
3a03cf6b | 1963 | revs->notes_opt.use_default_notes = 0; |
de84accc NS |
1964 | } else if (!strcmp(arg, "--oneline")) { |
1965 | revs->verbose_header = 1; | |
1966 | get_commit_format("oneline", revs); | |
7dccadf3 | 1967 | revs->pretty_given = 1; |
de84accc | 1968 | revs->abbrev_commit = 1; |
02e54220 PH |
1969 | } else if (!strcmp(arg, "--graph")) { |
1970 | revs->topo_order = 1; | |
1971 | revs->rewrite_parents = 1; | |
1972 | revs->graph = graph_init(revs); | |
1973 | } else if (!strcmp(arg, "--root")) { | |
1974 | revs->show_root_diff = 1; | |
1975 | } else if (!strcmp(arg, "--no-commit-id")) { | |
1976 | revs->no_commit_id = 1; | |
1977 | } else if (!strcmp(arg, "--always")) { | |
1978 | revs->always_show_header = 1; | |
1979 | } else if (!strcmp(arg, "--no-abbrev")) { | |
1980 | revs->abbrev = 0; | |
1981 | } else if (!strcmp(arg, "--abbrev")) { | |
1982 | revs->abbrev = DEFAULT_ABBREV; | |
59556548 | 1983 | } else if (starts_with(arg, "--abbrev=")) { |
02e54220 PH |
1984 | revs->abbrev = strtoul(arg + 9, NULL, 10); |
1985 | if (revs->abbrev < MINIMUM_ABBREV) | |
1986 | revs->abbrev = MINIMUM_ABBREV; | |
1987 | else if (revs->abbrev > 40) | |
1988 | revs->abbrev = 40; | |
1989 | } else if (!strcmp(arg, "--abbrev-commit")) { | |
1990 | revs->abbrev_commit = 1; | |
0c47695a JS |
1991 | revs->abbrev_commit_given = 1; |
1992 | } else if (!strcmp(arg, "--no-abbrev-commit")) { | |
1993 | revs->abbrev_commit = 0; | |
02e54220 PH |
1994 | } else if (!strcmp(arg, "--full-diff")) { |
1995 | revs->diff = 1; | |
1996 | revs->full_diff = 1; | |
1997 | } else if (!strcmp(arg, "--full-history")) { | |
1998 | revs->simplify_history = 0; | |
1999 | } else if (!strcmp(arg, "--relative-date")) { | |
2000 | revs->date_mode = DATE_RELATIVE; | |
f4ea32f0 | 2001 | revs->date_mode_explicit = 1; |
7d7b86f7 MM |
2002 | } else if ((argcount = parse_long_opt("date", argv, &optarg))) { |
2003 | revs->date_mode = parse_date_format(optarg); | |
f4ea32f0 | 2004 | revs->date_mode_explicit = 1; |
7d7b86f7 | 2005 | return argcount; |
02e54220 PH |
2006 | } else if (!strcmp(arg, "--log-size")) { |
2007 | revs->show_log_size = 1; | |
2008 | } | |
2009 | /* | |
2010 | * Grepping the commit log | |
2011 | */ | |
7d7b86f7 MM |
2012 | else if ((argcount = parse_long_opt("author", argv, &optarg))) { |
2013 | add_header_grep(revs, GREP_HEADER_AUTHOR, optarg); | |
2014 | return argcount; | |
2015 | } else if ((argcount = parse_long_opt("committer", argv, &optarg))) { | |
2016 | add_header_grep(revs, GREP_HEADER_COMMITTER, optarg); | |
2017 | return argcount; | |
72fd13f7 NTND |
2018 | } else if ((argcount = parse_long_opt("grep-reflog", argv, &optarg))) { |
2019 | add_header_grep(revs, GREP_HEADER_REFLOG, optarg); | |
2020 | return argcount; | |
7d7b86f7 MM |
2021 | } else if ((argcount = parse_long_opt("grep", argv, &optarg))) { |
2022 | add_message_grep(revs, optarg); | |
2023 | return argcount; | |
17bf35a3 JH |
2024 | } else if (!strcmp(arg, "--grep-debug")) { |
2025 | revs->grep_filter.debug = 1; | |
727b6fc3 JH |
2026 | } else if (!strcmp(arg, "--basic-regexp")) { |
2027 | grep_set_pattern_type_option(GREP_PATTERN_TYPE_BRE, &revs->grep_filter); | |
02e54220 | 2028 | } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) { |
34a4ae55 | 2029 | grep_set_pattern_type_option(GREP_PATTERN_TYPE_ERE, &revs->grep_filter); |
02e54220 | 2030 | } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) { |
0843acfd | 2031 | revs->grep_filter.regflags |= REG_ICASE; |
accccde4 | 2032 | DIFF_OPT_SET(&revs->diffopt, PICKAXE_IGNORE_CASE); |
02e54220 | 2033 | } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) { |
34a4ae55 | 2034 | grep_set_pattern_type_option(GREP_PATTERN_TYPE_FIXED, &revs->grep_filter); |
727b6fc3 JH |
2035 | } else if (!strcmp(arg, "--perl-regexp")) { |
2036 | grep_set_pattern_type_option(GREP_PATTERN_TYPE_PCRE, &revs->grep_filter); | |
02e54220 | 2037 | } else if (!strcmp(arg, "--all-match")) { |
0843acfd | 2038 | revs->grep_filter.all_match = 1; |
22dfa8a2 CJ |
2039 | } else if (!strcmp(arg, "--invert-grep")) { |
2040 | revs->invert_grep = 1; | |
7d7b86f7 MM |
2041 | } else if ((argcount = parse_long_opt("encoding", argv, &optarg))) { |
2042 | if (strcmp(optarg, "none")) | |
2043 | git_log_output_encoding = xstrdup(optarg); | |
02e54220 PH |
2044 | else |
2045 | git_log_output_encoding = ""; | |
7d7b86f7 | 2046 | return argcount; |
02e54220 PH |
2047 | } else if (!strcmp(arg, "--reverse")) { |
2048 | revs->reverse ^= 1; | |
2049 | } else if (!strcmp(arg, "--children")) { | |
2050 | revs->children.name = "children"; | |
2051 | revs->limited = 1; | |
cc243c3c JH |
2052 | } else if (!strcmp(arg, "--ignore-missing")) { |
2053 | revs->ignore_missing = 1; | |
02e54220 PH |
2054 | } else { |
2055 | int opts = diff_opt_parse(&revs->diffopt, argv, argc); | |
2056 | if (!opts) | |
2057 | unkv[(*unkc)++] = arg; | |
2058 | return opts; | |
2059 | } | |
1b32dece NTND |
2060 | if (revs->graph && revs->track_linear) |
2061 | die("--show-linear-break and --graph are incompatible"); | |
02e54220 PH |
2062 | |
2063 | return 1; | |
2064 | } | |
2065 | ||
6b61ec05 PH |
2066 | void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx, |
2067 | const struct option *options, | |
2068 | const char * const usagestr[]) | |
2069 | { | |
2070 | int n = handle_revision_opt(revs, ctx->argc, ctx->argv, | |
2071 | &ctx->cpidx, ctx->out); | |
2072 | if (n <= 0) { | |
2073 | error("unknown option `%s'", ctx->argv[0]); | |
2074 | usage_with_options(usagestr, options); | |
2075 | } | |
2076 | ctx->argv += n; | |
2077 | ctx->argc -= n; | |
2078 | } | |
2079 | ||
9ef6aeb0 | 2080 | static int for_each_bad_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data) |
ad3f9a71 | 2081 | { |
9ef6aeb0 | 2082 | return for_each_ref_in_submodule(submodule, "refs/bisect/bad", fn, cb_data); |
ad3f9a71 LT |
2083 | } |
2084 | ||
9ef6aeb0 | 2085 | static int for_each_good_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data) |
ad3f9a71 | 2086 | { |
9ef6aeb0 | 2087 | return for_each_ref_in_submodule(submodule, "refs/bisect/good", fn, cb_data); |
ad3f9a71 LT |
2088 | } |
2089 | ||
f6aca0dc JN |
2090 | static int handle_revision_pseudo_opt(const char *submodule, |
2091 | struct rev_info *revs, | |
2092 | int argc, const char **argv, int *flags) | |
2093 | { | |
2094 | const char *arg = argv[0]; | |
2095 | const char *optarg; | |
2096 | int argcount; | |
2097 | ||
0fc63ec4 JN |
2098 | /* |
2099 | * NOTE! | |
2100 | * | |
2101 | * Commands like "git shortlog" will not accept the options below | |
2102 | * unless parse_revision_opt queues them (as opposed to erroring | |
2103 | * out). | |
2104 | * | |
2105 | * When implementing your new pseudo-option, remember to | |
2106 | * register it in the list at the top of handle_revision_opt. | |
2107 | */ | |
f6aca0dc JN |
2108 | if (!strcmp(arg, "--all")) { |
2109 | handle_refs(submodule, revs, *flags, for_each_ref_submodule); | |
2110 | handle_refs(submodule, revs, *flags, head_ref_submodule); | |
ff32d342 | 2111 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc JN |
2112 | } else if (!strcmp(arg, "--branches")) { |
2113 | handle_refs(submodule, revs, *flags, for_each_branch_ref_submodule); | |
ff32d342 | 2114 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc JN |
2115 | } else if (!strcmp(arg, "--bisect")) { |
2116 | handle_refs(submodule, revs, *flags, for_each_bad_bisect_ref); | |
7f34a46f | 2117 | handle_refs(submodule, revs, *flags ^ (UNINTERESTING | BOTTOM), for_each_good_bisect_ref); |
f6aca0dc JN |
2118 | revs->bisect = 1; |
2119 | } else if (!strcmp(arg, "--tags")) { | |
2120 | handle_refs(submodule, revs, *flags, for_each_tag_ref_submodule); | |
ff32d342 | 2121 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc JN |
2122 | } else if (!strcmp(arg, "--remotes")) { |
2123 | handle_refs(submodule, revs, *flags, for_each_remote_ref_submodule); | |
ff32d342 | 2124 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc JN |
2125 | } else if ((argcount = parse_long_opt("glob", argv, &optarg))) { |
2126 | struct all_refs_cb cb; | |
2127 | init_all_refs_cb(&cb, revs, *flags); | |
a217dcbd | 2128 | for_each_glob_ref(handle_one_ref, optarg, &cb); |
ff32d342 | 2129 | clear_ref_exclusion(&revs->ref_excludes); |
e7b432c5 JH |
2130 | return argcount; |
2131 | } else if ((argcount = parse_long_opt("exclude", argv, &optarg))) { | |
ff32d342 | 2132 | add_ref_exclusion(&revs->ref_excludes, optarg); |
f6aca0dc | 2133 | return argcount; |
59556548 | 2134 | } else if (starts_with(arg, "--branches=")) { |
f6aca0dc JN |
2135 | struct all_refs_cb cb; |
2136 | init_all_refs_cb(&cb, revs, *flags); | |
a217dcbd | 2137 | for_each_glob_ref_in(handle_one_ref, arg + 11, "refs/heads/", &cb); |
ff32d342 | 2138 | clear_ref_exclusion(&revs->ref_excludes); |
59556548 | 2139 | } else if (starts_with(arg, "--tags=")) { |
f6aca0dc JN |
2140 | struct all_refs_cb cb; |
2141 | init_all_refs_cb(&cb, revs, *flags); | |
a217dcbd | 2142 | for_each_glob_ref_in(handle_one_ref, arg + 7, "refs/tags/", &cb); |
ff32d342 | 2143 | clear_ref_exclusion(&revs->ref_excludes); |
59556548 | 2144 | } else if (starts_with(arg, "--remotes=")) { |
f6aca0dc JN |
2145 | struct all_refs_cb cb; |
2146 | init_all_refs_cb(&cb, revs, *flags); | |
a217dcbd | 2147 | for_each_glob_ref_in(handle_one_ref, arg + 10, "refs/remotes/", &cb); |
ff32d342 | 2148 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc | 2149 | } else if (!strcmp(arg, "--reflog")) { |
718ccc97 | 2150 | add_reflogs_to_pending(revs, *flags); |
4fe10219 JK |
2151 | } else if (!strcmp(arg, "--indexed-objects")) { |
2152 | add_index_objects_to_pending(revs, *flags); | |
f6aca0dc | 2153 | } else if (!strcmp(arg, "--not")) { |
7f34a46f | 2154 | *flags ^= UNINTERESTING | BOTTOM; |
f6aca0dc | 2155 | } else if (!strcmp(arg, "--no-walk")) { |
ca92e59e | 2156 | revs->no_walk = REVISION_WALK_NO_WALK_SORTED; |
59556548 | 2157 | } else if (starts_with(arg, "--no-walk=")) { |
ca92e59e MZ |
2158 | /* |
2159 | * Detached form ("--no-walk X" as opposed to "--no-walk=X") | |
2160 | * not allowed, since the argument is optional. | |
2161 | */ | |
2162 | if (!strcmp(arg + 10, "sorted")) | |
2163 | revs->no_walk = REVISION_WALK_NO_WALK_SORTED; | |
2164 | else if (!strcmp(arg + 10, "unsorted")) | |
2165 | revs->no_walk = REVISION_WALK_NO_WALK_UNSORTED; | |
2166 | else | |
2167 | return error("invalid argument to --no-walk"); | |
f6aca0dc JN |
2168 | } else if (!strcmp(arg, "--do-walk")) { |
2169 | revs->no_walk = 0; | |
2170 | } else { | |
2171 | return 0; | |
2172 | } | |
2173 | ||
2174 | return 1; | |
2175 | } | |
2176 | ||
ae563542 LT |
2177 | /* |
2178 | * Parse revision information, filling in the "rev_info" structure, | |
2179 | * and removing the used arguments from the argument list. | |
2180 | * | |
765ac8ec LT |
2181 | * Returns the number of arguments left that weren't recognized |
2182 | * (which are also moved to the head of the argument list) | |
ae563542 | 2183 | */ |
32962c9b | 2184 | int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct setup_revision_opt *opt) |
ae563542 | 2185 | { |
8e676e8b | 2186 | int i, flags, left, seen_dashdash, read_from_stdin, got_rev_arg = 0, revarg_opt; |
4da5af31 | 2187 | struct cmdline_pathspec prune_data; |
9ef6aeb0 HV |
2188 | const char *submodule = NULL; |
2189 | ||
4da5af31 | 2190 | memset(&prune_data, 0, sizeof(prune_data)); |
9ef6aeb0 HV |
2191 | if (opt) |
2192 | submodule = opt->submodule; | |
ae563542 | 2193 | |
ae563542 | 2194 | /* First, search for "--" */ |
6d5b93f2 | 2195 | if (opt && opt->assume_dashdash) { |
ae563542 | 2196 | seen_dashdash = 1; |
6d5b93f2 CB |
2197 | } else { |
2198 | seen_dashdash = 0; | |
2199 | for (i = 1; i < argc; i++) { | |
2200 | const char *arg = argv[i]; | |
2201 | if (strcmp(arg, "--")) | |
2202 | continue; | |
2203 | argv[i] = NULL; | |
2204 | argc = i; | |
2205 | if (argv[i + 1]) | |
2206 | append_prune_data(&prune_data, argv + i + 1); | |
2207 | seen_dashdash = 1; | |
2208 | break; | |
2209 | } | |
ae563542 LT |
2210 | } |
2211 | ||
02e54220 PH |
2212 | /* Second, deal with arguments and options */ |
2213 | flags = 0; | |
d5f6b1d7 JH |
2214 | revarg_opt = opt ? opt->revarg_opt : 0; |
2215 | if (seen_dashdash) | |
2216 | revarg_opt |= REVARG_CANNOT_BE_FILENAME; | |
8b3dce56 | 2217 | read_from_stdin = 0; |
02e54220 | 2218 | for (left = i = 1; i < argc; i++) { |
ae563542 | 2219 | const char *arg = argv[i]; |
ae563542 | 2220 | if (*arg == '-') { |
cd2bdc53 | 2221 | int opts; |
02e54220 | 2222 | |
f6aca0dc JN |
2223 | opts = handle_revision_pseudo_opt(submodule, |
2224 | revs, argc - i, argv + i, | |
2225 | &flags); | |
2226 | if (opts > 0) { | |
2227 | i += opts - 1; | |
8e64006e JS |
2228 | continue; |
2229 | } | |
f6aca0dc | 2230 | |
8b3dce56 JH |
2231 | if (!strcmp(arg, "--stdin")) { |
2232 | if (revs->disable_stdin) { | |
2233 | argv[left++] = arg; | |
2234 | continue; | |
2235 | } | |
2236 | if (read_from_stdin++) | |
2237 | die("--stdin given twice?"); | |
60da8b15 | 2238 | read_revisions_from_stdin(revs, &prune_data); |
8b3dce56 JH |
2239 | continue; |
2240 | } | |
2d10c555 | 2241 | |
02e54220 | 2242 | opts = handle_revision_opt(revs, argc - i, argv + i, &left, argv); |
cd2bdc53 | 2243 | if (opts > 0) { |
cd2bdc53 LT |
2244 | i += opts - 1; |
2245 | continue; | |
2246 | } | |
02e54220 PH |
2247 | if (opts < 0) |
2248 | exit(128); | |
ae563542 LT |
2249 | continue; |
2250 | } | |
ae563542 | 2251 | |
8e676e8b JH |
2252 | |
2253 | if (handle_revision_arg(arg, revs, flags, revarg_opt)) { | |
5d6f0935 JH |
2254 | int j; |
2255 | if (seen_dashdash || *arg == '^') | |
ae563542 LT |
2256 | die("bad revision '%s'", arg); |
2257 | ||
ea92f41f JH |
2258 | /* If we didn't have a "--": |
2259 | * (1) all filenames must exist; | |
2260 | * (2) all rev-args must not be interpretable | |
2261 | * as a valid filename. | |
2262 | * but the latter we have checked in the main loop. | |
2263 | */ | |
e23d0b4a | 2264 | for (j = i; j < argc; j++) |
023e37c3 | 2265 | verify_filename(revs->prefix, argv[j], j == i); |
e23d0b4a | 2266 | |
60da8b15 | 2267 | append_prune_data(&prune_data, argv + i); |
ae563542 LT |
2268 | break; |
2269 | } | |
8fcaca3f DO |
2270 | else |
2271 | got_rev_arg = 1; | |
ae563542 | 2272 | } |
5d6f0935 | 2273 | |
4da5af31 | 2274 | if (prune_data.nr) { |
93e7d672 JH |
2275 | /* |
2276 | * If we need to introduce the magic "a lone ':' means no | |
2277 | * pathspec whatsoever", here is the place to do so. | |
2278 | * | |
2279 | * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) { | |
2280 | * prune_data.nr = 0; | |
2281 | * prune_data.alloc = 0; | |
2282 | * free(prune_data.path); | |
2283 | * prune_data.path = NULL; | |
2284 | * } else { | |
2285 | * terminate prune_data.alloc with NULL and | |
2286 | * call init_pathspec() to set revs->prune_data here. | |
2287 | * } | |
2288 | */ | |
9e57ac55 | 2289 | ALLOC_GROW(prune_data.path, prune_data.nr + 1, prune_data.alloc); |
4da5af31 | 2290 | prune_data.path[prune_data.nr++] = NULL; |
0fdc2ae5 NTND |
2291 | parse_pathspec(&revs->prune_data, 0, 0, |
2292 | revs->prefix, prune_data.path); | |
4da5af31 | 2293 | } |
5486ef0e | 2294 | |
02e54220 | 2295 | if (revs->def == NULL) |
32962c9b | 2296 | revs->def = opt ? opt->def : NULL; |
b4490059 JH |
2297 | if (opt && opt->tweak) |
2298 | opt->tweak(revs, opt); | |
02e54220 | 2299 | if (revs->show_merge) |
ae3e5e1e | 2300 | prepare_show_merge(revs); |
8fcaca3f | 2301 | if (revs->def && !revs->pending.nr && !got_rev_arg) { |
ae563542 | 2302 | unsigned char sha1[20]; |
cd2bdc53 | 2303 | struct object *object; |
249c8f4a | 2304 | struct object_context oc; |
33bd598c | 2305 | if (get_sha1_with_context(revs->def, 0, sha1, &oc)) |
02e54220 PH |
2306 | die("bad default revision '%s'", revs->def); |
2307 | object = get_reference(revs, revs->def, sha1, 0); | |
249c8f4a | 2308 | add_pending_object_with_mode(revs, object, revs->def, oc.mode); |
ae563542 | 2309 | } |
8efdc326 | 2310 | |
b7bb760d LT |
2311 | /* Did the user ask for any diff output? Run the diff! */ |
2312 | if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT) | |
2313 | revs->diff = 1; | |
2314 | ||
0faf2da7 AL |
2315 | /* Pickaxe, diff-filter and rename following need diffs */ |
2316 | if (revs->diffopt.pickaxe || | |
2317 | revs->diffopt.filter || | |
2318 | DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES)) | |
b7bb760d LT |
2319 | revs->diff = 1; |
2320 | ||
9dad9d2e | 2321 | if (revs->topo_order) |
53069686 JH |
2322 | revs->limited = 1; |
2323 | ||
afe069d1 | 2324 | if (revs->prune_data.nr) { |
bd1928df | 2325 | copy_pathspec(&revs->pruning.pathspec, &revs->prune_data); |
750f7b66 | 2326 | /* Can't prune commits with rename following: the paths change.. */ |
8f67f8ae | 2327 | if (!DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES)) |
53b2c823 | 2328 | revs->prune = 1; |
cd2bdc53 | 2329 | if (!revs->full_diff) |
bd1928df NTND |
2330 | copy_pathspec(&revs->diffopt.pathspec, |
2331 | &revs->prune_data); | |
8efdc326 | 2332 | } |
b4490059 | 2333 | if (revs->combine_merges) |
cd2bdc53 | 2334 | revs->ignore_merges = 0; |
cd2bdc53 | 2335 | revs->diffopt.abbrev = revs->abbrev; |
12da1d1f TR |
2336 | |
2337 | if (revs->line_level_traverse) { | |
2338 | revs->limited = 1; | |
2339 | revs->topo_order = 1; | |
2340 | } | |
2341 | ||
28452655 | 2342 | diff_setup_done(&revs->diffopt); |
8efdc326 | 2343 | |
918d4e1c JH |
2344 | grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED, |
2345 | &revs->grep_filter); | |
0843acfd | 2346 | compile_grep_patterns(&revs->grep_filter); |
bd95fcd3 | 2347 | |
d56651c0 SP |
2348 | if (revs->reverse && revs->reflog_info) |
2349 | die("cannot combine --reverse with --walk-reflogs"); | |
8bb65883 | 2350 | if (revs->rewrite_parents && revs->children.name) |
f35f5603 | 2351 | die("cannot combine --parents and --children"); |
d56651c0 | 2352 | |
7fefda5c AS |
2353 | /* |
2354 | * Limitations on the graph functionality | |
2355 | */ | |
2356 | if (revs->reverse && revs->graph) | |
2357 | die("cannot combine --reverse with --graph"); | |
2358 | ||
2359 | if (revs->reflog_info && revs->graph) | |
2360 | die("cannot combine --walk-reflogs with --graph"); | |
695985f4 DJ |
2361 | if (revs->no_walk && revs->graph) |
2362 | die("cannot combine --no-walk with --graph"); | |
baa6378f JH |
2363 | if (!revs->reflog_info && revs->grep_filter.use_reflog_filter) |
2364 | die("cannot use --grep-reflog without --walk-reflogs"); | |
7fefda5c | 2365 | |
f88851c6 KD |
2366 | if (revs->first_parent_only && revs->bisect) |
2367 | die(_("--first-parent is incompatible with --bisect")); | |
2368 | ||
ae563542 LT |
2369 | return left; |
2370 | } | |
a4a88b2b | 2371 | |
f35f5603 JH |
2372 | static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child) |
2373 | { | |
2374 | struct commit_list *l = xcalloc(1, sizeof(*l)); | |
2375 | ||
2376 | l->item = child; | |
2377 | l->next = add_decoration(&revs->children, &parent->object, l); | |
2378 | } | |
2379 | ||
d0af663e | 2380 | static int remove_duplicate_parents(struct rev_info *revs, struct commit *commit) |
6546b593 | 2381 | { |
d0af663e | 2382 | struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object); |
6546b593 JH |
2383 | struct commit_list **pp, *p; |
2384 | int surviving_parents; | |
2385 | ||
2386 | /* Examine existing parents while marking ones we have seen... */ | |
2387 | pp = &commit->parents; | |
d0af663e | 2388 | surviving_parents = 0; |
6546b593 JH |
2389 | while ((p = *pp) != NULL) { |
2390 | struct commit *parent = p->item; | |
2391 | if (parent->object.flags & TMP_MARK) { | |
2392 | *pp = p->next; | |
d0af663e KB |
2393 | if (ts) |
2394 | compact_treesame(revs, commit, surviving_parents); | |
6546b593 JH |
2395 | continue; |
2396 | } | |
2397 | parent->object.flags |= TMP_MARK; | |
d0af663e | 2398 | surviving_parents++; |
6546b593 JH |
2399 | pp = &p->next; |
2400 | } | |
d0af663e | 2401 | /* clear the temporary mark */ |
6546b593 JH |
2402 | for (p = commit->parents; p; p = p->next) { |
2403 | p->item->object.flags &= ~TMP_MARK; | |
6546b593 | 2404 | } |
d0af663e | 2405 | /* no update_treesame() - removing duplicates can't affect TREESAME */ |
6546b593 JH |
2406 | return surviving_parents; |
2407 | } | |
2408 | ||
faf0156b JH |
2409 | struct merge_simplify_state { |
2410 | struct commit *simplified; | |
2411 | }; | |
2412 | ||
2413 | static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit) | |
2414 | { | |
2415 | struct merge_simplify_state *st; | |
2416 | ||
2417 | st = lookup_decoration(&revs->merge_simplification, &commit->object); | |
2418 | if (!st) { | |
2419 | st = xcalloc(1, sizeof(*st)); | |
2420 | add_decoration(&revs->merge_simplification, &commit->object, st); | |
2421 | } | |
2422 | return st; | |
2423 | } | |
2424 | ||
d0af663e KB |
2425 | static int mark_redundant_parents(struct rev_info *revs, struct commit *commit) |
2426 | { | |
2427 | struct commit_list *h = reduce_heads(commit->parents); | |
2428 | int i = 0, marked = 0; | |
2429 | struct commit_list *po, *pn; | |
2430 | ||
2431 | /* Want these for sanity-checking only */ | |
2432 | int orig_cnt = commit_list_count(commit->parents); | |
2433 | int cnt = commit_list_count(h); | |
2434 | ||
2435 | /* | |
2436 | * Not ready to remove items yet, just mark them for now, based | |
2437 | * on the output of reduce_heads(). reduce_heads outputs the reduced | |
2438 | * set in its original order, so this isn't too hard. | |
2439 | */ | |
2440 | po = commit->parents; | |
2441 | pn = h; | |
2442 | while (po) { | |
2443 | if (pn && po->item == pn->item) { | |
2444 | pn = pn->next; | |
2445 | i++; | |
2446 | } else { | |
2447 | po->item->object.flags |= TMP_MARK; | |
2448 | marked++; | |
2449 | } | |
2450 | po=po->next; | |
2451 | } | |
2452 | ||
2453 | if (i != cnt || cnt+marked != orig_cnt) | |
2454 | die("mark_redundant_parents %d %d %d %d", orig_cnt, cnt, i, marked); | |
2455 | ||
2456 | free_commit_list(h); | |
2457 | ||
2458 | return marked; | |
2459 | } | |
2460 | ||
143f1eaf KB |
2461 | static int mark_treesame_root_parents(struct rev_info *revs, struct commit *commit) |
2462 | { | |
2463 | struct commit_list *p; | |
2464 | int marked = 0; | |
2465 | ||
2466 | for (p = commit->parents; p; p = p->next) { | |
2467 | struct commit *parent = p->item; | |
2468 | if (!parent->parents && (parent->object.flags & TREESAME)) { | |
2469 | parent->object.flags |= TMP_MARK; | |
2470 | marked++; | |
2471 | } | |
2472 | } | |
2473 | ||
2474 | return marked; | |
2475 | } | |
2476 | ||
9c129eab KB |
2477 | /* |
2478 | * Awkward naming - this means one parent we are TREESAME to. | |
2479 | * cf mark_treesame_root_parents: root parents that are TREESAME (to an | |
2480 | * empty tree). Better name suggestions? | |
2481 | */ | |
2482 | static int leave_one_treesame_to_parent(struct rev_info *revs, struct commit *commit) | |
2483 | { | |
2484 | struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object); | |
2485 | struct commit *unmarked = NULL, *marked = NULL; | |
2486 | struct commit_list *p; | |
2487 | unsigned n; | |
2488 | ||
2489 | for (p = commit->parents, n = 0; p; p = p->next, n++) { | |
2490 | if (ts->treesame[n]) { | |
2491 | if (p->item->object.flags & TMP_MARK) { | |
2492 | if (!marked) | |
2493 | marked = p->item; | |
2494 | } else { | |
2495 | if (!unmarked) { | |
2496 | unmarked = p->item; | |
2497 | break; | |
2498 | } | |
2499 | } | |
2500 | } | |
2501 | } | |
2502 | ||
2503 | /* | |
2504 | * If we are TREESAME to a marked-for-deletion parent, but not to any | |
2505 | * unmarked parents, unmark the first TREESAME parent. This is the | |
2506 | * parent that the default simplify_history==1 scan would have followed, | |
2507 | * and it doesn't make sense to omit that path when asking for a | |
2508 | * simplified full history. Retaining it improves the chances of | |
2509 | * understanding odd missed merges that took an old version of a file. | |
2510 | * | |
2511 | * Example: | |
2512 | * | |
2513 | * I--------*X A modified the file, but mainline merge X used | |
2514 | * \ / "-s ours", so took the version from I. X is | |
2515 | * `-*A--' TREESAME to I and !TREESAME to A. | |
2516 | * | |
2517 | * Default log from X would produce "I". Without this check, | |
2518 | * --full-history --simplify-merges would produce "I-A-X", showing | |
2519 | * the merge commit X and that it changed A, but not making clear that | |
2520 | * it had just taken the I version. With this check, the topology above | |
2521 | * is retained. | |
2522 | * | |
2523 | * Note that it is possible that the simplification chooses a different | |
2524 | * TREESAME parent from the default, in which case this test doesn't | |
2525 | * activate, and we _do_ drop the default parent. Example: | |
2526 | * | |
2527 | * I------X A modified the file, but it was reverted in B, | |
2528 | * \ / meaning mainline merge X is TREESAME to both | |
2529 | * *A-*B parents. | |
2530 | * | |
2531 | * Default log would produce "I" by following the first parent; | |
2532 | * --full-history --simplify-merges will produce "I-A-B". But this is a | |
2533 | * reasonable result - it presents a logical full history leading from | |
2534 | * I to X, and X is not an important merge. | |
2535 | */ | |
2536 | if (!unmarked && marked) { | |
2537 | marked->object.flags &= ~TMP_MARK; | |
2538 | return 1; | |
2539 | } | |
2540 | ||
2541 | return 0; | |
2542 | } | |
2543 | ||
d0af663e KB |
2544 | static int remove_marked_parents(struct rev_info *revs, struct commit *commit) |
2545 | { | |
2546 | struct commit_list **pp, *p; | |
2547 | int nth_parent, removed = 0; | |
2548 | ||
2549 | pp = &commit->parents; | |
2550 | nth_parent = 0; | |
2551 | while ((p = *pp) != NULL) { | |
2552 | struct commit *parent = p->item; | |
2553 | if (parent->object.flags & TMP_MARK) { | |
2554 | parent->object.flags &= ~TMP_MARK; | |
2555 | *pp = p->next; | |
2556 | free(p); | |
2557 | removed++; | |
2558 | compact_treesame(revs, commit, nth_parent); | |
2559 | continue; | |
2560 | } | |
2561 | pp = &p->next; | |
2562 | nth_parent++; | |
2563 | } | |
2564 | ||
2565 | /* Removing parents can only increase TREESAMEness */ | |
2566 | if (removed && !(commit->object.flags & TREESAME)) | |
2567 | update_treesame(revs, commit); | |
2568 | ||
2569 | return nth_parent; | |
2570 | } | |
2571 | ||
faf0156b | 2572 | static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail) |
6546b593 JH |
2573 | { |
2574 | struct commit_list *p; | |
4d826608 | 2575 | struct commit *parent; |
faf0156b | 2576 | struct merge_simplify_state *st, *pst; |
6546b593 JH |
2577 | int cnt; |
2578 | ||
faf0156b JH |
2579 | st = locate_simplify_state(revs, commit); |
2580 | ||
6546b593 | 2581 | /* |
6546b593 JH |
2582 | * Have we handled this one? |
2583 | */ | |
faf0156b | 2584 | if (st->simplified) |
6546b593 JH |
2585 | return tail; |
2586 | ||
2587 | /* | |
2588 | * An UNINTERESTING commit simplifies to itself, so does a | |
2589 | * root commit. We do not rewrite parents of such commit | |
2590 | * anyway. | |
2591 | */ | |
2592 | if ((commit->object.flags & UNINTERESTING) || !commit->parents) { | |
faf0156b | 2593 | st->simplified = commit; |
6546b593 JH |
2594 | return tail; |
2595 | } | |
2596 | ||
2597 | /* | |
6e513ba3 JH |
2598 | * Do we know what commit all of our parents that matter |
2599 | * should be rewritten to? Otherwise we are not ready to | |
2600 | * rewrite this one yet. | |
6546b593 JH |
2601 | */ |
2602 | for (cnt = 0, p = commit->parents; p; p = p->next) { | |
faf0156b JH |
2603 | pst = locate_simplify_state(revs, p->item); |
2604 | if (!pst->simplified) { | |
6546b593 JH |
2605 | tail = &commit_list_insert(p->item, tail)->next; |
2606 | cnt++; | |
2607 | } | |
6e513ba3 JH |
2608 | if (revs->first_parent_only) |
2609 | break; | |
6546b593 | 2610 | } |
53030f8d JH |
2611 | if (cnt) { |
2612 | tail = &commit_list_insert(commit, tail)->next; | |
6546b593 | 2613 | return tail; |
53030f8d | 2614 | } |
6546b593 JH |
2615 | |
2616 | /* | |
d0af663e KB |
2617 | * Rewrite our list of parents. Note that this cannot |
2618 | * affect our TREESAME flags in any way - a commit is | |
2619 | * always TREESAME to its simplification. | |
6546b593 | 2620 | */ |
faf0156b JH |
2621 | for (p = commit->parents; p; p = p->next) { |
2622 | pst = locate_simplify_state(revs, p->item); | |
2623 | p->item = pst->simplified; | |
6e513ba3 JH |
2624 | if (revs->first_parent_only) |
2625 | break; | |
faf0156b | 2626 | } |
4b7f53da | 2627 | |
0290bf12 | 2628 | if (revs->first_parent_only) |
6e513ba3 | 2629 | cnt = 1; |
0290bf12 | 2630 | else |
d0af663e | 2631 | cnt = remove_duplicate_parents(revs, commit); |
6546b593 JH |
2632 | |
2633 | /* | |
2634 | * It is possible that we are a merge and one side branch | |
2635 | * does not have any commit that touches the given paths; | |
d0af663e KB |
2636 | * in such a case, the immediate parent from that branch |
2637 | * will be rewritten to be the merge base. | |
6546b593 JH |
2638 | * |
2639 | * o----X X: the commit we are looking at; | |
2640 | * / / o: a commit that touches the paths; | |
2641 | * ---o----' | |
2642 | * | |
143f1eaf KB |
2643 | * Further, a merge of an independent branch that doesn't |
2644 | * touch the path will reduce to a treesame root parent: | |
2645 | * | |
2646 | * ----o----X X: the commit we are looking at; | |
2647 | * / o: a commit that touches the paths; | |
2648 | * r r: a root commit not touching the paths | |
2649 | * | |
2650 | * Detect and simplify both cases. | |
6546b593 JH |
2651 | */ |
2652 | if (1 < cnt) { | |
d0af663e | 2653 | int marked = mark_redundant_parents(revs, commit); |
143f1eaf | 2654 | marked += mark_treesame_root_parents(revs, commit); |
9c129eab KB |
2655 | if (marked) |
2656 | marked -= leave_one_treesame_to_parent(revs, commit); | |
d0af663e KB |
2657 | if (marked) |
2658 | cnt = remove_marked_parents(revs, commit); | |
6546b593 JH |
2659 | } |
2660 | ||
2661 | /* | |
2662 | * A commit simplifies to itself if it is a root, if it is | |
2663 | * UNINTERESTING, if it touches the given paths, or if it is a | |
4d826608 | 2664 | * merge and its parents don't simplify to one relevant commit |
6546b593 JH |
2665 | * (the first two cases are already handled at the beginning of |
2666 | * this function). | |
2667 | * | |
4d826608 KB |
2668 | * Otherwise, it simplifies to what its sole relevant parent |
2669 | * simplifies to. | |
6546b593 JH |
2670 | */ |
2671 | if (!cnt || | |
2672 | (commit->object.flags & UNINTERESTING) || | |
2673 | !(commit->object.flags & TREESAME) || | |
4d826608 | 2674 | (parent = one_relevant_parent(revs, commit->parents)) == NULL) |
faf0156b JH |
2675 | st->simplified = commit; |
2676 | else { | |
4d826608 | 2677 | pst = locate_simplify_state(revs, parent); |
faf0156b JH |
2678 | st->simplified = pst->simplified; |
2679 | } | |
6546b593 JH |
2680 | return tail; |
2681 | } | |
2682 | ||
2683 | static void simplify_merges(struct rev_info *revs) | |
2684 | { | |
ab9d75a8 | 2685 | struct commit_list *list, *next; |
6546b593 | 2686 | struct commit_list *yet_to_do, **tail; |
ab9d75a8 | 2687 | struct commit *commit; |
6546b593 | 2688 | |
5eac739e JH |
2689 | if (!revs->prune) |
2690 | return; | |
65347030 | 2691 | |
6546b593 JH |
2692 | /* feed the list reversed */ |
2693 | yet_to_do = NULL; | |
ab9d75a8 JH |
2694 | for (list = revs->commits; list; list = next) { |
2695 | commit = list->item; | |
2696 | next = list->next; | |
2697 | /* | |
2698 | * Do not free(list) here yet; the original list | |
2699 | * is used later in this function. | |
2700 | */ | |
2701 | commit_list_insert(commit, &yet_to_do); | |
2702 | } | |
6546b593 JH |
2703 | while (yet_to_do) { |
2704 | list = yet_to_do; | |
2705 | yet_to_do = NULL; | |
2706 | tail = &yet_to_do; | |
2707 | while (list) { | |
ab9d75a8 JH |
2708 | commit = list->item; |
2709 | next = list->next; | |
6546b593 JH |
2710 | free(list); |
2711 | list = next; | |
faf0156b | 2712 | tail = simplify_one(revs, commit, tail); |
6546b593 JH |
2713 | } |
2714 | } | |
2715 | ||
2716 | /* clean up the result, removing the simplified ones */ | |
2717 | list = revs->commits; | |
2718 | revs->commits = NULL; | |
2719 | tail = &revs->commits; | |
2720 | while (list) { | |
faf0156b | 2721 | struct merge_simplify_state *st; |
ab9d75a8 JH |
2722 | |
2723 | commit = list->item; | |
2724 | next = list->next; | |
6546b593 JH |
2725 | free(list); |
2726 | list = next; | |
faf0156b JH |
2727 | st = locate_simplify_state(revs, commit); |
2728 | if (st->simplified == commit) | |
6546b593 JH |
2729 | tail = &commit_list_insert(commit, tail)->next; |
2730 | } | |
6546b593 JH |
2731 | } |
2732 | ||
f35f5603 JH |
2733 | static void set_children(struct rev_info *revs) |
2734 | { | |
2735 | struct commit_list *l; | |
2736 | for (l = revs->commits; l; l = l->next) { | |
2737 | struct commit *commit = l->item; | |
2738 | struct commit_list *p; | |
2739 | ||
2740 | for (p = commit->parents; p; p = p->next) | |
2741 | add_child(revs, p->item, commit); | |
2742 | } | |
2743 | } | |
2744 | ||
bcc0a3ea HV |
2745 | void reset_revision_walk(void) |
2746 | { | |
2747 | clear_object_flags(SEEN | ADDED | SHOWN); | |
2748 | } | |
2749 | ||
cc0e6c5a | 2750 | int prepare_revision_walk(struct rev_info *revs) |
a4a88b2b | 2751 | { |
1da1e07c JK |
2752 | int i; |
2753 | struct object_array old_pending; | |
2e7da8e9 | 2754 | struct commit_list **next = &revs->commits; |
cd2bdc53 | 2755 | |
1da1e07c | 2756 | memcpy(&old_pending, &revs->pending, sizeof(old_pending)); |
1f1e895f LT |
2757 | revs->pending.nr = 0; |
2758 | revs->pending.alloc = 0; | |
2759 | revs->pending.objects = NULL; | |
1da1e07c JK |
2760 | for (i = 0; i < old_pending.nr; i++) { |
2761 | struct object_array_entry *e = old_pending.objects + i; | |
20739490 | 2762 | struct commit *commit = handle_commit(revs, e); |
cd2bdc53 LT |
2763 | if (commit) { |
2764 | if (!(commit->object.flags & SEEN)) { | |
2765 | commit->object.flags |= SEEN; | |
2e7da8e9 | 2766 | next = commit_list_append(commit, next); |
cd2bdc53 LT |
2767 | } |
2768 | } | |
cd2bdc53 | 2769 | } |
4a43d374 | 2770 | if (!revs->leak_pending) |
1da1e07c | 2771 | object_array_clear(&old_pending); |
cd2bdc53 | 2772 | |
d0af663e | 2773 | /* Signal whether we need per-parent treesame decoration */ |
4d826608 KB |
2774 | if (revs->simplify_merges || |
2775 | (revs->limited && limiting_can_increase_treesame(revs))) | |
d0af663e KB |
2776 | revs->treesame.name = "treesame"; |
2777 | ||
ca92e59e MZ |
2778 | if (revs->no_walk != REVISION_WALK_NO_WALK_UNSORTED) |
2779 | commit_list_sort_by_date(&revs->commits); | |
ba1d4505 | 2780 | if (revs->no_walk) |
cc0e6c5a | 2781 | return 0; |
a4a88b2b | 2782 | if (revs->limited) |
cc0e6c5a AR |
2783 | if (limit_list(revs) < 0) |
2784 | return -1; | |
a4a88b2b | 2785 | if (revs->topo_order) |
08f704f2 | 2786 | sort_in_topological_order(&revs->commits, revs->sort_order); |
12da1d1f TR |
2787 | if (revs->line_level_traverse) |
2788 | line_log_filter(revs); | |
6546b593 JH |
2789 | if (revs->simplify_merges) |
2790 | simplify_merges(revs); | |
f35f5603 JH |
2791 | if (revs->children.name) |
2792 | set_children(revs); | |
cc0e6c5a | 2793 | return 0; |
a4a88b2b LT |
2794 | } |
2795 | ||
cc0e6c5a | 2796 | static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp) |
765ac8ec | 2797 | { |
fce87ae5 AG |
2798 | struct commit_list *cache = NULL; |
2799 | ||
765ac8ec LT |
2800 | for (;;) { |
2801 | struct commit *p = *pp; | |
3381c790 | 2802 | if (!revs->limited) |
fce87ae5 | 2803 | if (add_parents_to_list(revs, p, &revs->commits, &cache) < 0) |
cc0e6c5a | 2804 | return rewrite_one_error; |
7dc0fe3b LT |
2805 | if (p->object.flags & UNINTERESTING) |
2806 | return rewrite_one_ok; | |
2807 | if (!(p->object.flags & TREESAME)) | |
cc0e6c5a | 2808 | return rewrite_one_ok; |
765ac8ec | 2809 | if (!p->parents) |
cc0e6c5a | 2810 | return rewrite_one_noparents; |
4d826608 KB |
2811 | if ((p = one_relevant_parent(revs, p->parents)) == NULL) |
2812 | return rewrite_one_ok; | |
2813 | *pp = p; | |
765ac8ec LT |
2814 | } |
2815 | } | |
2816 | ||
c7edcae0 BY |
2817 | int rewrite_parents(struct rev_info *revs, struct commit *commit, |
2818 | rewrite_parent_fn_t rewrite_parent) | |
765ac8ec LT |
2819 | { |
2820 | struct commit_list **pp = &commit->parents; | |
2821 | while (*pp) { | |
2822 | struct commit_list *parent = *pp; | |
c7edcae0 | 2823 | switch (rewrite_parent(revs, &parent->item)) { |
cc0e6c5a AR |
2824 | case rewrite_one_ok: |
2825 | break; | |
2826 | case rewrite_one_noparents: | |
765ac8ec LT |
2827 | *pp = parent->next; |
2828 | continue; | |
cc0e6c5a AR |
2829 | case rewrite_one_error: |
2830 | return -1; | |
765ac8ec LT |
2831 | } |
2832 | pp = &parent->next; | |
2833 | } | |
d0af663e | 2834 | remove_duplicate_parents(revs, commit); |
cc0e6c5a | 2835 | return 0; |
765ac8ec LT |
2836 | } |
2837 | ||
d72fbe81 AP |
2838 | static int commit_rewrite_person(struct strbuf *buf, const char *what, struct string_list *mailmap) |
2839 | { | |
2840 | char *person, *endp; | |
2841 | size_t len, namelen, maillen; | |
2842 | const char *name; | |
2843 | const char *mail; | |
2844 | struct ident_split ident; | |
2845 | ||
2846 | person = strstr(buf->buf, what); | |
2847 | if (!person) | |
2848 | return 0; | |
2849 | ||
2850 | person += strlen(what); | |
2851 | endp = strchr(person, '\n'); | |
2852 | if (!endp) | |
2853 | return 0; | |
2854 | ||
2855 | len = endp - person; | |
2856 | ||
2857 | if (split_ident_line(&ident, person, len)) | |
2858 | return 0; | |
2859 | ||
2860 | mail = ident.mail_begin; | |
2861 | maillen = ident.mail_end - ident.mail_begin; | |
2862 | name = ident.name_begin; | |
2863 | namelen = ident.name_end - ident.name_begin; | |
2864 | ||
2865 | if (map_user(mailmap, &mail, &maillen, &name, &namelen)) { | |
2866 | struct strbuf namemail = STRBUF_INIT; | |
2867 | ||
2868 | strbuf_addf(&namemail, "%.*s <%.*s>", | |
2869 | (int)namelen, name, (int)maillen, mail); | |
2870 | ||
2871 | strbuf_splice(buf, ident.name_begin - buf->buf, | |
2872 | ident.mail_end - ident.name_begin + 1, | |
2873 | namemail.buf, namemail.len); | |
2874 | ||
2875 | strbuf_release(&namemail); | |
2876 | ||
2877 | return 1; | |
2878 | } | |
2879 | ||
2880 | return 0; | |
2881 | } | |
2882 | ||
8ecae9b0 JH |
2883 | static int commit_match(struct commit *commit, struct rev_info *opt) |
2884 | { | |
72fd13f7 | 2885 | int retval; |
04deccda | 2886 | const char *encoding; |
b000c59b | 2887 | const char *message; |
72fd13f7 | 2888 | struct strbuf buf = STRBUF_INIT; |
04deccda | 2889 | |
80235ba7 | 2890 | if (!opt->grep_filter.pattern_list && !opt->grep_filter.header_list) |
8ecae9b0 | 2891 | return 1; |
baa6378f JH |
2892 | |
2893 | /* Prepend "fake" headers as needed */ | |
2894 | if (opt->grep_filter.use_reflog_filter) { | |
72fd13f7 NTND |
2895 | strbuf_addstr(&buf, "reflog "); |
2896 | get_reflog_message(&buf, opt->reflog_info); | |
2897 | strbuf_addch(&buf, '\n'); | |
72fd13f7 | 2898 | } |
baa6378f | 2899 | |
04deccda JK |
2900 | /* |
2901 | * We grep in the user's output encoding, under the assumption that it | |
2902 | * is the encoding they are most likely to write their grep pattern | |
2903 | * for. In addition, it means we will match the "notes" encoding below, | |
2904 | * so we will not end up with a buffer that has two different encodings | |
2905 | * in it. | |
2906 | */ | |
2907 | encoding = get_log_output_encoding(); | |
5a10d236 | 2908 | message = logmsg_reencode(commit, NULL, encoding); |
04deccda | 2909 | |
baa6378f JH |
2910 | /* Copy the commit to temporary if we are using "fake" headers */ |
2911 | if (buf.len) | |
04deccda | 2912 | strbuf_addstr(&buf, message); |
baa6378f | 2913 | |
df874fa8 | 2914 | if (opt->grep_filter.header_list && opt->mailmap) { |
d72fbe81 | 2915 | if (!buf.len) |
04deccda | 2916 | strbuf_addstr(&buf, message); |
d72fbe81 AP |
2917 | |
2918 | commit_rewrite_person(&buf, "\nauthor ", opt->mailmap); | |
2919 | commit_rewrite_person(&buf, "\ncommitter ", opt->mailmap); | |
2920 | } | |
2921 | ||
38cfe915 NTND |
2922 | /* Append "fake" message parts as needed */ |
2923 | if (opt->show_notes) { | |
2924 | if (!buf.len) | |
04deccda JK |
2925 | strbuf_addstr(&buf, message); |
2926 | format_display_notes(commit->object.sha1, &buf, encoding, 1); | |
38cfe915 NTND |
2927 | } |
2928 | ||
b000c59b JK |
2929 | /* |
2930 | * Find either in the original commit message, or in the temporary. | |
2931 | * Note that we cast away the constness of "message" here. It is | |
2932 | * const because it may come from the cached commit buffer. That's OK, | |
2933 | * because we know that it is modifiable heap memory, and that while | |
2934 | * grep_buffer may modify it for speed, it will restore any | |
2935 | * changes before returning. | |
2936 | */ | |
72fd13f7 NTND |
2937 | if (buf.len) |
2938 | retval = grep_buffer(&opt->grep_filter, buf.buf, buf.len); | |
2939 | else | |
2940 | retval = grep_buffer(&opt->grep_filter, | |
b000c59b | 2941 | (char *)message, strlen(message)); |
72fd13f7 | 2942 | strbuf_release(&buf); |
b66103c3 | 2943 | unuse_commit_buffer(commit, message); |
22dfa8a2 | 2944 | return opt->invert_grep ? !retval : retval; |
8ecae9b0 JH |
2945 | } |
2946 | ||
53d00b39 | 2947 | static inline int want_ancestry(const struct rev_info *revs) |
f35f5603 | 2948 | { |
8bb65883 | 2949 | return (revs->rewrite_parents || revs->children.name); |
f35f5603 JH |
2950 | } |
2951 | ||
beb5af43 | 2952 | enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit) |
252a7c02 LT |
2953 | { |
2954 | if (commit->object.flags & SHOWN) | |
2955 | return commit_ignore; | |
4d6acb70 | 2956 | if (revs->unpacked && has_sha1_pack(commit->object.sha1)) |
252a7c02 | 2957 | return commit_ignore; |
3131b713 LT |
2958 | if (revs->show_all) |
2959 | return commit_show; | |
252a7c02 LT |
2960 | if (commit->object.flags & UNINTERESTING) |
2961 | return commit_ignore; | |
2962 | if (revs->min_age != -1 && (commit->date > revs->min_age)) | |
2963 | return commit_ignore; | |
ad5aeede | 2964 | if (revs->min_parents || (revs->max_parents >= 0)) { |
bf3418b0 | 2965 | int n = commit_list_count(commit->parents); |
ad5aeede MG |
2966 | if ((n < revs->min_parents) || |
2967 | ((revs->max_parents >= 0) && (n > revs->max_parents))) | |
2968 | return commit_ignore; | |
2969 | } | |
252a7c02 LT |
2970 | if (!commit_match(commit, revs)) |
2971 | return commit_ignore; | |
53b2c823 | 2972 | if (revs->prune && revs->dense) { |
252a7c02 | 2973 | /* Commit without changes? */ |
7dc0fe3b | 2974 | if (commit->object.flags & TREESAME) { |
bf3418b0 KB |
2975 | int n; |
2976 | struct commit_list *p; | |
252a7c02 | 2977 | /* drop merges unless we want parenthood */ |
f35f5603 | 2978 | if (!want_ancestry(revs)) |
252a7c02 | 2979 | return commit_ignore; |
bf3418b0 KB |
2980 | /* |
2981 | * If we want ancestry, then need to keep any merges | |
2982 | * between relevant commits to tie together topology. | |
2983 | * For consistency with TREESAME and simplification | |
2984 | * use "relevant" here rather than just INTERESTING, | |
2985 | * to treat bottom commit(s) as part of the topology. | |
2986 | */ | |
2987 | for (n = 0, p = commit->parents; p; p = p->next) | |
2988 | if (relevant_commit(p->item)) | |
2989 | if (++n >= 2) | |
2990 | return commit_show; | |
2991 | return commit_ignore; | |
252a7c02 | 2992 | } |
252a7c02 LT |
2993 | } |
2994 | return commit_show; | |
2995 | } | |
2996 | ||
0131c490 JH |
2997 | define_commit_slab(saved_parents, struct commit_list *); |
2998 | ||
2999 | #define EMPTY_PARENT_LIST ((struct commit_list *)-1) | |
3000 | ||
3001 | /* | |
3002 | * You may only call save_parents() once per commit (this is checked | |
3003 | * for non-root commits). | |
3004 | */ | |
3005 | static void save_parents(struct rev_info *revs, struct commit *commit) | |
3006 | { | |
3007 | struct commit_list **pp; | |
3008 | ||
3009 | if (!revs->saved_parents_slab) { | |
3010 | revs->saved_parents_slab = xmalloc(sizeof(struct saved_parents)); | |
3011 | init_saved_parents(revs->saved_parents_slab); | |
3012 | } | |
3013 | ||
3014 | pp = saved_parents_at(revs->saved_parents_slab, commit); | |
3015 | ||
3016 | /* | |
3017 | * When walking with reflogs, we may visit the same commit | |
3018 | * several times: once for each appearance in the reflog. | |
3019 | * | |
3020 | * In this case, save_parents() will be called multiple times. | |
3021 | * We want to keep only the first set of parents. We need to | |
3022 | * store a sentinel value for an empty (i.e., NULL) parent | |
3023 | * list to distinguish it from a not-yet-saved list, however. | |
3024 | */ | |
3025 | if (*pp) | |
3026 | return; | |
3027 | if (commit->parents) | |
3028 | *pp = copy_commit_list(commit->parents); | |
3029 | else | |
3030 | *pp = EMPTY_PARENT_LIST; | |
3031 | } | |
3032 | ||
3033 | static void free_saved_parents(struct rev_info *revs) | |
3034 | { | |
3035 | if (revs->saved_parents_slab) | |
3036 | clear_saved_parents(revs->saved_parents_slab); | |
3037 | } | |
3038 | ||
3039 | struct commit_list *get_saved_parents(struct rev_info *revs, const struct commit *commit) | |
3040 | { | |
3041 | struct commit_list *parents; | |
3042 | ||
3043 | if (!revs->saved_parents_slab) | |
3044 | return commit->parents; | |
3045 | ||
3046 | parents = *saved_parents_at(revs->saved_parents_slab, commit); | |
3047 | if (parents == EMPTY_PARENT_LIST) | |
3048 | return NULL; | |
3049 | return parents; | |
3050 | } | |
3051 | ||
beb5af43 AS |
3052 | enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit) |
3053 | { | |
3054 | enum commit_action action = get_commit_action(revs, commit); | |
3055 | ||
3056 | if (action == commit_show && | |
3057 | !revs->show_all && | |
3058 | revs->prune && revs->dense && want_ancestry(revs)) { | |
53d00b39 TR |
3059 | /* |
3060 | * --full-diff on simplified parents is no good: it | |
3061 | * will show spurious changes from the commits that | |
3062 | * were elided. So we save the parents on the side | |
3063 | * when --full-diff is in effect. | |
3064 | */ | |
3065 | if (revs->full_diff) | |
3066 | save_parents(revs, commit); | |
c7edcae0 | 3067 | if (rewrite_parents(revs, commit, rewrite_one) < 0) |
beb5af43 AS |
3068 | return commit_error; |
3069 | } | |
3070 | return action; | |
3071 | } | |
3072 | ||
1b32dece NTND |
3073 | static void track_linear(struct rev_info *revs, struct commit *commit) |
3074 | { | |
3075 | if (revs->track_first_time) { | |
3076 | revs->linear = 1; | |
3077 | revs->track_first_time = 0; | |
3078 | } else { | |
3079 | struct commit_list *p; | |
3080 | for (p = revs->previous_parents; p; p = p->next) | |
3081 | if (p->item == NULL || /* first commit */ | |
3082 | !hashcmp(p->item->object.sha1, commit->object.sha1)) | |
3083 | break; | |
3084 | revs->linear = p != NULL; | |
3085 | } | |
3086 | if (revs->reverse) { | |
3087 | if (revs->linear) | |
3088 | commit->object.flags |= TRACK_LINEAR; | |
3089 | } | |
3090 | free_commit_list(revs->previous_parents); | |
3091 | revs->previous_parents = copy_commit_list(commit->parents); | |
3092 | } | |
3093 | ||
d5db6c9e | 3094 | static struct commit *get_revision_1(struct rev_info *revs) |
a4a88b2b | 3095 | { |
d5db6c9e | 3096 | if (!revs->commits) |
a4a88b2b | 3097 | return NULL; |
a4a88b2b | 3098 | |
765ac8ec | 3099 | do { |
cb115748 LT |
3100 | struct commit_list *entry = revs->commits; |
3101 | struct commit *commit = entry->item; | |
ea5ed3ab | 3102 | |
cb115748 LT |
3103 | revs->commits = entry->next; |
3104 | free(entry); | |
2a0925be | 3105 | |
ffa1eeae | 3106 | if (revs->reflog_info) { |
838f9a15 | 3107 | save_parents(revs, commit); |
8860fd42 | 3108 | fake_reflog_parent(revs->reflog_info, commit); |
ffa1eeae JK |
3109 | commit->object.flags &= ~(ADDED | SEEN | SHOWN); |
3110 | } | |
8860fd42 | 3111 | |
2a0925be LT |
3112 | /* |
3113 | * If we haven't done the list limiting, we need to look at | |
be7db6e5 LT |
3114 | * the parents here. We also need to do the date-based limiting |
3115 | * that we'd otherwise have done in limit_list(). | |
2a0925be | 3116 | */ |
be7db6e5 | 3117 | if (!revs->limited) { |
744f4985 | 3118 | if (revs->max_age != -1 && |
86ab4906 JH |
3119 | (commit->date < revs->max_age)) |
3120 | continue; | |
2db1a43f VM |
3121 | if (add_parents_to_list(revs, commit, &revs->commits, NULL) < 0) { |
3122 | if (!revs->ignore_missing_links) | |
3123 | die("Failed to traverse parents of commit %s", | |
3124 | sha1_to_hex(commit->object.sha1)); | |
3125 | } | |
be7db6e5 | 3126 | } |
744f4985 | 3127 | |
252a7c02 LT |
3128 | switch (simplify_commit(revs, commit)) { |
3129 | case commit_ignore: | |
8ecae9b0 | 3130 | continue; |
252a7c02 | 3131 | case commit_error: |
ed62089c JH |
3132 | die("Failed to simplify parents of commit %s", |
3133 | sha1_to_hex(commit->object.sha1)); | |
252a7c02 | 3134 | default: |
1b32dece NTND |
3135 | if (revs->track_linear) |
3136 | track_linear(revs, commit); | |
252a7c02 | 3137 | return commit; |
384e99a4 | 3138 | } |
765ac8ec LT |
3139 | } while (revs->commits); |
3140 | return NULL; | |
3141 | } | |
d5db6c9e | 3142 | |
be6754c6 MH |
3143 | /* |
3144 | * Return true for entries that have not yet been shown. (This is an | |
3145 | * object_array_each_func_t.) | |
3146 | */ | |
3147 | static int entry_unshown(struct object_array_entry *entry, void *cb_data_unused) | |
86ab4906 | 3148 | { |
be6754c6 MH |
3149 | return !(entry->item->flags & SHOWN); |
3150 | } | |
86ab4906 | 3151 | |
be6754c6 MH |
3152 | /* |
3153 | * If array is on the verge of a realloc, garbage-collect any entries | |
3154 | * that have already been shown to try to free up some space. | |
3155 | */ | |
3156 | static void gc_boundary(struct object_array *array) | |
3157 | { | |
3158 | if (array->nr == array->alloc) | |
3159 | object_array_filter(array, entry_unshown, NULL); | |
86ab4906 JH |
3160 | } |
3161 | ||
4603ec0f AS |
3162 | static void create_boundary_commit_list(struct rev_info *revs) |
3163 | { | |
3164 | unsigned i; | |
3165 | struct commit *c; | |
3166 | struct object_array *array = &revs->boundary_commits; | |
3167 | struct object_array_entry *objects = array->objects; | |
3168 | ||
3169 | /* | |
3170 | * If revs->commits is non-NULL at this point, an error occurred in | |
3171 | * get_revision_1(). Ignore the error and continue printing the | |
3172 | * boundary commits anyway. (This is what the code has always | |
3173 | * done.) | |
3174 | */ | |
3175 | if (revs->commits) { | |
3176 | free_commit_list(revs->commits); | |
3177 | revs->commits = NULL; | |
3178 | } | |
3179 | ||
3180 | /* | |
3181 | * Put all of the actual boundary commits from revs->boundary_commits | |
3182 | * into revs->commits | |
3183 | */ | |
3184 | for (i = 0; i < array->nr; i++) { | |
3185 | c = (struct commit *)(objects[i].item); | |
3186 | if (!c) | |
3187 | continue; | |
3188 | if (!(c->object.flags & CHILD_SHOWN)) | |
3189 | continue; | |
3190 | if (c->object.flags & (SHOWN | BOUNDARY)) | |
3191 | continue; | |
3192 | c->object.flags |= BOUNDARY; | |
3193 | commit_list_insert(c, &revs->commits); | |
3194 | } | |
3195 | ||
3196 | /* | |
3197 | * If revs->topo_order is set, sort the boundary commits | |
3198 | * in topological order | |
3199 | */ | |
08f704f2 | 3200 | sort_in_topological_order(&revs->commits, revs->sort_order); |
4603ec0f AS |
3201 | } |
3202 | ||
7fefda5c | 3203 | static struct commit *get_revision_internal(struct rev_info *revs) |
d5db6c9e JH |
3204 | { |
3205 | struct commit *c = NULL; | |
86ab4906 JH |
3206 | struct commit_list *l; |
3207 | ||
3208 | if (revs->boundary == 2) { | |
4603ec0f AS |
3209 | /* |
3210 | * All of the normal commits have already been returned, | |
3211 | * and we are now returning boundary commits. | |
3212 | * create_boundary_commit_list() has populated | |
3213 | * revs->commits with the remaining commits to return. | |
3214 | */ | |
3215 | c = pop_commit(&revs->commits); | |
3216 | if (c) | |
3217 | c->object.flags |= SHOWN; | |
9c5e66e9 JS |
3218 | return c; |
3219 | } | |
3220 | ||
86ab4906 | 3221 | /* |
b72a1904 JK |
3222 | * If our max_count counter has reached zero, then we are done. We |
3223 | * don't simply return NULL because we still might need to show | |
3224 | * boundary commits. But we want to avoid calling get_revision_1, which | |
3225 | * might do a considerable amount of work finding the next commit only | |
3226 | * for us to throw it away. | |
3227 | * | |
3228 | * If it is non-zero, then either we don't have a max_count at all | |
3229 | * (-1), or it is still counting, in which case we decrement. | |
86ab4906 | 3230 | */ |
b72a1904 JK |
3231 | if (revs->max_count) { |
3232 | c = get_revision_1(revs); | |
3233 | if (c) { | |
9e57ac55 | 3234 | while (revs->skip_count > 0) { |
b72a1904 JK |
3235 | revs->skip_count--; |
3236 | c = get_revision_1(revs); | |
3237 | if (!c) | |
3238 | break; | |
3239 | } | |
8839ac94 | 3240 | } |
86ab4906 | 3241 | |
b72a1904 JK |
3242 | if (revs->max_count > 0) |
3243 | revs->max_count--; | |
d5db6c9e | 3244 | } |
86ab4906 | 3245 | |
c33d8593 JH |
3246 | if (c) |
3247 | c->object.flags |= SHOWN; | |
3248 | ||
9e57ac55 | 3249 | if (!revs->boundary) |
d5db6c9e | 3250 | return c; |
86ab4906 JH |
3251 | |
3252 | if (!c) { | |
3253 | /* | |
3254 | * get_revision_1() runs out the commits, and | |
3255 | * we are done computing the boundaries. | |
3256 | * switch to boundary commits output mode. | |
3257 | */ | |
3258 | revs->boundary = 2; | |
4603ec0f AS |
3259 | |
3260 | /* | |
3261 | * Update revs->commits to contain the list of | |
3262 | * boundary commits. | |
3263 | */ | |
3264 | create_boundary_commit_list(revs); | |
3265 | ||
3c68d67b | 3266 | return get_revision_internal(revs); |
86ab4906 JH |
3267 | } |
3268 | ||
3269 | /* | |
3270 | * boundary commits are the commits that are parents of the | |
3271 | * ones we got from get_revision_1() but they themselves are | |
3272 | * not returned from get_revision_1(). Before returning | |
3273 | * 'c', we need to mark its parents that they could be boundaries. | |
3274 | */ | |
3275 | ||
3276 | for (l = c->parents; l; l = l->next) { | |
3277 | struct object *p; | |
3278 | p = &(l->item->object); | |
c33d8593 | 3279 | if (p->flags & (CHILD_SHOWN | SHOWN)) |
86ab4906 JH |
3280 | continue; |
3281 | p->flags |= CHILD_SHOWN; | |
3282 | gc_boundary(&revs->boundary_commits); | |
3283 | add_object_array(p, NULL, &revs->boundary_commits); | |
3284 | } | |
3285 | ||
3286 | return c; | |
d5db6c9e | 3287 | } |
7fefda5c AS |
3288 | |
3289 | struct commit *get_revision(struct rev_info *revs) | |
3290 | { | |
498bcd31 TR |
3291 | struct commit *c; |
3292 | struct commit_list *reversed; | |
3293 | ||
3294 | if (revs->reverse) { | |
3295 | reversed = NULL; | |
9e57ac55 | 3296 | while ((c = get_revision_internal(revs))) |
498bcd31 | 3297 | commit_list_insert(c, &reversed); |
498bcd31 TR |
3298 | revs->commits = reversed; |
3299 | revs->reverse = 0; | |
3300 | revs->reverse_output_stage = 1; | |
3301 | } | |
3302 | ||
1b32dece NTND |
3303 | if (revs->reverse_output_stage) { |
3304 | c = pop_commit(&revs->commits); | |
3305 | if (revs->track_linear) | |
3306 | revs->linear = !!(c && c->object.flags & TRACK_LINEAR); | |
3307 | return c; | |
3308 | } | |
498bcd31 TR |
3309 | |
3310 | c = get_revision_internal(revs); | |
7fefda5c AS |
3311 | if (c && revs->graph) |
3312 | graph_update(revs->graph, c); | |
1b32dece | 3313 | if (!c) { |
53d00b39 | 3314 | free_saved_parents(revs); |
1b32dece NTND |
3315 | if (revs->previous_parents) { |
3316 | free_commit_list(revs->previous_parents); | |
3317 | revs->previous_parents = NULL; | |
3318 | } | |
3319 | } | |
7fefda5c AS |
3320 | return c; |
3321 | } | |
1df2d656 MG |
3322 | |
3323 | char *get_revision_mark(const struct rev_info *revs, const struct commit *commit) | |
3324 | { | |
3325 | if (commit->object.flags & BOUNDARY) | |
3326 | return "-"; | |
3327 | else if (commit->object.flags & UNINTERESTING) | |
3328 | return "^"; | |
adbbb31e MG |
3329 | else if (commit->object.flags & PATCHSAME) |
3330 | return "="; | |
1df2d656 MG |
3331 | else if (!revs || revs->left_right) { |
3332 | if (commit->object.flags & SYMMETRIC_LEFT) | |
3333 | return "<"; | |
3334 | else | |
3335 | return ">"; | |
3336 | } else if (revs->graph) | |
3337 | return "*"; | |
adbbb31e MG |
3338 | else if (revs->cherry_mark) |
3339 | return "+"; | |
1df2d656 MG |
3340 | return ""; |
3341 | } | |
b1b47554 MG |
3342 | |
3343 | void put_revision_mark(const struct rev_info *revs, const struct commit *commit) | |
3344 | { | |
3345 | char *mark = get_revision_mark(revs, commit); | |
3346 | if (!strlen(mark)) | |
3347 | return; | |
3348 | fputs(mark, stdout); | |
3349 | putchar(' '); | |
3350 | } |