Examples of BlockNode

com.google.template.soy.soytree.SoyNode.BlockNode
com.vaadin.sass.internal.tree.BlockNode
edu.indiana.extreme.xbaya.graph.system.BlockNode
@author Satoshi Shirasuna
jadx.core.dex.nodes.BlockNode
org.apache.airavata.workflow.model.graph.system.BlockNode
org.apache.airavata.xbaya.graph.system.BlockNode
org.apache.flex.compiler.internal.tree.as.BlockNode
ActionScript parse tree node representing a block, but not one with an explicit scope
org.jruby.ast.BlockNode
Represents a block of nodes (read that as list).
st.gravel.support.compiler.ast.BlockNode

Examples of com.vaadin.sass.internal.tree.BlockNode

        nodeStack.pop();
    }


    @Override
    public void startSelector(ArrayList<String> selectors) throws CSSException {
        BlockNode node = new BlockNode(selectors);
        nodeStack.peek().appendChild(node);
        nodeStack.push(node);
    }

View Full Code Here

Examples of edu.indiana.extreme.xbaya.graph.system.BlockNode

        } else if (GraphSchema.NODE_TYPE_MEMO.equals(type)) {
            node = new MemoNode(nodeElement);
        } else if (GraphSchema.NODE_TYPE_RECEIVE.equals(type)) {
            node = new ReceiveNode(nodeElement);
        } else if (GraphSchema.NODE_TYPE_BLOCK.equals(type)) {
            node = new BlockNode(nodeElement);
        } else if (GraphSchema.NODE_TYPE_ENDBLOCK.equals(type)) {
            node = new EndBlockNode(nodeElement);
        } else if (GraphSchema.NODE_TYPE_INSTANCE.equals(type)) {
            node = new InstanceNode(nodeElement);
        } else if (GraphSchema.NODE_TYPE_TERMINATE.equals(type)) {

View Full Code Here

Examples of edu.indiana.extreme.xbaya.graph.system.BlockNode

    /**
     * @see edu.indiana.extreme.xbaya.component.Component#createNode(edu.indiana.extreme.xbaya.graph.Graph)
     */
    @Override
    public Node createNode(Graph graph) {
        BlockNode node = new BlockNode(graph);


        node.setName(NAME);
        node.setComponent(this);


        // Creates a unique ID for the node. This has to be after setName().
        node.createID();


        createPorts(node);


        return node;
    }

View Full Code Here

Examples of jadx.core.dex.nodes.BlockNode

    boolean changed;
    int k = 0;
    do {
      changed = false;
      for (int i = 0; i < blocksSize; i++) {
        BlockNode block = blocks.get(i);
        int blockId = block.getId();
        BitSet prevIn = liveIn[blockId];
        BitSet newIn = new BitSet(regsCount);
        List<BlockNode> successors = block.getSuccessors();
        for (int s = 0, successorsSize = successors.size(); s < successorsSize; s++) {
          newIn.or(liveIn[successors.get(s).getId()]);
        }
        newIn.andNot(defs[blockId]);
        newIn.or(uses[blockId]);

View Full Code Here

Examples of jadx.core.dex.nodes.BlockNode

          if (wrapInfo != null) {
            wrapList.add(wrapInfo);
          }
        } else {
          // another block
          BlockNode assignBlock = BlockUtils.getBlockByInsn(mth, assignInsn);
          if (assignBlock != null
              && assignInsn != arg.getParentInsn()
              && canMoveBetweenBlocks(assignInsn, assignBlock, block, argsInfo.getInsn())) {
            arg.wrapInstruction(assignInsn);
            InsnList.remove(assignBlock, assignInsn);

View Full Code Here

Examples of jadx.core.dex.nodes.BlockNode

    for (int id = assignBlocks.nextSetBit(0); id >= 0; id = assignBlocks.nextSetBit(id + 1)) {
      processed.set(id);
      workList.add(blocks.get(id));
    }
    while (!workList.isEmpty()) {
      BlockNode block = workList.pop();
      BitSet domFrontier = block.getDomFrontier();
      for (int id = domFrontier.nextSetBit(0); id >= 0; id = domFrontier.nextSetBit(id + 1)) {
        if (!hasPhi.get(id) && la.isLive(id, regNum)) {
          BlockNode df = blocks.get(id);
          addPhi(df, regNum);
          hasPhi.set(id);
          if (!processed.get(id)) {
            processed.set(id);
            workList.add(df);

View Full Code Here

Examples of jadx.core.dex.nodes.BlockNode

    }
    return splitReturn(mth);
  }


  private static BlockNode insertBlockBetween(MethodNode mth, BlockNode source, BlockNode target) {
    BlockNode newBlock = startNewBlock(mth, target.getStartOffset());
    newBlock.add(AFlag.SYNTHETIC);
    removeConnection(source, target);
    connect(source, newBlock);
    connect(newBlock, target);
    return newBlock;
  }

View Full Code Here

Examples of jadx.core.dex.nodes.BlockNode

   */
  private static boolean splitReturn(MethodNode mth) {
    if (mth.getExitBlocks().size() != 1) {
      return false;
    }
    BlockNode exitBlock = mth.getExitBlocks().get(0);
    if (exitBlock.getPredecessors().size() > 1
        && exitBlock.getInstructions().size() == 1
        && !exitBlock.contains(AFlag.SYNTHETIC)) {
      InsnNode returnInsn = exitBlock.getInstructions().get(0);
      List<BlockNode> preds = new ArrayList<BlockNode>(exitBlock.getPredecessors());
      if (returnInsn.getArgsCount() != 0 && !isReturnArgAssignInPred(preds, returnInsn)) {
        return false;
      }
      boolean first = true;
      for (BlockNode pred : preds) {
        BlockNode newRetBlock = startNewBlock(mth, exitBlock.getStartOffset());
        newRetBlock.add(AFlag.SYNTHETIC);
        InsnNode newRetInsn;
        if (first) {
          newRetInsn = returnInsn;
          first = false;
        } else {
          newRetInsn = duplicateReturnInsn(returnInsn);
        }
        newRetBlock.getInstructions().add(newRetInsn);
        removeConnection(pred, exitBlock);
        connect(pred, newRetBlock);
      }
      cleanExitNodes(mth);
      return true;

View Full Code Here

Examples of jadx.core.dex.nodes.BlockNode

    return false;
  }


  private static void cleanExitNodes(MethodNode mth) {
    for (Iterator<BlockNode> iterator = mth.getExitBlocks().iterator(); iterator.hasNext(); ) {
      BlockNode exitBlock = iterator.next();
      if (exitBlock.getPredecessors().isEmpty()) {
        mth.getBasicBlocks().remove(exitBlock);
        iterator.remove();
      }
    }
  }

View Full Code Here

Examples of org.apache.airavata.workflow.model.graph.system.BlockNode

    } else if (GraphSchema.NODE_TYPE_MEMO.equals(type)) {
      node = new MemoNode(nodeElement);
    } else if (GraphSchema.NODE_TYPE_RECEIVE.equals(type)) {
      node = new ReceiveNode(nodeElement);
    } else if (GraphSchema.NODE_TYPE_BLOCK.equals(type)) {
      node = new BlockNode(nodeElement);
    } else if (GraphSchema.NODE_TYPE_ENDBLOCK.equals(type)) {
      node = new EndBlockNode(nodeElement);
    } else if (GraphSchema.NODE_TYPE_INSTANCE.equals(type)) {
      node = new InstanceNode(nodeElement);
    } else if (GraphSchema.NODE_TYPE_TERMINATE.equals(type)) {

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.