Java GraphColoring.color方法代码示例

import com.google.javascript.jscomp.graph.GraphColoring; //导入方法依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  // TODO(user): We CAN do this in the global scope, just need to be
  // careful when something is exported. Liveness uses bit-vector for live
  // sets so I don't see compilation time will be a problem for running this
  // pass in the global scope.
  Scope scope = t.getScope();
  if (scope.isGlobal()) {
    return;
  }
  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();

  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<Var, Void>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}
 

import com.google.javascript.jscomp.graph.GraphColoring; //导入方法依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  // TODO(user): We CAN do this in the global scope, just need to be
  // careful when something is exported. Liveness uses bit-vector for live
  // sets so I don't see compilation time will be a problem for running this
  // pass in the global scope.
  if (t.inGlobalScope()) {
    return;
  }
  Scope scope = t.getScope();
  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();

  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  // If the function has exactly 2 params, mark them as escaped. This is
  // a work-around for an IE bug where it throws an exception if you
  // write to the parameters of the callback in a sort(). See:
  // http://code.google.com/p/closure-compiler/issues/detail?id=58
  if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
    liveness.markAllParametersEscaped();
  }
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<Var, Void>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}
 

import com.google.javascript.jscomp.graph.GraphColoring; //导入方法依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  Scope scope = t.getScope();
  if (!shouldOptimizeScope(scope)) {
    return;
  }

  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  // If the function has exactly 2 params, mark them as escaped. This is
  // a work-around for an IE bug where it throws an exception if you
  // write to the parameters of the callback in a sort(). See:
  // http://code.google.com/p/closure-compiler/issues/detail?id=58
  if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
    liveness.markAllParametersEscaped();
  }
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<Var, Void>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}
 

import com.google.javascript.jscomp.graph.GraphColoring; //导入方法依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  Scope scope = t.getScope();
  if (!shouldOptimizeScope(scope)) {
    return;
  }

  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  // If the function has exactly 2 params, mark them as escaped. This is
  // a work-around for an IE bug where it throws an exception if you
  // write to the parameters of the callback in a sort(). See:
  // http://code.google.com/p/closure-compiler/issues/detail?id=58
  if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
    liveness.markAllParametersEscaped();
  }
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}
 

import com.google.javascript.jscomp.graph.GraphColoring; //导入方法依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  Scope scope = t.getScope();
  if (!shouldOptimizeScope(t)) {
    return;
  }

  checkState(scope.isFunctionScope(), scope);

  // live variables analysis is based off of the control flow graph
  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();

  liveness =
      new LiveVariablesAnalysis(
          cfg, scope, null, compiler, new Es6SyntacticScopeCreator(compiler));

  if (compiler.getOptions().getLanguageOut() == CompilerOptions.LanguageMode.ECMASCRIPT3) {
    // If the function has exactly 2 params, mark them as escaped. This is a work-around for a
    // bug in IE 8 and below, where it throws an exception if you write to the parameters of the
    // callback in a sort(). See http://blickly.github.io/closure-compiler-issues/#58 and
    // https://www.zachleat.com/web/array-sort/
    Node enclosingFunction = scope.getRootNode();
    if (NodeUtil.getFunctionParameters(enclosingFunction).hasTwoChildren()) {
      liveness.markAllParametersEscaped();
    }
  }

  liveness.analyze();
  liveAnalyses.push(liveness);

  // The interference graph has the function's variables as its nodes and any interference
  // between the variables as the edges. Interference between two variables means that they are
  // alive at overlapping times, which means that their variable names cannot be coalesced.
  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(cfg, liveness.getEscapedLocals());

  // Color any interfering variables with different colors and any variables that can be safely
  // coalesced wih the same color.
  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<>(interferenceGraph, coloringTieBreaker);
  coloring.color();
  colorings.push(coloring);
}