com.google.javascript.jscomp.DataFlowAnalysis.class Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of closure-compiler-unshaded Show documentation
Show all versions of closure-compiler-unshaded Show documentation
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.
The newest version!
???? 7?
java/lang/Object ()V
-com/google/javascript/jscomp/DataFlowAnalysis cfg /Lcom/google/javascript/jscomp/ControlFlowGraph; 9com/google/javascript/jscomp/DataFlowAnalysis$UniqueQueue
isForward ()Z
-com/google/javascript/jscomp/ControlFlowGraph getOptionalNodeComparator (Z)Ljava/util/Comparator;
(Ljava/util/Comparator;)V workQueue ;Lcom/google/javascript/jscomp/DataFlowAnalysis$UniqueQueue;
! "
isBranched
$ % & ' ( $com/google/common/base/Preconditions
checkState (Z)V
* + , createFlowJoiner <()Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowJoiner; . / 0 1 2 8com/google/javascript/jscomp/DataFlowAnalysis$FlowJoiner joinFlow (Ljava/lang/Object;)V . 4 5 6 finish ()Ljava/lang/Object; 8 1com/google/javascript/jscomp/graph/LatticeElement : 'java/lang/UnsupportedOperationException
9
= >
initialize
@ A isEmpty
C D 6 removeFirst F 6com/google/javascript/jscomp/graph/DiGraph$DiGraphNode E H I J
getAnnotation 1()Lcom/google/javascript/jscomp/graph/Annotation; L =com/google/javascript/jscomp/DataFlowAnalysis$LinearFlowState K N O P stepCount I R java/lang/IllegalStateException T U V makeConcatWithConstants L(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/lang/String;
Q X Y (Ljava/lang/String;)V
[ \ ]
joinInputs ;(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V
_ ` a flow ;(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Z
c d e getDirectedSuccNodes J(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Ljava/util/List;
g h e getDirectedPredNodes j k l m n java/util/List iterator ()Ljava/util/Iterator; p q r s java/util/Iterator hasNext p u v 6 next
x y z getImplicitReturn :()Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;
| } 2 add
? ? getCfg 1()Lcom/google/javascript/jscomp/ControlFlowGraph;
? ? clear
? ? ? getNodes ()Ljava/util/Collection; ? k ? java/util/Collection
? ? ? createInitialEstimateLattice 5()Lcom/google/javascript/jscomp/graph/LatticeElement;
K ? ? '(Ljava/lang/Object;Ljava/lang/Object;)V E ? ? ?
setAnnotation 2(Lcom/google/javascript/jscomp/graph/Annotation;)V
? ? ? getEdges ()Ljava/util/List; ? 6com/google/javascript/jscomp/graph/DiGraph$DiGraphEdge ? ?
K ? ? 6 getOut E ? ? 6 getValue
K ? ? 6 getIn
? ? ? flowThrough z(Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/LatticeElement;)Lcom/google/javascript/jscomp/graph/LatticeElement;
K ? ? 2 setOut
? ? ? equals (Ljava/lang/Object;)Z
? ? ? createFlowBrancher ?(Ljava/lang/Object;Lcom/google/javascript/jscomp/graph/LatticeElement;)Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowBrancher; E ? ? ? getOutEdges ? H ? ? ? 4com/google/javascript/jscomp/ControlFlowGraph$Branch ? ? ? ? ? :com/google/javascript/jscomp/DataFlowAnalysis$FlowBrancher
branchFlow J(Lcom/google/javascript/jscomp/ControlFlowGraph$Branch;)Ljava/lang/Object; ? -com/google/javascript/jscomp/graph/Annotation
K ? ? 2 setIn
? ? z getEntry
? ? ? createEntryLattice E ? ? ?
getInEdges j ? ? ? size ()I j ? ? ? get (I)Ljava/lang/Object;
? ? ? getInputFromEdge m(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;)Lcom/google/javascript/jscomp/graph/LatticeElement; ? ? ? z getSource ? ? ? z getDestination
? ? ? ? "com/google/javascript/jscomp/Scope isFunctionScope
$ ? ? (
checkArgument ? /com/google/javascript/jscomp/DataFlowAnalysis$1
? ? ? 6(Lcom/google/javascript/jscomp/Scope;Ljava/util/Set;)V
? ? ? ? ? *com/google/javascript/jscomp/NodeTraversal builder 6()Lcom/google/javascript/jscomp/NodeTraversal$Builder;
? ? ? ? ? 2com/google/javascript/jscomp/NodeTraversal$Builder setCompiler e(Lcom/google/javascript/jscomp/AbstractCompiler;)Lcom/google/javascript/jscomp/NodeTraversal$Builder;
? ? ? ? setCallback k(Lcom/google/javascript/jscomp/NodeTraversal$Callback;)Lcom/google/javascript/jscomp/NodeTraversal$Builder;
? setScopeCreator a(Lcom/google/javascript/jscomp/ScopeCreator;)Lcom/google/javascript/jscomp/NodeTraversal$Builder;
? traverseAtScope /(Lcom/google/javascript/jscomp/AbstractScope;)V
?
java/util/Map values com/google/javascript/jscomp/Var
getParentNode $()Lcom/google/javascript/rhino/Node;
com/google/javascript/rhino/Node isCatch
-com/google/javascript/jscomp/AbstractCompiler getCodingConvention 1()Lcom/google/javascript/jscomp/CodingConvention;
! getName ()Ljava/lang/String; #$% &' -com/google/javascript/jscomp/CodingConvention
isExported (Ljava/lang/String;)Z )*+ } ?
java/util/Set Signature 4Lcom/google/javascript/jscomp/ControlFlowGraph; ?Lcom/google/javascript/jscomp/DataFlowAnalysis$UniqueQueue;>; MAX_STEPS_PER_NODE
ConstantValue N 2(Lcom/google/javascript/jscomp/ControlFlowGraph;)V Code LineNumberTable LocalVariableTable this /Lcom/google/javascript/jscomp/DataFlowAnalysis; LocalVariableTypeTable 7Lcom/google/javascript/jscomp/DataFlowAnalysis;
StackMapTable MethodParameters 7(Lcom/google/javascript/jscomp/ControlFlowGraph;)V 6()Lcom/google/javascript/jscomp/ControlFlowGraph; join ?(Lcom/google/javascript/jscomp/graph/LatticeElement;Lcom/google/javascript/jscomp/graph/LatticeElement;)Lcom/google/javascript/jscomp/graph/LatticeElement; latticeA 3Lcom/google/javascript/jscomp/graph/LatticeElement; latticeB joiner :Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowJoiner; TL; ?Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowJoiner; (TL;TL;)TL; A()Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowJoiner; node Ljava/lang/Object; output TN; I(TN;TL;)Lcom/google/javascript/jscomp/DataFlowAnalysis$FlowBrancher; input (TN;TL;)TL; analyze nextNode 8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; nextNodes Ljava/util/List; curNode curState ?Lcom/google/javascript/jscomp/DataFlowAnalysis$LinearFlowState; sLcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode; ?Ljava/util/List<+Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;>; DLcom/google/javascript/jscomp/DataFlowAnalysis$LinearFlowState; ()TL; edge 8Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge; sLcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge; outBranchBefore outEdge brancher ; v(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)Z result inEdge inEdges ?Ljava/util/List<+Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;>; v(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphNode;)V x(Lcom/google/javascript/jscomp/graph/DiGraph$DiGraphEdge;)TL; computeEscaped ?(Lcom/google/javascript/jscomp/Scope;Ljava/util/Set;Lcom/google/javascript/jscomp/AbstractCompiler;Lcom/google/javascript/jscomp/ScopeCreator;Ljava/util/Map;)V var "Lcom/google/javascript/jscomp/Var; jsScope $Lcom/google/javascript/jscomp/Scope; escaped Ljava/util/Set; compiler /Lcom/google/javascript/jscomp/AbstractCompiler; scopeCreator +Lcom/google/javascript/jscomp/ScopeCreator; allVarsInFn Ljava/util/Map; finder FLcom/google/javascript/jscomp/NodeTraversal$AbstractPostOrderCallback; 3Ljava/util/Set; ELjava/util/Map;? Dcom/google/javascript/jscomp/NodeTraversal$AbstractPostOrderCallback ?(Lcom/google/javascript/jscomp/Scope;Ljava/util/Set;Lcom/google/javascript/jscomp/AbstractCompiler;Lcom/google/javascript/jscomp/ScopeCreator;Ljava/util/Map;)V ^Ljava/lang/Object;
SourceFile DataFlowAnalysis.java NestMembers BootstrapMethods?
??? U? $java/lang/invoke/StringConcatFactory ?(Ljava/lang/invoke/MethodHandles$Lookup;Ljava/lang/String;Ljava/lang/invoke/MethodType;Ljava/lang/String;[Ljava/lang/Object;)Ljava/lang/invoke/CallSite;? .Dataflow analysis appears to diverge around: InnerClasses UniqueQueue
FlowJoiner? *com/google/javascript/jscomp/graph/DiGraph DiGraphNode LinearFlowState DiGraphEdge FlowBrancher Branch Builder? 3com/google/javascript/jscomp/NodeTraversal$Callback Callback AbstractPostOrderCallback? %java/lang/invoke/MethodHandles$Lookup? java/lang/invoke/MethodHandles Lookup , - , . / P 0 1 2 3 ? +*? *+? *?
Y+*? ? ? ? *? ?
*? ? #? 4 x y z | # } * 5 +67 + 8 +69 + - : ? * ; , < ? ? 3 A *? ? 4 ?5 67 8 69 , = " 3 > ? 4 ?5 67 8 69 >? 3 ? *? )N-+? - -,? - -? 3 ? 7? 4 ? ? ? ?5 * 67 @A BA CD 8 * 69 @E BE CF ; @ B , G + , , H ? ? 3 l ? 9Y? ;? 4 ?5 67 IJ KA 8 69 IL KE ; I K , M ? ? ; I N , O P 3 ? ?*? <*? ? ?? ?*? ? B? EL+? G ? KM,Y? MZ`? MN ? ? QY+? S ? W?*+? Z*+? ^? T*? ? *? +? b? *? +? fN-? i :? o ? '? t ? E:*? ? w? *? ? {??է?d*? ? **? ~? w? Z? 4 F ? ? ? ? # ? 4 ? B ? G ? O ? j ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?5 4 ? QR j 6ST ?UR # }VW ?67 8 4 ? QX j 6SY ?UX # }VZ ?69 : ' ? = E K G j? j p*? ? ? , [ ? ? , [ > 3 6 ?*? ? ?*? ? ?? ? L+? o ? 8+? t ? EM,? KY*? ?*? ?? ?? ? ,*? ? w? *? ,? {???*? ? 0*? ? ?? i L+? o ? +? t ? ?M,*? ?? ? ??? 4 6
' - 7 < G
O R
Y y ? ?5 ' (IR y
\] ?67 8 ' (IX y
\^ ?69 : ? p:? ? p? ` a 3 > ?+? G ? KM*? ? ?,? ?? 7N,*+? ? ,? ?? 7? ?? ?-,? ?? ?? ? 6*? ? ~*+? ? ,? ?? 7? ?:+? ? ? i :? o ? T? t ? ?:? ? ? 7:? ? ? ?? ? ? ù ? ? ? ? ? ?? ? 6????,? ?? 7N,*+? ? ,? ?? 7? ?? ?-,? ?? ?? ? ? 4 F
. @ G! Z" }# ?$ ?% ?& ?( ?+ ?- ?. ?/5 \ ? 6_A } B`] Z hab ?cA @ ?de ? &fA ?67 ?IR
?gW 8 R ? 6_E } B`^ Z hah ?cE ? &fE ?69 ?IX
?gZ : 3
? = K 7@? ( ? p? T ? 7@? ? ? ? + 7@; I , i \ ] 3 ?+? G ? KM*? ? *? ? ?+? ,*? ˶ ű*? ? +? ? ? +? ? N-? ? ? . ?*-? ? ? ?? ?:? C*? ):-? i :? o ? ? t ? ?:*? ٹ - ???? 3 ? 7:*? ? ,? ŧ ,? ?? 4 J :
; < $= %A <D \F ]I mJ pN vO ?P ?Q ?R ?V ?W ?Y ?[5 R m jA ?
k] v :CD ?67 ?IR
?gW < ?lT ? jA 8 R m jE ?
k^ v :CF ?69 ?IX
?gZ < ?lm ? jE : : ? % KE j? j ?
. p? %? E K j 7 ; I , n ? ? 3 X*? ?
+? ? ? 7?*? ? +? ? ? G ? KM,? ?? 7?+? ? M,*? ? w? *? ˰,? G ? KN-? ?? 7? 4 *
^ _ ` a 'b /d 6e Af Fh Pi5 4 ' gW 6 "IR P gW X67 X\] 8 4 ' gZ 6 "IX P gZ X69 X\^ :
? E; \ , o pq 3 B s*? ? ? ?Y*+? ?:? ?,? ?? ?-? *?? ? ? :? o ? 7? t ?
:??? ,?? ?" ? +?( W??ű 4 6
? ? ? ? ? ? #? &? J? V? f? o? r?5 H J %rs stu svw sxy sz{ s|} a~ 8 sv? s|? : ? 4? p? 1
? ? ; t v x z | , ? , ?? ??
K ? . ?? ? ?? b
? . ? E?? K ? ??? ? ? ? ?@ ? ? ?? ? ?? ? ?? ??? © 2015 - 2024 Weber Informatics LLC | Privacy Policy