All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.javascript.jscomp.AggressiveInlineAliases Maven / Gradle / Ivy

Go to download

Closure Compiler is a JavaScript optimizing compiler. It parses your JavaScript, analyzes it, removes dead code and rewrites and minimizes what's left. It also checks syntax, variable references, and types, and warns about common JavaScript pitfalls. It is used in many of Google's JavaScript apps, including Gmail, Google Web Search, Google Maps, and Google Docs.

There is a newer version: v20240317
Show newest version
/*
 * Copyright 2016 The Closure Compiler Authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.javascript.jscomp;

import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.base.Preconditions.checkState;

import com.google.common.annotations.VisibleForTesting;
import com.google.common.base.Preconditions;
import com.google.common.base.Predicates;
import com.google.javascript.jscomp.GlobalNamespace.AstChange;
import com.google.javascript.jscomp.GlobalNamespace.Inlinability;
import com.google.javascript.jscomp.GlobalNamespace.Name;
import com.google.javascript.jscomp.GlobalNamespace.Ref;
import com.google.javascript.jscomp.GlobalNamespace.Ref.Type;
import com.google.javascript.rhino.IR;
import com.google.javascript.rhino.Node;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Set;
import javax.annotation.Nullable;

/**
 * Inlines type aliases if they are explicitly or effectively const. Also inlines inherited static
 * property accesses for ES6 classes.
 *
 * 

This frees subsequent optimization passes from the responsibility of having to reason about * alias chains and is a requirement for correct behavior in at least CollapseProperties and * J2clPropertyInlinerPass. * *

This is designed to be no more unsafe than CollapseProperties. It will in some cases inline * properties, possibly past places that change the property value. However, it will only do so in * cases where CollapseProperties would unsafely collapse the property anyway. */ class AggressiveInlineAliases implements CompilerPass { static final DiagnosticType UNSAFE_CTOR_ALIASING = DiagnosticType.warning( "JSC_UNSAFE_CTOR_ALIASING", "Variable {0} aliases a constructor, " + "so it cannot be assigned multiple times"); private final AbstractCompiler compiler; private boolean codeChanged; private GlobalNamespace namespace; AggressiveInlineAliases(AbstractCompiler compiler) { this.compiler = compiler; this.codeChanged = true; } @VisibleForTesting GlobalNamespace getLastUsedGlobalNamespace() { return namespace; } @Override public void process(Node externs, Node root) { new StaticSuperPropReplacer(compiler).replaceAll(root); NodeTraversal.traverse(compiler, root, new RewriteSimpleDestructuringAliases()); // Building the `GlobalNamespace` dominates the cost of this pass, so it is built once and // updated as changes are made so it can be reused for the next iteration. this.namespace = new GlobalNamespace(compiler, root); while (codeChanged) { codeChanged = false; inlineAliases(namespace); } } private JSModule getRefModule(Reference ref) { CompilerInput input = compiler.getInput(ref.getInputId()); return input == null ? null : input.getModule(); } /** * Rewrite "simple" destructuring aliases to a format that is more amenable to inlining. * *

To be specific, this rewrites aliases of the form: const {x} = qualified.name; to: const x = * qualified.name.x; */ private static class RewriteSimpleDestructuringAliases extends NodeTraversal.AbstractPostOrderCallback { public boolean isSimpleDestructuringAlias(Node n) { if (!NodeUtil.isStatement(n) || !n.isConst()) { return false; } checkState(n.hasOneChild()); Node destructuringLhs = n.getFirstChild(); if (!destructuringLhs.isDestructuringLhs()) { return false; } Node objectPattern = destructuringLhs.getFirstChild(); if (!objectPattern.isObjectPattern()) { return false; } Node rhs = destructuringLhs.getLastChild(); if (!rhs.isQualifiedName()) { return false; } for (Node key : objectPattern.children()) { if (!key.isStringKey() || key.isQuotedString()) { return false; } checkState(key.hasOneChild()); Node identifier = key.getFirstChild(); if (!identifier.isName()) { return false; } } return true; } @Override public void visit(NodeTraversal t, Node n, Node parent) { if (!isSimpleDestructuringAlias(n)) { return; } Node insertionPoint = n; Node destructuringLhs = n.getFirstChild(); Node objectPattern = destructuringLhs.getFirstChild(); Node rhs = destructuringLhs.getLastChild(); for (Node key : objectPattern.children()) { Node identifier = key.getFirstChild(); Node newRhs = IR.getprop(rhs.cloneTree(), IR.string(key.getString()).srcref(key)).srcref(identifier); Node newConstNode = IR.constNode(identifier.detach(), newRhs).srcref(n); insertionPoint.getParent().addChildAfter(newConstNode, insertionPoint); insertionPoint = newConstNode; } n.detach(); t.reportCodeChange(); } } /** * For each qualified name N in the global scope, we check if: (a) No ancestor of N is ever * aliased or assigned an unknown value type. (If N = "a.b.c", "a" and "a.b" are never aliased). * (b) N has exactly one write, and it lives in the global scope. (c) N is aliased in a local * scope. (d) N is aliased in global scope * *

If (a) is true, then GlobalNamespace must know all the writes to N. If (a) and (b) are true, * then N cannot change during the execution of a local scope. If (a) and (b) and (c) are true, * then the alias can be inlined if the alias obeys the usual rules for how we decide whether a * variable is inlineable. If (a) and (b) and (d) are true, then inline the alias if possible (if * it is assigned exactly once unconditionally). * *

For (a), (b), and (c) are true and the alias is of a constructor, we may also partially * inline the alias - i.e. replace some references with the constructor but not all - since * constructor properties are always collapsed, so we want to be more aggressive about removing * aliases. This is similar to what FlowSensitiveInlineVariables does. * *

If (a) is not true, but the property is a 'declared type' (which CollapseProperties will * unsafely collapse), we also inline any properties without @nocollapse. This is unsafe but no * more unsafe than what CollapseProperties does. This pass and CollapseProperties share the logic * to determine when a name is unsafely collapsible in {@link Name#canCollapse()} * * @see InlineVariables */ private void inlineAliases(GlobalNamespace namespace) { // Invariant: All the names in the worklist meet condition (a). // adds all top-level names to the worklist, but not any properties on those names. Deque workList = new ArrayDeque<>(namespace.getNameForest()); while (!workList.isEmpty()) { Name name = workList.pop(); // Don't attempt to inline a getter or setter property as a variable. if (name.isGetOrSetDefinition()) { continue; } if (!name.inExterns() // not an externs definition && name.getGlobalSets() == 1 // set exactly once and only set in the global scope && name.getLocalSets() == 0) { // {@code name} meets condition (b). Find all of its aliases // and try to inline them. maybeInlineInnerName(name); if (name.getAliasingGets() > 0 || name.getSubclassingGets() > 0) { // condition (c) and/or condition (d) are true inlineAliasesForName(name, namespace); } } maybeAddPropertiesToWorklist(name, workList); } } /** * Inlines a global name into all the places where references for aliases to it currently exist. * *

e.g. * *


   *   const globalName = { method() {} };
   *   const aliasForGlobalName = globalName;
   *   aliasForGlobalName.method(); // replace this with globalName.method();
   * 
* *

This method only handles aliases created by assignment. In particular, it doesn't handle * aliases created by inner names on class or function expressions. See (maybeInlineInnerName() * for that). * * @param name the global name whose aliases will be replaced * @param namespace used to find references to the global name that create aliases e.g. {@code * const aliasName = globalName}. */ private void inlineAliasesForName(Name name, GlobalNamespace namespace) { List refs = new ArrayList<>(name.getRefs()); for (Ref ref : refs) { Scope hoistScope = ref.scope.getClosestHoistScope(); if (ref.type == Type.ALIASING_GET && !mayBeGlobalAlias(ref) && ref.getTwin() == null) { // {@code name} meets condition (c). Try to inline it. // TODO(johnlenz): consider picking up new aliases at the end // of the pass instead of immediately like we do for global // inlines. inlineAliasIfPossible(name, ref, namespace); } else if (ref.type == Type.ALIASING_GET && hoistScope.isGlobal() && ref.getTwin() == null) { // ignore aliases in chained assignments inlineGlobalAliasIfPossible(name, ref, namespace); } else if (name.isClass() && ref.type == Type.SUBCLASSING_GET && name.props != null) { for (Name prop : name.props) { rewriteAllSubclassInheritedAccesses(name, ref, prop, namespace); } } } } /** * If the global name is a class or function with an inner-scope name, inline references to that * name with the global name. * *

e.g. * *


   *   var globalFunction = function innerName() {
   *     // change this to globalFunction.someProp
   *     use(innerName.someProp);
   *   }
   *   var GlobalClass = class InnerName {
   *     method() {
   *       // change this to GlobalClass.someProp
   *       use(InnerName.someProp);
   *     }
   *   };
   * 
*/ private void maybeInlineInnerName(Name globalName) { final Ref globalNameDeclaration = checkNotNull(globalName.getDeclaration(), globalName); final Node globalDeclarationNode = checkNotNull(globalNameDeclaration.getNode(), globalNameDeclaration); final Node valueNode = NodeUtil.getRValueOfLValue(globalDeclarationNode); if (valueNode == null) { // no function or class expression, so no inner name return; } final Node innerNameNode = maybeGetInnerNameNode(valueNode); if (innerNameNode == null) { // no inner name to require inlining return; } final String innerName = innerNameNode.getString(); final SyntacticScopeCreator syntacticScopeCreator = new SyntacticScopeCreator(compiler); final Scope innerScope = syntacticScopeCreator.createScope(valueNode, globalNameDeclaration.scope); final Var innerNameVar = checkNotNull(innerScope.getVar(innerName)); final ReferenceCollectingCallback collector = new ReferenceCollectingCallback( compiler, ReferenceCollectingCallback.DO_NOTHING_BEHAVIOR, syntacticScopeCreator, Predicates.equalTo(innerNameVar)); collector.processScope(innerScope); final ReferenceCollection innerNameRefs = collector.getReferences(innerNameVar); final Set newNodes = new LinkedHashSet<>(); for (Reference innerNameRef : innerNameRefs) { // replace all references to the inner name other than its declaration final Node innerNameRefNode = innerNameRef.getNode(); if (NodeUtil.isGet(innerNameRefNode.getParent())) { // Replace `innerName` with `globalName` for `innerName.prop` and `innerName[expr]` // // TODO(b/148237949): We are intentionally ignoring cases where the inner name // escapes to other scopes where properties may be accessed on it (e.g. `use(InnerName)`). // This is unsafe, but currently necessary to avoid large code size regressions. // // NOTE: We also don't want to introduce a global reference for cases like // `x instanceof innerName`. It would be safe to inline these, but it also isn't necessary, // and the introduction of a reference to a global in a local scope can cause other // optimizations to back off. newNodes.add(replaceAliasReference(globalNameDeclaration, innerNameRef)); } } namespace.scanNewNodes(newNodes); } @Nullable private static Node maybeGetInnerNameNode(Node maybeFunctionOrClassNode) { if (NodeUtil.isFunctionExpression(maybeFunctionOrClassNode)) { Node nameNode = maybeFunctionOrClassNode.getFirstChild(); checkState(nameNode.isName(), nameNode); // functions with no name have a NAME node with an empty string return nameNode.getString().isEmpty() ? null : nameNode; } else if (NodeUtil.isClassExpression(maybeFunctionOrClassNode)) { Node nameNode = maybeFunctionOrClassNode.getFirstChild(); // classes with no name have an EMPTY node first child return nameNode.isName() ? nameNode : null; } else { return null; // not a function or class expression } } /** * Adds properties of `name` to the worklist if the following conditions hold: * *
    *
  1. 1. The given property of `name` either meets condition (a) or is unsafely collapsible (as * defined by {@link Name#canCollapse()} *
  2. 2. `name` meets condition (b) *
* * This only adds direct properties of a name, not all its descendants. For example, this adds * `a.b` given `a`, but not `a.b.c`. */ private static void maybeAddPropertiesToWorklist(Name name, Deque workList) { if (!(name.isObjectLiteral() || name.isFunction() || name.isClass())) { // Don't add properties for things like `Foo` in // const Foo = someMysteriousFunctionCall(); // Since `Foo` is not declared as an object, class, or function literal, assume its value // may be aliased somewhere and its properties do not meet condition (a). return; } if (isUnsafelyReassigned(name)) { // Don't add properties if this was assigned multiple times, except for 'safe' reassignments: // var ns = ns || {}; // This is equivalent to condition (b) return; } if (name.props == null) { return; } if (name.getAliasingGets() == 0) { // All of {@code name}'s children meet condition (a), so they can be // added to the worklist. workList.addAll(name.props); } else { // The children do NOT meet condition (a) but we may try to add them anyway. // This is because CollapseProperties will unsafely collapse properties on constructors and // enums, so we want to be more aggressive about inlining references to their children. for (Name property : name.props) { // Only add properties that would be unsafely collapsed by CollapseProperties if (property.canCollapse()) { workList.add(property); } } } } /** * Inline all references to inherited static superclass properties from the subclass or any * descendant of the given subclass. Avoids inlining references to inherited methods when * possible, since they may use this or super(). * * @param superclassNameObj The Name of the superclass * @param superclassRef The SUBCLASSING_REF * @param prop The property on the superclass to rewrite, if any descendant accesses it. * @param namespace The GlobalNamespace containing superclassNameObj */ private boolean rewriteAllSubclassInheritedAccesses( Name superclassNameObj, Ref superclassRef, Name prop, GlobalNamespace namespace) { if (!prop.canCollapse()) { return false; // inlining is a) unnecessary if there is @nocollapse and b) might break // usages of `this` in the method } Node subclass = getSubclassForEs6Superclass(superclassRef.getNode()); if (subclass == null || !subclass.isQualifiedName()) { return false; } String subclassName = subclass.getQualifiedName(); String subclassQualifiedPropName = subclassName + "." + prop.getBaseName(); Name subclassPropNameObj = namespace.getOwnSlot(subclassQualifiedPropName); // Don't rewrite if the subclass ever shadows the parent static property. // This may also back off on cases where the subclass first accesses the parent property, then // shadows it. if (subclassPropNameObj != null && (subclassPropNameObj.getLocalSets() > 0 || subclassPropNameObj.getGlobalSets() > 0)) { return false; } // Recurse to find potential sub-subclass accesses of the superclass property. Name subclassNameObj = namespace.getOwnSlot(subclassName); if (subclassNameObj != null && subclassNameObj.subclassingGetCount() > 0) { for (Ref ref : subclassNameObj.getRefs()) { if (ref.type == Type.SUBCLASSING_GET) { rewriteAllSubclassInheritedAccesses(superclassNameObj, ref, prop, namespace); } } } if (subclassPropNameObj != null) { Set newNodes = new LinkedHashSet<>(); // Use this node as a template for rewriteNestedAliasReference. Node superclassNameNode = superclassNameObj.getDeclaration().getNode(); if (superclassNameNode.isName()) { superclassNameNode = superclassNameNode.cloneNode(); } else if (superclassNameNode.isGetProp()) { superclassNameNode = superclassNameNode.cloneTree(); } else { return false; } rewriteNestedAliasReference(superclassNameNode, 0, newNodes, subclassPropNameObj); namespace.scanNewNodes(newNodes); } return true; } /** * Returns true if the alias is possibly defined in the global scope, which we handle with more * caution than with locally scoped variables. May return false positives. * * @param alias An aliasing get. * @return If the alias is possibly defined in the global scope. */ private static boolean mayBeGlobalAlias(Ref alias) { // Note: alias.scope is the closest scope in which the aliasing assignment occurred. // So for "if (true) { var alias = aliasedVar; }", the alias.scope would be the IF block scope. if (alias.scope.isGlobal()) { return true; } // If the scope in which the alias is assigned is not global, look up the LHS of the assignment. Node aliasParent = alias.getNode().getParent(); if (!aliasParent.isAssign() && !aliasParent.isName()) { // Only handle variable assignments and initializing declarations. return true; } Node aliasLhsNode = aliasParent.isName() ? aliasParent : aliasParent.getFirstChild(); if (!aliasLhsNode.isName()) { // Only handle assignments to simple names, not qualified names or GETPROPs. return true; } String aliasVarName = aliasLhsNode.getString(); Var aliasVar = alias.scope.getVar(aliasVarName); if (aliasVar != null) { return aliasVar.isGlobal(); } return true; } /** * Attempts to inline a non-global alias of a global name. * *

It is assumed that the name for which it is an alias meets conditions (a) and (b). * *

The non-global alias is only inlinable if it is well-defined and assigned once, according to * the definitions in {@link ReferenceCollection} * *

If the aliasing name is completely removed, also deletes the aliasing Ref. * * @param name The global name being aliased * @param alias The aliasing reference to the name to remove */ private void inlineAliasIfPossible(Name name, Ref alias, GlobalNamespace namespace) { // Ensure that the alias is assigned to a local variable at that // variable's declaration. If the alias's parent is a NAME, // then the NAME must be the child of a VAR, LET, or CONST node, and we must // be in a VAR, LET, or CONST assignment. // Otherwise if the parent is an assign, we are in a "a = alias" case. Node aliasParent = alias.getNode().getParent(); if (aliasParent.isName() || aliasParent.isAssign()) { Node aliasLhsNode = aliasParent.isName() ? aliasParent : aliasParent.getFirstChild(); String aliasVarName = aliasLhsNode.getString(); Var aliasVar = alias.scope.getVar(aliasVarName); checkState(aliasVar != null, "Expected variable to be defined in scope", aliasVarName); ReferenceCollectingCallback collector = new ReferenceCollectingCallback( compiler, ReferenceCollectingCallback.DO_NOTHING_BEHAVIOR, new SyntacticScopeCreator(compiler), Predicates.equalTo(aliasVar)); Scope aliasScope = aliasVar.getScope(); collector.processScope(aliasScope); ReferenceCollection aliasRefs = collector.getReferences(aliasVar); Set newNodes = new LinkedHashSet<>(); if (aliasRefs.isWellDefined() && aliasRefs.isAssignedOnceInLifetime()) { // The alias is well-formed, so do the inlining now. int size = aliasRefs.references.size(); // It's initialized on either the first or second reference. int firstRead = aliasRefs.references.get(0).isInitializingDeclaration() ? 1 : 2; for (int i = firstRead; i < size; i++) { Reference aliasRef = aliasRefs.references.get(i); newNodes.add(replaceAliasReference(alias, aliasRef)); } // just set the original alias to null. tryReplacingAliasingAssignment(alias, aliasLhsNode); // Inlining the variable may have introduced new references // to descendants of {@code name}. So those need to be collected now. namespace.scanNewNodes(newNodes); return; } if (name.isConstructor()) { // TODO(lharker): the main reason this was added is because method decomposition inside // generators introduces some constructor aliases that weren't getting inlined. // If we find another (safer) way to avoid aliasing in method decomposition, consider // removing this. if (!partiallyInlineAlias(alias, namespace, aliasRefs, aliasLhsNode)) { // If we can't inline all alias references, make sure there are no unsafe property // accesses. if (referencesCollapsibleProperty(aliasRefs, name, namespace)) { compiler.report(JSError.make(aliasParent, UNSAFE_CTOR_ALIASING, aliasVarName)); } } } } } /** * Inlines some references to an alias with its value. This handles cases where the alias is not * declared at initialization. It does nothing if the alias is reassigned after being initialized, * unless the reassignment occurs because of an enclosing function or a loop. * * @param alias An alias of some variable, which may not be well-defined. * @param namespace The GlobalNamespace, which will be updated with all new nodes created. * @param aliasRefs All references to the alias in its scope. * @param aliasLhsNode The lhs name of the alias when it is first initialized. * @return Whether all references to the alias were inlined */ private boolean partiallyInlineAlias( Ref alias, GlobalNamespace namespace, ReferenceCollection aliasRefs, Node aliasLhsNode) { BasicBlock aliasBlock = null; // This initial iteration through all the alias references does two things: // a) Find the control flow block in which the alias is assigned. // b) See if the alias var is assigned to in multiple places, and return if that's the case. // NOTE: we still may inline if the alias is assigned in a loop or inner function and that // assignment statement is potentially executed multiple times. // This is more aggressive than what "inlineAliasIfPossible" does. for (Reference aliasRef : aliasRefs) { Node aliasRefNode = aliasRef.getNode(); if (aliasRefNode == aliasLhsNode) { aliasBlock = aliasRef.getBasicBlock(); continue; } else if (aliasRef.isLvalue()) { // Don't replace any references if the alias is reassigned return false; } } Set newNodes = new LinkedHashSet<>(); boolean alreadySeenInitialAlias = false; boolean foundNonReplaceableAlias = false; // Do a second iteration through all the alias references, and replace any inlinable references. for (Reference aliasRef : aliasRefs) { Node aliasRefNode = aliasRef.getNode(); if (aliasRefNode == aliasLhsNode) { alreadySeenInitialAlias = true; continue; } else if (aliasRef.isDeclaration()) { // Ignore any alias declarations, e.g. "var alias;", since there's nothing to inline. continue; } BasicBlock refBlock = aliasRef.getBasicBlock(); if ((refBlock != aliasBlock && aliasBlock.provablyExecutesBefore(refBlock)) || (refBlock == aliasBlock && alreadySeenInitialAlias)) { // We replace the alias only if the alias and reference are in the same BasicBlock, // the aliasing assignment takes place before the reference, and the alias is // never reassigned. codeChanged = true; newNodes.add(replaceAliasReference(alias, aliasRef)); } else { foundNonReplaceableAlias = true; } } // We removed all references to the alias, so remove the original aliasing assignment. if (!foundNonReplaceableAlias) { tryReplacingAliasingAssignment(alias, aliasLhsNode); } if (codeChanged) { // Inlining the variable may have introduced new references // to descendants of {@code name}. So those need to be collected now. namespace.scanNewNodes(newNodes); } return !foundNonReplaceableAlias; } /** * Replaces the rhs of an aliasing assignment with null, unless the assignment result is used in a * complex expression. */ private boolean tryReplacingAliasingAssignment(Ref alias, Node aliasLhsNode) { // either VAR/CONST/LET or ASSIGN. Node assignment = aliasLhsNode.getParent(); if (!NodeUtil.isNameDeclaration(assignment) && NodeUtil.isExpressionResultUsed(assignment)) { // e.g. don't change "if (alias = someVariable)" to "if (alias = null)" // TODO(lharker): instead replace the entire assignment with the RHS - "alias = x" becomes "x" return false; } Node aliasParent = alias.getNode().getParent(); aliasParent.replaceChild(alias.getNode(), IR.nullNode()); alias.name.removeRef(alias); codeChanged = true; compiler.reportChangeToEnclosingScope(aliasParent); return true; } /** * Returns whether a ReferenceCollection for some aliasing variable references a property on the * original aliased variable that may be collapsed in CollapseProperties. * *

See {@link GlobalNamespace.Name#canCollapse} for what can/cannot be collapsed. */ private static boolean referencesCollapsibleProperty( ReferenceCollection aliasRefs, Name aliasedName, GlobalNamespace namespace) { for (Reference ref : aliasRefs.references) { if (ref.getParent() == null) { continue; } if (ref.getParent().isGetProp()) { Node propertyNode = ref.getNode().getNext(); // e.g. if the reference is "alias.b.someProp", this will be "b". String propertyName = propertyNode.getString(); // e.g. if the aliased name is "originalName", this will be "originalName.b". String originalPropertyName = aliasedName.getName() + "." + propertyName; Name originalProperty = namespace.getOwnSlot(originalPropertyName); // If the original property isn't in the namespace or can't be collapsed, keep going. if (originalProperty == null || !originalProperty.canCollapse()) { continue; } return true; } } return false; } /** * @param alias A GlobalNamespace.Ref of the variable being aliased * @param aliasRef One particular usage of an alias that we want to replace with the aliased var. * @return an AstChange representing the new node(s) added to the AST * */ private AstChange replaceAliasReference(Ref alias, Reference aliasRef) { final Node originalRefNode = alias.getNode(); final Node nodeToReplace = aliasRef.getNode(); checkState(nodeToReplace.isQualifiedName(), nodeToReplace); // If the reference node is a NAME it could be // const origName = value; // If we use cloneTree() for that we'll clone the value, which we don't want. // Otherwise, we do want to clone the tree of GETPROP nodes. final Node newNode = originalRefNode.isName() ? originalRefNode.cloneNode() : originalRefNode.cloneTree(); newNode.srcrefTree(nodeToReplace); aliasRef.getParent().replaceChild(nodeToReplace, newNode); compiler.reportChangeToEnclosingScope(newNode); return new AstChange(getRefModule(aliasRef), aliasRef.getScope(), newNode); } /** * Attempt to inline an global alias of a global name. This requires that the name is well * defined: assigned unconditionally, assigned exactly once. It is assumed that, the name for * which it is an alias must already meet these same requirements. * *

If the alias is completely removed, also deletes the aliasing Ref. * * @param name The global name being aliased * @param alias The alias to inline */ private void inlineGlobalAliasIfPossible(Name name, Ref alias, GlobalNamespace namespace) { // Ensure that the alias is assigned to global name at that the // declaration. Node aliasParent = alias.getNode().getParent(); if (((aliasParent.isAssign() || aliasParent.isName()) && NodeUtil.isExecutedExactlyOnce(aliasParent)) // We special-case for constructors here, to inline constructor aliases // more aggressively in global scope. // We do this because constructor properties are always collapsed, // so we want to inline the aliases also to avoid breakages. || (aliasParent.isName() && name.isConstructor())) { Node lvalue = aliasParent.isName() ? aliasParent : aliasParent.getFirstChild(); if (!lvalue.isQualifiedName()) { return; } if (lvalue.isName() && compiler.getCodingConvention().isExported(lvalue.getString(), /* local */ false)) { return; } Name aliasingName = namespace.getSlot(lvalue.getQualifiedName()); if (aliasingName == null) { // this is true for names in externs or properties on extern names return; } if (name.equals(aliasingName) && aliasParent.isAssign()) { // Ignore `a.b.c = a.b.c;` with `a.b.c;`. return; } Inlinability aliasInlinability = aliasingName.calculateInlinability(); if (!aliasInlinability.shouldInlineUsages()) { // nothing to do here return; } Set newNodes = new LinkedHashSet<>(); // Rewrite all references to the aliasing name, except for the initialization rewriteAliasReferences(aliasingName, alias, newNodes); rewriteAliasProps(aliasingName, alias.getNode(), 0, newNodes); if (aliasInlinability.shouldRemoveDeclaration()) { // Rewrite the initialization of the alias, unless this is an unsafe alias inline // caused by an @constructor. In that case, we need to leave the initialization around. Ref aliasDeclaration = aliasingName.getDeclaration(); if (aliasDeclaration.getTwin() != null) { // This is in a nested assign. // Replace // a.b = aliasing.name = aliased.name // with // a.b = aliased.name checkState(aliasParent.isAssign(), aliasParent); Node aliasGrandparent = aliasParent.getParent(); aliasParent.replaceWith(alias.getNode().detach()); // remove both of the refs aliasingName.removeTwinRefs(aliasDeclaration); newNodes.add(new AstChange(alias.module, alias.scope, alias.getNode())); compiler.reportChangeToEnclosingScope(aliasGrandparent); } else { // just set the original alias to null. aliasParent.replaceChild(alias.getNode(), IR.nullNode()); compiler.reportChangeToEnclosingScope(aliasParent); } codeChanged = true; // Update the original aliased name to say that it has one less ALIASING_REF. name.removeRef(alias); } // Inlining the variable may have introduced new references // to descendants of {@code name}. So those need to be collected now. namespace.scanNewNodes(newNodes); } } /** Replaces all reads of a name with the name it aliases */ private void rewriteAliasReferences(Name aliasingName, Ref aliasingRef, Set newNodes) { List refs = new ArrayList<>(aliasingName.getRefs()); for (Ref ref : refs) { switch (ref.type) { case SET_FROM_GLOBAL: continue; case DIRECT_GET: case ALIASING_GET: case PROTOTYPE_GET: case CALL_GET: case SUBCLASSING_GET: if (ref.getTwin() != null) { // The reference is the left-hand side of a nested assignment. This means we store two // separate 'twin' Refs with the same node of types ALIASING_GET and SET_FROM_GLOBAL. // For example, the read of `c.d` has a twin reference in // a.b = c.d = e.f; // We handle this case later. checkState(ref.type == Type.ALIASING_GET, ref); break; } if (ref.getNode().isStringKey()) { // e.g. `y` in `const {y} = x;` DestructuringGlobalNameExtractor.reassignDestructringLvalue( ref.getNode(), aliasingRef.getNode().cloneTree(), newNodes, ref, compiler); } else { // e.g. `x.y` checkState(ref.getNode().isGetProp() || ref.getNode().isName()); Node newNode = aliasingRef.getNode().cloneTree(); Node node = ref.getNode(); node.replaceWith(newNode); compiler.reportChangeToEnclosingScope(newNode); newNodes.add(new AstChange(ref.module, ref.scope, newNode)); } aliasingName.removeRef(ref); break; default: throw new IllegalStateException(); } } } /** Check if the name has multiple sets that are not of the form "a = a || {}" */ private static boolean isUnsafelyReassigned(Name name) { boolean foundOriginalDefinition = false; for (Ref ref : name.getRefs()) { if (!ref.isSet()) { continue; } if (CollapseProperties.isSafeNamespaceReinit(ref)) { continue; } if (!foundOriginalDefinition) { foundOriginalDefinition = true; } else { return true; } } return false; } /** * @param name The Name whose properties references should be updated. * @param value The value to use when rewriting. * @param depth The chain depth. * @param newNodes Expression nodes that have been updated. */ private void rewriteAliasProps(Name name, Node value, int depth, Set newNodes) { if (name.props == null) { return; } Preconditions.checkState( !value.matchesQualifiedName(name.getFullName()), "%s should not match name %s", value, name.getFullName()); for (Name prop : name.props) { rewriteNestedAliasReference(value, depth, newNodes, prop); } } /** * Replaces references to an alias that are nested inside a longer getprop chain or an object * literal * *

For example: if we have an inlined alias 'const A = B;', and reference a property 'A.x', * then this method is responsible for replacing 'A.x' with 'B.x'. * *

This is necessary because in the above example, given 'A.x', there is only one {@link Ref} * that points to the whole name 'A.x', not a direct {@link Ref} to 'A'. So the only way to * replace 'A.x' with 'B.x' is by looking at the property 'x' reference. * * @param value The value to use when rewriting. * @param depth The property chain depth. * @param newNodes Expression nodes that have been updated. * @param prop The property to rewrite with value. */ private void rewriteNestedAliasReference( Node value, int depth, Set newNodes, Name prop) { rewriteAliasProps(prop, value, depth + 1, newNodes); List refs = new ArrayList<>(prop.getRefs()); for (Ref ref : refs) { Node target = ref.getNode(); if (target.isStringKey() && target.getParent().isDestructuringPattern()) { // Do nothing for alias properties accessed through object destructuring. This would be // redundant. This method is intended for names nested inside getprop chains, because // GlobalNamespace only creates a single Ref for the outermost getprop. However, for // destructuring property accesses, GlobalNamespace creates multiple Refs, one for the // destructured object, and one for each string key in the pattern. // // For example, consider: // const originalObj = {key: 0}; // const rhs = originalObj; // const {key: lhs} = rhs; // const otherLhs = rhs.key; // AggressiveInlineAliases is inlining rhs -> originalObj. // // GlobalNamespace creates two Refs for the name 'rhs': one for its declaration, // and one for 'const {key: lhs} = rhs;'. There is no Ref pointing directly to the 'rhs' // in 'const otherLhs = rhs.key', though. // There are also two Refs to the name 'rhs.key': one for the destructuring access and one // for the getprop access. This loop will visit both Refs. // This method is responsible for inlining "const otherLhs = originalObj.key" but not // "const {key: lhs} = originalObj;". We bail out at the Ref in the latter case. checkState( target.getGrandparent().isAssign() || target.getGrandparent().isDestructuringLhs(), // Currently GlobalNamespace doesn't create Refs for 'b' in const {a: {b}} = obj; // If it does start creating those Refs, we may have to update this method to handle // them explicitly. "Did not expect GlobalNamespace to create Ref for key in nested object pattern %s", target); continue; } for (int i = 0; i <= depth; i++) { if (target.isGetProp()) { target = target.getFirstChild(); } else if (NodeUtil.isObjectLitKey(target)) { // Object literal key definitions are a little trickier, as we // need to find the assignment target Node gparent = target.getGrandparent(); if (gparent.isAssign()) { target = gparent.getFirstChild(); } else { checkState(NodeUtil.isObjectLitKey(gparent)); target = gparent; } } else { throw new IllegalStateException("unexpected node: " + target); } } checkState(target.isGetProp() || target.isName()); Node newValue = value.cloneTree(); target.replaceWith(newValue); compiler.reportChangeToEnclosingScope(newValue); prop.removeRef(ref); // Rescan the expression root. newNodes.add(new AstChange(ref.module, ref.scope, ref.getNode())); codeChanged = true; } } /** * Tries to find an lvalue for the subclass given the superclass node in an `class ... extends ` * clause * *

Only handles cases where we have either a class declaration or a class expression in an * assignment or name declaration. Otherwise returns null. */ @Nullable private static Node getSubclassForEs6Superclass(Node superclass) { Node classNode = superclass.getParent(); checkArgument(classNode.isClass(), classNode); if (NodeUtil.isNameDeclaration(classNode.getGrandparent())) { // const Clazz = class extends Super { return classNode.getParent(); } else if (superclass.getGrandparent().isAssign()) { // ns.foo.Clazz = class extends Super { return classNode.getPrevious(); } else if (NodeUtil.isClassDeclaration(classNode)) { // class Clazz extends Super { return classNode.getFirstChild(); } return null; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy