You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

SimpleMergeTest.java 13KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393
  1. /*
  2. * Copyright (C) 2009, Google Inc.
  3. * Copyright (C) 2008, Robin Rosenberg
  4. * and other copyright owners as documented in the project's IP log.
  5. *
  6. * This program and the accompanying materials are made available
  7. * under the terms of the Eclipse Distribution License v1.0 which
  8. * accompanies this distribution, is reproduced below, and is
  9. * available at http://www.eclipse.org/org/documents/edl-v10.php
  10. *
  11. * All rights reserved.
  12. *
  13. * Redistribution and use in source and binary forms, with or
  14. * without modification, are permitted provided that the following
  15. * conditions are met:
  16. *
  17. * - Redistributions of source code must retain the above copyright
  18. * notice, this list of conditions and the following disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials provided
  23. * with the distribution.
  24. *
  25. * - Neither the name of the Eclipse Foundation, Inc. nor the
  26. * names of its contributors may be used to endorse or promote
  27. * products derived from this software without specific prior
  28. * written permission.
  29. *
  30. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  31. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  32. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  33. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  34. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  35. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  36. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  37. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  38. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  39. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  40. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  41. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  42. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  43. */
  44. package org.eclipse.jgit.merge;
  45. import static org.eclipse.jgit.lib.Constants.OBJ_BLOB;
  46. import java.io.IOException;
  47. import org.eclipse.jgit.dircache.DirCache;
  48. import org.eclipse.jgit.dircache.DirCacheBuilder;
  49. import org.eclipse.jgit.dircache.DirCacheEntry;
  50. import org.eclipse.jgit.lib.CommitBuilder;
  51. import org.eclipse.jgit.lib.Constants;
  52. import org.eclipse.jgit.lib.FileMode;
  53. import org.eclipse.jgit.lib.ObjectId;
  54. import org.eclipse.jgit.lib.ObjectInserter;
  55. import org.eclipse.jgit.lib.PersonIdent;
  56. import org.eclipse.jgit.lib.SampleDataRepositoryTestCase;
  57. import org.eclipse.jgit.treewalk.TreeWalk;
  58. public class SimpleMergeTest extends SampleDataRepositoryTestCase {
  59. public void testOurs() throws IOException {
  60. Merger ourMerger = MergeStrategy.OURS.newMerger(db);
  61. boolean merge = ourMerger.merge(new ObjectId[] { db.resolve("a"), db.resolve("c") });
  62. assertTrue(merge);
  63. assertEquals(db.mapTree("a").getId(), ourMerger.getResultTreeId());
  64. }
  65. public void testTheirs() throws IOException {
  66. Merger ourMerger = MergeStrategy.THEIRS.newMerger(db);
  67. boolean merge = ourMerger.merge(new ObjectId[] { db.resolve("a"), db.resolve("c") });
  68. assertTrue(merge);
  69. assertEquals(db.mapTree("c").getId(), ourMerger.getResultTreeId());
  70. }
  71. public void testTrivialTwoWay() throws IOException {
  72. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  73. boolean merge = ourMerger.merge(new ObjectId[] { db.resolve("a"), db.resolve("c") });
  74. assertTrue(merge);
  75. assertEquals("02ba32d3649e510002c21651936b7077aa75ffa9",ourMerger.getResultTreeId().name());
  76. }
  77. public void testTrivialTwoWay_disjointhistories() throws IOException {
  78. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  79. boolean merge = ourMerger.merge(new ObjectId[] { db.resolve("a"), db.resolve("c~4") });
  80. assertTrue(merge);
  81. assertEquals("86265c33b19b2be71bdd7b8cb95823f2743d03a8",ourMerger.getResultTreeId().name());
  82. }
  83. public void testTrivialTwoWay_ok() throws IOException {
  84. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  85. boolean merge = ourMerger.merge(new ObjectId[] { db.resolve("a^0^0^0"), db.resolve("a^0^0^1") });
  86. assertTrue(merge);
  87. assertEquals(db.mapTree("a^0^0").getId(), ourMerger.getResultTreeId());
  88. }
  89. public void testTrivialTwoWay_conflict() throws IOException {
  90. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  91. boolean merge = ourMerger.merge(new ObjectId[] { db.resolve("f"), db.resolve("g") });
  92. assertFalse(merge);
  93. }
  94. public void testTrivialTwoWay_validSubtreeSort() throws Exception {
  95. final DirCache treeB = db.readDirCache();
  96. final DirCache treeO = db.readDirCache();
  97. final DirCache treeT = db.readDirCache();
  98. {
  99. final DirCacheBuilder b = treeB.builder();
  100. final DirCacheBuilder o = treeO.builder();
  101. final DirCacheBuilder t = treeT.builder();
  102. b.add(makeEntry("libelf-po/a", FileMode.REGULAR_FILE));
  103. b.add(makeEntry("libelf/c", FileMode.REGULAR_FILE));
  104. o.add(makeEntry("Makefile", FileMode.REGULAR_FILE));
  105. o.add(makeEntry("libelf-po/a", FileMode.REGULAR_FILE));
  106. o.add(makeEntry("libelf/c", FileMode.REGULAR_FILE));
  107. t.add(makeEntry("libelf-po/a", FileMode.REGULAR_FILE));
  108. t.add(makeEntry("libelf/c", FileMode.REGULAR_FILE, "blah"));
  109. b.finish();
  110. o.finish();
  111. t.finish();
  112. }
  113. final ObjectInserter ow = db.newObjectInserter();
  114. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  115. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  116. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  117. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  118. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  119. assertTrue(merge);
  120. final TreeWalk tw = new TreeWalk(db);
  121. tw.setRecursive(true);
  122. tw.reset(ourMerger.getResultTreeId());
  123. assertTrue(tw.next());
  124. assertEquals("Makefile", tw.getPathString());
  125. assertCorrectId(treeO, tw);
  126. assertTrue(tw.next());
  127. assertEquals("libelf-po/a", tw.getPathString());
  128. assertCorrectId(treeO, tw);
  129. assertTrue(tw.next());
  130. assertEquals("libelf/c", tw.getPathString());
  131. assertCorrectId(treeT, tw);
  132. assertFalse(tw.next());
  133. }
  134. public void testTrivialTwoWay_concurrentSubtreeChange() throws Exception {
  135. final DirCache treeB = db.readDirCache();
  136. final DirCache treeO = db.readDirCache();
  137. final DirCache treeT = db.readDirCache();
  138. {
  139. final DirCacheBuilder b = treeB.builder();
  140. final DirCacheBuilder o = treeO.builder();
  141. final DirCacheBuilder t = treeT.builder();
  142. b.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  143. b.add(makeEntry("d/t", FileMode.REGULAR_FILE));
  144. o.add(makeEntry("d/o", FileMode.REGULAR_FILE, "o !"));
  145. o.add(makeEntry("d/t", FileMode.REGULAR_FILE));
  146. t.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  147. t.add(makeEntry("d/t", FileMode.REGULAR_FILE, "t !"));
  148. b.finish();
  149. o.finish();
  150. t.finish();
  151. }
  152. final ObjectInserter ow = db.newObjectInserter();
  153. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  154. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  155. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  156. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  157. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  158. assertTrue(merge);
  159. final TreeWalk tw = new TreeWalk(db);
  160. tw.setRecursive(true);
  161. tw.reset(ourMerger.getResultTreeId());
  162. assertTrue(tw.next());
  163. assertEquals("d/o", tw.getPathString());
  164. assertCorrectId(treeO, tw);
  165. assertTrue(tw.next());
  166. assertEquals("d/t", tw.getPathString());
  167. assertCorrectId(treeT, tw);
  168. assertFalse(tw.next());
  169. }
  170. public void testTrivialTwoWay_conflictSubtreeChange() throws Exception {
  171. final DirCache treeB = db.readDirCache();
  172. final DirCache treeO = db.readDirCache();
  173. final DirCache treeT = db.readDirCache();
  174. {
  175. final DirCacheBuilder b = treeB.builder();
  176. final DirCacheBuilder o = treeO.builder();
  177. final DirCacheBuilder t = treeT.builder();
  178. b.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  179. b.add(makeEntry("d/t", FileMode.REGULAR_FILE));
  180. o.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  181. o.add(makeEntry("d/t", FileMode.REGULAR_FILE, "o !"));
  182. t.add(makeEntry("d/o", FileMode.REGULAR_FILE, "t !"));
  183. t.add(makeEntry("d/t", FileMode.REGULAR_FILE, "t !"));
  184. b.finish();
  185. o.finish();
  186. t.finish();
  187. }
  188. final ObjectInserter ow = db.newObjectInserter();
  189. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  190. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  191. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  192. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  193. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  194. assertFalse(merge);
  195. }
  196. public void testTrivialTwoWay_leftDFconflict1() throws Exception {
  197. final DirCache treeB = db.readDirCache();
  198. final DirCache treeO = db.readDirCache();
  199. final DirCache treeT = db.readDirCache();
  200. {
  201. final DirCacheBuilder b = treeB.builder();
  202. final DirCacheBuilder o = treeO.builder();
  203. final DirCacheBuilder t = treeT.builder();
  204. b.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  205. b.add(makeEntry("d/t", FileMode.REGULAR_FILE));
  206. o.add(makeEntry("d", FileMode.REGULAR_FILE));
  207. t.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  208. t.add(makeEntry("d/t", FileMode.REGULAR_FILE, "t !"));
  209. b.finish();
  210. o.finish();
  211. t.finish();
  212. }
  213. final ObjectInserter ow = db.newObjectInserter();
  214. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  215. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  216. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  217. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  218. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  219. assertFalse(merge);
  220. }
  221. public void testTrivialTwoWay_rightDFconflict1() throws Exception {
  222. final DirCache treeB = db.readDirCache();
  223. final DirCache treeO = db.readDirCache();
  224. final DirCache treeT = db.readDirCache();
  225. {
  226. final DirCacheBuilder b = treeB.builder();
  227. final DirCacheBuilder o = treeO.builder();
  228. final DirCacheBuilder t = treeT.builder();
  229. b.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  230. b.add(makeEntry("d/t", FileMode.REGULAR_FILE));
  231. o.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  232. o.add(makeEntry("d/t", FileMode.REGULAR_FILE, "o !"));
  233. t.add(makeEntry("d", FileMode.REGULAR_FILE));
  234. b.finish();
  235. o.finish();
  236. t.finish();
  237. }
  238. final ObjectInserter ow = db.newObjectInserter();
  239. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  240. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  241. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  242. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  243. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  244. assertFalse(merge);
  245. }
  246. public void testTrivialTwoWay_leftDFconflict2() throws Exception {
  247. final DirCache treeB = db.readDirCache();
  248. final DirCache treeO = db.readDirCache();
  249. final DirCache treeT = db.readDirCache();
  250. {
  251. final DirCacheBuilder b = treeB.builder();
  252. final DirCacheBuilder o = treeO.builder();
  253. final DirCacheBuilder t = treeT.builder();
  254. b.add(makeEntry("d", FileMode.REGULAR_FILE));
  255. o.add(makeEntry("d", FileMode.REGULAR_FILE, "o !"));
  256. t.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  257. b.finish();
  258. o.finish();
  259. t.finish();
  260. }
  261. final ObjectInserter ow = db.newObjectInserter();
  262. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  263. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  264. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  265. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  266. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  267. assertFalse(merge);
  268. }
  269. public void testTrivialTwoWay_rightDFconflict2() throws Exception {
  270. final DirCache treeB = db.readDirCache();
  271. final DirCache treeO = db.readDirCache();
  272. final DirCache treeT = db.readDirCache();
  273. {
  274. final DirCacheBuilder b = treeB.builder();
  275. final DirCacheBuilder o = treeO.builder();
  276. final DirCacheBuilder t = treeT.builder();
  277. b.add(makeEntry("d", FileMode.REGULAR_FILE));
  278. o.add(makeEntry("d/o", FileMode.REGULAR_FILE));
  279. t.add(makeEntry("d", FileMode.REGULAR_FILE, "t !"));
  280. b.finish();
  281. o.finish();
  282. t.finish();
  283. }
  284. final ObjectInserter ow = db.newObjectInserter();
  285. final ObjectId b = commit(ow, treeB, new ObjectId[] {});
  286. final ObjectId o = commit(ow, treeO, new ObjectId[] { b });
  287. final ObjectId t = commit(ow, treeT, new ObjectId[] { b });
  288. Merger ourMerger = MergeStrategy.SIMPLE_TWO_WAY_IN_CORE.newMerger(db);
  289. boolean merge = ourMerger.merge(new ObjectId[] { o, t });
  290. assertFalse(merge);
  291. }
  292. private void assertCorrectId(final DirCache treeT, final TreeWalk tw) {
  293. assertEquals(treeT.getEntry(tw.getPathString()).getObjectId(), tw
  294. .getObjectId(0));
  295. }
  296. private ObjectId commit(final ObjectInserter odi, final DirCache treeB,
  297. final ObjectId[] parentIds) throws Exception {
  298. final CommitBuilder c = new CommitBuilder();
  299. c.setTreeId(treeB.writeTree(odi));
  300. c.setAuthor(new PersonIdent("A U Thor", "a.u.thor", 1L, 0));
  301. c.setCommitter(c.getAuthor());
  302. c.setParentIds(parentIds);
  303. c.setMessage("Tree " + c.getTreeId().name());
  304. ObjectId id = odi.insert(c);
  305. odi.flush();
  306. return id;
  307. }
  308. private DirCacheEntry makeEntry(final String path, final FileMode mode)
  309. throws Exception {
  310. return makeEntry(path, mode, path);
  311. }
  312. private DirCacheEntry makeEntry(final String path, final FileMode mode,
  313. final String content) throws Exception {
  314. final DirCacheEntry ent = new DirCacheEntry(path);
  315. ent.setFileMode(mode);
  316. ent.setObjectId(new ObjectInserter.Formatter().idFor(OBJ_BLOB,
  317. Constants.encode(content)));
  318. return ent;
  319. }
  320. }