jdk.nashorn.internal.runtime.regexp.joni.ast.StringNode Java Examples

The following examples show how to use jdk.nashorn.internal.runtime.regexp.joni.ast.StringNode. You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example #1
Source File: ArrayCompiler.java    From openjdk-jdk9 with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthStringNode(final Node node) {
    final StringNode sn = (StringNode)node;
    if (sn.length() <= 0) {
        return 0;
    }
    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;

    int slen = 1;
    int rlen = 0;

    while (p < end) {
        slen++;
        p++;
    }
    final int r = addCompileStringlength(chars, prev, slen, ambig);
    rlen += r;
    return rlen;
}
Example #2
Source File: Parser.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
private Node parseExpTkByte(final boolean group) {
    final StringNode node = new StringNode(chars, token.backP, p); // tk_byte:
    while (true) {
        fetchToken();
        if (token.type != TokenType.STRING) {
            break;
        }

        if (token.backP == node.end) {
            node.end = p; // non escaped character, remain shared, just increase shared range
        } else {
            node.cat(chars, token.backP, p); // non continuous string stream, need to COW
        }
    }
    // targetp = node;
    return parseExpRepeat(node, group); // string_end:, goto repeat
}
Example #3
Source File: ArrayCompiler.java    From hottub with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthStringNode(final Node node) {
    final StringNode sn = (StringNode)node;
    if (sn.length() <= 0) {
        return 0;
    }
    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;

    int slen = 1;
    int rlen = 0;

    while (p < end) {
        slen++;
        p++;
    }
    final int r = addCompileStringlength(chars, prev, slen, ambig);
    rlen += r;
    return rlen;
}
Example #4
Source File: Compiler.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
private void compileStringNode(final StringNode node) {
    final StringNode sn = node;
    if (sn.length() <= 0) {
        return;
    }

    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;
    int slen = 1;

    while (p < end) {
        slen++;
        p++;
    }
    addCompileString(chars, prev, slen, ambig);
}
Example #5
Source File: Parser.java    From jdk8u_nashorn with GNU General Public License v2.0 6 votes vote down vote up 
private Node parseExpTkByte(final boolean group) {
    final StringNode node = new StringNode(chars, token.backP, p); // tk_byte:
    while (true) {
        fetchToken();
        if (token.type != TokenType.STRING) {
            break;
        }

        if (token.backP == node.end) {
            node.end = p; // non escaped character, remain shared, just increase shared range
        } else {
            node.cat(chars, token.backP, p); // non continuous string stream, need to COW
        }
    }
    // targetp = node;
    return parseExpRepeat(node, group); // string_end:, goto repeat
}
Example #6
Source File: Compiler.java    From hottub with GNU General Public License v2.0 6 votes vote down vote up 
private void compileStringNode(final StringNode node) {
    final StringNode sn = node;
    if (sn.length() <= 0) {
        return;
    }

    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;
    int slen = 1;

    while (p < end) {
        slen++;
        p++;
    }
    addCompileString(chars, prev, slen, ambig);
}
Example #7
Source File: Compiler.java    From jdk8u60 with GNU General Public License v2.0 6 votes vote down vote up 
private void compileStringNode(final StringNode node) {
    final StringNode sn = node;
    if (sn.length() <= 0) {
        return;
    }

    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;
    int slen = 1;

    while (p < end) {
        slen++;
        p++;
    }
    addCompileString(chars, prev, slen, ambig);
}
Example #8
Source File: ArrayCompiler.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthStringNode(final Node node) {
    final StringNode sn = (StringNode)node;
    if (sn.length() <= 0) {
        return 0;
    }
    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;

    int slen = 1;
    int rlen = 0;

    while (p < end) {
        slen++;
        p++;
    }
    final int r = addCompileStringlength(chars, prev, slen, ambig);
    rlen += r;
    return rlen;
}
Example #9
Source File: ArrayCompiler.java    From TencentKona-8 with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthStringNode(final Node node) {
    final StringNode sn = (StringNode)node;
    if (sn.length() <= 0) {
        return 0;
    }
    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;

    int slen = 1;
    int rlen = 0;

    while (p < end) {
        slen++;
        p++;
    }
    final int r = addCompileStringlength(chars, prev, slen, ambig);
    rlen += r;
    return rlen;
}
Example #10
Source File: Parser.java    From TencentKona-8 with GNU General Public License v2.0 6 votes vote down vote up 
private Node parseExpTkByte(final boolean group) {
    final StringNode node = new StringNode(chars, token.backP, p); // tk_byte:
    while (true) {
        fetchToken();
        if (token.type != TokenType.STRING) {
            break;
        }

        if (token.backP == node.end) {
            node.end = p; // non escaped character, remain shared, just increase shared range
        } else {
            node.cat(chars, token.backP, p); // non continuous string stream, need to COW
        }
    }
    // targetp = node;
    return parseExpRepeat(node, group); // string_end:, goto repeat
}
Example #11
Source File: ArrayCompiler.java    From openjdk-8-source with GNU General Public License v2.0 6 votes vote down vote up 
private int compileLengthStringNode(Node node) {
    StringNode sn = (StringNode)node;
    if (sn.length() <= 0) return 0;
    boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    int end = sn.end;
    char[] chars = sn.chars;
    p++;

    int slen = 1;
    int rlen = 0;

    while (p < end) {
        slen++;
        p++;
    }
    int r = addCompileStringlength(chars, prev, slen, ambig);
    rlen += r;
    return rlen;
}
Example #12
Source File: Compiler.java    From TencentKona-8 with GNU General Public License v2.0 6 votes vote down vote up 
private void compileStringNode(final StringNode node) {
    final StringNode sn = node;
    if (sn.length() <= 0) {
        return;
    }

    final boolean ambig = sn.isAmbig();

    int p, prev;
    p = prev = sn.p;
    final int end = sn.end;
    final char[] chars = sn.chars;
    p++;
    int slen = 1;

    while (p < end) {
        slen++;
        p++;
    }
    addCompileString(chars, prev, slen, ambig);
}
Example #13
Source File: Parser.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(final boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    final StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #14
Source File: Parser.java    From jdk8u_nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(final boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    final StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #15
Source File: Analyser.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
private Node expandCaseFoldMakeRemString(char[] chars, int p, int end) {
    StringNode node = new StringNode(chars, p, end);

    updateStringNodeCaseFold(node);
    node.setAmbig();
    node.setDontGetOptInfo();
    return node;
}
Example #16
Source File: Analyser.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
private void updateStringNodeCaseFoldMultiByte(final StringNode sn) {
    final char[] ch = sn.chars;
    final int end = sn.end;
    value = sn.p;
    int sp = 0;
    char buf;

    while (value < end) {
        final int ovalue = value;
        buf = EncodingHelper.toLowerCase(ch[value++]);

        if (ch[ovalue] != buf) {

            char[] sbuf = new char[sn.length() << 1];
            System.arraycopy(ch, sn.p, sbuf, 0, ovalue - sn.p);
            value = ovalue;
            while (value < end) {
                buf = EncodingHelper.toLowerCase(ch[value++]);
                if (sp >= sbuf.length) {
                    final char[]tmp = new char[sbuf.length << 1];
                    System.arraycopy(sbuf, 0, tmp, 0, sbuf.length);
                    sbuf = tmp;
                }
                sbuf[sp++] = buf;
            }
            sn.set(sbuf, 0, sp);
            return;
        }
        sp++;
    }
}
Example #17
Source File: Analyser.java    From nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private Node expandCaseFoldMakeRemString(char[] chars, int p, int end) {
    StringNode node = new StringNode(chars, p, end);

    updateStringNodeCaseFold(node);
    node.setAmbig();
    node.setDontGetOptInfo();
    return node;
}
Example #18
Source File: Parser.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(final boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    final StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #19
Source File: Parser.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(final boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    final StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #20
Source File: Analyser.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
private Node expandCaseFoldMakeRemString(final char[] ch, final int pp, final int end) {
    final StringNode node = new StringNode(ch, pp, end);

    updateStringNodeCaseFold(node);
    node.setAmbig();
    node.setDontGetOptInfo();
    return node;
}
Example #21
Source File: Analyser.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
private void updateStringNodeCaseFoldMultiByte(final StringNode sn) {
    final char[] ch = sn.chars;
    final int end = sn.end;
    value = sn.p;
    int sp = 0;
    char buf;

    while (value < end) {
        final int ovalue = value;
        buf = EncodingHelper.toLowerCase(ch[value++]);

        if (ch[ovalue] != buf) {

            char[] sbuf = new char[sn.length() << 1];
            System.arraycopy(ch, sn.p, sbuf, 0, ovalue - sn.p);
            value = ovalue;
            while (value < end) {
                buf = EncodingHelper.toLowerCase(ch[value++]);
                if (sp >= sbuf.length) {
                    final char[]tmp = new char[sbuf.length << 1];
                    System.arraycopy(sbuf, 0, tmp, 0, sbuf.length);
                    sbuf = tmp;
                }
                sbuf[sp++] = buf;
            }
            sn.set(sbuf, 0, sp);
            return;
        }
        sp++;
    }
}
Example #22
Source File: Parser.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(final boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    final StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #23
Source File: Analyser.java    From nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private void updateStringNodeCaseFoldMultiByte(StringNode sn) {
    char[] chars = sn.chars;
    int end = sn.end;
    value = sn.p;
    int sp = 0;
    char buf;

    while (value < end) {
        int ovalue = value;
        buf = Character.toLowerCase(chars[value++]);

        if (chars[ovalue] != buf) {

            char[] sbuf = new char[sn.length() << 1];
            System.arraycopy(chars, sn.p, sbuf, 0, ovalue - sn.p);
            value = ovalue;
            while (value < end) {
                buf = Character.toLowerCase(chars[value++]);
                if (sp >= sbuf.length) {
                    char[]tmp = new char[sbuf.length << 1];
                    System.arraycopy(sbuf, 0, tmp, 0, sbuf.length);
                    sbuf = tmp;
                }
                sbuf[sp++] = buf;
            }
            sn.set(sbuf, 0, sp);
            return;
        }
        sp++;
    }
}
Example #24
Source File: Parser.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(final boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    final StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #25
Source File: Parser.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkByte(boolean group) {
    StringNode node = new StringNode(chars, token.backP, p); // tk_byte:
    while (true) {
        fetchToken();
        if (token.type != TokenType.STRING) break;

        if (token.backP == node.end) {
            node.end = p; // non escaped character, remain shared, just increase shared range
        } else {
            node.cat(chars, token.backP, p); // non continuous string stream, need to COW
        }
    }
    // targetp = node;
    return parseExpRepeat(node, group); // string_end:, goto repeat
}
Example #26
Source File: Analyser.java    From jdk8u_nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private void updateStringNodeCaseFoldMultiByte(final StringNode sn) {
    final char[] ch = sn.chars;
    final int end = sn.end;
    value = sn.p;
    int sp = 0;
    char buf;

    while (value < end) {
        final int ovalue = value;
        buf = EncodingHelper.toLowerCase(ch[value++]);

        if (ch[ovalue] != buf) {

            char[] sbuf = new char[sn.length() << 1];
            System.arraycopy(ch, sn.p, sbuf, 0, ovalue - sn.p);
            value = ovalue;
            while (value < end) {
                buf = EncodingHelper.toLowerCase(ch[value++]);
                if (sp >= sbuf.length) {
                    final char[]tmp = new char[sbuf.length << 1];
                    System.arraycopy(sbuf, 0, tmp, 0, sbuf.length);
                    sbuf = tmp;
                }
                sbuf[sp++] = buf;
            }
            sn.set(sbuf, 0, sp);
            return;
        }
        sp++;
    }
}
Example #27
Source File: Analyser.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
private Node expandCaseFoldMakeRemString(final char[] ch, final int pp, final int end) {
    final StringNode node = new StringNode(ch, pp, end);

    updateStringNodeCaseFold(node);
    node.setAmbig();
    node.setDontGetOptInfo();
    return node;
}
Example #28
Source File: Parser.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkRawByte(boolean group) {
    // tk_raw_byte:

    // important: we don't use 0xff mask here neither in the compiler
    // (in the template string) so we won't have to mask target
    // strings when comparing against them in the matcher
    StringNode node = new StringNode((char)token.getC());
    node.setRaw();

    fetchToken();
    node.clearRaw();
    // !goto string_end;!
    return parseExpRepeat(node, group);
}
Example #29
Source File: Analyser.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
private Node expandCaseFoldMakeRemString(final char[] ch, final int pp, final int end) {
    final StringNode node = new StringNode(ch, pp, end);

    updateStringNodeCaseFold(node);
    node.setAmbig();
    node.setDontGetOptInfo();
    return node;
}
Example #30
Source File: Parser.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
private Node parseExpTkByte(boolean group) {
    StringNode node = new StringNode(chars, token.backP, p); // tk_byte:
    while (true) {
        fetchToken();
        if (token.type != TokenType.STRING) break;

        if (token.backP == node.end) {
            node.end = p; // non escaped character, remain shared, just increase shared range
        } else {
            node.cat(chars, token.backP, p); // non continuous string stream, need to COW
        }
    }
    // targetp = node;
    return parseExpRepeat(node, group); // string_end:, goto repeat
}