Examples of booton.translator.Node$BackedgeGroup

booton.translator.Node
@version 2014/07/03 11:36:56

            }
        }


        // Build dominator tree
        for (Node node : nodes) {
            Node dominator = node.getDominator();


            if (dominator != null) {
                dominator.dominators.addIfAbsent(node);
            }
        }

View Full Code Here


            if (second == Node.END) {
                return;
            }


            Node right = findNodeBy(first);
            Node left = findNodeBy(second);
            Node condition = findNodeBy(third);


            if (right == left) {
                return;
            }


            // The condition's transition node must be right node. (not left node)
            // The bytecode order is:
            // [jump to RIGHT value]
            // [label]?
            // [LEFT value]
            // [label]
            // [RIGHT value]
            boolean transition = collect(((OperandCondition) third).then).contains(right);


            // The condition node must be dominator of the left and right nodes.
            boolean dominator = left.hasDominator(condition) && right.hasDominator(condition);


            // The left node must not be dominator of the right node except when condtion and left
            // value are in same node.
            boolean values = condition != left && right.hasDominator(left);


            if (transition && dominator && !values) {
                Debugger
                        .print("Create ternary operator. condition[" + third + "]  left[" + second + "]  right[" + first + "]");
                Debugger.print(nodes);


                if (first == ONE && second == ZERO) {
                    current.remove(0);
                    current.remove(0);
                    condition.addOperand(new OperandAmbiguousZeroOneTernary(current.remove(0)));
                } else if (first == ZERO && second == ONE) {
                    current.remove(0);
                    current.remove(0);
                    condition.addOperand(new OperandAmbiguousZeroOneTernary(current.remove(0).invert()));
                } else {
                    current.remove(0);
                    current.remove(0);
                    current.remove(0);


                    if (first instanceof OperandCondition && second instanceof OperandCondition) {
                        condition
                                .addOperand(new OperandTernaryCondition((OperandCondition) third, (OperandCondition) second, (OperandCondition) first));
                    } else {
                        condition
                                .addOperand(new OperandEnclose(new OperandExpression(third.invert().disclose() + "?" + second
                                        .disclose() + ":" + first.disclose(), new InferredType(first, second))));
                    }
                }

View Full Code Here

     * @param operand
     * @return
     */
    private Node findNodeBy(Operand operand) {
        for (int i = nodes.size() - 1; 0 <= i; i--) {
            Node node = nodes.get(i);


            if (node.has(operand)) {
                return node;
            }
        }
        throw new IllegalArgumentException("The operand [" + operand + "] is not found in the current context.");
    }

View Full Code Here


        // recode current instruction
        record(opcode);


        // search node
        Node node = getNode(label);


        switch (opcode) {
        case GOTO:
            current.disposable = false;
            current.connect(node);

View Full Code Here

    public void visitLabel(Label label) {
        // recode current instruction
        record(LABEL);


        // build next node
        Node next = getNode(label);


        if (current != null && current.destination == null) {
            current.connect(next);
            current.destination = next;
        }

View Full Code Here

     */
    private final Node link(Node... nodes) {
        int size = nodes.length - 1;


        for (int i = 0; i < size; i++) {
            Node prev = nodes[i];
            Node next = nodes[i + 1];


            if (prev != null) prev.next = next;
            if (next != null) next.previous = prev;
        }
        return nodes[size];

View Full Code Here

     * 
     * @param index A index node.
     * @return A created node.
     */
    private final Node createNodeAfter(Node index) {
        Node created = new Node(index.id + "+");


        // switch line number
        created.lineNumber = index.lineNumber;
        index.lineNumber = -1;

View Full Code Here

     * 
     * @param label A label for node.
     * @return An asossiated and cached node.
     */
    private final Node getNode(Label label) {
        Node node = (Node) label.info;


        // search cached node
        if (node == null) {
            label.info = node = new Node(counter++);
        }


        // API definition
        return node;
    }

View Full Code Here


            if (size != 0 && size != base.stack.size()) {
                if (conditionalTail) {
                    // transfer condition operands to the created node
                    // [non-condition] [condition]
                    Node created = createNodeAfter(base);


                    for (int i = 0; i < size; i++) {
                        OperandCondition condition = (OperandCondition) base.stack.pollLast();


                        // disconnect from base node
                        base.disconnect(condition.then);
                        base.disconnect(condition.elze);


                        // connect from created node
                        created.connect(condition.then);
                        created.connect(condition.elze);


                        // transfer operand
                        created.stack.addFirst(condition);
                    }


                    // connect from base to created
                    base.connect(created);
                } else if (conditionalHead) {
                    // transfer non-condition operands to the created node
                    // [condition] [non-condition]
                    Node created = createNodeAfter(base);


                    // transfer operand
                    for (int i = 0; i < start; i++) {
                        created.stack.addFirst(base.stack.pollLast());
                    }


                    // search non-conditional operand's transition
                    Set<Node> transitions = new HashSet(base.outgoing);


                    for (OperandCondition condition : conditions) {
                        transitions.remove(condition.then);
                    }


                    for (Node transition : transitions) {
                        // disconnect from base
                        base.disconnect(transition);


                        // connect from created
                        created.connect(transition);
                    }


                    // connect from base to created
                    base.connect(created);


                    // connect from created to next
                    created.connect(base.destination == null ? created.destination : base.destination);
                }
            }
        }

View Full Code Here

TOP

Related Classes of booton.translator.Node$BackedgeGroup

booton.translator.JavaMethodCompiler

booton.translator.JavaMethodCompiler$SequentialConditionInfo

java.util.ArrayList

java.util.LinkedList

java.util.concurrent.CopyOnWriteArrayList

java.util.ArrayDeque

java.util.HashSet

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.