Java Code Examples for jdk.nashorn.internal.runtime.regexp.joni.ast.StringNode#isAmbig()

The following examples show how to use jdk.nashorn.internal.runtime.regexp.joni.ast.StringNode#isAmbig() . 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: Compiler.java    From nashorn with GNU General Public License v2.0 6 votes vote down vote up 
private void compileStringNode(StringNode node) {
    StringNode sn = node;
    if (sn.length() <= 0) return;

    boolean ambig = sn.isAmbig();

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

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

    boolean ambig = sn.isAmbig();

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

    while (p < end) {
        slen++;
        p++;
    }
    addCompileString(chars, prev, slen, ambig);
}
Example 3
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 4
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 5
Source File: Compiler.java    From openjdk-jdk9 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 6
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 7
Source File: ArrayCompiler.java    From jdk8u_nashorn 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 8
Source File: ArrayCompiler.java    From openjdk-8 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 9
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 10
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 11
Source File: ArrayCompiler.java    From jdk8u60 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 12
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 13
Source File: Analyser.java    From openjdk-8 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 14
Source File: Analyser.java    From openjdk-8-source 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 15
Source File: Analyser.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 4 votes vote down vote up 
private Node expandCaseFoldString(final Node node) {
    final StringNode sn = (StringNode)node;

    if (sn.isAmbig() || sn.length() <= 0) {
        return node;
    }

    final char[] chars1 = sn.chars;
    int pt = sn.p;
    final int end = sn.end;
    int altNum = 1;

    ConsAltNode topRoot = null, r = null;
    @SuppressWarnings("unused")
    final ObjPtr<Node> prevNode = new ObjPtr<Node>();
    StringNode stringNode = null;

    while (pt < end) {
        final char[] items = EncodingHelper.caseFoldCodesByString(regex.caseFoldFlag, chars1[pt]);

        if (items.length == 0) {
            if (stringNode == null) {
                if (r == null && prevNode.p != null) {
                    topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
                }

                prevNode.p = stringNode = new StringNode(); // onig_node_new_str(NULL, NULL);

                if (r != null) {
                    ConsAltNode.listAdd(r, stringNode);
                }

            }

            stringNode.cat(chars1, pt, pt + 1);
        } else {
            altNum *= (items.length + 1);
            if (altNum > THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION) {
                break;
            }

            if (r == null && prevNode.p != null) {
                topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
            }

            expandCaseFoldStringAlt(items.length, items, chars1, pt, 1, end, prevNode);
            if (r != null) {
                ConsAltNode.listAdd(r, prevNode.p);
            }
            stringNode = null;
        }
        pt++;
    }

    if (pt < end) {
        final Node srem = expandCaseFoldMakeRemString(chars1, pt, end);

        if (prevNode.p != null && r == null) {
            topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
        }

        if (r == null) {
            prevNode.p = srem;
        } else {
            ConsAltNode.listAdd(r, srem);
        }
    }
    /* ending */
    final Node xnode = topRoot != null ? topRoot : prevNode.p;

    swap(node, xnode);
    return xnode;
}
Example 16
Source File: Analyser.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
private Node expandCaseFoldString(Node node) {
    StringNode sn = (StringNode)node;

    if (sn.isAmbig() || sn.length() <= 0) return node;

    char[] chars = sn.chars;
    int p = sn.p;
    int end = sn.end;
    int altNum = 1;

    ConsAltNode topRoot = null, root = null;
    ObjPtr<Node> prevNode = new ObjPtr<Node>();
    StringNode stringNode = null;

    while (p < end) {
        char[] items = EncodingHelper.caseFoldCodesByString(regex.caseFoldFlag, chars[p]);

        if (items.length == 0) {
            if (stringNode == null) {
                if (root == null && prevNode.p != null) {
                    topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
                }

                prevNode.p = stringNode = new StringNode(); // onig_node_new_str(NULL, NULL);

                if (root != null) ConsAltNode.listAdd(root, stringNode);

            }

            stringNode.cat(chars, p, p + 1);
        } else {
            altNum *= (items.length + 1);
            if (altNum > THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION) break;

            if (root == null && prevNode.p != null) {
                topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
            }

            expandCaseFoldStringAlt(items.length, items, chars, p, 1, end, prevNode);
            if (root != null) ConsAltNode.listAdd(root, prevNode.p);
            stringNode = null;
        }
        p++;
    }

    if (p < end) {
        Node srem = expandCaseFoldMakeRemString(chars, p, end);

        if (prevNode.p != null && root == null) {
            topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
        }

        if (root == null) {
            prevNode.p = srem;
        } else {
            ConsAltNode.listAdd(root, srem);
        }
    }
    /* ending */
    Node xnode = topRoot != null ? topRoot : prevNode.p;

    swap(node, xnode);
    return xnode;
}
Example 17
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 18
Source File: Analyser.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
private Node expandCaseFoldString(Node node) {
    StringNode sn = (StringNode)node;

    if (sn.isAmbig() || sn.length() <= 0) return node;

    char[] chars = sn.chars;
    int p = sn.p;
    int end = sn.end;
    int altNum = 1;

    ConsAltNode topRoot = null, root = null;
    ObjPtr<Node> prevNode = new ObjPtr<Node>();
    StringNode stringNode = null;

    while (p < end) {
        char[] items = EncodingHelper.caseFoldCodesByString(regex.caseFoldFlag, chars[p]);

        if (items.length == 0) {
            if (stringNode == null) {
                if (root == null && prevNode.p != null) {
                    topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
                }

                prevNode.p = stringNode = new StringNode(); // onig_node_new_str(NULL, NULL);

                if (root != null) ConsAltNode.listAdd(root, stringNode);

            }

            stringNode.cat(chars, p, p + 1);
        } else {
            altNum *= (items.length + 1);
            if (altNum > THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION) break;

            if (root == null && prevNode.p != null) {
                topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
            }

            expandCaseFoldStringAlt(items.length, items, chars, p, 1, end, prevNode);
            if (root != null) ConsAltNode.listAdd(root, prevNode.p);
            stringNode = null;
        }
        p++;
    }

    if (p < end) {
        Node srem = expandCaseFoldMakeRemString(chars, p, end);

        if (prevNode.p != null && root == null) {
            topRoot = root = ConsAltNode.listAdd(null, prevNode.p);
        }

        if (root == null) {
            prevNode.p = srem;
        } else {
            ConsAltNode.listAdd(root, srem);
        }
    }
    /* ending */
    Node xnode = topRoot != null ? topRoot : prevNode.p;

    swap(node, xnode);
    return xnode;
}
Example 19
Source File: Analyser.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
private Node expandCaseFoldString(final Node node) {
    final StringNode sn = (StringNode)node;

    if (sn.isAmbig() || sn.length() <= 0) {
        return node;
    }

    final char[] chars1 = sn.chars;
    int pt = sn.p;
    final int end = sn.end;
    int altNum = 1;

    ConsAltNode topRoot = null, r = null;
    @SuppressWarnings("unused")
    final ObjPtr<Node> prevNode = new ObjPtr<Node>();
    StringNode stringNode = null;

    while (pt < end) {
        final char[] items = EncodingHelper.caseFoldCodesByString(regex.caseFoldFlag, chars1[pt]);

        if (items.length == 0) {
            if (stringNode == null) {
                if (r == null && prevNode.p != null) {
                    topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
                }

                prevNode.p = stringNode = new StringNode(); // onig_node_new_str(NULL, NULL);

                if (r != null) {
                    ConsAltNode.listAdd(r, stringNode);
                }

            }

            stringNode.cat(chars1, pt, pt + 1);
        } else {
            altNum *= (items.length + 1);
            if (altNum > THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION) {
                break;
            }

            if (r == null && prevNode.p != null) {
                topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
            }

            expandCaseFoldStringAlt(items.length, items, chars1, pt, 1, end, prevNode);
            if (r != null) {
                ConsAltNode.listAdd(r, prevNode.p);
            }
            stringNode = null;
        }
        pt++;
    }

    if (pt < end) {
        final Node srem = expandCaseFoldMakeRemString(chars1, pt, end);

        if (prevNode.p != null && r == null) {
            topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
        }

        if (r == null) {
            prevNode.p = srem;
        } else {
            ConsAltNode.listAdd(r, srem);
        }
    }
    /* ending */
    final Node xnode = topRoot != null ? topRoot : prevNode.p;

    swap(node, xnode);
    return xnode;
}
Example 20
Source File: Analyser.java    From jdk8u_nashorn with GNU General Public License v2.0 4 votes vote down vote up 
private Node expandCaseFoldString(final Node node) {
    final StringNode sn = (StringNode)node;

    if (sn.isAmbig() || sn.length() <= 0) {
        return node;
    }

    final char[] chars1 = sn.chars;
    int pt = sn.p;
    final int end = sn.end;
    int altNum = 1;

    ConsAltNode topRoot = null, r = null;
    @SuppressWarnings("unused")
    final ObjPtr<Node> prevNode = new ObjPtr<Node>();
    StringNode stringNode = null;

    while (pt < end) {
        final char[] items = EncodingHelper.caseFoldCodesByString(regex.caseFoldFlag, chars1[pt]);

        if (items.length == 0) {
            if (stringNode == null) {
                if (r == null && prevNode.p != null) {
                    topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
                }

                prevNode.p = stringNode = new StringNode(); // onig_node_new_str(NULL, NULL);

                if (r != null) {
                    ConsAltNode.listAdd(r, stringNode);
                }

            }

            stringNode.cat(chars1, pt, pt + 1);
        } else {
            altNum *= (items.length + 1);
            if (altNum > THRESHOLD_CASE_FOLD_ALT_FOR_EXPANSION) {
                break;
            }

            if (r == null && prevNode.p != null) {
                topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
            }

            expandCaseFoldStringAlt(items.length, items, chars1, pt, 1, end, prevNode);
            if (r != null) {
                ConsAltNode.listAdd(r, prevNode.p);
            }
            stringNode = null;
        }
        pt++;
    }

    if (pt < end) {
        final Node srem = expandCaseFoldMakeRemString(chars1, pt, end);

        if (prevNode.p != null && r == null) {
            topRoot = r = ConsAltNode.listAdd(null, prevNode.p);
        }

        if (r == null) {
            prevNode.p = srem;
        } else {
            ConsAltNode.listAdd(r, srem);
        }
    }
    /* ending */
    final Node xnode = topRoot != null ? topRoot : prevNode.p;

    swap(node, xnode);
    return xnode;
}