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.

FileSnapshot.java 7.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249
  1. /*
  2. * Copyright (C) 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.internal.storage.file;
  44. import java.io.File;
  45. /**
  46. * Caches when a file was last read, making it possible to detect future edits.
  47. * <p>
  48. * This object tracks the last modified time of a file. Later during an
  49. * invocation of {@link #isModified(File)} the object will return true if the
  50. * file may have been modified and should be re-read from disk.
  51. * <p>
  52. * A snapshot does not "live update" when the underlying filesystem changes.
  53. * Callers must poll for updates by periodically invoking
  54. * {@link #isModified(File)}.
  55. * <p>
  56. * To work around the "racy git" problem (where a file may be modified multiple
  57. * times within the granularity of the filesystem modification clock) this class
  58. * may return true from isModified(File) if the last modification time of the
  59. * file is less than 3 seconds ago.
  60. */
  61. public class FileSnapshot {
  62. /**
  63. * A FileSnapshot that is considered to always be modified.
  64. * <p>
  65. * This instance is useful for application code that wants to lazily read a
  66. * file, but only after {@link #isModified(File)} gets invoked. The returned
  67. * snapshot contains only invalid status information.
  68. */
  69. public static final FileSnapshot DIRTY = new FileSnapshot(-1, -1);
  70. /**
  71. * A FileSnapshot that is clean if the file does not exist.
  72. * <p>
  73. * This instance is useful if the application wants to consider a missing
  74. * file to be clean. {@link #isModified(File)} will return false if the file
  75. * path does not exist.
  76. */
  77. public static final FileSnapshot MISSING_FILE = new FileSnapshot(0, 0) {
  78. @Override
  79. public boolean isModified(File path) {
  80. return path.exists();
  81. }
  82. };
  83. /**
  84. * Record a snapshot for a specific file path.
  85. * <p>
  86. * This method should be invoked before the file is accessed.
  87. *
  88. * @param path
  89. * the path to later remember. The path's current status
  90. * information is saved.
  91. * @return the snapshot.
  92. */
  93. public static FileSnapshot save(File path) {
  94. final long read = System.currentTimeMillis();
  95. final long modified = path.lastModified();
  96. return new FileSnapshot(read, modified);
  97. }
  98. /**
  99. * Record a snapshot for a file for which the last modification time is
  100. * already known.
  101. * <p>
  102. * This method should be invoked before the file is accessed.
  103. *
  104. * @param modified
  105. * the last modification time of the file
  106. *
  107. * @return the snapshot.
  108. */
  109. public static FileSnapshot save(long modified) {
  110. final long read = System.currentTimeMillis();
  111. return new FileSnapshot(read, modified);
  112. }
  113. /** Last observed modification time of the path. */
  114. private final long lastModified;
  115. /** Last wall-clock time the path was read. */
  116. private volatile long lastRead;
  117. /** True once {@link #lastRead} is far later than {@link #lastModified}. */
  118. private boolean cannotBeRacilyClean;
  119. private FileSnapshot(long read, long modified) {
  120. this.lastRead = read;
  121. this.lastModified = modified;
  122. this.cannotBeRacilyClean = notRacyClean(read);
  123. }
  124. /**
  125. * @return time of last snapshot update
  126. */
  127. public long lastModified() {
  128. return lastModified;
  129. }
  130. /**
  131. * Check if the path may have been modified since the snapshot was saved.
  132. *
  133. * @param path
  134. * the path the snapshot describes.
  135. * @return true if the path needs to be read again.
  136. */
  137. public boolean isModified(File path) {
  138. return isModified(path.lastModified());
  139. }
  140. /**
  141. * Update this snapshot when the content hasn't changed.
  142. * <p>
  143. * If the caller gets true from {@link #isModified(File)}, re-reads the
  144. * content, discovers the content is identical, and
  145. * {@link #equals(FileSnapshot)} is true, it can use
  146. * {@link #setClean(FileSnapshot)} to make a future
  147. * {@link #isModified(File)} return false. The logic goes something like
  148. * this:
  149. *
  150. * <pre>
  151. * if (snapshot.isModified(path)) {
  152. * FileSnapshot other = FileSnapshot.save(path);
  153. * Content newContent = ...;
  154. * if (oldContent.equals(newContent) &amp;&amp; snapshot.equals(other))
  155. * snapshot.setClean(other);
  156. * }
  157. * </pre>
  158. *
  159. * @param other
  160. * the other snapshot.
  161. */
  162. public void setClean(FileSnapshot other) {
  163. final long now = other.lastRead;
  164. if (notRacyClean(now))
  165. cannotBeRacilyClean = true;
  166. lastRead = now;
  167. }
  168. /**
  169. * Compare two snapshots to see if they cache the same information.
  170. *
  171. * @param other
  172. * the other snapshot.
  173. * @return true if the two snapshots share the same information.
  174. */
  175. public boolean equals(FileSnapshot other) {
  176. return lastModified == other.lastModified;
  177. }
  178. @Override
  179. public boolean equals(Object other) {
  180. if (other instanceof FileSnapshot)
  181. return equals((FileSnapshot) other);
  182. return false;
  183. }
  184. @Override
  185. public int hashCode() {
  186. // This is pretty pointless, but override hashCode to ensure that
  187. // x.hashCode() == y.hashCode() when x.equals(y) is true.
  188. //
  189. return (int) lastModified;
  190. }
  191. private boolean notRacyClean(final long read) {
  192. // The last modified time granularity of FAT filesystems is 2 seconds.
  193. // Using 2.5 seconds here provides a reasonably high assurance that
  194. // a modification was not missed.
  195. //
  196. return read - lastModified > 2500;
  197. }
  198. private boolean isModified(final long currLastModified) {
  199. // Any difference indicates the path was modified.
  200. //
  201. if (lastModified != currLastModified)
  202. return true;
  203. // We have already determined the last read was far enough
  204. // after the last modification that any new modifications
  205. // are certain to change the last modified time.
  206. //
  207. if (cannotBeRacilyClean)
  208. return false;
  209. if (notRacyClean(lastRead)) {
  210. // Our last read should have marked cannotBeRacilyClean,
  211. // but this thread may not have seen the change. The read
  212. // of the volatile field lastRead should have fixed that.
  213. //
  214. return false;
  215. }
  216. // Our lastRead flag may be old, refresh and retry
  217. lastRead = System.currentTimeMillis();
  218. if (notRacyClean(lastRead)) {
  219. return false;
  220. }
  221. // We last read this path too close to its last observed
  222. // modification time. We may have missed a modification.
  223. // Scan again, to ensure we still see the same state.
  224. //
  225. return true;
  226. }
  227. }