1 /*
2 * Copyright (C) 2010, Christian Halstrick <christian.halstrick@sap.com>
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.treewalk;
44
45 import java.io.File;
46 import java.util.SortedSet;
47 import java.util.TreeSet;
48
49 import org.eclipse.jgit.lib.Config;
50 import org.eclipse.jgit.lib.ObjectReader;
51 import org.eclipse.jgit.lib.Repository;
52 import org.eclipse.jgit.util.FS;
53
54 /**
55 * A {@link FileTreeIterator} used in tests which allows to specify explicitly
56 * what will be returned by {@link #getEntryLastModified()}. This allows to
57 * write tests where certain files have to have the same modification time.
58 * <p>
59 * This iterator is configured by a list of strictly increasing long values
60 * t(0), t(1), ..., t(n). For each file with a modification between t(x) and
61 * t(x+1) [ t(x) <= time < t(x+1) ] this iterator will report t(x). For
62 * files with a modification time smaller t(0) a modification time of 0 is
63 * returned. For files with a modification time greater or equal t(n) t(n) will
64 * be returned.
65 * <p>
66 * This class was written especially to test racy-git problems
67 */
68 public class FileTreeIteratorWithTimeControl extends FileTreeIterator {
69 private TreeSet<Long> modTimes;
70
71 public FileTreeIteratorWithTimeControl(FileTreeIterator p, Repository repo,
72 TreeSet<Long> modTimes) {
73 super(p, repo.getWorkTree(), repo.getFS());
74 this.modTimes = modTimes;
75 }
76
77 public FileTreeIteratorWithTimeControl(FileTreeIterator p, File f, FS fs,
78 TreeSet<Long> modTimes) {
79 super(p, f, fs);
80 this.modTimes = modTimes;
81 }
82
83 public FileTreeIteratorWithTimeControl(Repository repo,
84 TreeSet<Long> modTimes) {
85 super(repo);
86 this.modTimes = modTimes;
87 }
88
89 public FileTreeIteratorWithTimeControl(File f, FS fs,
90 TreeSet<Long> modTimes) {
91 super(f, fs, new Config().get(WorkingTreeOptions.KEY));
92 this.modTimes = modTimes;
93 }
94
95 @Override
96 public AbstractTreeIterator createSubtreeIterator(ObjectReader reader) {
97 return new FileTreeIteratorWithTimeControl(this,
98 ((FileEntry) current()).getFile(), fs, modTimes);
99 }
100
101 @Override
102 public long getEntryLastModified() {
103 if (modTimes == null)
104 return 0;
105 Long cutOff = Long.valueOf(super.getEntryLastModified() + 1);
106 SortedSet<Long> head = modTimes.headSet(cutOff);
107 return head.isEmpty() ? 0 : head.last().longValue();
108 }
109 }