import com.google.javascript.jscomp.ControlFlowGraph.AbstractCfgNodeTraversalCallback; //导入依赖的package包/类
/**
 * Computes all the local variables that rValue reads from and store that
 * in the def's depends set.
 */
private void computeDependence(final Definition def, Node rValue) {
  NodeTraversal.traverse(compiler, rValue,
      new AbstractCfgNodeTraversalCallback() {
    @Override
    public void visit(NodeTraversal t, Node n, Node parent) {
      if (n.isName()) {
        Var dep = jsScope.getVar(n.getString());
        if (dep == null) {
          def.unknownDependencies = true;
        } else {
          def.depends.add(dep);
        }
      }
    }
  });
}
 

import com.google.javascript.jscomp.ControlFlowGraph.AbstractCfgNodeTraversalCallback; //导入依赖的package包/类
/**
 * Computes all the local variables that rValue reads from and store that
 * in the def's depends set.
 */
private void computeDependence(final Definition def, Node rValue) {
  NodeTraversal.traverseEs6(
      compiler,
      rValue,
      new AbstractCfgNodeTraversalCallback() {
        @Override
        public void visit(NodeTraversal t, Node n, Node parent) {
          if (n.isName()) {
            Var dep = allVarsInFn.get(n.getString());
            if (dep == null) {
              def.unknownDependencies = true;
            } else {
              def.depends.add(dep);
            }
          }
        }
      });
}
 

import com.google.javascript.jscomp.ControlFlowGraph.AbstractCfgNodeTraversalCallback; //导入依赖的package包/类
/**
 * Computes all the local variables that rValue reads from and store that
 * in the def's depends set.
 */
private void computeDependence(final Definition def, Node rValue) {
  NodeTraversal.traverse(compiler, rValue,
      new AbstractCfgNodeTraversalCallback() {
    @Override
    public void visit(NodeTraversal t, Node n, Node parent) {
      if (NodeUtil.isName(n) && jsScope.isDeclared(n.getString(), false)) {
        def.depends.add(jsScope.getVar(n.getString()));
      }
    }
  });
}
 

import com.google.javascript.jscomp.ControlFlowGraph.AbstractCfgNodeTraversalCallback; //导入依赖的package包/类
/**
 * Computes all the local variables that rValue reads from and store that
 * in the def's depends set.
 */
private void computeDependence(final Definition def, Node rValue) {
  NodeTraversal.traverse(compiler, rValue,
      new AbstractCfgNodeTraversalCallback() {
    @Override
    public void visit(NodeTraversal t, Node n, Node parent) {
      if (NodeUtil.isName(n) && jsScope.isDeclared(n.getString(), true)) {
        def.depends.add(jsScope.getVar(n.getString()));
      }
    }
  });
}
 

import com.google.javascript.jscomp.ControlFlowGraph.AbstractCfgNodeTraversalCallback; //导入依赖的package包/类
/**
 * Computes the number of uses of the variable varName and store it in
 * numUseWithinUseCfgNode.
 */
private void getNumUseInUseCfgNode(final Node cfgNode) {

  numUsesWithinCfgNode = 0;
  AbstractCfgNodeTraversalCallback gatherCb =
      new AbstractCfgNodeTraversalCallback() {

        @Override
        public void visit(NodeTraversal t, Node n, Node parent) {
          if (n.isName() && n.getString().equals(varName)) {
            // We make a special exception when the entire cfgNode is a chain
            // of assignments, since in that case the assignment statements
            // will happen after the inlining of the right hand side.
            // TODO(blickly): Make the SIDE_EFFECT_PREDICATE check more exact
            //   and remove this special case.
            if (parent.isAssign() && (parent.getFirstChild() == n)
                && isAssignChain(parent, cfgNode)) {
              // Don't count lhs of top-level assignment chain
              return;
            } else {
              numUsesWithinCfgNode++;
            }
          }
        }

        private boolean isAssignChain(Node child, Node ancestor) {
          for (Node n = child; n != ancestor; n = n.getParent()) {
            if (!n.isAssign()) {
              return false;
            }
          }
          return true;
        }
      };

  NodeTraversal.traverseEs6(compiler, cfgNode, gatherCb);
}
 

import com.google.javascript.jscomp.ControlFlowGraph.AbstractCfgNodeTraversalCallback; //导入依赖的package包/类
/**
 * Computes the number of uses of the variable varName and store it in
 * numUseWithinUseCfgNode.
 */
private void getNumUseInUseCfgNode(final Node cfgNode) {

  numUsesWithinCfgNode = 0;
  AbstractCfgNodeTraversalCallback gatherCb =
      new AbstractCfgNodeTraversalCallback() {

    @Override
    public void visit(NodeTraversal t, Node n, Node parent) {
      if (n.isName() && n.getString().equals(varName)) {
        // We make a special exception when the entire cfgNode is a chain
        // of assignments, since in that case the assignment statements
        // will happen after the inlining of the right hand side.
        // TODO(blickly): Make the SIDE_EFFECT_PREDICATE check more exact
        //   and remove this special case.
        if (parent.isAssign() && (parent.getFirstChild() == n)
            && isAssignChain(parent, cfgNode)) {
          // Don't count lhs of top-level assignment chain
          return;
        } else {
          numUsesWithinCfgNode++;
        }
      }
    }

    private boolean isAssignChain(Node child, Node ancestor) {
      for (Node n = child; n != ancestor; n = n.getParent()) {
        if (!n.isAssign()) {
          return false;
        }
      }
      return true;
    }
  };

  NodeTraversal.traverse(compiler, cfgNode, gatherCb);
}