arkanalyzer 1.0.5

package/lib/core/graph/Cfg.js

@@ -0,0 +1,154 @@
+"use strict";
+/*
+ * Copyright (c) 2024 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Cfg = void 0;
+const DefUseChain_1 = require("../base/DefUseChain");
+const Local_1 = require("../base/Local");
+const Stmt_1 = require("../base/Stmt");
+const ArkMethod_1 = require("../model/ArkMethod");
+const Position_1 = require("../base/Position");
+/**
+ * @category core/graph
+ */
+class Cfg {
+    constructor() {
+        this.blocks = new Set();
+        this.stmtToBlock = new Map();
+        this.startingStmt = new Stmt_1.OriginalStmt('', Position_1.LineColPosition.DEFAULT);
+        this.defUseChains = [];
+        this.declaringMethod = new ArkMethod_1.ArkMethod();
+    }
+    getStmts() {
+        let stmts = new Array();
+        for (const block of this.blocks) {
+            stmts.push(...block.getStmts());
+        }
+        return stmts;
+    }
+    // TODO
+    insertBefore(beforeStmt, newStmt) {
+        const block = this.stmtToBlock.get(beforeStmt);
+        // Simplify edition just for SSA
+        block.addStmtToFirst(newStmt);
+        this.stmtToBlock.set(newStmt, block);
+    }
+    // TODO: 添加block之间的边
+    addBlock(block) {
+        this.blocks.add(block);
+        for (const stmt of block.getStmts()) {
+            this.stmtToBlock.set(stmt, block);
+        }
+    }
+    getBlocks() {
+        return this.blocks;
+    }
+    getStartingBlock() {
+        return this.stmtToBlock.get(this.startingStmt);
+    }
+    getStartingStmt() {
+        return this.startingStmt;
+    }
+    setStartingStmt(newStartingStmt) {
+        this.startingStmt = newStartingStmt;
+    }
+    getDeclaringMethod() {
+        return this.declaringMethod;
+    }
+    setDeclaringMethod(method) {
+        this.declaringMethod = method;
+    }
+    getDefUseChains() {
+        return this.defUseChains;
+    }
+    // TODO: 整理成类似jimple的输出
+    toString() {
+        return 'cfg';
+    }
+    buildDefUseStmt() {
+        for (const block of this.blocks) {
+            for (const stmt of block.getStmts()) {
+                const defValue = stmt.getDef();
+                if (defValue && defValue instanceof Local_1.Local) {
+                    defValue.setDeclaringStmt(stmt);
+                }
+                for (const value of stmt.getUses()) {
+                    if (value instanceof Local_1.Local) {
+                        const local = value;
+                        local.addUsedStmt(stmt);
+                    }
+                }
+            }
+        }
+    }
+    buildDefUseChain() {
+        var _a, _b;
+        for (const block of this.blocks) {
+            for (let stmtIndex = 0; stmtIndex < block.getStmts().length; stmtIndex++) {
+                const stmt = block.getStmts()[stmtIndex];
+                for (const value of stmt.getUses()) {
+                    const name = value.toString();
+                    const defStmts = [];
+                    // 判断本block之前有无对应def
+                    for (let i = stmtIndex - 1; i >= 0; i--) {
+                        const beforeStmt = block.getStmts()[i];
+                        if (beforeStmt.getDef() && ((_a = beforeStmt.getDef()) === null || _a === void 0 ? void 0 : _a.toString()) == name) {
+                            defStmts.push(beforeStmt);
+                            break;
+                        }
+                    }
+                    // 本block有对应def直接结束,否则找所有的前序block
+                    if (defStmts.length != 0) {
+                        this.defUseChains.push(new DefUseChain_1.DefUseChain(value, defStmts[0], stmt));
+                    }
+                    else {
+                        const needWalkBlocks = [];
+                        for (const predecessor of block.getPredecessors()) {
+                            needWalkBlocks.push(predecessor);
+                        }
+                        const walkedBlocks = new Set();
+                        while (needWalkBlocks.length > 0) {
+                            const predecessor = needWalkBlocks.pop();
+                            if (!predecessor) {
+                                return;
+                            }
+                            const predecessorStmts = predecessor.getStmts();
+                            let predecessorHasDef = false;
+                            for (let i = predecessorStmts.length - 1; i >= 0; i--) {
+                                const beforeStmt = predecessorStmts[i];
+                                if (beforeStmt.getDef() && ((_b = beforeStmt.getDef()) === null || _b === void 0 ? void 0 : _b.toString()) == name) {
+                                    defStmts.push(beforeStmt);
+                                    predecessorHasDef = true;
+                                    break;
+                                }
+                            }
+                            if (!predecessorHasDef) {
+                                for (const morePredecessor of predecessor.getPredecessors()) {
+                                    if (!walkedBlocks.has(morePredecessor) && !needWalkBlocks.includes(morePredecessor))
+                                        needWalkBlocks.unshift(morePredecessor);
+                                }
+                            }
+                            walkedBlocks.add(predecessor);
+                        }
+                        for (const def of defStmts) {
+                            this.defUseChains.push(new DefUseChain_1.DefUseChain(value, def, stmt));
+                        }
+                    }
+                }
+            }
+        }
+    }
+}
+exports.Cfg = Cfg;

