List of dominatorTree() Examples

Examples of dominatorTree()

javassist.bytecode.analysis.ControlFlow.dominatorTree()

Constructs a dominator tree. This method returns an array of the tree nodes. The first element of the array is the root of the tree.

The order of the elements is the same as that of the elements in the Block array returned by the basicBlocks method. If a Block object is at the i-th position in the Block array, then the Node object referring to that Block object is at the i-th position in the array returned by this method. For every array element node, its index in the array is equivalent to node.block().index(). @return an array of the tree nodes, or null if the method is abstract. @see Node#block() @see Block#index()

        testBlock(blocks[1], new int[] { 0 }, new int[] { 17, 11 } );
        testBlock(blocks[2], new int[] { 0, 6 }, new int[] { 19, 17 });
        testBlock(blocks[3], new int[] { 6, 11 }, new int[] { 19 });
        testBlock(blocks[4], new int[] { 11, 17 }, new int[] {});


        Node[] dom = cf.dominatorTree();
        assertNull(dom[0].parent());
        assertEquals(0, dom[1].parent().block().position());
        assertEquals(0, dom[2].parent().block().position());
        assertEquals(0, dom[3].parent().block().position());
        assertEquals(0, dom[4].parent().block().position());

        testBlock(blocks[0], new int[] { 7 }, new int[] { 14, 7 } );
        testBlock(blocks[1], new int[] { 0 }, new int[] { 0, 12 } );
        testBlock(blocks[2], new int[] { 7 }, new int[] {});
        testBlock(blocks[3], new int[] { 0 }, new int[] {});


        Node[] dom = cf.dominatorTree();
        assertNull(dom[0].parent());
        assertEquals(0, dom[1].parent().block().position());
        assertEquals(7, dom[2].parent().block().position());
        assertEquals(0, dom[3].parent().block().position());

        ControlFlow cf = new ControlFlow(pool.get(args[0]).getDeclaredMethod(args[1]));
        Block[] blocks = cf.basicBlocks();
        for (int i = 0; i < blocks.length; i++)
            System.out.println(i + ": " + blocks[i]);


        Node[] dom = cf.dominatorTree();
        for (int i = 0; i < dom.length; i++)
            System.out.println(i + ": " + dom[i]);


        Node[] pdom = cf.postDominatorTree();
        for (int i = 0; i < pdom.length; i++)

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.

Examples of dominatorTree()

Examples of javassist.bytecode.analysis.ControlFlow.dominatorTree()

Examples of javassist.bytecode.analysis.ControlFlow.dominatorTree()

Examples of javassist.bytecode.analysis.ControlFlow.dominatorTree()