arkanalyzer 1.0.20 → 1.0.21
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/Config.d.ts +70 -70
- package/lib/Config.js +198 -198
- package/lib/Scene.d.ts +316 -316
- package/lib/Scene.js +1316 -1316
- package/lib/callgraph/algorithm/AbstractAnalysis.d.ts +28 -28
- package/lib/callgraph/algorithm/AbstractAnalysis.js +144 -144
- package/lib/callgraph/algorithm/ClassHierarchyAnalysis.d.ts +10 -10
- package/lib/callgraph/algorithm/ClassHierarchyAnalysis.js +69 -69
- package/lib/callgraph/algorithm/RapidTypeAnalysis.d.ts +15 -15
- package/lib/callgraph/algorithm/RapidTypeAnalysis.js +146 -146
- package/lib/callgraph/common/Statistics.d.ts +57 -57
- package/lib/callgraph/common/Statistics.js +228 -228
- package/lib/callgraph/model/CallGraph.d.ts +96 -96
- package/lib/callgraph/model/CallGraph.js +354 -354
- package/lib/callgraph/model/builder/CallGraphBuilder.d.ts +15 -15
- package/lib/callgraph/model/builder/CallGraphBuilder.js +106 -106
- package/lib/callgraph/pointerAnalysis/Context.d.ts +37 -37
- package/lib/callgraph/pointerAnalysis/Context.js +155 -155
- package/lib/callgraph/pointerAnalysis/DummyCallCreator.d.ts +22 -22
- package/lib/callgraph/pointerAnalysis/DummyCallCreator.js +104 -104
- package/lib/callgraph/pointerAnalysis/PTAUtils.d.ts +5 -5
- package/lib/callgraph/pointerAnalysis/PTAUtils.js +46 -46
- package/lib/callgraph/pointerAnalysis/Pag.d.ts +261 -261
- package/lib/callgraph/pointerAnalysis/Pag.js +930 -930
- package/lib/callgraph/pointerAnalysis/PagBuilder.d.ts +157 -157
- package/lib/callgraph/pointerAnalysis/PagBuilder.js +1399 -1399
- package/lib/callgraph/pointerAnalysis/PointerAnalysis.d.ts +72 -72
- package/lib/callgraph/pointerAnalysis/PointerAnalysis.js +573 -573
- package/lib/callgraph/pointerAnalysis/PointerAnalysisConfig.d.ts +15 -15
- package/lib/callgraph/pointerAnalysis/PointerAnalysisConfig.js +81 -81
- package/lib/callgraph/pointerAnalysis/PtsDS.d.ts +80 -80
- package/lib/callgraph/pointerAnalysis/PtsDS.js +308 -308
- package/lib/core/base/Constant.d.ts +48 -48
- package/lib/core/base/Constant.js +103 -103
- package/lib/core/base/Decorator.d.ts +15 -15
- package/lib/core/base/Decorator.js +46 -46
- package/lib/core/base/DefUseChain.d.ts +8 -8
- package/lib/core/base/DefUseChain.js +25 -25
- package/lib/core/base/Expr.d.ts +340 -340
- package/lib/core/base/Expr.js +917 -917
- package/lib/core/base/Local.d.ts +104 -104
- package/lib/core/base/Local.js +176 -176
- package/lib/core/base/Position.d.ts +30 -30
- package/lib/core/base/Position.js +147 -147
- package/lib/core/base/Ref.d.ts +173 -173
- package/lib/core/base/Ref.js +374 -374
- package/lib/core/base/Stmt.d.ts +237 -237
- package/lib/core/base/Stmt.js +525 -525
- package/lib/core/base/Trap.d.ts +8 -8
- package/lib/core/base/Trap.js +30 -30
- package/lib/core/base/Type.d.ts +308 -308
- package/lib/core/base/Type.js +639 -639
- package/lib/core/base/TypeExpr.d.ts +71 -71
- package/lib/core/base/TypeExpr.js +155 -155
- package/lib/core/base/Value.d.ts +32 -32
- package/lib/core/base/Value.js +16 -16
- package/lib/core/common/ArkError.d.ts +14 -14
- package/lib/core/common/ArkError.js +28 -28
- package/lib/core/common/ArkIRTransformer.d.ts +67 -67
- package/lib/core/common/ArkIRTransformer.js +690 -690
- package/lib/core/common/ArkValueTransformer.d.ts +89 -89
- package/lib/core/common/ArkValueTransformer.js +1478 -1478
- package/lib/core/common/Builtin.d.ts +36 -36
- package/lib/core/common/Builtin.js +81 -81
- package/lib/core/common/Const.d.ts +21 -21
- package/lib/core/common/Const.js +43 -43
- package/lib/core/common/DummyMainCreater.d.ts +46 -46
- package/lib/core/common/DummyMainCreater.js +319 -319
- package/lib/core/common/EtsConst.d.ts +73 -73
- package/lib/core/common/EtsConst.js +1021 -1021
- package/lib/core/common/ExprUseReplacer.d.ts +21 -21
- package/lib/core/common/ExprUseReplacer.js +124 -124
- package/lib/core/common/IRInference.d.ts +36 -36
- package/lib/core/common/IRInference.d.ts.map +1 -1
- package/lib/core/common/IRInference.js +651 -648
- package/lib/core/common/IRUtils.d.ts +18 -18
- package/lib/core/common/IRUtils.js +141 -141
- package/lib/core/common/ModelUtils.d.ts +70 -70
- package/lib/core/common/ModelUtils.js +712 -712
- package/lib/core/common/RefUseReplacer.d.ts +13 -13
- package/lib/core/common/RefUseReplacer.js +52 -52
- package/lib/core/common/SdkUtils.d.ts +8 -8
- package/lib/core/common/SdkUtils.js +105 -105
- package/lib/core/common/StmtDefReplacer.d.ts +12 -12
- package/lib/core/common/StmtDefReplacer.js +41 -41
- package/lib/core/common/StmtUseReplacer.d.ts +16 -16
- package/lib/core/common/StmtUseReplacer.js +108 -108
- package/lib/core/common/TSConst.d.ts +18 -18
- package/lib/core/common/TSConst.js +36 -36
- package/lib/core/common/TypeInference.d.ts +102 -102
- package/lib/core/common/TypeInference.js +748 -748
- package/lib/core/common/ValueUtil.d.ts +12 -12
- package/lib/core/common/ValueUtil.js +54 -54
- package/lib/core/common/VisibleValue.d.ts +36 -36
- package/lib/core/common/VisibleValue.js +212 -212
- package/lib/core/dataflow/DataflowProblem.d.ts +20 -20
- package/lib/core/dataflow/DataflowProblem.js +20 -20
- package/lib/core/dataflow/DataflowResult.d.ts +7 -7
- package/lib/core/dataflow/DataflowResult.js +26 -26
- package/lib/core/dataflow/DataflowSolver.d.ts +43 -43
- package/lib/core/dataflow/DataflowSolver.js +307 -307
- package/lib/core/dataflow/Edge.d.ts +11 -11
- package/lib/core/dataflow/Edge.js +31 -31
- package/lib/core/dataflow/Fact.d.ts +6 -6
- package/lib/core/dataflow/Fact.js +24 -24
- package/lib/core/dataflow/GenericDataFlow.d.ts +142 -142
- package/lib/core/dataflow/GenericDataFlow.js +109 -109
- package/lib/core/dataflow/ReachingDef.d.ts +62 -62
- package/lib/core/dataflow/ReachingDef.js +168 -168
- package/lib/core/dataflow/UndefinedVariable.d.ts +45 -45
- package/lib/core/dataflow/UndefinedVariable.js +288 -288
- package/lib/core/dataflow/Util.d.ts +9 -9
- package/lib/core/dataflow/Util.js +64 -64
- package/lib/core/graph/BaseExplicitGraph.d.ts +58 -58
- package/lib/core/graph/BaseExplicitGraph.js +157 -157
- package/lib/core/graph/BaseImplicitGraph.d.ts +77 -77
- package/lib/core/graph/BaseImplicitGraph.js +78 -78
- package/lib/core/graph/BasicBlock.d.ts +104 -104
- package/lib/core/graph/BasicBlock.js +280 -280
- package/lib/core/graph/Cfg.d.ts +59 -59
- package/lib/core/graph/Cfg.js +282 -282
- package/lib/core/graph/DependsGraph.d.ts +35 -35
- package/lib/core/graph/DependsGraph.js +87 -87
- package/lib/core/graph/DominanceFinder.d.ts +15 -15
- package/lib/core/graph/DominanceFinder.js +121 -121
- package/lib/core/graph/DominanceTree.d.ts +12 -12
- package/lib/core/graph/DominanceTree.js +70 -70
- package/lib/core/graph/GraphTraits.d.ts +7 -7
- package/lib/core/graph/GraphTraits.js +16 -16
- package/lib/core/graph/Scc.d.ts +61 -61
- package/lib/core/graph/Scc.js +222 -222
- package/lib/core/graph/ViewTree.d.ts +114 -114
- package/lib/core/graph/ViewTree.js +16 -16
- package/lib/core/graph/builder/CfgBuilder.d.ts +176 -176
- package/lib/core/graph/builder/CfgBuilder.js +1139 -1139
- package/lib/core/graph/builder/ConditionBuilder.d.ts +15 -15
- package/lib/core/graph/builder/ConditionBuilder.js +252 -252
- package/lib/core/graph/builder/LoopBuilder.d.ts +20 -20
- package/lib/core/graph/builder/LoopBuilder.js +251 -251
- package/lib/core/graph/builder/SwitchBuilder.d.ts +11 -11
- package/lib/core/graph/builder/SwitchBuilder.js +152 -152
- package/lib/core/graph/builder/TrapBuilder.d.ts +16 -16
- package/lib/core/graph/builder/TrapBuilder.js +272 -272
- package/lib/core/graph/builder/ViewTreeBuilder.d.ts +203 -203
- package/lib/core/graph/builder/ViewTreeBuilder.js +1055 -1055
- package/lib/core/model/ArkBaseModel.d.ts +59 -59
- package/lib/core/model/ArkBaseModel.js +274 -274
- package/lib/core/model/ArkBody.d.ts +24 -24
- package/lib/core/model/ArkBody.js +65 -65
- package/lib/core/model/ArkClass.d.ts +206 -206
- package/lib/core/model/ArkClass.js +439 -439
- package/lib/core/model/ArkExport.d.ts +72 -72
- package/lib/core/model/ArkExport.js +147 -147
- package/lib/core/model/ArkField.d.ts +62 -62
- package/lib/core/model/ArkField.js +113 -113
- package/lib/core/model/ArkFile.d.ts +131 -131
- package/lib/core/model/ArkFile.js +267 -267
- package/lib/core/model/ArkImport.d.ts +44 -44
- package/lib/core/model/ArkImport.js +108 -108
- package/lib/core/model/ArkMetadata.d.ts +31 -31
- package/lib/core/model/ArkMetadata.js +55 -55
- package/lib/core/model/ArkMethod.d.ts +261 -261
- package/lib/core/model/ArkMethod.js +592 -592
- package/lib/core/model/ArkNamespace.d.ts +66 -66
- package/lib/core/model/ArkNamespace.js +209 -209
- package/lib/core/model/ArkSignature.d.ts +162 -162
- package/lib/core/model/ArkSignature.js +379 -379
- package/lib/core/model/builder/ArkClassBuilder.d.ts +12 -12
- package/lib/core/model/builder/ArkClassBuilder.js +454 -454
- package/lib/core/model/builder/ArkExportBuilder.d.ts +24 -24
- package/lib/core/model/builder/ArkExportBuilder.js +210 -210
- package/lib/core/model/builder/ArkFieldBuilder.d.ts +8 -8
- package/lib/core/model/builder/ArkFieldBuilder.js +193 -193
- package/lib/core/model/builder/ArkFileBuilder.d.ts +9 -9
- package/lib/core/model/builder/ArkFileBuilder.js +165 -165
- package/lib/core/model/builder/ArkImportBuilder.d.ts +4 -4
- package/lib/core/model/builder/ArkImportBuilder.js +128 -128
- package/lib/core/model/builder/ArkMethodBuilder.d.ts +63 -63
- package/lib/core/model/builder/ArkMethodBuilder.js +486 -486
- package/lib/core/model/builder/ArkNamespaceBuilder.d.ts +5 -5
- package/lib/core/model/builder/ArkNamespaceBuilder.js +205 -205
- package/lib/core/model/builder/ArkSignatureBuilder.d.ts +8 -8
- package/lib/core/model/builder/ArkSignatureBuilder.js +40 -40
- package/lib/core/model/builder/BodyBuilder.d.ts +55 -30
- package/lib/core/model/builder/BodyBuilder.d.ts.map +1 -1
- package/lib/core/model/builder/BodyBuilder.js +542 -371
- package/lib/core/model/builder/builderUtils.d.ts +18 -18
- package/lib/core/model/builder/builderUtils.js +558 -558
- package/lib/index.d.ts +82 -80
- package/lib/index.d.ts.map +1 -1
- package/lib/index.js +201 -196
- package/lib/save/ArkStream.d.ts +23 -23
- package/lib/save/ArkStream.js +83 -83
- package/lib/save/DotPrinter.d.ts +43 -43
- package/lib/save/DotPrinter.js +170 -170
- package/lib/save/GraphPrinter.d.ts +16 -16
- package/lib/save/GraphPrinter.js +134 -134
- package/lib/save/JsonPrinter.d.ts +30 -30
- package/lib/save/JsonPrinter.js +580 -580
- package/lib/save/Printer.d.ts +12 -12
- package/lib/save/Printer.js +27 -27
- package/lib/save/PrinterBuilder.d.ts +53 -53
- package/lib/save/PrinterBuilder.js +145 -145
- package/lib/save/ViewTreePrinter.d.ts +14 -14
- package/lib/save/ViewTreePrinter.js +123 -123
- package/lib/save/arkir/ArkIRClassPrinter.d.ts +13 -13
- package/lib/save/arkir/ArkIRClassPrinter.js +92 -92
- package/lib/save/arkir/ArkIRFieldPrinter.d.ts +11 -11
- package/lib/save/arkir/ArkIRFieldPrinter.js +64 -64
- package/lib/save/arkir/ArkIRFilePrinter.d.ts +12 -12
- package/lib/save/arkir/ArkIRFilePrinter.js +54 -54
- package/lib/save/arkir/ArkIRMethodPrinter.d.ts +16 -16
- package/lib/save/arkir/ArkIRMethodPrinter.js +159 -159
- package/lib/save/arkir/ArkIRNamespacePrinter.d.ts +11 -11
- package/lib/save/arkir/ArkIRNamespacePrinter.js +66 -66
- package/lib/save/base/BasePrinter.d.ts +23 -23
- package/lib/save/base/BasePrinter.js +70 -70
- package/lib/save/base/ExportPrinter.d.ts +8 -8
- package/lib/save/base/ExportPrinter.js +67 -67
- package/lib/save/base/ImportPrinter.d.ts +9 -9
- package/lib/save/base/ImportPrinter.js +92 -92
- package/lib/save/base/PrinterUtils.d.ts +24 -24
- package/lib/save/base/PrinterUtils.js +208 -208
- package/lib/save/serializeArkIR.d.ts +8 -8
- package/lib/save/serializeArkIR.js +294 -294
- package/lib/save/source/SourceBase.d.ts +22 -22
- package/lib/save/source/SourceBase.js +64 -64
- package/lib/save/source/SourceBody.d.ts +58 -58
- package/lib/save/source/SourceBody.js +296 -296
- package/lib/save/source/SourceClass.d.ts +25 -25
- package/lib/save/source/SourceClass.js +187 -187
- package/lib/save/source/SourceField.d.ts +13 -13
- package/lib/save/source/SourceField.js +73 -73
- package/lib/save/source/SourceFilePrinter.d.ts +12 -12
- package/lib/save/source/SourceFilePrinter.js +69 -69
- package/lib/save/source/SourceMethod.d.ts +22 -22
- package/lib/save/source/SourceMethod.d.ts.map +1 -1
- package/lib/save/source/SourceMethod.js +196 -193
- package/lib/save/source/SourceNamespace.d.ts +11 -11
- package/lib/save/source/SourceNamespace.js +83 -83
- package/lib/save/source/SourceStmt.d.ts +178 -178
- package/lib/save/source/SourceStmt.js +838 -838
- package/lib/save/source/SourceTransformer.d.ts +46 -46
- package/lib/save/source/SourceTransformer.js +446 -446
- package/lib/transformer/FunctionTransformer.d.ts +2 -2
- package/lib/transformer/FunctionTransformer.js +17 -17
- package/lib/transformer/SceneTransformer.d.ts +2 -2
- package/lib/transformer/SceneTransformer.js +17 -17
- package/lib/transformer/StaticSingleAssignmentFormer.d.ts +12 -12
- package/lib/transformer/StaticSingleAssignmentFormer.js +259 -259
- package/lib/transformer/Transformer.d.ts +6 -6
- package/lib/transformer/Transformer.js +22 -22
- package/lib/utils/AstTreeUtils.d.ts +4 -4
- package/lib/utils/AstTreeUtils.js +26 -26
- package/lib/utils/CfgStructualAnalysis.d.ts +110 -110
- package/lib/utils/CfgStructualAnalysis.js +1277 -1277
- package/lib/utils/FileUtils.d.ts +18 -18
- package/lib/utils/FileUtils.js +135 -135
- package/lib/utils/SparseBitVector.d.ts +100 -100
- package/lib/utils/SparseBitVector.js +445 -445
- package/lib/utils/callGraphUtils.d.ts +30 -30
- package/lib/utils/callGraphUtils.js +205 -205
- package/lib/utils/crypto_utils.d.ts +5 -5
- package/lib/utils/crypto_utils.js +57 -57
- package/lib/utils/entryMethodUtils.d.ts +13 -13
- package/lib/utils/entryMethodUtils.js +110 -110
- package/lib/utils/getAllFiles.d.ts +9 -9
- package/lib/utils/getAllFiles.js +90 -90
- package/lib/utils/json5parser.d.ts +6 -6
- package/lib/utils/json5parser.js +146 -146
- package/lib/utils/logger.d.ts +18 -18
- package/lib/utils/logger.d.ts.map +1 -1
- package/lib/utils/logger.js +97 -90
- package/lib/utils/pathTransfer.d.ts +1 -1
- package/lib/utils/pathTransfer.js +25 -25
- package/node_modules/json5/lib/cli.js +0 -0
- package/node_modules/ohos-typescript/bin/tsc +0 -0
- package/node_modules/ohos-typescript/bin/tsserver +0 -0
- package/package.json +3 -3
|
@@ -1,3 +1,3 @@
|
|
|
1
|
-
declare class FunctionTransformer extends Transformer {
|
|
2
|
-
}
|
|
1
|
+
declare class FunctionTransformer extends Transformer {
|
|
2
|
+
}
|
|
3
3
|
//# sourceMappingURL=FunctionTransformer.d.ts.map
|
|
@@ -1,17 +1,17 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
/*
|
|
3
|
-
* Copyright (c) 2024 Huawei Device Co., Ltd.
|
|
4
|
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
-
* you may not use this file except in compliance with the License.
|
|
6
|
-
* You may obtain a copy of the License at
|
|
7
|
-
*
|
|
8
|
-
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
-
*
|
|
10
|
-
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
-
* See the License for the specific language governing permissions and
|
|
14
|
-
* limitations under the License.
|
|
15
|
-
*/
|
|
16
|
-
class FunctionTransformer extends Transformer {
|
|
17
|
-
}
|
|
1
|
+
"use strict";
|
|
2
|
+
/*
|
|
3
|
+
* Copyright (c) 2024 Huawei Device Co., Ltd.
|
|
4
|
+
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
+
* you may not use this file except in compliance with the License.
|
|
6
|
+
* You may obtain a copy of the License at
|
|
7
|
+
*
|
|
8
|
+
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
+
*
|
|
10
|
+
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
+
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
+
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
+
* See the License for the specific language governing permissions and
|
|
14
|
+
* limitations under the License.
|
|
15
|
+
*/
|
|
16
|
+
class FunctionTransformer extends Transformer {
|
|
17
|
+
}
|
|
@@ -1,3 +1,3 @@
|
|
|
1
|
-
declare class SceneTransformer extends Transformer {
|
|
2
|
-
}
|
|
1
|
+
declare class SceneTransformer extends Transformer {
|
|
2
|
+
}
|
|
3
3
|
//# sourceMappingURL=SceneTransformer.d.ts.map
|
|
@@ -1,17 +1,17 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
/*
|
|
3
|
-
* Copyright (c) 2024 Huawei Device Co., Ltd.
|
|
4
|
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
-
* you may not use this file except in compliance with the License.
|
|
6
|
-
* You may obtain a copy of the License at
|
|
7
|
-
*
|
|
8
|
-
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
-
*
|
|
10
|
-
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
-
* See the License for the specific language governing permissions and
|
|
14
|
-
* limitations under the License.
|
|
15
|
-
*/
|
|
16
|
-
class SceneTransformer extends Transformer {
|
|
17
|
-
}
|
|
1
|
+
"use strict";
|
|
2
|
+
/*
|
|
3
|
+
* Copyright (c) 2024 Huawei Device Co., Ltd.
|
|
4
|
+
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
+
* you may not use this file except in compliance with the License.
|
|
6
|
+
* You may obtain a copy of the License at
|
|
7
|
+
*
|
|
8
|
+
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
+
*
|
|
10
|
+
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
+
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
+
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
+
* See the License for the specific language governing permissions and
|
|
14
|
+
* limitations under the License.
|
|
15
|
+
*/
|
|
16
|
+
class SceneTransformer extends Transformer {
|
|
17
|
+
}
|
|
@@ -1,13 +1,13 @@
|
|
|
1
|
-
import { ArkBody } from '../core/model/ArkBody';
|
|
2
|
-
export declare class StaticSingleAssignmentFormer {
|
|
3
|
-
transformBody(body: ArkBody): void;
|
|
4
|
-
private decideBlockToPhiStmts;
|
|
5
|
-
private addPhiStmts;
|
|
6
|
-
private renameLocals;
|
|
7
|
-
private constainsPhiExpr;
|
|
8
|
-
private getOriginalLocal;
|
|
9
|
-
private addNewArgToPhi;
|
|
10
|
-
private containsAllChildren;
|
|
11
|
-
private createEmptyPhiStmt;
|
|
12
|
-
}
|
|
1
|
+
import { ArkBody } from '../core/model/ArkBody';
|
|
2
|
+
export declare class StaticSingleAssignmentFormer {
|
|
3
|
+
transformBody(body: ArkBody): void;
|
|
4
|
+
private decideBlockToPhiStmts;
|
|
5
|
+
private addPhiStmts;
|
|
6
|
+
private renameLocals;
|
|
7
|
+
private constainsPhiExpr;
|
|
8
|
+
private getOriginalLocal;
|
|
9
|
+
private addNewArgToPhi;
|
|
10
|
+
private containsAllChildren;
|
|
11
|
+
private createEmptyPhiStmt;
|
|
12
|
+
}
|
|
13
13
|
//# sourceMappingURL=StaticSingleAssignmentFormer.d.ts.map
|
|
@@ -1,259 +1,259 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
/*
|
|
3
|
-
* Copyright (c) 2024 Huawei Device Co., Ltd.
|
|
4
|
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
-
* you may not use this file except in compliance with the License.
|
|
6
|
-
* You may obtain a copy of the License at
|
|
7
|
-
*
|
|
8
|
-
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
-
*
|
|
10
|
-
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
-
* See the License for the specific language governing permissions and
|
|
14
|
-
* limitations under the License.
|
|
15
|
-
*/
|
|
16
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
17
|
-
exports.StaticSingleAssignmentFormer = void 0;
|
|
18
|
-
const Expr_1 = require("../core/base/Expr");
|
|
19
|
-
const Local_1 = require("../core/base/Local");
|
|
20
|
-
const Stmt_1 = require("../core/base/Stmt");
|
|
21
|
-
const DominanceFinder_1 = require("../core/graph/DominanceFinder");
|
|
22
|
-
const DominanceTree_1 = require("../core/graph/DominanceTree");
|
|
23
|
-
class StaticSingleAssignmentFormer {
|
|
24
|
-
transformBody(body) {
|
|
25
|
-
var _a;
|
|
26
|
-
let cfg = body.getCfg();
|
|
27
|
-
let blockToDefs = new Map();
|
|
28
|
-
let localToBlocks = new Map();
|
|
29
|
-
for (const block of cfg.getBlocks()) {
|
|
30
|
-
let defs = new Set();
|
|
31
|
-
for (const stmt of block.getStmts()) {
|
|
32
|
-
if (stmt.getDef() != null && stmt.getDef() instanceof Local_1.Local) {
|
|
33
|
-
let local = stmt.getDef();
|
|
34
|
-
defs.add(local);
|
|
35
|
-
if (localToBlocks.has(local)) {
|
|
36
|
-
(_a = localToBlocks.get(local)) === null || _a === void 0 ? void 0 : _a.add(block);
|
|
37
|
-
}
|
|
38
|
-
else {
|
|
39
|
-
let blcoks = new Set();
|
|
40
|
-
blcoks.add(block);
|
|
41
|
-
localToBlocks.set(local, blcoks);
|
|
42
|
-
}
|
|
43
|
-
}
|
|
44
|
-
}
|
|
45
|
-
blockToDefs.set(block, defs);
|
|
46
|
-
}
|
|
47
|
-
let dominanceFinder = new DominanceFinder_1.DominanceFinder(cfg);
|
|
48
|
-
let blockToPhiStmts = this.decideBlockToPhiStmts(body, dominanceFinder, blockToDefs, localToBlocks);
|
|
49
|
-
this.addPhiStmts(blockToPhiStmts, cfg, blockToDefs);
|
|
50
|
-
let dominanceTree = new DominanceTree_1.DominanceTree(dominanceFinder);
|
|
51
|
-
this.renameLocals(body, dominanceTree, blockToPhiStmts);
|
|
52
|
-
}
|
|
53
|
-
decideBlockToPhiStmts(body, dominanceFinder, blockToDefs, localToBlocks) {
|
|
54
|
-
var _a, _b, _c, _d;
|
|
55
|
-
let blockToPhiStmts = new Map();
|
|
56
|
-
let blockToPhiLocals = new Map();
|
|
57
|
-
let localToPhiBlock = new Map();
|
|
58
|
-
for (const [_, local] of body.getLocals()) {
|
|
59
|
-
localToPhiBlock.set(local, new Set());
|
|
60
|
-
let phiBlocks = localToPhiBlock.get(local);
|
|
61
|
-
let blocks = Array.from(localToBlocks.get(local));
|
|
62
|
-
while (blocks.length !== 0) {
|
|
63
|
-
let block = blocks.splice(0, 1).at(0);
|
|
64
|
-
let dfs = dominanceFinder.getDominanceFrontiers(block);
|
|
65
|
-
for (const df of dfs) {
|
|
66
|
-
if (!phiBlocks.has(df)) {
|
|
67
|
-
phiBlocks.add(df);
|
|
68
|
-
let phiStmt = this.createEmptyPhiStmt(local);
|
|
69
|
-
if (blockToPhiStmts.has(df)) {
|
|
70
|
-
(_a = blockToPhiStmts.get(df)) === null || _a === void 0 ? void 0 : _a.add(phiStmt);
|
|
71
|
-
(_b = blockToPhiLocals.get(df)) === null || _b === void 0 ? void 0 : _b.add(local);
|
|
72
|
-
}
|
|
73
|
-
else {
|
|
74
|
-
let phiStmts = new Set();
|
|
75
|
-
phiStmts.add(phiStmt);
|
|
76
|
-
blockToPhiStmts.set(df, phiStmts);
|
|
77
|
-
let phiLocals = new Set();
|
|
78
|
-
phiLocals.add(local);
|
|
79
|
-
blockToPhiLocals.set(df, phiLocals);
|
|
80
|
-
}
|
|
81
|
-
(_c = blockToDefs.get(df)) === null || _c === void 0 ? void 0 : _c.add(local);
|
|
82
|
-
if (!((_d = blockToDefs.get(df)) === null || _d === void 0 ? void 0 : _d.has(local))) {
|
|
83
|
-
blocks.push(df);
|
|
84
|
-
}
|
|
85
|
-
}
|
|
86
|
-
}
|
|
87
|
-
}
|
|
88
|
-
}
|
|
89
|
-
return blockToPhiStmts;
|
|
90
|
-
}
|
|
91
|
-
addPhiStmts(blockToPhiStmts, cfg, blockToDefs) {
|
|
92
|
-
var _a;
|
|
93
|
-
let phiArgsNum = new Map();
|
|
94
|
-
for (const block of cfg.getBlocks()) {
|
|
95
|
-
let succs = Array.from(block.getSuccessors());
|
|
96
|
-
for (const succ of succs) {
|
|
97
|
-
if (blockToPhiStmts.has(succ)) {
|
|
98
|
-
for (const phi of blockToPhiStmts.get(succ)) {
|
|
99
|
-
let local = phi.getDef();
|
|
100
|
-
if ((_a = blockToDefs.get(block)) === null || _a === void 0 ? void 0 : _a.has(local)) {
|
|
101
|
-
if (phiArgsNum.has(phi)) {
|
|
102
|
-
let num = phiArgsNum.get(phi);
|
|
103
|
-
phiArgsNum.set(phi, num + 1);
|
|
104
|
-
}
|
|
105
|
-
else {
|
|
106
|
-
phiArgsNum.set(phi, 1);
|
|
107
|
-
}
|
|
108
|
-
}
|
|
109
|
-
}
|
|
110
|
-
}
|
|
111
|
-
}
|
|
112
|
-
}
|
|
113
|
-
for (const block of blockToPhiStmts.keys()) {
|
|
114
|
-
let phis = blockToPhiStmts.get(block);
|
|
115
|
-
let phisTocheck = new Set(phis);
|
|
116
|
-
for (const phi of phisTocheck) {
|
|
117
|
-
if (phiArgsNum.get(phi) < 2) {
|
|
118
|
-
phis.delete(phi);
|
|
119
|
-
}
|
|
120
|
-
}
|
|
121
|
-
for (const phi of phis) {
|
|
122
|
-
cfg.insertBefore(phi, block.getHead());
|
|
123
|
-
}
|
|
124
|
-
}
|
|
125
|
-
}
|
|
126
|
-
renameLocals(body, dominanceTree, blockToPhiStmts) {
|
|
127
|
-
var _a, _b;
|
|
128
|
-
let newLocals = new Set(body.getLocals().values());
|
|
129
|
-
let localToNameStack = new Map();
|
|
130
|
-
for (const local of newLocals) {
|
|
131
|
-
localToNameStack.set(local, new Array());
|
|
132
|
-
}
|
|
133
|
-
let blockStack = new Array();
|
|
134
|
-
let visited = new Set();
|
|
135
|
-
let dfsBlocks = dominanceTree.getAllNodesDFS();
|
|
136
|
-
let nextFreeIdx = 0;
|
|
137
|
-
for (const block of dfsBlocks) {
|
|
138
|
-
let newPhiStmts = new Set();
|
|
139
|
-
for (const stmt of block.getStmts()) {
|
|
140
|
-
// rename uses
|
|
141
|
-
let uses = stmt.getUses();
|
|
142
|
-
if (uses.length > 0 && !this.constainsPhiExpr(stmt)) {
|
|
143
|
-
for (const use of uses) {
|
|
144
|
-
if (use instanceof Local_1.Local) {
|
|
145
|
-
let nameStack = localToNameStack.get(use);
|
|
146
|
-
let newUse = nameStack[nameStack.length - 1];
|
|
147
|
-
stmt.replaceUse(use, newUse);
|
|
148
|
-
}
|
|
149
|
-
}
|
|
150
|
-
}
|
|
151
|
-
// rename def
|
|
152
|
-
let def = stmt.getDef();
|
|
153
|
-
if (def != null && def instanceof Local_1.Local) {
|
|
154
|
-
let newName = def.getName() + '#' + nextFreeIdx;
|
|
155
|
-
nextFreeIdx++;
|
|
156
|
-
let newDef = new Local_1.Local(newName);
|
|
157
|
-
newDef.setOriginalValue(def);
|
|
158
|
-
newLocals.add(newDef);
|
|
159
|
-
(_a = localToNameStack.get(def)) === null || _a === void 0 ? void 0 : _a.push(newDef);
|
|
160
|
-
stmt.setLeftOp(newDef);
|
|
161
|
-
if (this.constainsPhiExpr(stmt)) {
|
|
162
|
-
newPhiStmts.add(stmt);
|
|
163
|
-
}
|
|
164
|
-
}
|
|
165
|
-
}
|
|
166
|
-
visited.add(block);
|
|
167
|
-
blockStack.push(block);
|
|
168
|
-
if (blockToPhiStmts.has(block)) {
|
|
169
|
-
blockToPhiStmts.set(block, newPhiStmts);
|
|
170
|
-
}
|
|
171
|
-
// rename phiStmts' args
|
|
172
|
-
let succs = Array.from(block.getSuccessors());
|
|
173
|
-
for (const succ of succs) {
|
|
174
|
-
if (blockToPhiStmts.has(succ)) {
|
|
175
|
-
let phiStmts = blockToPhiStmts.get(succ);
|
|
176
|
-
for (const phiStmt of phiStmts) {
|
|
177
|
-
let def = phiStmt.getDef();
|
|
178
|
-
let oriDef = this.getOriginalLocal(def, new Set(localToNameStack.keys()));
|
|
179
|
-
let nameStack = localToNameStack.get(oriDef);
|
|
180
|
-
let arg = nameStack[nameStack.length - 1];
|
|
181
|
-
this.addNewArgToPhi(phiStmt, arg, block);
|
|
182
|
-
}
|
|
183
|
-
}
|
|
184
|
-
}
|
|
185
|
-
// if a block's children in dominance tree are visited, remove it
|
|
186
|
-
let top = blockStack[blockStack.length - 1];
|
|
187
|
-
let children = dominanceTree.getChildren(top);
|
|
188
|
-
while (this.containsAllChildren(visited, children)) {
|
|
189
|
-
blockStack.pop();
|
|
190
|
-
for (const stmt of top.getStmts()) {
|
|
191
|
-
let def = stmt.getDef();
|
|
192
|
-
if (def != null && def instanceof Local_1.Local) {
|
|
193
|
-
let oriDef = this.getOriginalLocal(def, new Set(localToNameStack.keys()));
|
|
194
|
-
(_b = localToNameStack.get(oriDef)) === null || _b === void 0 ? void 0 : _b.pop();
|
|
195
|
-
}
|
|
196
|
-
}
|
|
197
|
-
// next block to check
|
|
198
|
-
if (blockStack.length > 0) {
|
|
199
|
-
top = blockStack[blockStack.length - 1];
|
|
200
|
-
children = dominanceTree.getChildren(top);
|
|
201
|
-
}
|
|
202
|
-
else {
|
|
203
|
-
break;
|
|
204
|
-
}
|
|
205
|
-
}
|
|
206
|
-
}
|
|
207
|
-
body.setLocals(newLocals);
|
|
208
|
-
}
|
|
209
|
-
constainsPhiExpr(stmt) {
|
|
210
|
-
if (stmt instanceof Stmt_1.ArkAssignStmt && stmt.getUses().length > 0) {
|
|
211
|
-
for (const use of stmt.getUses()) {
|
|
212
|
-
if (use instanceof Expr_1.ArkPhiExpr) {
|
|
213
|
-
return true;
|
|
214
|
-
}
|
|
215
|
-
}
|
|
216
|
-
}
|
|
217
|
-
return false;
|
|
218
|
-
}
|
|
219
|
-
getOriginalLocal(local, locals) {
|
|
220
|
-
if (locals.has(local)) {
|
|
221
|
-
return local;
|
|
222
|
-
}
|
|
223
|
-
let hashPos = local.getName().indexOf('#');
|
|
224
|
-
let oriName = local.getName().substring(0, hashPos);
|
|
225
|
-
for (const oriLocal of locals) {
|
|
226
|
-
if (oriLocal.getName() === oriName) {
|
|
227
|
-
return oriLocal;
|
|
228
|
-
}
|
|
229
|
-
}
|
|
230
|
-
return null;
|
|
231
|
-
}
|
|
232
|
-
addNewArgToPhi(phiStmt, arg, block) {
|
|
233
|
-
for (let use of phiStmt.getUses()) {
|
|
234
|
-
if (use instanceof Expr_1.ArkPhiExpr) {
|
|
235
|
-
let phiExpr = use;
|
|
236
|
-
let args = phiExpr.getArgs();
|
|
237
|
-
let argToBlock = phiExpr.getArgToBlock();
|
|
238
|
-
args.push(arg);
|
|
239
|
-
argToBlock.set(arg, block);
|
|
240
|
-
phiExpr.setArgs(args);
|
|
241
|
-
phiExpr.setArgToBlock(argToBlock);
|
|
242
|
-
break;
|
|
243
|
-
}
|
|
244
|
-
}
|
|
245
|
-
}
|
|
246
|
-
containsAllChildren(blockSet, children) {
|
|
247
|
-
for (const child of children) {
|
|
248
|
-
if (!blockSet.has(child)) {
|
|
249
|
-
return false;
|
|
250
|
-
}
|
|
251
|
-
}
|
|
252
|
-
return true;
|
|
253
|
-
}
|
|
254
|
-
createEmptyPhiStmt(local) {
|
|
255
|
-
let phiExpr = new Expr_1.ArkPhiExpr();
|
|
256
|
-
return new Stmt_1.ArkAssignStmt(local, phiExpr);
|
|
257
|
-
}
|
|
258
|
-
}
|
|
259
|
-
exports.StaticSingleAssignmentFormer = StaticSingleAssignmentFormer;
|
|
1
|
+
"use strict";
|
|
2
|
+
/*
|
|
3
|
+
* Copyright (c) 2024 Huawei Device Co., Ltd.
|
|
4
|
+
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
5
|
+
* you may not use this file except in compliance with the License.
|
|
6
|
+
* You may obtain a copy of the License at
|
|
7
|
+
*
|
|
8
|
+
* http://www.apache.org/licenses/LICENSE-2.0
|
|
9
|
+
*
|
|
10
|
+
* Unless required by applicable law or agreed to in writing, software
|
|
11
|
+
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
12
|
+
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
13
|
+
* See the License for the specific language governing permissions and
|
|
14
|
+
* limitations under the License.
|
|
15
|
+
*/
|
|
16
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
17
|
+
exports.StaticSingleAssignmentFormer = void 0;
|
|
18
|
+
const Expr_1 = require("../core/base/Expr");
|
|
19
|
+
const Local_1 = require("../core/base/Local");
|
|
20
|
+
const Stmt_1 = require("../core/base/Stmt");
|
|
21
|
+
const DominanceFinder_1 = require("../core/graph/DominanceFinder");
|
|
22
|
+
const DominanceTree_1 = require("../core/graph/DominanceTree");
|
|
23
|
+
class StaticSingleAssignmentFormer {
|
|
24
|
+
transformBody(body) {
|
|
25
|
+
var _a;
|
|
26
|
+
let cfg = body.getCfg();
|
|
27
|
+
let blockToDefs = new Map();
|
|
28
|
+
let localToBlocks = new Map();
|
|
29
|
+
for (const block of cfg.getBlocks()) {
|
|
30
|
+
let defs = new Set();
|
|
31
|
+
for (const stmt of block.getStmts()) {
|
|
32
|
+
if (stmt.getDef() != null && stmt.getDef() instanceof Local_1.Local) {
|
|
33
|
+
let local = stmt.getDef();
|
|
34
|
+
defs.add(local);
|
|
35
|
+
if (localToBlocks.has(local)) {
|
|
36
|
+
(_a = localToBlocks.get(local)) === null || _a === void 0 ? void 0 : _a.add(block);
|
|
37
|
+
}
|
|
38
|
+
else {
|
|
39
|
+
let blcoks = new Set();
|
|
40
|
+
blcoks.add(block);
|
|
41
|
+
localToBlocks.set(local, blcoks);
|
|
42
|
+
}
|
|
43
|
+
}
|
|
44
|
+
}
|
|
45
|
+
blockToDefs.set(block, defs);
|
|
46
|
+
}
|
|
47
|
+
let dominanceFinder = new DominanceFinder_1.DominanceFinder(cfg);
|
|
48
|
+
let blockToPhiStmts = this.decideBlockToPhiStmts(body, dominanceFinder, blockToDefs, localToBlocks);
|
|
49
|
+
this.addPhiStmts(blockToPhiStmts, cfg, blockToDefs);
|
|
50
|
+
let dominanceTree = new DominanceTree_1.DominanceTree(dominanceFinder);
|
|
51
|
+
this.renameLocals(body, dominanceTree, blockToPhiStmts);
|
|
52
|
+
}
|
|
53
|
+
decideBlockToPhiStmts(body, dominanceFinder, blockToDefs, localToBlocks) {
|
|
54
|
+
var _a, _b, _c, _d;
|
|
55
|
+
let blockToPhiStmts = new Map();
|
|
56
|
+
let blockToPhiLocals = new Map();
|
|
57
|
+
let localToPhiBlock = new Map();
|
|
58
|
+
for (const [_, local] of body.getLocals()) {
|
|
59
|
+
localToPhiBlock.set(local, new Set());
|
|
60
|
+
let phiBlocks = localToPhiBlock.get(local);
|
|
61
|
+
let blocks = Array.from(localToBlocks.get(local));
|
|
62
|
+
while (blocks.length !== 0) {
|
|
63
|
+
let block = blocks.splice(0, 1).at(0);
|
|
64
|
+
let dfs = dominanceFinder.getDominanceFrontiers(block);
|
|
65
|
+
for (const df of dfs) {
|
|
66
|
+
if (!phiBlocks.has(df)) {
|
|
67
|
+
phiBlocks.add(df);
|
|
68
|
+
let phiStmt = this.createEmptyPhiStmt(local);
|
|
69
|
+
if (blockToPhiStmts.has(df)) {
|
|
70
|
+
(_a = blockToPhiStmts.get(df)) === null || _a === void 0 ? void 0 : _a.add(phiStmt);
|
|
71
|
+
(_b = blockToPhiLocals.get(df)) === null || _b === void 0 ? void 0 : _b.add(local);
|
|
72
|
+
}
|
|
73
|
+
else {
|
|
74
|
+
let phiStmts = new Set();
|
|
75
|
+
phiStmts.add(phiStmt);
|
|
76
|
+
blockToPhiStmts.set(df, phiStmts);
|
|
77
|
+
let phiLocals = new Set();
|
|
78
|
+
phiLocals.add(local);
|
|
79
|
+
blockToPhiLocals.set(df, phiLocals);
|
|
80
|
+
}
|
|
81
|
+
(_c = blockToDefs.get(df)) === null || _c === void 0 ? void 0 : _c.add(local);
|
|
82
|
+
if (!((_d = blockToDefs.get(df)) === null || _d === void 0 ? void 0 : _d.has(local))) {
|
|
83
|
+
blocks.push(df);
|
|
84
|
+
}
|
|
85
|
+
}
|
|
86
|
+
}
|
|
87
|
+
}
|
|
88
|
+
}
|
|
89
|
+
return blockToPhiStmts;
|
|
90
|
+
}
|
|
91
|
+
addPhiStmts(blockToPhiStmts, cfg, blockToDefs) {
|
|
92
|
+
var _a;
|
|
93
|
+
let phiArgsNum = new Map();
|
|
94
|
+
for (const block of cfg.getBlocks()) {
|
|
95
|
+
let succs = Array.from(block.getSuccessors());
|
|
96
|
+
for (const succ of succs) {
|
|
97
|
+
if (blockToPhiStmts.has(succ)) {
|
|
98
|
+
for (const phi of blockToPhiStmts.get(succ)) {
|
|
99
|
+
let local = phi.getDef();
|
|
100
|
+
if ((_a = blockToDefs.get(block)) === null || _a === void 0 ? void 0 : _a.has(local)) {
|
|
101
|
+
if (phiArgsNum.has(phi)) {
|
|
102
|
+
let num = phiArgsNum.get(phi);
|
|
103
|
+
phiArgsNum.set(phi, num + 1);
|
|
104
|
+
}
|
|
105
|
+
else {
|
|
106
|
+
phiArgsNum.set(phi, 1);
|
|
107
|
+
}
|
|
108
|
+
}
|
|
109
|
+
}
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
}
|
|
113
|
+
for (const block of blockToPhiStmts.keys()) {
|
|
114
|
+
let phis = blockToPhiStmts.get(block);
|
|
115
|
+
let phisTocheck = new Set(phis);
|
|
116
|
+
for (const phi of phisTocheck) {
|
|
117
|
+
if (phiArgsNum.get(phi) < 2) {
|
|
118
|
+
phis.delete(phi);
|
|
119
|
+
}
|
|
120
|
+
}
|
|
121
|
+
for (const phi of phis) {
|
|
122
|
+
cfg.insertBefore(phi, block.getHead());
|
|
123
|
+
}
|
|
124
|
+
}
|
|
125
|
+
}
|
|
126
|
+
renameLocals(body, dominanceTree, blockToPhiStmts) {
|
|
127
|
+
var _a, _b;
|
|
128
|
+
let newLocals = new Set(body.getLocals().values());
|
|
129
|
+
let localToNameStack = new Map();
|
|
130
|
+
for (const local of newLocals) {
|
|
131
|
+
localToNameStack.set(local, new Array());
|
|
132
|
+
}
|
|
133
|
+
let blockStack = new Array();
|
|
134
|
+
let visited = new Set();
|
|
135
|
+
let dfsBlocks = dominanceTree.getAllNodesDFS();
|
|
136
|
+
let nextFreeIdx = 0;
|
|
137
|
+
for (const block of dfsBlocks) {
|
|
138
|
+
let newPhiStmts = new Set();
|
|
139
|
+
for (const stmt of block.getStmts()) {
|
|
140
|
+
// rename uses
|
|
141
|
+
let uses = stmt.getUses();
|
|
142
|
+
if (uses.length > 0 && !this.constainsPhiExpr(stmt)) {
|
|
143
|
+
for (const use of uses) {
|
|
144
|
+
if (use instanceof Local_1.Local) {
|
|
145
|
+
let nameStack = localToNameStack.get(use);
|
|
146
|
+
let newUse = nameStack[nameStack.length - 1];
|
|
147
|
+
stmt.replaceUse(use, newUse);
|
|
148
|
+
}
|
|
149
|
+
}
|
|
150
|
+
}
|
|
151
|
+
// rename def
|
|
152
|
+
let def = stmt.getDef();
|
|
153
|
+
if (def != null && def instanceof Local_1.Local) {
|
|
154
|
+
let newName = def.getName() + '#' + nextFreeIdx;
|
|
155
|
+
nextFreeIdx++;
|
|
156
|
+
let newDef = new Local_1.Local(newName);
|
|
157
|
+
newDef.setOriginalValue(def);
|
|
158
|
+
newLocals.add(newDef);
|
|
159
|
+
(_a = localToNameStack.get(def)) === null || _a === void 0 ? void 0 : _a.push(newDef);
|
|
160
|
+
stmt.setLeftOp(newDef);
|
|
161
|
+
if (this.constainsPhiExpr(stmt)) {
|
|
162
|
+
newPhiStmts.add(stmt);
|
|
163
|
+
}
|
|
164
|
+
}
|
|
165
|
+
}
|
|
166
|
+
visited.add(block);
|
|
167
|
+
blockStack.push(block);
|
|
168
|
+
if (blockToPhiStmts.has(block)) {
|
|
169
|
+
blockToPhiStmts.set(block, newPhiStmts);
|
|
170
|
+
}
|
|
171
|
+
// rename phiStmts' args
|
|
172
|
+
let succs = Array.from(block.getSuccessors());
|
|
173
|
+
for (const succ of succs) {
|
|
174
|
+
if (blockToPhiStmts.has(succ)) {
|
|
175
|
+
let phiStmts = blockToPhiStmts.get(succ);
|
|
176
|
+
for (const phiStmt of phiStmts) {
|
|
177
|
+
let def = phiStmt.getDef();
|
|
178
|
+
let oriDef = this.getOriginalLocal(def, new Set(localToNameStack.keys()));
|
|
179
|
+
let nameStack = localToNameStack.get(oriDef);
|
|
180
|
+
let arg = nameStack[nameStack.length - 1];
|
|
181
|
+
this.addNewArgToPhi(phiStmt, arg, block);
|
|
182
|
+
}
|
|
183
|
+
}
|
|
184
|
+
}
|
|
185
|
+
// if a block's children in dominance tree are visited, remove it
|
|
186
|
+
let top = blockStack[blockStack.length - 1];
|
|
187
|
+
let children = dominanceTree.getChildren(top);
|
|
188
|
+
while (this.containsAllChildren(visited, children)) {
|
|
189
|
+
blockStack.pop();
|
|
190
|
+
for (const stmt of top.getStmts()) {
|
|
191
|
+
let def = stmt.getDef();
|
|
192
|
+
if (def != null && def instanceof Local_1.Local) {
|
|
193
|
+
let oriDef = this.getOriginalLocal(def, new Set(localToNameStack.keys()));
|
|
194
|
+
(_b = localToNameStack.get(oriDef)) === null || _b === void 0 ? void 0 : _b.pop();
|
|
195
|
+
}
|
|
196
|
+
}
|
|
197
|
+
// next block to check
|
|
198
|
+
if (blockStack.length > 0) {
|
|
199
|
+
top = blockStack[blockStack.length - 1];
|
|
200
|
+
children = dominanceTree.getChildren(top);
|
|
201
|
+
}
|
|
202
|
+
else {
|
|
203
|
+
break;
|
|
204
|
+
}
|
|
205
|
+
}
|
|
206
|
+
}
|
|
207
|
+
body.setLocals(newLocals);
|
|
208
|
+
}
|
|
209
|
+
constainsPhiExpr(stmt) {
|
|
210
|
+
if (stmt instanceof Stmt_1.ArkAssignStmt && stmt.getUses().length > 0) {
|
|
211
|
+
for (const use of stmt.getUses()) {
|
|
212
|
+
if (use instanceof Expr_1.ArkPhiExpr) {
|
|
213
|
+
return true;
|
|
214
|
+
}
|
|
215
|
+
}
|
|
216
|
+
}
|
|
217
|
+
return false;
|
|
218
|
+
}
|
|
219
|
+
getOriginalLocal(local, locals) {
|
|
220
|
+
if (locals.has(local)) {
|
|
221
|
+
return local;
|
|
222
|
+
}
|
|
223
|
+
let hashPos = local.getName().indexOf('#');
|
|
224
|
+
let oriName = local.getName().substring(0, hashPos);
|
|
225
|
+
for (const oriLocal of locals) {
|
|
226
|
+
if (oriLocal.getName() === oriName) {
|
|
227
|
+
return oriLocal;
|
|
228
|
+
}
|
|
229
|
+
}
|
|
230
|
+
return null;
|
|
231
|
+
}
|
|
232
|
+
addNewArgToPhi(phiStmt, arg, block) {
|
|
233
|
+
for (let use of phiStmt.getUses()) {
|
|
234
|
+
if (use instanceof Expr_1.ArkPhiExpr) {
|
|
235
|
+
let phiExpr = use;
|
|
236
|
+
let args = phiExpr.getArgs();
|
|
237
|
+
let argToBlock = phiExpr.getArgToBlock();
|
|
238
|
+
args.push(arg);
|
|
239
|
+
argToBlock.set(arg, block);
|
|
240
|
+
phiExpr.setArgs(args);
|
|
241
|
+
phiExpr.setArgToBlock(argToBlock);
|
|
242
|
+
break;
|
|
243
|
+
}
|
|
244
|
+
}
|
|
245
|
+
}
|
|
246
|
+
containsAllChildren(blockSet, children) {
|
|
247
|
+
for (const child of children) {
|
|
248
|
+
if (!blockSet.has(child)) {
|
|
249
|
+
return false;
|
|
250
|
+
}
|
|
251
|
+
}
|
|
252
|
+
return true;
|
|
253
|
+
}
|
|
254
|
+
createEmptyPhiStmt(local) {
|
|
255
|
+
let phiExpr = new Expr_1.ArkPhiExpr();
|
|
256
|
+
return new Stmt_1.ArkAssignStmt(local, phiExpr);
|
|
257
|
+
}
|
|
258
|
+
}
|
|
259
|
+
exports.StaticSingleAssignmentFormer = StaticSingleAssignmentFormer;
|
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
/**
|
|
2
|
-
*
|
|
3
|
-
*/
|
|
4
|
-
declare class Transformer {
|
|
5
|
-
internalTransform(): void;
|
|
6
|
-
}
|
|
1
|
+
/**
|
|
2
|
+
*
|
|
3
|
+
*/
|
|
4
|
+
declare class Transformer {
|
|
5
|
+
internalTransform(): void;
|
|
6
|
+
}
|
|
7
7
|
//# sourceMappingURL=Transformer.d.ts.map
|