package/lib/core/graph/DominanceFinder.d.ts

@@ -0,0 +1,16 @@
+import { BasicBlock } from './BasicBlock';
+import { Cfg } from './Cfg';
+export declare class DominanceFinder {
+    private blocks;
+    private blockToIdx;
+    private idoms;
+    private domFrontiers;
+    constructor(cfg: Cfg);
+    getDominanceFrontiers(block: BasicBlock): Set<BasicBlock>;
+    getBlocks(): BasicBlock[];
+    getBlockToIdx(): Map<BasicBlock, number>;
+    getImmediateDominators(): number[];
+    private getFirstDefinedBlockPredIdx;
+    private intersect;
+}
+//# sourceMappingURL=DominanceFinder.d.ts.map

package/lib/core/graph/DominanceFinder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DominanceFinder.d.ts","sourceRoot":"","sources":["../../../src/core/graph/DominanceFinder.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B,qBAAa,eAAe;IACxB,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,UAAU,CAA+B;IACjD,OAAO,CAAC,KAAK,CAAgB;IAC7B,OAAO,CAAC,YAAY,CAAkB;gBAE1B,GAAG,EAAE,GAAG;IA2Db,qBAAqB,CAAC,KAAK,EAAE,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;IAazD,SAAS,IAAI,UAAU,EAAE;IAIzB,aAAa,IAAI,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC;IAIxC,sBAAsB,IAAI,MAAM,EAAE;IAKzC,OAAO,CAAC,2BAA2B;IAUnC,OAAO,CAAC,SAAS;CAUpB"}

package/lib/core/graph/DominanceFinder.js

