lua-obfuscator 1.0.0 → 1.0.2

package/src/prometheus/src/prometheus/util.lua

@@ -1,297 +0,0 @@
--- This Script is Part of the Prometheus Obfuscator by Levno_710
---
--- util.lua
--- This file Provides some utility functions
-
-local logger = require("logger");
-local bit32  = require("prometheus.bit").bit32;
-
-local MAX_UNPACK_COUNT = 195;
-
-local function lookupify(tb)
-	local tb2 = {};
-	for _, v in ipairs(tb) do
-		tb2[v] = true
-	end
-	return tb2
-end
-
-local function unlookupify(tb)
-	local tb2 = {};
-	for v, _ in pairs(tb) do
-		table.insert(tb2, v);
-	end
-	return tb2;
-end
-
-local function escape(str)
-	return str:gsub(".", function(char)
-		if char:match("[^ %-~\n\t\a\b\v\r\"\']") then -- Check if non Printable ASCII Character
-			return string.format("\\%03d", string.byte(char))
-		end
-		if(char == "\\") then
-			return "\\\\";
-		end
-		if(char == "\n") then
-			return "\\n";
-		end
-		if(char == "\r") then
-			return "\\r";
-		end
-		if(char == "\t") then
-			return "\\t";
-		end
-		if(char == "\a") then
-			return "\\a";
-		end
-		if(char == "\b") then
-			return "\\b";
-		end
-		if(char == "\v") then
-			return "\\v";
-		end
-		if(char == "\"") then
-			return "\\\"";
-		end
-		if(char == "\'") then
-			return "\\\'";
-		end
-		return char;
-	end)
-end
-
-local function chararray(str)
-	local tb = {};
-	for i = 1, str:len(), 1 do
-		table.insert(tb, str:sub(i, i));
-	end
-	return tb;
-end
-
-local function keys(tb)
-	local keyset={}
-	local n=0
-	for k,v in pairs(tb) do
-		n=n+1
-		keyset[n]=k
-	end
-	return keyset
-end
-
-local utf8char;
-do
-	local string_char = string.char
-	function utf8char(cp)
-	  if cp < 128 then
-		return string_char(cp)
-	  end
-	  local suffix = cp % 64
-	  local c4 = 128 + suffix
-	  cp = (cp - suffix) / 64
-	  if cp < 32 then
-		return string_char(192 + cp, c4)
-	  end
-	  suffix = cp % 64
-	  local c3 = 128 + suffix
-	  cp = (cp - suffix) / 64
-	  if cp < 16 then
-		return string_char(224 + cp, c3, c4)
-	  end
-	  suffix = cp % 64
-	  cp = (cp - suffix) / 64
-	  return string_char(240 + cp, 128 + suffix, c3, c4)
-	end
-  end
-
-local function shuffle(tb)
-	for i = #tb, 2, -1 do
-		local j = math.random(i)
-		tb[i], tb[j] = tb[j], tb[i]
-	end
-	return tb
-end
-local function shuffle_string(str)
-    local len = #str
-    local t = {}
-    for i = 1, len do
-        t[i] = string.sub(str, i, i)
-    end
-    for i = 1, len do
-        local j = math.random(i, len)
-        t[i], t[j] = t[j], t[i]
-    end
-    return table.concat(t)
-end
-
-local function readDouble(bytes) 
-	local sign = 1
-	local mantissa = bytes[2] % 2^4
-	for i = 3, 8 do
-		mantissa = mantissa * 256 + bytes[i]
-	end
-	if bytes[1] > 127 then sign = -1 end
-	local exponent = (bytes[1] % 128) * 2^4 + math.floor(bytes[2] / 2^4)
-
-	if exponent == 0 then
-		return 0
-	end
-	mantissa = (math.ldexp(mantissa, -52) + 1) * sign
-	return math.ldexp(mantissa, exponent - 1023)
-end
-
-local function writeDouble(num)
-	local bytes = {0,0,0,0, 0,0,0,0}
-	if num == 0 then
-		return bytes
-	end
-	local anum = math.abs(num)
-
-	local mantissa, exponent = math.frexp(anum)
-	exponent = exponent - 1
-	mantissa = mantissa * 2 - 1
-	local sign = num ~= anum and 128 or 0
-	exponent = exponent + 1023
-
-	bytes[1] = sign + math.floor(exponent / 2^4)
-	mantissa = mantissa * 2^4
-	local currentmantissa = math.floor(mantissa)
-	mantissa = mantissa - currentmantissa
-	bytes[2] = (exponent % 2^4) * 2^4 + currentmantissa
-	for i= 3, 8 do
-		mantissa = mantissa * 2^8
-		currentmantissa = math.floor(mantissa)
-		mantissa = mantissa - currentmantissa
-		bytes[i] = currentmantissa
-	end
-	return bytes
-end
-
-local function writeU16(u16)
-	if (u16 < 0 or u16 > 65535) then
-		logger:error(string.format("u16 out of bounds: %d", u16));
-	end
-	local lower = bit32.band(u16, 255);
-	local upper = bit32.rshift(u16, 8);
-	return {lower, upper}
-end
-
-local function readU16(arr)
-	return bit32.bor(arr[1], bit32.lshift(arr[2], 8));
-end
-
-local function writeU24(u24)
-	if(u24 < 0 or u24 > 16777215) then
-		logger:error(string.format("u24 out of bounds: %d", u24));
-	end
-	
-	local arr = {};
-	for i = 0, 2 do
-		arr[i + 1] = bit32.band(bit32.rshift(u24, 8 * i), 255);
-	end
-	return arr;
-end
-
-local function readU24(arr)
-	local val = 0;
-
-	for i = 0, 2 do
-		val = bit32.bor(val, bit32.lshift(arr[i + 1], 8 * i));
-	end
-
-	return val;
-end
-
-local function writeU32(u32)
-	if(u32 < 0 or u32 > 4294967295) then
-		logger:error(string.format("u32 out of bounds: %d", u32));
-	end
-
-	local arr = {};
-	for i = 0, 3 do
-		arr[i + 1] = bit32.band(bit32.rshift(u32, 8 * i), 255);
-	end
-	return arr;
-end
-
-local function readU32(arr)
-	local val = 0;
-
-	for i = 0, 3 do
-		val = bit32.bor(val, bit32.lshift(arr[i + 1], 8 * i));
-	end
-
-	return val;
-end
-
-local function bytesToString(arr)
-	local lenght = arr.n or #arr;
-
-	if lenght < MAX_UNPACK_COUNT then
-		return string.char(table.unpack(arr))
-	end
-
-	local str = "";
-	local overflow = lenght % MAX_UNPACK_COUNT;
-
-	for i = 1, (#arr - overflow) / MAX_UNPACK_COUNT do
-		str = str .. string.char(table.unpack(arr, (i - 1) * MAX_UNPACK_COUNT + 1, i * MAX_UNPACK_COUNT));
-	end
-
-	return str..(overflow > 0 and string.char(table.unpack(arr, lenght - overflow + 1, lenght)) or "");
-end
-
-local function isNaN(n)
-	return type(n) == "number" and n ~= n;
-end
-
-local function isInt(n)
-	return math.floor(n) == n;
-end
-
-local function isU32(n)
-	return n >= 0 and n <= 4294967295 and isInt(n);
-end
-
-local function toBits(num)
-    -- returns a table of bits, least significant first.
-    local t={} -- will contain the bits
-	local rest;
-    while num>0 do
-        rest=math.fmod(num,2)
-        t[#t+1]=rest
-        num=(num-rest)/2
-    end
-    return t
-end
-
-
-local function readonly(obj)
-	local r = newproxy(true);
-	getmetatable(r).__index = obj;
-	return r;
-end
-
-return {
-	lookupify = lookupify,
-	unlookupify = unlookupify,
-	escape = escape,
-	chararray = chararray,
-	keys = keys,
-	shuffle = shuffle,
-	shuffle_string = shuffle_string,
-	readDouble = readDouble,
-	writeDouble = writeDouble,
-	readU16 = readU16,
-	writeU16 = writeU16,
-	readU32 = readU32,
-	writeU32 = writeU32,
-	readU24 = readU24,
-	writeU24 = writeU24,
-	isNaN = isNaN,
-	isU32 = isU32,
-	isInt = isInt,
-	utf8char = utf8char,
-	toBits = toBits,
-	bytesToString = bytesToString,
-	readonly = readonly,
-}

package/src/prometheus/src/prometheus/visitast.lua

@@ -1,245 +0,0 @@
--- This Script is Part of the Prometheus Obfuscator by Levno_710
---
--- util.lua
--- This file Provides a Utility function for visiting each node of an ast
-
-local Ast = require("prometheus.ast");
-local util = require("prometheus.util");
-
-local AstKind = Ast.AstKind;
-local lookupify = util.lookupify;
-
-local visitAst, visitBlock, visitStatement, visitExpression;
-
-function visitAst(ast, previsit, postvisit, data)
-	ast.isAst = true;
-	data = data or {};
-	data.scopeStack = {};
-	data.functionData = {
-		depth = 0;
-		scope = ast.body.scope;
-		node = ast;
-	};
-	data.scope = ast.globalScope;
-	data.globalScope = ast.globalScope;
-	if(type(previsit) == "function") then
-		local node, skip = previsit(ast, data);
-		ast = node or ast;
-		if skip then
-			return ast;
-		end
-	end
-	
-	-- Is Function Block because global scope is treated like a Function
-	visitBlock(ast.body, previsit, postvisit, data, true);
-	
-	if(type(postvisit) == "function") then
-		ast = postvisit(ast, data) or ast;
-	end
-	return ast;
-end
-
-local compundStats = lookupify{
-	AstKind.CompoundAddStatement,
-	AstKind.CompoundSubStatement,
-	AstKind.CompoundMulStatement,
-	AstKind.CompoundDivStatement,
-	AstKind.CompoundModStatement,
-	AstKind.CompoundPowStatement,
-	AstKind.CompoundConcatStatement,
-}
-
-function visitBlock(block, previsit, postvisit, data, isFunctionBlock)
-	block.isBlock = true;
-	block.isFunctionBlock = isFunctionBlock or false;
-	data.scope = block.scope;
-	local parentBlockData = data.blockData;
-	data.blockData = {};
-	table.insert(data.scopeStack, block.scope);
-	if(type(previsit) == "function") then
-		local node, skip = previsit(block, data);
-		block = node or block;
-		if skip then
-			data.scope = table.remove(data.scopeStack);
-			return block
-		end
-	end
-	
-	local i = 1;
-	while i <= #block.statements do
-		local statement = table.remove(block.statements, i);
-		i = i - 1;
-		local returnedStatements = {visitStatement(statement, previsit, postvisit, data)};
-		for j, statement in ipairs(returnedStatements) do
-			i = i + 1;
-			table.insert(block.statements, i, statement);
-		end
-		i = i + 1;
-	end
-
-	if(type(postvisit) == "function") then
-		block = postvisit(block, data) or block;
-	end
-	data.scope = table.remove(data.scopeStack);
-	data.blockData = parentBlockData;
-	return block;
-end
-
-function visitStatement(statement, previsit, postvisit, data)
-	statement.isStatement = true;
-	if(type(previsit) == "function") then
-		local node, skip = previsit(statement, data);
-		statement = node or statement;
-		if skip then
-			return statement;
-		end
-	end
-	
-	-- Visit Child Nodes of Statement
-	if(statement.kind == AstKind.ReturnStatement) then
-		for i, expression in ipairs(statement.args) do
-			statement.args[i] = visitExpression(expression, previsit, postvisit, data);
-		end
-	elseif(statement.kind == AstKind.PassSelfFunctionCallStatement or statement.kind == AstKind.FunctionCallStatement) then
-		statement.base = visitExpression(statement.base, previsit, postvisit, data);
-		for i, expression in ipairs(statement.args) do
-			statement.args[i] = visitExpression(expression, previsit, postvisit, data);
-		end
-	elseif(statement.kind == AstKind.AssignmentStatement) then
-		for i, primaryExpr in ipairs(statement.lhs) do
-			statement.lhs[i] = visitExpression(primaryExpr, previsit, postvisit, data);
-		end
-		for i, expression in ipairs(statement.rhs) do
-			statement.rhs[i] = visitExpression(expression, previsit, postvisit, data);
-		end
-	elseif(statement.kind == AstKind.FunctionDeclaration or statement.kind == AstKind.LocalFunctionDeclaration) then
-		local parentFunctionData = data.functionData;
-		data.functionData = {
-			depth = parentFunctionData.depth + 1;
-			scope = statement.body.scope;
-			node = statement;
-		};
-		statement.body = visitBlock(statement.body, previsit, postvisit, data, true);
-		data.functionData = parentFunctionData;
-	elseif(statement.kind == AstKind.DoStatement) then
-		statement.body = visitBlock(statement.body, previsit, postvisit, data, false);
-	elseif(statement.kind == AstKind.WhileStatement) then
-		statement.condition = visitExpression(statement.condition, previsit, postvisit, data);
-		statement.body = visitBlock(statement.body, previsit, postvisit, data, false);
-	elseif(statement.kind == AstKind.RepeatStatement) then
-		statement.body = visitBlock(statement.body, previsit, postvisit, data);
-		statement.condition = visitExpression(statement.condition, previsit, postvisit, data);
-	elseif(statement.kind == AstKind.ForStatement) then
-		statement.initialValue = visitExpression(statement.initialValue, previsit, postvisit, data);
-		statement.finalValue = visitExpression(statement.finalValue, previsit, postvisit, data);
-		statement.incrementBy = visitExpression(statement.incrementBy, previsit, postvisit, data);
-		statement.body = visitBlock(statement.body, previsit, postvisit, data, false);
-	elseif(statement.kind == AstKind.ForInStatement) then
-		for i, expression in ipairs(statement.expressions) do
-			statement.expressions[i] = visitExpression(expression, previsit, postvisit, data);
-		end
-		visitBlock(statement.body, previsit, postvisit, data, false);
-	elseif(statement.kind == AstKind.IfStatement) then
-		statement.condition = visitExpression(statement.condition, previsit, postvisit, data);
-		statement.body = visitBlock(statement.body, previsit, postvisit, data, false);
-		for i, eif in ipairs(statement.elseifs) do
-			eif.condition = visitExpression(eif.condition, previsit, postvisit, data);
-			eif.body = visitBlock(eif.body, previsit, postvisit, data, false);
-		end
-		if(statement.elsebody) then
-			statement.elsebody = visitBlock(statement.elsebody, previsit, postvisit, data, false);
-		end
-	elseif(statement.kind == AstKind.LocalVariableDeclaration) then
-		for i, expression in ipairs(statement.expressions) do
-			statement.expressions[i] = visitExpression(expression, previsit, postvisit, data);
-		end
-	elseif compundStats[statement.kind] then
-		statement.lhs = visitExpression(statement.lhs, previsit, postvisit, data);
-		statement.rhs = visitExpression(statement.rhs, previsit, postvisit, data);
-	end
-
-	if(type(postvisit) == "function") then
-		local statements = {postvisit(statement, data)};
-		if #statements > 0 then
-			return unpack(statements);
-		end
-	end
-	
-	return statement;
-end
-
-local binaryExpressions = lookupify{
-	AstKind.OrExpression,
-	AstKind.AndExpression,
-	AstKind.LessThanExpression,
-	AstKind.GreaterThanExpression,
-	AstKind.LessThanOrEqualsExpression,
-	AstKind.GreaterThanOrEqualsExpression,
-	AstKind.NotEqualsExpression,
-	AstKind.EqualsExpression,
-	AstKind.StrCatExpression,
-	AstKind.AddExpression,
-	AstKind.SubExpression,
-	AstKind.MulExpression,
-	AstKind.DivExpression,
-	AstKind.ModExpression,
-	AstKind.PowExpression,
-}
-function visitExpression(expression, previsit, postvisit, data)
-	expression.isExpression = true;
-	if(type(previsit) == "function") then
-		local node, skip = previsit(expression, data);
-		expression = node or expression;
-		if skip then
-			return expression;
-		end
-	end
-	
-	if(binaryExpressions[expression.kind]) then
-		expression.lhs = visitExpression(expression.lhs, previsit, postvisit, data);
-		expression.rhs = visitExpression(expression.rhs, previsit, postvisit, data);
-	end
-	
-	if(expression.kind == AstKind.NotExpression or expression.kind == AstKind.NegateExpression or expression.kind == AstKind.LenExpression) then
-		expression.rhs = visitExpression(expression.rhs, previsit, postvisit, data);
-	end
-	
-	if(expression.kind == AstKind.PassSelfFunctionCallExpression or expression.kind == AstKind.FunctionCallExpression) then
-		expression.base = visitExpression(expression.base, previsit, postvisit, data);
-		for i, arg in ipairs(expression.args) do
-			expression.args[i] = visitExpression(arg, previsit, postvisit, data);
-		end
-	end
-	
-	if(expression.kind == AstKind.FunctionLiteralExpression) then
-		local parentFunctionData = data.functionData;
-		data.functionData = {
-			depth = parentFunctionData.depth + 1;
-			scope = expression.body.scope;
-			node = expression;
-		};
-		expression.body = visitBlock(expression.body, previsit, postvisit, data, true);
-		data.functionData = parentFunctionData;
-	end
-	
-	if(expression.kind == AstKind.TableConstructorExpression) then
-		for i, entry in ipairs(expression.entries) do
-			if entry.kind == AstKind.KeyedTableEntry then
-				entry.key = visitExpression(entry.key, previsit, postvisit, data);
-			end
-			entry.value = visitExpression(entry.value, previsit, postvisit, data);
-		end
-	end
-	
-	if(expression.kind == AstKind.IndexExpression or expression.kind == AstKind.AssignmentIndexing) then
-		expression.base = visitExpression(expression.base, previsit, postvisit, data);
-		expression.index = visitExpression(expression.index, previsit, postvisit, data);
-	end
-
-	if(type(postvisit) == "function") then
-		expression = postvisit(expression, data) or expression;
-	end
-	return expression;
-end
-
-return visitAst;

package/src/prometheus/src/prometheus.lua

@@ -1,71 +0,0 @@
--- This Script is Part of the Prometheus Obfuscator by Levno_710
---
--- prometheus.lua
--- This file is the entrypoint for Prometheus
-
--- Configure package.path for require
-local function script_path()
-	local str = debug.getinfo(2, "S").source:sub(2)
-	return str:match("(.*[/%\\])")
-end
-
-local oldPkgPath = package.path;
-package.path = script_path() .. "?.lua;" .. package.path;
-
--- Math.random Fix for Lua5.1
--- Check if fix is needed
-if not pcall(function()
-    return math.random(1, 2^40);
-end) then
-    local oldMathRandom = math.random;
-    math.random = function(a, b)
-        if not a and b then
-            return oldMathRandom();
-        end
-        if not b then
-            return math.random(1, a);
-        end
-        if a > b then
-            a, b = b, a;
-        end
-        local diff = b - a;
-        assert(diff >= 0);
-        if diff > 2 ^ 31 - 1 then
-            return math.floor(oldMathRandom() * diff + a);
-        else
-            return oldMathRandom(a, b);
-        end
-    end
-end
-
--- newproxy polyfill
-_G.newproxy = _G.newproxy or function(arg)
-    if arg then
-        return setmetatable({}, {});
-    end
-    return {};
-end
-
-
--- Require Prometheus Submodules
-local Pipeline  = require("prometheus.pipeline");
-local highlight = require("highlightlua");
-local colors    = require("colors");
-local Logger    = require("logger");
-local Presets   = require("presets");
-local Config    = require("config");
-local util      = require("prometheus.util");
-
--- Restore package.path
-package.path = oldPkgPath;
-
--- Export
-return {
-    Pipeline  = Pipeline;
-    colors    = colors;
-    Config    = util.readonly(Config); -- Readonly
-    Logger    = Logger;
-    highlight = highlight;
-    Presets   = Presets;
-}
-

package/src/prometheus/tests/closures.lua

@@ -1,12 +0,0 @@
-local arr = {}
-for i = 1, 100 do
-	local x;
-	x = (x or 1) + i;
-	arr[i] = function()
-		return x;
-	end
-end
-
-for i, func in ipairs(arr) do
-	print(func())
-end

package/src/prometheus/tests/fibonacci.lua

@@ -1,10 +0,0 @@
--- Print the fibonacci sequence
-local function fibonacci(max)
-    local a, b = 0, 1
-    while a < max do
-        print(a)
-        a, b = b, a + b
-    end
-end
-
-fibonacci(1000)

package/src/prometheus/tests/loops.lua

@@ -1,8 +0,0 @@
-local x = {};
-for i = 1, 100 do
-    x[i] = i;
-end
-
-for i, v in ipairs(x) do
-    print("x[" .. i .. "] = " .. v);
-end

package/src/prometheus/tests/primes.lua

@@ -1,18 +0,0 @@
--- print first n primes
-local function primes(n)
-    local function isPrime(n)
-        for i = 2, math.sqrt(n) do
-            if n % i == 0 then
-                return false
-            end
-        end
-        return true
-    end
-    for i = 2, n do
-        if isPrime(i) then
-            print(i)
-        end
-    end
-end
-
-primes(20)