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