@@ -0,0 +1,121 @@
+"use strict";
+/*
+ * Copyright (c) 2024 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DominanceFinder = void 0;
+class DominanceFinder {
+    constructor(cfg) {
+        this.blocks = [];
+        this.blockToIdx = new Map;
+        this.idoms = [];
+        this.domFrontiers = [];
+        this.blocks = Array.from(cfg.getBlocks());
+        for (let i = 0; i < this.blocks.length; i++) {
+            let block = this.blocks[i];
+            this.blockToIdx.set(block, i);
+        }
+        const startingBlock = cfg.getStartingBlock();
+        // calculate immediate dominator for each block
+        this.idoms = new Array(this.blocks.length);
+        this.idoms[0] = 0;
+        for (let i = 1; i < this.idoms.length; i++) {
+            this.idoms[i] = -1;
+        }
+        let isChanged = true;
+        while (isChanged) {
+            isChanged = false;
+            for (const block of this.blocks) {
+                if (block == startingBlock) {
+                    continue;
+                }
+                let blockIdx = this.blockToIdx.get(block);
+                let preds = Array.from(block.getPredecessors());
+                let newIdom = this.getFirstDefinedBlockPredIdx(preds);
+                if (preds.length > 0 && newIdom != -1) {
+                    for (const pred of preds) {
+                        let predIdx = this.blockToIdx.get(pred);
+                        if (this.idoms[predIdx] != -1) {
+                            newIdom = this.intersect(newIdom, predIdx);
+                        }
+                    }
+                    if (this.idoms[blockIdx] != newIdom) {
+                        this.idoms[blockIdx] = newIdom;
+                        isChanged = true;
+                    }
+                }
+            }
+        }
+        // calculate dominance frontiers for each block
+        this.domFrontiers = new Array(this.blocks.length);
+        for (let i = 0; i < this.domFrontiers.length; i++) {
+            this.domFrontiers[i] = new Array();
+        }
+        for (const block of this.blocks) {
+            let preds = Array.from(block.getPredecessors());
+            if (preds.length > 1) {
+                let blockIdx = this.blockToIdx.get(block);
+                for (const pred of preds) {
+                    let predIdx = this.blockToIdx.get(pred);
+                    while (predIdx != this.idoms[blockIdx]) {
+                        this.domFrontiers[predIdx].push(blockIdx);
+                        predIdx = this.idoms[predIdx];
+                    }
+                }
+            }
+        }
+    }
+    getDominanceFrontiers(block) {
+        if (!this.blockToIdx.has(block)) {
+            throw new Error("The given block: " + block + " is not in Cfg!");
+        }
+        let idx = this.blockToIdx.get(block);
+        let dfs = new Set();
+        let dfsIdx = this.domFrontiers[idx];
+        for (const dfIdx of dfsIdx) {
+            dfs.add(this.blocks[dfIdx]);
+        }
+        return dfs;
+    }
+    getBlocks() {
+        return this.blocks;
+    }
+    getBlockToIdx() {
+        return this.blockToIdx;
+    }
+    getImmediateDominators() {
+        return this.idoms;
+    }
+    getFirstDefinedBlockPredIdx(preds) {
+        for (const block of preds) {
+            let idx = this.blockToIdx.get(block);
+            if (this.idoms[idx] != -1) {
+                return idx;
+            }
+        }
+        return -1;
+    }
+    intersect(a, b) {
+        while (a != b) {
+            if (a > b) {
+                a = this.idoms[a];
+            }
+            else {
+                b = this.idoms[b];
+            }
+        }
+        return a;
+    }
+}
+exports.DominanceFinder = DominanceFinder;

package/lib/core/graph/DominanceTree.d.ts

@@ -0,0 +1,13 @@
+import { BasicBlock } from './BasicBlock';
+import { DominanceFinder } from './DominanceFinder';
+export declare class DominanceTree {
+    private blocks;
+    private blockToIdx;
+    private children;
+    private parents;
+    constructor(dominanceFinder: DominanceFinder);
+    getAllNodesDFS(): BasicBlock[];
+    getChildren(block: BasicBlock): BasicBlock[];
+    getRoot(): BasicBlock;
+}
+//# sourceMappingURL=DominanceTree.d.ts.map

package/lib/core/graph/DominanceTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DominanceTree.d.ts","sourceRoot":"","sources":["../../../src/core/graph/DominanceTree.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,qBAAa,aAAa;IACtB,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,QAAQ,CAAkB;IAClC,OAAO,CAAC,OAAO,CAAgB;gBAEnB,eAAe,EAAE,eAAe;IAqBrC,cAAc,IAAI,UAAU,EAAE;IAiB9B,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,EAAE;IAS5C,OAAO,IAAI,UAAU;CAG/B"}

package/lib/core/graph/DominanceTree.js

@@ -0,0 +1,70 @@
+"use strict";
+/*
+ * Copyright (c) 2024 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DominanceTree = void 0;
+class DominanceTree {
+    constructor(dominanceFinder) {
+        this.blocks = [];
+        this.blockToIdx = new Map();
+        this.children = [];
+        this.parents = [];
+        this.blocks = dominanceFinder.getBlocks();
+        this.blockToIdx = dominanceFinder.getBlockToIdx();
+        let idoms = dominanceFinder.getImmediateDominators();
+        // build the tree
+        let treeSize = this.blocks.length;
+        this.children = new Array(treeSize);
+        this.parents = new Array(treeSize);
+        for (let i = 0; i < treeSize; i++) {
+            this.children[i] = new Array();
+            this.parents[i] = -1;
+        }
+        for (let i = 0; i < treeSize; i++) {
+            if (idoms[i] != i) {
+                this.parents[i] = idoms[i];
+                this.children[idoms[i]].push(i);
+            }
+        }
+    }
+    getAllNodesDFS() {
+        let dfsBlocks = new Array();
+        let queue = new Array();
+        queue.push(this.getRoot());
+        while (queue.length != 0) {
+            let curr = queue.splice(0, 1)[0];
+            dfsBlocks.push(curr);
+            let childList = this.getChildren(curr);
+            if (childList.length != 0) {
+                for (let i = childList.length - 1; i >= 0; i--) {
+                    queue.splice(0, 0, childList[i]);
+                }
+            }
+        }
+        return dfsBlocks;
+    }
+    getChildren(block) {
+        let childList = new Array();
+        let idx = this.blockToIdx.get(block);
+        for (const i of this.children[idx]) {
+            childList.push(this.blocks[i]);
+        }
+        return childList;
+    }
+    getRoot() {
+        return this.blocks[0];
+    }
+}
+exports.DominanceTree = DominanceTree;

package/lib/core/graph/ViewTree.d.ts

@@ -0,0 +1,115 @@
+import { Constant } from '../base/Constant';
+import { Decorator } from '../base/Decorator';
+import { ArkInstanceFieldRef } from '../base/Ref';
+import { Stmt } from '../base/Stmt';
+import { Type } from '../base/Type';
+import { ArkField } from '../model/ArkField';
+import { ArkMethod } from '../model/ArkMethod';
+import { ClassSignature, MethodSignature } from '../model/ArkSignature';
+/**
+ * @category core/graph
+ */
+export interface ViewTreeNode {
+    /** Component node name */
+    name: string;
+    /** @deprecated Use {@link attributes} instead. */
+    stmts: Map<string, [Stmt, (Constant | ArkInstanceFieldRef | MethodSignature)[]]>;
+    /** Component attribute stmts, key is attribute name, value is [Stmt, [Uses Values]]. */
+    attributes: Map<string, [Stmt, (Constant | ArkInstanceFieldRef | MethodSignature)[]]>;
+    /** Used state values. */
+    stateValues: Set<ArkField>;
+    /** Node's parent, CustomComponent and root node no parent. */
+    parent: ViewTreeNode | null;
+    /** Node's children. */
+    children: ViewTreeNode[];
+    /** @deprecated Use {@link signature} instead. */
+    classSignature?: ClassSignature | MethodSignature;
+    /** CustomComponent class signature or Builder method signature. */
+    signature?: ClassSignature | MethodSignature;
+    /**
+     * Custom component value transfer
+     * - key: ArkField, child custom component class stateValue field.
+     * - value: ArkField | ArkMethod, parent component transfer value.
+     *     key is BuilderParam, the value is Builder ArkMethod.
+     *     Others, the value is parent class stateValue field.
+     */
+    stateValuesTransfer?: Map<ArkField, ArkField | ArkMethod>;
+    /** BuilderParam placeholders ArkField. */
+    builderParam?: ArkField;
+    /** builderParam bind builder method signature. */
+    builder?: MethodSignature;
+    /**
+     * walk node and node's children
+     * @param selector Node selector function, return true skipping the follow-up nodes.
+     * @returns
+     *  - true: There are nodes that meet the selector.
+     *  - false: does not exist.
+     */
+    walk(selector: (item: ViewTreeNode) => boolean): boolean;
+    /**
+     * Whether the node type is Builder.
+     * @returns true: node is Builder, false others.
+     */
+    isBuilder(): boolean;
+    /**
+     * Whether the node type is custom component.
+     * @returns true: node is custom component, false others.
+     */
+    isCustomComponent(): boolean;
+}
+/**
+ * ArkUI Component Tree
+ * @example
+ * // Component Class get ViewTree
+ * let arkClas: ArkClass = ...;
+ * let viewtree = arkClas.getViewTree();
+ *
+ * // get viewtree root node
+ * let root: ViewTreeNode = viewtree.getRoot();
+ *
+ * // get viewtree stateValues Map
+ * let stateValues: Map<ArkField, Set<ViewTreeNode>> = viewtree.getStateValues();
+ *
+ * // walk all nodes
+ * root.walk((node) => {
+ *   // check node is builder
+ *   if (node.isBuilder()) {
+ *      xx
+ *   }
+ *
+ *   // check node is sub CustomComponent
+ *   if (node.isCustomComponent()) {
+ *      xx
+ *   }
+ *
+ *   if (xxx) {
+ *      // Skip the remaining nodes and end the traversal
+ *      return true;
+ *   }
+ *
+ *   return false;
+ * })
+ *
+ * @category core/graph
+ */
+export interface ViewTree {
+    /**
+     * @deprecated Use {@link getStateValues} instead.
+     */
+    isClassField(name: string): boolean;
+    /**
+     * @deprecated Use {@link getStateValues} instead.
+     */
+    getClassFieldType(name: string): Decorator | Type | undefined;
+    /**
+     * Map of the component controlled by the state variable
+     * @returns
+     */
+    getStateValues(): Map<ArkField, Set<ViewTreeNode>>;
+    /**
+     * ViewTree root node.
+     * @returns root node
+     */
+    getRoot(): ViewTreeNode | null;
+}
+//# sourceMappingURL=ViewTree.d.ts.map

