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.

GC.java 31KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970
  1. /*
  2. * Copyright (C) 2012, Christian Halstrick <christian.halstrick@sap.com>
  3. * Copyright (C) 2011, Shawn O. Pearce <spearce@spearce.org>
  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.internal.storage.file;
  45. import static org.eclipse.jgit.internal.storage.pack.PackExt.BITMAP_INDEX;
  46. import static org.eclipse.jgit.internal.storage.pack.PackExt.INDEX;
  47. import static org.eclipse.jgit.lib.RefDatabase.ALL;
  48. import java.io.File;
  49. import java.io.FileOutputStream;
  50. import java.io.IOException;
  51. import java.io.OutputStream;
  52. import java.nio.channels.Channels;
  53. import java.nio.channels.FileChannel;
  54. import java.text.MessageFormat;
  55. import java.text.ParseException;
  56. import java.util.ArrayList;
  57. import java.util.Collection;
  58. import java.util.Collections;
  59. import java.util.Comparator;
  60. import java.util.Date;
  61. import java.util.HashMap;
  62. import java.util.HashSet;
  63. import java.util.Iterator;
  64. import java.util.LinkedList;
  65. import java.util.List;
  66. import java.util.Map;
  67. import java.util.Map.Entry;
  68. import java.util.Set;
  69. import java.util.TreeMap;
  70. import org.eclipse.jgit.dircache.DirCacheIterator;
  71. import org.eclipse.jgit.errors.CorruptObjectException;
  72. import org.eclipse.jgit.errors.IncorrectObjectTypeException;
  73. import org.eclipse.jgit.errors.MissingObjectException;
  74. import org.eclipse.jgit.errors.NoWorkTreeException;
  75. import org.eclipse.jgit.internal.JGitText;
  76. import org.eclipse.jgit.internal.storage.pack.PackExt;
  77. import org.eclipse.jgit.internal.storage.pack.PackWriter;
  78. import org.eclipse.jgit.internal.storage.pack.PackWriter.ObjectIdSet;
  79. import org.eclipse.jgit.lib.AnyObjectId;
  80. import org.eclipse.jgit.lib.ConfigConstants;
  81. import org.eclipse.jgit.lib.Constants;
  82. import org.eclipse.jgit.lib.FileMode;
  83. import org.eclipse.jgit.lib.NullProgressMonitor;
  84. import org.eclipse.jgit.lib.ObjectId;
  85. import org.eclipse.jgit.lib.ProgressMonitor;
  86. import org.eclipse.jgit.lib.Ref;
  87. import org.eclipse.jgit.lib.Ref.Storage;
  88. import org.eclipse.jgit.lib.RefDatabase;
  89. import org.eclipse.jgit.lib.ReflogEntry;
  90. import org.eclipse.jgit.revwalk.ObjectWalk;
  91. import org.eclipse.jgit.revwalk.RevObject;
  92. import org.eclipse.jgit.revwalk.RevWalk;
  93. import org.eclipse.jgit.treewalk.TreeWalk;
  94. import org.eclipse.jgit.treewalk.filter.TreeFilter;
  95. import org.eclipse.jgit.util.FileUtils;
  96. import org.eclipse.jgit.util.GitDateParser;
  97. /**
  98. * A garbage collector for git {@link FileRepository}. Instances of this class
  99. * are not thread-safe. Don't use the same instance from multiple threads.
  100. *
  101. * This class started as a copy of DfsGarbageCollector from Shawn O. Pearce
  102. * adapted to FileRepositories.
  103. */
  104. public class GC {
  105. private static final String PRUNE_EXPIRE_DEFAULT = "2.weeks.ago"; //$NON-NLS-1$
  106. private final FileRepository repo;
  107. private ProgressMonitor pm;
  108. private long expireAgeMillis = -1;
  109. private Date expire;
  110. /**
  111. * the refs which existed during the last call to {@link #repack()}. This is
  112. * needed during {@link #prune(Set)} where we can optimize by looking at the
  113. * difference between the current refs and the refs which existed during
  114. * last {@link #repack()}.
  115. */
  116. private Map<String, Ref> lastPackedRefs;
  117. /**
  118. * Holds the starting time of the last repack() execution. This is needed in
  119. * prune() to inspect only those reflog entries which have been added since
  120. * last repack().
  121. */
  122. private long lastRepackTime;
  123. /**
  124. * Creates a new garbage collector with default values. An expirationTime of
  125. * two weeks and <code>null</code> as progress monitor will be used.
  126. *
  127. * @param repo
  128. * the repo to work on
  129. */
  130. public GC(FileRepository repo) {
  131. this.repo = repo;
  132. this.pm = NullProgressMonitor.INSTANCE;
  133. }
  134. /**
  135. * Runs a garbage collector on a {@link FileRepository}. It will
  136. * <ul>
  137. * <li>pack loose references into packed-refs</li>
  138. * <li>repack all reachable objects into new pack files and delete the old
  139. * pack files</li>
  140. * <li>prune all loose objects which are now reachable by packs</li>
  141. * </ul>
  142. *
  143. * @return the collection of {@link PackFile}'s which are newly created
  144. * @throws IOException
  145. * @throws ParseException
  146. * If the configuration parameter "gc.pruneexpire" couldn't be
  147. * parsed
  148. */
  149. public Collection<PackFile> gc() throws IOException, ParseException {
  150. pm.start(6 /* tasks */);
  151. packRefs();
  152. // TODO: implement reflog_expire(pm, repo);
  153. Collection<PackFile> newPacks = repack();
  154. prune(Collections.<ObjectId> emptySet());
  155. // TODO: implement rerere_gc(pm);
  156. return newPacks;
  157. }
  158. /**
  159. * Delete old pack files. What is 'old' is defined by specifying a set of
  160. * old pack files and a set of new pack files. Each pack file contained in
  161. * old pack files but not contained in new pack files will be deleted.
  162. *
  163. * @param oldPacks
  164. * @param newPacks
  165. */
  166. private void deleteOldPacks(Collection<PackFile> oldPacks,
  167. Collection<PackFile> newPacks) {
  168. oldPackLoop: for (PackFile oldPack : oldPacks) {
  169. String oldName = oldPack.getPackName();
  170. // check whether an old pack file is also among the list of new
  171. // pack files. Then we must not delete it.
  172. for (PackFile newPack : newPacks)
  173. if (oldName.equals(newPack.getPackName()))
  174. continue oldPackLoop;
  175. if (!oldPack.shouldBeKept()) {
  176. oldPack.close();
  177. prunePack(oldName);
  178. }
  179. }
  180. // close the complete object database. Thats my only chance to force
  181. // rescanning and to detect that certain pack files are now deleted.
  182. repo.getObjectDatabase().close();
  183. }
  184. /**
  185. * Delete files associated with a single pack file. First try to delete the
  186. * ".pack" file because on some platforms the ".pack" file may be locked and
  187. * can't be deleted. In such a case it is better to detect this early and
  188. * give up on deleting files for this packfile. Otherwise we may delete the
  189. * ".index" file and when failing to delete the ".pack" file we are left
  190. * with a ".pack" file without a ".index" file.
  191. *
  192. * @param packName
  193. */
  194. private void prunePack(String packName) {
  195. PackExt[] extensions = PackExt.values();
  196. try {
  197. // Delete the .pack file first and if this fails give up on deleting
  198. // the other files
  199. int deleteOptions = FileUtils.RETRY | FileUtils.SKIP_MISSING;
  200. for (PackExt ext : extensions)
  201. if (PackExt.PACK.equals(ext)) {
  202. File f = nameFor(packName, "." + ext.getExtension()); //$NON-NLS-1$
  203. FileUtils.delete(f, deleteOptions);
  204. break;
  205. }
  206. // The .pack file has been deleted. Delete as many as the other
  207. // files as you can.
  208. deleteOptions |= FileUtils.IGNORE_ERRORS;
  209. for (PackExt ext : extensions) {
  210. if (!PackExt.PACK.equals(ext)) {
  211. File f = nameFor(packName, "." + ext.getExtension()); //$NON-NLS-1$
  212. FileUtils.delete(f, deleteOptions);
  213. }
  214. }
  215. } catch (IOException e) {
  216. // Deletion of the .pack file failed. Silently return.
  217. }
  218. }
  219. /**
  220. * Like "git prune-packed" this method tries to prune all loose objects
  221. * which can be found in packs. If certain objects can't be pruned (e.g.
  222. * because the filesystem delete operation fails) this is silently ignored.
  223. *
  224. * @throws IOException
  225. */
  226. public void prunePacked() throws IOException {
  227. ObjectDirectory objdb = repo.getObjectDatabase();
  228. Collection<PackFile> packs = objdb.getPacks();
  229. File objects = repo.getObjectsDirectory();
  230. String[] fanout = objects.list();
  231. if (fanout != null && fanout.length > 0) {
  232. pm.beginTask(JGitText.get().pruneLoosePackedObjects, fanout.length);
  233. try {
  234. for (String d : fanout) {
  235. pm.update(1);
  236. if (d.length() != 2)
  237. continue;
  238. String[] entries = new File(objects, d).list();
  239. if (entries == null)
  240. continue;
  241. for (String e : entries) {
  242. if (e.length() != Constants.OBJECT_ID_STRING_LENGTH - 2)
  243. continue;
  244. ObjectId id;
  245. try {
  246. id = ObjectId.fromString(d + e);
  247. } catch (IllegalArgumentException notAnObject) {
  248. // ignoring the file that does not represent loose
  249. // object
  250. continue;
  251. }
  252. boolean found = false;
  253. for (PackFile p : packs)
  254. if (p.hasObject(id)) {
  255. found = true;
  256. break;
  257. }
  258. if (found)
  259. FileUtils.delete(objdb.fileFor(id), FileUtils.RETRY
  260. | FileUtils.SKIP_MISSING
  261. | FileUtils.IGNORE_ERRORS);
  262. }
  263. }
  264. } finally {
  265. pm.endTask();
  266. }
  267. }
  268. }
  269. /**
  270. * Like "git prune" this method tries to prune all loose objects which are
  271. * unreferenced. If certain objects can't be pruned (e.g. because the
  272. * filesystem delete operation fails) this is silently ignored.
  273. *
  274. * @param objectsToKeep
  275. * a set of objects which should explicitly not be pruned
  276. *
  277. * @throws IOException
  278. * @throws ParseException
  279. * If the configuration parameter "gc.pruneexpire" couldn't be
  280. * parsed
  281. */
  282. public void prune(Set<ObjectId> objectsToKeep) throws IOException,
  283. ParseException {
  284. long expireDate = Long.MAX_VALUE;
  285. if (expire == null && expireAgeMillis == -1) {
  286. String pruneExpireStr = repo.getConfig().getString(
  287. ConfigConstants.CONFIG_GC_SECTION, null,
  288. ConfigConstants.CONFIG_KEY_PRUNEEXPIRE);
  289. if (pruneExpireStr == null)
  290. pruneExpireStr = PRUNE_EXPIRE_DEFAULT;
  291. expire = GitDateParser.parse(pruneExpireStr, null);
  292. expireAgeMillis = -1;
  293. }
  294. if (expire != null)
  295. expireDate = expire.getTime();
  296. if (expireAgeMillis != -1)
  297. expireDate = System.currentTimeMillis() - expireAgeMillis;
  298. // Collect all loose objects which are old enough, not referenced from
  299. // the index and not in objectsToKeep
  300. Map<ObjectId, File> deletionCandidates = new HashMap<ObjectId, File>();
  301. Set<ObjectId> indexObjects = null;
  302. File objects = repo.getObjectsDirectory();
  303. String[] fanout = objects.list();
  304. if (fanout != null && fanout.length > 0) {
  305. pm.beginTask(JGitText.get().pruneLooseUnreferencedObjects,
  306. fanout.length);
  307. try {
  308. for (String d : fanout) {
  309. pm.update(1);
  310. if (d.length() != 2)
  311. continue;
  312. File[] entries = new File(objects, d).listFiles();
  313. if (entries == null)
  314. continue;
  315. for (File f : entries) {
  316. String fName = f.getName();
  317. if (fName.length() != Constants.OBJECT_ID_STRING_LENGTH - 2)
  318. continue;
  319. if (f.lastModified() >= expireDate)
  320. continue;
  321. try {
  322. ObjectId id = ObjectId.fromString(d + fName);
  323. if (objectsToKeep.contains(id))
  324. continue;
  325. if (indexObjects == null)
  326. indexObjects = listNonHEADIndexObjects();
  327. if (indexObjects.contains(id))
  328. continue;
  329. deletionCandidates.put(id, f);
  330. } catch (IllegalArgumentException notAnObject) {
  331. // ignoring the file that does not represent loose
  332. // object
  333. continue;
  334. }
  335. }
  336. }
  337. } finally {
  338. pm.endTask();
  339. }
  340. }
  341. if (deletionCandidates.isEmpty())
  342. return;
  343. // From the set of current refs remove all those which have been handled
  344. // during last repack(). Only those refs will survive which have been
  345. // added or modified since the last repack. Only these can save existing
  346. // loose refs from being pruned.
  347. Map<String, Ref> newRefs;
  348. if (lastPackedRefs == null || lastPackedRefs.isEmpty())
  349. newRefs = getAllRefs();
  350. else {
  351. newRefs = new HashMap<String, Ref>();
  352. for (Iterator<Map.Entry<String, Ref>> i = getAllRefs().entrySet()
  353. .iterator(); i.hasNext();) {
  354. Entry<String, Ref> newEntry = i.next();
  355. Ref old = lastPackedRefs.get(newEntry.getKey());
  356. if (!equals(newEntry.getValue(), old))
  357. newRefs.put(newEntry.getKey(), newEntry.getValue());
  358. }
  359. }
  360. if (!newRefs.isEmpty()) {
  361. // There are new/modified refs! Check which loose objects are now
  362. // referenced by these modified refs (or their reflogentries).
  363. // Remove these loose objects
  364. // from the deletionCandidates. When the last candidate is removed
  365. // leave this method.
  366. ObjectWalk w = new ObjectWalk(repo);
  367. try {
  368. for (Ref cr : newRefs.values())
  369. w.markStart(w.parseAny(cr.getObjectId()));
  370. if (lastPackedRefs != null)
  371. for (Ref lpr : lastPackedRefs.values())
  372. w.markUninteresting(w.parseAny(lpr.getObjectId()));
  373. removeReferenced(deletionCandidates, w);
  374. } finally {
  375. w.dispose();
  376. }
  377. }
  378. if (deletionCandidates.isEmpty())
  379. return;
  380. // Since we have not left the method yet there are still
  381. // deletionCandidates. Last chance for these objects not to be pruned is
  382. // that they are referenced by reflog entries. Even refs which currently
  383. // point to the same object as during last repack() may have
  384. // additional reflog entries not handled during last repack()
  385. ObjectWalk w = new ObjectWalk(repo);
  386. try {
  387. for (Ref ar : getAllRefs().values())
  388. for (ObjectId id : listRefLogObjects(ar, lastRepackTime))
  389. w.markStart(w.parseAny(id));
  390. if (lastPackedRefs != null)
  391. for (Ref lpr : lastPackedRefs.values())
  392. w.markUninteresting(w.parseAny(lpr.getObjectId()));
  393. removeReferenced(deletionCandidates, w);
  394. } finally {
  395. w.dispose();
  396. }
  397. if (deletionCandidates.isEmpty())
  398. return;
  399. // delete all candidates which have survived: these are unreferenced
  400. // loose objects
  401. for (File f : deletionCandidates.values())
  402. f.delete();
  403. repo.getObjectDatabase().close();
  404. }
  405. /**
  406. * Remove all entries from a map which key is the id of an object referenced
  407. * by the given ObjectWalk
  408. *
  409. * @param id2File
  410. * @param w
  411. * @throws MissingObjectException
  412. * @throws IncorrectObjectTypeException
  413. * @throws IOException
  414. */
  415. private void removeReferenced(Map<ObjectId, File> id2File,
  416. ObjectWalk w) throws MissingObjectException,
  417. IncorrectObjectTypeException, IOException {
  418. RevObject ro = w.next();
  419. while (ro != null) {
  420. if (id2File.remove(ro.getId()) != null)
  421. if (id2File.isEmpty())
  422. return;
  423. ro = w.next();
  424. }
  425. ro = w.nextObject();
  426. while (ro != null) {
  427. if (id2File.remove(ro.getId()) != null)
  428. if (id2File.isEmpty())
  429. return;
  430. ro = w.nextObject();
  431. }
  432. }
  433. private static boolean equals(Ref r1, Ref r2) {
  434. if (r1 == null || r2 == null)
  435. return false;
  436. if (r1.isSymbolic()) {
  437. if (!r2.isSymbolic())
  438. return false;
  439. return r1.getTarget().getName().equals(r2.getTarget().getName());
  440. } else {
  441. if (r2.isSymbolic())
  442. return false;
  443. return r1.getObjectId().equals(r2.getObjectId());
  444. }
  445. }
  446. /**
  447. * Packs all non-symbolic, loose refs into packed-refs.
  448. *
  449. * @throws IOException
  450. */
  451. public void packRefs() throws IOException {
  452. Collection<Ref> refs = repo.getRefDatabase().getRefs(ALL).values();
  453. List<String> refsToBePacked = new ArrayList<String>(refs.size());
  454. pm.beginTask(JGitText.get().packRefs, refs.size());
  455. try {
  456. for (Ref ref : refs) {
  457. if (!ref.isSymbolic() && ref.getStorage().isLoose())
  458. refsToBePacked.add(ref.getName());
  459. pm.update(1);
  460. }
  461. ((RefDirectory) repo.getRefDatabase()).pack(refsToBePacked);
  462. } finally {
  463. pm.endTask();
  464. }
  465. }
  466. /**
  467. * Packs all objects which reachable from any of the heads into one pack
  468. * file. Additionally all objects which are not reachable from any head but
  469. * which are reachable from any of the other refs (e.g. tags), special refs
  470. * (e.g. FETCH_HEAD) or index are packed into a separate pack file. Objects
  471. * included in pack files which have a .keep file associated are never
  472. * repacked. All old pack files which existed before are deleted.
  473. *
  474. * @return a collection of the newly created pack files
  475. * @throws IOException
  476. * when during reading of refs, index, packfiles, objects,
  477. * reflog-entries or during writing to the packfiles
  478. * {@link IOException} occurs
  479. */
  480. public Collection<PackFile> repack() throws IOException {
  481. Collection<PackFile> toBeDeleted = repo.getObjectDatabase().getPacks();
  482. long time = System.currentTimeMillis();
  483. Map<String, Ref> refsBefore = getAllRefs();
  484. Set<ObjectId> allHeads = new HashSet<ObjectId>();
  485. Set<ObjectId> nonHeads = new HashSet<ObjectId>();
  486. Set<ObjectId> tagTargets = new HashSet<ObjectId>();
  487. Set<ObjectId> indexObjects = listNonHEADIndexObjects();
  488. for (Ref ref : refsBefore.values()) {
  489. nonHeads.addAll(listRefLogObjects(ref, 0));
  490. if (ref.isSymbolic() || ref.getObjectId() == null)
  491. continue;
  492. if (ref.getName().startsWith(Constants.R_HEADS))
  493. allHeads.add(ref.getObjectId());
  494. else
  495. nonHeads.add(ref.getObjectId());
  496. if (ref.getPeeledObjectId() != null)
  497. tagTargets.add(ref.getPeeledObjectId());
  498. }
  499. List<ObjectIdSet> excluded = new LinkedList<ObjectIdSet>();
  500. for (final PackFile f : repo.getObjectDatabase().getPacks())
  501. if (f.shouldBeKept())
  502. excluded.add(objectIdSet(f.getIndex()));
  503. tagTargets.addAll(allHeads);
  504. nonHeads.addAll(indexObjects);
  505. List<PackFile> ret = new ArrayList<PackFile>(2);
  506. PackFile heads = null;
  507. if (!allHeads.isEmpty()) {
  508. heads = writePack(allHeads, Collections.<ObjectId> emptySet(),
  509. tagTargets, excluded);
  510. if (heads != null) {
  511. ret.add(heads);
  512. excluded.add(0, objectIdSet(heads.getIndex()));
  513. }
  514. }
  515. if (!nonHeads.isEmpty()) {
  516. PackFile rest = writePack(nonHeads, allHeads, tagTargets, excluded);
  517. if (rest != null)
  518. ret.add(rest);
  519. }
  520. deleteOldPacks(toBeDeleted, ret);
  521. prunePacked();
  522. lastPackedRefs = refsBefore;
  523. lastRepackTime = time;
  524. return ret;
  525. }
  526. /**
  527. * @param ref
  528. * the ref which log should be inspected
  529. * @param minTime only reflog entries not older then this time are processed
  530. * @return the {@link ObjectId}s contained in the reflog
  531. * @throws IOException
  532. */
  533. private Set<ObjectId> listRefLogObjects(Ref ref, long minTime) throws IOException {
  534. List<ReflogEntry> rlEntries = repo.getReflogReader(ref.getName())
  535. .getReverseEntries();
  536. if (rlEntries == null || rlEntries.isEmpty())
  537. return Collections.<ObjectId> emptySet();
  538. Set<ObjectId> ret = new HashSet<ObjectId>();
  539. for (ReflogEntry e : rlEntries) {
  540. if (e.getWho().getWhen().getTime() < minTime)
  541. break;
  542. ObjectId newId = e.getNewId();
  543. if (newId != null && !ObjectId.zeroId().equals(newId))
  544. ret.add(newId);
  545. ObjectId oldId = e.getOldId();
  546. if (oldId != null && !ObjectId.zeroId().equals(oldId))
  547. ret.add(oldId);
  548. }
  549. return ret;
  550. }
  551. /**
  552. * Returns a map of all refs and additional refs (e.g. FETCH_HEAD,
  553. * MERGE_HEAD, ...)
  554. *
  555. * @return a map where names of refs point to ref objects
  556. * @throws IOException
  557. */
  558. private Map<String, Ref> getAllRefs() throws IOException {
  559. Map<String, Ref> ret = repo.getRefDatabase().getRefs(ALL);
  560. for (Ref ref : repo.getRefDatabase().getAdditionalRefs())
  561. ret.put(ref.getName(), ref);
  562. return ret;
  563. }
  564. /**
  565. * Return a list of those objects in the index which differ from whats in
  566. * HEAD
  567. *
  568. * @return a set of ObjectIds of changed objects in the index
  569. * @throws IOException
  570. * @throws CorruptObjectException
  571. * @throws NoWorkTreeException
  572. */
  573. private Set<ObjectId> listNonHEADIndexObjects()
  574. throws CorruptObjectException, IOException {
  575. RevWalk revWalk = null;
  576. try {
  577. if (repo.getIndexFile() == null)
  578. return Collections.emptySet();
  579. } catch (NoWorkTreeException e) {
  580. return Collections.emptySet();
  581. }
  582. TreeWalk treeWalk = new TreeWalk(repo);
  583. try {
  584. treeWalk.addTree(new DirCacheIterator(repo.readDirCache()));
  585. ObjectId headID = repo.resolve(Constants.HEAD);
  586. if (headID != null) {
  587. revWalk = new RevWalk(repo);
  588. treeWalk.addTree(revWalk.parseTree(headID));
  589. revWalk.dispose();
  590. revWalk = null;
  591. }
  592. treeWalk.setFilter(TreeFilter.ANY_DIFF);
  593. treeWalk.setRecursive(true);
  594. Set<ObjectId> ret = new HashSet<ObjectId>();
  595. while (treeWalk.next()) {
  596. ObjectId objectId = treeWalk.getObjectId(0);
  597. switch (treeWalk.getRawMode(0) & FileMode.TYPE_MASK) {
  598. case FileMode.TYPE_MISSING:
  599. case FileMode.TYPE_GITLINK:
  600. continue;
  601. case FileMode.TYPE_TREE:
  602. case FileMode.TYPE_FILE:
  603. case FileMode.TYPE_SYMLINK:
  604. ret.add(objectId);
  605. continue;
  606. default:
  607. throw new IOException(MessageFormat.format(
  608. JGitText.get().corruptObjectInvalidMode3,
  609. String.format("%o", //$NON-NLS-1$
  610. Integer.valueOf(treeWalk.getRawMode(0))),
  611. (objectId == null) ? "null" : objectId.name(), //$NON-NLS-1$
  612. treeWalk.getPathString(), //
  613. repo.getIndexFile()));
  614. }
  615. }
  616. return ret;
  617. } finally {
  618. if (revWalk != null)
  619. revWalk.dispose();
  620. treeWalk.release();
  621. }
  622. }
  623. private PackFile writePack(Set<? extends ObjectId> want,
  624. Set<? extends ObjectId> have, Set<ObjectId> tagTargets,
  625. List<ObjectIdSet> excludeObjects) throws IOException {
  626. File tmpPack = null;
  627. Map<PackExt, File> tmpExts = new TreeMap<PackExt, File>(
  628. new Comparator<PackExt>() {
  629. public int compare(PackExt o1, PackExt o2) {
  630. // INDEX entries must be returned last, so the pack
  631. // scanner does pick up the new pack until all the
  632. // PackExt entries have been written.
  633. if (o1 == o2)
  634. return 0;
  635. if (o1 == PackExt.INDEX)
  636. return 1;
  637. if (o2 == PackExt.INDEX)
  638. return -1;
  639. return Integer.signum(o1.hashCode() - o2.hashCode());
  640. }
  641. });
  642. PackWriter pw = new PackWriter(repo);
  643. try {
  644. // prepare the PackWriter
  645. pw.setDeltaBaseAsOffset(true);
  646. pw.setReuseDeltaCommits(false);
  647. if (tagTargets != null)
  648. pw.setTagTargets(tagTargets);
  649. if (excludeObjects != null)
  650. for (ObjectIdSet idx : excludeObjects)
  651. pw.excludeObjects(idx);
  652. pw.preparePack(pm, want, have);
  653. if (pw.getObjectCount() == 0)
  654. return null;
  655. // create temporary files
  656. String id = pw.computeName().getName();
  657. File packdir = new File(repo.getObjectsDirectory(), "pack"); //$NON-NLS-1$
  658. tmpPack = File.createTempFile("gc_", ".pack_tmp", packdir); //$NON-NLS-1$ //$NON-NLS-2$
  659. final String tmpBase = tmpPack.getName()
  660. .substring(0, tmpPack.getName().lastIndexOf('.'));
  661. File tmpIdx = new File(packdir, tmpBase + ".idx_tmp"); //$NON-NLS-1$
  662. tmpExts.put(INDEX, tmpIdx);
  663. if (!tmpIdx.createNewFile())
  664. throw new IOException(MessageFormat.format(
  665. JGitText.get().cannotCreateIndexfile, tmpIdx.getPath()));
  666. // write the packfile
  667. @SuppressWarnings("resource" /* java 7 */)
  668. FileChannel channel = new FileOutputStream(tmpPack).getChannel();
  669. OutputStream channelStream = Channels.newOutputStream(channel);
  670. try {
  671. pw.writePack(pm, pm, channelStream);
  672. } finally {
  673. channel.force(true);
  674. channelStream.close();
  675. channel.close();
  676. }
  677. // write the packindex
  678. FileChannel idxChannel = new FileOutputStream(tmpIdx).getChannel();
  679. OutputStream idxStream = Channels.newOutputStream(idxChannel);
  680. try {
  681. pw.writeIndex(idxStream);
  682. } finally {
  683. idxChannel.force(true);
  684. idxStream.close();
  685. idxChannel.close();
  686. }
  687. if (pw.prepareBitmapIndex(pm)) {
  688. File tmpBitmapIdx = new File(packdir, tmpBase + ".bitmap_tmp"); //$NON-NLS-1$
  689. tmpExts.put(BITMAP_INDEX, tmpBitmapIdx);
  690. if (!tmpBitmapIdx.createNewFile())
  691. throw new IOException(MessageFormat.format(
  692. JGitText.get().cannotCreateIndexfile,
  693. tmpBitmapIdx.getPath()));
  694. idxChannel = new FileOutputStream(tmpBitmapIdx).getChannel();
  695. idxStream = Channels.newOutputStream(idxChannel);
  696. try {
  697. pw.writeBitmapIndex(idxStream);
  698. } finally {
  699. idxChannel.force(true);
  700. idxStream.close();
  701. idxChannel.close();
  702. }
  703. }
  704. // rename the temporary files to real files
  705. File realPack = nameFor(id, ".pack"); //$NON-NLS-1$
  706. // if the packfile already exists (because we are rewriting a
  707. // packfile for the same set of objects maybe with different
  708. // PackConfig) then make sure we get rid of all handles on the file.
  709. // Windows will not allow for rename otherwise.
  710. if (realPack.exists())
  711. for (PackFile p : repo.getObjectDatabase().getPacks())
  712. if (realPack.getPath().equals(p.getPackFile().getPath())) {
  713. p.close();
  714. break;
  715. }
  716. tmpPack.setReadOnly();
  717. boolean delete = true;
  718. try {
  719. FileUtils.rename(tmpPack, realPack);
  720. delete = false;
  721. for (Map.Entry<PackExt, File> tmpEntry : tmpExts.entrySet()) {
  722. File tmpExt = tmpEntry.getValue();
  723. tmpExt.setReadOnly();
  724. File realExt = nameFor(
  725. id, "." + tmpEntry.getKey().getExtension()); //$NON-NLS-1$
  726. try {
  727. FileUtils.rename(tmpExt, realExt);
  728. } catch (IOException e) {
  729. File newExt = new File(realExt.getParentFile(),
  730. realExt.getName() + ".new"); //$NON-NLS-1$
  731. if (!tmpExt.renameTo(newExt))
  732. newExt = tmpExt;
  733. throw new IOException(MessageFormat.format(
  734. JGitText.get().panicCantRenameIndexFile, newExt,
  735. realExt));
  736. }
  737. }
  738. } finally {
  739. if (delete) {
  740. if (tmpPack.exists())
  741. tmpPack.delete();
  742. for (File tmpExt : tmpExts.values()) {
  743. if (tmpExt.exists())
  744. tmpExt.delete();
  745. }
  746. }
  747. }
  748. return repo.getObjectDatabase().openPack(realPack);
  749. } finally {
  750. pw.release();
  751. if (tmpPack != null && tmpPack.exists())
  752. tmpPack.delete();
  753. for (File tmpExt : tmpExts.values()) {
  754. if (tmpExt.exists())
  755. tmpExt.delete();
  756. }
  757. }
  758. }
  759. private File nameFor(String name, String ext) {
  760. File packdir = new File(repo.getObjectsDirectory(), "pack"); //$NON-NLS-1$
  761. return new File(packdir, "pack-" + name + ext); //$NON-NLS-1$
  762. }
  763. /**
  764. * A class holding statistical data for a FileRepository regarding how many
  765. * objects are stored as loose or packed objects
  766. */
  767. public class RepoStatistics {
  768. /**
  769. * The number of objects stored in pack files. If the same object is
  770. * stored in multiple pack files then it is counted as often as it
  771. * occurs in pack files.
  772. */
  773. public long numberOfPackedObjects;
  774. /**
  775. * The number of pack files
  776. */
  777. public long numberOfPackFiles;
  778. /**
  779. * The number of objects stored as loose objects.
  780. */
  781. public long numberOfLooseObjects;
  782. /**
  783. * The sum of the sizes of all files used to persist loose objects.
  784. */
  785. public long sizeOfLooseObjects;
  786. /**
  787. * The sum of the sizes of all pack files.
  788. */
  789. public long sizeOfPackedObjects;
  790. /**
  791. * The number of loose refs.
  792. */
  793. public long numberOfLooseRefs;
  794. /**
  795. * The number of refs stored in pack files.
  796. */
  797. public long numberOfPackedRefs;
  798. public String toString() {
  799. final StringBuilder b = new StringBuilder();
  800. b.append("numberOfPackedObjects=").append(numberOfPackedObjects); //$NON-NLS-1$
  801. b.append(", numberOfPackFiles=").append(numberOfPackFiles); //$NON-NLS-1$
  802. b.append(", numberOfLooseObjects=").append(numberOfLooseObjects); //$NON-NLS-1$
  803. b.append(", numberOfLooseRefs=").append(numberOfLooseRefs); //$NON-NLS-1$
  804. b.append(", numberOfPackedRefs=").append(numberOfPackedRefs); //$NON-NLS-1$
  805. b.append(", sizeOfLooseObjects=").append(sizeOfLooseObjects); //$NON-NLS-1$
  806. b.append(", sizeOfPackedObjects=").append(sizeOfPackedObjects); //$NON-NLS-1$
  807. return b.toString();
  808. }
  809. }
  810. /**
  811. * Returns the number of objects stored in pack files. If an object is
  812. * contained in multiple pack files it is counted as often as it occurs.
  813. *
  814. * @return the number of objects stored in pack files
  815. * @throws IOException
  816. */
  817. public RepoStatistics getStatistics() throws IOException {
  818. RepoStatistics ret = new RepoStatistics();
  819. Collection<PackFile> packs = repo.getObjectDatabase().getPacks();
  820. for (PackFile f : packs) {
  821. ret.numberOfPackedObjects += f.getIndex().getObjectCount();
  822. ret.numberOfPackFiles++;
  823. ret.sizeOfPackedObjects += f.getPackFile().length();
  824. }
  825. File objDir = repo.getObjectsDirectory();
  826. String[] fanout = objDir.list();
  827. if (fanout != null && fanout.length > 0) {
  828. for (String d : fanout) {
  829. if (d.length() != 2)
  830. continue;
  831. File[] entries = new File(objDir, d).listFiles();
  832. if (entries == null)
  833. continue;
  834. for (File f : entries) {
  835. if (f.getName().length() != Constants.OBJECT_ID_STRING_LENGTH - 2)
  836. continue;
  837. ret.numberOfLooseObjects++;
  838. ret.sizeOfLooseObjects += f.length();
  839. }
  840. }
  841. }
  842. RefDatabase refDb = repo.getRefDatabase();
  843. for (Ref r : refDb.getRefs(RefDatabase.ALL).values()) {
  844. Storage storage = r.getStorage();
  845. if (storage == Storage.LOOSE || storage == Storage.LOOSE_PACKED)
  846. ret.numberOfLooseRefs++;
  847. if (storage == Storage.PACKED || storage == Storage.LOOSE_PACKED)
  848. ret.numberOfPackedRefs++;
  849. }
  850. return ret;
  851. }
  852. /**
  853. * Set the progress monitor used for garbage collection methods.
  854. *
  855. * @param pm
  856. * @return this
  857. */
  858. public GC setProgressMonitor(ProgressMonitor pm) {
  859. this.pm = (pm == null) ? NullProgressMonitor.INSTANCE : pm;
  860. return this;
  861. }
  862. /**
  863. * During gc() or prune() each unreferenced, loose object which has been
  864. * created or modified in the last <code>expireAgeMillis</code> milliseconds
  865. * will not be pruned. Only older objects may be pruned. If set to 0 then
  866. * every object is a candidate for pruning.
  867. *
  868. * @param expireAgeMillis
  869. * minimal age of objects to be pruned in milliseconds.
  870. */
  871. public void setExpireAgeMillis(long expireAgeMillis) {
  872. this.expireAgeMillis = expireAgeMillis;
  873. expire = null;
  874. }
  875. /**
  876. * During gc() or prune() each unreferenced, loose object which has been
  877. * created or modified after or at <code>expire</code> will not be pruned.
  878. * Only older objects may be pruned. If set to null then every object is a
  879. * candidate for pruning.
  880. *
  881. * @param expire
  882. * instant in time which defines object expiration
  883. * objects with modification time before this instant are expired
  884. * objects with modification time newer or equal to this instant
  885. * are not expired
  886. */
  887. public void setExpire(Date expire) {
  888. this.expire = expire;
  889. expireAgeMillis = -1;
  890. }
  891. private static ObjectIdSet objectIdSet(final PackIndex idx) {
  892. return new ObjectIdSet() {
  893. public boolean contains(AnyObjectId objectId) {
  894. return idx.hasObject(objectId);
  895. }
  896. };
  897. }
  898. }