git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Re: [PATCH 37/48] merge-recursive: Fix modify/delete resolution in the recursive case

From
Junio C Hamano <gitster@pobox.com>
Date
Jul 21, 2011, 18:43 UTC
Message-ID
<7voc0n1nl8.fsf@alter.siamese.dyndns.org>
In-Reply-To
<1307518278-23814-38-git-send-email-newren@gmail.com>
Elijah Newren <newren@gmail.com> writes:
Show 16 quoted lines
> When o->call_depth>0 and we have conflicts, we try to find "middle ground"
> when creating the virtual merge base.  In the case of content conflicts,
> this can be done by doing a three-way content merge and using the result.
> In all parts where the three-way content merge is clean, it is the correct
> middle ground, and in parts where it conflicts there is no middle ground
> but the conflict markers provide a good compromise since they are unlikely
> to accidentally match any further changes.
>
> In the case of a modify/delete conflict, we cannot do the same thing.
> Accepting either endpoint as the resolution for the virtual merge base
> runs the risk that when handling the non-recursive case we will silently
> accept one person's resolution over another without flagging a conflict.
> In this case, the closest "middle ground" we have is actually the merge
> base of the candidate merge bases.  (We could alternatively attempt a
> three way content merge using an empty file in place of the deleted file,
> but that seems to be more work than necessary.)
What did we use before this patch as the "middle ground"?

Doesn't the "middle ground" also need to contain information from both sides? At the content level, The half-merge result with conflict marker contains all the necessary information on what both sides agreed to do outside the marker area, while showing what each side wished to do inside, so as you describe, it is a good "middle ground".

Using the merge-base would mean that at the tree-structural level of this merge you ignore the wish of one side that wanted to delete the path, and then at the content level you also ignore the wish of both sides (the side that wanted to delete the path wanted to leave zero content, while the other side wanted to modify from the version in merge-base, all of which is ignored by the above argument).

When you want to make a criss-corss merge between E and F that looks like this:

      A---C---E---?
     / \ /       /
    O   .       /
     \ / \     /
      B---D---F

if there is no deletion, we run a content level merge between C and D by using X that is a potentially conflicting merge between A and B as a "virtual" ancestor.

      A---C---E---?
     / \ /       /
    O   X       /
     \ / \     /
      B---D---F

X would contain both what both A and B agreed to do on top of O, and what A and B wanted to do that they do not agree with. The differing opinion of A and B are recorded inside the conflict markers. The change that turns X into E contains C's opinion (i.e. it would likely agree to take what both A and B agreed to do, and it may agree with A and the result in E would resemble what A wanted to bring to the result despite B's objection). If C and D both agree how to resolve the conflict, then B's "objection" will cancel out from the three-way merge between E and F that uses X as the ancestor.

In a delete/modify situation (e.g. A modified while B deleted), there are three possibilities:

 * C and D both agree to delete the path;
 * C and D both agree to keep the path, with modifications that may or may
   not conflict (which can be handled by the usual content-level merge);
 * C decides to delete, while D decides to modify (or vice versa).

And in the last case, the outer merge ? needs to decide if it wants to keep or delete the path anyway, so a simplest solution is to punt the whole recursive business and make it the responsibility of the user to resolve it as a merge between E and F using O as the common ancestor. This patch does so in all three cases.

I however wonder if we can do better in the second case (I do not think the first case would come into the picture, as we would not see such a path when merging E and F as it would have been long gone from both branches). We wouldn't know which commits C and D are exactly, but we do have E and F. If A modified the path and B deleted it, and C and D both decided to keep the path and E and F both inherited that path, wouldn't it be fair to say that what both branches wanted to do is closer to what A did than what B did? In other words, instead of using O, wouldn't it give us a better result if we used A (the side that did not delete) as the common ancestor for the content level merge when both E and F has the path?

