Package org.joni.ast

Examples of org.joni.ast.BackRefNode

357
358
359
360
361
362
363
364
365
366
367
368
        addAbsAddr(0); /*dummy addr.*/
    }

    @Override
    protected void compileBackrefNode(BackRefNode node) {
        BackRefNode br = node;
        if (Config.USE_BACKREF_WITH_LEVEL && br.isNestLevel()) {
            addOpcode(OPCode.BACKREF_WITH_LEVEL);
            addOption(regex.options & Option.IGNORECASE);
            addLength(br.nestLevel);
            // !goto add_bacref_mems;!
            addLength(br.backNum);
View Full Code Here
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
        case NodeType.CANY:
            len = OPSize.OPCODE;
            break;

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

            if (Config.USE_BACKREF_WITH_LEVEL && br.isNestLevel()) {
                len = OPSize.OPCODE + OPSize.OPTION + OPSize.LENGTH +
                      OPSize.LENGTH + (OPSize.MEMNUM * br.backNum);
            } else { // USE_BACKREF_AT_LEVEL
                if (br.backNum == 1) {
                    len = ((!isIgnoreCase(regex.options) && br.back[0] <= 2)
View Full Code Here
293
294
295
296
297
298
299
300
301
302
        case NodeType.ENCLOSE:
            numberedRefCheck(((EncloseNode)node).target);
            break;

        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            if (!br.isNameRef()) newValueException(ERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED);
            break;
        } // switch
    }
View Full Code Here
407
408
409
410
411
412
413
414
415
416
417
418
    private int getMinMatchLength(Node node) {
        int min = 0;

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

            if (br.back[0] > env.numMem) {
                if (!syntax.op2OptionECMAScript()) newValueException(ERR_INVALID_BACKREF);
            } else {
                min = getMinMatchLength(env.memNodes[br.back[0]]);
View Full Code Here
543
544
545
546
547
548
549
550
551
552
553
554
        case NodeType.CANY:
            max = enc.maxLengthDistance();
            break;

        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            if (br.isRecursion()) {
                max = MinMaxLen.INFINITE_DISTANCE;
                break;
            }

            for (int i=0; i<br.backNum; i++) {
View Full Code Here
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
        case NodeType.CALL: // if (Config.USE_SUBEXP_CALL) ?
            break;

        case NodeType.BREF:
            BackRefNode br = (BackRefNode)node;
            for (int i=0; i<br.backNum; i++) {
                if (br.back[i] > env.numMem) {
                    if (!syntax.op2OptionECMAScript()) newValueException(ERR_INVALID_BACKREF);
                } else {
                    env.backrefedMem = bsOnAt(env.backrefedMem, br.back[i]);
                    env.btMemStart = bsOnAt(env.btMemStart, br.back[i]);
                    if (Config.USE_BACKREF_WITH_LEVEL) {
                        if (br.isNestLevel()) {
                            env.btMemEnd = bsOnAt(env.btMemEnd, br.back[i]);
                        }
                    } // USE_BACKREF_AT_LEVEL
                    ((EncloseNode)env.memNodes[br.back[i]]).setMemBackrefed();
                }
View Full Code Here
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
            } // inner switch
            break;
        }

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

            if (br.isRecursion()) {
                opt.length.set(0, MinMaxLen.INFINITE_DISTANCE);
                break;
            }

            Node[]nodes = oenv.scanEnv.memNodes;
View Full Code Here
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
                    }
                }
                if (shouldIgnore) {
                    node = StringNode.EMPTY;
                } else {
                    node = new BackRefNode(token.getBackrefNum(),
                                    new int[]{token.getBackrefRef1()},
                                    token.getBackrefByName(),
                                    token.getBackrefExistLevel(), // #ifdef USE_BACKREF_AT_LEVEL
                                    token.getBackrefLevel(),      // ...
                                    env);
                }
            } else {
                int[]backRefs = token.getBackrefNum() > 1 ? token.getBackrefRefs() : new int[]{token.getBackrefRef1()};
                node = new BackRefNode(token.getBackrefNum(),
                                backRefs,
                                token.getBackrefByName(),
                                token.getBackrefExistLevel(), // #ifdef USE_BACKREF_AT_LEVEL
                                token.getBackrefLevel(),      // ...
                                env);
View Full Code Here
TOP

Related Classes of org.joni.ast.BackRefNode

  • org.joni.Analyser
  • org.joni.ArrayCompiler
  • org.joni.Parser
  • org.joni.exception.ValueException
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.