aboutsummaryrefslogtreecommitdiff
path: root/src/jdk/nashorn/internal/runtime/regexp/JdkRegExp.java
blob: f51580215b9eb66beec2832dd963a1ffc07cfeb2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*
 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the LICENSE file that accompanied this code.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

package jdk.nashorn.internal.runtime.regexp;

import jdk.nashorn.internal.runtime.ParserException;

import static java.util.regex.Pattern.CASE_INSENSITIVE;
import static java.util.regex.Pattern.MULTILINE;
import static java.util.regex.Pattern.UNICODE_CASE;

import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.regex.PatternSyntaxException;

/**
 * Default regular expression implementation based on java.util.regex package.
 *
 * Note that this class is not thread-safe as it stores the current match result
 * and the string being matched in instance fields.
 */
public class JdkRegExp extends RegExp {

    /** Java regexp pattern to use for match. We compile to one of these */
    private Pattern pattern;

    /**
     * Construct a Regular expression from the given {@code source} and {@code flags} strings.
     *
     * @param source RegExp source string
     * @param flags RegExp flag string
     * @throws ParserException if flags is invalid or source string has syntax error.
     */
    public JdkRegExp(final String source, final String flags) throws ParserException {
        super(source, flags);

        int intFlags = 0;

        if (isIgnoreCase()) {
            intFlags |= CASE_INSENSITIVE | UNICODE_CASE;
        }
        if (isMultiline()) {
            intFlags |= MULTILINE;
        }

        try {
            RegExpScanner parsed;

            try {
                parsed = RegExpScanner.scan(source);
            } catch (final PatternSyntaxException e) {
                // refine the exception with a better syntax error, if this
                // passes, just rethrow what we have
                Pattern.compile(source, intFlags);
                throw e;
            }

            if (parsed != null) {
                this.pattern = Pattern.compile(parsed.getJavaPattern(), intFlags);
                this.groupsInNegativeLookahead = parsed.getGroupsInNegativeLookahead();
            }
        } catch (final PatternSyntaxException e2) {
            throwParserException("syntax", e2.getMessage());
        }
    }

    @Override
    public RegExpMatcher match(final String str) {
        if (pattern == null) {
            return null; // never matches or similar, e.g. a[]
        }

        return new DefaultMatcher(str);
    }

    class DefaultMatcher implements RegExpMatcher {
        final String input;
        final Matcher defaultMatcher;

        DefaultMatcher(final String input) {
            this.input = input;
            this.defaultMatcher = pattern.matcher(input);
        }

        @Override
        public boolean search(final int start) {
            return defaultMatcher.find(start);
        }

        @Override
        public String getInput() {
            return input;
        }

        @Override
        public int start() {
            return defaultMatcher.start();
        }

        @Override
        public int start(final int group) {
            return defaultMatcher.start(group);
        }

        @Override
        public int end() {
            return defaultMatcher.end();
        }

        @Override
        public int end(final int group) {
            return defaultMatcher.end(group);
        }

        @Override
        public String group() {
            return defaultMatcher.group();
        }

        @Override
        public String group(final int group) {
            return defaultMatcher.group(group);
        }

        @Override
        public int groupCount() {
            return defaultMatcher.groupCount();
        }
    }

}