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