]>
Commit | Line | Data |
---|---|---|
ae563542 | 1 | #include "cache.h" |
cbd53a21 | 2 | #include "object-store.h" |
ae563542 LT |
3 | #include "tag.h" |
4 | #include "blob.h" | |
5 | #include "tree.h" | |
6 | #include "commit.h" | |
a4a88b2b | 7 | #include "diff.h" |
ae563542 LT |
8 | #include "refs.h" |
9 | #include "revision.h" | |
23a3f0cb | 10 | #include "repository.h" |
7fefda5c | 11 | #include "graph.h" |
8ecae9b0 | 12 | #include "grep.h" |
8860fd42 | 13 | #include "reflog-walk.h" |
d7a17cad | 14 | #include "patch-ids.h" |
f35f5603 | 15 | #include "decorate.h" |
78892e32 | 16 | #include "log-tree.h" |
894a9d33 | 17 | #include "string-list.h" |
12da1d1f | 18 | #include "line-log.h" |
d72fbe81 | 19 | #include "mailmap.h" |
53d00b39 | 20 | #include "commit-slab.h" |
429bb40a | 21 | #include "dir.h" |
4fe10219 | 22 | #include "cache-tree.h" |
cb46d630 | 23 | #include "bisect.h" |
150e3001 | 24 | #include "packfile.h" |
be489d02 | 25 | #include "worktree.h" |
dbbcd44f | 26 | #include "strvec.h" |
64043556 | 27 | #include "commit-reach.h" |
f0d9cc41 | 28 | #include "commit-graph.h" |
b4542418 | 29 | #include "prio-queue.h" |
d5d2e935 | 30 | #include "hashmap.h" |
44570188 | 31 | #include "utf8.h" |
a56b9464 | 32 | #include "bloom.h" |
42e50e78 | 33 | #include "json-writer.h" |
ae563542 | 34 | |
cdcefbc9 LT |
35 | volatile show_early_output_fn_t show_early_output; |
36 | ||
cb46d630 AD |
37 | static const char *term_bad; |
38 | static const char *term_good; | |
39 | ||
87be2523 NTND |
40 | implement_shared_commit_slab(revision_sources, char *); |
41 | ||
3cb9d2b6 SG |
42 | static inline int want_ancestry(const struct rev_info *revs); |
43 | ||
de1e67d0 | 44 | void show_object_with_name(FILE *out, struct object *obj, const char *name) |
ae563542 | 45 | { |
de1e67d0 | 46 | const char *p; |
91f17516 | 47 | |
f2fd0760 | 48 | fprintf(out, "%s ", oid_to_hex(&obj->oid)); |
f9fb9d0e JK |
49 | for (p = name; *p && *p != '\n'; p++) |
50 | fputc(*p, out); | |
beba25ab | 51 | fputc('\n', out); |
91f17516 JH |
52 | } |
53 | ||
ae563542 LT |
54 | static void mark_blob_uninteresting(struct blob *blob) |
55 | { | |
c1ee9013 MK |
56 | if (!blob) |
57 | return; | |
ae563542 LT |
58 | if (blob->object.flags & UNINTERESTING) |
59 | return; | |
60 | blob->object.flags |= UNINTERESTING; | |
61 | } | |
62 | ||
b3c7eef9 NTND |
63 | static void mark_tree_contents_uninteresting(struct repository *r, |
64 | struct tree *tree) | |
ae563542 | 65 | { |
f75e53ed | 66 | struct tree_desc desc; |
4c068a98 | 67 | struct name_entry entry; |
ae563542 | 68 | |
a5411df0 | 69 | if (parse_tree_gently(tree, 1) < 0) |
ae563542 | 70 | return; |
f75e53ed | 71 | |
6fda5e51 | 72 | init_tree_desc(&desc, tree->buffer, tree->size); |
4c068a98 | 73 | while (tree_entry(&desc, &entry)) { |
4d1012c3 LT |
74 | switch (object_type(entry.mode)) { |
75 | case OBJ_TREE: | |
ea82b2a0 | 76 | mark_tree_uninteresting(r, lookup_tree(r, &entry.oid)); |
4d1012c3 LT |
77 | break; |
78 | case OBJ_BLOB: | |
ea82b2a0 | 79 | mark_blob_uninteresting(lookup_blob(r, &entry.oid)); |
4d1012c3 LT |
80 | break; |
81 | default: | |
82 | /* Subproject commit - not in this repository */ | |
83 | break; | |
84 | } | |
ae563542 | 85 | } |
f75e53ed LT |
86 | |
87 | /* | |
88 | * We don't care about the tree any more | |
89 | * after it has been marked uninteresting. | |
90 | */ | |
6e454b9a | 91 | free_tree_buffer(tree); |
ae563542 LT |
92 | } |
93 | ||
b3c7eef9 | 94 | void mark_tree_uninteresting(struct repository *r, struct tree *tree) |
2ac5e447 | 95 | { |
a2678df3 | 96 | struct object *obj; |
2ac5e447 JH |
97 | |
98 | if (!tree) | |
99 | return; | |
a2678df3 SN |
100 | |
101 | obj = &tree->object; | |
2ac5e447 JH |
102 | if (obj->flags & UNINTERESTING) |
103 | return; | |
104 | obj->flags |= UNINTERESTING; | |
b3c7eef9 | 105 | mark_tree_contents_uninteresting(r, tree); |
ae563542 LT |
106 | } |
107 | ||
d5d2e935 DS |
108 | struct path_and_oids_entry { |
109 | struct hashmap_entry ent; | |
110 | char *path; | |
111 | struct oidset trees; | |
112 | }; | |
113 | ||
114 | static int path_and_oids_cmp(const void *hashmap_cmp_fn_data, | |
939af16e EW |
115 | const struct hashmap_entry *eptr, |
116 | const struct hashmap_entry *entry_or_key, | |
d5d2e935 DS |
117 | const void *keydata) |
118 | { | |
939af16e EW |
119 | const struct path_and_oids_entry *e1, *e2; |
120 | ||
121 | e1 = container_of(eptr, const struct path_and_oids_entry, ent); | |
122 | e2 = container_of(entry_or_key, const struct path_and_oids_entry, ent); | |
123 | ||
d5d2e935 DS |
124 | return strcmp(e1->path, e2->path); |
125 | } | |
126 | ||
127 | static void paths_and_oids_init(struct hashmap *map) | |
128 | { | |
939af16e | 129 | hashmap_init(map, path_and_oids_cmp, NULL, 0); |
d5d2e935 DS |
130 | } |
131 | ||
132 | static void paths_and_oids_clear(struct hashmap *map) | |
133 | { | |
134 | struct hashmap_iter iter; | |
135 | struct path_and_oids_entry *entry; | |
d5d2e935 | 136 | |
23dee69f | 137 | hashmap_for_each_entry(map, &iter, entry, ent /* member name */) { |
d5d2e935 DS |
138 | oidset_clear(&entry->trees); |
139 | free(entry->path); | |
140 | } | |
141 | ||
c8e424c9 | 142 | hashmap_free_entries(map, struct path_and_oids_entry, ent); |
d5d2e935 DS |
143 | } |
144 | ||
145 | static void paths_and_oids_insert(struct hashmap *map, | |
146 | const char *path, | |
147 | const struct object_id *oid) | |
148 | { | |
149 | int hash = strhash(path); | |
150 | struct path_and_oids_entry key; | |
151 | struct path_and_oids_entry *entry; | |
152 | ||
d22245a2 | 153 | hashmap_entry_init(&key.ent, hash); |
d5d2e935 DS |
154 | |
155 | /* use a shallow copy for the lookup */ | |
156 | key.path = (char *)path; | |
157 | oidset_init(&key.trees, 0); | |
158 | ||
404ab78e | 159 | entry = hashmap_get_entry(map, &key, ent, NULL); |
b6c52416 | 160 | if (!entry) { |
d5d2e935 | 161 | entry = xcalloc(1, sizeof(struct path_and_oids_entry)); |
d22245a2 | 162 | hashmap_entry_init(&entry->ent, hash); |
d5d2e935 DS |
163 | entry->path = xstrdup(key.path); |
164 | oidset_init(&entry->trees, 16); | |
26b455f2 | 165 | hashmap_put(map, &entry->ent); |
d5d2e935 DS |
166 | } |
167 | ||
168 | oidset_insert(&entry->trees, oid); | |
169 | } | |
170 | ||
171 | static void add_children_by_path(struct repository *r, | |
172 | struct tree *tree, | |
173 | struct hashmap *map) | |
174 | { | |
175 | struct tree_desc desc; | |
176 | struct name_entry entry; | |
177 | ||
178 | if (!tree) | |
179 | return; | |
180 | ||
181 | if (parse_tree_gently(tree, 1) < 0) | |
182 | return; | |
183 | ||
184 | init_tree_desc(&desc, tree->buffer, tree->size); | |
185 | while (tree_entry(&desc, &entry)) { | |
186 | switch (object_type(entry.mode)) { | |
187 | case OBJ_TREE: | |
5fda3433 | 188 | paths_and_oids_insert(map, entry.path, &entry.oid); |
d5d2e935 DS |
189 | |
190 | if (tree->object.flags & UNINTERESTING) { | |
5fda3433 | 191 | struct tree *child = lookup_tree(r, &entry.oid); |
d5d2e935 DS |
192 | if (child) |
193 | child->object.flags |= UNINTERESTING; | |
194 | } | |
195 | break; | |
196 | case OBJ_BLOB: | |
197 | if (tree->object.flags & UNINTERESTING) { | |
5fda3433 | 198 | struct blob *child = lookup_blob(r, &entry.oid); |
d5d2e935 DS |
199 | if (child) |
200 | child->object.flags |= UNINTERESTING; | |
201 | } | |
202 | break; | |
203 | default: | |
204 | /* Subproject commit - not in this repository */ | |
205 | break; | |
206 | } | |
207 | } | |
208 | ||
209 | free_tree_buffer(tree); | |
210 | } | |
211 | ||
f1f5de44 DS |
212 | void mark_trees_uninteresting_sparse(struct repository *r, |
213 | struct oidset *trees) | |
214 | { | |
d5d2e935 DS |
215 | unsigned has_interesting = 0, has_uninteresting = 0; |
216 | struct hashmap map; | |
217 | struct hashmap_iter map_iter; | |
218 | struct path_and_oids_entry *entry; | |
f1f5de44 DS |
219 | struct object_id *oid; |
220 | struct oidset_iter iter; | |
221 | ||
222 | oidset_iter_init(trees, &iter); | |
d5d2e935 DS |
223 | while ((!has_interesting || !has_uninteresting) && |
224 | (oid = oidset_iter_next(&iter))) { | |
f1f5de44 DS |
225 | struct tree *tree = lookup_tree(r, oid); |
226 | ||
227 | if (!tree) | |
228 | continue; | |
229 | ||
d5d2e935 DS |
230 | if (tree->object.flags & UNINTERESTING) |
231 | has_uninteresting = 1; | |
232 | else | |
233 | has_interesting = 1; | |
f1f5de44 | 234 | } |
d5d2e935 DS |
235 | |
236 | /* Do not walk unless we have both types of trees. */ | |
237 | if (!has_uninteresting || !has_interesting) | |
238 | return; | |
239 | ||
240 | paths_and_oids_init(&map); | |
241 | ||
242 | oidset_iter_init(trees, &iter); | |
243 | while ((oid = oidset_iter_next(&iter))) { | |
244 | struct tree *tree = lookup_tree(r, oid); | |
245 | add_children_by_path(r, tree, &map); | |
246 | } | |
247 | ||
23dee69f | 248 | hashmap_for_each_entry(&map, &map_iter, entry, ent /* member name */) |
d5d2e935 DS |
249 | mark_trees_uninteresting_sparse(r, &entry->trees); |
250 | ||
251 | paths_and_oids_clear(&map); | |
f1f5de44 DS |
252 | } |
253 | ||
43fc643b JK |
254 | struct commit_stack { |
255 | struct commit **items; | |
256 | size_t nr, alloc; | |
257 | }; | |
258 | #define COMMIT_STACK_INIT { NULL, 0, 0 } | |
259 | ||
260 | static void commit_stack_push(struct commit_stack *stack, struct commit *commit) | |
261 | { | |
262 | ALLOC_GROW(stack->items, stack->nr + 1, stack->alloc); | |
263 | stack->items[stack->nr++] = commit; | |
264 | } | |
265 | ||
266 | static struct commit *commit_stack_pop(struct commit_stack *stack) | |
267 | { | |
268 | return stack->nr ? stack->items[--stack->nr] : NULL; | |
269 | } | |
270 | ||
271 | static void commit_stack_clear(struct commit_stack *stack) | |
272 | { | |
273 | FREE_AND_NULL(stack->items); | |
274 | stack->nr = stack->alloc = 0; | |
275 | } | |
276 | ||
8702b30f JK |
277 | static void mark_one_parent_uninteresting(struct commit *commit, |
278 | struct commit_stack *pending) | |
279 | { | |
280 | struct commit_list *l; | |
281 | ||
282 | if (commit->object.flags & UNINTERESTING) | |
283 | return; | |
284 | commit->object.flags |= UNINTERESTING; | |
285 | ||
286 | /* | |
287 | * Normally we haven't parsed the parent | |
288 | * yet, so we won't have a parent of a parent | |
289 | * here. However, it may turn out that we've | |
290 | * reached this commit some other way (where it | |
291 | * wasn't uninteresting), in which case we need | |
292 | * to mark its parents recursively too.. | |
293 | */ | |
294 | for (l = commit->parents; l; l = l->next) | |
295 | commit_stack_push(pending, l->item); | |
296 | } | |
297 | ||
ae563542 LT |
298 | void mark_parents_uninteresting(struct commit *commit) |
299 | { | |
43fc643b JK |
300 | struct commit_stack pending = COMMIT_STACK_INIT; |
301 | struct commit_list *l; | |
941ba8db NTND |
302 | |
303 | for (l = commit->parents; l; l = l->next) | |
8702b30f JK |
304 | mark_one_parent_uninteresting(l->item, &pending); |
305 | ||
306 | while (pending.nr > 0) | |
307 | mark_one_parent_uninteresting(commit_stack_pop(&pending), | |
308 | &pending); | |
43fc643b JK |
309 | |
310 | commit_stack_clear(&pending); | |
ae563542 LT |
311 | } |
312 | ||
20739490 | 313 | static void add_pending_object_with_path(struct rev_info *revs, |
ff5f5f26 | 314 | struct object *obj, |
20739490 JK |
315 | const char *name, unsigned mode, |
316 | const char *path) | |
ae563542 | 317 | { |
cc243c3c JH |
318 | if (!obj) |
319 | return; | |
aa27e461 | 320 | if (revs->no_walk && (obj->flags & UNINTERESTING)) |
f222abde | 321 | revs->no_walk = 0; |
105e4733 JH |
322 | if (revs->reflog_info && obj->type == OBJ_COMMIT) { |
323 | struct strbuf buf = STRBUF_INIT; | |
0e9f62da | 324 | int len = interpret_branch_name(name, 0, &buf, 0); |
105e4733 JH |
325 | |
326 | if (0 < len && name[len] && buf.len) | |
327 | strbuf_addstr(&buf, name + len); | |
d08565bf JK |
328 | add_reflog_for_walk(revs->reflog_info, |
329 | (struct commit *)obj, | |
330 | buf.buf[0] ? buf.buf: name); | |
105e4733 | 331 | strbuf_release(&buf); |
d08565bf | 332 | return; /* do not add the commit itself */ |
105e4733 | 333 | } |
20739490 JK |
334 | add_object_array_with_path(obj, name, &revs->pending, mode, path); |
335 | } | |
336 | ||
337 | static void add_pending_object_with_mode(struct rev_info *revs, | |
338 | struct object *obj, | |
339 | const char *name, unsigned mode) | |
340 | { | |
341 | add_pending_object_with_path(revs, obj, name, mode, NULL); | |
ae563542 LT |
342 | } |
343 | ||
ff5f5f26 MH |
344 | void add_pending_object(struct rev_info *revs, |
345 | struct object *obj, const char *name) | |
2d93b9fa JH |
346 | { |
347 | add_pending_object_with_mode(revs, obj, name, S_IFINVALID); | |
348 | } | |
349 | ||
3384a2df JH |
350 | void add_head_to_pending(struct rev_info *revs) |
351 | { | |
654b9a90 | 352 | struct object_id oid; |
3384a2df | 353 | struct object *obj; |
654b9a90 | 354 | if (get_oid("HEAD", &oid)) |
3384a2df | 355 | return; |
b3c7eef9 | 356 | obj = parse_object(revs->repo, &oid); |
3384a2df JH |
357 | if (!obj) |
358 | return; | |
359 | add_pending_object(revs, obj, "HEAD"); | |
360 | } | |
361 | ||
ff5f5f26 | 362 | static struct object *get_reference(struct rev_info *revs, const char *name, |
654b9a90 | 363 | const struct object_id *oid, |
ff5f5f26 | 364 | unsigned int flags) |
ae563542 LT |
365 | { |
366 | struct object *object; | |
367 | ||
ec0c5798 JT |
368 | /* |
369 | * If the repository has commit graphs, repo_parse_commit() avoids | |
370 | * reading the object buffer, so use it whenever possible. | |
371 | */ | |
372 | if (oid_object_info(revs->repo, oid, NULL) == OBJ_COMMIT) { | |
373 | struct commit *c = lookup_commit(revs->repo, oid); | |
374 | if (!repo_parse_commit(revs->repo, c)) | |
375 | object = (struct object *) c; | |
376 | else | |
377 | object = NULL; | |
378 | } else { | |
379 | object = parse_object(revs->repo, oid); | |
380 | } | |
381 | ||
cc243c3c JH |
382 | if (!object) { |
383 | if (revs->ignore_missing) | |
384 | return object; | |
df11e196 JT |
385 | if (revs->exclude_promisor_objects && is_promisor_object(oid)) |
386 | return NULL; | |
ae563542 | 387 | die("bad object %s", name); |
cc243c3c | 388 | } |
cd2bdc53 LT |
389 | object->flags |= flags; |
390 | return object; | |
391 | } | |
392 | ||
a58a1b01 | 393 | void add_pending_oid(struct rev_info *revs, const char *name, |
394 | const struct object_id *oid, unsigned int flags) | |
26c3177e | 395 | { |
654b9a90 | 396 | struct object *object = get_reference(revs, name, oid, flags); |
26c3177e RS |
397 | add_pending_object(revs, object, name); |
398 | } | |
399 | ||
ff5f5f26 | 400 | static struct commit *handle_commit(struct rev_info *revs, |
20739490 | 401 | struct object_array_entry *entry) |
cd2bdc53 | 402 | { |
20739490 JK |
403 | struct object *object = entry->item; |
404 | const char *name = entry->name; | |
405 | const char *path = entry->path; | |
406 | unsigned int mode = entry->mode; | |
cd2bdc53 | 407 | unsigned long flags = object->flags; |
ae563542 LT |
408 | |
409 | /* | |
410 | * Tag object? Look what it points to.. | |
411 | */ | |
1974632c | 412 | while (object->type == OBJ_TAG) { |
ae563542 | 413 | struct tag *tag = (struct tag *) object; |
cd2bdc53 | 414 | if (revs->tag_objects && !(flags & UNINTERESTING)) |
ae563542 | 415 | add_pending_object(revs, object, tag->tag); |
dad3f060 | 416 | object = parse_object(revs->repo, get_tagged_oid(tag)); |
aeeae1b7 | 417 | if (!object) { |
a3ba6bf1 | 418 | if (revs->ignore_missing_links || (flags & UNINTERESTING)) |
aeeae1b7 | 419 | return NULL; |
dc0a13f6 JT |
420 | if (revs->exclude_promisor_objects && |
421 | is_promisor_object(&tag->tagged->oid)) | |
422 | return NULL; | |
f2fd0760 | 423 | die("bad object %s", oid_to_hex(&tag->tagged->oid)); |
aeeae1b7 | 424 | } |
a7435286 | 425 | object->flags |= flags; |
20739490 JK |
426 | /* |
427 | * We'll handle the tagged object by looping or dropping | |
428 | * through to the non-tag handlers below. Do not | |
728350b7 | 429 | * propagate path data from the tag's pending entry. |
20739490 | 430 | */ |
20739490 JK |
431 | path = NULL; |
432 | mode = 0; | |
ae563542 LT |
433 | } |
434 | ||
435 | /* | |
436 | * Commit object? Just return it, we'll do all the complex | |
437 | * reachability crud. | |
438 | */ | |
1974632c | 439 | if (object->type == OBJ_COMMIT) { |
ae563542 | 440 | struct commit *commit = (struct commit *)object; |
87be2523 | 441 | |
ae563542 LT |
442 | if (parse_commit(commit) < 0) |
443 | die("unable to parse commit %s", name); | |
d9a83684 | 444 | if (flags & UNINTERESTING) { |
ae563542 | 445 | mark_parents_uninteresting(commit); |
1b4d8827 DS |
446 | |
447 | if (!revs->topo_order || !generation_numbers_enabled(the_repository)) | |
448 | revs->limited = 1; | |
d9a83684 | 449 | } |
87be2523 NTND |
450 | if (revs->sources) { |
451 | char **slot = revision_sources_at(revs->sources, commit); | |
452 | ||
453 | if (!*slot) | |
454 | *slot = xstrdup(name); | |
455 | } | |
ae563542 LT |
456 | return commit; |
457 | } | |
458 | ||
459 | /* | |
3ea3c215 | 460 | * Tree object? Either mark it uninteresting, or add it |
ae563542 LT |
461 | * to the list of objects to look at later.. |
462 | */ | |
1974632c | 463 | if (object->type == OBJ_TREE) { |
ae563542 LT |
464 | struct tree *tree = (struct tree *)object; |
465 | if (!revs->tree_objects) | |
466 | return NULL; | |
467 | if (flags & UNINTERESTING) { | |
b3c7eef9 | 468 | mark_tree_contents_uninteresting(revs->repo, tree); |
ae563542 LT |
469 | return NULL; |
470 | } | |
20739490 | 471 | add_pending_object_with_path(revs, object, name, mode, path); |
ae563542 LT |
472 | return NULL; |
473 | } | |
474 | ||
475 | /* | |
476 | * Blob object? You know the drill by now.. | |
477 | */ | |
1974632c | 478 | if (object->type == OBJ_BLOB) { |
ae563542 LT |
479 | if (!revs->blob_objects) |
480 | return NULL; | |
a7435286 | 481 | if (flags & UNINTERESTING) |
ae563542 | 482 | return NULL; |
20739490 | 483 | add_pending_object_with_path(revs, object, name, mode, path); |
ae563542 LT |
484 | return NULL; |
485 | } | |
486 | die("%s is unknown object", name); | |
487 | } | |
488 | ||
b6e8a3b5 JK |
489 | static int everybody_uninteresting(struct commit_list *orig, |
490 | struct commit **interesting_cache) | |
a4a88b2b LT |
491 | { |
492 | struct commit_list *list = orig; | |
b6e8a3b5 JK |
493 | |
494 | if (*interesting_cache) { | |
495 | struct commit *commit = *interesting_cache; | |
496 | if (!(commit->object.flags & UNINTERESTING)) | |
497 | return 0; | |
498 | } | |
499 | ||
a4a88b2b LT |
500 | while (list) { |
501 | struct commit *commit = list->item; | |
502 | list = list->next; | |
503 | if (commit->object.flags & UNINTERESTING) | |
504 | continue; | |
ae40ebda SB |
505 | |
506 | *interesting_cache = commit; | |
a4a88b2b LT |
507 | return 0; |
508 | } | |
509 | return 1; | |
510 | } | |
511 | ||
4d826608 KB |
512 | /* |
513 | * A definition of "relevant" commit that we can use to simplify limited graphs | |
514 | * by eliminating side branches. | |
515 | * | |
516 | * A "relevant" commit is one that is !UNINTERESTING (ie we are including it | |
517 | * in our list), or that is a specified BOTTOM commit. Then after computing | |
518 | * a limited list, during processing we can generally ignore boundary merges | |
519 | * coming from outside the graph, (ie from irrelevant parents), and treat | |
520 | * those merges as if they were single-parent. TREESAME is defined to consider | |
521 | * only relevant parents, if any. If we are TREESAME to our on-graph parents, | |
522 | * we don't care if we were !TREESAME to non-graph parents. | |
523 | * | |
524 | * Treating bottom commits as relevant ensures that a limited graph's | |
525 | * connection to the actual bottom commit is not viewed as a side branch, but | |
526 | * treated as part of the graph. For example: | |
527 | * | |
528 | * ....Z...A---X---o---o---B | |
529 | * . / | |
530 | * W---Y | |
531 | * | |
532 | * When computing "A..B", the A-X connection is at least as important as | |
533 | * Y-X, despite A being flagged UNINTERESTING. | |
534 | * | |
535 | * And when computing --ancestry-path "A..B", the A-X connection is more | |
536 | * important than Y-X, despite both A and Y being flagged UNINTERESTING. | |
537 | */ | |
538 | static inline int relevant_commit(struct commit *commit) | |
539 | { | |
540 | return (commit->object.flags & (UNINTERESTING | BOTTOM)) != UNINTERESTING; | |
541 | } | |
542 | ||
543 | /* | |
544 | * Return a single relevant commit from a parent list. If we are a TREESAME | |
545 | * commit, and this selects one of our parents, then we can safely simplify to | |
546 | * that parent. | |
547 | */ | |
548 | static struct commit *one_relevant_parent(const struct rev_info *revs, | |
549 | struct commit_list *orig) | |
550 | { | |
551 | struct commit_list *list = orig; | |
552 | struct commit *relevant = NULL; | |
553 | ||
554 | if (!orig) | |
555 | return NULL; | |
556 | ||
557 | /* | |
558 | * For 1-parent commits, or if first-parent-only, then return that | |
559 | * first parent (even if not "relevant" by the above definition). | |
560 | * TREESAME will have been set purely on that parent. | |
561 | */ | |
562 | if (revs->first_parent_only || !orig->next) | |
563 | return orig->item; | |
564 | ||
565 | /* | |
566 | * For multi-parent commits, identify a sole relevant parent, if any. | |
567 | * If we have only one relevant parent, then TREESAME will be set purely | |
568 | * with regard to that parent, and we can simplify accordingly. | |
569 | * | |
570 | * If we have more than one relevant parent, or no relevant parents | |
571 | * (and multiple irrelevant ones), then we can't select a parent here | |
572 | * and return NULL. | |
573 | */ | |
574 | while (list) { | |
575 | struct commit *commit = list->item; | |
576 | list = list->next; | |
577 | if (relevant_commit(commit)) { | |
578 | if (relevant) | |
579 | return NULL; | |
580 | relevant = commit; | |
581 | } | |
582 | } | |
583 | return relevant; | |
584 | } | |
585 | ||
0a4ba7f8 JH |
586 | /* |
587 | * The goal is to get REV_TREE_NEW as the result only if the | |
ceff8e7a LT |
588 | * diff consists of all '+' (and no other changes), REV_TREE_OLD |
589 | * if the whole diff is removal of old data, and otherwise | |
590 | * REV_TREE_DIFFERENT (of course if the trees are the same we | |
591 | * want REV_TREE_SAME). | |
a937b37e JK |
592 | * |
593 | * The only time we care about the distinction is when | |
594 | * remove_empty_trees is in effect, in which case we care only about | |
595 | * whether the whole change is REV_TREE_NEW, or if there's another type | |
596 | * of change. Which means we can stop the diff early in either of these | |
597 | * cases: | |
598 | * | |
599 | * 1. We're not using remove_empty_trees at all. | |
600 | * | |
601 | * 2. We saw anything except REV_TREE_NEW. | |
0a4ba7f8 | 602 | */ |
8efdc326 | 603 | static int tree_difference = REV_TREE_SAME; |
a4a88b2b LT |
604 | |
605 | static void file_add_remove(struct diff_options *options, | |
606 | int addremove, unsigned mode, | |
c26022ea BW |
607 | const struct object_id *oid, |
608 | int oid_valid, | |
e3d42c47 | 609 | const char *fullpath, unsigned dirty_submodule) |
a4a88b2b | 610 | { |
ceff8e7a | 611 | int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD; |
a937b37e | 612 | struct rev_info *revs = options->change_fn_data; |
a4a88b2b | 613 | |
ceff8e7a | 614 | tree_difference |= diff; |
a937b37e | 615 | if (!revs->remove_empty_trees || tree_difference != REV_TREE_NEW) |
0d1e0e78 | 616 | options->flags.has_changes = 1; |
a4a88b2b LT |
617 | } |
618 | ||
619 | static void file_change(struct diff_options *options, | |
620 | unsigned old_mode, unsigned new_mode, | |
94a0097a BW |
621 | const struct object_id *old_oid, |
622 | const struct object_id *new_oid, | |
623 | int old_oid_valid, int new_oid_valid, | |
e3d42c47 JL |
624 | const char *fullpath, |
625 | unsigned old_dirty_submodule, unsigned new_dirty_submodule) | |
a4a88b2b | 626 | { |
8efdc326 | 627 | tree_difference = REV_TREE_DIFFERENT; |
0d1e0e78 | 628 | options->flags.has_changes = 1; |
a4a88b2b LT |
629 | } |
630 | ||
42e50e78 GS |
631 | static int bloom_filter_atexit_registered; |
632 | static unsigned int count_bloom_filter_maybe; | |
633 | static unsigned int count_bloom_filter_definitely_not; | |
634 | static unsigned int count_bloom_filter_false_positive; | |
635 | static unsigned int count_bloom_filter_not_present; | |
42e50e78 GS |
636 | |
637 | static void trace2_bloom_filter_statistics_atexit(void) | |
638 | { | |
639 | struct json_writer jw = JSON_WRITER_INIT; | |
640 | ||
641 | jw_object_begin(&jw, 0); | |
642 | jw_object_intmax(&jw, "filter_not_present", count_bloom_filter_not_present); | |
42e50e78 GS |
643 | jw_object_intmax(&jw, "maybe", count_bloom_filter_maybe); |
644 | jw_object_intmax(&jw, "definitely_not", count_bloom_filter_definitely_not); | |
645 | jw_object_intmax(&jw, "false_positive", count_bloom_filter_false_positive); | |
646 | jw_end(&jw); | |
647 | ||
648 | trace2_data_json("bloom", the_repository, "statistics", &jw); | |
649 | ||
650 | jw_release(&jw); | |
651 | } | |
652 | ||
8918e379 DS |
653 | static int forbid_bloom_filters(struct pathspec *spec) |
654 | { | |
655 | if (spec->has_wildcard) | |
656 | return 1; | |
657 | if (spec->nr > 1) | |
658 | return 1; | |
659 | if (spec->magic & ~PATHSPEC_LITERAL) | |
660 | return 1; | |
661 | if (spec->nr && (spec->items[0].magic & ~PATHSPEC_LITERAL)) | |
662 | return 1; | |
663 | ||
664 | return 0; | |
665 | } | |
666 | ||
a56b9464 GS |
667 | static void prepare_to_use_bloom_filter(struct rev_info *revs) |
668 | { | |
669 | struct pathspec_item *pi; | |
670 | char *path_alloc = NULL; | |
c525ce95 | 671 | const char *path, *p; |
a56b9464 | 672 | int last_index; |
c525ce95 SG |
673 | size_t len; |
674 | int path_component_nr = 1; | |
a56b9464 GS |
675 | |
676 | if (!revs->commits) | |
8918e379 DS |
677 | return; |
678 | ||
679 | if (forbid_bloom_filters(&revs->prune_data)) | |
680 | return; | |
a56b9464 GS |
681 | |
682 | repo_parse_commit(revs->repo, revs->commits->item); | |
683 | ||
684 | if (!revs->repo->objects->commit_graph) | |
685 | return; | |
686 | ||
687 | revs->bloom_filter_settings = revs->repo->objects->commit_graph->bloom_filter_settings; | |
688 | if (!revs->bloom_filter_settings) | |
689 | return; | |
690 | ||
f32dde8c DS |
691 | if (!revs->pruning.pathspec.nr) |
692 | return; | |
693 | ||
a56b9464 GS |
694 | pi = &revs->pruning.pathspec.items[0]; |
695 | last_index = pi->len - 1; | |
696 | ||
697 | /* remove single trailing slash from path, if needed */ | |
698 | if (pi->match[last_index] == '/') { | |
dc8e95ba DS |
699 | path_alloc = xstrdup(pi->match); |
700 | path_alloc[last_index] = '\0'; | |
701 | path = path_alloc; | |
a56b9464 | 702 | } else |
dc8e95ba | 703 | path = pi->match; |
a56b9464 GS |
704 | |
705 | len = strlen(path); | |
f3c2a368 TB |
706 | if (!len) { |
707 | revs->bloom_filter_settings = NULL; | |
708 | return; | |
709 | } | |
a56b9464 | 710 | |
c525ce95 SG |
711 | p = path; |
712 | while (*p) { | |
713 | /* | |
714 | * At this point, the path is normalized to use Unix-style | |
715 | * path separators. This is required due to how the | |
716 | * changed-path Bloom filters store the paths. | |
717 | */ | |
718 | if (*p == '/') | |
719 | path_component_nr++; | |
720 | p++; | |
721 | } | |
722 | ||
723 | revs->bloom_keys_nr = path_component_nr; | |
724 | ALLOC_ARRAY(revs->bloom_keys, revs->bloom_keys_nr); | |
a56b9464 | 725 | |
c525ce95 SG |
726 | fill_bloom_key(path, len, &revs->bloom_keys[0], |
727 | revs->bloom_filter_settings); | |
728 | path_component_nr = 1; | |
729 | ||
730 | p = path + len - 1; | |
731 | while (p > path) { | |
732 | if (*p == '/') | |
733 | fill_bloom_key(path, p - path, | |
734 | &revs->bloom_keys[path_component_nr++], | |
735 | revs->bloom_filter_settings); | |
736 | p--; | |
737 | } | |
a56b9464 | 738 | |
42e50e78 GS |
739 | if (trace2_is_enabled() && !bloom_filter_atexit_registered) { |
740 | atexit(trace2_bloom_filter_statistics_atexit); | |
741 | bloom_filter_atexit_registered = 1; | |
742 | } | |
743 | ||
a56b9464 GS |
744 | free(path_alloc); |
745 | } | |
746 | ||
747 | static int check_maybe_different_in_bloom_filter(struct rev_info *revs, | |
748 | struct commit *commit) | |
749 | { | |
750 | struct bloom_filter *filter; | |
c525ce95 | 751 | int result = 1, j; |
a56b9464 GS |
752 | |
753 | if (!revs->repo->objects->commit_graph) | |
754 | return -1; | |
755 | ||
c49c82aa | 756 | if (commit_graph_generation(commit) == GENERATION_NUMBER_INFINITY) |
a56b9464 GS |
757 | return -1; |
758 | ||
759 | filter = get_bloom_filter(revs->repo, commit, 0); | |
760 | ||
761 | if (!filter) { | |
42e50e78 | 762 | count_bloom_filter_not_present++; |
a56b9464 GS |
763 | return -1; |
764 | } | |
765 | ||
c525ce95 SG |
766 | for (j = 0; result && j < revs->bloom_keys_nr; j++) { |
767 | result = bloom_filter_contains(filter, | |
768 | &revs->bloom_keys[j], | |
769 | revs->bloom_filter_settings); | |
a56b9464 GS |
770 | } |
771 | ||
42e50e78 GS |
772 | if (result) |
773 | count_bloom_filter_maybe++; | |
774 | else | |
775 | count_bloom_filter_definitely_not++; | |
776 | ||
a56b9464 GS |
777 | return result; |
778 | } | |
779 | ||
ff5f5f26 | 780 | static int rev_compare_tree(struct rev_info *revs, |
a56b9464 | 781 | struct commit *parent, struct commit *commit, int nth_parent) |
a4a88b2b | 782 | { |
2e27bd77 DS |
783 | struct tree *t1 = get_commit_tree(parent); |
784 | struct tree *t2 = get_commit_tree(commit); | |
a56b9464 | 785 | int bloom_ret = 1; |
3a5e8608 | 786 | |
a4a88b2b | 787 | if (!t1) |
8efdc326 | 788 | return REV_TREE_NEW; |
ceff8e7a LT |
789 | if (!t2) |
790 | return REV_TREE_OLD; | |
78892e32 LT |
791 | |
792 | if (revs->simplify_by_decoration) { | |
793 | /* | |
794 | * If we are simplifying by decoration, then the commit | |
795 | * is worth showing if it has a tag pointing at it. | |
796 | */ | |
2608c249 | 797 | if (get_name_decoration(&commit->object)) |
78892e32 LT |
798 | return REV_TREE_DIFFERENT; |
799 | /* | |
800 | * A commit that is not pointed by a tag is uninteresting | |
801 | * if we are not limited by path. This means that you will | |
802 | * see the usual "commits that touch the paths" plus any | |
803 | * tagged commit by specifying both --simplify-by-decoration | |
804 | * and pathspec. | |
805 | */ | |
afe069d1 | 806 | if (!revs->prune_data.nr) |
78892e32 LT |
807 | return REV_TREE_SAME; |
808 | } | |
ceff8e7a | 809 | |
c525ce95 | 810 | if (revs->bloom_keys_nr && !nth_parent) { |
a56b9464 GS |
811 | bloom_ret = check_maybe_different_in_bloom_filter(revs, commit); |
812 | ||
813 | if (bloom_ret == 0) | |
814 | return REV_TREE_SAME; | |
815 | } | |
816 | ||
8efdc326 | 817 | tree_difference = REV_TREE_SAME; |
0d1e0e78 | 818 | revs->pruning.flags.has_changes = 0; |
0ee3cb88 | 819 | diff_tree_oid(&t1->object.oid, &t2->object.oid, "", &revs->pruning); |
a56b9464 | 820 | |
42e50e78 GS |
821 | if (!nth_parent) |
822 | if (bloom_ret == 1 && tree_difference == REV_TREE_SAME) | |
823 | count_bloom_filter_false_positive++; | |
824 | ||
a4a88b2b LT |
825 | return tree_difference; |
826 | } | |
827 | ||
3a5e8608 | 828 | static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit) |
a4a88b2b | 829 | { |
2e27bd77 | 830 | struct tree *t1 = get_commit_tree(commit); |
a4a88b2b LT |
831 | |
832 | if (!t1) | |
833 | return 0; | |
834 | ||
0a4ba7f8 | 835 | tree_difference = REV_TREE_SAME; |
0d1e0e78 | 836 | revs->pruning.flags.has_changes = 0; |
0ee3cb88 | 837 | diff_tree_oid(NULL, &t1->object.oid, "", &revs->pruning); |
a4a88b2b | 838 | |
0ee3cb88 | 839 | return tree_difference == REV_TREE_SAME; |
a4a88b2b LT |
840 | } |
841 | ||
d0af663e KB |
842 | struct treesame_state { |
843 | unsigned int nparents; | |
844 | unsigned char treesame[FLEX_ARRAY]; | |
845 | }; | |
846 | ||
847 | static struct treesame_state *initialise_treesame(struct rev_info *revs, struct commit *commit) | |
848 | { | |
849 | unsigned n = commit_list_count(commit->parents); | |
50a6c8ef | 850 | struct treesame_state *st = xcalloc(1, st_add(sizeof(*st), n)); |
d0af663e KB |
851 | st->nparents = n; |
852 | add_decoration(&revs->treesame, &commit->object, st); | |
853 | return st; | |
854 | } | |
855 | ||
856 | /* | |
857 | * Must be called immediately after removing the nth_parent from a commit's | |
858 | * parent list, if we are maintaining the per-parent treesame[] decoration. | |
859 | * This does not recalculate the master TREESAME flag - update_treesame() | |
860 | * should be called to update it after a sequence of treesame[] modifications | |
861 | * that may have affected it. | |
862 | */ | |
863 | static int compact_treesame(struct rev_info *revs, struct commit *commit, unsigned nth_parent) | |
864 | { | |
865 | struct treesame_state *st; | |
866 | int old_same; | |
867 | ||
868 | if (!commit->parents) { | |
869 | /* | |
870 | * Have just removed the only parent from a non-merge. | |
871 | * Different handling, as we lack decoration. | |
872 | */ | |
873 | if (nth_parent != 0) | |
874 | die("compact_treesame %u", nth_parent); | |
875 | old_same = !!(commit->object.flags & TREESAME); | |
876 | if (rev_same_tree_as_empty(revs, commit)) | |
877 | commit->object.flags |= TREESAME; | |
878 | else | |
879 | commit->object.flags &= ~TREESAME; | |
880 | return old_same; | |
881 | } | |
882 | ||
883 | st = lookup_decoration(&revs->treesame, &commit->object); | |
884 | if (!st || nth_parent >= st->nparents) | |
885 | die("compact_treesame %u", nth_parent); | |
886 | ||
887 | old_same = st->treesame[nth_parent]; | |
888 | memmove(st->treesame + nth_parent, | |
889 | st->treesame + nth_parent + 1, | |
890 | st->nparents - nth_parent - 1); | |
891 | ||
892 | /* | |
893 | * If we've just become a non-merge commit, update TREESAME | |
894 | * immediately, and remove the no-longer-needed decoration. | |
895 | * If still a merge, defer update until update_treesame(). | |
896 | */ | |
897 | if (--st->nparents == 1) { | |
898 | if (commit->parents->next) | |
899 | die("compact_treesame parents mismatch"); | |
900 | if (st->treesame[0] && revs->dense) | |
901 | commit->object.flags |= TREESAME; | |
902 | else | |
903 | commit->object.flags &= ~TREESAME; | |
904 | free(add_decoration(&revs->treesame, &commit->object, NULL)); | |
905 | } | |
906 | ||
907 | return old_same; | |
908 | } | |
909 | ||
910 | static unsigned update_treesame(struct rev_info *revs, struct commit *commit) | |
911 | { | |
912 | if (commit->parents && commit->parents->next) { | |
913 | unsigned n; | |
914 | struct treesame_state *st; | |
4d826608 KB |
915 | struct commit_list *p; |
916 | unsigned relevant_parents; | |
917 | unsigned relevant_change, irrelevant_change; | |
d0af663e KB |
918 | |
919 | st = lookup_decoration(&revs->treesame, &commit->object); | |
920 | if (!st) | |
f2fd0760 | 921 | die("update_treesame %s", oid_to_hex(&commit->object.oid)); |
4d826608 KB |
922 | relevant_parents = 0; |
923 | relevant_change = irrelevant_change = 0; | |
924 | for (p = commit->parents, n = 0; p; n++, p = p->next) { | |
925 | if (relevant_commit(p->item)) { | |
926 | relevant_change |= !st->treesame[n]; | |
927 | relevant_parents++; | |
928 | } else | |
929 | irrelevant_change |= !st->treesame[n]; | |
d0af663e | 930 | } |
4d826608 KB |
931 | if (relevant_parents ? relevant_change : irrelevant_change) |
932 | commit->object.flags &= ~TREESAME; | |
933 | else | |
934 | commit->object.flags |= TREESAME; | |
d0af663e KB |
935 | } |
936 | ||
937 | return commit->object.flags & TREESAME; | |
938 | } | |
939 | ||
4d826608 KB |
940 | static inline int limiting_can_increase_treesame(const struct rev_info *revs) |
941 | { | |
942 | /* | |
943 | * TREESAME is irrelevant unless prune && dense; | |
944 | * if simplify_history is set, we can't have a mixture of TREESAME and | |
945 | * !TREESAME INTERESTING parents (and we don't have treesame[] | |
946 | * decoration anyway); | |
947 | * if first_parent_only is set, then the TREESAME flag is locked | |
948 | * against the first parent (and again we lack treesame[] decoration). | |
949 | */ | |
950 | return revs->prune && revs->dense && | |
951 | !revs->simplify_history && | |
952 | !revs->first_parent_only; | |
953 | } | |
954 | ||
a4a88b2b LT |
955 | static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit) |
956 | { | |
957 | struct commit_list **pp, *parent; | |
d0af663e | 958 | struct treesame_state *ts = NULL; |
4d826608 KB |
959 | int relevant_change = 0, irrelevant_change = 0; |
960 | int relevant_parents, nth_parent; | |
a4a88b2b | 961 | |
53b2c823 LT |
962 | /* |
963 | * If we don't do pruning, everything is interesting | |
964 | */ | |
7dc0fe3b | 965 | if (!revs->prune) |
53b2c823 | 966 | return; |
53b2c823 | 967 | |
2e27bd77 | 968 | if (!get_commit_tree(commit)) |
a4a88b2b LT |
969 | return; |
970 | ||
971 | if (!commit->parents) { | |
3a5e8608 | 972 | if (rev_same_tree_as_empty(revs, commit)) |
7dc0fe3b | 973 | commit->object.flags |= TREESAME; |
a4a88b2b LT |
974 | return; |
975 | } | |
976 | ||
53b2c823 LT |
977 | /* |
978 | * Normal non-merge commit? If we don't want to make the | |
979 | * history dense, we consider it always to be a change.. | |
980 | */ | |
7dc0fe3b | 981 | if (!revs->dense && !commit->parents->next) |
53b2c823 | 982 | return; |
53b2c823 | 983 | |
4d826608 | 984 | for (pp = &commit->parents, nth_parent = 0, relevant_parents = 0; |
d0af663e KB |
985 | (parent = *pp) != NULL; |
986 | pp = &parent->next, nth_parent++) { | |
a4a88b2b | 987 | struct commit *p = parent->item; |
4d826608 KB |
988 | if (relevant_commit(p)) |
989 | relevant_parents++; | |
a4a88b2b | 990 | |
d0af663e KB |
991 | if (nth_parent == 1) { |
992 | /* | |
993 | * This our second loop iteration - so we now know | |
994 | * we're dealing with a merge. | |
995 | * | |
996 | * Do not compare with later parents when we care only about | |
997 | * the first parent chain, in order to avoid derailing the | |
998 | * traversal to follow a side branch that brought everything | |
999 | * in the path we are limited to by the pathspec. | |
1000 | */ | |
1001 | if (revs->first_parent_only) | |
1002 | break; | |
1003 | /* | |
1004 | * If this will remain a potentially-simplifiable | |
1005 | * merge, remember per-parent treesame if needed. | |
1006 | * Initialise the array with the comparison from our | |
1007 | * first iteration. | |
1008 | */ | |
1009 | if (revs->treesame.name && | |
1010 | !revs->simplify_history && | |
1011 | !(commit->object.flags & UNINTERESTING)) { | |
1012 | ts = initialise_treesame(revs, commit); | |
4d826608 | 1013 | if (!(irrelevant_change || relevant_change)) |
d0af663e KB |
1014 | ts->treesame[0] = 1; |
1015 | } | |
1016 | } | |
cc0e6c5a AR |
1017 | if (parse_commit(p) < 0) |
1018 | die("cannot simplify commit %s (because of %s)", | |
f2fd0760 | 1019 | oid_to_hex(&commit->object.oid), |
1020 | oid_to_hex(&p->object.oid)); | |
a56b9464 | 1021 | switch (rev_compare_tree(revs, p, commit, nth_parent)) { |
8efdc326 | 1022 | case REV_TREE_SAME: |
141efdba | 1023 | if (!revs->simplify_history || !relevant_commit(p)) { |
f3219fbb JH |
1024 | /* Even if a merge with an uninteresting |
1025 | * side branch brought the entire change | |
1026 | * we are interested in, we do not want | |
1027 | * to lose the other branches of this | |
1028 | * merge, so we just keep going. | |
1029 | */ | |
d0af663e KB |
1030 | if (ts) |
1031 | ts->treesame[nth_parent] = 1; | |
f3219fbb JH |
1032 | continue; |
1033 | } | |
a4a88b2b LT |
1034 | parent->next = NULL; |
1035 | commit->parents = parent; | |
8d049e18 DS |
1036 | |
1037 | /* | |
1038 | * A merge commit is a "diversion" if it is not | |
1039 | * TREESAME to its first parent but is TREESAME | |
1040 | * to a later parent. In the simplified history, | |
1041 | * we "divert" the history walk to the later | |
1042 | * parent. These commits are shown when "show_pulls" | |
1043 | * is enabled, so do not mark the object as | |
1044 | * TREESAME here. | |
1045 | */ | |
1046 | if (!revs->show_pulls || !nth_parent) | |
1047 | commit->object.flags |= TREESAME; | |
1048 | ||
a4a88b2b LT |
1049 | return; |
1050 | ||
8efdc326 FK |
1051 | case REV_TREE_NEW: |
1052 | if (revs->remove_empty_trees && | |
3a5e8608 | 1053 | rev_same_tree_as_empty(revs, p)) { |
c348f31a JH |
1054 | /* We are adding all the specified |
1055 | * paths from this parent, so the | |
1056 | * history beyond this parent is not | |
1057 | * interesting. Remove its parents | |
1058 | * (they are grandparents for us). | |
1059 | * IOW, we pretend this parent is a | |
1060 | * "root" commit. | |
a41e109c | 1061 | */ |
cc0e6c5a AR |
1062 | if (parse_commit(p) < 0) |
1063 | die("cannot simplify commit %s (invalid %s)", | |
f2fd0760 | 1064 | oid_to_hex(&commit->object.oid), |
1065 | oid_to_hex(&p->object.oid)); | |
c348f31a | 1066 | p->parents = NULL; |
a4a88b2b LT |
1067 | } |
1068 | /* fallthrough */ | |
ceff8e7a | 1069 | case REV_TREE_OLD: |
8efdc326 | 1070 | case REV_TREE_DIFFERENT: |
4d826608 KB |
1071 | if (relevant_commit(p)) |
1072 | relevant_change = 1; | |
1073 | else | |
1074 | irrelevant_change = 1; | |
8d049e18 DS |
1075 | |
1076 | if (!nth_parent) | |
1077 | commit->object.flags |= PULL_MERGE; | |
1078 | ||
a4a88b2b LT |
1079 | continue; |
1080 | } | |
f2fd0760 | 1081 | die("bad tree compare for commit %s", oid_to_hex(&commit->object.oid)); |
a4a88b2b | 1082 | } |
4d826608 KB |
1083 | |
1084 | /* | |
1085 | * TREESAME is straightforward for single-parent commits. For merge | |
1086 | * commits, it is most useful to define it so that "irrelevant" | |
1087 | * parents cannot make us !TREESAME - if we have any relevant | |
1088 | * parents, then we only consider TREESAMEness with respect to them, | |
1089 | * allowing irrelevant merges from uninteresting branches to be | |
1090 | * simplified away. Only if we have only irrelevant parents do we | |
1091 | * base TREESAME on them. Note that this logic is replicated in | |
1092 | * update_treesame, which should be kept in sync. | |
1093 | */ | |
1094 | if (relevant_parents ? !relevant_change : !irrelevant_change) | |
1095 | commit->object.flags |= TREESAME; | |
a4a88b2b LT |
1096 | } |
1097 | ||
5284fc5c | 1098 | static int process_parents(struct rev_info *revs, struct commit *commit, |
8320b1db | 1099 | struct commit_list **list, struct prio_queue *queue) |
a4a88b2b LT |
1100 | { |
1101 | struct commit_list *parent = commit->parents; | |
577ed5c2 | 1102 | unsigned left_flag; |
a4a88b2b | 1103 | |
3381c790 | 1104 | if (commit->object.flags & ADDED) |
cc0e6c5a | 1105 | return 0; |
3381c790 LT |
1106 | commit->object.flags |= ADDED; |
1107 | ||
a330de31 VM |
1108 | if (revs->include_check && |
1109 | !revs->include_check(commit, revs->include_check_data)) | |
1110 | return 0; | |
1111 | ||
a4a88b2b LT |
1112 | /* |
1113 | * If the commit is uninteresting, don't try to | |
1114 | * prune parents - we want the maximal uninteresting | |
1115 | * set. | |
1116 | * | |
1117 | * Normally we haven't parsed the parent | |
1118 | * yet, so we won't have a parent of a parent | |
1119 | * here. However, it may turn out that we've | |
1120 | * reached this commit some other way (where it | |
1121 | * wasn't uninteresting), in which case we need | |
1122 | * to mark its parents recursively too.. | |
1123 | */ | |
1124 | if (commit->object.flags & UNINTERESTING) { | |
1125 | while (parent) { | |
1126 | struct commit *p = parent->item; | |
1127 | parent = parent->next; | |
aeeae1b7 JH |
1128 | if (p) |
1129 | p->object.flags |= UNINTERESTING; | |
ce4e7b2a | 1130 | if (parse_commit_gently(p, 1) < 0) |
aeeae1b7 | 1131 | continue; |
a4a88b2b LT |
1132 | if (p->parents) |
1133 | mark_parents_uninteresting(p); | |
1134 | if (p->object.flags & SEEN) | |
1135 | continue; | |
1136 | p->object.flags |= SEEN; | |
5284fc5c | 1137 | if (list) |
8320b1db JK |
1138 | commit_list_insert_by_date(p, list); |
1139 | if (queue) | |
1140 | prio_queue_put(queue, p); | |
a4a88b2b | 1141 | } |
cc0e6c5a | 1142 | return 0; |
a4a88b2b LT |
1143 | } |
1144 | ||
1145 | /* | |
1146 | * Ok, the commit wasn't uninteresting. Try to | |
1147 | * simplify the commit history and find the parent | |
1148 | * that has no differences in the path set if one exists. | |
1149 | */ | |
53b2c823 | 1150 | try_to_simplify_commit(revs, commit); |
a4a88b2b | 1151 | |
ba1d4505 | 1152 | if (revs->no_walk) |
cc0e6c5a | 1153 | return 0; |
ba1d4505 | 1154 | |
577ed5c2 | 1155 | left_flag = (commit->object.flags & SYMMETRIC_LEFT); |
0053e902 | 1156 | |
d9c292e8 | 1157 | for (parent = commit->parents; parent; parent = parent->next) { |
a4a88b2b | 1158 | struct commit *p = parent->item; |
df11e196 JT |
1159 | int gently = revs->ignore_missing_links || |
1160 | revs->exclude_promisor_objects; | |
1161 | if (parse_commit_gently(p, gently) < 0) { | |
1162 | if (revs->exclude_promisor_objects && | |
1163 | is_promisor_object(&p->object.oid)) { | |
1164 | if (revs->first_parent_only) | |
1165 | break; | |
1166 | continue; | |
1167 | } | |
cc0e6c5a | 1168 | return -1; |
df11e196 | 1169 | } |
87be2523 NTND |
1170 | if (revs->sources) { |
1171 | char **slot = revision_sources_at(revs->sources, p); | |
1172 | ||
1173 | if (!*slot) | |
1174 | *slot = *revision_sources_at(revs->sources, commit); | |
1175 | } | |
577ed5c2 | 1176 | p->object.flags |= left_flag; |
ad1012eb LH |
1177 | if (!(p->object.flags & SEEN)) { |
1178 | p->object.flags |= SEEN; | |
5284fc5c | 1179 | if (list) |
8320b1db JK |
1180 | commit_list_insert_by_date(p, list); |
1181 | if (queue) | |
1182 | prio_queue_put(queue, p); | |
ad1012eb | 1183 | } |
60d30b02 | 1184 | if (revs->first_parent_only) |
d9c292e8 | 1185 | break; |
a4a88b2b | 1186 | } |
cc0e6c5a | 1187 | return 0; |
a4a88b2b LT |
1188 | } |
1189 | ||
36d56de6 | 1190 | static void cherry_pick_list(struct commit_list *list, struct rev_info *revs) |
d7a17cad JH |
1191 | { |
1192 | struct commit_list *p; | |
1193 | int left_count = 0, right_count = 0; | |
1194 | int left_first; | |
1195 | struct patch_ids ids; | |
adbbb31e | 1196 | unsigned cherry_flag; |
d7a17cad JH |
1197 | |
1198 | /* First count the commits on the left and on the right */ | |
1199 | for (p = list; p; p = p->next) { | |
1200 | struct commit *commit = p->item; | |
1201 | unsigned flags = commit->object.flags; | |
1202 | if (flags & BOUNDARY) | |
1203 | ; | |
1204 | else if (flags & SYMMETRIC_LEFT) | |
1205 | left_count++; | |
1206 | else | |
1207 | right_count++; | |
1208 | } | |
1209 | ||
36c07975 TR |
1210 | if (!left_count || !right_count) |
1211 | return; | |
1212 | ||
d7a17cad | 1213 | left_first = left_count < right_count; |
2abf3503 | 1214 | init_patch_ids(revs->repo, &ids); |
66f13625 | 1215 | ids.diffopts.pathspec = revs->diffopt.pathspec; |
d7a17cad JH |
1216 | |
1217 | /* Compute patch-ids for one side */ | |
1218 | for (p = list; p; p = p->next) { | |
1219 | struct commit *commit = p->item; | |
1220 | unsigned flags = commit->object.flags; | |
1221 | ||
1222 | if (flags & BOUNDARY) | |
1223 | continue; | |
1224 | /* | |
1225 | * If we have fewer left, left_first is set and we omit | |
1226 | * commits on the right branch in this loop. If we have | |
1227 | * fewer right, we skip the left ones. | |
1228 | */ | |
1229 | if (left_first != !!(flags & SYMMETRIC_LEFT)) | |
1230 | continue; | |
683f17ec | 1231 | add_commit_patch_id(commit, &ids); |
d7a17cad JH |
1232 | } |
1233 | ||
adbbb31e MG |
1234 | /* either cherry_mark or cherry_pick are true */ |
1235 | cherry_flag = revs->cherry_mark ? PATCHSAME : SHOWN; | |
1236 | ||
d7a17cad JH |
1237 | /* Check the other side */ |
1238 | for (p = list; p; p = p->next) { | |
1239 | struct commit *commit = p->item; | |
1240 | struct patch_id *id; | |
1241 | unsigned flags = commit->object.flags; | |
1242 | ||
1243 | if (flags & BOUNDARY) | |
1244 | continue; | |
1245 | /* | |
1246 | * If we have fewer left, left_first is set and we omit | |
1247 | * commits on the left branch in this loop. | |
1248 | */ | |
1249 | if (left_first == !!(flags & SYMMETRIC_LEFT)) | |
1250 | continue; | |
1251 | ||
1252 | /* | |
1253 | * Have we seen the same patch id? | |
1254 | */ | |
1255 | id = has_commit_patch_id(commit, &ids); | |
1256 | if (!id) | |
1257 | continue; | |
d7a17cad | 1258 | |
683f17ec KW |
1259 | commit->object.flags |= cherry_flag; |
1260 | id->commit->object.flags |= cherry_flag; | |
d7a17cad JH |
1261 | } |
1262 | ||
1263 | free_patch_ids(&ids); | |
1264 | } | |
1265 | ||
7d004199 LT |
1266 | /* How many extra uninteresting commits we want to see.. */ |
1267 | #define SLOP 5 | |
1268 | ||
dddbad72 | 1269 | static int still_interesting(struct commit_list *src, timestamp_t date, int slop, |
b6e8a3b5 | 1270 | struct commit **interesting_cache) |
3131b713 | 1271 | { |
7d004199 LT |
1272 | /* |
1273 | * No source list at all? We're definitely done.. | |
1274 | */ | |
1275 | if (!src) | |
1276 | return 0; | |
1277 | ||
1278 | /* | |
1279 | * Does the destination list contain entries with a date | |
1280 | * before the source list? Definitely _not_ done. | |
1281 | */ | |
c19d1b4e | 1282 | if (date <= src->item->date) |
7d004199 LT |
1283 | return SLOP; |
1284 | ||
1285 | /* | |
1286 | * Does the source list still have interesting commits in | |
1287 | * it? Definitely not done.. | |
1288 | */ | |
b6e8a3b5 | 1289 | if (!everybody_uninteresting(src, interesting_cache)) |
7d004199 LT |
1290 | return SLOP; |
1291 | ||
1292 | /* Ok, we're closing in.. */ | |
1293 | return slop-1; | |
3131b713 LT |
1294 | } |
1295 | ||
ebdc94f3 JH |
1296 | /* |
1297 | * "rev-list --ancestry-path A..B" computes commits that are ancestors | |
1298 | * of B but not ancestors of A but further limits the result to those | |
1299 | * that are descendants of A. This takes the list of bottom commits and | |
1300 | * the result of "A..B" without --ancestry-path, and limits the latter | |
1301 | * further to the ones that can reach one of the commits in "bottom". | |
1302 | */ | |
1303 | static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list) | |
1304 | { | |
1305 | struct commit_list *p; | |
1306 | struct commit_list *rlist = NULL; | |
1307 | int made_progress; | |
1308 | ||
1309 | /* | |
1310 | * Reverse the list so that it will be likely that we would | |
1311 | * process parents before children. | |
1312 | */ | |
1313 | for (p = list; p; p = p->next) | |
1314 | commit_list_insert(p->item, &rlist); | |
1315 | ||
1316 | for (p = bottom; p; p = p->next) | |
1317 | p->item->object.flags |= TMP_MARK; | |
1318 | ||
1319 | /* | |
1320 | * Mark the ones that can reach bottom commits in "list", | |
1321 | * in a bottom-up fashion. | |
1322 | */ | |
1323 | do { | |
1324 | made_progress = 0; | |
1325 | for (p = rlist; p; p = p->next) { | |
1326 | struct commit *c = p->item; | |
1327 | struct commit_list *parents; | |
1328 | if (c->object.flags & (TMP_MARK | UNINTERESTING)) | |
1329 | continue; | |
1330 | for (parents = c->parents; | |
1331 | parents; | |
1332 | parents = parents->next) { | |
1333 | if (!(parents->item->object.flags & TMP_MARK)) | |
1334 | continue; | |
1335 | c->object.flags |= TMP_MARK; | |
1336 | made_progress = 1; | |
1337 | break; | |
1338 | } | |
1339 | } | |
1340 | } while (made_progress); | |
1341 | ||
1342 | /* | |
1343 | * NEEDSWORK: decide if we want to remove parents that are | |
1344 | * not marked with TMP_MARK from commit->parents for commits | |
1345 | * in the resulting list. We may not want to do that, though. | |
1346 | */ | |
1347 | ||
1348 | /* | |
1349 | * The ones that are not marked with TMP_MARK are uninteresting | |
1350 | */ | |
1351 | for (p = list; p; p = p->next) { | |
1352 | struct commit *c = p->item; | |
1353 | if (c->object.flags & TMP_MARK) | |
1354 | continue; | |
1355 | c->object.flags |= UNINTERESTING; | |
1356 | } | |
1357 | ||
1358 | /* We are done with the TMP_MARK */ | |
1359 | for (p = list; p; p = p->next) | |
1360 | p->item->object.flags &= ~TMP_MARK; | |
1361 | for (p = bottom; p; p = p->next) | |
1362 | p->item->object.flags &= ~TMP_MARK; | |
1363 | free_commit_list(rlist); | |
1364 | } | |
1365 | ||
1366 | /* | |
1367 | * Before walking the history, keep the set of "negative" refs the | |
1368 | * caller has asked to exclude. | |
1369 | * | |
1370 | * This is used to compute "rev-list --ancestry-path A..B", as we need | |
1371 | * to filter the result of "A..B" further to the ones that can actually | |
1372 | * reach A. | |
1373 | */ | |
7f34a46f | 1374 | static struct commit_list *collect_bottom_commits(struct commit_list *list) |
ebdc94f3 | 1375 | { |
7f34a46f KB |
1376 | struct commit_list *elem, *bottom = NULL; |
1377 | for (elem = list; elem; elem = elem->next) | |
1378 | if (elem->item->object.flags & BOTTOM) | |
1379 | commit_list_insert(elem->item, &bottom); | |
ebdc94f3 JH |
1380 | return bottom; |
1381 | } | |
1382 | ||
60adf7d7 MG |
1383 | /* Assumes either left_only or right_only is set */ |
1384 | static void limit_left_right(struct commit_list *list, struct rev_info *revs) | |
1385 | { | |
1386 | struct commit_list *p; | |
1387 | ||
1388 | for (p = list; p; p = p->next) { | |
1389 | struct commit *commit = p->item; | |
1390 | ||
1391 | if (revs->right_only) { | |
1392 | if (commit->object.flags & SYMMETRIC_LEFT) | |
1393 | commit->object.flags |= SHOWN; | |
1394 | } else /* revs->left_only is set */ | |
1395 | if (!(commit->object.flags & SYMMETRIC_LEFT)) | |
1396 | commit->object.flags |= SHOWN; | |
1397 | } | |
1398 | } | |
1399 | ||
cc0e6c5a | 1400 | static int limit_list(struct rev_info *revs) |
a4a88b2b | 1401 | { |
7d004199 | 1402 | int slop = SLOP; |
dddbad72 | 1403 | timestamp_t date = TIME_MAX; |
a4a88b2b LT |
1404 | struct commit_list *list = revs->commits; |
1405 | struct commit_list *newlist = NULL; | |
1406 | struct commit_list **p = &newlist; | |
ebdc94f3 | 1407 | struct commit_list *bottom = NULL; |
b6e8a3b5 | 1408 | struct commit *interesting_cache = NULL; |
ebdc94f3 JH |
1409 | |
1410 | if (revs->ancestry_path) { | |
7f34a46f | 1411 | bottom = collect_bottom_commits(list); |
ebdc94f3 | 1412 | if (!bottom) |
97b03c35 | 1413 | die("--ancestry-path given but there are no bottom commits"); |
ebdc94f3 | 1414 | } |
a4a88b2b LT |
1415 | |
1416 | while (list) { | |
e510ab89 | 1417 | struct commit *commit = pop_commit(&list); |
a4a88b2b | 1418 | struct object *obj = &commit->object; |
cdcefbc9 | 1419 | show_early_output_fn_t show; |
a4a88b2b | 1420 | |
b6e8a3b5 JK |
1421 | if (commit == interesting_cache) |
1422 | interesting_cache = NULL; | |
1423 | ||
a4a88b2b LT |
1424 | if (revs->max_age != -1 && (commit->date < revs->max_age)) |
1425 | obj->flags |= UNINTERESTING; | |
5284fc5c | 1426 | if (process_parents(revs, commit, &list, NULL) < 0) |
cc0e6c5a | 1427 | return -1; |
a4a88b2b LT |
1428 | if (obj->flags & UNINTERESTING) { |
1429 | mark_parents_uninteresting(commit); | |
b6e8a3b5 | 1430 | slop = still_interesting(list, date, slop, &interesting_cache); |
7d004199 | 1431 | if (slop) |
3131b713 | 1432 | continue; |
7d004199 | 1433 | break; |
a4a88b2b | 1434 | } |
01faa91c RS |
1435 | if (revs->min_age != -1 && (commit->date > revs->min_age) && |
1436 | !revs->line_level_traverse) | |
a4a88b2b | 1437 | continue; |
7d004199 | 1438 | date = commit->date; |
a4a88b2b | 1439 | p = &commit_list_insert(commit, p)->next; |
cdcefbc9 LT |
1440 | |
1441 | show = show_early_output; | |
1442 | if (!show) | |
1443 | continue; | |
1444 | ||
1445 | show(revs, newlist); | |
1446 | show_early_output = NULL; | |
a4a88b2b | 1447 | } |
adbbb31e | 1448 | if (revs->cherry_pick || revs->cherry_mark) |
36d56de6 | 1449 | cherry_pick_list(newlist, revs); |
d7a17cad | 1450 | |
60adf7d7 MG |
1451 | if (revs->left_only || revs->right_only) |
1452 | limit_left_right(newlist, revs); | |
1453 | ||
ebdc94f3 JH |
1454 | if (bottom) { |
1455 | limit_to_ancestry(bottom, newlist); | |
1456 | free_commit_list(bottom); | |
1457 | } | |
1458 | ||
4d826608 KB |
1459 | /* |
1460 | * Check if any commits have become TREESAME by some of their parents | |
1461 | * becoming UNINTERESTING. | |
1462 | */ | |
1463 | if (limiting_can_increase_treesame(revs)) | |
1464 | for (list = newlist; list; list = list->next) { | |
1465 | struct commit *c = list->item; | |
1466 | if (c->object.flags & (UNINTERESTING | TREESAME)) | |
1467 | continue; | |
1468 | update_treesame(revs, c); | |
1469 | } | |
1470 | ||
a4a88b2b | 1471 | revs->commits = newlist; |
cc0e6c5a | 1472 | return 0; |
a4a88b2b LT |
1473 | } |
1474 | ||
df835d3a MH |
1475 | /* |
1476 | * Add an entry to refs->cmdline with the specified information. | |
1477 | * *name is copied. | |
1478 | */ | |
281eee47 JH |
1479 | static void add_rev_cmdline(struct rev_info *revs, |
1480 | struct object *item, | |
1481 | const char *name, | |
1482 | int whence, | |
1483 | unsigned flags) | |
1484 | { | |
1485 | struct rev_cmdline_info *info = &revs->cmdline; | |
071bcaab | 1486 | unsigned int nr = info->nr; |
281eee47 JH |
1487 | |
1488 | ALLOC_GROW(info->rev, nr + 1, info->alloc); | |
1489 | info->rev[nr].item = item; | |
df835d3a | 1490 | info->rev[nr].name = xstrdup(name); |
281eee47 JH |
1491 | info->rev[nr].whence = whence; |
1492 | info->rev[nr].flags = flags; | |
1493 | info->nr++; | |
1494 | } | |
1495 | ||
a765499a KB |
1496 | static void add_rev_cmdline_list(struct rev_info *revs, |
1497 | struct commit_list *commit_list, | |
1498 | int whence, | |
1499 | unsigned flags) | |
1500 | { | |
1501 | while (commit_list) { | |
1502 | struct object *object = &commit_list->item->object; | |
f2fd0760 | 1503 | add_rev_cmdline(revs, object, oid_to_hex(&object->oid), |
a765499a KB |
1504 | whence, flags); |
1505 | commit_list = commit_list->next; | |
1506 | } | |
1507 | } | |
1508 | ||
63049292 JH |
1509 | struct all_refs_cb { |
1510 | int all_flags; | |
71b03b42 | 1511 | int warned_bad_reflog; |
63049292 JH |
1512 | struct rev_info *all_revs; |
1513 | const char *name_for_errormsg; | |
ab3e1f78 | 1514 | struct worktree *wt; |
63049292 | 1515 | }; |
ae563542 | 1516 | |
ff32d342 | 1517 | int ref_excluded(struct string_list *ref_excludes, const char *path) |
e7b432c5 JH |
1518 | { |
1519 | struct string_list_item *item; | |
1520 | ||
ff32d342 | 1521 | if (!ref_excludes) |
e7b432c5 | 1522 | return 0; |
ff32d342 | 1523 | for_each_string_list_item(item, ref_excludes) { |
55d34269 | 1524 | if (!wildmatch(item->string, path, 0)) |
e7b432c5 JH |
1525 | return 1; |
1526 | } | |
1527 | return 0; | |
1528 | } | |
1529 | ||
a217dcbd MH |
1530 | static int handle_one_ref(const char *path, const struct object_id *oid, |
1531 | int flag, void *cb_data) | |
ae563542 | 1532 | { |
63049292 | 1533 | struct all_refs_cb *cb = cb_data; |
e7b432c5 JH |
1534 | struct object *object; |
1535 | ||
ff32d342 | 1536 | if (ref_excluded(cb->all_revs->ref_excludes, path)) |
e7b432c5 JH |
1537 | return 0; |
1538 | ||
654b9a90 | 1539 | object = get_reference(cb->all_revs, path, oid, cb->all_flags); |
281eee47 | 1540 | add_rev_cmdline(cb->all_revs, object, path, REV_CMD_REF, cb->all_flags); |
a58a1b01 | 1541 | add_pending_oid(cb->all_revs, path, oid, cb->all_flags); |
ae563542 LT |
1542 | return 0; |
1543 | } | |
1544 | ||
d08bae7e IL |
1545 | static void init_all_refs_cb(struct all_refs_cb *cb, struct rev_info *revs, |
1546 | unsigned flags) | |
1547 | { | |
1548 | cb->all_revs = revs; | |
1549 | cb->all_flags = flags; | |
7ba82629 | 1550 | revs->rev_input_given = 1; |
ab3e1f78 | 1551 | cb->wt = NULL; |
d08bae7e IL |
1552 | } |
1553 | ||
ff32d342 | 1554 | void clear_ref_exclusion(struct string_list **ref_excludes_p) |
e7b432c5 | 1555 | { |
ff32d342 JH |
1556 | if (*ref_excludes_p) { |
1557 | string_list_clear(*ref_excludes_p, 0); | |
1558 | free(*ref_excludes_p); | |
e7b432c5 | 1559 | } |
ff32d342 | 1560 | *ref_excludes_p = NULL; |
e7b432c5 JH |
1561 | } |
1562 | ||
ff32d342 | 1563 | void add_ref_exclusion(struct string_list **ref_excludes_p, const char *exclude) |
e7b432c5 | 1564 | { |
ff32d342 JH |
1565 | if (!*ref_excludes_p) { |
1566 | *ref_excludes_p = xcalloc(1, sizeof(**ref_excludes_p)); | |
1567 | (*ref_excludes_p)->strdup_strings = 1; | |
e7b432c5 | 1568 | } |
ff32d342 | 1569 | string_list_append(*ref_excludes_p, exclude); |
e7b432c5 JH |
1570 | } |
1571 | ||
073cf63c NTND |
1572 | static void handle_refs(struct ref_store *refs, |
1573 | struct rev_info *revs, unsigned flags, | |
1574 | int (*for_each)(struct ref_store *, each_ref_fn, void *)) | |
ae563542 | 1575 | { |
63049292 | 1576 | struct all_refs_cb cb; |
073cf63c NTND |
1577 | |
1578 | if (!refs) { | |
1579 | /* this could happen with uninitialized submodules */ | |
1580 | return; | |
1581 | } | |
1582 | ||
d08bae7e | 1583 | init_all_refs_cb(&cb, revs, flags); |
073cf63c | 1584 | for_each(refs, handle_one_ref, &cb); |
63049292 JH |
1585 | } |
1586 | ||
9461d272 | 1587 | static void handle_one_reflog_commit(struct object_id *oid, void *cb_data) |
63049292 JH |
1588 | { |
1589 | struct all_refs_cb *cb = cb_data; | |
9461d272 | 1590 | if (!is_null_oid(oid)) { |
b3c7eef9 | 1591 | struct object *o = parse_object(cb->all_revs->repo, oid); |
71b03b42 SP |
1592 | if (o) { |
1593 | o->flags |= cb->all_flags; | |
281eee47 | 1594 | /* ??? CMDLINEFLAGS ??? */ |
71b03b42 SP |
1595 | add_pending_object(cb->all_revs, o, ""); |
1596 | } | |
1597 | else if (!cb->warned_bad_reflog) { | |
46efd2d9 | 1598 | warning("reflog of '%s' references pruned commits", |
71b03b42 SP |
1599 | cb->name_for_errormsg); |
1600 | cb->warned_bad_reflog = 1; | |
1601 | } | |
63049292 | 1602 | } |
71b03b42 SP |
1603 | } |
1604 | ||
9461d272 | 1605 | static int handle_one_reflog_ent(struct object_id *ooid, struct object_id *noid, |
dddbad72 | 1606 | const char *email, timestamp_t timestamp, int tz, |
883d60fa | 1607 | const char *message, void *cb_data) |
71b03b42 | 1608 | { |
9461d272 | 1609 | handle_one_reflog_commit(ooid, cb_data); |
1610 | handle_one_reflog_commit(noid, cb_data); | |
63049292 JH |
1611 | return 0; |
1612 | } | |
1613 | ||
ab3e1f78 | 1614 | static int handle_one_reflog(const char *refname_in_wt, |
061e420a | 1615 | const struct object_id *oid, |
a89caf4b | 1616 | int flag, void *cb_data) |
63049292 JH |
1617 | { |
1618 | struct all_refs_cb *cb = cb_data; | |
ab3e1f78 NTND |
1619 | struct strbuf refname = STRBUF_INIT; |
1620 | ||
71b03b42 | 1621 | cb->warned_bad_reflog = 0; |
ab3e1f78 NTND |
1622 | strbuf_worktree_ref(cb->wt, &refname, refname_in_wt); |
1623 | cb->name_for_errormsg = refname.buf; | |
1624 | refs_for_each_reflog_ent(get_main_ref_store(the_repository), | |
1625 | refname.buf, | |
acd9544a | 1626 | handle_one_reflog_ent, cb_data); |
ab3e1f78 | 1627 | strbuf_release(&refname); |
63049292 JH |
1628 | return 0; |
1629 | } | |
1630 | ||
acd9544a NTND |
1631 | static void add_other_reflogs_to_pending(struct all_refs_cb *cb) |
1632 | { | |
1633 | struct worktree **worktrees, **p; | |
1634 | ||
03f2465b | 1635 | worktrees = get_worktrees(); |
acd9544a NTND |
1636 | for (p = worktrees; *p; p++) { |
1637 | struct worktree *wt = *p; | |
1638 | ||
1639 | if (wt->is_current) | |
1640 | continue; | |
1641 | ||
ab3e1f78 NTND |
1642 | cb->wt = wt; |
1643 | refs_for_each_reflog(get_worktree_ref_store(wt), | |
acd9544a NTND |
1644 | handle_one_reflog, |
1645 | cb); | |
1646 | } | |
1647 | free_worktrees(worktrees); | |
1648 | } | |
1649 | ||
718ccc97 | 1650 | void add_reflogs_to_pending(struct rev_info *revs, unsigned flags) |
63049292 JH |
1651 | { |
1652 | struct all_refs_cb cb; | |
2b2a5be3 | 1653 | |
63049292 JH |
1654 | cb.all_revs = revs; |
1655 | cb.all_flags = flags; | |
ab3e1f78 | 1656 | cb.wt = NULL; |
a89caf4b | 1657 | for_each_reflog(handle_one_reflog, &cb); |
acd9544a NTND |
1658 | |
1659 | if (!revs->single_worktree) | |
1660 | add_other_reflogs_to_pending(&cb); | |
ae563542 LT |
1661 | } |
1662 | ||
4fe10219 | 1663 | static void add_cache_tree(struct cache_tree *it, struct rev_info *revs, |
b4cfcde4 | 1664 | struct strbuf *path, unsigned int flags) |
4fe10219 JK |
1665 | { |
1666 | size_t baselen = path->len; | |
1667 | int i; | |
1668 | ||
1669 | if (it->entry_count >= 0) { | |
b3c7eef9 | 1670 | struct tree *tree = lookup_tree(revs->repo, &it->oid); |
b4cfcde4 | 1671 | tree->object.flags |= flags; |
4fe10219 JK |
1672 | add_pending_object_with_path(revs, &tree->object, "", |
1673 | 040000, path->buf); | |
1674 | } | |
1675 | ||
1676 | for (i = 0; i < it->subtree_nr; i++) { | |
1677 | struct cache_tree_sub *sub = it->down[i]; | |
1678 | strbuf_addf(path, "%s%s", baselen ? "/" : "", sub->name); | |
b4cfcde4 | 1679 | add_cache_tree(sub->cache_tree, revs, path, flags); |
4fe10219 JK |
1680 | strbuf_setlen(path, baselen); |
1681 | } | |
1682 | ||
1683 | } | |
1684 | ||
6c3d8181 | 1685 | static void do_add_index_objects_to_pending(struct rev_info *revs, |
b4cfcde4 JK |
1686 | struct index_state *istate, |
1687 | unsigned int flags) | |
4fe10219 JK |
1688 | { |
1689 | int i; | |
1690 | ||
6c3d8181 NTND |
1691 | for (i = 0; i < istate->cache_nr; i++) { |
1692 | struct cache_entry *ce = istate->cache[i]; | |
4fe10219 JK |
1693 | struct blob *blob; |
1694 | ||
1695 | if (S_ISGITLINK(ce->ce_mode)) | |
1696 | continue; | |
1697 | ||
b3c7eef9 | 1698 | blob = lookup_blob(revs->repo, &ce->oid); |
4fe10219 JK |
1699 | if (!blob) |
1700 | die("unable to add index blob to traversal"); | |
b4cfcde4 | 1701 | blob->object.flags |= flags; |
4fe10219 JK |
1702 | add_pending_object_with_path(revs, &blob->object, "", |
1703 | ce->ce_mode, ce->name); | |
1704 | } | |
1705 | ||
6c3d8181 | 1706 | if (istate->cache_tree) { |
4fe10219 | 1707 | struct strbuf path = STRBUF_INIT; |
b4cfcde4 | 1708 | add_cache_tree(istate->cache_tree, revs, &path, flags); |
4fe10219 JK |
1709 | strbuf_release(&path); |
1710 | } | |
1711 | } | |
1712 | ||
6c3d8181 NTND |
1713 | void add_index_objects_to_pending(struct rev_info *revs, unsigned int flags) |
1714 | { | |
be489d02 NTND |
1715 | struct worktree **worktrees, **p; |
1716 | ||
e1ff0a32 | 1717 | repo_read_index(revs->repo); |
b4cfcde4 | 1718 | do_add_index_objects_to_pending(revs, revs->repo->index, flags); |
be489d02 NTND |
1719 | |
1720 | if (revs->single_worktree) | |
1721 | return; | |
1722 | ||
03f2465b | 1723 | worktrees = get_worktrees(); |
be489d02 NTND |
1724 | for (p = worktrees; *p; p++) { |
1725 | struct worktree *wt = *p; | |
1726 | struct index_state istate = { NULL }; | |
1727 | ||
1728 | if (wt->is_current) | |
1729 | continue; /* current index already taken care of */ | |
1730 | ||
1731 | if (read_index_from(&istate, | |
a125a223 TG |
1732 | worktree_git_path(wt, "index"), |
1733 | get_worktree_git_dir(wt)) > 0) | |
b4cfcde4 | 1734 | do_add_index_objects_to_pending(revs, &istate, flags); |
be489d02 NTND |
1735 | discard_index(&istate); |
1736 | } | |
1737 | free_worktrees(worktrees); | |
6c3d8181 NTND |
1738 | } |
1739 | ||
39b44ba7 JK |
1740 | struct add_alternate_refs_data { |
1741 | struct rev_info *revs; | |
1742 | unsigned int flags; | |
1743 | }; | |
1744 | ||
1745 | static void add_one_alternate_ref(const struct object_id *oid, | |
1746 | void *vdata) | |
1747 | { | |
1748 | const char *name = ".alternate"; | |
1749 | struct add_alternate_refs_data *data = vdata; | |
1750 | struct object *obj; | |
1751 | ||
1752 | obj = get_reference(data->revs, name, oid, data->flags); | |
1753 | add_rev_cmdline(data->revs, obj, name, REV_CMD_REV, data->flags); | |
1754 | add_pending_object(data->revs, obj, name); | |
1755 | } | |
1756 | ||
1757 | static void add_alternate_refs_to_pending(struct rev_info *revs, | |
1758 | unsigned int flags) | |
1759 | { | |
1760 | struct add_alternate_refs_data data; | |
1761 | data.revs = revs; | |
1762 | data.flags = flags; | |
1763 | for_each_alternate_ref(add_one_alternate_ref, &data); | |
1764 | } | |
1765 | ||
8779351d VN |
1766 | static int add_parents_only(struct rev_info *revs, const char *arg_, int flags, |
1767 | int exclude_parent) | |
ea4a19e1 | 1768 | { |
654b9a90 | 1769 | struct object_id oid; |
ea4a19e1 JH |
1770 | struct object *it; |
1771 | struct commit *commit; | |
1772 | struct commit_list *parents; | |
8779351d | 1773 | int parent_number; |
281eee47 | 1774 | const char *arg = arg_; |
ea4a19e1 JH |
1775 | |
1776 | if (*arg == '^') { | |
7f34a46f | 1777 | flags ^= UNINTERESTING | BOTTOM; |
ea4a19e1 JH |
1778 | arg++; |
1779 | } | |
e82caf38 | 1780 | if (get_oid_committish(arg, &oid)) |
ea4a19e1 JH |
1781 | return 0; |
1782 | while (1) { | |
654b9a90 | 1783 | it = get_reference(revs, arg, &oid, 0); |
cc243c3c JH |
1784 | if (!it && revs->ignore_missing) |
1785 | return 0; | |
1974632c | 1786 | if (it->type != OBJ_TAG) |
ea4a19e1 | 1787 | break; |
9684afd9 MK |
1788 | if (!((struct tag*)it)->tagged) |
1789 | return 0; | |
654b9a90 | 1790 | oidcpy(&oid, &((struct tag*)it)->tagged->oid); |
ea4a19e1 | 1791 | } |
1974632c | 1792 | if (it->type != OBJ_COMMIT) |
ea4a19e1 JH |
1793 | return 0; |
1794 | commit = (struct commit *)it; | |
8779351d VN |
1795 | if (exclude_parent && |
1796 | exclude_parent > commit_list_count(commit->parents)) | |
1797 | return 0; | |
1798 | for (parents = commit->parents, parent_number = 1; | |
1799 | parents; | |
1800 | parents = parents->next, parent_number++) { | |
1801 | if (exclude_parent && parent_number != exclude_parent) | |
1802 | continue; | |
1803 | ||
ea4a19e1 JH |
1804 | it = &parents->item->object; |
1805 | it->flags |= flags; | |
281eee47 | 1806 | add_rev_cmdline(revs, it, arg_, REV_CMD_PARENTS_ONLY, flags); |
ea4a19e1 JH |
1807 | add_pending_object(revs, it, arg); |
1808 | } | |
1809 | return 1; | |
1810 | } | |
1811 | ||
2abf3503 NTND |
1812 | void repo_init_revisions(struct repository *r, |
1813 | struct rev_info *revs, | |
1814 | const char *prefix) | |
8efdc326 FK |
1815 | { |
1816 | memset(revs, 0, sizeof(*revs)); | |
8e8f9987 | 1817 | |
2abf3503 | 1818 | revs->repo = r; |
6b9c58f4 | 1819 | revs->abbrev = DEFAULT_ABBREV; |
8e8f9987 | 1820 | revs->ignore_merges = 1; |
9202434c | 1821 | revs->simplify_history = 1; |
67022e02 | 1822 | revs->pruning.repo = r; |
0d1e0e78 BW |
1823 | revs->pruning.flags.recursive = 1; |
1824 | revs->pruning.flags.quick = 1; | |
cd2bdc53 LT |
1825 | revs->pruning.add_remove = file_add_remove; |
1826 | revs->pruning.change = file_change; | |
a937b37e | 1827 | revs->pruning.change_fn_data = revs; |
08f704f2 | 1828 | revs->sort_order = REV_SORT_IN_GRAPH_ORDER; |
8efdc326 | 1829 | revs->dense = 1; |
db6296a5 | 1830 | revs->prefix = prefix; |
8efdc326 FK |
1831 | revs->max_age = -1; |
1832 | revs->min_age = -1; | |
d5db6c9e | 1833 | revs->skip_count = -1; |
8efdc326 | 1834 | revs->max_count = -1; |
ad5aeede | 1835 | revs->max_parents = -1; |
0893eec8 | 1836 | revs->expand_tabs_in_log = -1; |
8efdc326 | 1837 | |
cd2bdc53 | 1838 | revs->commit_format = CMIT_FMT_DEFAULT; |
fe37a9c5 | 1839 | revs->expand_tabs_in_log_default = 8; |
cd2bdc53 | 1840 | |
2abf3503 NTND |
1841 | init_grep_defaults(revs->repo); |
1842 | grep_init(&revs->grep_filter, revs->repo, prefix); | |
0843acfd | 1843 | revs->grep_filter.status_only = 1; |
0843acfd | 1844 | |
2abf3503 | 1845 | repo_diff_setup(revs->repo, &revs->diffopt); |
c0cb4a06 | 1846 | if (prefix && !revs->diffopt.prefix) { |
cd676a51 JH |
1847 | revs->diffopt.prefix = prefix; |
1848 | revs->diffopt.prefix_length = strlen(prefix); | |
1849 | } | |
3a03cf6b | 1850 | |
e6e230ee | 1851 | init_display_notes(&revs->notes_opt); |
8efdc326 FK |
1852 | } |
1853 | ||
0d2c9d67 | 1854 | static void add_pending_commit_list(struct rev_info *revs, |
ec36c42a NTND |
1855 | struct commit_list *commit_list, |
1856 | unsigned int flags) | |
0d2c9d67 RS |
1857 | { |
1858 | while (commit_list) { | |
1859 | struct object *object = &commit_list->item->object; | |
1860 | object->flags |= flags; | |
f2fd0760 | 1861 | add_pending_object(revs, object, oid_to_hex(&object->oid)); |
0d2c9d67 RS |
1862 | commit_list = commit_list->next; |
1863 | } | |
1864 | } | |
1865 | ||
ae3e5e1e JH |
1866 | static void prepare_show_merge(struct rev_info *revs) |
1867 | { | |
1868 | struct commit_list *bases; | |
1869 | struct commit *head, *other; | |
68ab61dd | 1870 | struct object_id oid; |
ae3e5e1e JH |
1871 | const char **prune = NULL; |
1872 | int i, prune_num = 1; /* counting terminating NULL */ | |
2abf3503 | 1873 | struct index_state *istate = revs->repo->index; |
ae3e5e1e | 1874 | |
68ab61dd | 1875 | if (get_oid("HEAD", &oid)) |
ae3e5e1e | 1876 | die("--merge without HEAD?"); |
bc83266a | 1877 | head = lookup_commit_or_die(&oid, "HEAD"); |
68ab61dd | 1878 | if (get_oid("MERGE_HEAD", &oid)) |
ae3e5e1e | 1879 | die("--merge without MERGE_HEAD?"); |
bc83266a | 1880 | other = lookup_commit_or_die(&oid, "MERGE_HEAD"); |
ae3e5e1e JH |
1881 | add_pending_object(revs, &head->object, "HEAD"); |
1882 | add_pending_object(revs, &other->object, "MERGE_HEAD"); | |
2ce406cc | 1883 | bases = get_merge_bases(head, other); |
7f34a46f KB |
1884 | add_rev_cmdline_list(revs, bases, REV_CMD_MERGE_BASE, UNINTERESTING | BOTTOM); |
1885 | add_pending_commit_list(revs, bases, UNINTERESTING | BOTTOM); | |
e82447b1 JH |
1886 | free_commit_list(bases); |
1887 | head->object.flags |= SYMMETRIC_LEFT; | |
ae3e5e1e | 1888 | |
2abf3503 | 1889 | if (!istate->cache_nr) |
e1ff0a32 | 1890 | repo_read_index(revs->repo); |
2abf3503 NTND |
1891 | for (i = 0; i < istate->cache_nr; i++) { |
1892 | const struct cache_entry *ce = istate->cache[i]; | |
ae3e5e1e JH |
1893 | if (!ce_stage(ce)) |
1894 | continue; | |
2abf3503 | 1895 | if (ce_path_match(istate, ce, &revs->prune_data, NULL)) { |
ae3e5e1e | 1896 | prune_num++; |
2756ca43 | 1897 | REALLOC_ARRAY(prune, prune_num); |
ae3e5e1e JH |
1898 | prune[prune_num-2] = ce->name; |
1899 | prune[prune_num-1] = NULL; | |
1900 | } | |
2abf3503 NTND |
1901 | while ((i+1 < istate->cache_nr) && |
1902 | ce_same_name(ce, istate->cache[i+1])) | |
ae3e5e1e JH |
1903 | i++; |
1904 | } | |
ed6e8038 | 1905 | clear_pathspec(&revs->prune_data); |
4a2d5ae2 | 1906 | parse_pathspec(&revs->prune_data, PATHSPEC_ALL_MAGIC & ~PATHSPEC_LITERAL, |
c6f1b920 | 1907 | PATHSPEC_PREFER_FULL | PATHSPEC_LITERAL_PATH, "", prune); |
e82447b1 | 1908 | revs->limited = 1; |
ae3e5e1e JH |
1909 | } |
1910 | ||
62faad5a JK |
1911 | static int dotdot_missing(const char *arg, char *dotdot, |
1912 | struct rev_info *revs, int symmetric) | |
1913 | { | |
1914 | if (revs->ignore_missing) | |
1915 | return 0; | |
1916 | /* de-munge so we report the full argument */ | |
1917 | *dotdot = '.'; | |
1918 | die(symmetric | |
1919 | ? "Invalid symmetric difference expression %s" | |
1920 | : "Invalid revision range %s", arg); | |
1921 | } | |
1922 | ||
1923 | static int handle_dotdot_1(const char *arg, char *dotdot, | |
1924 | struct rev_info *revs, int flags, | |
18f1ad76 JK |
1925 | int cant_be_filename, |
1926 | struct object_context *a_oc, | |
1927 | struct object_context *b_oc) | |
62faad5a JK |
1928 | { |
1929 | const char *a_name, *b_name; | |
1930 | struct object_id a_oid, b_oid; | |
1931 | struct object *a_obj, *b_obj; | |
1932 | unsigned int a_flags, b_flags; | |
1933 | int symmetric = 0; | |
1934 | unsigned int flags_exclude = flags ^ (UNINTERESTING | BOTTOM); | |
321c89bf | 1935 | unsigned int oc_flags = GET_OID_COMMITTISH | GET_OID_RECORD_PATH; |
62faad5a JK |
1936 | |
1937 | a_name = arg; | |
1938 | if (!*a_name) | |
1939 | a_name = "HEAD"; | |
1940 | ||
1941 | b_name = dotdot + 2; | |
1942 | if (*b_name == '.') { | |
1943 | symmetric = 1; | |
1944 | b_name++; | |
1945 | } | |
1946 | if (!*b_name) | |
1947 | b_name = "HEAD"; | |
1948 | ||
3a7a698e NTND |
1949 | if (get_oid_with_context(revs->repo, a_name, oc_flags, &a_oid, a_oc) || |
1950 | get_oid_with_context(revs->repo, b_name, oc_flags, &b_oid, b_oc)) | |
62faad5a JK |
1951 | return -1; |
1952 | ||
1953 | if (!cant_be_filename) { | |
1954 | *dotdot = '.'; | |
1955 | verify_non_filename(revs->prefix, arg); | |
1956 | *dotdot = '\0'; | |
1957 | } | |
1958 | ||
b3c7eef9 NTND |
1959 | a_obj = parse_object(revs->repo, &a_oid); |
1960 | b_obj = parse_object(revs->repo, &b_oid); | |
62faad5a JK |
1961 | if (!a_obj || !b_obj) |
1962 | return dotdot_missing(arg, dotdot, revs, symmetric); | |
1963 | ||
1964 | if (!symmetric) { | |
1965 | /* just A..B */ | |
1966 | b_flags = flags; | |
1967 | a_flags = flags_exclude; | |
1968 | } else { | |
1969 | /* A...B -- find merge bases between the two */ | |
1970 | struct commit *a, *b; | |
1971 | struct commit_list *exclude; | |
1972 | ||
b3c7eef9 NTND |
1973 | a = lookup_commit_reference(revs->repo, &a_obj->oid); |
1974 | b = lookup_commit_reference(revs->repo, &b_obj->oid); | |
62faad5a JK |
1975 | if (!a || !b) |
1976 | return dotdot_missing(arg, dotdot, revs, symmetric); | |
1977 | ||
1978 | exclude = get_merge_bases(a, b); | |
1979 | add_rev_cmdline_list(revs, exclude, REV_CMD_MERGE_BASE, | |
1980 | flags_exclude); | |
1981 | add_pending_commit_list(revs, exclude, flags_exclude); | |
1982 | free_commit_list(exclude); | |
1983 | ||
1984 | b_flags = flags; | |
1985 | a_flags = flags | SYMMETRIC_LEFT; | |
1986 | } | |
1987 | ||
1988 | a_obj->flags |= a_flags; | |
1989 | b_obj->flags |= b_flags; | |
1990 | add_rev_cmdline(revs, a_obj, a_name, REV_CMD_LEFT, a_flags); | |
1991 | add_rev_cmdline(revs, b_obj, b_name, REV_CMD_RIGHT, b_flags); | |
18f1ad76 JK |
1992 | add_pending_object_with_path(revs, a_obj, a_name, a_oc->mode, a_oc->path); |
1993 | add_pending_object_with_path(revs, b_obj, b_name, b_oc->mode, b_oc->path); | |
62faad5a JK |
1994 | return 0; |
1995 | } | |
1996 | ||
1997 | static int handle_dotdot(const char *arg, | |
1998 | struct rev_info *revs, int flags, | |
1999 | int cant_be_filename) | |
2000 | { | |
18f1ad76 | 2001 | struct object_context a_oc, b_oc; |
62faad5a JK |
2002 | char *dotdot = strstr(arg, ".."); |
2003 | int ret; | |
2004 | ||
2005 | if (!dotdot) | |
2006 | return -1; | |
2007 | ||
18f1ad76 JK |
2008 | memset(&a_oc, 0, sizeof(a_oc)); |
2009 | memset(&b_oc, 0, sizeof(b_oc)); | |
2010 | ||
62faad5a | 2011 | *dotdot = '\0'; |
18f1ad76 JK |
2012 | ret = handle_dotdot_1(arg, dotdot, revs, flags, cant_be_filename, |
2013 | &a_oc, &b_oc); | |
62faad5a JK |
2014 | *dotdot = '.'; |
2015 | ||
18f1ad76 JK |
2016 | free(a_oc.path); |
2017 | free(b_oc.path); | |
2018 | ||
62faad5a JK |
2019 | return ret; |
2020 | } | |
2021 | ||
8e676e8b | 2022 | int handle_revision_arg(const char *arg_, struct rev_info *revs, int flags, unsigned revarg_opt) |
5d6f0935 | 2023 | { |
249c8f4a | 2024 | struct object_context oc; |
f632dedd | 2025 | char *mark; |
5d6f0935 | 2026 | struct object *object; |
654b9a90 | 2027 | struct object_id oid; |
5d6f0935 | 2028 | int local_flags; |
281eee47 | 2029 | const char *arg = arg_; |
8e676e8b | 2030 | int cant_be_filename = revarg_opt & REVARG_CANNOT_BE_FILENAME; |
321c89bf | 2031 | unsigned get_sha1_flags = GET_OID_RECORD_PATH; |
5d6f0935 | 2032 | |
7f34a46f KB |
2033 | flags = flags & UNINTERESTING ? flags | BOTTOM : flags & ~BOTTOM; |
2034 | ||
d89797fe JK |
2035 | if (!cant_be_filename && !strcmp(arg, "..")) { |
2036 | /* | |
2037 | * Just ".."? That is not a range but the | |
2038 | * pathspec for the parent directory. | |
2039 | */ | |
2040 | return -1; | |
5d6f0935 | 2041 | } |
8779351d | 2042 | |
62faad5a JK |
2043 | if (!handle_dotdot(arg, revs, flags, revarg_opt)) |
2044 | return 0; | |
8779351d | 2045 | |
f632dedd JK |
2046 | mark = strstr(arg, "^@"); |
2047 | if (mark && !mark[2]) { | |
2048 | *mark = 0; | |
8779351d | 2049 | if (add_parents_only(revs, arg, flags, 0)) |
5d6f0935 | 2050 | return 0; |
f632dedd | 2051 | *mark = '^'; |
5d6f0935 | 2052 | } |
f632dedd JK |
2053 | mark = strstr(arg, "^!"); |
2054 | if (mark && !mark[2]) { | |
2055 | *mark = 0; | |
8779351d | 2056 | if (!add_parents_only(revs, arg, flags ^ (UNINTERESTING | BOTTOM), 0)) |
f632dedd | 2057 | *mark = '^'; |
8779351d | 2058 | } |
f632dedd JK |
2059 | mark = strstr(arg, "^-"); |
2060 | if (mark) { | |
8779351d VN |
2061 | int exclude_parent = 1; |
2062 | ||
f632dedd | 2063 | if (mark[2]) { |
8779351d | 2064 | char *end; |
f632dedd | 2065 | exclude_parent = strtoul(mark + 2, &end, 10); |
8779351d VN |
2066 | if (*end != '\0' || !exclude_parent) |
2067 | return -1; | |
2068 | } | |
2069 | ||
f632dedd | 2070 | *mark = 0; |
8779351d | 2071 | if (!add_parents_only(revs, arg, flags ^ (UNINTERESTING | BOTTOM), exclude_parent)) |
f632dedd | 2072 | *mark = '^'; |
62476c8e JH |
2073 | } |
2074 | ||
5d6f0935 JH |
2075 | local_flags = 0; |
2076 | if (*arg == '^') { | |
7f34a46f | 2077 | local_flags = UNINTERESTING | BOTTOM; |
5d6f0935 JH |
2078 | arg++; |
2079 | } | |
d5f6b1d7 JH |
2080 | |
2081 | if (revarg_opt & REVARG_COMMITTISH) | |
321c89bf | 2082 | get_sha1_flags |= GET_OID_COMMITTISH; |
d5f6b1d7 | 2083 | |
3a7a698e | 2084 | if (get_oid_with_context(revs->repo, arg, get_sha1_flags, &oid, &oc)) |
cc243c3c | 2085 | return revs->ignore_missing ? 0 : -1; |
5d6f0935 JH |
2086 | if (!cant_be_filename) |
2087 | verify_non_filename(revs->prefix, arg); | |
654b9a90 | 2088 | object = get_reference(revs, arg, &oid, flags ^ local_flags); |
4cf67869 MD |
2089 | if (!object) |
2090 | return revs->ignore_missing ? 0 : -1; | |
281eee47 | 2091 | add_rev_cmdline(revs, object, arg_, REV_CMD_REV, flags ^ local_flags); |
18f1ad76 JK |
2092 | add_pending_object_with_path(revs, object, arg, oc.mode, oc.path); |
2093 | free(oc.path); | |
5d6f0935 JH |
2094 | return 0; |
2095 | } | |
2096 | ||
91633995 | 2097 | static void read_pathspec_from_stdin(struct strbuf *sb, |
c972bf4c | 2098 | struct strvec *prune) |
4da5af31 | 2099 | { |
7fa3c2ad | 2100 | while (strbuf_getline(sb, stdin) != EOF) |
c972bf4c | 2101 | strvec_push(prune, sb->buf); |
60da8b15 JH |
2102 | } |
2103 | ||
4da5af31 | 2104 | static void read_revisions_from_stdin(struct rev_info *revs, |
c972bf4c | 2105 | struct strvec *prune) |
1fc561d1 | 2106 | { |
63d564b3 | 2107 | struct strbuf sb; |
60da8b15 | 2108 | int seen_dashdash = 0; |
4c30d504 JK |
2109 | int save_warning; |
2110 | ||
2111 | save_warning = warn_on_object_refname_ambiguity; | |
2112 | warn_on_object_refname_ambiguity = 0; | |
1fc561d1 | 2113 | |
63d564b3 | 2114 | strbuf_init(&sb, 1000); |
6e8d46f9 | 2115 | while (strbuf_getline(&sb, stdin) != EOF) { |
63d564b3 | 2116 | int len = sb.len; |
1fc561d1 AB |
2117 | if (!len) |
2118 | break; | |
60da8b15 JH |
2119 | if (sb.buf[0] == '-') { |
2120 | if (len == 2 && sb.buf[1] == '-') { | |
2121 | seen_dashdash = 1; | |
2122 | break; | |
2123 | } | |
1fc561d1 | 2124 | die("options not supported in --stdin mode"); |
60da8b15 | 2125 | } |
31faeb20 | 2126 | if (handle_revision_arg(sb.buf, revs, 0, |
70d26c6e | 2127 | REVARG_CANNOT_BE_FILENAME)) |
63d564b3 | 2128 | die("bad revision '%s'", sb.buf); |
1fc561d1 | 2129 | } |
60da8b15 | 2130 | if (seen_dashdash) |
91633995 | 2131 | read_pathspec_from_stdin(&sb, prune); |
4c30d504 | 2132 | |
63d564b3 | 2133 | strbuf_release(&sb); |
4c30d504 | 2134 | warn_on_object_refname_ambiguity = save_warning; |
1fc561d1 AB |
2135 | } |
2136 | ||
2d10c555 | 2137 | static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what) |
bd95fcd3 | 2138 | { |
0843acfd | 2139 | append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what); |
2d10c555 JH |
2140 | } |
2141 | ||
a4d7d2c6 | 2142 | static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern) |
2d10c555 | 2143 | { |
a4d7d2c6 | 2144 | append_header_grep_pattern(&revs->grep_filter, field, pattern); |
bd95fcd3 JH |
2145 | } |
2146 | ||
2147 | static void add_message_grep(struct rev_info *revs, const char *pattern) | |
2148 | { | |
2d10c555 | 2149 | add_grep(revs, pattern, GREP_PATTERN_BODY); |
bd95fcd3 JH |
2150 | } |
2151 | ||
6b61ec05 | 2152 | static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv, |
bbcde41a MD |
2153 | int *unkc, const char **unkv, |
2154 | const struct setup_revision_opt* opt) | |
02e54220 PH |
2155 | { |
2156 | const char *arg = argv[0]; | |
7d7b86f7 MM |
2157 | const char *optarg; |
2158 | int argcount; | |
fd521245 | 2159 | const unsigned hexsz = the_hash_algo->hexsz; |
02e54220 PH |
2160 | |
2161 | /* pseudo revision arguments */ | |
2162 | if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") || | |
2163 | !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") || | |
2164 | !strcmp(arg, "--reflog") || !strcmp(arg, "--not") || | |
ad3f9a71 | 2165 | !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") || |
59556548 | 2166 | !strcmp(arg, "--bisect") || starts_with(arg, "--glob=") || |
4fe10219 | 2167 | !strcmp(arg, "--indexed-objects") || |
39b44ba7 | 2168 | !strcmp(arg, "--alternate-refs") || |
07768e03 | 2169 | starts_with(arg, "--exclude=") || |
59556548 CC |
2170 | starts_with(arg, "--branches=") || starts_with(arg, "--tags=") || |
2171 | starts_with(arg, "--remotes=") || starts_with(arg, "--no-walk=")) | |
02e54220 PH |
2172 | { |
2173 | unkv[(*unkc)++] = arg; | |
0fe8c138 | 2174 | return 1; |
02e54220 PH |
2175 | } |
2176 | ||
7d7b86f7 MM |
2177 | if ((argcount = parse_long_opt("max-count", argv, &optarg))) { |
2178 | revs->max_count = atoi(optarg); | |
5853caec | 2179 | revs->no_walk = 0; |
7d7b86f7 MM |
2180 | return argcount; |
2181 | } else if ((argcount = parse_long_opt("skip", argv, &optarg))) { | |
2182 | revs->skip_count = atoi(optarg); | |
2183 | return argcount; | |
02e54220 | 2184 | } else if ((*arg == '-') && isdigit(arg[1])) { |
e3fa568c JH |
2185 | /* accept -<digit>, like traditional "head" */ |
2186 | if (strtol_i(arg + 1, 10, &revs->max_count) < 0 || | |
2187 | revs->max_count < 0) | |
2188 | die("'%s': not a non-negative integer", arg + 1); | |
5853caec | 2189 | revs->no_walk = 0; |
02e54220 PH |
2190 | } else if (!strcmp(arg, "-n")) { |
2191 | if (argc <= 1) | |
2192 | return error("-n requires an argument"); | |
2193 | revs->max_count = atoi(argv[1]); | |
5853caec | 2194 | revs->no_walk = 0; |
02e54220 | 2195 | return 2; |
479b3d97 SG |
2196 | } else if (skip_prefix(arg, "-n", &optarg)) { |
2197 | revs->max_count = atoi(optarg); | |
5853caec | 2198 | revs->no_walk = 0; |
7d7b86f7 MM |
2199 | } else if ((argcount = parse_long_opt("max-age", argv, &optarg))) { |
2200 | revs->max_age = atoi(optarg); | |
2201 | return argcount; | |
2202 | } else if ((argcount = parse_long_opt("since", argv, &optarg))) { | |
2203 | revs->max_age = approxidate(optarg); | |
2204 | return argcount; | |
2205 | } else if ((argcount = parse_long_opt("after", argv, &optarg))) { | |
2206 | revs->max_age = approxidate(optarg); | |
2207 | return argcount; | |
2208 | } else if ((argcount = parse_long_opt("min-age", argv, &optarg))) { | |
2209 | revs->min_age = atoi(optarg); | |
2210 | return argcount; | |
2211 | } else if ((argcount = parse_long_opt("before", argv, &optarg))) { | |
2212 | revs->min_age = approxidate(optarg); | |
2213 | return argcount; | |
2214 | } else if ((argcount = parse_long_opt("until", argv, &optarg))) { | |
2215 | revs->min_age = approxidate(optarg); | |
2216 | return argcount; | |
02e54220 PH |
2217 | } else if (!strcmp(arg, "--first-parent")) { |
2218 | revs->first_parent_only = 1; | |
ebdc94f3 JH |
2219 | } else if (!strcmp(arg, "--ancestry-path")) { |
2220 | revs->ancestry_path = 1; | |
cb7529e1 | 2221 | revs->simplify_history = 0; |
ebdc94f3 | 2222 | revs->limited = 1; |
02e54220 PH |
2223 | } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) { |
2224 | init_reflog_walk(&revs->reflog_info); | |
2225 | } else if (!strcmp(arg, "--default")) { | |
2226 | if (argc <= 1) | |
2227 | return error("bad --default argument"); | |
2228 | revs->def = argv[1]; | |
2229 | return 2; | |
2230 | } else if (!strcmp(arg, "--merge")) { | |
2231 | revs->show_merge = 1; | |
2232 | } else if (!strcmp(arg, "--topo-order")) { | |
08f704f2 | 2233 | revs->sort_order = REV_SORT_IN_GRAPH_ORDER; |
02e54220 | 2234 | revs->topo_order = 1; |
6546b593 JH |
2235 | } else if (!strcmp(arg, "--simplify-merges")) { |
2236 | revs->simplify_merges = 1; | |
a52f0071 | 2237 | revs->topo_order = 1; |
6546b593 JH |
2238 | revs->rewrite_parents = 1; |
2239 | revs->simplify_history = 0; | |
2240 | revs->limited = 1; | |
78892e32 LT |
2241 | } else if (!strcmp(arg, "--simplify-by-decoration")) { |
2242 | revs->simplify_merges = 1; | |
a52f0071 | 2243 | revs->topo_order = 1; |
78892e32 LT |
2244 | revs->rewrite_parents = 1; |
2245 | revs->simplify_history = 0; | |
2246 | revs->simplify_by_decoration = 1; | |
2247 | revs->limited = 1; | |
2248 | revs->prune = 1; | |
02e54220 | 2249 | } else if (!strcmp(arg, "--date-order")) { |
08f704f2 | 2250 | revs->sort_order = REV_SORT_BY_COMMIT_DATE; |
02e54220 | 2251 | revs->topo_order = 1; |
81c6b38b JH |
2252 | } else if (!strcmp(arg, "--author-date-order")) { |
2253 | revs->sort_order = REV_SORT_BY_AUTHOR_DATE; | |
02e54220 | 2254 | revs->topo_order = 1; |
dffc651e SG |
2255 | } else if (!strcmp(arg, "--early-output")) { |
2256 | revs->early_output = 100; | |
2257 | revs->topo_order = 1; | |
2258 | } else if (skip_prefix(arg, "--early-output=", &optarg)) { | |
2259 | if (strtoul_ui(optarg, 10, &revs->early_output) < 0) | |
2260 | die("'%s': not a non-negative integer", optarg); | |
2261 | revs->topo_order = 1; | |
02e54220 PH |
2262 | } else if (!strcmp(arg, "--parents")) { |
2263 | revs->rewrite_parents = 1; | |
2264 | revs->print_parents = 1; | |
2265 | } else if (!strcmp(arg, "--dense")) { | |
2266 | revs->dense = 1; | |
2267 | } else if (!strcmp(arg, "--sparse")) { | |
2268 | revs->dense = 0; | |
ce5b6f9b SB |
2269 | } else if (!strcmp(arg, "--in-commit-order")) { |
2270 | revs->tree_blobs_in_commit_order = 1; | |
02e54220 PH |
2271 | } else if (!strcmp(arg, "--remove-empty")) { |
2272 | revs->remove_empty_trees = 1; | |
b8e8db28 | 2273 | } else if (!strcmp(arg, "--merges")) { |
ad5aeede | 2274 | revs->min_parents = 2; |
02e54220 | 2275 | } else if (!strcmp(arg, "--no-merges")) { |
ad5aeede | 2276 | revs->max_parents = 1; |
479b3d97 SG |
2277 | } else if (skip_prefix(arg, "--min-parents=", &optarg)) { |
2278 | revs->min_parents = atoi(optarg); | |
9ada7aee | 2279 | } else if (!strcmp(arg, "--no-min-parents")) { |
ad5aeede | 2280 | revs->min_parents = 0; |
479b3d97 SG |
2281 | } else if (skip_prefix(arg, "--max-parents=", &optarg)) { |
2282 | revs->max_parents = atoi(optarg); | |
9ada7aee | 2283 | } else if (!strcmp(arg, "--no-max-parents")) { |
ad5aeede | 2284 | revs->max_parents = -1; |
02e54220 PH |
2285 | } else if (!strcmp(arg, "--boundary")) { |
2286 | revs->boundary = 1; | |
2287 | } else if (!strcmp(arg, "--left-right")) { | |
2288 | revs->left_right = 1; | |
60adf7d7 | 2289 | } else if (!strcmp(arg, "--left-only")) { |
24852d91 | 2290 | if (revs->right_only) |
94f605ec MG |
2291 | die("--left-only is incompatible with --right-only" |
2292 | " or --cherry"); | |
60adf7d7 MG |
2293 | revs->left_only = 1; |
2294 | } else if (!strcmp(arg, "--right-only")) { | |
24852d91 JH |
2295 | if (revs->left_only) |
2296 | die("--right-only is incompatible with --left-only"); | |
60adf7d7 | 2297 | revs->right_only = 1; |
94f605ec MG |
2298 | } else if (!strcmp(arg, "--cherry")) { |
2299 | if (revs->left_only) | |
2300 | die("--cherry is incompatible with --left-only"); | |
2301 | revs->cherry_mark = 1; | |
2302 | revs->right_only = 1; | |
ad5aeede | 2303 | revs->max_parents = 1; |
94f605ec | 2304 | revs->limited = 1; |
f69c5018 TR |
2305 | } else if (!strcmp(arg, "--count")) { |
2306 | revs->count = 1; | |
adbbb31e MG |
2307 | } else if (!strcmp(arg, "--cherry-mark")) { |
2308 | if (revs->cherry_pick) | |
2309 | die("--cherry-mark is incompatible with --cherry-pick"); | |
2310 | revs->cherry_mark = 1; | |
2311 | revs->limited = 1; /* needs limit_list() */ | |
02e54220 | 2312 | } else if (!strcmp(arg, "--cherry-pick")) { |
adbbb31e MG |
2313 | if (revs->cherry_mark) |
2314 | die("--cherry-pick is incompatible with --cherry-mark"); | |
02e54220 PH |
2315 | revs->cherry_pick = 1; |
2316 | revs->limited = 1; | |
2317 | } else if (!strcmp(arg, "--objects")) { | |
2318 | revs->tag_objects = 1; | |
2319 | revs->tree_objects = 1; | |
2320 | revs->blob_objects = 1; | |
2321 | } else if (!strcmp(arg, "--objects-edge")) { | |
2322 | revs->tag_objects = 1; | |
2323 | revs->tree_objects = 1; | |
2324 | revs->blob_objects = 1; | |
2325 | revs->edge_hint = 1; | |
1684c1b2 | 2326 | } else if (!strcmp(arg, "--objects-edge-aggressive")) { |
2327 | revs->tag_objects = 1; | |
2328 | revs->tree_objects = 1; | |
2329 | revs->blob_objects = 1; | |
2330 | revs->edge_hint = 1; | |
2331 | revs->edge_hint_aggressive = 1; | |
5a48d240 JH |
2332 | } else if (!strcmp(arg, "--verify-objects")) { |
2333 | revs->tag_objects = 1; | |
2334 | revs->tree_objects = 1; | |
2335 | revs->blob_objects = 1; | |
2336 | revs->verify_objects = 1; | |
02e54220 PH |
2337 | } else if (!strcmp(arg, "--unpacked")) { |
2338 | revs->unpacked = 1; | |
59556548 | 2339 | } else if (starts_with(arg, "--unpacked=")) { |
03a9683d | 2340 | die("--unpacked=<packfile> no longer supported."); |
02e54220 PH |
2341 | } else if (!strcmp(arg, "-r")) { |
2342 | revs->diff = 1; | |
0d1e0e78 | 2343 | revs->diffopt.flags.recursive = 1; |
02e54220 PH |
2344 | } else if (!strcmp(arg, "-t")) { |
2345 | revs->diff = 1; | |
0d1e0e78 BW |
2346 | revs->diffopt.flags.recursive = 1; |
2347 | revs->diffopt.flags.tree_in_recursive = 1; | |
02e54220 PH |
2348 | } else if (!strcmp(arg, "-m")) { |
2349 | revs->ignore_merges = 0; | |
2350 | } else if (!strcmp(arg, "-c")) { | |
2351 | revs->diff = 1; | |
2352 | revs->dense_combined_merges = 0; | |
2353 | revs->combine_merges = 1; | |
d76ce4f7 EN |
2354 | } else if (!strcmp(arg, "--combined-all-paths")) { |
2355 | revs->diff = 1; | |
2356 | revs->combined_all_paths = 1; | |
02e54220 PH |
2357 | } else if (!strcmp(arg, "--cc")) { |
2358 | revs->diff = 1; | |
2359 | revs->dense_combined_merges = 1; | |
2360 | revs->combine_merges = 1; | |
2361 | } else if (!strcmp(arg, "-v")) { | |
2362 | revs->verbose_header = 1; | |
2363 | } else if (!strcmp(arg, "--pretty")) { | |
2364 | revs->verbose_header = 1; | |
66b2ed09 | 2365 | revs->pretty_given = 1; |
ae18165f | 2366 | get_commit_format(NULL, revs); |
479b3d97 SG |
2367 | } else if (skip_prefix(arg, "--pretty=", &optarg) || |
2368 | skip_prefix(arg, "--format=", &optarg)) { | |
7d7b86f7 MM |
2369 | /* |
2370 | * Detached form ("--pretty X" as opposed to "--pretty=X") | |
2371 | * not allowed, since the argument is optional. | |
2372 | */ | |
02e54220 | 2373 | revs->verbose_header = 1; |
66b2ed09 | 2374 | revs->pretty_given = 1; |
479b3d97 | 2375 | get_commit_format(optarg, revs); |
7cc13c71 | 2376 | } else if (!strcmp(arg, "--expand-tabs")) { |
fe37a9c5 | 2377 | revs->expand_tabs_in_log = 8; |
0893eec8 JH |
2378 | } else if (!strcmp(arg, "--no-expand-tabs")) { |
2379 | revs->expand_tabs_in_log = 0; | |
fe37a9c5 JH |
2380 | } else if (skip_prefix(arg, "--expand-tabs=", &arg)) { |
2381 | int val; | |
2382 | if (strtol_i(arg, 10, &val) < 0 || val < 0) | |
2383 | die("'%s': not a non-negative integer", arg); | |
2384 | revs->expand_tabs_in_log = val; | |
7249e912 | 2385 | } else if (!strcmp(arg, "--show-notes") || !strcmp(arg, "--notes")) { |
1d729751 | 2386 | enable_default_display_notes(&revs->notes_opt, &revs->show_notes); |
66b2ed09 | 2387 | revs->show_notes_given = 1; |
0c37f1fc JH |
2388 | } else if (!strcmp(arg, "--show-signature")) { |
2389 | revs->show_signature = 1; | |
aa379999 MJ |
2390 | } else if (!strcmp(arg, "--no-show-signature")) { |
2391 | revs->show_signature = 0; | |
479b3d97 SG |
2392 | } else if (!strcmp(arg, "--show-linear-break")) { |
2393 | revs->break_bar = " .........."; | |
1b32dece NTND |
2394 | revs->track_linear = 1; |
2395 | revs->track_first_time = 1; | |
479b3d97 SG |
2396 | } else if (skip_prefix(arg, "--show-linear-break=", &optarg)) { |
2397 | revs->break_bar = xstrdup(optarg); | |
1b32dece NTND |
2398 | revs->track_linear = 1; |
2399 | revs->track_first_time = 1; | |
479b3d97 SG |
2400 | } else if (skip_prefix(arg, "--show-notes=", &optarg) || |
2401 | skip_prefix(arg, "--notes=", &optarg)) { | |
479b3d97 SG |
2402 | if (starts_with(arg, "--show-notes=") && |
2403 | revs->notes_opt.use_default_notes < 0) | |
2404 | revs->notes_opt.use_default_notes = 1; | |
1d729751 | 2405 | enable_ref_display_notes(&revs->notes_opt, &revs->show_notes, optarg); |
452538c3 | 2406 | revs->show_notes_given = 1; |
66b2ed09 | 2407 | } else if (!strcmp(arg, "--no-notes")) { |
1d729751 | 2408 | disable_display_notes(&revs->notes_opt, &revs->show_notes); |
66b2ed09 | 2409 | revs->show_notes_given = 1; |
894a9d33 TR |
2410 | } else if (!strcmp(arg, "--standard-notes")) { |
2411 | revs->show_notes_given = 1; | |
3a03cf6b | 2412 | revs->notes_opt.use_default_notes = 1; |
894a9d33 | 2413 | } else if (!strcmp(arg, "--no-standard-notes")) { |
3a03cf6b | 2414 | revs->notes_opt.use_default_notes = 0; |
de84accc NS |
2415 | } else if (!strcmp(arg, "--oneline")) { |
2416 | revs->verbose_header = 1; | |
2417 | get_commit_format("oneline", revs); | |
7dccadf3 | 2418 | revs->pretty_given = 1; |
de84accc | 2419 | revs->abbrev_commit = 1; |
02e54220 PH |
2420 | } else if (!strcmp(arg, "--graph")) { |
2421 | revs->topo_order = 1; | |
2422 | revs->rewrite_parents = 1; | |
2423 | revs->graph = graph_init(revs); | |
19d097e3 EB |
2424 | } else if (!strcmp(arg, "--encode-email-headers")) { |
2425 | revs->encode_email_headers = 1; | |
2426 | } else if (!strcmp(arg, "--no-encode-email-headers")) { | |
2427 | revs->encode_email_headers = 0; | |
02e54220 PH |
2428 | } else if (!strcmp(arg, "--root")) { |
2429 | revs->show_root_diff = 1; | |
2430 | } else if (!strcmp(arg, "--no-commit-id")) { | |
2431 | revs->no_commit_id = 1; | |
2432 | } else if (!strcmp(arg, "--always")) { | |
2433 | revs->always_show_header = 1; | |
2434 | } else if (!strcmp(arg, "--no-abbrev")) { | |
2435 | revs->abbrev = 0; | |
2436 | } else if (!strcmp(arg, "--abbrev")) { | |
2437 | revs->abbrev = DEFAULT_ABBREV; | |
479b3d97 SG |
2438 | } else if (skip_prefix(arg, "--abbrev=", &optarg)) { |
2439 | revs->abbrev = strtoul(optarg, NULL, 10); | |
02e54220 PH |
2440 | if (revs->abbrev < MINIMUM_ABBREV) |
2441 | revs->abbrev = MINIMUM_ABBREV; | |
fd521245 | 2442 | else if (revs->abbrev > hexsz) |
2443 | revs->abbrev = hexsz; | |
02e54220 PH |
2444 | } else if (!strcmp(arg, "--abbrev-commit")) { |
2445 | revs->abbrev_commit = 1; | |
0c47695a JS |
2446 | revs->abbrev_commit_given = 1; |
2447 | } else if (!strcmp(arg, "--no-abbrev-commit")) { | |
2448 | revs->abbrev_commit = 0; | |
02e54220 PH |
2449 | } else if (!strcmp(arg, "--full-diff")) { |
2450 | revs->diff = 1; | |
2451 | revs->full_diff = 1; | |
8d049e18 DS |
2452 | } else if (!strcmp(arg, "--show-pulls")) { |
2453 | revs->show_pulls = 1; | |
02e54220 PH |
2454 | } else if (!strcmp(arg, "--full-history")) { |
2455 | revs->simplify_history = 0; | |
2456 | } else if (!strcmp(arg, "--relative-date")) { | |
a5481a6c | 2457 | revs->date_mode.type = DATE_RELATIVE; |
f4ea32f0 | 2458 | revs->date_mode_explicit = 1; |
7d7b86f7 | 2459 | } else if ((argcount = parse_long_opt("date", argv, &optarg))) { |
a5481a6c | 2460 | parse_date_format(optarg, &revs->date_mode); |
f4ea32f0 | 2461 | revs->date_mode_explicit = 1; |
7d7b86f7 | 2462 | return argcount; |
02e54220 PH |
2463 | } else if (!strcmp(arg, "--log-size")) { |
2464 | revs->show_log_size = 1; | |
2465 | } | |
2466 | /* | |
2467 | * Grepping the commit log | |
2468 | */ | |
7d7b86f7 MM |
2469 | else if ((argcount = parse_long_opt("author", argv, &optarg))) { |
2470 | add_header_grep(revs, GREP_HEADER_AUTHOR, optarg); | |
2471 | return argcount; | |
2472 | } else if ((argcount = parse_long_opt("committer", argv, &optarg))) { | |
2473 | add_header_grep(revs, GREP_HEADER_COMMITTER, optarg); | |
2474 | return argcount; | |
72fd13f7 NTND |
2475 | } else if ((argcount = parse_long_opt("grep-reflog", argv, &optarg))) { |
2476 | add_header_grep(revs, GREP_HEADER_REFLOG, optarg); | |
2477 | return argcount; | |
7d7b86f7 MM |
2478 | } else if ((argcount = parse_long_opt("grep", argv, &optarg))) { |
2479 | add_message_grep(revs, optarg); | |
2480 | return argcount; | |
17bf35a3 JH |
2481 | } else if (!strcmp(arg, "--grep-debug")) { |
2482 | revs->grep_filter.debug = 1; | |
727b6fc3 | 2483 | } else if (!strcmp(arg, "--basic-regexp")) { |
8465541e | 2484 | revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_BRE; |
02e54220 | 2485 | } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) { |
8465541e | 2486 | revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_ERE; |
02e54220 | 2487 | } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) { |
9e3cbc59 | 2488 | revs->grep_filter.ignore_case = 1; |
c1ddc461 | 2489 | revs->diffopt.pickaxe_opts |= DIFF_PICKAXE_IGNORE_CASE; |
02e54220 | 2490 | } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) { |
8465541e | 2491 | revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_FIXED; |
7531a2dd | 2492 | } else if (!strcmp(arg, "--perl-regexp") || !strcmp(arg, "-P")) { |
8465541e | 2493 | revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_PCRE; |
02e54220 | 2494 | } else if (!strcmp(arg, "--all-match")) { |
0843acfd | 2495 | revs->grep_filter.all_match = 1; |
22dfa8a2 CJ |
2496 | } else if (!strcmp(arg, "--invert-grep")) { |
2497 | revs->invert_grep = 1; | |
7d7b86f7 MM |
2498 | } else if ((argcount = parse_long_opt("encoding", argv, &optarg))) { |
2499 | if (strcmp(optarg, "none")) | |
2500 | git_log_output_encoding = xstrdup(optarg); | |
02e54220 PH |
2501 | else |
2502 | git_log_output_encoding = ""; | |
7d7b86f7 | 2503 | return argcount; |
02e54220 PH |
2504 | } else if (!strcmp(arg, "--reverse")) { |
2505 | revs->reverse ^= 1; | |
2506 | } else if (!strcmp(arg, "--children")) { | |
2507 | revs->children.name = "children"; | |
2508 | revs->limited = 1; | |
cc243c3c JH |
2509 | } else if (!strcmp(arg, "--ignore-missing")) { |
2510 | revs->ignore_missing = 1; | |
bbcde41a | 2511 | } else if (opt && opt->allow_exclude_promisor_objects && |
669b1d2a | 2512 | !strcmp(arg, "--exclude-promisor-objects")) { |
df11e196 | 2513 | if (fetch_if_missing) |
033abf97 | 2514 | BUG("exclude_promisor_objects can only be used when fetch_if_missing is 0"); |
df11e196 | 2515 | revs->exclude_promisor_objects = 1; |
02e54220 | 2516 | } else { |
a97262c6 | 2517 | int opts = diff_opt_parse(&revs->diffopt, argv, argc, revs->prefix); |
02e54220 PH |
2518 | if (!opts) |
2519 | unkv[(*unkc)++] = arg; | |
2520 | return opts; | |
2521 | } | |
1b32dece NTND |
2522 | if (revs->graph && revs->track_linear) |
2523 | die("--show-linear-break and --graph are incompatible"); | |
02e54220 PH |
2524 | |
2525 | return 1; | |
2526 | } | |
2527 | ||
6b61ec05 PH |
2528 | void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx, |
2529 | const struct option *options, | |
2530 | const char * const usagestr[]) | |
2531 | { | |
2532 | int n = handle_revision_opt(revs, ctx->argc, ctx->argv, | |
bbcde41a | 2533 | &ctx->cpidx, ctx->out, NULL); |
6b61ec05 PH |
2534 | if (n <= 0) { |
2535 | error("unknown option `%s'", ctx->argv[0]); | |
2536 | usage_with_options(usagestr, options); | |
2537 | } | |
2538 | ctx->argv += n; | |
2539 | ctx->argc -= n; | |
2540 | } | |
2541 | ||
073cf63c NTND |
2542 | static int for_each_bisect_ref(struct ref_store *refs, each_ref_fn fn, |
2543 | void *cb_data, const char *term) | |
2544 | { | |
cb46d630 AD |
2545 | struct strbuf bisect_refs = STRBUF_INIT; |
2546 | int status; | |
2547 | strbuf_addf(&bisect_refs, "refs/bisect/%s", term); | |
073cf63c | 2548 | status = refs_for_each_fullref_in(refs, bisect_refs.buf, fn, cb_data, 0); |
cb46d630 AD |
2549 | strbuf_release(&bisect_refs); |
2550 | return status; | |
2551 | } | |
2552 | ||
073cf63c | 2553 | static int for_each_bad_bisect_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) |
ad3f9a71 | 2554 | { |
073cf63c | 2555 | return for_each_bisect_ref(refs, fn, cb_data, term_bad); |
ad3f9a71 LT |
2556 | } |
2557 | ||
073cf63c | 2558 | static int for_each_good_bisect_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data) |
ad3f9a71 | 2559 | { |
073cf63c | 2560 | return for_each_bisect_ref(refs, fn, cb_data, term_good); |
ad3f9a71 LT |
2561 | } |
2562 | ||
f6aca0dc JN |
2563 | static int handle_revision_pseudo_opt(const char *submodule, |
2564 | struct rev_info *revs, | |
2565 | int argc, const char **argv, int *flags) | |
2566 | { | |
2567 | const char *arg = argv[0]; | |
2568 | const char *optarg; | |
073cf63c | 2569 | struct ref_store *refs; |
f6aca0dc JN |
2570 | int argcount; |
2571 | ||
073cf63c | 2572 | if (submodule) { |
d0c39a49 NTND |
2573 | /* |
2574 | * We need some something like get_submodule_worktrees() | |
2575 | * before we can go through all worktrees of a submodule, | |
2576 | * .e.g with adding all HEADs from --all, which is not | |
2577 | * supported right now, so stick to single worktree. | |
2578 | */ | |
2579 | if (!revs->single_worktree) | |
033abf97 | 2580 | BUG("--single-worktree cannot be used together with submodule"); |
073cf63c NTND |
2581 | refs = get_submodule_ref_store(submodule); |
2582 | } else | |
b3c7eef9 | 2583 | refs = get_main_ref_store(revs->repo); |
073cf63c | 2584 | |
0fc63ec4 JN |
2585 | /* |
2586 | * NOTE! | |
2587 | * | |
2588 | * Commands like "git shortlog" will not accept the options below | |
2589 | * unless parse_revision_opt queues them (as opposed to erroring | |
2590 | * out). | |
2591 | * | |
2592 | * When implementing your new pseudo-option, remember to | |
2593 | * register it in the list at the top of handle_revision_opt. | |
2594 | */ | |
f6aca0dc | 2595 | if (!strcmp(arg, "--all")) { |
073cf63c NTND |
2596 | handle_refs(refs, revs, *flags, refs_for_each_ref); |
2597 | handle_refs(refs, revs, *flags, refs_head_ref); | |
d0c39a49 NTND |
2598 | if (!revs->single_worktree) { |
2599 | struct all_refs_cb cb; | |
2600 | ||
2601 | init_all_refs_cb(&cb, revs, *flags); | |
2602 | other_head_refs(handle_one_ref, &cb); | |
2603 | } | |
ff32d342 | 2604 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc | 2605 | } else if (!strcmp(arg, "--branches")) { |
073cf63c | 2606 | handle_refs(refs, revs, *flags, refs_for_each_branch_ref); |
ff32d342 | 2607 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc | 2608 | } else if (!strcmp(arg, "--bisect")) { |
cb46d630 | 2609 | read_bisect_terms(&term_bad, &term_good); |
073cf63c NTND |
2610 | handle_refs(refs, revs, *flags, for_each_bad_bisect_ref); |
2611 | handle_refs(refs, revs, *flags ^ (UNINTERESTING | BOTTOM), | |
2612 | for_each_good_bisect_ref); | |
f6aca0dc JN |
2613 | revs->bisect = 1; |
2614 | } else if (!strcmp(arg, "--tags")) { | |
073cf63c | 2615 | handle_refs(refs, revs, *flags, refs_for_each_tag_ref); |
ff32d342 | 2616 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc | 2617 | } else if (!strcmp(arg, "--remotes")) { |
073cf63c | 2618 | handle_refs(refs, revs, *flags, refs_for_each_remote_ref); |
ff32d342 | 2619 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc JN |
2620 | } else if ((argcount = parse_long_opt("glob", argv, &optarg))) { |
2621 | struct all_refs_cb cb; | |
2622 | init_all_refs_cb(&cb, revs, *flags); | |
a217dcbd | 2623 | for_each_glob_ref(handle_one_ref, optarg, &cb); |
ff32d342 | 2624 | clear_ref_exclusion(&revs->ref_excludes); |
e7b432c5 JH |
2625 | return argcount; |
2626 | } else if ((argcount = parse_long_opt("exclude", argv, &optarg))) { | |
ff32d342 | 2627 | add_ref_exclusion(&revs->ref_excludes, optarg); |
f6aca0dc | 2628 | return argcount; |
8b1d9136 | 2629 | } else if (skip_prefix(arg, "--branches=", &optarg)) { |
f6aca0dc JN |
2630 | struct all_refs_cb cb; |
2631 | init_all_refs_cb(&cb, revs, *flags); | |
8b1d9136 | 2632 | for_each_glob_ref_in(handle_one_ref, optarg, "refs/heads/", &cb); |
ff32d342 | 2633 | clear_ref_exclusion(&revs->ref_excludes); |
8b1d9136 | 2634 | } else if (skip_prefix(arg, "--tags=", &optarg)) { |
f6aca0dc JN |
2635 | struct all_refs_cb cb; |
2636 | init_all_refs_cb(&cb, revs, *flags); | |
8b1d9136 | 2637 | for_each_glob_ref_in(handle_one_ref, optarg, "refs/tags/", &cb); |
ff32d342 | 2638 | clear_ref_exclusion(&revs->ref_excludes); |
8b1d9136 | 2639 | } else if (skip_prefix(arg, "--remotes=", &optarg)) { |
f6aca0dc JN |
2640 | struct all_refs_cb cb; |
2641 | init_all_refs_cb(&cb, revs, *flags); | |
8b1d9136 | 2642 | for_each_glob_ref_in(handle_one_ref, optarg, "refs/remotes/", &cb); |
ff32d342 | 2643 | clear_ref_exclusion(&revs->ref_excludes); |
f6aca0dc | 2644 | } else if (!strcmp(arg, "--reflog")) { |
718ccc97 | 2645 | add_reflogs_to_pending(revs, *flags); |
4fe10219 JK |
2646 | } else if (!strcmp(arg, "--indexed-objects")) { |
2647 | add_index_objects_to_pending(revs, *flags); | |
39b44ba7 JK |
2648 | } else if (!strcmp(arg, "--alternate-refs")) { |
2649 | add_alternate_refs_to_pending(revs, *flags); | |
f6aca0dc | 2650 | } else if (!strcmp(arg, "--not")) { |
7f34a46f | 2651 | *flags ^= UNINTERESTING | BOTTOM; |
f6aca0dc | 2652 | } else if (!strcmp(arg, "--no-walk")) { |
ca92e59e | 2653 | revs->no_walk = REVISION_WALK_NO_WALK_SORTED; |
8b1d9136 | 2654 | } else if (skip_prefix(arg, "--no-walk=", &optarg)) { |
ca92e59e MZ |
2655 | /* |
2656 | * Detached form ("--no-walk X" as opposed to "--no-walk=X") | |
2657 | * not allowed, since the argument is optional. | |
2658 | */ | |
8b1d9136 | 2659 | if (!strcmp(optarg, "sorted")) |
ca92e59e | 2660 | revs->no_walk = REVISION_WALK_NO_WALK_SORTED; |
8b1d9136 | 2661 | else if (!strcmp(optarg, "unsorted")) |
ca92e59e MZ |
2662 | revs->no_walk = REVISION_WALK_NO_WALK_UNSORTED; |
2663 | else | |
2664 | return error("invalid argument to --no-walk"); | |
f6aca0dc JN |
2665 | } else if (!strcmp(arg, "--do-walk")) { |
2666 | revs->no_walk = 0; | |
32619f99 NTND |
2667 | } else if (!strcmp(arg, "--single-worktree")) { |
2668 | revs->single_worktree = 1; | |
f6aca0dc JN |
2669 | } else { |
2670 | return 0; | |
2671 | } | |
2672 | ||
2673 | return 1; | |
2674 | } | |
2675 | ||
ce113604 JK |
2676 | static void NORETURN diagnose_missing_default(const char *def) |
2677 | { | |
ce113604 JK |
2678 | int flags; |
2679 | const char *refname; | |
2680 | ||
744c040b | 2681 | refname = resolve_ref_unsafe(def, 0, NULL, &flags); |
ce113604 JK |
2682 | if (!refname || !(flags & REF_ISSYMREF) || (flags & REF_ISBROKEN)) |
2683 | die(_("your current branch appears to be broken")); | |
2684 | ||
2685 | skip_prefix(refname, "refs/heads/", &refname); | |
2686 | die(_("your current branch '%s' does not have any commits yet"), | |
2687 | refname); | |
2688 | } | |
2689 | ||
ae563542 LT |
2690 | /* |
2691 | * Parse revision information, filling in the "rev_info" structure, | |
2692 | * and removing the used arguments from the argument list. | |
2693 | * | |
765ac8ec LT |
2694 | * Returns the number of arguments left that weren't recognized |
2695 | * (which are also moved to the head of the argument list) | |
ae563542 | 2696 | */ |
32962c9b | 2697 | int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct setup_revision_opt *opt) |
ae563542 | 2698 | { |
a12cbe23 | 2699 | int i, flags, left, seen_dashdash, got_rev_arg = 0, revarg_opt; |
c972bf4c | 2700 | struct strvec prune_data = STRVEC_INIT; |
9ef6aeb0 | 2701 | const char *submodule = NULL; |
19e8789b | 2702 | int seen_end_of_options = 0; |
9ef6aeb0 HV |
2703 | |
2704 | if (opt) | |
2705 | submodule = opt->submodule; | |
ae563542 | 2706 | |
ae563542 | 2707 | /* First, search for "--" */ |
6d5b93f2 | 2708 | if (opt && opt->assume_dashdash) { |
ae563542 | 2709 | seen_dashdash = 1; |
6d5b93f2 CB |
2710 | } else { |
2711 | seen_dashdash = 0; | |
2712 | for (i = 1; i < argc; i++) { | |
2713 | const char *arg = argv[i]; | |
2714 | if (strcmp(arg, "--")) | |
2715 | continue; | |
2716 | argv[i] = NULL; | |
2717 | argc = i; | |
2718 | if (argv[i + 1]) | |
c972bf4c | 2719 | strvec_pushv(&prune_data, argv + i + 1); |
6d5b93f2 CB |
2720 | seen_dashdash = 1; |
2721 | break; | |
2722 | } | |
ae563542 LT |
2723 | } |
2724 | ||
02e54220 PH |
2725 | /* Second, deal with arguments and options */ |
2726 | flags = 0; | |
d5f6b1d7 JH |
2727 | revarg_opt = opt ? opt->revarg_opt : 0; |
2728 | if (seen_dashdash) | |
2729 | revarg_opt |= REVARG_CANNOT_BE_FILENAME; | |
02e54220 | 2730 | for (left = i = 1; i < argc; i++) { |
ae563542 | 2731 | const char *arg = argv[i]; |
19e8789b | 2732 | if (!seen_end_of_options && *arg == '-') { |
cd2bdc53 | 2733 | int opts; |
02e54220 | 2734 | |
f6aca0dc JN |
2735 | opts = handle_revision_pseudo_opt(submodule, |
2736 | revs, argc - i, argv + i, | |
2737 | &flags); | |
2738 | if (opts > 0) { | |
2739 | i += opts - 1; | |
8e64006e JS |
2740 | continue; |
2741 | } | |
f6aca0dc | 2742 | |
8b3dce56 JH |
2743 | if (!strcmp(arg, "--stdin")) { |
2744 | if (revs->disable_stdin) { | |
2745 | argv[left++] = arg; | |
2746 | continue; | |
2747 | } | |
a12cbe23 | 2748 | if (revs->read_from_stdin++) |
8b3dce56 | 2749 | die("--stdin given twice?"); |
60da8b15 | 2750 | read_revisions_from_stdin(revs, &prune_data); |
8b3dce56 JH |
2751 | continue; |
2752 | } | |
2d10c555 | 2753 | |
19e8789b JK |
2754 | if (!strcmp(arg, "--end-of-options")) { |
2755 | seen_end_of_options = 1; | |
2756 | continue; | |
2757 | } | |
2758 | ||
bbcde41a MD |
2759 | opts = handle_revision_opt(revs, argc - i, argv + i, |
2760 | &left, argv, opt); | |
cd2bdc53 | 2761 | if (opts > 0) { |
cd2bdc53 LT |
2762 | i += opts - 1; |
2763 | continue; | |
2764 | } | |
02e54220 PH |
2765 | if (opts < 0) |
2766 | exit(128); | |
ae563542 LT |
2767 | continue; |
2768 | } | |
ae563542 | 2769 | |
8e676e8b JH |
2770 | |
2771 | if (handle_revision_arg(arg, revs, flags, revarg_opt)) { | |
5d6f0935 JH |
2772 | int j; |
2773 | if (seen_dashdash || *arg == '^') | |
ae563542 LT |
2774 | die("bad revision '%s'", arg); |
2775 | ||
ea92f41f JH |
2776 | /* If we didn't have a "--": |
2777 | * (1) all filenames must exist; | |
2778 | * (2) all rev-args must not be interpretable | |
2779 | * as a valid filename. | |
2780 | * but the latter we have checked in the main loop. | |
2781 | */ | |
e23d0b4a | 2782 | for (j = i; j < argc; j++) |
023e37c3 | 2783 | verify_filename(revs->prefix, argv[j], j == i); |
e23d0b4a | 2784 | |
c972bf4c | 2785 | strvec_pushv(&prune_data, argv + i); |
ae563542 LT |
2786 | break; |
2787 | } | |
8fcaca3f DO |
2788 | else |
2789 | got_rev_arg = 1; | |
ae563542 | 2790 | } |
5d6f0935 | 2791 | |
d70a9eb6 | 2792 | if (prune_data.nr) { |
93e7d672 JH |
2793 | /* |
2794 | * If we need to introduce the magic "a lone ':' means no | |
2795 | * pathspec whatsoever", here is the place to do so. | |
2796 | * | |
2797 | * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) { | |
2798 | * prune_data.nr = 0; | |
2799 | * prune_data.alloc = 0; | |
2800 | * free(prune_data.path); | |
2801 | * prune_data.path = NULL; | |
2802 | * } else { | |
2803 | * terminate prune_data.alloc with NULL and | |
2804 | * call init_pathspec() to set revs->prune_data here. | |
2805 | * } | |
2806 | */ | |
0fdc2ae5 | 2807 | parse_pathspec(&revs->prune_data, 0, 0, |
d70a9eb6 | 2808 | revs->prefix, prune_data.v); |
4da5af31 | 2809 | } |
c972bf4c | 2810 | strvec_clear(&prune_data); |
5486ef0e | 2811 | |
02e54220 | 2812 | if (revs->def == NULL) |
32962c9b | 2813 | revs->def = opt ? opt->def : NULL; |
b4490059 JH |
2814 | if (opt && opt->tweak) |
2815 | opt->tweak(revs, opt); | |
02e54220 | 2816 | if (revs->show_merge) |
ae3e5e1e | 2817 | prepare_show_merge(revs); |
5d34d1ac | 2818 | if (revs->def && !revs->pending.nr && !revs->rev_input_given && !got_rev_arg) { |
654b9a90 | 2819 | struct object_id oid; |
cd2bdc53 | 2820 | struct object *object; |
249c8f4a | 2821 | struct object_context oc; |
3a7a698e | 2822 | if (get_oid_with_context(revs->repo, revs->def, 0, &oid, &oc)) |
ce113604 | 2823 | diagnose_missing_default(revs->def); |
654b9a90 | 2824 | object = get_reference(revs, revs->def, &oid, 0); |
249c8f4a | 2825 | add_pending_object_with_mode(revs, object, revs->def, oc.mode); |
ae563542 | 2826 | } |
8efdc326 | 2827 | |
b7bb760d LT |
2828 | /* Did the user ask for any diff output? Run the diff! */ |
2829 | if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT) | |
2830 | revs->diff = 1; | |
2831 | ||
0faf2da7 | 2832 | /* Pickaxe, diff-filter and rename following need diffs */ |
cf63051a | 2833 | if ((revs->diffopt.pickaxe_opts & DIFF_PICKAXE_KINDS_MASK) || |
0faf2da7 | 2834 | revs->diffopt.filter || |
0d1e0e78 | 2835 | revs->diffopt.flags.follow_renames) |
b7bb760d LT |
2836 | revs->diff = 1; |
2837 | ||
15af58c1 SB |
2838 | if (revs->diffopt.objfind) |
2839 | revs->simplify_history = 0; | |
2840 | ||
002933f3 SG |
2841 | if (revs->line_level_traverse) { |
2842 | if (want_ancestry(revs)) | |
2843 | revs->limited = 1; | |
2844 | revs->topo_order = 1; | |
2845 | } | |
2846 | ||
f0d9cc41 | 2847 | if (revs->topo_order && !generation_numbers_enabled(the_repository)) |
53069686 JH |
2848 | revs->limited = 1; |
2849 | ||
afe069d1 | 2850 | if (revs->prune_data.nr) { |
bd1928df | 2851 | copy_pathspec(&revs->pruning.pathspec, &revs->prune_data); |
750f7b66 | 2852 | /* Can't prune commits with rename following: the paths change.. */ |
0d1e0e78 | 2853 | if (!revs->diffopt.flags.follow_renames) |
53b2c823 | 2854 | revs->prune = 1; |
cd2bdc53 | 2855 | if (!revs->full_diff) |
bd1928df NTND |
2856 | copy_pathspec(&revs->diffopt.pathspec, |
2857 | &revs->prune_data); | |
8efdc326 | 2858 | } |
b4490059 | 2859 | if (revs->combine_merges) |
cd2bdc53 | 2860 | revs->ignore_merges = 0; |
d76ce4f7 EN |
2861 | if (revs->combined_all_paths && !revs->combine_merges) |
2862 | die("--combined-all-paths makes no sense without -c or --cc"); | |
2863 | ||
cd2bdc53 | 2864 | revs->diffopt.abbrev = revs->abbrev; |
12da1d1f | 2865 | |
28452655 | 2866 | diff_setup_done(&revs->diffopt); |
8efdc326 | 2867 | |
918d4e1c JH |
2868 | grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED, |
2869 | &revs->grep_filter); | |
44570188 ÆAB |
2870 | if (!is_encoding_utf8(get_log_output_encoding())) |
2871 | revs->grep_filter.ignore_locale = 1; | |
0843acfd | 2872 | compile_grep_patterns(&revs->grep_filter); |
bd95fcd3 | 2873 | |
d56651c0 SP |
2874 | if (revs->reverse && revs->reflog_info) |
2875 | die("cannot combine --reverse with --walk-reflogs"); | |
82fd0f4a JK |
2876 | if (revs->reflog_info && revs->limited) |
2877 | die("cannot combine --walk-reflogs with history-limiting options"); | |
8bb65883 | 2878 | if (revs->rewrite_parents && revs->children.name) |
f35f5603 | 2879 | die("cannot combine --parents and --children"); |
d56651c0 | 2880 | |
7fefda5c AS |
2881 | /* |
2882 | * Limitations on the graph functionality | |
2883 | */ | |
2884 | if (revs->reverse && revs->graph) | |
2885 | die("cannot combine --reverse with --graph"); | |
2886 | ||
2887 | if (revs->reflog_info && revs->graph) | |
2888 | die("cannot combine --walk-reflogs with --graph"); | |
695985f4 DJ |
2889 | if (revs->no_walk && revs->graph) |
2890 | die("cannot combine --no-walk with --graph"); | |
baa6378f JH |
2891 | if (!revs->reflog_info && revs->grep_filter.use_reflog_filter) |
2892 | die("cannot use --grep-reflog without --walk-reflogs"); | |
7fefda5c | 2893 | |
f88851c6 KD |
2894 | if (revs->first_parent_only && revs->bisect) |
2895 | die(_("--first-parent is incompatible with --bisect")); | |
2896 | ||
05314efa JK |
2897 | if (revs->line_level_traverse && |
2898 | (revs->diffopt.output_format & ~(DIFF_FORMAT_PATCH | DIFF_FORMAT_NO_OUTPUT))) | |
2899 | die(_("-L does not yet support diff formats besides -p and -s")); | |
2900 | ||
0893eec8 JH |
2901 | if (revs->expand_tabs_in_log < 0) |
2902 | revs->expand_tabs_in_log = revs->expand_tabs_in_log_default; | |
2903 | ||
ae563542 LT |
2904 | return left; |
2905 | } | |
a4a88b2b | 2906 | |
f35f5603 JH |
2907 | static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child) |
2908 | { | |
2909 | struct commit_list *l = xcalloc(1, sizeof(*l)); | |
2910 | ||
2911 | l->item = child; | |
2912 | l->next = add_decoration(&revs->children, &parent->object, l); | |
2913 | } | |
2914 | ||
d0af663e | 2915 | static int remove_duplicate_parents(struct rev_info *revs, struct commit *commit) |
6546b593 | 2916 | { |
d0af663e | 2917 | struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object); |
6546b593 JH |
2918 | struct commit_list **pp, *p; |
2919 | int surviving_parents; | |
2920 | ||
2921 | /* Examine existing parents while marking ones we have seen... */ | |
2922 | pp = &commit->parents; | |
d0af663e | 2923 | surviving_parents = 0; |
6546b593 JH |
2924 | while ((p = *pp) != NULL) { |
2925 | struct commit *parent = p->item; | |
2926 | if (parent->object.flags & TMP_MARK) { | |
2927 | *pp = p->next; | |
d0af663e KB |
2928 | if (ts) |
2929 | compact_treesame(revs, commit, surviving_parents); | |
6546b593 JH |
2930 | continue; |
2931 | } | |
2932 | parent->object.flags |= TMP_MARK; | |
d0af663e | 2933 | surviving_parents++; |
6546b593 JH |
2934 | pp = &p->next; |
2935 | } | |
d0af663e | 2936 | /* clear the temporary mark */ |
6546b593 JH |
2937 | for (p = commit->parents; p; p = p->next) { |
2938 | p->item->object.flags &= ~TMP_MARK; | |
6546b593 | 2939 | } |
d0af663e | 2940 | /* no update_treesame() - removing duplicates can't affect TREESAME */ |
6546b593 JH |
2941 | return surviving_parents; |
2942 | } | |
2943 | ||
faf0156b JH |
2944 | struct merge_simplify_state { |
2945 | struct commit *simplified; | |
2946 | }; | |
2947 | ||
2948 | static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit) | |
2949 | { | |
2950 | struct merge_simplify_state *st; | |
2951 | ||
2952 | st = lookup_decoration(&revs->merge_simplification, &commit->object); | |
2953 | if (!st) { | |
2954 | st = xcalloc(1, sizeof(*st)); | |
2955 | add_decoration(&revs->merge_simplification, &commit->object, st); | |
2956 | } | |
2957 | return st; | |
2958 | } | |
2959 | ||
91633995 | 2960 | static int mark_redundant_parents(struct commit *commit) |
d0af663e KB |
2961 | { |
2962 | struct commit_list *h = reduce_heads(commit->parents); | |
2963 | int i = 0, marked = 0; | |
2964 | struct commit_list *po, *pn; | |
2965 | ||
2966 | /* Want these for sanity-checking only */ | |
2967 | int orig_cnt = commit_list_count(commit->parents); | |
2968 | int cnt = commit_list_count(h); | |
2969 | ||
2970 | /* | |
2971 | * Not ready to remove items yet, just mark them for now, based | |
2972 | * on the output of reduce_heads(). reduce_heads outputs the reduced | |
2973 | * set in its original order, so this isn't too hard. | |
2974 | */ | |
2975 | po = commit->parents; | |
2976 | pn = h; | |
2977 | while (po) { | |
2978 | if (pn && po->item == pn->item) { | |
2979 | pn = pn->next; | |
2980 | i++; | |
2981 | } else { | |
2982 | po->item->object.flags |= TMP_MARK; | |
2983 | marked++; | |
2984 | } | |
2985 | po=po->next; | |
2986 | } | |
2987 | ||
2988 | if (i != cnt || cnt+marked != orig_cnt) | |
2989 | die("mark_redundant_parents %d %d %d %d", orig_cnt, cnt, i, marked); | |
2990 | ||
2991 | free_commit_list(h); | |
2992 | ||
2993 | return marked; | |
2994 | } | |
2995 | ||
91633995 | 2996 | static int mark_treesame_root_parents(struct commit *commit) |
143f1eaf KB |
2997 | { |
2998 | struct commit_list *p; | |
2999 | int marked = 0; | |
3000 | ||
3001 | for (p = commit->parents; p; p = p->next) { | |
3002 | struct commit *parent = p->item; | |
3003 | if (!parent->parents && (parent->object.flags & TREESAME)) { | |
3004 | parent->object.flags |= TMP_MARK; | |
3005 | marked++; | |
3006 | } | |
3007 | } | |
3008 | ||
3009 | return marked; | |
3010 | } | |
3011 | ||
9c129eab KB |
3012 | /* |
3013 | * Awkward naming - this means one parent we are TREESAME to. | |
3014 | * cf mark_treesame_root_parents: root parents that are TREESAME (to an | |
3015 | * empty tree). Better name suggestions? | |
3016 | */ | |
3017 | static int leave_one_treesame_to_parent(struct rev_info *revs, struct commit *commit) | |
3018 | { | |
3019 | struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object); | |
3020 | struct commit *unmarked = NULL, *marked = NULL; | |
3021 | struct commit_list *p; | |
3022 | unsigned n; | |
3023 | ||
3024 | for (p = commit->parents, n = 0; p; p = p->next, n++) { | |
3025 | if (ts->treesame[n]) { | |
3026 | if (p->item->object.flags & TMP_MARK) { | |
3027 | if (!marked) | |
3028 | marked = p->item; | |
3029 | } else { | |
3030 | if (!unmarked) { | |
3031 | unmarked = p->item; | |
3032 | break; | |
3033 | } | |
3034 | } | |
3035 | } | |
3036 | } | |
3037 | ||
3038 | /* | |
3039 | * If we are TREESAME to a marked-for-deletion parent, but not to any | |
3040 | * unmarked parents, unmark the first TREESAME parent. This is the | |
3041 | * parent that the default simplify_history==1 scan would have followed, | |
3042 | * and it doesn't make sense to omit that path when asking for a | |
3043 | * simplified full history. Retaining it improves the chances of | |
3044 | * understanding odd missed merges that took an old version of a file. | |
3045 | * | |
3046 | * Example: | |
3047 | * | |
3048 | * I--------*X A modified the file, but mainline merge X used | |
3049 | * \ / "-s ours", so took the version from I. X is | |
3050 | * `-*A--' TREESAME to I and !TREESAME to A. | |
3051 | * | |
3052 | * Default log from X would produce "I". Without this check, | |
3053 | * --full-history --simplify-merges would produce "I-A-X", showing | |
3054 | * the merge commit X and that it changed A, but not making clear that | |
3055 | * it had just taken the I version. With this check, the topology above | |
3056 | * is retained. | |
3057 | * | |
3058 | * Note that it is possible that the simplification chooses a different | |
3059 | * TREESAME parent from the default, in which case this test doesn't | |
3060 | * activate, and we _do_ drop the default parent. Example: | |
3061 | * | |
3062 | * I------X A modified the file, but it was reverted in B, | |
3063 | * \ / meaning mainline merge X is TREESAME to both | |
3064 | * *A-*B parents. | |
3065 | * | |
3066 | * Default log would produce "I" by following the first parent; | |
3067 | * --full-history --simplify-merges will produce "I-A-B". But this is a | |
3068 | * reasonable result - it presents a logical full history leading from | |
3069 | * I to X, and X is not an important merge. | |
3070 | */ | |
3071 | if (!unmarked && marked) { | |
3072 | marked->object.flags &= ~TMP_MARK; | |
3073 | return 1; | |
3074 | } | |
3075 | ||
3076 | return 0; | |
3077 | } | |
3078 | ||
d0af663e KB |
3079 | static int remove_marked_parents(struct rev_info *revs, struct commit *commit) |
3080 | { | |
3081 | struct commit_list **pp, *p; | |
3082 | int nth_parent, removed = 0; | |
3083 | ||
3084 | pp = &commit->parents; | |
3085 | nth_parent = 0; | |
3086 | while ((p = *pp) != NULL) { | |
3087 | struct commit *parent = p->item; | |
3088 | if (parent->object.flags & TMP_MARK) { | |
3089 | parent->object.flags &= ~TMP_MARK; | |
3090 | *pp = p->next; | |
3091 | free(p); | |
3092 | removed++; | |
3093 | compact_treesame(revs, commit, nth_parent); | |
3094 | continue; | |
3095 | } | |
3096 | pp = &p->next; | |
3097 | nth_parent++; | |
3098 | } | |
3099 | ||
3100 | /* Removing parents can only increase TREESAMEness */ | |
3101 | if (removed && !(commit->object.flags & TREESAME)) | |
3102 | update_treesame(revs, commit); | |
3103 | ||
3104 | return nth_parent; | |
3105 | } | |
3106 | ||
faf0156b | 3107 | static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail) |
6546b593 JH |
3108 | { |
3109 | struct commit_list *p; | |
4d826608 | 3110 | struct commit *parent; |
faf0156b | 3111 | struct merge_simplify_state *st, *pst; |
6546b593 JH |
3112 | int cnt; |
3113 | ||
faf0156b JH |
3114 | st = locate_simplify_state(revs, commit); |
3115 | ||
6546b593 | 3116 | /* |
6546b593 JH |
3117 | * Have we handled this one? |
3118 | */ | |
faf0156b | 3119 | if (st->simplified) |
6546b593 JH |
3120 | return tail; |
3121 | ||
3122 | /* | |
3123 | * An UNINTERESTING commit simplifies to itself, so does a | |
3124 | * root commit. We do not rewrite parents of such commit | |
3125 | * anyway. | |
3126 | */ | |
3127 | if ((commit->object.flags & UNINTERESTING) || !commit->parents) { | |
faf0156b | 3128 | st->simplified = commit; |
6546b593 JH |
3129 | return tail; |
3130 | } | |
3131 | ||
3132 | /* | |
6e513ba3 JH |
3133 | * Do we know what commit all of our parents that matter |
3134 | * should be rewritten to? Otherwise we are not ready to | |
3135 | * rewrite this one yet. | |
6546b593 JH |
3136 | */ |
3137 | for (cnt = 0, p = commit->parents; p; p = p->next) { | |
faf0156b JH |
3138 | pst = locate_simplify_state(revs, p->item); |
3139 | if (!pst->simplified) { | |
6546b593 JH |
3140 | tail = &commit_list_insert(p->item, tail)->next; |
3141 | cnt++; | |
3142 | } | |
6e513ba3 JH |
3143 | if (revs->first_parent_only) |
3144 | break; | |
6546b593 | 3145 | } |
53030f8d JH |
3146 | if (cnt) { |
3147 | tail = &commit_list_insert(commit, tail)->next; | |
6546b593 | 3148 | return tail; |
53030f8d | 3149 | } |
6546b593 JH |
3150 | |
3151 | /* | |
d0af663e KB |
3152 | * Rewrite our list of parents. Note that this cannot |
3153 | * affect our TREESAME flags in any way - a commit is | |
3154 | * always TREESAME to its simplification. | |
6546b593 | 3155 | */ |
faf0156b JH |
3156 | for (p = commit->parents; p; p = p->next) { |
3157 | pst = locate_simplify_state(revs, p->item); | |
3158 | p->item = pst->simplified; | |
6e513ba3 JH |
3159 | if (revs->first_parent_only) |
3160 | break; | |
faf0156b | 3161 | } |
4b7f53da | 3162 | |
0290bf12 | 3163 | if (revs->first_parent_only) |
6e513ba3 | 3164 | cnt = 1; |
0290bf12 | 3165 | else |
d0af663e | 3166 | cnt = remove_duplicate_parents(revs, commit); |
6546b593 JH |
3167 | |
3168 | /* | |
3169 | * It is possible that we are a merge and one side branch | |
3170 | * does not have any commit that touches the given paths; | |
d0af663e KB |
3171 | * in such a case, the immediate parent from that branch |
3172 | * will be rewritten to be the merge base. | |
6546b593 JH |
3173 | * |
3174 | * o----X X: the commit we are looking at; | |
3175 | * / / o: a commit that touches the paths; | |
3176 | * ---o----' | |
3177 | * | |
143f1eaf KB |
3178 | * Further, a merge of an independent branch that doesn't |
3179 | * touch the path will reduce to a treesame root parent: | |
3180 | * | |
3181 | * ----o----X X: the commit we are looking at; | |
3182 | * / o: a commit that touches the paths; | |
3183 | * r r: a root commit not touching the paths | |
3184 | * | |
3185 | * Detect and simplify both cases. | |
6546b593 JH |
3186 | */ |
3187 | if (1 < cnt) { | |
91633995 JK |
3188 | int marked = mark_redundant_parents(commit); |
3189 | marked += mark_treesame_root_parents(commit); | |
9c129eab KB |
3190 | if (marked) |
3191 | marked -= leave_one_treesame_to_parent(revs, commit); | |
d0af663e KB |
3192 | if (marked) |
3193 | cnt = remove_marked_parents(revs, commit); | |
6546b593 JH |
3194 | } |
3195 | ||
3196 | /* | |
3197 | * A commit simplifies to itself if it is a root, if it is | |
3198 | * UNINTERESTING, if it touches the given paths, or if it is a | |
4d826608 | 3199 | * merge and its parents don't simplify to one relevant commit |
6546b593 JH |
3200 | * (the first two cases are already handled at the beginning of |
3201 | * this function). | |
3202 | * | |
4d826608 KB |
3203 | * Otherwise, it simplifies to what its sole relevant parent |
3204 | * simplifies to. | |
6546b593 JH |
3205 | */ |
3206 | if (!cnt || | |
3207 | (commit->object.flags & UNINTERESTING) || | |
3208 | !(commit->object.flags & TREESAME) || | |
8d049e18 DS |
3209 | (parent = one_relevant_parent(revs, commit->parents)) == NULL || |
3210 | (revs->show_pulls && (commit->object.flags & PULL_MERGE))) | |
faf0156b JH |
3211 | st->simplified = commit; |
3212 | else { | |
4d826608 | 3213 | pst = locate_simplify_state(revs, parent); |
faf0156b JH |
3214 | st->simplified = pst->simplified; |
3215 | } | |
6546b593 JH |
3216 | return tail; |
3217 | } | |
3218 | ||
3219 | static void simplify_merges(struct rev_info *revs) | |
3220 | { | |
ab9d75a8 | 3221 | struct commit_list *list, *next; |
6546b593 | 3222 | struct commit_list *yet_to_do, **tail; |
ab9d75a8 | 3223 | struct commit *commit; |
6546b593 | 3224 | |
5eac739e JH |
3225 | if (!revs->prune) |
3226 | return; | |
65347030 | 3227 | |
6546b593 JH |
3228 | /* feed the list reversed */ |
3229 | yet_to_do = NULL; | |
ab9d75a8 JH |
3230 | for (list = revs->commits; list; list = next) { |
3231 | commit = list->item; | |
3232 | next = list->next; | |
3233 | /* | |
3234 | * Do not free(list) here yet; the original list | |
3235 | * is used later in this function. | |
3236 | */ | |
3237 | commit_list_insert(commit, &yet_to_do); | |
3238 | } | |
6546b593 JH |
3239 | while (yet_to_do) { |
3240 | list = yet_to_do; | |
3241 | yet_to_do = NULL; | |
3242 | tail = &yet_to_do; | |
3243 | while (list) { | |
e510ab89 | 3244 | commit = pop_commit(&list); |
faf0156b | 3245 | tail = simplify_one(revs, commit, tail); |
6546b593 JH |
3246 | } |
3247 | } | |
3248 | ||
3249 | /* clean up the result, removing the simplified ones */ | |
3250 | list = revs->commits; | |
3251 | revs->commits = NULL; | |
3252 | tail = &revs->commits; | |
3253 | while (list) { | |
faf0156b | 3254 | struct merge_simplify_state *st; |
ab9d75a8 | 3255 | |
e510ab89 | 3256 | commit = pop_commit(&list); |
faf0156b JH |
3257 | st = locate_simplify_state(revs, commit); |
3258 | if (st->simplified == commit) | |
6546b593 JH |
3259 | tail = &commit_list_insert(commit, tail)->next; |
3260 | } | |
6546b593 JH |
3261 | } |
3262 | ||
f35f5603 JH |
3263 | static void set_children(struct rev_info *revs) |
3264 | { | |
3265 | struct commit_list *l; | |
3266 | for (l = revs->commits; l; l = l->next) { | |
3267 | struct commit *commit = l->item; | |
3268 | struct commit_list *p; | |
3269 | ||
3270 | for (p = commit->parents; p; p = p->next) | |
3271 | add_child(revs, p->item, commit); | |
3272 | } | |
3273 | } | |
3274 | ||
bcc0a3ea HV |
3275 | void reset_revision_walk(void) |
3276 | { | |
ffa1f28f | 3277 | clear_object_flags(SEEN | ADDED | SHOWN | TOPO_WALK_EXPLORED | TOPO_WALK_INDEGREE); |
bcc0a3ea HV |
3278 | } |
3279 | ||
df11e196 JT |
3280 | static int mark_uninteresting(const struct object_id *oid, |
3281 | struct packed_git *pack, | |
3282 | uint32_t pos, | |
b3c7eef9 | 3283 | void *cb) |
df11e196 | 3284 | { |
b3c7eef9 NTND |
3285 | struct rev_info *revs = cb; |
3286 | struct object *o = parse_object(revs->repo, oid); | |
df11e196 JT |
3287 | o->flags |= UNINTERESTING | SEEN; |
3288 | return 0; | |
3289 | } | |
3290 | ||
b4542418 DS |
3291 | define_commit_slab(indegree_slab, int); |
3292 | define_commit_slab(author_date_slab, timestamp_t); | |
3293 | ||
3294 | struct topo_walk_info { | |
3295 | uint32_t min_generation; | |
3296 | struct prio_queue explore_queue; | |
3297 | struct prio_queue indegree_queue; | |
3298 | struct prio_queue topo_queue; | |
3299 | struct indegree_slab indegree; | |
3300 | struct author_date_slab author_date; | |
3301 | }; | |
3302 | ||
3303 | static inline void test_flag_and_insert(struct prio_queue *q, struct commit *c, int flag) | |
3304 | { | |
3305 | if (c->object.flags & flag) | |
3306 | return; | |
3307 | ||
3308 | c->object.flags |= flag; | |
3309 | prio_queue_put(q, c); | |
3310 | } | |
3311 | ||
3312 | static void explore_walk_step(struct rev_info *revs) | |
3313 | { | |
3314 | struct topo_walk_info *info = revs->topo_walk_info; | |
3315 | struct commit_list *p; | |
3316 | struct commit *c = prio_queue_get(&info->explore_queue); | |
3317 | ||
3318 | if (!c) | |
3319 | return; | |
3320 | ||
3321 | if (parse_commit_gently(c, 1) < 0) | |
3322 | return; | |
3323 | ||
3324 | if (revs->sort_order == REV_SORT_BY_AUTHOR_DATE) | |
3325 | record_author_date(&info->author_date, c); | |
3326 | ||
3327 | if (revs->max_age != -1 && (c->date < revs->max_age)) | |
3328 | c->object.flags |= UNINTERESTING; | |
3329 | ||
3330 | if (process_parents(revs, c, NULL, NULL) < 0) | |
3331 | return; | |
3332 | ||
3333 | if (c->object.flags & UNINTERESTING) | |
3334 | mark_parents_uninteresting(c); | |
3335 | ||
3336 | for (p = c->parents; p; p = p->next) | |
3337 | test_flag_and_insert(&info->explore_queue, p->item, TOPO_WALK_EXPLORED); | |
3338 | } | |
3339 | ||
3340 | static void explore_to_depth(struct rev_info *revs, | |
3341 | uint32_t gen_cutoff) | |
3342 | { | |
3343 | struct topo_walk_info *info = revs->topo_walk_info; | |
3344 | struct commit *c; | |
3345 | while ((c = prio_queue_peek(&info->explore_queue)) && | |
c49c82aa | 3346 | commit_graph_generation(c) >= gen_cutoff) |
b4542418 DS |
3347 | explore_walk_step(revs); |
3348 | } | |
3349 | ||
3350 | static void indegree_walk_step(struct rev_info *revs) | |
3351 | { | |
3352 | struct commit_list *p; | |
3353 | struct topo_walk_info *info = revs->topo_walk_info; | |
3354 | struct commit *c = prio_queue_get(&info->indegree_queue); | |
3355 | ||
3356 | if (!c) | |
3357 | return; | |
3358 | ||
3359 | if (parse_commit_gently(c, 1) < 0) | |
3360 | return; | |
3361 | ||
c49c82aa | 3362 | explore_to_depth(revs, commit_graph_generation(c)); |
b4542418 DS |
3363 | |
3364 | for (p = c->parents; p; p = p->next) { | |
3365 | struct commit *parent = p->item; | |
3366 | int *pi = indegree_slab_at(&info->indegree, parent); | |
3367 | ||
3368 | if (*pi) | |
3369 | (*pi)++; | |
3370 | else | |
3371 | *pi = 2; | |
3372 | ||
3373 | test_flag_and_insert(&info->indegree_queue, parent, TOPO_WALK_INDEGREE); | |
3374 | ||
3375 | if (revs->first_parent_only) | |
3376 | return; | |
3377 | } | |
3378 | } | |
3379 | ||
3380 | static void compute_indegrees_to_depth(struct rev_info *revs, | |
3381 | uint32_t gen_cutoff) | |
3382 | { | |
3383 | struct topo_walk_info *info = revs->topo_walk_info; | |
3384 | struct commit *c; | |
3385 | while ((c = prio_queue_peek(&info->indegree_queue)) && | |
c49c82aa | 3386 | commit_graph_generation(c) >= gen_cutoff) |
b4542418 DS |
3387 | indegree_walk_step(revs); |
3388 | } | |
f0d9cc41 | 3389 | |
0aa0c2b2 MH |
3390 | static void reset_topo_walk(struct rev_info *revs) |
3391 | { | |
3392 | struct topo_walk_info *info = revs->topo_walk_info; | |
3393 | ||
3394 | clear_prio_queue(&info->explore_queue); | |
3395 | clear_prio_queue(&info->indegree_queue); | |
3396 | clear_prio_queue(&info->topo_queue); | |
3397 | clear_indegree_slab(&info->indegree); | |
3398 | clear_author_date_slab(&info->author_date); | |
3399 | ||
3400 | FREE_AND_NULL(revs->topo_walk_info); | |
3401 | } | |
3402 | ||
f0d9cc41 DS |
3403 | static void init_topo_walk(struct rev_info *revs) |
3404 | { | |
3405 | struct topo_walk_info *info; | |
b4542418 | 3406 | struct commit_list *list; |
0aa0c2b2 MH |
3407 | if (revs->topo_walk_info) |
3408 | reset_topo_walk(revs); | |
3409 | ||
f0d9cc41 DS |
3410 | revs->topo_walk_info = xmalloc(sizeof(struct topo_walk_info)); |
3411 | info = revs->topo_walk_info; | |
3412 | memset(info, 0, sizeof(struct topo_walk_info)); | |
3413 | ||
b4542418 DS |
3414 | init_indegree_slab(&info->indegree); |
3415 | memset(&info->explore_queue, 0, sizeof(info->explore_queue)); | |
3416 | memset(&info->indegree_queue, 0, sizeof(info->indegree_queue)); | |
3417 | memset(&info->topo_queue, 0, sizeof(info->topo_queue)); | |
3418 | ||
3419 | switch (revs->sort_order) { | |
3420 | default: /* REV_SORT_IN_GRAPH_ORDER */ | |
3421 | info->topo_queue.compare = NULL; | |
3422 | break; | |
3423 | case REV_SORT_BY_COMMIT_DATE: | |
3424 | info->topo_queue.compare = compare_commits_by_commit_date; | |
3425 | break; | |
3426 | case REV_SORT_BY_AUTHOR_DATE: | |
3427 | init_author_date_slab(&info->author_date); | |
3428 | info->topo_queue.compare = compare_commits_by_author_date; | |
3429 | info->topo_queue.cb_data = &info->author_date; | |
3430 | break; | |
3431 | } | |
3432 | ||
3433 | info->explore_queue.compare = compare_commits_by_gen_then_commit_date; | |
3434 | info->indegree_queue.compare = compare_commits_by_gen_then_commit_date; | |
3435 | ||
3436 | info->min_generation = GENERATION_NUMBER_INFINITY; | |
3437 | for (list = revs->commits; list; list = list->next) { | |
3438 | struct commit *c = list->item; | |
c752ad09 | 3439 | uint32_t generation; |
b4542418 DS |
3440 | |
3441 | if (parse_commit_gently(c, 1)) | |
3442 | continue; | |
3443 | ||
3444 | test_flag_and_insert(&info->explore_queue, c, TOPO_WALK_EXPLORED); | |
3445 | test_flag_and_insert(&info->indegree_queue, c, TOPO_WALK_INDEGREE); | |
3446 | ||
c752ad09 AK |
3447 | generation = commit_graph_generation(c); |
3448 | if (generation < info->min_generation) | |
3449 | info->min_generation = generation; | |
b4542418 DS |
3450 | |
3451 | *(indegree_slab_at(&info->indegree, c)) = 1; | |
3452 | ||
3453 | if (revs->sort_order == REV_SORT_BY_AUTHOR_DATE) | |
3454 | record_author_date(&info->author_date, c); | |
3455 | } | |
3456 | compute_indegrees_to_depth(revs, info->min_generation); | |
3457 | ||
3458 | for (list = revs->commits; list; list = list->next) { | |
3459 | struct commit *c = list->item; | |
3460 | ||
3461 | if (*(indegree_slab_at(&info->indegree, c)) == 1) | |
3462 | prio_queue_put(&info->topo_queue, c); | |
3463 | } | |
3464 | ||
3465 | /* | |
3466 | * This is unfortunate; the initial tips need to be shown | |
3467 | * in the order given from the revision traversal machinery. | |
3468 | */ | |
3469 | if (revs->sort_order == REV_SORT_IN_GRAPH_ORDER) | |
3470 | prio_queue_reverse(&info->topo_queue); | |
f0d9cc41 DS |
3471 | } |
3472 | ||
3473 | static struct commit *next_topo_commit(struct rev_info *revs) | |
3474 | { | |
b4542418 DS |
3475 | struct commit *c; |
3476 | struct topo_walk_info *info = revs->topo_walk_info; | |
3477 | ||
3478 | /* pop next off of topo_queue */ | |
3479 | c = prio_queue_get(&info->topo_queue); | |
3480 | ||
3481 | if (c) | |
3482 | *(indegree_slab_at(&info->indegree, c)) = 0; | |
3483 | ||
3484 | return c; | |
f0d9cc41 DS |
3485 | } |
3486 | ||
3487 | static void expand_topo_walk(struct rev_info *revs, struct commit *commit) | |
3488 | { | |
b4542418 DS |
3489 | struct commit_list *p; |
3490 | struct topo_walk_info *info = revs->topo_walk_info; | |
3491 | if (process_parents(revs, commit, NULL, NULL) < 0) { | |
f0d9cc41 DS |
3492 | if (!revs->ignore_missing_links) |
3493 | die("Failed to traverse parents of commit %s", | |
3494 | oid_to_hex(&commit->object.oid)); | |
3495 | } | |
b4542418 DS |
3496 | |
3497 | for (p = commit->parents; p; p = p->next) { | |
3498 | struct commit *parent = p->item; | |
3499 | int *pi; | |
c752ad09 | 3500 | uint32_t generation; |
b4542418 | 3501 | |
1d8e31a3 DS |
3502 | if (parent->object.flags & UNINTERESTING) |
3503 | continue; | |
3504 | ||
b4542418 DS |
3505 | if (parse_commit_gently(parent, 1) < 0) |
3506 | continue; | |
3507 | ||
c752ad09 AK |
3508 | generation = commit_graph_generation(parent); |
3509 | if (generation < info->min_generation) { | |
3510 | info->min_generation = generation; | |
b4542418 DS |
3511 | compute_indegrees_to_depth(revs, info->min_generation); |
3512 | } | |
3513 | ||
3514 | pi = indegree_slab_at(&info->indegree, parent); | |
3515 | ||
3516 | (*pi)--; | |
3517 | if (*pi == 1) | |
3518 | prio_queue_put(&info->topo_queue, parent); | |
3519 | ||
3520 | if (revs->first_parent_only) | |
3521 | return; | |
3522 | } | |
f0d9cc41 DS |
3523 | } |
3524 | ||
cc0e6c5a | 3525 | int prepare_revision_walk(struct rev_info *revs) |
a4a88b2b | 3526 | { |
1da1e07c JK |
3527 | int i; |
3528 | struct object_array old_pending; | |
2e7da8e9 | 3529 | struct commit_list **next = &revs->commits; |
cd2bdc53 | 3530 | |
1da1e07c | 3531 | memcpy(&old_pending, &revs->pending, sizeof(old_pending)); |
1f1e895f LT |
3532 | revs->pending.nr = 0; |
3533 | revs->pending.alloc = 0; | |
3534 | revs->pending.objects = NULL; | |
1da1e07c JK |
3535 | for (i = 0; i < old_pending.nr; i++) { |
3536 | struct object_array_entry *e = old_pending.objects + i; | |
20739490 | 3537 | struct commit *commit = handle_commit(revs, e); |
cd2bdc53 LT |
3538 | if (commit) { |
3539 | if (!(commit->object.flags & SEEN)) { | |
3540 | commit->object.flags |= SEEN; | |
2e7da8e9 | 3541 | next = commit_list_append(commit, next); |
cd2bdc53 LT |
3542 | } |
3543 | } | |
cd2bdc53 | 3544 | } |
f1230fb5 | 3545 | object_array_clear(&old_pending); |
cd2bdc53 | 3546 | |
d0af663e | 3547 | /* Signal whether we need per-parent treesame decoration */ |
4d826608 KB |
3548 | if (revs->simplify_merges || |
3549 | (revs->limited && limiting_can_increase_treesame(revs))) | |
d0af663e KB |
3550 | revs->treesame.name = "treesame"; |
3551 | ||
df11e196 | 3552 | if (revs->exclude_promisor_objects) { |
b3c7eef9 | 3553 | for_each_packed_object(mark_uninteresting, revs, |
df11e196 JT |
3554 | FOR_EACH_OBJECT_PROMISOR_ONLY); |
3555 | } | |
3556 | ||
f32dde8c | 3557 | if (!revs->reflog_info) |
a56b9464 | 3558 | prepare_to_use_bloom_filter(revs); |
ca92e59e MZ |
3559 | if (revs->no_walk != REVISION_WALK_NO_WALK_UNSORTED) |
3560 | commit_list_sort_by_date(&revs->commits); | |
ba1d4505 | 3561 | if (revs->no_walk) |
cc0e6c5a | 3562 | return 0; |
f0d9cc41 | 3563 | if (revs->limited) { |
cc0e6c5a AR |
3564 | if (limit_list(revs) < 0) |
3565 | return -1; | |
f0d9cc41 DS |
3566 | if (revs->topo_order) |
3567 | sort_in_topological_order(&revs->commits, revs->sort_order); | |
3568 | } else if (revs->topo_order) | |
3569 | init_topo_walk(revs); | |
3cb9d2b6 SG |
3570 | if (revs->line_level_traverse && want_ancestry(revs)) |
3571 | /* | |
3572 | * At the moment we can only do line-level log with parent | |
3573 | * rewriting by performing this expensive pre-filtering step. | |
3574 | * If parent rewriting is not requested, then we rather | |
3575 | * perform the line-level log filtering during the regular | |
3576 | * history traversal. | |
3577 | */ | |
12da1d1f | 3578 | line_log_filter(revs); |
6546b593 JH |
3579 | if (revs->simplify_merges) |
3580 | simplify_merges(revs); | |
f35f5603 JH |
3581 | if (revs->children.name) |
3582 | set_children(revs); | |
a56b9464 | 3583 | |
cc0e6c5a | 3584 | return 0; |
a4a88b2b LT |
3585 | } |
3586 | ||
8320b1db JK |
3587 | static enum rewrite_result rewrite_one_1(struct rev_info *revs, |
3588 | struct commit **pp, | |
3589 | struct prio_queue *queue) | |
765ac8ec LT |
3590 | { |
3591 | for (;;) { | |
3592 | struct commit *p = *pp; | |
3381c790 | 3593 | if (!revs->limited) |
8320b1db | 3594 | if (process_parents(revs, p, NULL, queue) < 0) |
cc0e6c5a | 3595 | return rewrite_one_error; |
7dc0fe3b LT |
3596 | if (p->object.flags & UNINTERESTING) |
3597 | return rewrite_one_ok; | |
3598 | if (!(p->object.flags & TREESAME)) | |
cc0e6c5a | 3599 | return rewrite_one_ok; |
765ac8ec | 3600 | if (!p->parents) |
cc0e6c5a | 3601 | return rewrite_one_noparents; |
4d826608 KB |
3602 | if ((p = one_relevant_parent(revs, p->parents)) == NULL) |
3603 | return rewrite_one_ok; | |
3604 | *pp = p; | |
765ac8ec LT |
3605 | } |
3606 | } | |
3607 | ||
8320b1db JK |
3608 | static void merge_queue_into_list(struct prio_queue *q, struct commit_list **list) |
3609 | { | |
3610 | while (q->nr) { | |
3611 | struct commit *item = prio_queue_peek(q); | |
3612 | struct commit_list *p = *list; | |
3613 | ||
3614 | if (p && p->item->date >= item->date) | |
3615 | list = &p->next; | |
3616 | else { | |
3617 | p = commit_list_insert(item, list); | |
3618 | list = &p->next; /* skip newly added item */ | |
3619 | prio_queue_get(q); /* pop item */ | |
3620 | } | |
3621 | } | |
3622 | } | |
3623 | ||
3624 | static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp) | |
3625 | { | |
3626 | struct prio_queue queue = { compare_commits_by_commit_date }; | |
3627 | enum rewrite_result ret = rewrite_one_1(revs, pp, &queue); | |
3628 | merge_queue_into_list(&queue, &revs->commits); | |
3629 | clear_prio_queue(&queue); | |
3630 | return ret; | |
3631 | } | |
3632 | ||
c7edcae0 BY |
3633 | int rewrite_parents(struct rev_info *revs, struct commit *commit, |
3634 | rewrite_parent_fn_t rewrite_parent) | |
765ac8ec LT |
3635 | { |
3636 | struct commit_list **pp = &commit->parents; | |
3637 | while (*pp) { | |
3638 | struct commit_list *parent = *pp; | |
c7edcae0 | 3639 | switch (rewrite_parent(revs, &parent->item)) { |
cc0e6c5a AR |
3640 | case rewrite_one_ok: |
3641 | break; | |
3642 | case rewrite_one_noparents: | |
765ac8ec LT |
3643 | *pp = parent->next; |
3644 | continue; | |
cc0e6c5a AR |
3645 | case rewrite_one_error: |
3646 | return -1; | |
765ac8ec LT |
3647 | } |
3648 | pp = &parent->next; | |
3649 | } | |
d0af663e | 3650 | remove_duplicate_parents(revs, commit); |
cc0e6c5a | 3651 | return 0; |
765ac8ec LT |
3652 | } |
3653 | ||
d72fbe81 AP |
3654 | static int commit_rewrite_person(struct strbuf *buf, const char *what, struct string_list *mailmap) |
3655 | { | |
3656 | char *person, *endp; | |
3657 | size_t len, namelen, maillen; | |
3658 | const char *name; | |
3659 | const char *mail; | |
3660 | struct ident_split ident; | |
3661 | ||
3662 | person = strstr(buf->buf, what); | |
3663 | if (!person) | |
3664 | return 0; | |
3665 | ||
3666 | person += strlen(what); | |
3667 | endp = strchr(person, '\n'); | |
3668 | if (!endp) | |
3669 | return 0; | |
3670 | ||
3671 | len = endp - person; | |
3672 | ||
3673 | if (split_ident_line(&ident, person, len)) | |
3674 | return 0; | |
3675 | ||
3676 | mail = ident.mail_begin; | |
3677 | maillen = ident.mail_end - ident.mail_begin; | |
3678 | name = ident.name_begin; | |
3679 | namelen = ident.name_end - ident.name_begin; | |
3680 | ||
3681 | if (map_user(mailmap, &mail, &maillen, &name, &namelen)) { | |
3682 | struct strbuf namemail = STRBUF_INIT; | |
3683 | ||
3684 | strbuf_addf(&namemail, "%.*s <%.*s>", | |
3685 | (int)namelen, name, (int)maillen, mail); | |
3686 | ||
3687 | strbuf_splice(buf, ident.name_begin - buf->buf, | |
3688 | ident.mail_end - ident.name_begin + 1, | |
3689 | namemail.buf, namemail.len); | |
3690 | ||
3691 | strbuf_release(&namemail); | |
3692 | ||
3693 | return 1; | |
3694 | } | |
3695 | ||
3696 | return 0; | |
3697 | } | |
3698 | ||
8ecae9b0 JH |
3699 | static int commit_match(struct commit *commit, struct rev_info *opt) |
3700 | { | |
72fd13f7 | 3701 | int retval; |
04deccda | 3702 | const char *encoding; |
b000c59b | 3703 | const char *message; |
72fd13f7 | 3704 | struct strbuf buf = STRBUF_INIT; |
04deccda | 3705 | |
80235ba7 | 3706 | if (!opt->grep_filter.pattern_list && !opt->grep_filter.header_list) |
8ecae9b0 | 3707 | return 1; |
baa6378f JH |
3708 | |
3709 | /* Prepend "fake" headers as needed */ | |
3710 | if (opt->grep_filter.use_reflog_filter) { | |
72fd13f7 NTND |
3711 | strbuf_addstr(&buf, "reflog "); |
3712 | get_reflog_message(&buf, opt->reflog_info); | |
3713 | strbuf_addch(&buf, '\n'); | |
72fd13f7 | 3714 | } |
baa6378f | 3715 | |
04deccda JK |
3716 | /* |
3717 | * We grep in the user's output encoding, under the assumption that it | |
3718 | * is the encoding they are most likely to write their grep pattern | |
3719 | * for. In addition, it means we will match the "notes" encoding below, | |
3720 | * so we will not end up with a buffer that has two different encodings | |
3721 | * in it. | |
3722 | */ | |
3723 | encoding = get_log_output_encoding(); | |
5a10d236 | 3724 | message = logmsg_reencode(commit, NULL, encoding); |
04deccda | 3725 | |
baa6378f JH |
3726 | /* Copy the commit to temporary if we are using "fake" headers */ |
3727 | if (buf.len) | |
04deccda | 3728 | strbuf_addstr(&buf, message); |
baa6378f | 3729 | |
df874fa8 | 3730 | if (opt->grep_filter.header_list && opt->mailmap) { |
d72fbe81 | 3731 | if (!buf.len) |
04deccda | 3732 | strbuf_addstr(&buf, message); |
d72fbe81 AP |
3733 | |
3734 | commit_rewrite_person(&buf, "\nauthor ", opt->mailmap); | |
3735 | commit_rewrite_person(&buf, "\ncommitter ", opt->mailmap); | |
3736 | } | |
3737 | ||
38cfe915 NTND |
3738 | /* Append "fake" message parts as needed */ |
3739 | if (opt->show_notes) { | |
3740 | if (!buf.len) | |
04deccda | 3741 | strbuf_addstr(&buf, message); |
fb61e4d3 | 3742 | format_display_notes(&commit->object.oid, &buf, encoding, 1); |
38cfe915 NTND |
3743 | } |
3744 | ||
b000c59b JK |
3745 | /* |
3746 | * Find either in the original commit message, or in the temporary. | |
3747 | * Note that we cast away the constness of "message" here. It is | |
3748 | * const because it may come from the cached commit buffer. That's OK, | |
3749 | * because we know that it is modifiable heap memory, and that while | |
3750 | * grep_buffer may modify it for speed, it will restore any | |
3751 | * changes before returning. | |
3752 | */ | |
72fd13f7 NTND |
3753 | if (buf.len) |
3754 | retval = grep_buffer(&opt->grep_filter, buf.buf, buf.len); | |
3755 | else | |
3756 | retval = grep_buffer(&opt->grep_filter, | |
b000c59b | 3757 | (char *)message, strlen(message)); |
72fd13f7 | 3758 | strbuf_release(&buf); |
b66103c3 | 3759 | unuse_commit_buffer(commit, message); |
22dfa8a2 | 3760 | return opt->invert_grep ? !retval : retval; |
8ecae9b0 JH |
3761 | } |
3762 | ||
53d00b39 | 3763 | static inline int want_ancestry(const struct rev_info *revs) |
f35f5603 | 3764 | { |
8bb65883 | 3765 | return (revs->rewrite_parents || revs->children.name); |
f35f5603 JH |
3766 | } |
3767 | ||
de239446 JK |
3768 | /* |
3769 | * Return a timestamp to be used for --since/--until comparisons for this | |
3770 | * commit, based on the revision options. | |
3771 | */ | |
3772 | static timestamp_t comparison_date(const struct rev_info *revs, | |
3773 | struct commit *commit) | |
3774 | { | |
3775 | return revs->reflog_info ? | |
3776 | get_reflog_timestamp(revs->reflog_info) : | |
3777 | commit->date; | |
3778 | } | |
3779 | ||
beb5af43 | 3780 | enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit) |
252a7c02 LT |
3781 | { |
3782 | if (commit->object.flags & SHOWN) | |
3783 | return commit_ignore; | |
14c3c80c | 3784 | if (revs->unpacked && has_object_pack(&commit->object.oid)) |
252a7c02 LT |
3785 | return commit_ignore; |
3786 | if (commit->object.flags & UNINTERESTING) | |
3787 | return commit_ignore; | |
3cb9d2b6 SG |
3788 | if (revs->line_level_traverse && !want_ancestry(revs)) { |
3789 | /* | |
3790 | * In case of line-level log with parent rewriting | |
3791 | * prepare_revision_walk() already took care of all line-level | |
3792 | * log filtering, and there is nothing left to do here. | |
3793 | * | |
3794 | * If parent rewriting was not requested, then this is the | |
3795 | * place to perform the line-level log filtering. Notably, | |
3796 | * this check, though expensive, must come before the other, | |
3797 | * cheaper filtering conditions, because the tracked line | |
3798 | * ranges must be adjusted even when the commit will end up | |
3799 | * being ignored based on other conditions. | |
3800 | */ | |
3801 | if (!line_log_process_ranges_arbitrary_commit(revs, commit)) | |
3802 | return commit_ignore; | |
3803 | } | |
de239446 JK |
3804 | if (revs->min_age != -1 && |
3805 | comparison_date(revs, commit) > revs->min_age) | |
3806 | return commit_ignore; | |
ad5aeede | 3807 | if (revs->min_parents || (revs->max_parents >= 0)) { |
bf3418b0 | 3808 | int n = commit_list_count(commit->parents); |
ad5aeede MG |
3809 | if ((n < revs->min_parents) || |
3810 | ((revs->max_parents >= 0) && (n > revs->max_parents))) | |
3811 | return commit_ignore; | |
3812 | } | |
252a7c02 LT |
3813 | if (!commit_match(commit, revs)) |
3814 | return commit_ignore; | |
53b2c823 | 3815 | if (revs->prune && revs->dense) { |
252a7c02 | 3816 | /* Commit without changes? */ |
7dc0fe3b | 3817 | if (commit->object.flags & TREESAME) { |
bf3418b0 KB |
3818 | int n; |
3819 | struct commit_list *p; | |
252a7c02 | 3820 | /* drop merges unless we want parenthood */ |
f35f5603 | 3821 | if (!want_ancestry(revs)) |
252a7c02 | 3822 | return commit_ignore; |
8d049e18 DS |
3823 | |
3824 | if (revs->show_pulls && (commit->object.flags & PULL_MERGE)) | |
3825 | return commit_show; | |
3826 | ||
bf3418b0 KB |
3827 | /* |
3828 | * If we want ancestry, then need to keep any merges | |
3829 | * between relevant commits to tie together topology. | |
3830 | * For consistency with TREESAME and simplification | |
3831 | * use "relevant" here rather than just INTERESTING, | |
3832 | * to treat bottom commit(s) as part of the topology. | |
3833 | */ | |
3834 | for (n = 0, p = commit->parents; p; p = p->next) | |
3835 | if (relevant_commit(p->item)) | |
3836 | if (++n >= 2) | |
3837 | return commit_show; | |
3838 | return commit_ignore; | |
252a7c02 | 3839 | } |
252a7c02 LT |
3840 | } |
3841 | return commit_show; | |
3842 | } | |
3843 | ||
0131c490 JH |
3844 | define_commit_slab(saved_parents, struct commit_list *); |
3845 | ||
3846 | #define EMPTY_PARENT_LIST ((struct commit_list *)-1) | |
3847 | ||
3848 | /* | |
3849 | * You may only call save_parents() once per commit (this is checked | |
3850 | * for non-root commits). | |
3851 | */ | |
3852 | static void save_parents(struct rev_info *revs, struct commit *commit) | |
3853 | { | |
3854 | struct commit_list **pp; | |
3855 | ||
3856 | if (!revs->saved_parents_slab) { | |
3857 | revs->saved_parents_slab = xmalloc(sizeof(struct saved_parents)); | |
3858 | init_saved_parents(revs->saved_parents_slab); | |
3859 | } | |
3860 | ||
3861 | pp = saved_parents_at(revs->saved_parents_slab, commit); | |
3862 | ||
3863 | /* | |
3864 | * When walking with reflogs, we may visit the same commit | |
3865 | * several times: once for each appearance in the reflog. | |
3866 | * | |
3867 | * In this case, save_parents() will be called multiple times. | |
3868 | * We want to keep only the first set of parents. We need to | |
3869 | * store a sentinel value for an empty (i.e., NULL) parent | |
3870 | * list to distinguish it from a not-yet-saved list, however. | |
3871 | */ | |
3872 | if (*pp) | |
3873 | return; | |
3874 | if (commit->parents) | |
3875 | *pp = copy_commit_list(commit->parents); | |
3876 | else | |
3877 | *pp = EMPTY_PARENT_LIST; | |
3878 | } | |
3879 | ||
3880 | static void free_saved_parents(struct rev_info *revs) | |
3881 | { | |
3882 | if (revs->saved_parents_slab) | |
3883 | clear_saved_parents(revs->saved_parents_slab); | |
3884 | } | |
3885 | ||
3886 | struct commit_list *get_saved_parents(struct rev_info *revs, const struct commit *commit) | |
3887 | { | |
3888 | struct commit_list *parents; | |
3889 | ||
3890 | if (!revs->saved_parents_slab) | |
3891 | return commit->parents; | |
3892 | ||
3893 | parents = *saved_parents_at(revs->saved_parents_slab, commit); | |
3894 | if (parents == EMPTY_PARENT_LIST) | |
3895 | return NULL; | |
3896 | return parents; | |
3897 | } | |
3898 | ||
beb5af43 AS |
3899 | enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit) |
3900 | { | |
3901 | enum commit_action action = get_commit_action(revs, commit); | |
3902 | ||
3903 | if (action == commit_show && | |
beb5af43 | 3904 | revs->prune && revs->dense && want_ancestry(revs)) { |
53d00b39 TR |
3905 | /* |
3906 | * --full-diff on simplified parents is no good: it | |
3907 | * will show spurious changes from the commits that | |
3908 | * were elided. So we save the parents on the side | |
3909 | * when --full-diff is in effect. | |
3910 | */ | |
3911 | if (revs->full_diff) | |
3912 | save_parents(revs, commit); | |
c7edcae0 | 3913 | if (rewrite_parents(revs, commit, rewrite_one) < 0) |
beb5af43 AS |
3914 | return commit_error; |
3915 | } | |
3916 | return action; | |
3917 | } | |
3918 | ||
1b32dece NTND |
3919 | static void track_linear(struct rev_info *revs, struct commit *commit) |
3920 | { | |
3921 | if (revs->track_first_time) { | |
3922 | revs->linear = 1; | |
3923 | revs->track_first_time = 0; | |
3924 | } else { | |
3925 | struct commit_list *p; | |
3926 | for (p = revs->previous_parents; p; p = p->next) | |
3927 | if (p->item == NULL || /* first commit */ | |
4a7e27e9 | 3928 | oideq(&p->item->object.oid, &commit->object.oid)) |
1b32dece NTND |
3929 | break; |
3930 | revs->linear = p != NULL; | |
3931 | } | |
3932 | if (revs->reverse) { | |
3933 | if (revs->linear) | |
3934 | commit->object.flags |= TRACK_LINEAR; | |
3935 | } | |
3936 | free_commit_list(revs->previous_parents); | |
3937 | revs->previous_parents = copy_commit_list(commit->parents); | |
3938 | } | |
3939 | ||
d5db6c9e | 3940 | static struct commit *get_revision_1(struct rev_info *revs) |
a4a88b2b | 3941 | { |
7c2f08aa | 3942 | while (1) { |
d08565bf | 3943 | struct commit *commit; |
a4a88b2b | 3944 | |
d08565bf JK |
3945 | if (revs->reflog_info) |
3946 | commit = next_reflog_entry(revs->reflog_info); | |
f0d9cc41 DS |
3947 | else if (revs->topo_walk_info) |
3948 | commit = next_topo_commit(revs); | |
d08565bf JK |
3949 | else |
3950 | commit = pop_commit(&revs->commits); | |
2a0925be | 3951 | |
7c2f08aa JK |
3952 | if (!commit) |
3953 | return NULL; | |
3954 | ||
d08565bf | 3955 | if (revs->reflog_info) |
ffa1eeae | 3956 | commit->object.flags &= ~(ADDED | SEEN | SHOWN); |
8860fd42 | 3957 | |
2a0925be LT |
3958 | /* |
3959 | * If we haven't done the list limiting, we need to look at | |
be7db6e5 LT |
3960 | * the parents here. We also need to do the date-based limiting |
3961 | * that we'd otherwise have done in limit_list(). | |
2a0925be | 3962 | */ |
be7db6e5 | 3963 | if (!revs->limited) { |
744f4985 | 3964 | if (revs->max_age != -1 && |
de239446 | 3965 | comparison_date(revs, commit) < revs->max_age) |
86ab4906 | 3966 | continue; |
d08565bf JK |
3967 | |
3968 | if (revs->reflog_info) | |
3969 | try_to_simplify_commit(revs, commit); | |
f0d9cc41 DS |
3970 | else if (revs->topo_walk_info) |
3971 | expand_topo_walk(revs, commit); | |
5284fc5c | 3972 | else if (process_parents(revs, commit, &revs->commits, NULL) < 0) { |
2db1a43f VM |
3973 | if (!revs->ignore_missing_links) |
3974 | die("Failed to traverse parents of commit %s", | |
f2fd0760 | 3975 | oid_to_hex(&commit->object.oid)); |
2db1a43f | 3976 | } |
be7db6e5 | 3977 | } |
744f4985 | 3978 | |
252a7c02 LT |
3979 | switch (simplify_commit(revs, commit)) { |
3980 | case commit_ignore: | |
8ecae9b0 | 3981 | continue; |
252a7c02 | 3982 | case commit_error: |
ed62089c | 3983 | die("Failed to simplify parents of commit %s", |
f2fd0760 | 3984 | oid_to_hex(&commit->object.oid)); |
252a7c02 | 3985 | default: |
1b32dece NTND |
3986 | if (revs->track_linear) |
3987 | track_linear(revs, commit); | |
252a7c02 | 3988 | return commit; |
384e99a4 | 3989 | } |
7c2f08aa | 3990 | } |
765ac8ec | 3991 | } |
d5db6c9e | 3992 | |
be6754c6 MH |
3993 | /* |
3994 | * Return true for entries that have not yet been shown. (This is an | |
3995 | * object_array_each_func_t.) | |
3996 | */ | |
3997 | static int entry_unshown(struct object_array_entry *entry, void *cb_data_unused) | |
86ab4906 | 3998 | { |
be6754c6 MH |
3999 | return !(entry->item->flags & SHOWN); |
4000 | } | |
86ab4906 | 4001 | |
be6754c6 MH |
4002 | /* |
4003 | * If array is on the verge of a realloc, garbage-collect any entries | |
4004 | * that have already been shown to try to free up some space. | |
4005 | */ | |
4006 | static void gc_boundary(struct object_array *array) | |
4007 | { | |
4008 | if (array->nr == array->alloc) | |
4009 | object_array_filter(array, entry_unshown, NULL); | |
86ab4906 JH |
4010 | } |
4011 | ||
4603ec0f AS |
4012 | static void create_boundary_commit_list(struct rev_info *revs) |
4013 | { | |
4014 | unsigned i; | |
4015 | struct commit *c; | |
4016 | struct object_array *array = &revs->boundary_commits; | |
4017 | struct object_array_entry *objects = array->objects; | |
4018 | ||
4019 | /* | |
4020 | * If revs->commits is non-NULL at this point, an error occurred in | |
4021 | * get_revision_1(). Ignore the error and continue printing the | |
4022 | * boundary commits anyway. (This is what the code has always | |
4023 | * done.) | |
4024 | */ | |
4025 | if (revs->commits) { | |
4026 | free_commit_list(revs->commits); | |
4027 | revs->commits = NULL; | |
4028 | } | |
4029 | ||
4030 | /* | |
4031 | * Put all of the actual boundary commits from revs->boundary_commits | |
4032 | * into revs->commits | |
4033 | */ | |
4034 | for (i = 0; i < array->nr; i++) { | |
4035 | c = (struct commit *)(objects[i].item); | |
4036 | if (!c) | |
4037 | continue; | |
4038 | if (!(c->object.flags & CHILD_SHOWN)) | |
4039 | continue; | |
4040 | if (c->object.flags & (SHOWN | BOUNDARY)) | |
4041 | continue; | |
4042 | c->object.flags |= BOUNDARY; | |
4043 | commit_list_insert(c, &revs->commits); | |
4044 | } | |
4045 | ||
4046 | /* | |
4047 | * If revs->topo_order is set, sort the boundary commits | |
4048 | * in topological order | |
4049 | */ | |
08f704f2 | 4050 | sort_in_topological_order(&revs->commits, revs->sort_order); |
4603ec0f AS |
4051 | } |
4052 | ||
7fefda5c | 4053 | static struct commit *get_revision_internal(struct rev_info *revs) |
d5db6c9e JH |
4054 | { |
4055 | struct commit *c = NULL; | |
86ab4906 JH |
4056 | struct commit_list *l; |
4057 | ||
4058 | if (revs->boundary == 2) { | |
4603ec0f AS |
4059 | /* |
4060 | * All of the normal commits have already been returned, | |
4061 | * and we are now returning boundary commits. | |
4062 | * create_boundary_commit_list() has populated | |
4063 | * revs->commits with the remaining commits to return. | |
4064 | */ | |
4065 | c = pop_commit(&revs->commits); | |
4066 | if (c) | |
4067 | c->object.flags |= SHOWN; | |
9c5e66e9 JS |
4068 | return c; |
4069 | } | |
4070 | ||
86ab4906 | 4071 | /* |
b72a1904 JK |
4072 | * If our max_count counter has reached zero, then we are done. We |
4073 | * don't simply return NULL because we still might need to show | |
4074 | * boundary commits. But we want to avoid calling get_revision_1, which | |
4075 | * might do a considerable amount of work finding the next commit only | |
4076 | * for us to throw it away. | |
4077 | * | |
4078 | * If it is non-zero, then either we don't have a max_count at all | |
4079 | * (-1), or it is still counting, in which case we decrement. | |
86ab4906 | 4080 | */ |
b72a1904 JK |
4081 | if (revs->max_count) { |
4082 | c = get_revision_1(revs); | |
4083 | if (c) { | |
9e57ac55 | 4084 | while (revs->skip_count > 0) { |
b72a1904 JK |
4085 | revs->skip_count--; |
4086 | c = get_revision_1(revs); | |
4087 | if (!c) | |
4088 | break; | |
4089 | } | |
8839ac94 | 4090 | } |
86ab4906 | 4091 | |
b72a1904 JK |
4092 | if (revs->max_count > 0) |
4093 | revs->max_count--; | |
d5db6c9e | 4094 | } |
86ab4906 | 4095 | |
c33d8593 JH |
4096 | if (c) |
4097 | c->object.flags |= SHOWN; | |
4098 | ||
9e57ac55 | 4099 | if (!revs->boundary) |
d5db6c9e | 4100 | return c; |
86ab4906 JH |
4101 | |
4102 | if (!c) { | |
4103 | /* | |
4104 | * get_revision_1() runs out the commits, and | |
4105 | * we are done computing the boundaries. | |
4106 | * switch to boundary commits output mode. | |
4107 | */ | |
4108 | revs->boundary = 2; | |
4603ec0f AS |
4109 | |
4110 | /* | |
4111 | * Update revs->commits to contain the list of | |
4112 | * boundary commits. | |
4113 | */ | |
4114 | create_boundary_commit_list(revs); | |
4115 | ||
3c68d67b | 4116 | return get_revision_internal(revs); |
86ab4906 JH |
4117 | } |
4118 | ||
4119 | /* | |
4120 | * boundary commits are the commits that are parents of the | |
4121 | * ones we got from get_revision_1() but they themselves are | |
4122 | * not returned from get_revision_1(). Before returning | |
4123 | * 'c', we need to mark its parents that they could be boundaries. | |
4124 | */ | |
4125 | ||
4126 | for (l = c->parents; l; l = l->next) { | |
4127 | struct object *p; | |
4128 | p = &(l->item->object); | |
c33d8593 | 4129 | if (p->flags & (CHILD_SHOWN | SHOWN)) |
86ab4906 JH |
4130 | continue; |
4131 | p->flags |= CHILD_SHOWN; | |
4132 | gc_boundary(&revs->boundary_commits); | |
4133 | add_object_array(p, NULL, &revs->boundary_commits); | |
4134 | } | |
4135 | ||
4136 | return c; | |
d5db6c9e | 4137 | } |
7fefda5c AS |
4138 | |
4139 | struct commit *get_revision(struct rev_info *revs) | |
4140 | { | |
498bcd31 TR |
4141 | struct commit *c; |
4142 | struct commit_list *reversed; | |
4143 | ||
4144 | if (revs->reverse) { | |
4145 | reversed = NULL; | |
9e57ac55 | 4146 | while ((c = get_revision_internal(revs))) |
498bcd31 | 4147 | commit_list_insert(c, &reversed); |
498bcd31 TR |
4148 | revs->commits = reversed; |
4149 | revs->reverse = 0; | |
4150 | revs->reverse_output_stage = 1; | |
4151 | } | |
4152 | ||
1b32dece NTND |
4153 | if (revs->reverse_output_stage) { |
4154 | c = pop_commit(&revs->commits); | |
4155 | if (revs->track_linear) | |
4156 | revs->linear = !!(c && c->object.flags & TRACK_LINEAR); | |
4157 | return c; | |
4158 | } | |
498bcd31 TR |
4159 | |
4160 | c = get_revision_internal(revs); | |
7fefda5c AS |
4161 | if (c && revs->graph) |
4162 | graph_update(revs->graph, c); | |
1b32dece | 4163 | if (!c) { |
53d00b39 | 4164 | free_saved_parents(revs); |
1b32dece NTND |
4165 | if (revs->previous_parents) { |
4166 | free_commit_list(revs->previous_parents); | |
4167 | revs->previous_parents = NULL; | |
4168 | } | |
4169 | } | |
7fefda5c AS |
4170 | return c; |
4171 | } | |
1df2d656 | 4172 | |
49825164 | 4173 | const char *get_revision_mark(const struct rev_info *revs, const struct commit *commit) |
1df2d656 MG |
4174 | { |
4175 | if (commit->object.flags & BOUNDARY) | |
4176 | return "-"; | |
4177 | else if (commit->object.flags & UNINTERESTING) | |
4178 | return "^"; | |
adbbb31e MG |
4179 | else if (commit->object.flags & PATCHSAME) |
4180 | return "="; | |
1df2d656 MG |
4181 | else if (!revs || revs->left_right) { |
4182 | if (commit->object.flags & SYMMETRIC_LEFT) | |
4183 | return "<"; | |
4184 | else | |
4185 | return ">"; | |
4186 | } else if (revs->graph) | |
4187 | return "*"; | |
adbbb31e MG |
4188 | else if (revs->cherry_mark) |
4189 | return "+"; | |
1df2d656 MG |
4190 | return ""; |
4191 | } | |
b1b47554 MG |
4192 | |
4193 | void put_revision_mark(const struct rev_info *revs, const struct commit *commit) | |
4194 | { | |
49825164 | 4195 | const char *mark = get_revision_mark(revs, commit); |
b1b47554 MG |
4196 | if (!strlen(mark)) |
4197 | return; | |
4198 | fputs(mark, stdout); | |
4199 | putchar(' '); | |
4200 | } |