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

The following examples show how to use jdk.nashorn.internal.runtime.regexp.joni.ast.BackRefNode. 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 TencentKona-8 with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #2
Source File: ArrayCompiler.java    From hottub with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #3
Source File: ArrayCompiler.java    From openjdk-jdk9 with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #4
Source File: ArrayCompiler.java    From openjdk-8-source with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #5
Source File: ArrayCompiler.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #6
Source File: ArrayCompiler.java    From openjdk-8 with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #7
Source File: ArrayCompiler.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #8
Source File: ArrayCompiler.java    From jdk8u_nashorn with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #9
Source File: ArrayCompiler.java    From jdk8u60 with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(final BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #10
Source File: ArrayCompiler.java    From nashorn with GNU General Public License v2.0 6 votes vote down vote up 
@Override
protected void compileBackrefNode(BackRefNode node) {
    if (isIgnoreCase(regex.options)) {
        addOpcode(OPCode.BACKREFN_IC);
        addMemNum(node.backRef);
    } else {
        switch (node.backRef) {
            case 1:
                addOpcode(OPCode.BACKREF1);
                break;
            case 2:
                addOpcode(OPCode.BACKREF2);
                break;
            default:
                addOpcode(OPCode.BACKREFN);
                addOpcode(node.backRef);
                break;
        } // switch
    }
}
Example #11
Source File: Analyser.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
private int getMinMatchLength(Node node) {
    int min = 0;

    switch (node.getType()) {
    case NodeType.BREF:
        BackRefNode br = (BackRefNode)node;
        if (br.isRecursion()) break;

        if (br.backRef > env.numMem) {
            throw new ValueException(ERR_INVALID_BACKREF);
        }
        min = getMinMatchLength(env.memNodes[br.backRef]);

        break;

    case NodeType.LIST:
        ConsAltNode can = (ConsAltNode)node;
        do {
            min += getMinMatchLength(can.car);
        } while ((can = can.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode y = (ConsAltNode)node;
        do {
            Node x = y.car;
            int tmin = getMinMatchLength(x);
            if (y == node) {
                min = tmin;
            } else if (min > tmin) {
                min = tmin;
            }
        } while ((y = y.cdr) != null);
        break;

    case NodeType.STR:
        min = ((StringNode)node).length();
        break;

    case NodeType.CTYPE:
        min = 1;
        break;

    case NodeType.CCLASS:
    case NodeType.CANY:
        min = 1;
        break;

    case NodeType.QTFR:
        QuantifierNode qn = (QuantifierNode)node;
        if (qn.lower > 0) {
            min = getMinMatchLength(qn.target);
            min = MinMaxLen.distanceMultiply(min, qn.lower);
        }
        break;

    case NodeType.ENCLOSE:
        EncloseNode en = (EncloseNode)node;
        switch (en.type) {
        case EncloseType.MEMORY:
            if (en.isMinFixed()) {
                min = en.minLength;
            } else {
                min = getMinMatchLength(en.target);
                en.minLength = min;
                en.setMinFixed();
            }
            break;

        case EncloseType.OPTION:
        case EncloseType.STOP_BACKTRACK:
            min = getMinMatchLength(en.target);
            break;
        } // inner switch
        break;

    case NodeType.ANCHOR:
    default:
        break;
    } // switch

    return min;
}
Example #12
Source File: Analyser.java    From nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private int getMinMatchLength(Node node) {
    int min = 0;

    switch (node.getType()) {
    case NodeType.BREF:
        BackRefNode br = (BackRefNode)node;
        if (br.isRecursion()) break;

        if (br.backRef > env.numMem) {
            throw new ValueException(ERR_INVALID_BACKREF);
        }
        min = getMinMatchLength(env.memNodes[br.backRef]);

        break;

    case NodeType.LIST:
        ConsAltNode can = (ConsAltNode)node;
        do {
            min += getMinMatchLength(can.car);
        } while ((can = can.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode y = (ConsAltNode)node;
        do {
            Node x = y.car;
            int tmin = getMinMatchLength(x);
            if (y == node) {
                min = tmin;
            } else if (min > tmin) {
                min = tmin;
            }
        } while ((y = y.cdr) != null);
        break;

    case NodeType.STR:
        min = ((StringNode)node).length();
        break;

    case NodeType.CTYPE:
        min = 1;
        break;

    case NodeType.CCLASS:
    case NodeType.CANY:
        min = 1;
        break;

    case NodeType.QTFR:
        QuantifierNode qn = (QuantifierNode)node;
        if (qn.lower > 0) {
            min = getMinMatchLength(qn.target);
            min = MinMaxLen.distanceMultiply(min, qn.lower);
        }
        break;

    case NodeType.ENCLOSE:
        EncloseNode en = (EncloseNode)node;
        switch (en.type) {
        case EncloseType.MEMORY:
            if (en.isMinFixed()) {
                min = en.minLength;
            } else {
                min = getMinMatchLength(en.target);
                en.minLength = min;
                en.setMinFixed();
            }
            break;

        case EncloseType.OPTION:
        case EncloseType.STOP_BACKTRACK:
            min = getMinMatchLength(en.target);
            break;
        } // inner switch
        break;

    case NodeType.ANCHOR:
    default:
        break;
    } // switch

    return min;
}
Example #13
Source File: ArrayCompiler.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(final Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}
Example #14
Source File: Compiler.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(final Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        final EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #15
Source File: Analyser.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
private int getMinMatchLength(final Node node) {
    int min = 0;

    switch (node.getType()) {
    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;
        if (br.isRecursion()) {
            break;
        }

        if (br.backRef > env.numMem) {
            throw new ValueException(ERR_INVALID_BACKREF);
        }
        min = getMinMatchLength(env.memNodes[br.backRef]);

        break;

    case NodeType.LIST:
        ConsAltNode can = (ConsAltNode)node;
        do {
            min += getMinMatchLength(can.car);
        } while ((can = can.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode y = (ConsAltNode)node;
        do {
            final Node x = y.car;
            final int tmin = getMinMatchLength(x);
            if (y == node) {
                min = tmin;
            } else if (min > tmin) {
                min = tmin;
            }
        } while ((y = y.cdr) != null);
        break;

    case NodeType.STR:
        min = ((StringNode)node).length();
        break;

    case NodeType.CTYPE:
        min = 1;
        break;

    case NodeType.CCLASS:
    case NodeType.CANY:
        min = 1;
        break;

    case NodeType.QTFR:
        final QuantifierNode qn = (QuantifierNode)node;
        if (qn.lower > 0) {
            min = getMinMatchLength(qn.target);
            min = MinMaxLen.distanceMultiply(min, qn.lower);
        }
        break;

    case NodeType.ENCLOSE:
        final EncloseNode en = (EncloseNode)node;
        switch (en.type) {
        case EncloseType.MEMORY:
            if (en.isMinFixed()) {
                min = en.minLength;
            } else {
                min = getMinMatchLength(en.target);
                en.minLength = min;
                en.setMinFixed();
            }
            break;

        case EncloseType.OPTION:
        case EncloseType.STOP_BACKTRACK:
            min = getMinMatchLength(en.target);
            break;

        default:
            break;
        } // inner switch
        break;

    case NodeType.ANCHOR:
    default:
        break;
    } // switch

    return min;
}
Example #16
Source File: Compiler.java    From nashorn with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #17
Source File: ArrayCompiler.java    From nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}
Example #18
Source File: ArrayCompiler.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}
Example #19
Source File: Compiler.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #20
Source File: ArrayCompiler.java    From jdk8u_nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(final Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}
Example #21
Source File: ArrayCompiler.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}
Example #22
Source File: Compiler.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #23
Source File: Analyser.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
private int getMinMatchLength(Node node) {
    int min = 0;

    switch (node.getType()) {
    case NodeType.BREF:
        BackRefNode br = (BackRefNode)node;
        if (br.isRecursion()) break;

        if (br.backRef > env.numMem) {
            throw new ValueException(ERR_INVALID_BACKREF);
        }
        min = getMinMatchLength(env.memNodes[br.backRef]);

        break;

    case NodeType.LIST:
        ConsAltNode can = (ConsAltNode)node;
        do {
            min += getMinMatchLength(can.car);
        } while ((can = can.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode y = (ConsAltNode)node;
        do {
            Node x = y.car;
            int tmin = getMinMatchLength(x);
            if (y == node) {
                min = tmin;
            } else if (min > tmin) {
                min = tmin;
            }
        } while ((y = y.cdr) != null);
        break;

    case NodeType.STR:
        min = ((StringNode)node).length();
        break;

    case NodeType.CTYPE:
        min = 1;
        break;

    case NodeType.CCLASS:
    case NodeType.CANY:
        min = 1;
        break;

    case NodeType.QTFR:
        QuantifierNode qn = (QuantifierNode)node;
        if (qn.lower > 0) {
            min = getMinMatchLength(qn.target);
            min = MinMaxLen.distanceMultiply(min, qn.lower);
        }
        break;

    case NodeType.ENCLOSE:
        EncloseNode en = (EncloseNode)node;
        switch (en.type) {
        case EncloseType.MEMORY:
            if (en.isMinFixed()) {
                min = en.minLength;
            } else {
                min = getMinMatchLength(en.target);
                en.minLength = min;
                en.setMinFixed();
            }
            break;

        case EncloseType.OPTION:
        case EncloseType.STOP_BACKTRACK:
            min = getMinMatchLength(en.target);
            break;
        } // inner switch
        break;

    case NodeType.ANCHOR:
    default:
        break;
    } // switch

    return min;
}
Example #24
Source File: Analyser.java    From jdk8u_nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private int getMinMatchLength(final Node node) {
    int min = 0;

    switch (node.getType()) {
    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;
        if (br.isRecursion()) {
            break;
        }

        if (br.backRef > env.numMem) {
            throw new ValueException(ERR_INVALID_BACKREF);
        }
        min = getMinMatchLength(env.memNodes[br.backRef]);

        break;

    case NodeType.LIST:
        ConsAltNode can = (ConsAltNode)node;
        do {
            min += getMinMatchLength(can.car);
        } while ((can = can.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode y = (ConsAltNode)node;
        do {
            final Node x = y.car;
            final int tmin = getMinMatchLength(x);
            if (y == node) {
                min = tmin;
            } else if (min > tmin) {
                min = tmin;
            }
        } while ((y = y.cdr) != null);
        break;

    case NodeType.STR:
        min = ((StringNode)node).length();
        break;

    case NodeType.CTYPE:
        min = 1;
        break;

    case NodeType.CCLASS:
    case NodeType.CANY:
        min = 1;
        break;

    case NodeType.QTFR:
        final QuantifierNode qn = (QuantifierNode)node;
        if (qn.lower > 0) {
            min = getMinMatchLength(qn.target);
            min = MinMaxLen.distanceMultiply(min, qn.lower);
        }
        break;

    case NodeType.ENCLOSE:
        final EncloseNode en = (EncloseNode)node;
        switch (en.type) {
        case EncloseType.MEMORY:
            if (en.isMinFixed()) {
                min = en.minLength;
            } else {
                min = getMinMatchLength(en.target);
                en.minLength = min;
                en.setMinFixed();
            }
            break;

        case EncloseType.OPTION:
        case EncloseType.STOP_BACKTRACK:
            min = getMinMatchLength(en.target);
            break;

        default:
            break;
        } // inner switch
        break;

    case NodeType.ANCHOR:
    default:
        break;
    } // switch

    return min;
}
Example #25
Source File: Compiler.java    From jdk8u_nashorn with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(final Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        final EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #26
Source File: Compiler.java    From openjdk-jdk9 with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(final Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        final EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #27
Source File: ArrayCompiler.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(final Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}
Example #28
Source File: Compiler.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
protected final void compileTree(final Node node) {
    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            compileTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        compileAltNode((ConsAltNode)node);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            compileStringRawNode(sn);
        } else {
            compileStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        compileCClassNode((CClassNode)node);
        break;

    case NodeType.CANY:
        compileAnyCharNode();
        break;

    case NodeType.BREF:
        compileBackrefNode((BackRefNode)node);
        break;

    case NodeType.QTFR:
        compileNonCECQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        final EncloseNode enode = (EncloseNode)node;
        if (enode.isOption()) {
            compileOptionNode(enode);
        } else {
            compileEncloseNode(enode);
        }
        break;

    case NodeType.ANCHOR:
        compileAnchorNode((AnchorNode)node);
        break;

    default:
        // undefined node type
        newInternalException(ERR_PARSER_BUG);
    } // switch
}
Example #29
Source File: Analyser.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
private int getMinMatchLength(final Node node) {
    int min = 0;

    switch (node.getType()) {
    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;
        if (br.isRecursion()) {
            break;
        }

        if (br.backRef > env.numMem) {
            throw new ValueException(ERR_INVALID_BACKREF);
        }
        min = getMinMatchLength(env.memNodes[br.backRef]);

        break;

    case NodeType.LIST:
        ConsAltNode can = (ConsAltNode)node;
        do {
            min += getMinMatchLength(can.car);
        } while ((can = can.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode y = (ConsAltNode)node;
        do {
            final Node x = y.car;
            final int tmin = getMinMatchLength(x);
            if (y == node) {
                min = tmin;
            } else if (min > tmin) {
                min = tmin;
            }
        } while ((y = y.cdr) != null);
        break;

    case NodeType.STR:
        min = ((StringNode)node).length();
        break;

    case NodeType.CTYPE:
        min = 1;
        break;

    case NodeType.CCLASS:
    case NodeType.CANY:
        min = 1;
        break;

    case NodeType.QTFR:
        final QuantifierNode qn = (QuantifierNode)node;
        if (qn.lower > 0) {
            min = getMinMatchLength(qn.target);
            min = MinMaxLen.distanceMultiply(min, qn.lower);
        }
        break;

    case NodeType.ENCLOSE:
        final EncloseNode en = (EncloseNode)node;
        switch (en.type) {
        case EncloseType.MEMORY:
            if (en.isMinFixed()) {
                min = en.minLength;
            } else {
                min = getMinMatchLength(en.target);
                en.minLength = min;
                en.setMinFixed();
            }
            break;

        case EncloseType.OPTION:
        case EncloseType.STOP_BACKTRACK:
            min = getMinMatchLength(en.target);
            break;

        default:
            break;
        } // inner switch
        break;

    case NodeType.ANCHOR:
    default:
        break;
    } // switch

    return min;
}
Example #30
Source File: ArrayCompiler.java    From jdk8u60 with GNU General Public License v2.0 4 votes vote down vote up 
private int compileLengthTree(final Node node) {
    int len = 0;

    switch (node.getType()) {
    case NodeType.LIST:
        ConsAltNode lin = (ConsAltNode)node;
        do {
            len += compileLengthTree(lin.car);
        } while ((lin = lin.cdr) != null);
        break;

    case NodeType.ALT:
        ConsAltNode aln = (ConsAltNode)node;
        int n = 0;
        do {
            len += compileLengthTree(aln.car);
            n++;
        } while ((aln = aln.cdr) != null);
        len += (OPSize.PUSH + OPSize.JUMP) * (n - 1);
        break;

    case NodeType.STR:
        final StringNode sn = (StringNode)node;
        if (sn.isRaw()) {
            len = compileLengthStringRawNode(sn);
        } else {
            len = compileLengthStringNode(sn);
        }
        break;

    case NodeType.CCLASS:
        len = compileLengthCClassNode((CClassNode)node);
        break;

    case NodeType.CTYPE:
    case NodeType.CANY:
        len = OPSize.OPCODE;
        break;

    case NodeType.BREF:
        final BackRefNode br = (BackRefNode)node;

        len = ((!isIgnoreCase(regex.options) && br.backRef <= 2)
                ? OPSize.OPCODE : (OPSize.OPCODE + OPSize.MEMNUM));
        break;

    case NodeType.QTFR:
        len = compileNonCECLengthQuantifierNode((QuantifierNode)node);
        break;

    case NodeType.ENCLOSE:
        len = compileLengthEncloseNode((EncloseNode)node);
        break;

    case NodeType.ANCHOR:
        len = compileLengthAnchorNode((AnchorNode)node);
        break;

    default:
        newInternalException(ERR_PARSER_BUG);

    } //switch
    return len;
}