Java DiGraphEdge.getValue方法代码示例

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
public boolean apply(DiGraphEdge<Node, ControlFlowGraph.Branch> input) {
  // First skill all exceptions.
  Branch branch = input.getValue();
  if (branch == Branch.ON_EX) {
    return false;
  } else if (branch.isConditional()) {
    Node condition = NodeUtil.getConditionExpression(
        input.getSource().getValue());
    // TODO(user): We CAN make this bit smarter just looking at
    // constants. We DO have a full blown ReverseAbstractInterupter and
    // type system that can evaluate some impressions' boolean value but
    // for now we will keep this pass lightweight.
    if (condition != null && NodeUtil.isLiteralValue(condition) ) {
      return NodeUtil.getBooleanValue(condition) ==
        (Branch.ON_TRUE == branch);
    }
  }
  return true;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
/**
 * Removes any optional parameters if no callers specifies it as an argument.
 * @param name The name of the function to optimize. 
 * @param edges All the references to this name.
 */
private void tryEliminateOptionalArgs(Name name,
    List<DiGraphEdge<Name, Reference>> edges) {
  
  // Count the maximum number of arguments passed into this function all
  // all points of the program.
  int maxArgs = -1;

  for (DiGraphEdge<Name, Reference> refEdge : edges) {
    Reference ref = refEdge.getValue();
    Node call = ref.parent;

    if (isCallSite(ref)) {
      int numArgs = call.getChildCount() - 1;
      if (numArgs > maxArgs) {
        maxArgs = numArgs;
      }
    } // else this is a definition or a dereference, ignore it.
  }

  for (Definition definition : name.getDeclarations()) {
    eliminateParamsAfter(definition.getRValue(), maxArgs);
  }
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
public boolean apply(DiGraphEdge<Node, ControlFlowGraph.Branch> input) {
  // First skill all exceptions.
  Branch branch = input.getValue();
  if (branch == Branch.ON_EX) {
    return false;
  } else if (branch.isConditional()) {
    Node condition = NodeUtil.getConditionExpression(
        input.getSource().getValue());
    // TODO(user): We CAN make this bit smarter just looking at
    // constants. We DO have a full blown ReverseAbstractInterupter and
    // type system that can evaluate some impressions' boolean value but
    // for now we will keep this pass lightweight.
    if (condition != null) {
      TernaryValue val = NodeUtil.getBooleanValue(condition);
      if (val != TernaryValue.UNKNOWN) {
        return val.toBoolean(true) == (Branch.ON_TRUE == branch);
      }
    }
  }
  return true;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
/**
 * Removes any optional parameters if no callers specifies it as an argument.
 * @param name The name of the function to optimize.
 * @param edges All the references to this name.
 */
private void tryEliminateOptionalArgs(Name name,
    List<DiGraphEdge<Name, Reference>> edges) {

  // Count the maximum number of arguments passed into this function all
  // all points of the program.
  int maxArgs = -1;

  for (DiGraphEdge<Name, Reference> refEdge : edges) {
    Reference ref = refEdge.getValue();
    Node call = ref.parent;

    if (isCallSite(ref)) {
      int numArgs = call.getChildCount() - 1;
      if (numArgs > maxArgs) {
        maxArgs = numArgs;
      }
    } // else this is a definition or a dereference, ignore it.
  }

  for (Definition definition : name.getDeclarations()) {
    eliminateParamsAfter(definition.getRValue(), maxArgs);
  }
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
@Override
public boolean apply(DiGraphEdge<Node, ControlFlowGraph.Branch> input) {
  // First skill all exceptions.
  Branch branch = input.getValue();
  if (branch == Branch.ON_EX) {
    return false;
  } else if (branch.isConditional()) {
    Node condition = NodeUtil.getConditionExpression(
        input.getSource().getValue());
    // TODO(user): We CAN make this bit smarter just looking at
    // constants. We DO have a full blown ReverseAbstractInterupter and
    // type system that can evaluate some impressions' boolean value but
    // for now we will keep this pass lightweight.
    if (condition != null) {
      TernaryValue val = NodeUtil.getImpureBooleanValue(condition);
      if (val != TernaryValue.UNKNOWN) {
        return val.toBoolean(true) == (Branch.ON_TRUE == branch);
      }
    }
  }
  return true;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
private void analyzeConditionalStmFwd(
    DiGraphNode<Node, ControlFlowGraph.Branch> stm, Node cond, TypeEnv inEnv) {
  for (DiGraphEdge<Node, ControlFlowGraph.Branch> outEdge :
      stm.getOutEdges()) {
    JSType specializedType;
    switch (outEdge.getValue()) {
      case ON_TRUE:
        specializedType = TRUTHY;
        break;
      case ON_FALSE:
        specializedType = FALSY;
        break;
      case ON_EX:
        specializedType = UNKNOWN;
        break;
      default:
        throw new RuntimeException(
            "Condition with an unexpected edge type: " + outEdge.getValue());
    }
    envs.put(outEdge,
        analyzeExprFwd(cond, inEnv, UNKNOWN, specializedType).env);
  }
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
@Override
List<ConstPropLatticeElement> branchedFlowThrough(Instruction node,
    ConstPropLatticeElement input) {
  List<ConstPropLatticeElement> result = new ArrayList<>();
  List<DiGraphEdge<Instruction, Branch>> outEdges = getCfg().getOutEdges(node);
  if (node.isArithmetic()) {
    assertThat(outEdges.size()).isLessThan(2);
    ConstPropLatticeElement aResult = flowThroughArithmeticInstruction(
        (ArithmeticInstruction) node, input);
    result.addAll(Collections.nCopies(outEdges.size(), aResult));
  } else {
    BranchInstruction branchInst = (BranchInstruction) node;
    for (DiGraphEdge<Instruction, Branch> branch : outEdges) {
      ConstPropLatticeElement edgeResult = new ConstPropLatticeElement(input);
      if (branch.getValue() == Branch.ON_FALSE &&
          branchInst.getCondition().isVariable()) {
        edgeResult.constMap.put((Variable) branchInst.getCondition(), 0);
      }
      result.add(edgeResult);
    }
  }
  return result;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
private void analyzeConditionalStmFwd(Node stm, Node cond, TypeEnv inEnv) {
  for (DiGraphEdge<Node, ControlFlowGraph.Branch> outEdge :
           cfg.getOutEdges(stm)) {
    JSType specializedType;
    switch (outEdge.getValue()) {
      case ON_TRUE:
        specializedType = JSType.TRUTHY;
        break;
      case ON_FALSE:
        specializedType = JSType.FALSY;
        break;
      case ON_EX:
        specializedType = JSType.UNKNOWN;
        break;
      default:
        throw new RuntimeException(
            "Condition with an unexpected edge type: " + outEdge.getValue());
    }
    envs.put(outEdge,
        analyzeExprFwd(cond, inEnv, JSType.UNKNOWN, specializedType).env);
  }
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
@Override
List<ConstPropLatticeElement> branchedFlowThrough(Instruction node,
    ConstPropLatticeElement input) {
  List<ConstPropLatticeElement> result = Lists.newArrayList();
  List<DiGraphEdge<Instruction, Branch>> outEdges = 
    getCfg().getOutEdges(node);
  if (node.isArithmetic()) {
    assertTrue(outEdges.size() < 2);
    ConstPropLatticeElement aResult = flowThroughArithmeticInstruction(
        (ArithmeticInstruction) node, input);
    for (DiGraphEdge<Instruction, Branch> _ : outEdges) {
      result.add(aResult);
    }
  } else {
    BranchInstruction branchInst = (BranchInstruction) node;
    for (DiGraphEdge<Instruction, Branch> branch : outEdges) {
      ConstPropLatticeElement edgeResult =
        new ConstPropLatticeElement(input);
      if (branch.getValue() == Branch.ON_FALSE &&
          branchInst.getCondition().isVariable()) {
        edgeResult.constMap.put((Variable) branchInst.getCondition(), 0);
      }
      result.add(edgeResult);
    }
  }
  return result;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
@Override
List<ConstPropLatticeElement> branchedFlowThrough(Instruction node,
    ConstPropLatticeElement input) {
  List<ConstPropLatticeElement> result = Lists.newArrayList();
  List<DiGraphEdge<Instruction, Branch>> outEdges =
    getCfg().getOutEdges(node);
  if (node.isArithmetic()) {
    assertTrue(outEdges.size() < 2);
    ConstPropLatticeElement aResult = flowThroughArithmeticInstruction(
        (ArithmeticInstruction) node, input);
    for (DiGraphEdge<Instruction, Branch> _ : outEdges) {
      result.add(aResult);
    }
  } else {
    BranchInstruction branchInst = (BranchInstruction) node;
    for (DiGraphEdge<Instruction, Branch> branch : outEdges) {
      ConstPropLatticeElement edgeResult =
        new ConstPropLatticeElement(input);
      if (branch.getValue() == Branch.ON_FALSE &&
          branchInst.getCondition().isVariable()) {
        edgeResult.constMap.put((Variable) branchInst.getCondition(), 0);
      }
      result.add(edgeResult);
    }
  }
  return result;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
private boolean hasExceptionHandler(Node cfgNode) {
  List<DiGraphEdge<Node, Branch>> branchEdges = getCfg().getOutEdges(cfgNode);
  for (DiGraphEdge<Node, Branch> edge : branchEdges) {
    if (edge.getValue() == Branch.ON_EX) {
      return true;
    }
  }
  return false;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
@Override
List<ConstPropLatticeElement> branchedFlowThrough(Instruction node,
    ConstPropLatticeElement input) {
  List<ConstPropLatticeElement> result = Lists.newArrayList();
  List<DiGraphEdge<Instruction, Branch>> outEdges =
    getCfg().getOutEdges(node);
  if (node.isArithmetic()) {
    assertTrue(outEdges.size() < 2);
    ConstPropLatticeElement aResult = flowThroughArithmeticInstruction(
        (ArithmeticInstruction) node, input);
    for (int i = 0; i < outEdges.size(); i++) {
      result.add(aResult);
    }
  } else {
    BranchInstruction branchInst = (BranchInstruction) node;
    for (DiGraphEdge<Instruction, Branch> branch : outEdges) {
      ConstPropLatticeElement edgeResult =
        new ConstPropLatticeElement(input);
      if (branch.getValue() == Branch.ON_FALSE &&
          branchInst.getCondition().isVariable()) {
        edgeResult.constMap.put((Variable) branchInst.getCondition(), 0);
      }
      result.add(edgeResult);
    }
  }
  return result;
}
 

import com.google.javascript.jscomp.graph.DiGraph.DiGraphEdge; //导入方法依赖的package包/类
private void traverseNodes(Node parent) throws IOException {
  // key
  int keyParent = key(parent);

  // edges
  for (Node child = parent.getFirstChild(); child != null;
      child = child.getNext()) {
    int keyChild = key(child);
    builder.append(INDENT);
    builder.append(formatNodeName(keyParent));
    builder.append(ARROW);
    builder.append(formatNodeName(keyChild));
    builder.append(" [weight=1];\n");

    traverseNodes(child);
  }

  // Flow Edges
  if (cfg != null && cfg.hasNode(parent)) {
    List<DiGraphEdge<Node, Branch>> outEdges =
      cfg.getOutEdges(parent);
    String[] edgeList = new String[outEdges.size()];
    for (int i = 0; i < edgeList.length; i++) {
      DiGraphEdge<Node, ControlFlowGraph.Branch> edge = outEdges.get(i);
      DiGraphNode<Node, Branch> succ = edge.getDestination();

      String toNode = null;
      if (succ == cfg.getImplicitReturn()) {
        toNode = "RETURN";
      } else {
        int keySucc = key(succ.getValue());
        toNode = formatNodeName(keySucc);
      }

      edgeList[i] =
          formatNodeName(keyParent) + ARROW + toNode + " [label=\"" + edge.getValue() + "\", "
          + "fontcolor=\"red\", "
          + "weight=0.01, color=\"red\"];\n";
    }

    Arrays.sort(edgeList);

    for (String element : edgeList) {
      builder.append(INDENT);
      builder.append(element);
    }
  }
}