3 # Copyright (c) 2005 Junio C Hamano
6 test_description='Three way merge with read-tree -m
8 This test tries three-way merge with read-tree -m
10 There is one ancestor (called O for Original) and two branches A
11 and B derived from it. We want to do a 3-way merge between A and
12 B, using O as the common ancestor.
16 Decisions are made by comparing contents of O, A and B pathname
17 by pathname. The result is determined by the following guiding
20 - If only A does something to it and B does not touch it, take
23 - If only B does something to it and A does not touch it, take
26 - If both A and B does something but in the same way, take
29 - If A and B does something but different things, we need a
32 - We cannot do anything about the following cases:
34 * O does not have it. A and B both must be adding to the
35 same path independently.
37 * A deletes it. B must be modifying.
39 - Otherwise, A and B are modifying. Run 3-way merge.
41 First, the case matrix.
43 - Vertical axis is for A'\''s actions.
44 - Horizontal axis is for B'\''s actions.
46 .----------------------------------------------------------------.
47 | A B | No Action | Delete | Modify | Add |
48 |------------+------------+------------+------------+------------|
50 | | select O | delete | select B | select B |
52 |------------+------------+------------+------------+------------|
53 | Delete | | | ********** | can |
54 | | delete | delete | merge | not |
56 |------------+------------+------------+------------+------------|
57 | Modify | | ********** | ?????????? | can |
58 | | select A | merge | select A=B | not |
59 | | | | merge | happen |
60 |------------+------------+------------+------------+------------|
61 | Add | | can | can | ?????????? |
62 | | select A | not | not | select A=B |
63 | | | happen | happen | merge |
64 .----------------------------------------------------------------.
68 SS: a special case of MM, where A and B makes the same modification.
69 LL: a special case of AA, where A and B creates the same file.
70 TT: a special case of MM, where A and B makes mergeable changes.
71 DF: a special case, where A makes a directory and B makes a file.
75 . "$TEST_DIRECTORY"/lib-read-tree.sh
76 . "$TEST_DIRECTORY"/lib-read-tree-m-3way.sh
78 ################################################################
79 # Trivial "majority when 3 stages exist" merge plus #2ALT, #3ALT
80 # and #5ALT trivial merges.
131 git ls-files --stage | sed -e 's/ '"$OID_REGEX"' / X /' >current &&
132 test_cmp expected current
135 # This is done on an empty work directory, which is the normal
136 # merge person behaviour.
137 test_expect_success '3-way merge with git read-tree -m, empty cache' '
138 rm -fr [NDMALTS][NDMALTSF] Z &&
140 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
144 # This starts out with the first head, which is the normal
145 # patch submitter behaviour.
146 test_expect_success '3-way merge with git read-tree -m, match H' '
147 rm -fr [NDMALTS][NDMALTSF] Z &&
149 read_tree_must_succeed $tree_A &&
150 git checkout-index -f -u -a &&
151 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
155 : <<\END_OF_CASE_TABLE
157 We have so far tested only empty index and clean-and-matching-A index
158 case which are trivial. Make sure index requirements are also
161 "git read-tree -m O A B"
163 O A B result index requirements
164 -------------------------------------------------------------------
165 1 missing missing missing - must not exist.
166 ------------------------------------------------------------------
167 2 missing missing exists take B* must match B, if exists.
168 ------------------------------------------------------------------
169 3 missing exists missing take A* must match A, if exists.
170 ------------------------------------------------------------------
171 4 missing exists A!=B no merge must match A and be
172 up-to-date, if exists.
173 ------------------------------------------------------------------
174 5 missing exists A==B take A must match A, if exists.
175 ------------------------------------------------------------------
176 6 exists missing missing remove must not exist.
177 ------------------------------------------------------------------
178 7 exists missing O!=B no merge must not exist.
179 ------------------------------------------------------------------
180 8 exists missing O==B remove must not exist.
181 ------------------------------------------------------------------
182 9 exists O!=A missing no merge must match A and be
183 up-to-date, if exists.
184 ------------------------------------------------------------------
185 10 exists O==A missing no merge must match A
186 ------------------------------------------------------------------
187 11 exists O!=A O!=B no merge must match A and be
188 A!=B up-to-date, if exists.
189 ------------------------------------------------------------------
190 12 exists O!=A O!=B take A must match A, if exists.
192 ------------------------------------------------------------------
193 13 exists O!=A O==B take A must match A, if exists.
194 ------------------------------------------------------------------
195 14 exists O==A O!=B take B if exists, must either (1)
196 match A and be up-to-date,
198 ------------------------------------------------------------------
199 15 exists O==A O==B take B must match A if exists.
200 ------------------------------------------------------------------
201 16 exists O==A O==B barf must match A if exists.
202 *multi* in one in another
203 -------------------------------------------------------------------
205 Note: we need to be careful in case 2 and 3. The tree A may contain
206 DF (file) when tree B require DF to be a directory by having DF/DF
211 test_expect_success '1 - must not have an entry not in A.' '
212 rm -f .git/index XX &&
214 git update-index --add XX &&
215 read_tree_must_fail -m $tree_O $tree_A $tree_B
218 test_expect_success '2 - must match B in !O && !A && B case.' '
219 rm -f .git/index NA &&
221 git update-index --add NA &&
222 read_tree_must_succeed -m $tree_O $tree_A $tree_B
225 test_expect_success '2 - matching B alone is OK in !O && !A && B case.' '
226 rm -f .git/index NA &&
228 git update-index --add NA &&
230 read_tree_must_succeed -m $tree_O $tree_A $tree_B
233 test_expect_success '3 - must match A in !O && A && !B case.' '
234 rm -f .git/index AN &&
236 git update-index --add AN &&
237 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
241 test_expect_success '3 - matching A alone is OK in !O && A && !B case.' '
242 rm -f .git/index AN &&
244 git update-index --add AN &&
246 read_tree_must_succeed -m $tree_O $tree_A $tree_B
249 test_expect_success '3 (fail) - must match A in !O && A && !B case.' '
250 rm -f .git/index AN &&
253 git update-index --add AN &&
254 read_tree_must_fail -m $tree_O $tree_A $tree_B
257 test_expect_success '4 - must match and be up-to-date in !O && A && B && A!=B case.' '
258 rm -f .git/index AA &&
260 git update-index --add AA &&
261 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
265 test_expect_success '4 (fail) - must match and be up-to-date in !O && A && B && A!=B case.' '
266 rm -f .git/index AA &&
268 git update-index --add AA &&
270 read_tree_must_fail -m $tree_O $tree_A $tree_B
273 test_expect_success '4 (fail) - must match and be up-to-date in !O && A && B && A!=B case.' '
274 rm -f .git/index AA &&
277 git update-index --add AA &&
278 read_tree_must_fail -m $tree_O $tree_A $tree_B
281 test_expect_success '5 - must match in !O && A && B && A==B case.' '
282 rm -f .git/index LL &&
284 git update-index --add LL &&
285 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
289 test_expect_success '5 - must match in !O && A && B && A==B case.' '
290 rm -f .git/index LL &&
292 git update-index --add LL &&
294 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
298 test_expect_success '5 (fail) - must match A in !O && A && B && A==B case.' '
299 rm -f .git/index LL &&
302 git update-index --add LL &&
303 read_tree_must_fail -m $tree_O $tree_A $tree_B
306 test_expect_success '6 - must not exist in O && !A && !B case' '
307 rm -f .git/index DD &&
309 git update-index --add DD &&
310 read_tree_must_fail -m $tree_O $tree_A $tree_B
313 test_expect_success '7 - must not exist in O && !A && B && O!=B case' '
314 rm -f .git/index DM &&
316 git update-index --add DM &&
317 read_tree_must_fail -m $tree_O $tree_A $tree_B
320 test_expect_success '8 - must not exist in O && !A && B && O==B case' '
321 rm -f .git/index DN &&
323 git update-index --add DN &&
324 read_tree_must_fail -m $tree_O $tree_A $tree_B
327 test_expect_success '9 - must match and be up-to-date in O && A && !B && O!=A case' '
328 rm -f .git/index MD &&
330 git update-index --add MD &&
331 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
335 test_expect_success '9 (fail) - must match and be up-to-date in O && A && !B && O!=A case' '
336 rm -f .git/index MD &&
338 git update-index --add MD &&
340 read_tree_must_fail -m $tree_O $tree_A $tree_B
343 test_expect_success '9 (fail) - must match and be up-to-date in O && A && !B && O!=A case' '
344 rm -f .git/index MD &&
347 git update-index --add MD &&
348 read_tree_must_fail -m $tree_O $tree_A $tree_B
351 test_expect_success '10 - must match and be up-to-date in O && A && !B && O==A case' '
352 rm -f .git/index ND &&
354 git update-index --add ND &&
355 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
359 test_expect_success '10 (fail) - must match and be up-to-date in O && A && !B && O==A case' '
360 rm -f .git/index ND &&
362 git update-index --add ND &&
364 read_tree_must_fail -m $tree_O $tree_A $tree_B
367 test_expect_success '10 (fail) - must match and be up-to-date in O && A && !B && O==A case' '
368 rm -f .git/index ND &&
371 git update-index --add ND &&
372 read_tree_must_fail -m $tree_O $tree_A $tree_B
375 test_expect_success '11 - must match and be up-to-date in O && A && B && O!=A && O!=B && A!=B case' '
376 rm -f .git/index MM &&
378 git update-index --add MM &&
379 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
383 test_expect_success '11 (fail) - must match and be up-to-date in O && A && B && O!=A && O!=B && A!=B case' '
384 rm -f .git/index MM &&
386 git update-index --add MM &&
388 read_tree_must_fail -m $tree_O $tree_A $tree_B
391 test_expect_success '11 (fail) - must match and be up-to-date in O && A && B && O!=A && O!=B && A!=B case' '
392 rm -f .git/index MM &&
395 git update-index --add MM &&
396 read_tree_must_fail -m $tree_O $tree_A $tree_B
399 test_expect_success '12 - must match A in O && A && B && O!=A && A==B case' '
400 rm -f .git/index SS &&
402 git update-index --add SS &&
403 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
407 test_expect_success '12 - must match A in O && A && B && O!=A && A==B case' '
408 rm -f .git/index SS &&
410 git update-index --add SS &&
412 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
416 test_expect_success '12 (fail) - must match A in O && A && B && O!=A && A==B case' '
417 rm -f .git/index SS &&
420 git update-index --add SS &&
421 read_tree_must_fail -m $tree_O $tree_A $tree_B
424 test_expect_success '13 - must match A in O && A && B && O!=A && O==B case' '
425 rm -f .git/index MN &&
427 git update-index --add MN &&
428 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
432 test_expect_success '13 - must match A in O && A && B && O!=A && O==B case' '
433 rm -f .git/index MN &&
435 git update-index --add MN &&
437 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
441 test_expect_success '14 - must match and be up-to-date in O && A && B && O==A && O!=B case' '
442 rm -f .git/index NM &&
444 git update-index --add NM &&
445 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
449 test_expect_success '14 - may match B in O && A && B && O==A && O!=B case' '
450 rm -f .git/index NM &&
452 git update-index --add NM &&
454 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
458 test_expect_success '14 (fail) - must match and be up-to-date in O && A && B && O==A && O!=B case' '
459 rm -f .git/index NM &&
461 git update-index --add NM &&
463 read_tree_must_fail -m $tree_O $tree_A $tree_B
466 test_expect_success '14 (fail) - must match and be up-to-date in O && A && B && O==A && O!=B case' '
467 rm -f .git/index NM &&
470 git update-index --add NM &&
471 read_tree_must_fail -m $tree_O $tree_A $tree_B
474 test_expect_success '15 - must match A in O && A && B && O==A && O==B case' '
475 rm -f .git/index NN &&
477 git update-index --add NN &&
478 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
482 test_expect_success '15 - must match A in O && A && B && O==A && O==B case' '
483 rm -f .git/index NN &&
485 git update-index --add NN &&
487 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
491 test_expect_success '15 (fail) - must match A in O && A && B && O==A && O==B case' '
492 rm -f .git/index NN &&
495 git update-index --add NN &&
496 read_tree_must_fail -m $tree_O $tree_A $tree_B
499 test_expect_success '16 - A matches in one and B matches in another.' '
500 rm -f .git/index F16 &&
502 git update-index --add F16 &&
503 tree0=$(git write-tree) &&
505 git update-index F16 &&
506 tree1=$(git write-tree) &&
507 read_tree_must_succeed -m $tree0 $tree1 $tree1 $tree0 &&