@@ -69,7 +69,7 @@ public boolean isClean(Project project, ObjectId treeSha, File file) throws IOEx
69
69
* true if that file is clean relative to that tree. A naive implementation of this
70
70
* could be verrrry slow, so the rest of this is about speeding this up.
71
71
*/
72
- public boolean isClean (Project project , ObjectId treeSha , String relativePath ) throws IOException {
72
+ public boolean isClean (Project project , ObjectId treeSha , String relativePathUnix ) throws IOException {
73
73
Repository repo = repositoryFor (project );
74
74
75
75
// TODO: should be cached-per-repo if it is thread-safe, or per-repo-per-thread if it is not
@@ -81,7 +81,7 @@ public boolean isClean(Project project, ObjectId treeSha, String relativePath) t
81
81
treeWalk .addTree (new DirCacheIterator (dirCache ));
82
82
treeWalk .addTree (new FileTreeIterator (repo ));
83
83
treeWalk .setFilter (AndTreeFilter .create (
84
- PathFilter .create (relativePath ),
84
+ PathFilter .create (relativePathUnix ),
85
85
new IndexDiffFilter (INDEX , WORKDIR )));
86
86
87
87
if (!treeWalk .next ()) {
@@ -108,7 +108,7 @@ public boolean isClean(Project project, ObjectId treeSha, String relativePath) t
108
108
} else if (treeEqualsIndex ) {
109
109
// this means they are all equal to each other, which should never happen
110
110
// the IndexDiffFilter should keep those out of the TreeWalk entirely
111
- throw new IllegalStateException ("Index status for " + relativePath + " against treeSha " + treeSha + " is invalid." );
111
+ throw new IllegalStateException ("Index status for " + relativePathUnix + " against treeSha " + treeSha + " is invalid." );
112
112
} else {
113
113
// they are all unique
114
114
// we have to check manually
0 commit comments