package/lib/core/graph/ViewTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ViewTree.d.ts","sourceRoot":"","sources":["../../../src/core/graph/ViewTree.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACpC,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACpC,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExE;;GAEG;AACH,MAAM,WAAW,YAAY;IACzB,0BAA0B;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,kDAAkD;IAClD,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,GAAG,mBAAmB,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC;IACjF,wFAAwF;IACxF,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,GAAG,mBAAmB,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC;IACtF,yBAAyB;IACzB,WAAW,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3B,8DAA8D;IAC9D,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;IAC5B,uBAAuB;IACvB,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,iDAAiD;IACjD,cAAc,CAAC,EAAE,cAAc,GAAG,eAAe,CAAC;IAClD,mEAAmE;IACnE,SAAS,CAAC,EAAE,cAAc,GAAG,eAAe,CAAC;IAE7C;;;;;;OAMG;IACH,mBAAmB,CAAC,EAAE,GAAG,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAC,CAAC;IAE1D,0CAA0C;IAC1C,YAAY,CAAC,EAAE,QAAQ,CAAC;IAExB,kDAAkD;IAClD,OAAO,CAAC,EAAE,eAAe,CAAC;IAE1B;;;;;;OAMG;IACH,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,GAAG,OAAO,CAAC;IAEzD;;;OAGG;IACH,SAAS,IAAI,OAAO,CAAC;IAErB;;;OAGG;IACH,iBAAiB,IAAI,OAAO,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,WAAW,QAAQ;IACrB;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAEpC;;OAEG;IACH,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS,CAAC;IAE9D;;;OAGG;IACH,cAAc,IAAI,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAEnD;;;OAGG;IACH,OAAO,IAAI,YAAY,GAAG,IAAI,CAAC;CAClC"}

package/lib/core/graph/ViewTree.js

@@ -0,0 +1,16 @@
+"use strict";
+/*
+ * Copyright (c) 2024 Huawei Device Co., Ltd.
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });