1 /*
2 * Copyright (C) 2014, Andrey Loskutov <loskutov@gmx.de>
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.ignore.internal;
44
45 import static org.eclipse.jgit.ignore.internal.Strings.getPathSeparator;
46
47 /**
48 * Matcher built from patterns for file names (single path segments). This class
49 * is immutable and thread safe.
50 */
51 public class NameMatcher extends AbstractMatcher {
52
53 final boolean beginning;
54
55 final char slash;
56
57 final String subPattern;
58
59 NameMatcher(String pattern, Character pathSeparator, boolean dirOnly,
60 boolean deleteBackslash) {
61 super(pattern, dirOnly);
62 slash = getPathSeparator(pathSeparator);
63 if (deleteBackslash) {
64 pattern = Strings.deleteBackslash(pattern);
65 }
66 beginning = pattern.length() == 0 ? false : pattern.charAt(0) == slash;
67 if (!beginning) {
68 this.subPattern = pattern;
69 } else {
70 this.subPattern = pattern.substring(1);
71 }
72 }
73
74 /** {@inheritDoc} */
75 @Override
76 public boolean matches(String path, boolean assumeDirectory,
77 boolean pathMatch) {
78 // A NameMatcher's pattern does not contain a slash.
79 int start = 0;
80 int stop = path.length();
81 if (stop > 0 && path.charAt(0) == slash) {
82 start++;
83 }
84 if (pathMatch) {
85 // Can match only after the last slash
86 int lastSlash = path.lastIndexOf(slash, stop - 1);
87 if (lastSlash == stop - 1) {
88 // Skip trailing slash
89 lastSlash = path.lastIndexOf(slash, lastSlash - 1);
90 stop--;
91 }
92 boolean match;
93 if (lastSlash < start) {
94 match = matches(path, start, stop);
95 } else {
96 // Can't match if the path contains a slash if the pattern is
97 // anchored at the beginning
98 match = !beginning
99 && matches(path, lastSlash + 1, stop);
100 }
101 if (match && dirOnly) {
102 match = assumeDirectory;
103 }
104 return match;
105 }
106 while (start < stop) {
107 int end = path.indexOf(slash, start);
108 if (end < 0) {
109 end = stop;
110 }
111 if (end > start && matches(path, start, end)) {
112 // make sure the directory matches: either if we are done with
113 // segment and there is next one, or if the directory is assumed
114 return !dirOnly || assumeDirectory || end < stop;
115 }
116 if (beginning) {
117 break;
118 }
119 start = end + 1;
120 }
121 return false;
122 }
123
124 /** {@inheritDoc} */
125 @Override
126 public boolean matches(String segment, int startIncl, int endExcl) {
127 // faster local access, same as in string.indexOf()
128 String s = subPattern;
129 int length = s.length();
130 if (length != (endExcl - startIncl)) {
131 return false;
132 }
133 for (int i = 0; i < length; i++) {
134 char c1 = s.charAt(i);
135 char c2 = segment.charAt(i + startIncl);
136 if (c1 != c2) {
137 return false;
138 }
139 }
140 return true;
141 }
142
143 }