{"thread":{"id":"35934","subject":"[PATCH v2 0/8] log --remerge-diff","startedAt":"2014-02-22T09:17:48Z","lastAt":"2014-09-06T17:46:28Z","messageCount":16,"participants":["Thomas Rast","Eric Sunshine","Junio C Hamano"],"isPatch":true,"patchVersion":2,"patchTotal":8},"messages":[{"id":"235177","messageId":"cover.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":null,"subject":"[PATCH v2 0/8] log --remerge-diff","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:48Z","receivedAt":"2014-02-22T09:17:48Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"This is the second iteration of\n\n http://thread.gmane.org/gmane.comp.version-control.git/241565\n\nChanges since the last version:\n\n* Dropped patches 4 and 5 (log --merge-bases)\n\n* Implemented the \"full-file conflict\" scheme explained in the\n previous cover letter: if the conflicted version is lacking one\n stage of a file, it synthesizes a conflict file of the form\n\n <<<<<<<\n =======\n content of the stage that exists\n >>>>>>>\n\n (or the other way around if stage3 is missing). This occurs at\n least with delete/modify conflicts.\n\n* Implemented some basic handling of directory/file conflicts. I'm\n not completely happy yet -- see the NEEDSWORK comments -- but at\n least it gives consistent input to the diffing stage.\n\n This required access to the dir hash, so there's a new patch 7 that\n makes this possible.\n\nPatches 1-6 (used to be 1-3 and 6-8) are unchanged.\n\n\nThomas Rast (8):\n merge-recursive: remove dead conditional in update_stages()\n merge-recursive: internal flag to avoid touching the worktree\n merge-recursive: -Xindex-only to leave worktree unchanged\n combine-diff: do not pass revs->dense_combined_merges redundantly\n Fold all merge diff variants into an enum\n merge-recursive: allow storing conflict hunks in index\n name-hash: allow dir hashing even when !ignore_case\n log --remerge-diff: show what the conflict resolution changed\n\n Documentation/merge-strategies.txt | 9 ++\n Documentation/rev-list-options.txt | 7 +\n builtin/diff-files.c | 5 +-\n builtin/diff-tree.c | 2 +-\n builtin/diff.c | 12 +-\n builtin/fmt-merge-msg.c | 2 +-\n builtin/log.c | 9 +-\n builtin/merge.c | 1 -\n cache.h | 2 +\n combine-diff.c | 13 +-\n diff-lib.c | 13 +-\n diff.h | 6 +-\n log-tree.c | 304 ++++++++++++++++++++++++++++++++++++-\n merge-recursive.c | 52 ++++---\n merge-recursive.h | 3 +\n name-hash.c | 19 ++-\n revision.c | 15 +-\n revision.h | 24 ++-\n submodule.c | 3 +-\n t/t3030-merge-recursive.sh | 33 ++++\n t/t4213-log-remerge-diff.sh | 222 +++++++++++++++++++++++++++\n 21 files changed, 678 insertions(+), 78 deletions(-)\n create mode 100755 t/t4213-log-remerge-diff.sh\n\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235185","messageId":"f68a6a74ecf23db6c565d59abee23587545b6d6c.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 1/8] merge-recursive: remove dead conditional in update_stages()","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:49Z","receivedAt":"2014-02-22T09:17:49Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"From: Thomas Rast \n\n650467c (merge-recursive: Consolidate different update_stages\nfunctions, 2011-08-11) changed the former argument 'clear' to always\nbe true. Remove the useless conditional.\n\nSigned-off-by: Thomas Rast \nSigned-off-by: Junio C Hamano \n---\n merge-recursive.c | 6 ++----\n 1 file changed, 2 insertions(+), 4 deletions(-)\n\ndiff --git a/merge-recursive.c b/merge-recursive.c\nindex 8400a8e..c36dc79 100644\n--- a/merge-recursive.c\n+++ b/merge-recursive.c\n@@ -545,11 +545,9 @@ static int update_stages(const char *path, const struct diff_filespec *o,\n \t * would_lose_untracked). Instead, reverse the order of the calls\n \t * (executing update_file first and then update_stages).\n \t */\n-\tint clear = 1;\n \tint options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK;\n-\tif (clear)\n-\t\tif (remove_file_from_cache(path))\n-\t\t\treturn -1;\n+\tif (remove_file_from_cache(path))\n+\t\treturn -1;\n \tif (o)\n \t\tif (add_cacheinfo(o->mode, o->sha1, path, 1, 0, options))\n \t\t\treturn -1;\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235179","messageId":"4247dd8849480718f515a133d26fecbd2615bd40.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 2/8] merge-recursive: internal flag to avoid touching the worktree","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:50Z","receivedAt":"2014-02-22T09:17:50Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"From: Thomas Rast \n\no->call_depth has a double function: a nonzero call_depth means we\nwant to construct virtual merge bases, but it also means we want to\navoid touching the worktree. Introduce a new flag o->no_worktree to\ntrigger only the latter.\n\nSigned-off-by: Thomas Rast \nSigned-off-by: Junio C Hamano \n---\n merge-recursive.c | 37 +++++++++++++++++++++----------------\n merge-recursive.h | 1 +\n 2 files changed, 22 insertions(+), 16 deletions(-)\n\ndiff --git a/merge-recursive.c b/merge-recursive.c\nindex c36dc79..35be144 100644\n--- a/merge-recursive.c\n+++ b/merge-recursive.c\n@@ -408,10 +408,10 @@ static void record_df_conflict_files(struct merge_options *o,\n \tint i;\n \n \t/*\n-\t * If we're merging merge-bases, we don't want to bother with\n-\t * any working directory changes.\n+\t * If we're working in-core only (e.g., merging merge-bases),\n+\t * we don't want to bother with any working directory changes.\n \t */\n-\tif (o->call_depth)\n+\tif (o->call_depth || o->no_worktree)\n \t\treturn;\n \n \t/* Ensure D/F conflicts are adjacent in the entries list. */\n@@ -724,7 +724,7 @@ static void update_file_flags(struct merge_options *o,\n \t\t\t int update_cache,\n \t\t\t int update_wd)\n {\n-\tif (o->call_depth)\n+\tif (o->call_depth || o->no_worktree)\n \t\tupdate_wd = 0;\n \n \tif (update_wd) {\n@@ -931,7 +931,8 @@ static struct merge_file_info merge_file_1(struct merge_options *o,\n \t\t\tresult.clean = merge_submodule(result.sha,\n \t\t\t\t\t\t one->path, one->sha1,\n \t\t\t\t\t\t a->sha1, b->sha1,\n-\t\t\t\t\t\t !o->call_depth);\n+\t\t\t\t\t\t !(o->call_depth ||\n+\t\t\t\t\t\t\t o->no_worktree));\n \t\t} else if (S_ISLNK(a->mode)) {\n \t\t\thashcpy(result.sha, a->sha1);\n \n@@ -1003,7 +1004,7 @@ static void handle_change_delete(struct merge_options *o,\n \t\t\t\t const char *change, const char *change_past)\n {\n \tchar *renamed = NULL;\n-\tif (dir_in_way(path, !o->call_depth)) {\n+\tif (dir_in_way(path, !(o->call_depth || o->no_worktree))) {\n \t\trenamed = unique_path(o, path, a_sha ? o->branch1 : o->branch2);\n \t}\n \n@@ -1128,10 +1129,10 @@ static void handle_file(struct merge_options *o,\n \t\tchar *add_name = unique_path(o, rename->path, other_branch);\n \t\tupdate_file(o, 0, add->sha1, add->mode, add_name);\n \n-\t\tremove_file(o, 0, rename->path, 0);\n+\t\tremove_file(o, 0, rename->path, o->call_depth || o->no_worktree);\n \t\tdst_name = unique_path(o, rename->path, cur_branch);\n \t} else {\n-\t\tif (dir_in_way(rename->path, !o->call_depth)) {\n+\t\tif (dir_in_way(rename->path, !(o->call_depth || o->no_worktree))) {\n \t\t\tdst_name = unique_path(o, rename->path, cur_branch);\n \t\t\toutput(o, 1, _(\"%s is a directory in %s adding as %s instead\"),\n \t\t\t rename->path, other_branch, dst_name);\n@@ -1238,7 +1239,7 @@ static void conflict_rename_rename_2to1(struct merge_options *o,\n \t\t * merge base just undo the renames; they can be detected\n \t\t * again later for the non-recursive merge.\n \t\t */\n-\t\tremove_file(o, 0, path, 0);\n+\t\tremove_file(o, 0, path, o->call_depth || o->no_worktree);\n \t\tupdate_file(o, 0, mfi_c1.sha, mfi_c1.mode, a->path);\n \t\tupdate_file(o, 0, mfi_c2.sha, mfi_c2.mode, b->path);\n \t} else {\n@@ -1246,7 +1247,7 @@ static void conflict_rename_rename_2to1(struct merge_options *o,\n \t\tchar *new_path2 = unique_path(o, path, ci->branch2);\n \t\toutput(o, 1, _(\"Renaming %s to %s and %s to %s instead\"),\n \t\t a->path, new_path1, b->path, new_path2);\n-\t\tremove_file(o, 0, path, 0);\n+\t\tremove_file(o, 0, path, o->call_depth || o->no_worktree);\n \t\tupdate_file(o, 0, mfi_c1.sha, mfi_c1.mode, new_path1);\n \t\tupdate_file(o, 0, mfi_c2.sha, mfi_c2.mode, new_path2);\n \t\tfree(new_path2);\n@@ -1405,6 +1406,7 @@ static int process_renames(struct merge_options *o,\n \t\t\t * add-source case).\n \t\t\t */\n \t\t\tremove_file(o, 1, ren1_src,\n+\t\t\t\t o->call_depth || o->no_worktree ||\n \t\t\t\t renamed_stage == 2 || !was_tracked(ren1_src));\n \n \t\t\thashcpy(src_other.sha1, ren1->src_entry->stages[other_stage].sha);\n@@ -1601,7 +1603,7 @@ static int merge_content(struct merge_options *o,\n \t\t\t o->branch2 == rename_conflict_info->branch1) ?\n \t\t\tpair1->two->path : pair1->one->path;\n \n-\t\tif (dir_in_way(path, !o->call_depth))\n+\t\tif (dir_in_way(path, !(o->call_depth || o->no_worktree)))\n \t\t\tdf_conflict_remains = 1;\n \t}\n \tmfi = merge_file_special_markers(o, &one, &a, &b,\n@@ -1621,7 +1623,7 @@ static int merge_content(struct merge_options *o,\n \t\tpath_renamed_outside_HEAD = !path2 || !strcmp(path, path2);\n \t\tif (!path_renamed_outside_HEAD) {\n \t\t\tadd_cacheinfo(mfi.mode, mfi.sha, path,\n-\t\t\t\t 0, (!o->call_depth), 0);\n+\t\t\t\t 0, !(o->call_depth || o->no_worktree), 0);\n \t\t\treturn mfi.clean;\n \t\t}\n \t} else\n@@ -1722,7 +1724,8 @@ static int process_entry(struct merge_options *o,\n \t\t\tif (a_sha)\n \t\t\t\toutput(o, 2, _(\"Removing %s\"), path);\n \t\t\t/* do not touch working file if it did not exist */\n-\t\t\tremove_file(o, 1, path, !a_sha);\n+\t\t\tremove_file(o, 1, path,\n+\t\t\t\t o->call_depth || o->no_worktree || !a_sha);\n \t\t} else {\n \t\t\t/* Modify/delete; deleted side may have put a directory in the way */\n \t\t\tclean_merge = 0;\n@@ -1753,7 +1756,7 @@ static int process_entry(struct merge_options *o,\n \t\t\tsha = b_sha;\n \t\t\tconf = _(\"directory/file\");\n \t\t}\n-\t\tif (dir_in_way(path, !o->call_depth)) {\n+\t\tif (dir_in_way(path, !(o->call_depth || o->no_worktree))) {\n \t\t\tchar *new_path = unique_path(o, path, add_branch);\n \t\t\tclean_merge = 0;\n \t\t\toutput(o, 1, _(\"CONFLICT (%s): There is a directory with name %s in %s. \"\n@@ -1781,7 +1784,8 @@ static int process_entry(struct merge_options *o,\n \t\t * this entry was deleted altogether. a_mode == 0 means\n \t\t * we had that path and want to actively remove it.\n \t\t */\n-\t\tremove_file(o, 1, path, !a_mode);\n+\t\tremove_file(o, 1, path,\n+\t\t\t o->call_depth || o->no_worktree || !a_mode);\n \t} else\n \t\tdie(_(\"Fatal merge failure, shouldn't happen.\"));\n \n@@ -1807,7 +1811,8 @@ int merge_trees(struct merge_options *o,\n \t\treturn 1;\n \t}\n \n-\tcode = git_merge_trees(o->call_depth, common, head, merge);\n+\tcode = git_merge_trees(o->call_depth || o->no_worktree,\n+\t\t\t common, head, merge);\n \n \tif (code != 0) {\n \t\tif (show(o, 4) || o->call_depth)\ndiff --git a/merge-recursive.h b/merge-recursive.h\nindex 9e090a3..d8dd7a1 100644\n--- a/merge-recursive.h\n+++ b/merge-recursive.h\n@@ -15,6 +15,7 @@ struct merge_options {\n \tconst char *subtree_shift;\n \tunsigned buffer_output : 1;\n \tunsigned renormalize : 1;\n+\tunsigned no_worktree : 1; /* do not touch worktree */\n \tlong xdl_opts;\n \tint verbosity;\n \tint diff_rename_limit;\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235184","messageId":"2e56b258bca6cf83c322da4be85c42c7b54f6a3e.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 3/8] merge-recursive: -Xindex-only to leave worktree unchanged","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:51Z","receivedAt":"2014-02-22T09:17:51Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"From: Thomas Rast \n\nUsing the new no_worktree flag from the previous commit, we can teach\nmerge-recursive to leave the worktree untouched. Expose this with a\nnew strategy option so that scripts can use it.\n\nSigned-off-by: Junio C Hamano \n---\n Documentation/merge-strategies.txt | 4 ++++\n merge-recursive.c | 2 ++\n t/t3030-merge-recursive.sh | 13 +++++++++++++\n 3 files changed, 19 insertions(+)\n\ndiff --git a/Documentation/merge-strategies.txt b/Documentation/merge-strategies.txt\nindex fb6e593..2934e99 100644\n--- a/Documentation/merge-strategies.txt\n+++ b/Documentation/merge-strategies.txt\n@@ -92,6 +92,10 @@ subtree[=];;\n \tis prefixed (or stripped from the beginning) to make the shape of\n \ttwo trees to match.\n \n+index-only;;\n+\tWrite the merge result only to the index; do not touch the\n+\tworktree.\n+\n octopus::\n \tThis resolves cases with more than two heads, but refuses to do\n \ta complex merge that needs manual resolution. It is\ndiff --git a/merge-recursive.c b/merge-recursive.c\nindex 35be144..f59c1d3 100644\n--- a/merge-recursive.c\n+++ b/merge-recursive.c\n@@ -2096,6 +2096,8 @@ int parse_merge_opt(struct merge_options *o, const char *s)\n \t\tif ((o->rename_score = parse_rename_score(&score)) == -1 || *score != 0)\n \t\t\treturn -1;\n \t}\n+\telse if (!strcmp(s, \"index-only\"))\n+\t\to->no_worktree = 1;\n \telse\n \t\treturn -1;\n \treturn 0;\ndiff --git a/t/t3030-merge-recursive.sh b/t/t3030-merge-recursive.sh\nindex 2f96100..2f3a16c 100755\n--- a/t/t3030-merge-recursive.sh\n+++ b/t/t3030-merge-recursive.sh\n@@ -296,6 +296,19 @@ test_expect_success 'merge-recursive result' '\n \n '\n \n+test_expect_success 'merge-recursive --index-only' '\n+\n+\trm -fr [abcd] &&\n+\tgit checkout -f \"$c2\" &&\n+\ttest_expect_code 1 git merge-recursive --index-only \"$c0\" -- \"$c2\" \"$c1\" &&\n+\tgit ls-files -s >actual &&\n+\t# reuses \"expected\" from previous test!\n+\ttest_cmp expected actual &&\n+\tgit diff HEAD >actual-diff &&\n+\t: >expected-diff &&\n+\ttest_cmp expected-diff actual-diff\n+'\n+\n test_expect_success 'fail if the index has unresolved entries' '\n \n \trm -fr [abcd] &&\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235180","messageId":"a731e50c8426b9f6c7c9116edfa9c47b979c7a79.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 4/8] combine-diff: do not pass revs->dense_combined_merges redundantly","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:52Z","receivedAt":"2014-02-22T09:17:52Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"The existing code passed revs->dense_combined_merges along revs itself\ninto the combine-diff functions, which is rather redundant. Remove\nthe 'dense' argument until much further down the callchain to simplify\ncallers.\n\nNote that while the caller in submodule.c needs to do extra work now,\nthe next commit will simplify this to a single setting again.\n\nSigned-off-by: Thomas Rast \n---\n builtin/diff.c | 3 +--\n combine-diff.c | 13 ++++++-------\n diff-lib.c | 6 ++----\n diff.h | 6 +++---\n log-tree.c | 2 +-\n submodule.c | 5 ++++-\n 6 files changed, 17 insertions(+), 18 deletions(-)\n\ndiff --git a/builtin/diff.c b/builtin/diff.c\nindex 0f247d2..47f663b 100644\n--- a/builtin/diff.c\n+++ b/builtin/diff.c\n@@ -196,8 +196,7 @@ static int builtin_diff_combined(struct rev_info *revs,\n \t\trevs->dense_combined_merges = revs->combine_merges = 1;\n \tfor (i = 1; i < ents; i++)\n \t\tsha1_array_append(&parents, ent[i].item->sha1);\n-\tdiff_tree_combined(ent[0].item->sha1, &parents,\n-\t\t\t revs->dense_combined_merges, revs);\n+\tdiff_tree_combined(ent[0].item->sha1, &parents, revs);\n \tsha1_array_clear(&parents);\n \treturn 0;\n }\ndiff --git a/combine-diff.c b/combine-diff.c\nindex 3b92c448..6e80a73 100644\n--- a/combine-diff.c\n+++ b/combine-diff.c\n@@ -952,7 +952,7 @@ static void show_combined_header(struct combine_diff_path *elem,\n }\n \n static void show_patch_diff(struct combine_diff_path *elem, int num_parent,\n-\t\t\t int dense, int working_tree_file,\n+\t\t\t int working_tree_file,\n \t\t\t struct rev_info *rev)\n {\n \tstruct diff_options *opt = &rev->diffopt;\n@@ -967,6 +967,7 @@ static void show_patch_diff(struct combine_diff_path *elem, int num_parent,\n \tstruct userdiff_driver *textconv = NULL;\n \tint is_binary;\n \tconst char *line_prefix = diff_line_prefix(opt);\n+\tint dense = rev->dense_combined_merges;\n \n \tcontext = opt->context;\n \tuserdiff = userdiff_find_by_path(elem->path);\n@@ -1214,7 +1215,6 @@ static void show_raw_diff(struct combine_diff_path *p, int num_parent, struct re\n */\n void show_combined_diff(struct combine_diff_path *p,\n \t\t int num_parent,\n-\t\t int dense,\n \t\t struct rev_info *rev)\n {\n \tstruct diff_options *opt = &rev->diffopt;\n@@ -1226,7 +1226,7 @@ void show_combined_diff(struct combine_diff_path *p,\n \t\t\t\t DIFF_FORMAT_NAME_STATUS))\n \t\tshow_raw_diff(p, num_parent, rev);\n \telse if (opt->output_format & DIFF_FORMAT_PATCH)\n-\t\tshow_patch_diff(p, num_parent, dense, 1, rev);\n+\t\tshow_patch_diff(p, num_parent, 1, rev);\n }\n \n static void free_combined_pair(struct diff_filepair *pair)\n@@ -1297,7 +1297,6 @@ static void handle_combined_callback(struct diff_options *opt,\n \n void diff_tree_combined(const unsigned char *sha1,\n \t\t\tconst struct sha1_array *parents,\n-\t\t\tint dense,\n \t\t\tstruct rev_info *rev)\n {\n \tstruct diff_options *opt = &rev->diffopt;\n@@ -1365,7 +1364,7 @@ void diff_tree_combined(const unsigned char *sha1,\n \t\t\t\t opt->line_termination);\n \t\t\tfor (p = paths; p; p = p->next) {\n \t\t\t\tif (p->len)\n-\t\t\t\t\tshow_patch_diff(p, num_parent, dense,\n+\t\t\t\t\tshow_patch_diff(p, num_parent,\n \t\t\t\t\t\t\t0, rev);\n \t\t\t}\n \t\t}\n@@ -1381,7 +1380,7 @@ void diff_tree_combined(const unsigned char *sha1,\n \tfree_pathspec(&diffopts.pathspec);\n }\n \n-void diff_tree_combined_merge(const struct commit *commit, int dense,\n+void diff_tree_combined_merge(const struct commit *commit,\n \t\t\t struct rev_info *rev)\n {\n \tstruct commit_list *parent = get_saved_parents(rev, commit);\n@@ -1391,6 +1390,6 @@ void diff_tree_combined_merge(const struct commit *commit, int dense,\n \t\tsha1_array_append(&parents, parent->item->object.sha1);\n \t\tparent = parent->next;\n \t}\n-\tdiff_tree_combined(commit->object.sha1, &parents, dense, rev);\n+\tdiff_tree_combined(commit->object.sha1, &parents, rev);\n \tsha1_array_clear(&parents);\n }\ndiff --git a/diff-lib.c b/diff-lib.c\nindex 346cac6..8d0f572 100644\n--- a/diff-lib.c\n+++ b/diff-lib.c\n@@ -174,9 +174,7 @@ int run_diff_files(struct rev_info *revs, unsigned int option)\n \t\t\ti--;\n \n \t\t\tif (revs->combine_merges && num_compare_stages == 2) {\n-\t\t\t\tshow_combined_diff(dpath, 2,\n-\t\t\t\t\t\t revs->dense_combined_merges,\n-\t\t\t\t\t\t revs);\n+\t\t\t\tshow_combined_diff(dpath, 2, revs);\n \t\t\t\tfree(dpath);\n \t\t\t\tcontinue;\n \t\t\t}\n@@ -338,7 +336,7 @@ static int show_modified(struct rev_info *revs,\n \t\tp->parent[1].status = DIFF_STATUS_MODIFIED;\n \t\tp->parent[1].mode = old->ce_mode;\n \t\thashcpy(p->parent[1].sha1, old->sha1);\n-\t\tshow_combined_diff(p, 2, revs->dense_combined_merges, revs);\n+\t\tshow_combined_diff(p, 2, revs);\n \t\tfree(p);\n \t\treturn 0;\n \t}\ndiff --git a/diff.h b/diff.h\nindex ce123fa..ff77802 100644\n--- a/diff.h\n+++ b/diff.h\n@@ -213,11 +213,11 @@ struct combine_diff_path {\n \t sizeof(struct combine_diff_parent) * (n) + (l) + 1)\n \n extern void show_combined_diff(struct combine_diff_path *elem, int num_parent,\n-\t\t\t int dense, struct rev_info *);\n+\t\t\t struct rev_info *);\n \n-extern void diff_tree_combined(const unsigned char *sha1, const struct sha1_array *parents, int dense, struct rev_info *rev);\n+extern void diff_tree_combined(const unsigned char *sha1, const struct sha1_array *parents, struct rev_info *rev);\n \n-extern void diff_tree_combined_merge(const struct commit *commit, int dense, struct rev_info *rev);\n+extern void diff_tree_combined_merge(const struct commit *commit, struct rev_info *rev);\n \n void diff_set_mnemonic_prefix(struct diff_options *options, const char *a, const char *b);\n \ndiff --git a/log-tree.c b/log-tree.c\nindex 08970bf..4c04812 100644\n--- a/log-tree.c\n+++ b/log-tree.c\n@@ -718,7 +718,7 @@ int log_tree_diff_flush(struct rev_info *opt)\n \n static int do_diff_combined(struct rev_info *opt, struct commit *commit)\n {\n-\tdiff_tree_combined_merge(commit, opt->dense_combined_merges, opt);\n+\tdiff_tree_combined_merge(commit, opt);\n \treturn !opt->loginfo;\n }\n \ndiff --git a/submodule.c b/submodule.c\nindex 613857e..83b80fb 100644\n--- a/submodule.c\n+++ b/submodule.c\n@@ -505,10 +505,13 @@ static void find_unpushed_submodule_commits(struct commit *commit,\n \tstruct rev_info rev;\n \n \tinit_revisions(&rev, NULL);\n+\trev.ignore_merges = 0;\n+\trev.combined_merges = 1;\n+\trev.dense_combined_merges = 1;\n \trev.diffopt.output_format |= DIFF_FORMAT_CALLBACK;\n \trev.diffopt.format_callback = collect_submodules_from_diff;\n \trev.diffopt.format_callback_data = needs_pushing;\n-\tdiff_tree_combined_merge(commit, 1, &rev);\n+\tdiff_tree_combined_merge(commit, &rev);\n }\n \n int find_unpushed_submodules(unsigned char new_sha1[20],\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235181","messageId":"72dad5aa67ca5700696cfa408b91a079141f7dc7.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 5/8] Fold all merge diff variants into an enum","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:53Z","receivedAt":"2014-02-22T09:17:53Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"The four ways of displaying merge diffs,\n\n* none: no diff\n* -m: against each parent\n* -c: combined\n* --cc: combined-condensed\n\nwere encoded in three flag bits in struct rev_info. Fold them all\ninto a single enum field that captures the variants.\n\nThis makes it easier to add new merge diff variants without yet more\nspecial casing. It should also be slightly easier to read because one\ndoes not have to ensure that the flag bits are set in an expected\ncombination.\n\nSigned-off-by: Thomas Rast \n---\n builtin/diff-files.c | 5 +++--\n builtin/diff-tree.c | 2 +-\n builtin/diff.c | 9 +++++----\n builtin/fmt-merge-msg.c | 2 +-\n builtin/log.c | 9 ++++-----\n builtin/merge.c | 1 -\n combine-diff.c | 2 +-\n diff-lib.c | 7 ++++---\n log-tree.c | 4 ++--\n revision.c | 13 +++----------\n revision.h | 22 +++++++++++++++++++---\n submodule.c | 4 +---\n 12 files changed, 44 insertions(+), 36 deletions(-)\n\ndiff --git a/builtin/diff-files.c b/builtin/diff-files.c\nindex 9200069..172b50d 100644\n--- a/builtin/diff-files.c\n+++ b/builtin/diff-files.c\n@@ -57,9 +57,10 @@ int cmd_diff_files(int argc, const char **argv, const char *prefix)\n \t * was not asked to. \"diff-files -c -p\" should not densify\n \t * (the user should ask with \"diff-files --cc\" explicitly).\n \t */\n-\tif (rev.max_count == -1 && !rev.combine_merges &&\n+\tif (rev.max_count == -1 &&\n+\t !merge_diff_mode_is_any_combined(&rev) &&\n \t (rev.diffopt.output_format & DIFF_FORMAT_PATCH))\n-\t\trev.combine_merges = rev.dense_combined_merges = 1;\n+\t\trev.merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n \n \tif (read_cache_preload(&rev.diffopt.pathspec) < 0) {\n \t\tperror(\"read_cache_preload\");\ndiff --git a/builtin/diff-tree.c b/builtin/diff-tree.c\nindex be6417d..2950f80 100644\n--- a/builtin/diff-tree.c\n+++ b/builtin/diff-tree.c\n@@ -96,7 +96,7 @@ static int diff_tree_stdin(char *line)\n static void diff_tree_tweak_rev(struct rev_info *rev, struct setup_revision_opt *opt)\n {\n \tif (!rev->diffopt.output_format) {\n-\t\tif (rev->dense_combined_merges)\n+\t\tif (rev->merge_diff_mode == MERGE_DIFF_COMBINED_CONDENSED)\n \t\t\trev->diffopt.output_format = DIFF_FORMAT_PATCH;\n \t\telse\n \t\t\trev->diffopt.output_format = DIFF_FORMAT_RAW;\ndiff --git a/builtin/diff.c b/builtin/diff.c\nindex 47f663b..fd4c75f 100644\n--- a/builtin/diff.c\n+++ b/builtin/diff.c\n@@ -192,8 +192,8 @@ static int builtin_diff_combined(struct rev_info *revs,\n \tif (argc > 1)\n \t\tusage(builtin_diff_usage);\n \n-\tif (!revs->dense_combined_merges && !revs->combine_merges)\n-\t\trevs->dense_combined_merges = revs->combine_merges = 1;\n+\tif (!merge_diff_mode_is_any_combined(revs))\n+\t\trevs->merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n \tfor (i = 1; i < ents; i++)\n \t\tsha1_array_append(&parents, ent[i].item->sha1);\n \tdiff_tree_combined(ent[0].item->sha1, &parents, revs);\n@@ -242,9 +242,10 @@ static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv\n \t * dense one, --cc can be explicitly asked for, or just rely\n \t * on the default).\n \t */\n-\tif (revs->max_count == -1 && !revs->combine_merges &&\n+\tif (revs->max_count == -1 &&\n+\t !merge_diff_mode_is_any_combined(revs) &&\n \t (revs->diffopt.output_format & DIFF_FORMAT_PATCH))\n-\t\trevs->combine_merges = revs->dense_combined_merges = 1;\n+\t\trevs->merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n \n \tsetup_work_tree();\n \tif (read_cache_preload(&revs->diffopt.pathspec) < 0) {\ndiff --git a/builtin/fmt-merge-msg.c b/builtin/fmt-merge-msg.c\nindex 3906eda..2deeacd 100644\n--- a/builtin/fmt-merge-msg.c\n+++ b/builtin/fmt-merge-msg.c\n@@ -637,7 +637,7 @@ int fmt_merge_msg(struct strbuf *in, struct strbuf *out,\n \t\thead = lookup_commit_or_die(head_sha1, \"HEAD\");\n \t\tinit_revisions(&rev, NULL);\n \t\trev.commit_format = CMIT_FMT_ONELINE;\n-\t\trev.ignore_merges = 1;\n+\t\trev.merge_diff_mode = MERGE_DIFF_IGNORE;\n \t\trev.limited = 1;\n \n \t\tstrbuf_complete_line(out);\ndiff --git a/builtin/log.c b/builtin/log.c\nindex b97373d..cebebea 100644\n--- a/builtin/log.c\n+++ b/builtin/log.c\n@@ -499,13 +499,12 @@ static int show_tree_object(const unsigned char *sha1,\n \n static void show_rev_tweak_rev(struct rev_info *rev, struct setup_revision_opt *opt)\n {\n-\tif (rev->ignore_merges) {\n+\tif (!rev->merge_diff_mode) {\n \t\t/* There was no \"-m\" on the command line */\n-\t\trev->ignore_merges = 0;\n-\t\tif (!rev->first_parent_only && !rev->combine_merges) {\n+\t\trev->merge_diff_mode = MERGE_DIFF_EACH;\n+\t\tif (!rev->first_parent_only) {\n \t\t\t/* No \"--first-parent\", \"-c\", nor \"--cc\" */\n-\t\t\trev->combine_merges = 1;\n-\t\t\trev->dense_combined_merges = 1;\n+\t\t\trev->merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n \t\t}\n \t}\n \tif (!rev->diffopt.output_format)\ndiff --git a/builtin/merge.c b/builtin/merge.c\nindex e576a7f..6977af7 100644\n--- a/builtin/merge.c\n+++ b/builtin/merge.c\n@@ -343,7 +343,6 @@ static void squash_message(struct commit *commit, struct commit_list *remotehead\n \t\tdie_errno(_(\"Could not write to '%s'\"), filename);\n \n \tinit_revisions(&rev, NULL);\n-\trev.ignore_merges = 1;\n \trev.commit_format = CMIT_FMT_MEDIUM;\n \n \tcommit->object.flags |= UNINTERESTING;\ndiff --git a/combine-diff.c b/combine-diff.c\nindex 6e80a73..3fae2dd 100644\n--- a/combine-diff.c\n+++ b/combine-diff.c\n@@ -967,7 +967,7 @@ static void show_patch_diff(struct combine_diff_path *elem, int num_parent,\n \tstruct userdiff_driver *textconv = NULL;\n \tint is_binary;\n \tconst char *line_prefix = diff_line_prefix(opt);\n-\tint dense = rev->dense_combined_merges;\n+\tint dense = (rev->merge_diff_mode == MERGE_DIFF_COMBINED_CONDENSED);\n \n \tcontext = opt->context;\n \tuserdiff = userdiff_find_by_path(elem->path);\ndiff --git a/diff-lib.c b/diff-lib.c\nindex 8d0f572..e2700eb 100644\n--- a/diff-lib.c\n+++ b/diff-lib.c\n@@ -173,7 +173,8 @@ int run_diff_files(struct rev_info *revs, unsigned int option)\n \t\t\t */\n \t\t\ti--;\n \n-\t\t\tif (revs->combine_merges && num_compare_stages == 2) {\n+\t\t\tif (merge_diff_mode_is_any_combined(revs) &&\n+\t\t\t num_compare_stages == 2) {\n \t\t\t\tshow_combined_diff(dpath, 2, revs);\n \t\t\t\tfree(dpath);\n \t\t\t\tcontinue;\n@@ -316,7 +317,7 @@ static int show_modified(struct rev_info *revs,\n \t\treturn -1;\n \t}\n \n-\tif (revs->combine_merges && !cached &&\n+\tif (merge_diff_mode_is_any_combined(revs) && !cached &&\n \t (hashcmp(sha1, old->sha1) || hashcmp(old->sha1, new->sha1))) {\n \t\tstruct combine_diff_path *p;\n \t\tint pathlen = ce_namelen(new);\n@@ -375,7 +376,7 @@ static void do_oneway_diff(struct unpack_trees_options *o,\n \t * But with the revision flag parsing, that's found in\n \t * \"!revs->ignore_merges\".\n \t */\n-\tmatch_missing = !revs->ignore_merges;\n+\tmatch_missing = (revs->merge_diff_mode == MERGE_DIFF_EACH);\n \n \tif (cached && idx && ce_stage(idx)) {\n \t\tstruct diff_filepair *pair;\ndiff --git a/log-tree.c b/log-tree.c\nindex 4c04812..30b3063 100644\n--- a/log-tree.c\n+++ b/log-tree.c\n@@ -751,9 +751,9 @@ static int log_tree_diff(struct rev_info *opt, struct commit *commit, struct log\n \n \t/* More than one parent? */\n \tif (parents && parents->next) {\n-\t\tif (opt->ignore_merges)\n+\t\tif (opt->merge_diff_mode == MERGE_DIFF_IGNORE)\n \t\t\treturn 0;\n-\t\telse if (opt->combine_merges)\n+\t\telse if (merge_diff_mode_is_any_combined(opt))\n \t\t\treturn do_diff_combined(opt, commit);\n \t\telse if (opt->first_parent_only) {\n \t\t\t/*\ndiff --git a/revision.c b/revision.c\nindex a0df72f..127b75a 100644\n--- a/revision.c\n+++ b/revision.c\n@@ -1329,7 +1329,6 @@ void init_revisions(struct rev_info *revs, const char *prefix)\n \tmemset(revs, 0, sizeof(*revs));\n \n \trevs->abbrev = DEFAULT_ABBREV;\n-\trevs->ignore_merges = 1;\n \trevs->simplify_history = 1;\n \tDIFF_OPT_SET(&revs->pruning, RECURSIVE);\n \tDIFF_OPT_SET(&revs->pruning, QUICK);\n@@ -1807,15 +1806,11 @@ static int handle_revision_opt(struct rev_info *revs, int argc, const char **arg\n \t\tDIFF_OPT_SET(&revs->diffopt, RECURSIVE);\n \t\tDIFF_OPT_SET(&revs->diffopt, TREE_IN_RECURSIVE);\n \t} else if (!strcmp(arg, \"-m\")) {\n-\t\trevs->ignore_merges = 0;\n+\t\trevs->merge_diff_mode = MERGE_DIFF_EACH;\n \t} else if (!strcmp(arg, \"-c\")) {\n-\t\trevs->diff = 1;\n-\t\trevs->dense_combined_merges = 0;\n-\t\trevs->combine_merges = 1;\n+\t\trevs->merge_diff_mode = MERGE_DIFF_COMBINED;\n \t} else if (!strcmp(arg, \"--cc\")) {\n-\t\trevs->diff = 1;\n-\t\trevs->dense_combined_merges = 1;\n-\t\trevs->combine_merges = 1;\n+\t\trevs->merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n \t} else if (!strcmp(arg, \"-v\")) {\n \t\trevs->verbose_header = 1;\n \t} else if (!strcmp(arg, \"--pretty\")) {\n@@ -2228,8 +2223,6 @@ int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct s\n \t\t\tcopy_pathspec(&revs->diffopt.pathspec,\n \t\t\t\t &revs->prune_data);\n \t}\n-\tif (revs->combine_merges)\n-\t\trevs->ignore_merges = 0;\n \trevs->diffopt.abbrev = revs->abbrev;\n \n \tif (revs->line_level_traverse) {\ndiff --git a/revision.h b/revision.h\nindex 88967d6..0847902 100644\n--- a/revision.h\n+++ b/revision.h\n@@ -50,6 +50,17 @@ struct rev_cmdline_info {\n #define REVISION_WALK_NO_WALK_SORTED 1\n #define REVISION_WALK_NO_WALK_UNSORTED 2\n \n+enum merge_diff_mode {\n+\t/* default: do not show diffs for merge */\n+\tMERGE_DIFF_IGNORE = 0,\n+\t/* diff against each side (-m) */\n+\tMERGE_DIFF_EACH,\n+\t/* combined format (-c) */\n+\tMERGE_DIFF_COMBINED,\n+\t/* combined-condensed format (-cc) */\n+\tMERGE_DIFF_COMBINED_CONDENSED\n+};\n+\n struct rev_info {\n \t/* Starting list */\n \tstruct commit_list *commits;\n@@ -116,11 +127,10 @@ struct rev_info {\n \t\t\tshow_root_diff:1,\n \t\t\tno_commit_id:1,\n \t\t\tverbose_header:1,\n-\t\t\tignore_merges:1,\n-\t\t\tcombine_merges:1,\n-\t\t\tdense_combined_merges:1,\n \t\t\talways_show_header:1;\n \n+\tenum merge_diff_mode merge_diff_mode;\n+\n \t/* Format info */\n \tunsigned int\tshown_one:1,\n \t\t\tshown_dashes:1,\n@@ -197,6 +207,12 @@ struct rev_info {\n \tstruct saved_parents *saved_parents_slab;\n };\n \n+static inline int merge_diff_mode_is_any_combined(struct rev_info *revs)\n+{\n+\treturn (revs->merge_diff_mode == MERGE_DIFF_COMBINED ||\n+\t\trevs->merge_diff_mode == MERGE_DIFF_COMBINED_CONDENSED);\n+}\n+\n extern int ref_excluded(struct string_list *, const char *path);\n void clear_ref_exclusion(struct string_list **);\n void add_ref_exclusion(struct string_list **, const char *exclude);\ndiff --git a/submodule.c b/submodule.c\nindex 83b80fb..38973f2 100644\n--- a/submodule.c\n+++ b/submodule.c\n@@ -505,9 +505,7 @@ static void find_unpushed_submodule_commits(struct commit *commit,\n \tstruct rev_info rev;\n \n \tinit_revisions(&rev, NULL);\n-\trev.ignore_merges = 0;\n-\trev.combined_merges = 1;\n-\trev.dense_combined_merges = 1;\n+\trev.merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n \trev.diffopt.output_format |= DIFF_FORMAT_CALLBACK;\n \trev.diffopt.format_callback = collect_submodules_from_diff;\n \trev.diffopt.format_callback_data = needs_pushing;\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235182","messageId":"a8898c0544850c5170ad76fa6fbed9991ad6aba1.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 6/8] merge-recursive: allow storing conflict hunks in index","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:54Z","receivedAt":"2014-02-22T09:17:54Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"Add a --conflicts-in-index option to merge-recursive, which instructs\nit to always store the 3-way merged result in the index. (Normally it\nonly does so in recursive invocations, but not for the final result.)\n\nThis serves as a building block for the \"remerge diff\" feature coming\nup in a subsequent patch. The external option lets us easily use it\nfrom tests, where we'd otherwise need a new test-* helper to access\nthe feature.\n\nFurthermore, it might occasionally be useful for scripts that want to\nlook at the result of invoking git-merge without tampering with the\nworktree. They could already get the _conflicts_ with --index-only,\nbut not (conveniently) the conflict-hunk formatted files that would\nnormally be written to the worktree.\n\nSigned-off-by: Thomas Rast \n---\n Documentation/merge-strategies.txt | 5 +++++\n merge-recursive.c | 4 ++++\n merge-recursive.h | 1 +\n t/t3030-merge-recursive.sh | 20 ++++++++++++++++++++\n 4 files changed, 30 insertions(+)\n\ndiff --git a/Documentation/merge-strategies.txt b/Documentation/merge-strategies.txt\nindex 2934e99..3468d99 100644\n--- a/Documentation/merge-strategies.txt\n+++ b/Documentation/merge-strategies.txt\n@@ -96,6 +96,11 @@ index-only;;\n \tWrite the merge result only to the index; do not touch the\n \tworktree.\n \n+conflicts-in-index;;\n+\tFor conflicted files, write 3-way merged contents with\n+\tconflict hunks to the index, instead of leaving their entries\n+\tunresolved.\n+\n octopus::\n \tThis resolves cases with more than two heads, but refuses to do\n \ta complex merge that needs manual resolution. It is\ndiff --git a/merge-recursive.c b/merge-recursive.c\nindex f59c1d3..b682812 100644\n--- a/merge-recursive.c\n+++ b/merge-recursive.c\n@@ -724,6 +724,8 @@ static void update_file_flags(struct merge_options *o,\n \t\t\t int update_cache,\n \t\t\t int update_wd)\n {\n+\tif (o->conflicts_in_index)\n+\t\tupdate_cache = 1;\n \tif (o->call_depth || o->no_worktree)\n \t\tupdate_wd = 0;\n \n@@ -2098,6 +2100,8 @@ int parse_merge_opt(struct merge_options *o, const char *s)\n \t}\n \telse if (!strcmp(s, \"index-only\"))\n \t\to->no_worktree = 1;\n+\telse if (!strcmp(s, \"conflicts-in-index\"))\n+\t\to->conflicts_in_index = 1;\n \telse\n \t\treturn -1;\n \treturn 0;\ndiff --git a/merge-recursive.h b/merge-recursive.h\nindex d8dd7a1..9b8e20b 100644\n--- a/merge-recursive.h\n+++ b/merge-recursive.h\n@@ -16,6 +16,7 @@ struct merge_options {\n \tunsigned buffer_output : 1;\n \tunsigned renormalize : 1;\n \tunsigned no_worktree : 1; /* do not touch worktree */\n+\tunsigned conflicts_in_index : 1; /* index will contain conflict hunks */\n \tlong xdl_opts;\n \tint verbosity;\n \tint diff_rename_limit;\ndiff --git a/t/t3030-merge-recursive.sh b/t/t3030-merge-recursive.sh\nindex 2f3a16c..4192fd3 100755\n--- a/t/t3030-merge-recursive.sh\n+++ b/t/t3030-merge-recursive.sh\n@@ -309,6 +309,26 @@ test_expect_success 'merge-recursive --index-only' '\n \ttest_cmp expected-diff actual-diff\n '\n \n+test_expect_success 'merge-recursive --index-only --conflicts-in-index' '\n+\t# first pass: do a merge as usual to obtain \"expected\"\n+\trm -fr [abcd] &&\n+\tgit checkout -f \"$c2\" &&\n+\ttest_expect_code 1 git merge-recursive \"$c0\" -- \"$c2\" \"$c1\" &&\n+\tgit add [abcd] &&\n+\tgit ls-files -s >expected &&\n+\t# second pass: actual test\n+\trm -fr [abcd] &&\n+\tgit checkout -f \"$c2\" &&\n+\ttest_expect_code 1 \\\n+\t\tgit merge-recursive --index-only --conflicts-in-index \\\n+\t\t\"$c0\" -- \"$c2\" \"$c1\" &&\n+\tgit ls-files -s >actual &&\n+\ttest_cmp expected actual &&\n+\tgit diff HEAD >actual-diff &&\n+\t: >expected-diff &&\n+\ttest_cmp expected-diff actual-diff\n+'\n+\n test_expect_success 'fail if the index has unresolved entries' '\n \n \trm -fr [abcd] &&\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235178","messageId":"38527c9f6ae31ad39d8f3dddfe5252a3527629ed.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 7/8] name-hash: allow dir hashing even when !ignore_case","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:55Z","receivedAt":"2014-02-22T09:17:55Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"The directory hash (for fast checks if the index already has a\ndirectory) was only used in ignore_case mode and so depended on that\nflag.\n\nMake it generally available on request.\n\nSigned-off-by: Thomas Rast \n---\n cache.h | 2 ++\n name-hash.c | 19 ++++++++++++-------\n 2 files changed, 14 insertions(+), 7 deletions(-)\n\ndiff --git a/cache.h b/cache.h\nindex dc040fb..e162021 100644\n--- a/cache.h\n+++ b/cache.h\n@@ -276,6 +276,7 @@ struct index_state {\n \tstruct cache_tree *cache_tree;\n \tstruct cache_time timestamp;\n \tunsigned name_hash_initialized : 1,\n+\t\t has_dir_hash : 1,\n \t\t initialized : 1;\n \tstruct hash_table name_hash;\n \tstruct hash_table dir_hash;\n@@ -284,6 +285,7 @@ struct index_state {\n extern struct index_state the_index;\n \n /* Name hashing */\n+extern void init_name_hash(struct index_state *istate, int force_dir_hash);\n extern void add_name_hash(struct index_state *istate, struct cache_entry *ce);\n extern void remove_name_hash(struct index_state *istate, struct cache_entry *ce);\n extern void free_name_hash(struct index_state *istate);\ndiff --git a/name-hash.c b/name-hash.c\nindex e5b6e1a..c8953be 100644\n--- a/name-hash.c\n+++ b/name-hash.c\n@@ -141,16 +141,19 @@ static void hash_index_entry(struct index_state *istate, struct cache_entry *ce)\n \t\t*pos = ce;\n \t}\n \n-\tif (ignore_case && !(ce->ce_flags & CE_UNHASHED))\n+\tif (istate->has_dir_hash && !(ce->ce_flags & CE_UNHASHED))\n \t\tadd_dir_entry(istate, ce);\n }\n \n-static void lazy_init_name_hash(struct index_state *istate)\n+void init_name_hash(struct index_state *istate, int force_dir_hash)\n {\n \tint nr;\n \n \tif (istate->name_hash_initialized)\n \t\treturn;\n+\n+\tistate->has_dir_hash = force_dir_hash || ignore_case;\n+\n \tif (istate->cache_nr)\n \t\tpreallocate_hash(&istate->name_hash, istate->cache_nr);\n \tfor (nr = 0; nr < istate->cache_nr; nr++)\n@@ -161,7 +164,7 @@ static void lazy_init_name_hash(struct index_state *istate)\n void add_name_hash(struct index_state *istate, struct cache_entry *ce)\n {\n \t/* if already hashed, add reference to directory entries */\n-\tif (ignore_case && (ce->ce_flags & CE_STATE_MASK) == CE_STATE_MASK)\n+\tif (istate->has_dir_hash && (ce->ce_flags & CE_STATE_MASK) == CE_STATE_MASK)\n \t\tadd_dir_entry(istate, ce);\n \n \tce->ce_flags &= ~CE_UNHASHED;\n@@ -181,7 +184,7 @@ void add_name_hash(struct index_state *istate, struct cache_entry *ce)\n void remove_name_hash(struct index_state *istate, struct cache_entry *ce)\n {\n \t/* if already hashed, release reference to directory entries */\n-\tif (ignore_case && (ce->ce_flags & CE_STATE_MASK) == CE_HASHED)\n+\tif (istate->has_dir_hash && (ce->ce_flags & CE_STATE_MASK) == CE_HASHED)\n \t\tremove_dir_entry(istate, ce);\n \n \tce->ce_flags |= CE_UNHASHED;\n@@ -228,7 +231,7 @@ struct cache_entry *index_dir_exists(struct index_state *istate, const char *nam\n \tstruct cache_entry *ce;\n \tstruct dir_entry *dir;\n \n-\tlazy_init_name_hash(istate);\n+\tinit_name_hash(istate, 0);\n \tdir = find_dir_entry(istate, name, namelen);\n \tif (dir && dir->nr)\n \t\treturn dir->ce;\n@@ -250,7 +253,7 @@ struct cache_entry *index_file_exists(struct index_state *istate, const char *na\n \tunsigned int hash = hash_name(name, namelen);\n \tstruct cache_entry *ce;\n \n-\tlazy_init_name_hash(istate);\n+\tinit_name_hash(istate, 0);\n \tce = lookup_hash(hash, &istate->name_hash);\n \n \twhile (ce) {\n@@ -286,9 +289,11 @@ void free_name_hash(struct index_state *istate)\n \tif (!istate->name_hash_initialized)\n \t\treturn;\n \tistate->name_hash_initialized = 0;\n-\tif (ignore_case)\n+\tif (istate->has_dir_hash) {\n \t\t/* free directory entries */\n \t\tfor_each_hash(&istate->dir_hash, free_dir_entry, NULL);\n+\t\tistate->has_dir_hash = 0;\n+\t}\n \n \tfree_hash(&istate->name_hash);\n \tfree_hash(&istate->dir_hash);\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235183","messageId":"75c29215c6a61fe1dc3f088f0fcd9acfa54f24fa.1393059605.git.tr@thomasrast.ch","threadId":"35934","inReplyTo":"cover.1393059605.git.tr@thomasrast.ch","subject":"[PATCH v2 8/8] log --remerge-diff: show what the conflict resolution changed","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-22T09:17:56Z","receivedAt":"2014-02-22T09:17:56Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"Git has --cc as a very fast inspection tool that shows a brief summary\nof what a conflicted merge \"looks like\", and -c/-m as \"give me the\nfull information\" data dumps.\n\nBut --cc actually loses information: if the merge lost(!) some changes\nfrom one side, that hunk would fully agree with the other side, and\ntherefore be elided. So --cc cannot be used to investigate mismerges.\nIndeed it is rather hard to find a merge that has lost changes, unless\none knows where to look.\n\nThe new option --remerge-diff is an attempt at filling this gap,\nadmittedly at the cost of a lot of CPU cycles. For each merge commit,\nit diffs the merge result against a recursive merge of the merge's\nparents.\n\nFor files that can be auto-merged cleanly, it will typically show\nnothing. However, it will make it obvious when the merge introduces\nextra changes.\n\nFor files that result in merge conflicts, we diff against the\nrepresentation with conflict hunks (what the user would usually see in\nthe worktree). So the diff will show what was changed in the conflict\nhunks to resolve the conflict.\n\nIt still takes a bit of staring to tell an evil from a regular merge.\nBut at least the information is there, unlike with --cc; and the\noutput is usually much shorter than with -c.\n\nSigned-off-by: Thomas Rast \n---\n Documentation/rev-list-options.txt | 7 +\n log-tree.c | 298 +++++++++++++++++++++++++++++++++++++\n merge-recursive.c | 3 +-\n merge-recursive.h | 1 +\n revision.c | 2 +\n revision.h | 4 +-\n t/t4213-log-remerge-diff.sh | 222 +++++++++++++++++++++++++++\n 7 files changed, 535 insertions(+), 2 deletions(-)\n create mode 100755 t/t4213-log-remerge-diff.sh\n\ndiff --git a/Documentation/rev-list-options.txt b/Documentation/rev-list-options.txt\nindex 03533af..73264dc 100644\n--- a/Documentation/rev-list-options.txt\n+++ b/Documentation/rev-list-options.txt\n@@ -790,6 +790,13 @@ options may be given. See linkgit:git-diff-files[1] for more options.\n \tin that case, the output represents the changes the merge\n \tbrought _into_ the then-current branch.\n \n+--remerge-diff::\n+\tDiff merge commits against a recursive merge of their parents,\n+\twith conflict hunks. Intuitively speaking, this shows what\n+\tthe author of the merge changed to resolve the merge. It\n+\tassumes that all (or most) merges are recursive merges; other\n+\tstrategies are not supported.\n+\n -r::\n \tShow recursive diffs.\n \ndiff --git a/log-tree.c b/log-tree.c\nindex 30b3063..9b831e9 100644\n--- a/log-tree.c\n+++ b/log-tree.c\n@@ -11,6 +11,8 @@\n #include \"gpg-interface.h\"\n #include \"sequencer.h\"\n #include \"line-log.h\"\n+#include \"cache-tree.h\"\n+#include \"merge-recursive.h\"\n \n struct decoration name_decoration = { \"object names\" };\n \n@@ -723,6 +725,300 @@ static int do_diff_combined(struct rev_info *opt, struct commit *commit)\n }\n \n /*\n+ * Helpers for make_asymmetric_conflict_entries() below.\n+ */\n+static char *load_cache_entry_blob(struct cache_entry *entry,\n+\t\t\t\t unsigned long *size)\n+{\n+\tenum object_type type;\n+\tvoid *data;\n+\n+\tif (!entry)\n+\t\treturn NULL;\n+\n+\tdata = read_sha1_file(entry->sha1, &type, size);\n+\tif (type != OBJ_BLOB)\n+\t\tdie(\"BUG: load_cache_entry_blob for non-blob\");\n+\n+\treturn data;\n+}\n+\n+static void strbuf_append_cache_entry_blob(struct strbuf *sb,\n+\t\t\t\t\t struct cache_entry *entry)\n+{\n+\tunsigned long size;\n+\tchar *data = load_cache_entry_blob(entry, &size);;\n+\n+\tif (!data)\n+\t\treturn;\n+\n+\tstrbuf_add(sb, data, size);\n+\tfree(data);\n+}\n+\n+static void assemble_conflict_entry(struct strbuf *sb,\n+\t\t\t\t const char *branch1,\n+\t\t\t\t const char *branch2,\n+\t\t\t\t struct cache_entry *entry1,\n+\t\t\t\t struct cache_entry *entry2)\n+{\n+\tstrbuf_addf(sb, \"<<<<<<< %s\\n\", branch1);\n+\tstrbuf_append_cache_entry_blob(sb, entry1);\n+\tstrbuf_addstr(sb, \"=======\\n\");\n+\tstrbuf_append_cache_entry_blob(sb, entry2);\n+\tstrbuf_addf(sb, \">>>>>>> %s\\n\", branch2);\n+}\n+\n+/*\n+ * For --remerge-diff, we need conflicted (<<<<<<< ... >>>>>>>)\n+ * representations of as many conflicts as possible. Default conflict\n+ * generation only applies to files that have all three stages.\n+ *\n+ * This function generates conflict hunk representations for files\n+ * that have only one of stage 2 or 3. The corresponding side in the\n+ * conflict hunk format will be empty. A stage 1, if any, will be\n+ * dropped in the process.\n+ */\n+static void make_asymmetric_conflict_entries(const char *branch1,\n+\t\t\t\t\t const char *branch2)\n+{\n+\tint o = 0, i = 0;\n+\n+\t/*\n+\t * NEEDSWORK: we trample all over the cache below, so we need\n+\t * to set up the name hash early, before modifying it. And\n+\t * after that we cannot free any cache entries, because they\n+\t * remain hashed even if deleted. Sigh.\n+\t */\n+\tinit_name_hash(&the_index, 1);\n+\n+\t/*\n+\t * The loop always starts with 'i' pointing at the first entry\n+\t * for a pathname.\n+\t */\n+\twhile (i < active_nr) {\n+\t\tstruct cache_entry *ce;\n+\t\tstruct cache_entry *stage1 = NULL;\n+\t\tstruct cache_entry *stage2 = NULL;\n+\t\tstruct cache_entry *stage3 = NULL;\n+\t\tstruct cache_entry *new_ce = NULL;\n+\t\tstruct strbuf content = STRBUF_INIT;\n+\t\tunsigned char sha1[20];\n+\n+\t\tassert(o <= i);\n+\n+\t\tce = active_cache[i];\n+\n+\t\t/*\n+\t\t * Pass through stage 0 and submodules unchanged, we\n+\t\t * don't know how to handle them.\n+\t\t */\n+\t\tif (ce_stage(ce) == 0\n+\t\t || S_ISGITLINK(ce->ce_mode)) {\n+\t\t\tactive_cache[o++] = ce;\n+\t\t\ti++;\n+\t\t\tcontinue;\n+\t\t}\n+\n+\t\t/*\n+\t\t * Collect the stages we have. Point 'i' past the\n+\t\t * entry.\n+\t\t */\n+\t\tif (/* i < active_nr && */\n+\t\t !strcmp(ce->name, active_cache[i]->name) &&\n+\t\t ce_stage(active_cache[i]) == 1)\n+\t\t\tstage1 = active_cache[i++];\n+\n+\t\tif (i < active_nr &&\n+\t\t !strcmp(ce->name, active_cache[i]->name) &&\n+\t\t ce_stage(active_cache[i]) == 2)\n+\t\t\tstage2 = active_cache[i++];\n+\n+\t\tif (i < active_nr &&\n+\t\t !strcmp(ce->name, active_cache[i]->name) &&\n+\t\t ce_stage(active_cache[i]) == 3)\n+\t\t\tstage3 = active_cache[i++];\n+\n+\t\tif (!stage2 && !stage3)\n+\t\t\tdie(\"BUG: merging resulted in conflict with neither \"\n+\t\t\t \"stage 2 nor 3\");\n+\n+\t\tif (cache_dir_exists(ce->name, ce->ce_namelen)) {\n+\t\t\t/*\n+\t\t\t * If a conflicting directory for this entry exists,\n+\t\t\t * we can drop it:\n+\t\t\t *\n+\t\t\t * In the face of a file/directory conflict,\n+\t\t\t * merge-recursive\n+\t\t\t * - puts the file at stage >0 as usual\n+\t\t\t * - also attempts to check out the file as\n+\t\t\t * 'file~side' where side is the sha1 of the commit\n+\t\t\t * the file came from, to avoid colliding with the\n+\t\t\t * directory\n+\t\t\t *\n+\t\t\t * But we have requested that files go to the index\n+\t\t\t * instead of the worktree, so by the time we get\n+\t\t\t * here, we have both stage>0 'file' from ordinary\n+\t\t\t * merging and a stage=0 'file~side' from the \"write\n+\t\t\t * all files to index\".\n+\t\t\t *\n+\t\t\t * We need to remove one of them. Currently we ditch\n+\t\t\t * the 'file' entry because it's easier to detect.\n+\t\t\t * This amounts to always renaming the file to make\n+\t\t\t * room for the directory.\n+\t\t\t *\n+\t\t\t * NEEDSWORK: Two options:\n+\t\t\t *\n+\t\t\t * - If the merge result kept the file, it would be\n+\t\t\t * better to rename the _directory_ to make room for\n+\t\t\t * the file, so that filenames match between the\n+\t\t\t * result and the re-merge.\n+\t\t\t *\n+\t\t\t * - Or we could avoid going through a tree, since the\n+\t\t\t * index can represent (though it's not \"legal\") a\n+\t\t\t * file/directory collision just fine.\n+\t\t\t */\n+\t\t} else {\n+\t\t\t/*\n+\t\t\t * Otherwise, there is room for a file entry\n+\t\t\t * at stage 0. It has fake-conflict content,\n+\t\t\t * but its mode is the same.\n+\t\t\t */\n+\n+\t\t\tassemble_conflict_entry(&content,\n+\t\t\t\t\t\tbranch1, branch2,\n+\t\t\t\t\t\tstage2, stage3);\n+\t\t\tif (write_sha1_file(content.buf, content.len,\n+\t\t\t\t\t typename(OBJ_BLOB), sha1))\n+\t\t\t\tdie(\"write_sha1_file failed\");\n+\t\t\tstrbuf_release(&content);\n+\n+\t\t\tnew_ce = xmalloc(cache_entry_size(ce->ce_namelen));\n+\t\t\tnew_ce->ce_mode = ce->ce_mode;\n+\t\t\tnew_ce->ce_flags = ce->ce_flags & ~CE_STAGEMASK;\n+\t\t\tnew_ce->ce_namelen = ce->ce_namelen;\n+\t\t\thashcpy(new_ce->sha1, sha1);\n+\t\t\tnew_ce->next = NULL;\n+\t\t\tmemcpy(new_ce->name, ce->name, ce->ce_namelen+1);\n+\t\t\tactive_cache[o++] = new_ce;\n+\t\t\tadd_name_hash(&the_index, new_ce);\n+\t\t}\n+\n+\t\tif (stage1)\n+\t\t\tremove_name_hash(&the_index, stage1);\n+\t\tif (stage2)\n+\t\t\tremove_name_hash(&the_index, stage2);\n+\t\tif (stage3)\n+\t\t\tremove_name_hash(&the_index, stage3);\n+\t\t/*\n+\t\t * Can't free stage[1-3] because they are still in the\n+\t\t * name hash, just marked deleted :-( So we leak them.\n+\t\t */\n+\t}\n+\n+\tactive_nr = o;\n+}\n+\n+/*\n+ * --remerge-diff doesn't currently handle entries that cannot be\n+ * turned into a stage0 conflicted-file format blob. So this routine\n+ * clears the corresponding entries from the index. This is\n+ * suboptimal; we should eventually handle them _somehow_.\n+*/\n+static void drop_non_stage0()\n+{\n+\tint o = 0, i = 0;\n+\n+\twhile (i < active_nr) {\n+\t\tstruct cache_entry *ce = active_cache[i];\n+\t\tconst char *name;\n+\n+\t\tif (!ce_stage(ce)) {\n+\t\t\tactive_cache[o++] = active_cache[i++];\n+\t\t\tcontinue;\n+\t\t}\n+\n+\t\tname = ce->name;\n+\n+\t\tprintf(\"Cannot handle stage %d entry '%s', skipping\\n\",\n+\t\t ce_stage(ce), name);\n+\t\ti++;\n+\n+\t\twhile (i < active_nr && !strcmp(name, active_cache[i]->name))\n+\t\t\tfree(active_cache[i++]);\n+\n+\t\tfree(ce);\n+\t}\n+\n+\tactive_nr = o;\n+}\n+\n+static int do_diff_remerge(struct rev_info *opt, struct commit *commit)\n+{\n+\tstruct commit_list *merge_bases;\n+\tstruct commit *result, *parent1, *parent2;\n+\tstruct merge_options o;\n+\tchar *branch1, *branch2;\n+\n+\t/*\n+\t * We show the log message early to avoid headaches later. In\n+\t * general we need to run this before printing anything in\n+\t * this routine.\n+\t */\n+\tif (opt->loginfo && !opt->no_commit_id) {\n+\t\tshow_log(opt);\n+\n+\t\tif (opt->verbose_header && opt->diffopt.output_format)\n+\t\t\tprintf(\"%s%c\", diff_line_prefix(&opt->diffopt),\n+\t\t\t opt->diffopt.line_termination);\n+\t}\n+\n+\tif (commit->parents->next->next) {\n+\t\tprintf(\"--remerge-diff not supported for octopus merges.\\n\");\n+\t\treturn !opt->loginfo;\n+\t}\n+\n+\tparent1 = commit->parents->item;\n+\tparent2 = commit->parents->next->item;\n+\tparse_commit(parent1);\n+\tparse_commit(parent2);\n+\tbranch1 = xstrdup(sha1_to_hex(parent1->object.sha1));\n+\tbranch2 = xstrdup(sha1_to_hex(parent2->object.sha1));\n+\n+\tmerge_bases = get_octopus_merge_bases(commit->parents);\n+\tinit_merge_options(&o);\n+\to.verbosity = -1;\n+\to.no_worktree = 1;\n+\to.conflicts_in_index = 1;\n+\to.use_ondisk_index = 0;\n+\to.branch1 = branch1;\n+\to.branch2 = branch2;\n+\tmerge_recursive(&o, parent1, parent2, merge_bases, &result);\n+\n+\tmake_asymmetric_conflict_entries(branch1, branch2);\n+\tdrop_non_stage0();\n+\n+\tfree(branch1);\n+\tfree(branch2);\n+\n+\tactive_cache_tree = cache_tree();\n+\tif (cache_tree_update(active_cache_tree,\n+\t\t\t (const struct cache_entry * const *)active_cache,\n+\t\t\t active_nr, WRITE_TREE_SILENT) < 0) {\n+\t\tprintf(\"BUG: merge conflicts not fully folded, cannot diff.\\n\");\n+\t\treturn !opt->loginfo;\n+\t}\n+\n+\tdiff_tree_sha1(active_cache_tree->sha1, commit->tree->object.sha1,\n+\t\t \"\", &opt->diffopt);\n+\tlog_tree_diff_flush(opt);\n+\n+\tcache_tree_free(&active_cache_tree);\n+\n+\treturn !opt->loginfo;\n+}\n+\n+/*\n * Show the diff of a commit.\n *\n * Return true if we printed any log info messages\n@@ -755,6 +1051,8 @@ static int log_tree_diff(struct rev_info *opt, struct commit *commit, struct log\n \t\t\treturn 0;\n \t\telse if (merge_diff_mode_is_any_combined(opt))\n \t\t\treturn do_diff_combined(opt, commit);\n+\t\telse if (opt->merge_diff_mode == MERGE_DIFF_REMERGE)\n+\t\t\treturn do_diff_remerge(opt, commit);\n \t\telse if (opt->first_parent_only) {\n \t\t\t/*\n \t\t\t * Generate merge log entry only for the first\ndiff --git a/merge-recursive.c b/merge-recursive.c\nindex b682812..1507a7a 100644\n--- a/merge-recursive.c\n+++ b/merge-recursive.c\n@@ -1947,7 +1947,7 @@ int merge_recursive(struct merge_options *o,\n \t}\n \n \tdiscard_cache();\n-\tif (!o->call_depth)\n+\tif (!o->call_depth && o->use_ondisk_index)\n \t\tread_cache();\n \n \to->ancestor = \"merged common ancestors\";\n@@ -2043,6 +2043,7 @@ void init_merge_options(struct merge_options *o)\n \to->diff_rename_limit = -1;\n \to->merge_rename_limit = -1;\n \to->renormalize = 0;\n+\to->use_ondisk_index = 1;\n \tgit_config(merge_recursive_config, o);\n \tif (getenv(\"GIT_MERGE_VERBOSITY\"))\n \t\to->verbosity =\ndiff --git a/merge-recursive.h b/merge-recursive.h\nindex 9b8e20b..d7466c7 100644\n--- a/merge-recursive.h\n+++ b/merge-recursive.h\n@@ -17,6 +17,7 @@ struct merge_options {\n \tunsigned renormalize : 1;\n \tunsigned no_worktree : 1; /* do not touch worktree */\n \tunsigned conflicts_in_index : 1; /* index will contain conflict hunks */\n+\tunsigned use_ondisk_index : 1; /* tree-level merge loads .git/index */\n \tlong xdl_opts;\n \tint verbosity;\n \tint diff_rename_limit;\ndiff --git a/revision.c b/revision.c\nindex 127b75a..956a527 100644\n--- a/revision.c\n+++ b/revision.c\n@@ -1811,6 +1811,8 @@ static int handle_revision_opt(struct rev_info *revs, int argc, const char **arg\n \t\trevs->merge_diff_mode = MERGE_DIFF_COMBINED;\n \t} else if (!strcmp(arg, \"--cc\")) {\n \t\trevs->merge_diff_mode = MERGE_DIFF_COMBINED_CONDENSED;\n+\t} else if (!strcmp(arg, \"--remerge-diff\")) {\n+\t\trevs->merge_diff_mode = MERGE_DIFF_REMERGE;\n \t} else if (!strcmp(arg, \"-v\")) {\n \t\trevs->verbose_header = 1;\n \t} else if (!strcmp(arg, \"--pretty\")) {\ndiff --git a/revision.h b/revision.h\nindex 0847902..10a2992 100644\n--- a/revision.h\n+++ b/revision.h\n@@ -58,7 +58,9 @@ enum merge_diff_mode {\n \t/* combined format (-c) */\n \tMERGE_DIFF_COMBINED,\n \t/* combined-condensed format (-cc) */\n-\tMERGE_DIFF_COMBINED_CONDENSED\n+\tMERGE_DIFF_COMBINED_CONDENSED,\n+\t/* --remerge-diff */\n+\tMERGE_DIFF_REMERGE\n };\n \n struct rev_info {\ndiff --git a/t/t4213-log-remerge-diff.sh b/t/t4213-log-remerge-diff.sh\nnew file mode 100755\nindex 0000000..36ef17a\n--- /dev/null\n+++ b/t/t4213-log-remerge-diff.sh\n@@ -0,0 +1,222 @@\n+#!/bin/sh\n+\n+test_description='test log --remerge-diff'\n+. ./test-lib.sh\n+\n+# A -----------------+----\n+# | \\ \\ \\ | \\\n+# | C \\ \\ | |\n+# B |\\ \\ | | |\n+# | | | D U dir file\n+# |\\ | |__|__ | | \\ /|\n+# | X |_ | \\ | | X |\n+# |/ \\/ \\| \\ | | / \\|\n+# M1 M2 M3 M4 M5 M6\n+# ^ ^ ^ ^ ^ ^\n+# | | | | | filedir\n+# | | | | dirfile\n+# | | dm unrelated\n+# | evil\n+# benign\n+#\n+#\n+# M1 has a \"benign\" conflict\n+# M2 has an \"evil\" conflict: it ignores the changes in D\n+# M3 has a delete/modify conflict, resolved in favor of a modification\n+# M4 is a merge of an unrelated change, without conflicts\n+# M5 has a file/directory conflict, resolved in favor of the directory\n+# M6 has a file/directory conflict, resolved in favor of the file\n+\n+test_expect_success 'setup' '\n+\ttest_commit A file original &&\n+\ttest_commit B file change &&\n+\tgit checkout -b side A &&\n+\ttest_commit C file side &&\n+\tgit checkout -b delete A &&\n+\tgit rm file &&\n+\ttest_commit D &&\n+\tgit checkout -b benign master &&\n+\ttest_must_fail git merge C &&\n+\ttest_commit M1 file merged &&\n+\tgit checkout -b evil B &&\n+\ttest_must_fail git merge C &&\n+\ttest_commit M2 file change &&\n+\tgit checkout -b dm C &&\n+\ttest_must_fail git merge D &&\n+\ttest_commit M3 file resolved &&\n+\tgit checkout -b unrelated A &&\n+\ttest_commit unrelated_file &&\n+\tgit merge C &&\n+\ttest_tick &&\n+\tgit tag M4 &&\n+\tgit checkout -b dir A &&\n+\tmkdir sub &&\n+\ttest_commit dir sub/file &&\n+\tgit checkout -b file A &&\n+\ttest_commit file sub &&\n+\tgit checkout -b dirfile tags/dir &&\n+\ttest_must_fail git merge tags/file &&\n+\tgit rm --cached sub &&\n+\ttest_commit M5 sub/file resolved &&\n+\tgit checkout -b filedir tags/file &&\n+\ttest_must_fail git merge tags/dir &&\n+\tgit rm --cached sub/file &&\n+\trm -rf sub &&\n+\ttest_commit M6 sub resolved &&\n+\tgit branch -D master side delete dir file\n+'\n+\n+test_expect_success 'unrelated merge: without conflicts' '\n+\tgit log -p --cc unrelated >expected &&\n+\tgit log -p --remerge-diff unrelated >actual &&\n+\ttest_cmp expected actual\n+'\n+\n+clean_output () {\n+\tgit name-rev --name-only --stdin |\n+\t# strip away bits that aren't treated by the above\n+\tsed -e 's/^\\(index\\|Merge:\\|Date:\\).*/\\1/'\n+}\n+\n+cat >expected <\n+Date:\n+\n+ M1\n+\n+diff --git a/file b/file\n+index\n+--- a/file\n++++ b/file\n+@@ -1,5 +1 @@\n+-<<<<<<< tags/B\n+-change\n+-=======\n+-side\n+->>>>>>> tags/C\n++merged\n+EOF\n+\n+test_expect_success 'benign merge: conflicts resolved' '\n+\tgit log -1 -p --remerge-diff benign >output &&\n+\tclean_output actual &&\n+\ttest_cmp expected actual\n+'\n+\n+cat >expected <\n+Date:\n+\n+ M2\n+\n+diff --git a/file b/file\n+index\n+--- a/file\n++++ b/file\n+@@ -1,5 +1 @@\n+-<<<<<<< tags/B\n+ change\n+-=======\n+-side\n+->>>>>>> tags/C\n+EOF\n+\n+test_expect_success 'evil merge: changes ignored' '\n+\tgit log -1 --remerge-diff -p evil >output &&\n+\tclean_output actual &&\n+\ttest_cmp expected actual\n+'\n+\n+cat >expected <\n+Date:\n+\n+ M3\n+\n+diff --git a/file b/file\n+index\n+--- a/file\n++++ b/file\n+@@ -1,4 +1 @@\n+-<<<<<<< tags/C\n+-side\n+-=======\n+->>>>>>> tags/D\n++resolved\n+EOF\n+\n+test_expect_success 'delete/modify conflict' '\n+\tgit log -1 --remerge-diff -p dm >output &&\n+\tclean_output actual &&\n+\ttest_cmp expected actual\n+'\n+\n+cat >expected <\n+Date:\n+\n+ M5\n+\n+diff --git a/sub/file b/sub/file\n+index\n+--- a/sub/file\n++++ b/sub/file\n+@@ -1 +1 @@\n+-dir\n++resolved\n+diff --git a/sub~tags/file b/sub~tags/file\n+deleted file mode 100644\n+index\n+--- a/sub~tags/file\n++++ /dev/null\n+@@ -1 +0,0 @@\n+-file\n+EOF\n+\n+test_expect_success 'file/directory conflict resulting in directory' '\n+\tgit log -1 --remerge-diff -p dirfile >output &&\n+\tclean_output actual &&\n+\ttest_cmp expected actual\n+'\n+\n+# This is wishful thinking, see the NEEDSWORK in\n+# make_asymmetric_conflict_entries().\n+cat >expected <\n+Date:\n+\n+ M6\n+\n+diff --git a/sub b/sub\n+index\n+--- a/sub\n++++ b/sub\n+@@ -1 +1 @@\n+-file\n++resolved\n+diff --git a/sub/file b/sub/file\n+deleted file mode 100644\n+index\n+--- a/sub/file\n++++ /dev/null\n+@@ -1 +0,0 @@\n+-dir\n+EOF\n+\n+test_expect_failure 'file/directory conflict resulting in file' '\n+\tgit log -1 --remerge-diff -p filedir >output &&\n+\tclean_output actual &&\n+\ttest_cmp expected actual\n+'\n+\n+test_done\n-- \n1.9.0.313.g3d0a325\n"},{"id":"235200","messageId":"CAPig+cSWhbunMtQ8=sXqwR7Ps+c0DY2SqVKpu_draaieSJrEPA@mail.gmail.com","threadId":"35934","inReplyTo":"2e56b258bca6cf83c322da4be85c42c7b54f6a3e.1393059605.git.tr@thomasrast.ch","subject":"Re: [PATCH v2 3/8] merge-recursive: -Xindex-only to leave worktree unchanged","fromName":"Eric Sunshine","fromEmail":"sunshine@sunshineco.com","sentAt":"2014-02-23T09:07:40Z","receivedAt":"2014-02-23T09:07:40Z","isPatch":true,"sender":{"key":"sunshine@sunshineco.com","avatar":"https://avatars.githubusercontent.com/u/163641?v=4"},"body":"On Sat, Feb 22, 2014 at 4:17 AM, Thomas Rast wrote:\n> Using the new no_worktree flag from the previous commit, we can teach\n> merge-recursive to leave the worktree untouched. Expose this with a\n> new strategy option so that scripts can use it.\n>\n> Signed-off-by: Junio C Hamano \n> ---\n> diff --git a/Documentation/merge-strategies.txt b/Documentation/merge-strategies.txt\n> index fb6e593..2934e99 100644\n> --- a/Documentation/merge-strategies.txt\n> +++ b/Documentation/merge-strategies.txt\n> @@ -92,6 +92,10 @@ subtree[=];;\n> is prefixed (or stripped from the beginning) to make the shape of\n> two trees to match.\n>\n> +index-only;;\n\ns/;;/::/\n\n> + Write the merge result only to the index; do not touch the\n> + worktree.\n> +\n> octopus::\n> This resolves cases with more than two heads, but refuses to do\n> a complex merge that needs manual resolution. It is\n"},{"id":"235201","messageId":"CAPig+cRRvEUDivU=ySx7wY9qYsCYSvn68aY8s_jfX=Z=jh=Ptg@mail.gmail.com","threadId":"35934","inReplyTo":"38527c9f6ae31ad39d8f3dddfe5252a3527629ed.1393059605.git.tr@thomasrast.ch","subject":"Re: [PATCH v2 7/8] name-hash: allow dir hashing even when !ignore_case","fromName":"Eric Sunshine","fromEmail":"sunshine@sunshineco.com","sentAt":"2014-02-23T09:19:16Z","receivedAt":"2014-02-23T09:19:16Z","isPatch":true,"sender":{"key":"sunshine@sunshineco.com","avatar":"https://avatars.githubusercontent.com/u/163641?v=4"},"body":"On Sat, Feb 22, 2014 at 4:17 AM, Thomas Rast wrote:\n> The directory hash (for fast checks if the index already has a\n> directory) was only used in ignore_case mode and so depended on that\n> flag.\n>\n> Make it generally available on request.\n>\n> Signed-off-by: Thomas Rast \n> ---\n> diff --git a/name-hash.c b/name-hash.c\n> index e5b6e1a..c8953be 100644\n> --- a/name-hash.c\n> +++ b/name-hash.c\n> @@ -141,16 +141,19 @@ static void hash_index_entry(struct index_state *istate, struct cache_entry *ce)\n> *pos = ce;\n> }\n>\n> - if (ignore_case && !(ce->ce_flags & CE_UNHASHED))\n> + if (istate->has_dir_hash && !(ce->ce_flags & CE_UNHASHED))\n> add_dir_entry(istate, ce);\n> }\n>\n> -static void lazy_init_name_hash(struct index_state *istate)\n> +void init_name_hash(struct index_state *istate, int force_dir_hash)\n> {\n> int nr;\n>\n> if (istate->name_hash_initialized)\n> return;\n> +\n> + istate->has_dir_hash = force_dir_hash || ignore_case;\n\nThis is getting a bit convoluted. Refactoring lazy_init_name_hash()\ninto two functions would eliminate the complexity. For instance:\n\n void init_name_hash(struct index_state *istate)\n {\n ...pure initialization code...\n }\n\n static void init_name_hash_if_needed(struct index_state *istate)\n {\n if (ignore_case && !istate->name_hash_initialized)\n init_name_hash(istate);\n }\n\nThe two existing callers of lazy_init_name_hash() in name-hash.c,\nwhich rely upon the lazy/ignore-case logic, would invoke the static\ninit_name_hash_if_needed().\n\nThe new caller in patch 8/8, which knows explicitly if and when it\nwants the hash initialized can invoke the public init_name_hash().\n\n> if (istate->cache_nr)\n> preallocate_hash(&istate->name_hash, istate->cache_nr);\n> for (nr = 0; nr < istate->cache_nr; nr++)\n> @@ -161,7 +164,7 @@ static void lazy_init_name_hash(struct index_state *istate)\n> void add_name_hash(struct index_state *istate, struct cache_entry *ce)\n> {\n> /* if already hashed, add reference to directory entries */\n> - if (ignore_case && (ce->ce_flags & CE_STATE_MASK) == CE_STATE_MASK)\n> + if (istate->has_dir_hash && (ce->ce_flags & CE_STATE_MASK) == CE_STATE_MASK)\n> add_dir_entry(istate, ce);\n>\n> ce->ce_flags &= ~CE_UNHASHED;\n> @@ -181,7 +184,7 @@ void add_name_hash(struct index_state *istate, struct cache_entry *ce)\n> void remove_name_hash(struct index_state *istate, struct cache_entry *ce)\n> {\n> /* if already hashed, release reference to directory entries */\n> - if (ignore_case && (ce->ce_flags & CE_STATE_MASK) == CE_HASHED)\n> + if (istate->has_dir_hash && (ce->ce_flags & CE_STATE_MASK) == CE_HASHED)\n> remove_dir_entry(istate, ce);\n>\n> ce->ce_flags |= CE_UNHASHED;\n> @@ -228,7 +231,7 @@ struct cache_entry *index_dir_exists(struct index_state *istate, const char *nam\n> struct cache_entry *ce;\n> struct dir_entry *dir;\n>\n> - lazy_init_name_hash(istate);\n> + init_name_hash(istate, 0);\n> dir = find_dir_entry(istate, name, namelen);\n> if (dir && dir->nr)\n> return dir->ce;\n> @@ -250,7 +253,7 @@ struct cache_entry *index_file_exists(struct index_state *istate, const char *na\n> unsigned int hash = hash_name(name, namelen);\n> struct cache_entry *ce;\n>\n> - lazy_init_name_hash(istate);\n> + init_name_hash(istate, 0);\n> ce = lookup_hash(hash, &istate->name_hash);\n>\n> while (ce) {\n> @@ -286,9 +289,11 @@ void free_name_hash(struct index_state *istate)\n> if (!istate->name_hash_initialized)\n> return;\n> istate->name_hash_initialized = 0;\n> - if (ignore_case)\n> + if (istate->has_dir_hash) {\n> /* free directory entries */\n> for_each_hash(&istate->dir_hash, free_dir_entry, NULL);\n> + istate->has_dir_hash = 0;\n> + }\n>\n> free_hash(&istate->name_hash);\n> free_hash(&istate->dir_hash);\n> --\n> 1.9.0.313.g3d0a325\n"},{"id":"235203","messageId":"87vbw6qbxg.fsf@thomasrast.ch","threadId":"35934","inReplyTo":"CAPig+cSWhbunMtQ8=sXqwR7Ps+c0DY2SqVKpu_draaieSJrEPA@mail.gmail.com","subject":"Re: [PATCH v2 3/8] merge-recursive: -Xindex-only to leave worktree unchanged","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-02-23T11:57:15Z","receivedAt":"2014-02-23T11:57:15Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"Eric Sunshine writes:\n\n> On Sat, Feb 22, 2014 at 4:17 AM, Thomas Rast wrote:\n>> Using the new no_worktree flag from the previous commit, we can teach\n>> merge-recursive to leave the worktree untouched. Expose this with a\n>> new strategy option so that scripts can use it.\n>>\n>> Signed-off-by: Junio C Hamano \n>> ---\n>> diff --git a/Documentation/merge-strategies.txt b/Documentation/merge-strategies.txt\n>> index fb6e593..2934e99 100644\n>> --- a/Documentation/merge-strategies.txt\n>> +++ b/Documentation/merge-strategies.txt\n>> @@ -92,6 +92,10 @@ subtree[=];;\n>> is prefixed (or stripped from the beginning) to make the shape of\n>> two trees to match.\n>>\n>> +index-only;;\n>\n> s/;;/::/\n\nI think ;; is actually correct: this continues the sub-list of options\nto the recursive strategy. The :: level lists the available strategies.\n\n>> + Write the merge result only to the index; do not touch the\n>> + worktree.\n>> +\n>> octopus::\n>> This resolves cases with more than two heads, but refuses to do\n>> a complex merge that needs manual resolution. It is\n> --\n> To unsubscribe from this list: send the line \"unsubscribe git\" in\n> the body of a message to majordomo@vger.kernel.org\n> More majordomo info at http://vger.kernel.org/majordomo-info.html\n\n-- \nThomas Rast\ntr@thomasrast.ch\n"},{"id":"235206","messageId":"CAPig+cQt8R81vc777fvBi_XECoP9Mn=MYDwTX2auUpNRA2z8XQ@mail.gmail.com","threadId":"35934","inReplyTo":"87vbw6qbxg.fsf@thomasrast.ch","subject":"Re: [PATCH v2 3/8] merge-recursive: -Xindex-only to leave worktree unchanged","fromName":"Eric Sunshine","fromEmail":"sunshine@sunshineco.com","sentAt":"2014-02-23T18:42:29Z","receivedAt":"2014-02-23T18:42:29Z","isPatch":true,"sender":{"key":"sunshine@sunshineco.com","avatar":"https://avatars.githubusercontent.com/u/163641?v=4"},"body":"On Sun, Feb 23, 2014 at 6:57 AM, Thomas Rast wrote:\n> Eric Sunshine writes:\n>\n>> On Sat, Feb 22, 2014 at 4:17 AM, Thomas Rast wrote:\n>>> Using the new no_worktree flag from the previous commit, we can teach\n>>> merge-recursive to leave the worktree untouched. Expose this with a\n>>> new strategy option so that scripts can use it.\n>>>\n>>> Signed-off-by: Junio C Hamano \n>>> ---\n>>> diff --git a/Documentation/merge-strategies.txt b/Documentation/merge-strategies.txt\n>>> index fb6e593..2934e99 100644\n>>> --- a/Documentation/merge-strategies.txt\n>>> +++ b/Documentation/merge-strategies.txt\n>>> @@ -92,6 +92,10 @@ subtree[=];;\n>>> is prefixed (or stripped from the beginning) to make the shape of\n>>> two trees to match.\n>>>\n>>> +index-only;;\n>>\n>> s/;;/::/\n>\n> I think ;; is actually correct: this continues the sub-list of options\n> to the recursive strategy. The :: level lists the available strategies.\n\nMake sense. Thanks for the explanation.\n\n>>> + Write the merge result only to the index; do not touch the\n>>> + worktree.\n>>> +\n>>> octopus::\n>>> This resolves cases with more than two heads, but refuses to do\n>>> a complex merge that needs manual resolution. It is\n>> --\n>> To unsubscribe from this list: send the line \"unsubscribe git\" in\n>> the body of a message to majordomo@vger.kernel.org\n>> More majordomo info at http://vger.kernel.org/majordomo-info.html\n>\n> --\n> Thomas Rast\n> tr@thomasrast.ch\n"},{"id":"235433","messageId":"xmqqbnxt1j7l.fsf@gitster.dls.corp.google.com","threadId":"35934","inReplyTo":"75c29215c6a61fe1dc3f088f0fcd9acfa54f24fa.1393059605.git.tr@thomasrast.ch","subject":"Re: [PATCH v2 8/8] log --remerge-diff: show what the conflict resolution changed","fromName":"Junio C Hamano","fromEmail":"gitster@pobox.com","sentAt":"2014-02-27T00:40:30Z","receivedAt":"2014-02-27T00:40:30Z","isPatch":true,"sender":{"key":"gitster@pobox.com","avatar":"https://avatars.githubusercontent.com/u/54884?v=4"},"body":"Thomas Rast writes:\n\n> diff --git a/log-tree.c b/log-tree.c\n> index 30b3063..9b831e9 100644\n> --- a/log-tree.c\n> +++ b/log-tree.c\n> @@ -11,6 +11,8 @@\n> #include \"gpg-interface.h\"\n> #include \"sequencer.h\"\n> #include \"line-log.h\"\n> +#include \"cache-tree.h\"\n> +#include \"merge-recursive.h\"\n> \n> struct decoration name_decoration = { \"object names\" };\n> \n> @@ -723,6 +725,300 @@ static int do_diff_combined(struct rev_info *opt, struct commit *commit)\n> }\n> \n> /*\n> + * Helpers for make_asymmetric_conflict_entries() below.\n> + */\n> +static char *load_cache_entry_blob(struct cache_entry *entry,\n> +\t\t\t\t unsigned long *size)\n> +{\n\nI briefly wondered if this helper need to know about contents\nconversions (e.g. smudge/clean or crlf), but not doing any of that\n*is* the right thing to do. IOW, I agree with what this part of the\npatch does.\n\nBut it feels, at least to me, that this helper function ...\n\n> +static void strbuf_append_cache_entry_blob(struct strbuf *sb,\n> +\t\t\t\t\t struct cache_entry *entry)\n> +{\n\n... and this one are overly specific. Why should they know about\n(and limit themselves to operate on) cache-entry type? Isn't it too\nmuch to ask for the caller to say \"entry->sha1\" instead of \"entry\"?\n\nI do not have an issue with a \"load_blob()\" helper that makes sure\nwhat it reads is a blob, though, of course.\n\n> +static void assemble_conflict_entry(struct strbuf *sb,\n> +\t\t\t\t const char *branch1,\n> +\t\t\t\t const char *branch2,\n> +\t\t\t\t struct cache_entry *entry1,\n> +\t\t\t\t struct cache_entry *entry2)\n> +{\n> +\tstrbuf_addf(sb, \"<<<<<<< %s\\n\", branch1);\n> +\tstrbuf_append_cache_entry_blob(sb, entry1);\n> +\tstrbuf_addstr(sb, \"=======\\n\");\n> +\tstrbuf_append_cache_entry_blob(sb, entry2);\n> +\tstrbuf_addf(sb, \">>>>>>> %s\\n\", branch2);\n> +}\n> +\n> +/*\n> + * For --remerge-diff, we need conflicted (<<<<<<< ... >>>>>>>)\n> + * representations of as many conflicts as possible. Default conflict\n> + * generation only applies to files that have all three stages.\n> + *\n> + * This function generates conflict hunk representations for files\n> + * that have only one of stage 2 or 3. The corresponding side in the\n> + * conflict hunk format will be empty. A stage 1, if any, will be\n> + * dropped in the process.\n> + */\n> +static void make_asymmetric_conflict_entries(const char *branch1,\n> +\t\t\t\t\t const char *branch2)\n> +{\n\nI should comment on this one in a separate message after I read it\nover once again.\n\n> +}\n> +\n> +/*\n> + * --remerge-diff doesn't currently handle entries that cannot be\n> + * turned into a stage0 conflicted-file format blob. So this routine\n> + * clears the corresponding entries from the index. This is\n> + * suboptimal; we should eventually handle them _somehow_.\n> +*/\n> +static void drop_non_stage0()\n\n\"static void drop_non_stage0(void)\"\n"},{"id":"235525","messageId":"xmqqk3cgw3b4.fsf@gitster.dls.corp.google.com","threadId":"35934","inReplyTo":"38527c9f6ae31ad39d8f3dddfe5252a3527629ed.1393059605.git.tr@thomasrast.ch","subject":"Re: [PATCH v2 7/8] name-hash: allow dir hashing even when !ignore_case","fromName":"Junio C Hamano","fromEmail":"gitster@pobox.com","sentAt":"2014-02-27T23:20:31Z","receivedAt":"2014-02-27T23:20:31Z","isPatch":true,"sender":{"key":"gitster@pobox.com","avatar":"https://avatars.githubusercontent.com/u/54884?v=4"},"body":"Thomas Rast writes:\n\n> The directory hash (for fast checks if the index already has a\n> directory) was only used in ignore_case mode and so depended on that\n> flag.\n>\n> Make it generally available on request.\n>\n> Signed-off-by: Thomas Rast \n> ---\n\nI somehow had an impression that we were getting rid of these two\nhashes and merging them into one, but I do not see any such change\nbetween 'master..pu'. Perhaps I am confused with some other topic.\n"},{"id":"248980","messageId":"87ppf863rf.fsf@thomasrast.ch","threadId":"35934","inReplyTo":"CAPig+cRRvEUDivU=ySx7wY9qYsCYSvn68aY8s_jfX=Z=jh=Ptg@mail.gmail.com","subject":"Re: [PATCH v2 7/8] name-hash: allow dir hashing even when !ignore_case","fromName":"Thomas Rast","fromEmail":"tr@thomasrast.ch","sentAt":"2014-09-06T17:46:28Z","receivedAt":"2014-09-06T17:46:28Z","isPatch":true,"sender":{"key":"tr@thomasrast.ch","avatar":"https://avatars.githubusercontent.com/u/153510?v=4"},"body":"Eric Sunshine writes:\n\n> On Sat, Feb 22, 2014 at 4:17 AM, Thomas Rast wrote:\n>> -static void lazy_init_name_hash(struct index_state *istate)\n>> +void init_name_hash(struct index_state *istate, int force_dir_hash)\n>> {\n>> int nr;\n>>\n>> if (istate->name_hash_initialized)\n>> return;\n>> +\n>> + istate->has_dir_hash = force_dir_hash || ignore_case;\n>\n> This is getting a bit convoluted. Refactoring lazy_init_name_hash()\n> into two functions would eliminate the complexity. For instance:\n>\n> void init_name_hash(struct index_state *istate)\n> {\n> ...pure initialization code...\n> }\n>\n> static void init_name_hash_if_needed(struct index_state *istate)\n> {\n> if (ignore_case && !istate->name_hash_initialized)\n> init_name_hash(istate);\n> }\n>\n> The two existing callers of lazy_init_name_hash() in name-hash.c,\n> which rely upon the lazy/ignore-case logic, would invoke the static\n> init_name_hash_if_needed().\n>\n> The new caller in patch 8/8, which knows explicitly if and when it\n> wants the hash initialized can invoke the public init_name_hash().\n\nThat unfortunately doesn't really help because the conditional part only\naffects the dir hash. Callers request the name hash for other reasons,\nbut we only do the dir hashing when ignore_case is in effect.\n\nSo it's not simply about overriding lazy initialization, but about\nchoosing to trigger a specific subpart of the initialization.\n\n-- \nThomas Rast\ntr@thomasrast.ch\n"}]}