Examples of BasicBlock

cfg.BasicBlock
class BasicBlock BasicBlock only maintains a vector of in-edges and a vector of out-edges.
com.ackgaming.entity.blocks.BasicBlock
com.android.dx.rop.code.BasicBlock
Basic block of register-based instructions.
com.google.havlak.shared.cfg.BasicBlock
class BasicBlock BasicBlock only maintains a vector of in-edges and a vector of out-edges.
com.google.javascript.jscomp.ReferenceCollectingCallback.BasicBlock
edu.umd.cs.findbugs.ba.BasicBlock
Simple basic block abstraction for BCEL. @author David Hovemeyer @see CFG
kilim.analysis.BasicBlock
A basic block is a contiguous set of instructions that has one label at the first instruction and a transfer-of-control instruction at the very end. A transfer-of-control instruction includes all branching instructions that have labelled targets (IF_x, GOTO, and JSR) and the rest (ATHROW, xRETURN, RET). There can be no target labels in the middle of a basic block; in other words, you can't jump into the middle of a basic block. This is the standard definition; we make a few changes.

We create BasicBlocks whenever we encounter a label (in a linear scanning of a method's instructions. Some labels are meant for catch handlers and debug (line number) information only; they are not the target of a branching instruction, but we don't know that in the first pass. We coalesce those BasicBlocks that merely follow another, provided the preceding BB is the only preceder. Note that blocks connected with a GOTO can't coalesce because they are not likely to be contiguous, even if they obey the constraint of a single edge. We also don't coalesce blocks starting with a pausable method invocation with their predecessor, because we need these blocks to tell us about downstream usage of local vars to help us generate optimal continuations.

All catch handlers that intersect a basic block are treated as successors to the block, for the purposes of liveness analysis.
Subroutines (targets of JSR) are treated specially. We inline all JSR calls, including nested JSRs, to simplify liveness analysis. In this phase, a JSR/RET is treated the same as a GOTO sub followed by a GOTO to the caller. During the weaving phase, we ignore the inlining information if the subroutine doesn't have any pausable methods. If it does, then we spit out duplicate code, complete with GOTOs as described above. This allows us to jump in the middle of a "finally" block during rewinding. Note: The JVM reference doesn't specify the boundaries of a JSR instruction; in other words, there is no definitive way of saying which blocks belong to a subroutine. This code treats the set of all nodes reachable via branching instructions from the subroutine's entry point. (exception catch blocks don't count)
org.jakstab.rtl.statements.BasicBlock
@author Johannes Kinder
org.jruby.ir.representations.BasicBlock
org.renjin.compiler.cfg.BasicBlock
org.teavm.model.BasicBlock
@author Alexey Andreev

