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

The following examples show how to use jdk.nashorn.internal.runtime.regexp.joni.ast.CClassNode. 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 
private static int compileLengthCClassNode(final CClassNode cc) {
    if (cc.isShare()) {
        return OPSize.OPCODE + OPSize.POINTER;
    }

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #2
Source File: ArrayCompiler.java    From nashorn with GNU General Public License v2.0 6 votes vote down vote up 
private int compileLengthCClassNode(CClassNode cc) {
    if (cc.isShare()) return OPSize.OPCODE + OPSize.POINTER;

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #3
Source File: ArrayCompiler.java    From openjdk-8-source with GNU General Public License v2.0 6 votes vote down vote up 
private int compileLengthCClassNode(CClassNode cc) {
    if (cc.isShare()) return OPSize.OPCODE + OPSize.POINTER;

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #4
Source File: ArrayCompiler.java    From openjdk-jdk8u with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthCClassNode(final CClassNode cc) {
    if (cc.isShare()) {
        return OPSize.OPCODE + OPSize.POINTER;
    }

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #5
Source File: ArrayCompiler.java    From jdk8u60 with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthCClassNode(final CClassNode cc) {
    if (cc.isShare()) {
        return OPSize.OPCODE + OPSize.POINTER;
    }

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #6
Source File: ArrayCompiler.java    From jdk8u_nashorn with GNU General Public License v2.0 6 votes vote down vote up 
private static int compileLengthCClassNode(final CClassNode cc) {
    if (cc.isShare()) {
        return OPSize.OPCODE + OPSize.POINTER;
    }

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #7
Source File: ArrayCompiler.java    From openjdk-8 with GNU General Public License v2.0 6 votes vote down vote up 
private int compileLengthCClassNode(CClassNode cc) {
    if (cc.isShare()) return OPSize.OPCODE + OPSize.POINTER;

    int len;
    if (cc.mbuf == null) {
        len = OPSize.OPCODE + BitSet.BITSET_SIZE;
    } else {
        if (cc.bs.isEmpty()) {
            len = OPSize.OPCODE;
        } else {
            len = OPSize.OPCODE + BitSet.BITSET_SIZE;
        }

        len += OPSize.LENGTH + cc.mbuf.used;
    }
    return len;
}
Example #8
Source File: ArrayCompiler.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
@Override
protected void compileCClassNode(final CClassNode cc) {
    if (cc.isShare()) { // shared char class
        addOpcode(OPCode.CCLASS_NODE);
        addPointer(cc);
        return;
    }

    if (cc.mbuf == null) {
        if (cc.isNot()) {
            addOpcode(OPCode.CCLASS_NOT);
        } else {
            addOpcode(OPCode.CCLASS);
        }
        addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
    } else {
        if (cc.bs.isEmpty()) {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MB_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MB);
            }
            addMultiByteCClass(cc.mbuf);
        } else {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MIX_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MIX);
            }
            // store the bit set and mbuf themself!
            addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
            addMultiByteCClass(cc.mbuf);
        }
    }
}
Example #9
Source File: ApplyCaseFold.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
public static void apply(final int from, final int to, final Object o) {
    final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;

    final ScanEnvironment env = arg.env;
    final CClassNode cc = arg.cc;
    final BitSet bs = cc.bs;

    final boolean inCC = cc.isCodeInCC(from);

    if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
        if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                cc.addCodeRange(env, to, to);
            } else {
                /* /(?i:[^A-C])/.match("a") ==> fail. */
                bs.set(to);
            }
        }
    } else {
        if (inCC) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                if (cc.isNot()) {
                    cc.clearNotFlag();
                }
                cc.addCodeRange(env, to, to);
            } else {
                if (cc.isNot()) {
                    bs.clear(to);
                } else {
                    bs.set(to);
                }
            }
        }
    } // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS

}
Example #10
Source File: ByteCodeMachine.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
private void opCClassNode() {
    if (s >= range) {opFail(); return;}
    final CClassNode cc = (CClassNode)regex.operands[code[ip++]];
    final int ss = s;
    s++;
    final int c = chars[ss];
    if (!cc.isCodeInCCLength(c)) {opFail(); return;}
    sprev = sbegin; // break;
}
Example #11
Source File: ApplyCaseFold.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
public static void apply(final int from, final int to, final Object o) {
    final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;

    final ScanEnvironment env = arg.env;
    final CClassNode cc = arg.cc;
    final BitSet bs = cc.bs;

    final boolean inCC = cc.isCodeInCC(from);

    if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
        if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                cc.addCodeRange(env, to, to);
            } else {
                /* /(?i:[^A-C])/.match("a") ==> fail. */
                bs.set(to);
            }
        }
    } else {
        if (inCC) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                if (cc.isNot()) {
                    cc.clearNotFlag();
                }
                cc.addCodeRange(env, to, to);
            } else {
                if (cc.isNot()) {
                    bs.clear(to);
                } else {
                    bs.set(to);
                }
            }
        }
    } // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS

}
Example #12
Source File: ByteCodeMachine.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
private void opCClassNode() {
    if (s >= range) {opFail(); return;}
    final CClassNode cc = (CClassNode)regex.operands[code[ip++]];
    final int ss = s;
    s++;
    final int c = chars[ss];
    if (!cc.isCodeInCCLength(c)) {opFail(); return;}
    sprev = sbegin; // break;
}
Example #13
Source File: ArrayCompiler.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
@Override
protected void compileCClassNode(final CClassNode cc) {
    if (cc.isShare()) { // shared char class
        addOpcode(OPCode.CCLASS_NODE);
        addPointer(cc);
        return;
    }

    if (cc.mbuf == null) {
        if (cc.isNot()) {
            addOpcode(OPCode.CCLASS_NOT);
        } else {
            addOpcode(OPCode.CCLASS);
        }
        addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
    } else {
        if (cc.bs.isEmpty()) {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MB_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MB);
            }
            addMultiByteCClass(cc.mbuf);
        } else {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MIX_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MIX);
            }
            // store the bit set and mbuf themself!
            addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
            addMultiByteCClass(cc.mbuf);
        }
    }
}
Example #14
Source File: ApplyCaseFold.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
public static void apply(final int from, final int to, final Object o) {
    final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;

    final ScanEnvironment env = arg.env;
    final CClassNode cc = arg.cc;
    final BitSet bs = cc.bs;

    final boolean inCC = cc.isCodeInCC(from);

    if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
        if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                cc.addCodeRange(env, to, to);
            } else {
                /* /(?i:[^A-C])/.match("a") ==> fail. */
                bs.set(to);
            }
        }
    } else {
        if (inCC) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                if (cc.isNot()) {
                    cc.clearNotFlag();
                }
                cc.addCodeRange(env, to, to);
            } else {
                if (cc.isNot()) {
                    bs.clear(to);
                } else {
                    bs.set(to);
                }
            }
        }
    } // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS

}
Example #15
Source File: ByteCodeMachine.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
private void opCClassNode() {
    if (s >= range) {opFail(); return;}
    final CClassNode cc = (CClassNode)regex.operands[code[ip++]];
    final int ss = s;
    s++;
    final int c = chars[ss];
    if (!cc.isCodeInCCLength(c)) {opFail(); return;}
    sprev = sbegin; // break;
}
Example #16
Source File: ArrayCompiler.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
@Override
protected void compileCClassNode(final CClassNode cc) {
    if (cc.isShare()) { // shared char class
        addOpcode(OPCode.CCLASS_NODE);
        addPointer(cc);
        return;
    }

    if (cc.mbuf == null) {
        if (cc.isNot()) {
            addOpcode(OPCode.CCLASS_NOT);
        } else {
            addOpcode(OPCode.CCLASS);
        }
        addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
    } else {
        if (cc.bs.isEmpty()) {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MB_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MB);
            }
            addMultiByteCClass(cc.mbuf);
        } else {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MIX_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MIX);
            }
            // store the bit set and mbuf themself!
            addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
            addMultiByteCClass(cc.mbuf);
        }
    }
}
Example #17
Source File: ByteCodeMachine.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
private void opCClassNode() {
    if (s >= range) {opFail(); return;}
    final CClassNode cc = (CClassNode)regex.operands[code[ip++]];
    final int ss = s;
    s++;
    final int c = chars[ss];
    if (!cc.isCodeInCCLength(c)) {opFail(); return;}
    sprev = sbegin; // break;
}
Example #18
Source File: ApplyCaseFold.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
public static void apply(final int from, final int to, final Object o) {
    final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;

    final ScanEnvironment env = arg.env;
    final CClassNode cc = arg.cc;
    final BitSet bs = cc.bs;

    final boolean inCC = cc.isCodeInCC(from);

    if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
        if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                cc.addCodeRange(env, to, to);
            } else {
                /* /(?i:[^A-C])/.match("a") ==> fail. */
                bs.set(to);
            }
        }
    } else {
        if (inCC) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                if (cc.isNot()) {
                    cc.clearNotFlag();
                }
                cc.addCodeRange(env, to, to);
            } else {
                if (cc.isNot()) {
                    bs.clear(to);
                } else {
                    bs.set(to);
                }
            }
        }
    } // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS

}
Example #19
Source File: ArrayCompiler.java    From jdk8u_nashorn with GNU General Public License v2.0 5 votes vote down vote up 
@Override
protected void compileCClassNode(final CClassNode cc) {
    if (cc.isShare()) { // shared char class
        addOpcode(OPCode.CCLASS_NODE);
        addPointer(cc);
        return;
    }

    if (cc.mbuf == null) {
        if (cc.isNot()) {
            addOpcode(OPCode.CCLASS_NOT);
        } else {
            addOpcode(OPCode.CCLASS);
        }
        addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
    } else {
        if (cc.bs.isEmpty()) {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MB_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MB);
            }
            addMultiByteCClass(cc.mbuf);
        } else {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MIX_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MIX);
            }
            // store the bit set and mbuf themself!
            addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
            addMultiByteCClass(cc.mbuf);
        }
    }
}
Example #20
Source File: ByteCodeMachine.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
private void opCClassNode() {
    if (s >= range) {opFail(); return;}
    final CClassNode cc = (CClassNode)regex.operands[code[ip++]];
    final int ss = s;
    s++;
    final int c = chars[ss];
    if (!cc.isCodeInCCLength(c)) {opFail(); return;}
    sprev = sbegin; // break;
}
Example #21
Source File: ByteCodeMachine.java    From jdk8u_nashorn with GNU General Public License v2.0 5 votes vote down vote up 
private void opCClassNode() {
    if (s >= range) {opFail(); return;}
    final CClassNode cc = (CClassNode)regex.operands[code[ip++]];
    final int ss = s;
    s++;
    final int c = chars[ss];
    if (!cc.isCodeInCCLength(c)) {opFail(); return;}
    sprev = sbegin; // break;
}
Example #22
Source File: ArrayCompiler.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
@Override
protected void compileCClassNode(final CClassNode cc) {
    if (cc.isShare()) { // shared char class
        addOpcode(OPCode.CCLASS_NODE);
        addPointer(cc);
        return;
    }

    if (cc.mbuf == null) {
        if (cc.isNot()) {
            addOpcode(OPCode.CCLASS_NOT);
        } else {
            addOpcode(OPCode.CCLASS);
        }
        addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
    } else {
        if (cc.bs.isEmpty()) {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MB_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MB);
            }
            addMultiByteCClass(cc.mbuf);
        } else {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MIX_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MIX);
            }
            // store the bit set and mbuf themself!
            addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
            addMultiByteCClass(cc.mbuf);
        }
    }
}
Example #23
Source File: ApplyCaseFold.java    From jdk8u_nashorn with GNU General Public License v2.0 5 votes vote down vote up 
public static void apply(final int from, final int to, final Object o) {
    final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;

    final ScanEnvironment env = arg.env;
    final CClassNode cc = arg.cc;
    final BitSet bs = cc.bs;

    final boolean inCC = cc.isCodeInCC(from);

    if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
        if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                cc.addCodeRange(env, to, to);
            } else {
                /* /(?i:[^A-C])/.match("a") ==> fail. */
                bs.set(to);
            }
        }
    } else {
        if (inCC) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                if (cc.isNot()) {
                    cc.clearNotFlag();
                }
                cc.addCodeRange(env, to, to);
            } else {
                if (cc.isNot()) {
                    bs.clear(to);
                } else {
                    bs.set(to);
                }
            }
        }
    } // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS

}
Example #24
Source File: ApplyCaseFold.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
public static void apply(final int from, final int to, final Object o) {
    final ApplyCaseFoldArg arg = (ApplyCaseFoldArg)o;

    final ScanEnvironment env = arg.env;
    final CClassNode cc = arg.cc;
    final BitSet bs = cc.bs;

    final boolean inCC = cc.isCodeInCC(from);

    if (Config.CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS) {
        if ((inCC && !cc.isNot()) || (!inCC && cc.isNot())) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                cc.addCodeRange(env, to, to);
            } else {
                /* /(?i:[^A-C])/.match("a") ==> fail. */
                bs.set(to);
            }
        }
    } else {
        if (inCC) {
            if (to >= BitSet.SINGLE_BYTE_SIZE) {
                if (cc.isNot()) {
                    cc.clearNotFlag();
                }
                cc.addCodeRange(env, to, to);
            } else {
                if (cc.isNot()) {
                    bs.clear(to);
                } else {
                    bs.set(to);
                }
            }
        }
    } // CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS

}
Example #25
Source File: ArrayCompiler.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
@Override
protected void compileCClassNode(final CClassNode cc) {
    if (cc.isShare()) { // shared char class
        addOpcode(OPCode.CCLASS_NODE);
        addPointer(cc);
        return;
    }

    if (cc.mbuf == null) {
        if (cc.isNot()) {
            addOpcode(OPCode.CCLASS_NOT);
        } else {
            addOpcode(OPCode.CCLASS);
        }
        addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
    } else {
        if (cc.bs.isEmpty()) {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MB_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MB);
            }
            addMultiByteCClass(cc.mbuf);
        } else {
            if (cc.isNot()) {
                addOpcode(OPCode.CCLASS_MIX_NOT);
            } else {
                addOpcode(OPCode.CCLASS_MIX);
            }
            // store the bit set and mbuf themself!
            addInts(cc.bs.bits, BitSet.BITSET_SIZE); // add_bitset
            addMultiByteCClass(cc.mbuf);
        }
    }
}
Example #26
Source File: Analyser.java    From nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private boolean isNotIncluded(Node x, Node y) {
    Node tmp;

    // !retry:!
    retry: while(true) {

    int yType = y.getType();

    switch(x.getType()) {
    case NodeType.CTYPE:
        switch(yType) {

        case NodeType.CCLASS:
            // !swap:!
            tmp = x;
            x = y;
            y = tmp;
            // !goto retry;!
            continue retry;

        case NodeType.STR:
            // !goto swap;!
            tmp = x;
            x = y;
            y = tmp;
            continue retry;

        default:
            break;
        } // inner switch
        break;

    case NodeType.CCLASS:
        CClassNode xc = (CClassNode)x;

        switch(yType) {

        case NodeType.CCLASS:
            CClassNode yc = (CClassNode)y;

            for (int i=0; i<BitSet.SINGLE_BYTE_SIZE; i++) {
                boolean v = xc.bs.at(i);
                if ((v && !xc.isNot()) || (!v && xc.isNot())) {
                    v = yc.bs.at(i);
                    if ((v && !yc.isNot()) || (!v && yc.isNot())) return false;
                }
            }
            if ((xc.mbuf == null && !xc.isNot()) || yc.mbuf == null && !yc.isNot()) return true;
            return false;
            // break; not reached

        case NodeType.STR:
            // !goto swap;!
            tmp = x;
            x = y;
            y = tmp;
            continue retry;

        default:
            break;

        } // inner switch
        break; // case NodeType.CCLASS

    case NodeType.STR:
        StringNode xs = (StringNode)x;
        if (xs.length() == 0) break;

        switch (yType) {

        case NodeType.CCLASS:
            CClassNode cc = (CClassNode)y;
            int code = xs.chars[xs.p];
            return !cc.isCodeInCC(code);

        case NodeType.STR:
            StringNode ys = (StringNode)y;
            int len = xs.length();
            if (len > ys.length()) len = ys.length();
            if (xs.isAmbig() || ys.isAmbig()) {
                /* tiny version */
                return false;
            } else {
                for (int i=0, p=ys.p, q=xs.p; i<len; i++, p++, q++) {
                    if (ys.chars[p] != xs.chars[q]) return true;
                }
            }
            break;

        default:
            break;
        } // inner switch

        break; // case NodeType.STR

    } // switch

    break;
    } // retry: while
    return false;
}
Example #27
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 #28
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 #29
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 #30
Source File: Parser.java    From nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private void parseCharClassValEntry(CClassNode cc, CCStateArg arg) {
    arg.inType = arg.v <= 0xff ? CCVALTYPE.SB : CCVALTYPE.CODE_POINT;
    parseCharClassValEntry2(cc, arg); // val_entry2:
}