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/ '"$_x40"' / 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 \
138 '3-way merge with git read-tree -m, empty cache' \
139 "rm -fr [NDMALTS][NDMALTSF] Z &&
141 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 \
147 '3-way merge with git read-tree -m, match H' \
148 "rm -fr [NDMALTS][NDMALTSF] Z &&
150 read_tree_must_succeed $tree_A &&
151 git checkout-index -f -u -a &&
152 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 \
219 '2 - must match B in !O && !A && B case.' \
220 "rm -f .git/index NA &&
222 git update-index --add NA &&
223 read_tree_must_succeed -m $tree_O $tree_A $tree_B"
225 test_expect_success \
226 '2 - matching B alone is OK in !O && !A && B case.' \
227 "rm -f .git/index NA &&
229 git update-index --add NA &&
231 read_tree_must_succeed -m $tree_O $tree_A $tree_B"
233 test_expect_success \
234 '3 - must match A in !O && A && !B case.' \
235 "rm -f .git/index AN &&
237 git update-index --add AN &&
238 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
241 test_expect_success \
242 '3 - matching A alone is OK in !O && A && !B case.' \
243 "rm -f .git/index AN &&
245 git update-index --add AN &&
247 read_tree_must_succeed -m $tree_O $tree_A $tree_B"
249 test_expect_success \
250 '3 (fail) - must match A in !O && A && !B case.' "
251 rm -f .git/index AN &&
254 git update-index --add AN &&
255 read_tree_must_fail -m $tree_O $tree_A $tree_B
258 test_expect_success \
259 '4 - must match and be up-to-date in !O && A && B && A!=B case.' \
260 "rm -f .git/index AA &&
262 git update-index --add AA &&
263 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
266 test_expect_success \
267 '4 (fail) - must match and be up-to-date in !O && A && B && A!=B case.' "
268 rm -f .git/index AA &&
270 git update-index --add AA &&
272 read_tree_must_fail -m $tree_O $tree_A $tree_B
275 test_expect_success \
276 '4 (fail) - must match and be up-to-date in !O && A && B && A!=B case.' "
277 rm -f .git/index AA &&
280 git update-index --add AA &&
281 read_tree_must_fail -m $tree_O $tree_A $tree_B
284 test_expect_success \
285 '5 - must match in !O && A && B && A==B case.' \
286 "rm -f .git/index LL &&
288 git update-index --add LL &&
289 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
292 test_expect_success \
293 '5 - must match in !O && A && B && A==B case.' \
294 "rm -f .git/index LL &&
296 git update-index --add LL &&
298 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
301 test_expect_success \
302 '5 (fail) - must match A in !O && A && B && A==B case.' "
303 rm -f .git/index LL &&
306 git update-index --add LL &&
307 read_tree_must_fail -m $tree_O $tree_A $tree_B
310 test_expect_success \
311 '6 - must not exist in O && !A && !B case' "
312 rm -f .git/index DD &&
314 git update-index --add DD &&
315 read_tree_must_fail -m $tree_O $tree_A $tree_B
318 test_expect_success \
319 '7 - must not exist in O && !A && B && O!=B case' "
320 rm -f .git/index DM &&
322 git update-index --add DM &&
323 read_tree_must_fail -m $tree_O $tree_A $tree_B
326 test_expect_success \
327 '8 - must not exist in O && !A && B && O==B case' "
328 rm -f .git/index DN &&
330 git update-index --add DN &&
331 read_tree_must_fail -m $tree_O $tree_A $tree_B
334 test_expect_success \
335 '9 - 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 &&
339 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
342 test_expect_success \
343 '9 (fail) - must match and be up-to-date in O && A && !B && O!=A case' "
344 rm -f .git/index MD &&
346 git update-index --add MD &&
348 read_tree_must_fail -m $tree_O $tree_A $tree_B
351 test_expect_success \
352 '9 (fail) - must match and be up-to-date in O && A && !B && O!=A case' "
353 rm -f .git/index MD &&
356 git update-index --add MD &&
357 read_tree_must_fail -m $tree_O $tree_A $tree_B
360 test_expect_success \
361 '10 - must match and be up-to-date in O && A && !B && O==A case' \
362 "rm -f .git/index ND &&
364 git update-index --add ND &&
365 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
368 test_expect_success \
369 '10 (fail) - must match and be up-to-date in O && A && !B && O==A case' "
370 rm -f .git/index ND &&
372 git update-index --add ND &&
374 read_tree_must_fail -m $tree_O $tree_A $tree_B
377 test_expect_success \
378 '10 (fail) - must match and be up-to-date in O && A && !B && O==A case' "
379 rm -f .git/index ND &&
382 git update-index --add ND &&
383 read_tree_must_fail -m $tree_O $tree_A $tree_B
386 test_expect_success \
387 '11 - must match and be up-to-date in O && A && B && O!=A && O!=B && A!=B case' \
388 "rm -f .git/index MM &&
390 git update-index --add MM &&
391 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
394 test_expect_success \
395 '11 (fail) - must match and be up-to-date in O && A && B && O!=A && O!=B && A!=B case' "
396 rm -f .git/index MM &&
398 git update-index --add MM &&
400 read_tree_must_fail -m $tree_O $tree_A $tree_B
403 test_expect_success \
404 '11 (fail) - must match and be up-to-date in O && A && B && O!=A && O!=B && A!=B case' "
405 rm -f .git/index MM &&
408 git update-index --add MM &&
409 read_tree_must_fail -m $tree_O $tree_A $tree_B
412 test_expect_success \
413 '12 - must match A in O && A && B && O!=A && A==B case' \
414 "rm -f .git/index SS &&
416 git update-index --add SS &&
417 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
420 test_expect_success \
421 '12 - must match A in O && A && B && O!=A && A==B case' \
422 "rm -f .git/index SS &&
424 git update-index --add SS &&
426 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
429 test_expect_success \
430 '12 (fail) - must match A in O && A && B && O!=A && A==B case' "
431 rm -f .git/index SS &&
434 git update-index --add SS &&
435 read_tree_must_fail -m $tree_O $tree_A $tree_B
438 test_expect_success \
439 '13 - must match A in O && A && B && O!=A && O==B case' \
440 "rm -f .git/index MN &&
442 git update-index --add MN &&
443 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
446 test_expect_success \
447 '13 - must match A in O && A && B && O!=A && O==B case' \
448 "rm -f .git/index MN &&
450 git update-index --add MN &&
452 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
455 test_expect_success \
456 '14 - must match and be up-to-date in O && A && B && O==A && O!=B case' \
457 "rm -f .git/index NM &&
459 git update-index --add NM &&
460 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
463 test_expect_success \
464 '14 - may match B in O && A && B && O==A && O!=B case' \
465 "rm -f .git/index NM &&
467 git update-index --add NM &&
469 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
472 test_expect_success \
473 '14 (fail) - must match and be up-to-date in O && A && B && O==A && O!=B case' "
474 rm -f .git/index NM &&
476 git update-index --add NM &&
478 read_tree_must_fail -m $tree_O $tree_A $tree_B
481 test_expect_success \
482 '14 (fail) - must match and be up-to-date in O && A && B && O==A && O!=B case' "
483 rm -f .git/index NM &&
486 git update-index --add NM &&
487 read_tree_must_fail -m $tree_O $tree_A $tree_B
490 test_expect_success \
491 '15 - must match A in O && A && B && O==A && O==B case' \
492 "rm -f .git/index NN &&
494 git update-index --add NN &&
495 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
498 test_expect_success \
499 '15 - must match A in O && A && B && O==A && O==B case' \
500 "rm -f .git/index NN &&
502 git update-index --add NN &&
504 read_tree_must_succeed -m $tree_O $tree_A $tree_B &&
507 test_expect_success \
508 '15 (fail) - must match A in O && A && B && O==A && O==B case' "
509 rm -f .git/index NN &&
512 git update-index --add NN &&
513 read_tree_must_fail -m $tree_O $tree_A $tree_B
517 test_expect_success \
518 '16 - A matches in one and B matches in another.' \
519 'rm -f .git/index F16 &&
521 git update-index --add F16 &&
522 tree0=$(git write-tree) &&
524 git update-index F16 &&
525 tree1=$(git write-tree) &&
526 read_tree_must_succeed -m $tree0 $tree1 $tree1 $tree0 &&
527 git ls-files --stage'