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