Show 16 quoted lines
> diff --git a/merge-recursive.c b/merge-recursive.c
> index da507a3..5a70a87 100644
> --- a/merge-recursive.c
> +++ b/merge-recursive.c
> @@ -1309,11 +1309,26 @@ error_return:
>  
>  static void handle_delete_modify(struct merge_options *o,
>  				 const char *path,
> -				 const char *new_path,
> +				 unsigned char *o_sha, int o_mode,
>  				 unsigned char *a_sha, int a_mode,
>  				 unsigned char *b_sha, int b_mode)
>  {
> -	if (!a_sha) {
> +	char *new_path = NULL;
> +	int free_me = 0;
No need for free_me anymore, no?
Show 24 quoted lines
> +	if (dir_in_way(path, !o->call_depth)) {
> +		new_path = unique_path(o, path, a_sha ? o->branch1 : o->branch2);
> +		free_me = 1;
> +	}
> +
> +	if (o->call_depth) {
> +		/*
> +		 * We cannot arbitrarily accept either a_sha or b_sha as
> +		 * correct; since there is no true "middle point" between
> +		 * them, simply reuse the base version for virtual merge base.
> +		 */
> +		remove_file_from_cache(path);
> +		update_file(o, 0, o_sha, o_mode, new_path ? new_path : path);
> +	} else if (!a_sha) {
>  		output(o, 1, "CONFLICT (delete/modify): %s deleted in %s "
>  		       "and modified in %s. Version %s of %s left in tree%s%s.",
>  		       path, o->branch1,
> @@ -1330,6 +1345,9 @@ static void handle_delete_modify(struct merge_options *o,
>  		       NULL == new_path ? "" : new_path);
>  		update_file(o, 0, a_sha, a_mode, new_path ? new_path : path);
>  	}
> +	if (free_me)
> +		free(new_path);
> +
... as new_path is non-NULL only when we allocated it.
Previous: Elijah NewrenNext: Elijah Newren
Message 72 of 97 in “Handling more corner cases in merge-recursive.c”
  1. 00/48 Handling more corner cases in merge-recursive.cElijah Newren, Jun 8, 2011
  2. 01/48 t6039: Add a testcase where git deletes an untracked fileElijah Newren, Jun 8, 2011
  3. 02/48 t6039: Add failing testcase for rename/modify/add-source conflictElijah Newren, Jun 8, 2011
  4. 03/48 t6039: Add a pair of cases where undetected renames cause issuesElijah Newren, Jun 8, 2011
  5. 04/48 t6039: Add a testcase where undetected rename causes silent file deletionElijah Newren, Jun 8, 2011
  6. 05/48 t6039: Add tests for content issues with modify/rename/directory conflictsElijah Newren, Jun 8, 2011
  7. Junio C HamanoJul 18, 2011
  8. Elijah NewrenAug 8, 2011
  9. 06/48 t6039: Add failing testcases for rename/rename/add-{source,dest} conflictsElijah Newren, Jun 8, 2011
  10. Junio C HamanoJul 18, 2011
  11. 07/48 t6039: Ensure rename/rename conflicts leave index and workdir in sane stateElijah Newren, Jun 8, 2011
  12. Junio C HamanoJul 18, 2011
  13. Elijah NewrenAug 8, 2011
  14. 08/48 t6036: Add differently resolved modify/delete conflict in criss-cross testElijah Newren, Jun 8, 2011
  15. Junio C HamanoJul 18, 2011
  16. 09/48 t6036: criss-cross with weird content can fool git into clean mergeElijah Newren, Jun 8, 2011
  17. Junio C HamanoJul 18, 2011
  18. Elijah NewrenAug 8, 2011
  19. 10/48 t6036: tests for criss-cross merges with various directory/file conflictsElijah Newren, Jun 8, 2011
  20. Junio C HamanoJul 18, 2011
  21. Elijah NewrenAug 8, 2011
  22. 11/48 t6036: criss-cross w/ rename/rename(1to2)/modify+rename/rename(2to1)/modifyElijah Newren, Jun 8, 2011
  23. Junio C HamanoJul 18, 2011
  24. 12/48 t6036: criss-cross + rename/rename(1to2)/add-source + modify/modifyElijah Newren, Jun 8, 2011
  25. Junio C HamanoJul 18, 2011
  26. Phil HordJul 20, 2011
  27. 13/48 t6022: Remove unnecessary untracked files to make test cleanerElijah Newren, Jun 8, 2011
  28. 14/48 t6022: New tests checking for unnecessary updates of filesElijah Newren, Jun 8, 2011
  29. 15/48 t6022: Add testcase for merging a renamed file with a simple changeElijah Newren, Jun 8, 2011
  30. 16/48 merge-recursive: Make BUG message more legible by adding a newlineElijah Newren, Jun 8, 2011
  31. 17/48 merge-recursive: Correct a commentElijah Newren, Jun 8, 2011
  32. 18/48 merge-recursive: Mark some diff_filespec struct arguments constElijah Newren, Jun 8, 2011
  33. Junio C HamanoJul 18, 2011
  34. 19/48 merge-recursive: Remember to free generated unique path namesElijah Newren, Jun 8, 2011
  35. Junio C HamanoJul 18, 2011
  36. 20/48 merge-recursive: Avoid working directory changes during recursive caseElijah Newren, Jun 8, 2011
  37. 21/48 merge-recursive: Fix recursive case with D/F conflict via add/add conflictElijah Newren, Jun 8, 2011
  38. Junio C HamanoJul 18, 2011
  39. 22/48 merge-recursive: Fix sorting order and directory change assumptionsElijah Newren, Jun 8, 2011
  40. Johannes SixtJul 11, 2011
  41. Johannes SixtJul 12, 2011
  42. Johannes SixtJul 13, 2011
  43. Junio C HamanoJul 13, 2011
  44. Junio C HamanoJul 18, 2011
  45. Elijah NewrenAug 8, 2011
  46. 23/48 merge-recursive: Fix code checking for D/F conflicts still being presentElijah Newren, Jun 8, 2011
  47. 24/48 merge-recursive: Save D/F conflict filenames instead of unlinking themElijah Newren, Jun 8, 2011
  48. 25/48 merge-recursive: Split was_tracked() out of would_lose_untracked()Elijah Newren, Jun 8, 2011
  49. 26/48 merge-recursive: Allow make_room_for_path() to remove D/F entriesElijah Newren, Jun 8, 2011
  50. Johannes SixtJul 11, 2011
  51. Johannes SixtJul 13, 2011
  52. Elijah NewrenAug 8, 2011
  53. Johannes SixtAug 9, 2011
  54. Junio C HamanoJul 18, 2011
  55. 27/48 merge-recursive: Consolidate different update_stages functionsElijah Newren, Jun 8, 2011
  56. Junio C HamanoJul 18, 2011
  57. 28/48 merge-recursive: Split update_stages_and_entry; only update stages at endElijah Newren, Jun 8, 2011
  58. Junio C HamanoJul 18, 2011
  59. 29/48 merge-recursive: When we detect we can skip an update, actually skip itElijah Newren, Jun 8, 2011
  60. Junio C HamanoJul 18, 2011
  61. 30/48 merge-recursive: Fix deletion of untracked file in rename/delete conflictsElijah Newren, Jun 8, 2011
  62. Junio C HamanoJul 21, 2011
  63. 31/48 merge-recursive: Make dead code for rename/rename(2to1) conflicts undeadElijah Newren, Jun 8, 2011
  64. 32/48 merge-recursive: Add comments about handling rename/add-source casesElijah Newren, Jun 8, 2011
  65. 33/48 merge-recursive: Improve handling of rename target vs. directory additionElijah Newren, Jun 8, 2011
  66. 34/48 merge-recursive: Consolidate process_entry() and process_df_entry()Elijah Newren, Jun 8, 2011
  67. Junio C HamanoJul 21, 2011
  68. 35/48 merge-recursive: Cleanup and consolidation of rename_conflict_infoElijah Newren, Jun 8, 2011
  69. 36/48 merge-recursive: Provide more info in conflict markers with file renamesElijah Newren, Jun 8, 2011
  70. Junio C HamanoJul 21, 2011
  71. 37/48 merge-recursive: Fix modify/delete resolution in the recursive caseElijah Newren, Jun 8, 2011
  72. Junio C HamanoJul 21, 2011
  73. Elijah NewrenAug 8, 2011
  74. 38/48 merge-recursive: Introduce a merge_file convenience functionElijah Newren, Jun 8, 2011
  75. 39/48 merge-recursive: Fix rename/rename(1to2) resolution for virtual merge baseElijah Newren, Jun 8, 2011
  76. Junio C HamanoJul 25, 2011
  77. Elijah NewrenAug 8, 2011
  78. 40/48 merge-recursive: Small cleanups for conflict_rename_rename_1to2Elijah Newren, Jun 8, 2011
  79. 41/48 merge-recursive: Defer rename/rename(2to1) handling until process_entryElijah Newren, Jun 8, 2011
  80. 42/48 merge-recursive: Record more data needed for merging with dual renamesElijah Newren, Jun 8, 2011
  81. 43/48 merge-recursive: Create function for merging with branchname:file markersElijah Newren, Jun 8, 2011
  82. 44/48 merge-recursive: Consider modifications in rename/rename(2to1) conflictsElijah Newren, Jun 8, 2011
  83. 45/48 merge-recursive: Make modify/delete handling code reusableElijah Newren, Jun 8, 2011
  84. 46/48 merge-recursive: Have conflict_rename_delete reuse modify/delete codeElijah Newren, Jun 8, 2011
  85. 47/48 merge-recursive: add handling for rename/rename/add-dest/add-destElijah Newren, Jun 8, 2011
  86. 48/48 merge-recursive: Fix working copy handling for rename/rename/add/addElijah Newren, Jun 8, 2011
  87. Junio C HamanoJun 11, 2011
  88. Junio C HamanoAug 4, 2011
  89. Junio C HamanoAug 4, 2011
  90. Elijah NewrenAug 4, 2011
  91. Elijah NewrenAug 4, 2011
  92. Junio C HamanoAug 4, 2011
  93. Elijah NewrenAug 4, 2011
  94. Junio C HamanoAug 6, 2011
  95. Elijah NewrenAug 6, 2011
  96. Junio C HamanoJun 12, 2011
  97. Junio C HamanoJun 12, 2011

Read the whole thread, see it on lore, or plain text.

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.