javascript-obfuscator
Version:
JavaScript obfuscator
197 lines (167 loc) • 6.67 kB
text/typescript
import { inject, injectable, } from 'inversify';
import { ServiceIdentifiers } from '../../container/ServiceIdentifiers';
import * as estraverse from 'estraverse';
import * as ESTree from 'estree';
import { IOptions } from '../../interfaces/options/IOptions';
import { IRandomGenerator } from '../../interfaces/utils/IRandomGenerator';
import { IVisitor } from '../../interfaces/node-transformers/IVisitor';
import { NodeTransformer } from '../../enums/node-transformers/NodeTransformer';
import { TransformationStage } from '../../enums/node-transformers/TransformationStage';
import { AbstractNodeTransformer } from '../AbstractNodeTransformer';
import { NodeFactory } from '../../node/NodeFactory';
import { NodeGuards } from '../../node/NodeGuards';
import { NodeLiteralUtils } from '../../node/NodeLiteralUtils';
import { NodeUtils } from '../../node/NodeUtils';
/**
* Splits strings into parts
*/
()
export class SplitStringTransformer extends AbstractNodeTransformer {
/**
* @type {number}
*/
private static readonly firstPassChunkLength: number = 1000;
/**
* @type {NodeTransformer[]}
*/
public runAfter: NodeTransformer[] = [
NodeTransformer.ObjectExpressionKeysTransformer,
NodeTransformer.TemplateLiteralTransformer
];
/**
* @param {IRandomGenerator} randomGenerator
* @param {IOptions} options
*/
public constructor (
randomGenerator: IRandomGenerator,
(ServiceIdentifiers.IOptions) options: IOptions
) {
(ServiceIdentifiers.IRandomGenerator) super(randomGenerator, options);
}
/**
* @param {string} string
* @param {number} chunkSize
* @returns {string[]}
*/
private static chunkString (string: string, chunkSize: number): string[] {
const chunksCount: number = Math.ceil(string.length / chunkSize);
const chunks: string[] = [];
let nextChunkStartIndex: number = 0;
for (
let chunkIndex: number = 0;
chunkIndex < chunksCount;
++chunkIndex, nextChunkStartIndex += chunkSize
) {
chunks[chunkIndex] = string.substr(nextChunkStartIndex, chunkSize);
}
return chunks;
}
/**
* @param {TransformationStage} transformationStage
* @returns {IVisitor | null}
*/
public getVisitor (transformationStage: TransformationStage): IVisitor | null {
switch (transformationStage) {
case TransformationStage.Converting:
return {
enter: (node: ESTree.Node, parentNode: ESTree.Node | null): ESTree.Node | undefined => {
if (!this.options.splitStrings) {
return;
}
if (parentNode && NodeGuards.isLiteralNode(node)) {
return this.transformNode(node, parentNode);
}
}
};
default:
return null;
}
}
/**
* Needs to split string on chunks of length `splitStringsChunkLength` in two pass, because of
* `Maximum call stack size exceeded` error in `esrecurse` package
*
* @param {Literal} literalNode
* @param {Node} parentNode
* @returns {Node}
*/
public transformNode (literalNode: ESTree.Literal, parentNode: ESTree.Node): ESTree.Node {
if (NodeLiteralUtils.isProhibitedLiteralNode(literalNode, parentNode)) {
return literalNode;
}
// pass #1: split string on a large chunks with length of `firstPassChunkLength`
const firstPassChunksNode: ESTree.Node = this.transformLiteralNodeByChunkLength(
literalNode,
parentNode,
SplitStringTransformer.firstPassChunkLength
);
// pass #2: split large chunks on a chunks with length of `splitStringsChunkLength`
const secondPassChunksNode: ESTree.Node = estraverse.replace(firstPassChunksNode, {
// eslint-disable-next-line no-shadow
enter: (node: ESTree.Node, parentNode: ESTree.Node | null) => {
if (parentNode && NodeGuards.isLiteralNode(node)) {
return this.transformLiteralNodeByChunkLength(
node,
parentNode,
this.options.splitStringsChunkLength
);
}
}
});
return secondPassChunksNode;
}
/**
* @param {Literal} literalNode
* @param {Node} parentNode
* @param {number} chunkLength
* @returns {Node}
*/
private transformLiteralNodeByChunkLength (
literalNode: ESTree.Literal,
parentNode: ESTree.Node,
chunkLength: number
): ESTree.Node {
if (typeof literalNode.value !== 'string') {
return literalNode;
}
if (chunkLength >= literalNode.value.length) {
return literalNode;
}
const stringChunks: string[] = SplitStringTransformer.chunkString(
literalNode.value,
chunkLength
);
const binaryExpressionNode: ESTree.BinaryExpression =
this.transformStringChunksToBinaryExpressionNode(stringChunks);
NodeUtils.parentizeAst(binaryExpressionNode);
NodeUtils.parentizeNode(binaryExpressionNode, parentNode);
return binaryExpressionNode;
}
/**
* @param {string[]} chunks
* @returns {BinaryExpression}
*/
private transformStringChunksToBinaryExpressionNode (chunks: string[]): ESTree.BinaryExpression {
const firstChunk: string | undefined = chunks.shift();
const secondChunk: string | undefined = chunks.shift();
if (!firstChunk || !secondChunk) {
throw new Error('First and second chunks values should not be empty');
}
const initialBinaryExpressionNode: ESTree.BinaryExpression = NodeFactory.binaryExpressionNode(
'+',
NodeFactory.literalNode(firstChunk),
NodeFactory.literalNode(secondChunk)
);
return chunks.reduce<ESTree.BinaryExpression>(
(binaryExpressionNode: ESTree.BinaryExpression, chunk: string) => {
const chunkLiteralNode: ESTree.Literal = NodeFactory.literalNode(chunk);
return NodeFactory.binaryExpressionNode(
'+',
binaryExpressionNode,
chunkLiteralNode
);
},
initialBinaryExpressionNode
);
}
}