Examples of edu.umd.cs.findbugs.ba.BasicBlock

            hasSynchronization = true;
        }


        Iterator<BasicBlock> i = cfg.blockIterator();
        while (i.hasNext()) {
            BasicBlock block = i.next();
            Iterator<InstructionHandle> j = block.instructionIterator();
            while (j.hasNext()) {
                InstructionHandle handle = j.next();


                Instruction ins = handle.getInstruction();
                if (ins instanceof InvokeInstruction) {

View Full Code Here

Examples of kilim.analysis.BasicBlock

        if (flow == null)
            return;
        // Make sure the merging is fine. There used to be a bug
        assertEquals("Lkilim/test/ex/ExA;", TypeDesc.mergeType("Lkilim/test/ex/ExC;", "Lkilim/test/ex/ExD;"));
        assertEquals("Lkilim/test/ex/ExA;", TypeDesc.mergeType("Lkilim/test/ex/ExD;", "Lkilim/test/ex/ExC;"));
        BasicBlock bb = getBBForMethod(flow, "join");
        assertTrue(bb != null);
        Frame f = bb.startFrame;
        // Check Locals
        // assertEquals("Lkilim/test/ex/ExFlow;", f.getLocal(0));
        assertEquals("Lkilim/test/ex/ExA;", f.getLocal(1).getTypeDesc());

View Full Code Here

Examples of org.jakstab.rtl.statements.BasicBlock

          }


          // Replay basic block up to the error state location
          if (transformerFactory instanceof PessimisticBasicBlockFactory) {
            for (CFAEdge edge : transformerFactory.getExistingOutEdges(last.getLocation())) {
              BasicBlock bb = (BasicBlock)edge.getTransformer();
              if (bb.containsLocation(e.getState().getLocation())) {
                logger.warn(bb.toStringUntil(e.getState().getLocation()));
                break;
              }
            }
            logger.warn("State before last statement in block:");
            logger.warn(e.getState());

View Full Code Here

Examples of org.jruby.ir.representations.BasicBlock


        boolean scopeHasLocalVarStores      = false;
        boolean scopeHasUnrescuedExceptions = false;


        CFG        cfg = scope.cfg();
        BasicBlock geb = cfg.getGlobalEnsureBB();


        if (slvpp != null) {
            scopeHasLocalVarStores      = slvpp.scopeHasLocalVarStores();
            scopeHasUnrescuedExceptions = slvpp.scopeHasUnrescuedExceptions();
        } else {
            // We dont require local-var load/stores to have been run.
            // If it is not run, we go conservative and add push/pop binding instrs. everywhere 
            scopeHasLocalVarStores      = true;
            scopeHasUnrescuedExceptions = false;
            for (BasicBlock bb: cfg.getBasicBlocks()) {
                // SSS FIXME: This is highly conservative.  If the bb has an exception raising instr.
                // and if we dont have a rescuer, only then do we have unrescued exceptions.
                if (cfg.getRescuerBBFor(bb) == null) {
                    scopeHasUnrescuedExceptions = true;
                    break;
                }
            }
        }


        BasicBlock entryBB = cfg.getEntryBB();


        // SSS FIXME: Right now, we always add push/pop frame instrs -- in the future, we may skip them
        // for certain scopes.
        //
        // Add explicit frame and binding push/pop instrs ONLY for methods -- we cannot handle this in closures and evals yet
        // If the scope uses $_ or $~ family of vars, has local load/stores, or if its binding has escaped, we have
        // to allocate a dynamic scope for it and add binding push/pop instructions.
        if ((scope instanceof IRMethod) || (scope instanceof IRScriptBody) || (scope instanceof IRModuleBody)) {
            if (scope.bindingHasEscaped() || scope.usesBackrefOrLastline() || scopeHasLocalVarStores || scopeHasUnrescuedExceptions) {
                // Push
                entryBB.addInstr(new PushFrameInstr());
                entryBB.addInstr(new PushBindingInstr(scope));


                // Allocate GEB if necessary for popping binding
                if (geb == null && (scopeHasLocalVarStores || scopeHasUnrescuedExceptions)) {
                    Variable exc = scope.getNewTemporaryVariable();
                    geb = new BasicBlock(cfg, new Label("_GLOBAL_ENSURE_BLOCK"));
                    geb.addInstr(new ReceiveExceptionInstr(exc, false)); // No need to check type since it is not used before rethrowing
                    geb.addInstr(new ThrowExceptionInstr(exc));
                    cfg.addGlobalEnsureBB(geb);
                }


                // Pop on all scope-exit paths
                BasicBlock exitBB = cfg.getExitBB();
                for (BasicBlock bb: cfg.getBasicBlocks()) {
                    ListIterator<Instr> instrs = bb.getInstrs().listIterator();
                    while (instrs.hasNext()) {
                        Instr i = instrs.next();
                        if ((bb != exitBB) && (i instanceof ReturnBase) || (i instanceof BreakInstr)) {

View Full Code Here

Examples of org.jruby.ir.representations.BasicBlock

        // Compute meet over all "sources" and compute "destination" basic blocks that should then be processed. 
        // sources & targets depends on direction of the data flow problem
        initSolnForNode();
        if (problem.getFlowDirection() == DataFlowProblem.DF_Direction.FORWARD) {
            for (Edge e: problem.getScope().cfg().getIncomingEdges(basicBlock)) {
                BasicBlock b = (BasicBlock)e.getSource().getData();
                compute_MEET(e, b, problem.getFlowGraphNode(b));
            }
        } else if (problem.getFlowDirection() == DataFlowProblem.DF_Direction.BACKWARD) {
            for (Edge e: problem.getScope().cfg().getOutgoingEdges(basicBlock)) {
                BasicBlock b = (BasicBlock)e.getDestination().getData();
                compute_MEET(e, b, problem.getFlowGraphNode(b));
            }
        } else {
            throw new RuntimeException("Bidirectional data flow computation not implemented yet!");
        }

View Full Code Here

Examples of org.jruby.ir.representations.BasicBlock

            scopeHasUnrescuedExceptions = scopeHasUnrescuedExceptions || bbHasUnrescuedExceptions;
            scopeHasLocalVarStores      = scopeHasLocalVarStores || bbAddedStores;
        }


        // Allocate global-ensure block, if necessary
        BasicBlock geb = null;
        if ((mightRequireGlobalEnsureBlock == true) && !dirtyVars.isEmpty()) {
            Variable exc = cfgScope.getNewTemporaryVariable();
            geb = new BasicBlock(cfg, new Label("_GLOBAL_ENSURE_BLOCK"));
            geb.addInstr(new ReceiveExceptionInstr(exc, false)); // No need to check type since it is not used before rethrowing
            for (LocalVariable v : dirtyVars) {
                Operand value = varRenameMap.get(v);
                if (value == null) {
                    value = cfgScope.getNewTemporaryVariable("%t_" + v.getName());
                    varRenameMap.put(v, value);
                }
                geb.addInstr(new StoreLocalVarInstr(value, (IRClosure) cfgScope, v));
            }
            geb.addInstr(new ThrowExceptionInstr(exc));
            cfg.addGlobalEnsureBB(geb);
        }
    }

View Full Code Here

Examples of org.jruby.ir.representations.BasicBlock

        Integer[] bbToPoNumbers = new Integer[maxNodeId + 1]; // Set up a map of bbid -> post order numbering
        BasicBlock[] poNumbersToBB = new BasicBlock[maxNodeId + 1];
        int n = 0;
        ListIterator<BasicBlock> it = postOrderList.listIterator();
        while (it.hasNext()) {
            BasicBlock b = it.next();
            bbToPoNumbers[b.getID()] = n;
            poNumbersToBB[n] = b;
            n++;
        }


        // Construct the dominator sets using the fast dominance algorithm by
        // Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy.
        // http://www.cs.rice.edu/~keith/EMBED/dom.pdf (tip courtesy Slava Pestov)
        //
        // Faster than the standard iterative data-flow algorithm
        //
        // This maps a bb's post-order number to the bb's idom post-order number.
        // We convert this po-number -> po-number map to a bb -> bb map later on!
        Integer[] idoms = new Integer[maxNodeId + 1];


        BasicBlock root = cfg.getEntryBB();
        Integer rootPoNumber = bbToPoNumbers[root.getID()];
        idoms[rootPoNumber] = rootPoNumber;


        boolean changed = true;
        while (changed) {
            changed = false;
            it = postOrderList.listIterator(cfg.size());
            while (it.hasPrevious()) {
                BasicBlock b = it.previous();
                if (b == root) continue;


                // Non-root -- process it
                Integer bPoNumber = bbToPoNumbers[b.getID()];
                Integer oldBIdom = idoms[bPoNumber];
                Integer newBIdom = null;


                // newBIdom is initialized to be some (first-encountered, for ex.) processed predecessor of 'b'.
                for (BasicBlock src : cfg.getIncomingSources(b)) {

View Full Code Here

Examples of org.jruby.ir.representations.BasicBlock

            //
            // Note that Throwable also catches IRReturnJump and IRBreakJump.  There is
            // nothing special to do for IRReturnJump.  But, break-jumps have extra
            // logic.  So, all handlers need to check if the handler is a IRBreakJump
            // and take action accordingly.
            BasicBlock rBB = cfg().getRescuerBBFor(b);
            BasicBlock eBB = cfg().getEnsurerBBFor(b);
            if ((eBB != null) && (rBB == eBB || rBB == null)) {
                // 1. same rescue and ensure handler ==> just spit out one entry with a Throwable class
                // 2. only ensure handler            ==> just spit out one entry with a Throwable class
                //
                // The rescue handler knows whether to unwrap or not.  But for now, the rescue handler
                // has to process its recv_exception instruction as
                //    e = (e instanceof RaiseException) ? unwrap(e) : e;


                etEntries.add(new Object[] {b.getLabel(), eBB.getLabel(), Throwable.class});
            } else if (rBB != null) {
                // Unrescuable comes before Throwable
                if (eBB != null) etEntries.add(new Object[] {b.getLabel(), eBB.getLabel(), Unrescuable.class});
                etEntries.add(new Object[] {b.getLabel(), rBB.getLabel(), Throwable.class});
            }
        }


        // SSS FIXME: This could be optimized by compressing entries for adjacent BBs that have identical handlers

View Full Code Here

Examples of org.jruby.ir.representations.BasicBlock

        depends(cfg());
        
        for (BasicBlock b : linearizedBBList) {
            for (Instr i : b.getInstrs()) {
                if (i == excInstr) {
                    BasicBlock rescuerBB = cfg().getRescuerBBFor(b);
                    return (rescuerBB == null) ? -1 : rescuerBB.getLabel().getTargetPC();
                }
            }
        }


        // SSS FIXME: Cannot happen! Throw runtime exception

View Full Code Here

Examples of org.renjin.compiler.cfg.BasicBlock

    
    
    // just before branching in basic block #2,
    // we need phi functions for all 4 variables
    
    BasicBlock bb2 = cfg.getBasicBlocks().get(1);
    assertThat(bb2.getStatements().size(), equalTo(5));
   
    System.out.println(cfg);
  }

View Full Code Here

0 1 2 3 4 5

TOP

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.