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.

RebuildCommitGraph.java 10KB

Rewrite reference handling to be abstract and accurate This commit actually does three major changes to the way references are handled within JGit. Unfortunately they were easier to do as a single massive commit than to break them up into smaller units. Disambiguate symbolic references: --------------------------------- Reporting a symbolic reference such as HEAD as though it were any other normal reference like refs/heads/master causes subtle programming errors. We have been bitten by this error on several occasions, as have some downstream applications written by myself. Instead of reporting HEAD as a reference whose name differs from its "original name", report it as an actual SymbolicRef object that the application can test the type and examine the target of. With this change, Ref is now an abstract type with different subclasses for the different types. In the classical example of "HEAD" being a symbolic reference to branch "refs/heads/master", the Repository.getAllRefs() method will now return: Map<String, Ref> all = repository.getAllRefs(); SymbolicRef HEAD = (SymbolicRef) all.get("HEAD"); ObjectIdRef master = (ObjectIdRef) all.get("refs/heads/master"); assertSame(master, HEAD.getTarget()); assertSame(master.getObjectId(), HEAD.getObjectId()); assertEquals("HEAD", HEAD.getName()); assertEquals("refs/heads/master", master.getName()); A nice side-effect of this change is the storage type of the symbolic reference is no longer ambiguous with the storge type of the underlying reference it targets. In the above example, if master was only available in the packed-refs file, then the following is also true: assertSame(Ref.Storage.LOOSE, HEAD.getStorage()); assertSame(Ref.Storage.PACKED, master.getStorage()); (Prior to this change we returned the ambiguous storage of LOOSE_PACKED for HEAD, which was confusing since it wasn't actually true on disk). Another nice side-effect of this change is all intermediate symbolic references are preserved, and are therefore visible to the application when they walk the target chain. We can now correctly inspect chains of symbolic references. As a result of this change the Ref.getOrigName() method has been removed from the API. Applications should identify a symbolic reference by testing for isSymbolic() and not by using an arcane string comparsion between properties. Abstract the RefDatabase storage: --------------------------------- RefDatabase is now abstract, similar to ObjectDatabase, and a new concrete implementation called RefDirectory is used for the traditional on-disk storage layout. In the future we plan to support additional implementations, such as a pure in-memory RefDatabase for unit testing purposes. Optimize RefDirectory: ---------------------- The implementation of the in-memory reference cache, reading, and update routines has been completely rewritten. Much of the code was heavily borrowed or cribbed from the prior implementation, so copyright notices have been left intact as much as possible. The RefDirectory cache no longer confuses symbolic references with normal references. This permits the cache to resolve the value of a symbolic reference as late as possible, ensuring it is always current, without needing to maintain reverse pointers. The cache is now 2 sorted RefLists, rather than 3 HashMaps. Using sorted lists allows the implementation to reduce the in-memory footprint when storing many refs. Using specialized types for the elements allows the code to avoid additional map lookups for auxiliary stat information. To improve scan time during getRefs(), the lists are returned via a copy-on-write contract. Most callers of getRefs() do not modify the returned collections, so the copy-on-write semantics improves access on repositories with a large number of packed references. Iterator traversals of the returned Map<String,Ref> are performed using a simple merge-join of the two cache lists, ensuring we can perform the entire traversal in linear time as a function of the number of references: O(PackedRefs + LooseRefs). Scans of the loose reference space to update the cache run in O(LooseRefs log LooseRefs) time, as the directory contents are sorted before being merged against the in-memory cache. Since the majority of stable references are kept packed, there typically are only a handful of reference names to be sorted, so the sorting cost should not be very high. Locking is reduced during getRefs() by taking advantage of the copy-on-write semantics of the improved cache data structure. This permits concurrent readers to pull back references without blocking each other. If there is contention updating the cache during a scan, one or more updates are simply skipped and will get picked up again in a future scan. Writing to the $GIT_DIR/packed-refs during reference delete is now fully atomic. The file is locked, reparsed fresh, and written back out if a change is necessary. This avoids all race conditions with concurrent external updates of the packed-refs file. The RefLogWriter class has been fully folded into RefDirectory and is therefore deleted. Maintaining the reference's log is the responsiblity of the database implementation, and not all implementations will use java.io for access. Future work still remains to be done to abstract the ReflogReader class away from local disk IO. Change-Id: I26b9287c45a4b2d2be35ba2849daa316f5eec85d Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
14 jaren geleden
Rewrite reference handling to be abstract and accurate This commit actually does three major changes to the way references are handled within JGit. Unfortunately they were easier to do as a single massive commit than to break them up into smaller units. Disambiguate symbolic references: --------------------------------- Reporting a symbolic reference such as HEAD as though it were any other normal reference like refs/heads/master causes subtle programming errors. We have been bitten by this error on several occasions, as have some downstream applications written by myself. Instead of reporting HEAD as a reference whose name differs from its "original name", report it as an actual SymbolicRef object that the application can test the type and examine the target of. With this change, Ref is now an abstract type with different subclasses for the different types. In the classical example of "HEAD" being a symbolic reference to branch "refs/heads/master", the Repository.getAllRefs() method will now return: Map<String, Ref> all = repository.getAllRefs(); SymbolicRef HEAD = (SymbolicRef) all.get("HEAD"); ObjectIdRef master = (ObjectIdRef) all.get("refs/heads/master"); assertSame(master, HEAD.getTarget()); assertSame(master.getObjectId(), HEAD.getObjectId()); assertEquals("HEAD", HEAD.getName()); assertEquals("refs/heads/master", master.getName()); A nice side-effect of this change is the storage type of the symbolic reference is no longer ambiguous with the storge type of the underlying reference it targets. In the above example, if master was only available in the packed-refs file, then the following is also true: assertSame(Ref.Storage.LOOSE, HEAD.getStorage()); assertSame(Ref.Storage.PACKED, master.getStorage()); (Prior to this change we returned the ambiguous storage of LOOSE_PACKED for HEAD, which was confusing since it wasn't actually true on disk). Another nice side-effect of this change is all intermediate symbolic references are preserved, and are therefore visible to the application when they walk the target chain. We can now correctly inspect chains of symbolic references. As a result of this change the Ref.getOrigName() method has been removed from the API. Applications should identify a symbolic reference by testing for isSymbolic() and not by using an arcane string comparsion between properties. Abstract the RefDatabase storage: --------------------------------- RefDatabase is now abstract, similar to ObjectDatabase, and a new concrete implementation called RefDirectory is used for the traditional on-disk storage layout. In the future we plan to support additional implementations, such as a pure in-memory RefDatabase for unit testing purposes. Optimize RefDirectory: ---------------------- The implementation of the in-memory reference cache, reading, and update routines has been completely rewritten. Much of the code was heavily borrowed or cribbed from the prior implementation, so copyright notices have been left intact as much as possible. The RefDirectory cache no longer confuses symbolic references with normal references. This permits the cache to resolve the value of a symbolic reference as late as possible, ensuring it is always current, without needing to maintain reverse pointers. The cache is now 2 sorted RefLists, rather than 3 HashMaps. Using sorted lists allows the implementation to reduce the in-memory footprint when storing many refs. Using specialized types for the elements allows the code to avoid additional map lookups for auxiliary stat information. To improve scan time during getRefs(), the lists are returned via a copy-on-write contract. Most callers of getRefs() do not modify the returned collections, so the copy-on-write semantics improves access on repositories with a large number of packed references. Iterator traversals of the returned Map<String,Ref> are performed using a simple merge-join of the two cache lists, ensuring we can perform the entire traversal in linear time as a function of the number of references: O(PackedRefs + LooseRefs). Scans of the loose reference space to update the cache run in O(LooseRefs log LooseRefs) time, as the directory contents are sorted before being merged against the in-memory cache. Since the majority of stable references are kept packed, there typically are only a handful of reference names to be sorted, so the sorting cost should not be very high. Locking is reduced during getRefs() by taking advantage of the copy-on-write semantics of the improved cache data structure. This permits concurrent readers to pull back references without blocking each other. If there is contention updating the cache during a scan, one or more updates are simply skipped and will get picked up again in a future scan. Writing to the $GIT_DIR/packed-refs during reference delete is now fully atomic. The file is locked, reparsed fresh, and written back out if a change is necessary. This avoids all race conditions with concurrent external updates of the packed-refs file. The RefLogWriter class has been fully folded into RefDirectory and is therefore deleted. Maintaining the reference's log is the responsiblity of the database implementation, and not all implementations will use java.io for access. Future work still remains to be done to abstract the ReflogReader class away from local disk IO. Change-Id: I26b9287c45a4b2d2be35ba2849daa316f5eec85d Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
14 jaren geleden
Rewrite reference handling to be abstract and accurate This commit actually does three major changes to the way references are handled within JGit. Unfortunately they were easier to do as a single massive commit than to break them up into smaller units. Disambiguate symbolic references: --------------------------------- Reporting a symbolic reference such as HEAD as though it were any other normal reference like refs/heads/master causes subtle programming errors. We have been bitten by this error on several occasions, as have some downstream applications written by myself. Instead of reporting HEAD as a reference whose name differs from its "original name", report it as an actual SymbolicRef object that the application can test the type and examine the target of. With this change, Ref is now an abstract type with different subclasses for the different types. In the classical example of "HEAD" being a symbolic reference to branch "refs/heads/master", the Repository.getAllRefs() method will now return: Map<String, Ref> all = repository.getAllRefs(); SymbolicRef HEAD = (SymbolicRef) all.get("HEAD"); ObjectIdRef master = (ObjectIdRef) all.get("refs/heads/master"); assertSame(master, HEAD.getTarget()); assertSame(master.getObjectId(), HEAD.getObjectId()); assertEquals("HEAD", HEAD.getName()); assertEquals("refs/heads/master", master.getName()); A nice side-effect of this change is the storage type of the symbolic reference is no longer ambiguous with the storge type of the underlying reference it targets. In the above example, if master was only available in the packed-refs file, then the following is also true: assertSame(Ref.Storage.LOOSE, HEAD.getStorage()); assertSame(Ref.Storage.PACKED, master.getStorage()); (Prior to this change we returned the ambiguous storage of LOOSE_PACKED for HEAD, which was confusing since it wasn't actually true on disk). Another nice side-effect of this change is all intermediate symbolic references are preserved, and are therefore visible to the application when they walk the target chain. We can now correctly inspect chains of symbolic references. As a result of this change the Ref.getOrigName() method has been removed from the API. Applications should identify a symbolic reference by testing for isSymbolic() and not by using an arcane string comparsion between properties. Abstract the RefDatabase storage: --------------------------------- RefDatabase is now abstract, similar to ObjectDatabase, and a new concrete implementation called RefDirectory is used for the traditional on-disk storage layout. In the future we plan to support additional implementations, such as a pure in-memory RefDatabase for unit testing purposes. Optimize RefDirectory: ---------------------- The implementation of the in-memory reference cache, reading, and update routines has been completely rewritten. Much of the code was heavily borrowed or cribbed from the prior implementation, so copyright notices have been left intact as much as possible. The RefDirectory cache no longer confuses symbolic references with normal references. This permits the cache to resolve the value of a symbolic reference as late as possible, ensuring it is always current, without needing to maintain reverse pointers. The cache is now 2 sorted RefLists, rather than 3 HashMaps. Using sorted lists allows the implementation to reduce the in-memory footprint when storing many refs. Using specialized types for the elements allows the code to avoid additional map lookups for auxiliary stat information. To improve scan time during getRefs(), the lists are returned via a copy-on-write contract. Most callers of getRefs() do not modify the returned collections, so the copy-on-write semantics improves access on repositories with a large number of packed references. Iterator traversals of the returned Map<String,Ref> are performed using a simple merge-join of the two cache lists, ensuring we can perform the entire traversal in linear time as a function of the number of references: O(PackedRefs + LooseRefs). Scans of the loose reference space to update the cache run in O(LooseRefs log LooseRefs) time, as the directory contents are sorted before being merged against the in-memory cache. Since the majority of stable references are kept packed, there typically are only a handful of reference names to be sorted, so the sorting cost should not be very high. Locking is reduced during getRefs() by taking advantage of the copy-on-write semantics of the improved cache data structure. This permits concurrent readers to pull back references without blocking each other. If there is contention updating the cache during a scan, one or more updates are simply skipped and will get picked up again in a future scan. Writing to the $GIT_DIR/packed-refs during reference delete is now fully atomic. The file is locked, reparsed fresh, and written back out if a change is necessary. This avoids all race conditions with concurrent external updates of the packed-refs file. The RefLogWriter class has been fully folded into RefDirectory and is therefore deleted. Maintaining the reference's log is the responsiblity of the database implementation, and not all implementations will use java.io for access. Future work still remains to be done to abstract the ReflogReader class away from local disk IO. Change-Id: I26b9287c45a4b2d2be35ba2849daa316f5eec85d Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
14 jaren geleden
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311
  1. /*
  2. * Copyright (C) 2009-2010, Google Inc.
  3. * and other copyright owners as documented in the project's IP log.
  4. *
  5. * This program and the accompanying materials are made available
  6. * under the terms of the Eclipse Distribution License v1.0 which
  7. * accompanies this distribution, is reproduced below, and is
  8. * available at http://www.eclipse.org/org/documents/edl-v10.php
  9. *
  10. * All rights reserved.
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above copyright
  17. * notice, this list of conditions and the following disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials provided
  22. * with the distribution.
  23. *
  24. * - Neither the name of the Eclipse Foundation, Inc. nor the
  25. * names of its contributors may be used to endorse or promote
  26. * products derived from this software without specific prior
  27. * written permission.
  28. *
  29. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  30. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  31. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  32. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  33. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  34. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  35. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  36. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  37. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  38. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  39. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  40. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  41. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  42. */
  43. package org.eclipse.jgit.pgm.debug;
  44. import static java.nio.charset.StandardCharsets.UTF_8;
  45. import java.io.BufferedReader;
  46. import java.io.File;
  47. import java.io.FileInputStream;
  48. import java.io.IOException;
  49. import java.io.InputStreamReader;
  50. import java.text.MessageFormat;
  51. import java.util.ArrayList;
  52. import java.util.Date;
  53. import java.util.HashMap;
  54. import java.util.List;
  55. import java.util.ListIterator;
  56. import java.util.Map;
  57. import org.eclipse.jgit.errors.MissingObjectException;
  58. import org.eclipse.jgit.errors.ObjectWritingException;
  59. import org.eclipse.jgit.internal.storage.file.LockFile;
  60. import org.eclipse.jgit.lib.CommitBuilder;
  61. import org.eclipse.jgit.lib.Constants;
  62. import org.eclipse.jgit.lib.ObjectId;
  63. import org.eclipse.jgit.lib.ObjectIdRef;
  64. import org.eclipse.jgit.lib.ObjectInserter;
  65. import org.eclipse.jgit.lib.PersonIdent;
  66. import org.eclipse.jgit.lib.ProgressMonitor;
  67. import org.eclipse.jgit.lib.Ref;
  68. import org.eclipse.jgit.lib.RefUpdate;
  69. import org.eclipse.jgit.lib.RefWriter;
  70. import org.eclipse.jgit.lib.TextProgressMonitor;
  71. import org.eclipse.jgit.pgm.Command;
  72. import org.eclipse.jgit.pgm.TextBuiltin;
  73. import org.eclipse.jgit.pgm.internal.CLIText;
  74. import org.eclipse.jgit.revwalk.RevWalk;
  75. import org.kohsuke.args4j.Argument;
  76. import org.kohsuke.args4j.Option;
  77. /**
  78. * Recreates a repository from another one's commit graph.
  79. * <p>
  80. * <b>Do not run this on a repository unless you want to destroy it.</b>
  81. * <p>
  82. * To create the input files, in the source repository use:
  83. *
  84. * <pre>
  85. * git for-each-ref &gt;in.refs
  86. * git log --all '--pretty=format:%H %ct %P' &gt;in.dag
  87. * </pre>
  88. * <p>
  89. * Run the rebuild in either an empty repository, or a clone of the source. Any
  90. * missing commits (which might be the entire graph) will be created. All refs
  91. * will be modified to match the input exactly, which means some refs may be
  92. * deleted from the current repository.
  93. * <p>
  94. */
  95. @Command(usage = "usage_RebuildCommitGraph")
  96. class RebuildCommitGraph extends TextBuiltin {
  97. private static final String REALLY = "--destroy-this-repository"; //$NON-NLS-1$
  98. @Option(name = REALLY, usage = "usage_approveDestructionOfRepository")
  99. boolean really;
  100. @Argument(index = 0, required = true, metaVar = "metaVar_refs", usage = "usage_forEachRefOutput")
  101. File refList;
  102. @Argument(index = 1, required = true, metaVar = "metaVar_refs", usage = "usage_logAllPretty")
  103. File graph;
  104. private final ProgressMonitor pm = new TextProgressMonitor(errw);
  105. private Map<ObjectId, ObjectId> rewrites = new HashMap<>();
  106. /** {@inheritDoc} */
  107. @Override
  108. protected void run() throws Exception {
  109. if (!really && db.getRefDatabase().hasRefs()) {
  110. File directory = db.getDirectory();
  111. String absolutePath = directory == null ? "null" //$NON-NLS-1$
  112. : directory.getAbsolutePath();
  113. errw.println(
  114. MessageFormat.format(CLIText.get().fatalThisProgramWillDestroyTheRepository
  115. , absolutePath, REALLY));
  116. throw die(CLIText.get().needApprovalToDestroyCurrentRepository);
  117. }
  118. if (!refList.isFile())
  119. throw die(MessageFormat.format(CLIText.get().noSuchFile, refList.getPath()));
  120. if (!graph.isFile())
  121. throw die(MessageFormat.format(CLIText.get().noSuchFile, graph.getPath()));
  122. recreateCommitGraph();
  123. detachHead();
  124. deleteAllRefs();
  125. recreateRefs();
  126. }
  127. private void recreateCommitGraph() throws IOException {
  128. final Map<ObjectId, ToRewrite> toRewrite = new HashMap<>();
  129. List<ToRewrite> queue = new ArrayList<>();
  130. try (RevWalk rw = new RevWalk(db);
  131. final BufferedReader br = new BufferedReader(
  132. new InputStreamReader(new FileInputStream(graph),
  133. UTF_8))) {
  134. String line;
  135. while ((line = br.readLine()) != null) {
  136. final String[] parts = line.split("[ \t]{1,}"); //$NON-NLS-1$
  137. final ObjectId oldId = ObjectId.fromString(parts[0]);
  138. try {
  139. rw.parseCommit(oldId);
  140. // We have it already. Don't rewrite it.
  141. continue;
  142. } catch (MissingObjectException mue) {
  143. // Fall through and rewrite it.
  144. }
  145. final long time = Long.parseLong(parts[1]) * 1000L;
  146. final ObjectId[] parents = new ObjectId[parts.length - 2];
  147. for (int i = 0; i < parents.length; i++) {
  148. parents[i] = ObjectId.fromString(parts[2 + i]);
  149. }
  150. final ToRewrite t = new ToRewrite(oldId, time, parents);
  151. toRewrite.put(oldId, t);
  152. queue.add(t);
  153. }
  154. }
  155. pm.beginTask("Rewriting commits", queue.size()); //$NON-NLS-1$
  156. try (ObjectInserter oi = db.newObjectInserter()) {
  157. final ObjectId emptyTree = oi.insert(Constants.OBJ_TREE,
  158. new byte[] {});
  159. final PersonIdent me = new PersonIdent("jgit rebuild-commitgraph", //$NON-NLS-1$
  160. "rebuild-commitgraph@localhost"); //$NON-NLS-1$
  161. while (!queue.isEmpty()) {
  162. final ListIterator<ToRewrite> itr = queue
  163. .listIterator(queue.size());
  164. queue = new ArrayList<>();
  165. REWRITE: while (itr.hasPrevious()) {
  166. final ToRewrite t = itr.previous();
  167. final ObjectId[] newParents = new ObjectId[t.oldParents.length];
  168. for (int k = 0; k < t.oldParents.length; k++) {
  169. final ToRewrite p = toRewrite.get(t.oldParents[k]);
  170. if (p != null) {
  171. if (p.newId == null) {
  172. // Must defer until after the parent is
  173. // rewritten.
  174. queue.add(t);
  175. continue REWRITE;
  176. } else {
  177. newParents[k] = p.newId;
  178. }
  179. } else {
  180. // We have the old parent object. Use it.
  181. //
  182. newParents[k] = t.oldParents[k];
  183. }
  184. }
  185. final CommitBuilder newc = new CommitBuilder();
  186. newc.setTreeId(emptyTree);
  187. newc.setAuthor(new PersonIdent(me, new Date(t.commitTime)));
  188. newc.setCommitter(newc.getAuthor());
  189. newc.setParentIds(newParents);
  190. newc.setMessage("ORIGINAL " + t.oldId.name() + "\n"); //$NON-NLS-1$ //$NON-NLS-2$
  191. t.newId = oi.insert(newc);
  192. rewrites.put(t.oldId, t.newId);
  193. pm.update(1);
  194. }
  195. }
  196. oi.flush();
  197. }
  198. pm.endTask();
  199. }
  200. private static class ToRewrite {
  201. final ObjectId oldId;
  202. final long commitTime;
  203. final ObjectId[] oldParents;
  204. ObjectId newId;
  205. ToRewrite(ObjectId o, long t, ObjectId[] p) {
  206. oldId = o;
  207. commitTime = t;
  208. oldParents = p;
  209. }
  210. }
  211. private void detachHead() throws IOException {
  212. final String head = db.getFullBranch();
  213. final ObjectId id = db.resolve(Constants.HEAD);
  214. if (!ObjectId.isId(head) && id != null) {
  215. final LockFile lf;
  216. lf = new LockFile(new File(db.getDirectory(), Constants.HEAD));
  217. if (!lf.lock())
  218. throw new IOException(MessageFormat.format(CLIText.get().cannotLock, Constants.HEAD));
  219. lf.write(id);
  220. if (!lf.commit())
  221. throw new IOException(CLIText.get().cannotDeatchHEAD);
  222. }
  223. }
  224. private void deleteAllRefs() throws Exception {
  225. final RevWalk rw = new RevWalk(db);
  226. for (Ref r : db.getRefDatabase().getRefs()) {
  227. if (Constants.HEAD.equals(r.getName()))
  228. continue;
  229. final RefUpdate u = db.updateRef(r.getName());
  230. u.setForceUpdate(true);
  231. u.delete(rw);
  232. }
  233. }
  234. private void recreateRefs() throws Exception {
  235. final Map<String, Ref> refs = computeNewRefs();
  236. new RefWriter(refs.values()) {
  237. @Override
  238. protected void writeFile(String name, byte[] content)
  239. throws IOException {
  240. final File file = new File(db.getDirectory(), name);
  241. final LockFile lck = new LockFile(file);
  242. if (!lck.lock())
  243. throw new ObjectWritingException(MessageFormat.format(CLIText.get().cantWrite, file));
  244. try {
  245. lck.write(content);
  246. } catch (IOException ioe) {
  247. throw new ObjectWritingException(MessageFormat.format(CLIText.get().cantWrite, file));
  248. }
  249. if (!lck.commit())
  250. throw new ObjectWritingException(MessageFormat.format(CLIText.get().cantWrite, file));
  251. }
  252. }.writePackedRefs();
  253. }
  254. private Map<String, Ref> computeNewRefs() throws IOException {
  255. final Map<String, Ref> refs = new HashMap<>();
  256. try (RevWalk rw = new RevWalk(db);
  257. BufferedReader br = new BufferedReader(
  258. new InputStreamReader(new FileInputStream(refList),
  259. UTF_8))) {
  260. String line;
  261. while ((line = br.readLine()) != null) {
  262. final String[] parts = line.split("[ \t]{1,}"); //$NON-NLS-1$
  263. final ObjectId origId = ObjectId.fromString(parts[0]);
  264. final String type = parts[1];
  265. final String name = parts[2];
  266. ObjectId id = rewrites.get(origId);
  267. if (id == null)
  268. id = origId;
  269. try {
  270. rw.parseAny(id);
  271. } catch (MissingObjectException mue) {
  272. if (!Constants.TYPE_COMMIT.equals(type)) {
  273. errw.println(MessageFormat.format(CLIText.get().skippingObject, type, name));
  274. continue;
  275. }
  276. throw new MissingObjectException(id, type);
  277. }
  278. refs.put(name, new ObjectIdRef.Unpeeled(Ref.Storage.PACKED,
  279. name, id));
  280. }
  281. }
  282. return refs;
  283. }
  284. }