"Elijah Newren via GitGitGadget" <gitgitgadget@xxxxxxxxx> writes:
> + /*
> + * merge_incore_nonrecursive() exists for cases where we always
> + * know there is a well-defined single merge base. However,
> + * despite a similar structure, merge-recursive.c noted that some
> + * callers preferred to call the recursive logic anyway and still
> + * set a special name for opt->ancestor that would appear in
> + * merge.conflictStyle=diff3 output.
Sorry, I do not understand the comment, especially the "anyway"
part. There is no such thing as nonrecursive variant of
merge-recursive, is it? If somebody wanted to perform a merge of
two trees with a designated single common ancestor ("am -3" would
want to do so using a fabricated tree, "cherry-pick" would want to
do so using the parent commit of what gets picked), it would be
natural to call "git merge-recursive O -- A B" if it is a scripted
Porcelain, or would call merge_recursive() with the single merge
base on the merge_bases commit_list parameter if it is written in C,
I would think.
> + * git-am was one such example (it wanted to set opt->ancestor to
> + * "constructed merge base", since it created a fake merge base);
> + * it called the recursive merge logic through a special
> + * merge_recursive_generic() wrapper.
> + *
> + * Allow the same kind of special case here.
> + */
In any case, the mention of "constructed merge base" may explain
very well why the assert in the previous iteration checked for the
string, but it does not seem relevant after the condition changed.
> + int num_merge_bases_is_1 = (merge_bases && !merge_bases->next);
> + assert(opt->ancestor == NULL || num_merge_bases_is_1);
The above comment may have explained why some callers that call the
machinery with a single merge base want to use its own diff3 label,
but the assert the comment applies to is stricter than that.
In other words, it is unclear why the caller is forbidden from
giving the diff3 label, when the recursive merge needs to synthesize
the virtual ancestor using all the given merge bases?
The answer could be a simple "opt->ancestor field is managed by the
recursive machinery itself when it needs to create virtual ancestor,
and must start as NULL, but when we do not create virtual ancestor,
it is allowed to start with any value, as the machinery itself does
not assign any new value to the field", but I cannot read if that is
the case from the comments in the patch.
> +
> + merge_start(opt, result);
> + merge_ort_internal(opt, merge_bases, side1, side2, result);
> }
> diff --git a/merge-ort.h b/merge-ort.h
> index 55ae7ee865d..d53a0a339f3 100644
> --- a/merge-ort.h
> +++ b/merge-ort.h
> @@ -34,6 +34,16 @@ struct merge_result {
> /*
> * rename-detecting three-way merge with recursive ancestor consolidation.
> * working tree and index are untouched.
> + *
> + * merge_bases will be consumed (emptied) so make a copy if you need it.
> + *
> + * NOTE: empirically, the recursive algorithm will perform better if you
> + * pass the merge_bases in the order of oldest commit to the
> + * newest[1][2].
> + *
> + * [1] https://lore.kernel.org/git/nycvar.QRO.7.76.6.1907252055500.21907@xxxxxxxxxxxxxxxxx/
> + * [2] commit 8918b0c9c2 ("merge-recur: try to merge older merge bases
> + * first", 2006-08-09)
> */
I initially thought that this was a bit out-of-place for the comment
that explains why the merge bases list gets reversed in the code, but
it is actually the right place---it guides the callers that hand a
list of merge_bases to the function.
> void merge_incore_recursive(struct merge_options *opt,
> struct commit_list *merge_bases,
Thanks.
