getChildren() {\n return children;\n }\n\n // ------------\n // Access stuff\n // ------------\n\n public void addAccessFlags(int flags) {\n classNode.access |= flags;\n }\n\n public void removeAccessFlags(int flags) {\n classNode.access &= ~flags;\n }\n\n public boolean isPublic() {\n return (classNode.access & ACC_PUBLIC) != 0;\n }\n\n public boolean isPrivate() {\n return (classNode.access & ACC_PRIVATE) != 0;\n }\n\n public boolean isProtected() {\n return (classNode.access & ACC_PROTECTED) != 0;\n }\n\n public boolean isFinal() {\n return (classNode.access & ACC_FINAL) != 0;\n }\n\n public boolean isSuper() {\n return (classNode.access & ACC_SUPER) != 0;\n }\n\n public boolean isInterface() {\n return (classNode.access & ACC_INTERFACE) != 0;\n }\n\n public boolean isAbstract() {\n return (classNode.access & ACC_ABSTRACT) != 0;\n }\n\n public boolean isSynthetic() {\n return (classNode.access & ACC_SYNTHETIC) != 0;\n }\n\n public boolean isAnnotation() {\n return (classNode.access & ACC_ANNOTATION) != 0;\n }\n\n public boolean isEnum() {\n return (classNode.access & ACC_ENUM) != 0;\n }\n\n public boolean isModule() {\n return (classNode.access & ACC_MODULE) != 0;\n }\n\n public boolean isRecord() {\n return (classNode.access & ACC_RECORD) != 0;\n }\n\n public boolean isDeprecated() {\n return (classNode.access & ACC_DEPRECATED) != 0;\n }\n\n // -----\n // Misc.\n // -----\n\n /**\n * Adds a {@link MethodNode} to this {@link ClassWrapper}.\n *\n * @param methodNode {@link MethodNode} to add.\n */\n public void addMethod(MethodNode methodNode) {\n classNode.methods.add(methodNode);\n methods.add(MethodWrapper.from(methodNode, this));\n }\n\n /**\n * Adds a {@link FieldNode} to this {@link ClassWrapper}.\n *\n * @param fieldNode {@link FieldNode} to add.\n */\n public void addField(FieldNode fieldNode) {\n classNode.fields.add(fieldNode);\n fields.add(FieldWrapper.from(fieldNode, this));\n }\n\n public MethodNode getMethodNode(String name, String desc) {\n return classNode.methods.stream().filter(methodNode -> name.equals(methodNode.name) && desc.equals(methodNode.desc)).findAny().orElse(null);\n }\n\n public FieldNode getFieldNode(String name, String desc) {\n return classNode.fields.stream().filter(fieldNode -> name.equals(fieldNode.name) && desc.equals(fieldNode.desc)).findAny().orElse(null);\n }\n\n public boolean containsMethodNode(String name, String desc) {\n return classNode.methods.stream().anyMatch(methodNode -> name.equals(methodNode.name) && desc.equals(methodNode.desc));\n }\n\n public boolean containsFieldNode(String name, String desc) {\n return classNode.fields.stream().anyMatch(fieldNode -> name.equals(fieldNode.name) && desc.equals(fieldNode.desc));\n }\n\n public String generateNextAllowedMethodName(Dictionary dictionary, String desc) {\n String name = dictionary.next();\n while (containsMethodNode(name, desc)) {\n name = dictionary.next();\n }\n return name;\n }\n\n public String generateNextAllowedFieldName(Dictionary dictionary, String desc) {\n String name = dictionary.next();\n while (containsFieldNode(name, desc)) {\n name = dictionary.next();\n }\n return name;\n }\n\n /**\n * Returns true if the class allows dynamic constants (Java 11 and above).\n */\n public boolean allowsConstDy() {\n return (classNode.version >= V11) && (classNode.version != V1_1);\n }\n\n /**\n * Returns true if this class allows invokedynamic instructions (Java 7 and above).\n */\n public boolean allowsIndy() {\n return (classNode.version >= V1_7) && (classNode.version != V1_1);\n }\n\n /**\n * Returns true if this class allows JSR and RET instructions (Java 5 and below).\n */\n public boolean allowsJsr() {\n return (classNode.version <= V1_5) || (classNode.version == V1_1);\n }\n\n public boolean hasVisibleAnnotations() {\n return classNode.visibleAnnotations != null && classNode.visibleAnnotations.size() > 0;\n }\n\n /**\n * Returns the count of the constant pool of the classfile this {@link ClassWrapper} represents.\n * \n * This is done by writing the class bytes via {@link ClassWriter} with flags set to 0. The constant pool count is\n * then manually constructed by directly accessing the relevant offsets. This is computationally expensive and should\n * be done sparingly\n */\n public int computePoolCount() {\n // Hopefully setting flags to 0 doesn't affect CP count\n // If it does then pepega\n var writer = new ClassWriter(0);\n utf8Consts.forEach(writer::newUTF8);\n classNode.accept(writer);\n\n // Grab byte array\n var bytes = writer.toByteArray();\n\n // Construct unsigned short\n // todo: check to make sure this isn't broken\n return ((bytes[CP_COUNT_OFFSET] & 0xFF) << 8) | (bytes[CP_COUNT_OFFSET + 1] & 0xFF);\n }\n\n public void addUtf8Const(String s) {\n utf8Consts.add(s);\n }\n\n /**\n * Converts the class this {@link ClassWrapper} represents into a byte array.\n */\n public byte[] toByteArray() {\n var attemptMaxs = Radon.getInstance().config.attemptComputeMaxs;\n ClassWriter classWriter = new RadonClassWriter(ClassWriter.COMPUTE_FRAMES);\n\n try {\n // Write all non-essential (manually made) entries first\n utf8Consts.forEach(classWriter::newUTF8);\n\n // Do the rest\n classNode.accept(classWriter);\n return classWriter.toByteArray();\n } catch (Throwable t) {\n if (attemptMaxs) {\n RadonLogger.warn(String.format(\"Error writing class %s. Skipping frames (might cause runtime errors).\", classNode.name + \".class\"));\n t.printStackTrace(System.out);\n\n classWriter = new ClassWriter(ClassWriter.COMPUTE_MAXS);\n\n // Write all non-essential (manually inserted) utf8 entries first\n utf8Consts.forEach(classWriter::newUTF8);\n\n // Do the rest\n classNode.accept(classWriter);\n return classWriter.toByteArray();\n } else {\n throw t;\n }\n }\n }\n\n public static ClassWrapper from(ClassReader reader) {\n return new ClassWrapper(reader, false);\n }\n\n public static ClassWrapper fromLib(ClassReader reader) {\n return new ClassWrapper(reader, true);\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/FieldWrapper.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport org.objectweb.asm.Opcodes;\nimport org.objectweb.asm.tree.FieldNode;\n\n/**\n * Wrapper around {@link FieldNode}.\n *\n * @author itzsomebody\n */\npublic class FieldWrapper implements Opcodes {\n private FieldNode fieldNode;\n private final String originalName;\n private final String originalType;\n private final ClassWrapper owner;\n\n public FieldWrapper(FieldNode fieldNode, ClassWrapper owner) {\n this.fieldNode = fieldNode;\n this.originalName = fieldNode.name;\n this.originalType = fieldNode.desc;\n this.owner = owner;\n }\n\n // -----------------\n // Getters / Setters\n // -----------------\n\n public FieldNode getFieldNode() {\n return fieldNode;\n }\n\n public void setFieldNode(FieldNode fieldNode) {\n this.fieldNode = fieldNode;\n }\n\n public String getOriginalName() {\n return originalName;\n }\n\n public String getOriginalType() {\n return originalType;\n }\n\n public ClassWrapper getOwner() {\n return owner;\n }\n\n // ------------\n // Access stuff\n // ------------\n\n public void addAccessFlags(int flags) {\n fieldNode.access |= flags;\n }\n\n public void removeAccessFlags(int flags) {\n fieldNode.access &= ~flags;\n }\n\n public boolean isPublic() {\n return (ACC_PUBLIC & fieldNode.access) != 0;\n }\n\n public boolean isPrivate() {\n return (ACC_PRIVATE & fieldNode.access) != 0;\n }\n\n public boolean isProtected() {\n return (ACC_PROTECTED & fieldNode.access) != 0;\n }\n\n public boolean isStatic() {\n return (ACC_STATIC & fieldNode.access) != 0;\n }\n\n public boolean isFinal() {\n return (ACC_FINAL & fieldNode.access) != 0;\n }\n\n public boolean isVolatile() {\n return (ACC_PUBLIC & fieldNode.access) != 0;\n }\n\n public boolean isTransient() {\n return (ACC_PUBLIC & fieldNode.access) != 0;\n }\n\n public boolean isSynthetic() {\n return (ACC_SYNTHETIC & fieldNode.access) != 0;\n }\n\n public boolean isDeprecated() {\n return (ACC_DEPRECATED & fieldNode.access) != 0;\n }\n\n // -----\n // Misc.\n // -----\n\n public static FieldWrapper from(FieldNode FieldNode, ClassWrapper owner) {\n return new FieldWrapper(FieldNode, owner);\n }\n\n public boolean hasVisibleAnnotations() {\n return fieldNode.visibleAnnotations != null && fieldNode.visibleAnnotations.size() > 0;\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/FieldWrappers.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class FieldWrappers {\n public static List from(ClassWrapper classWrapper) {\n var classNode = classWrapper.getClassNode();\n var fieldWrappers = new ArrayList();\n classNode.fields.forEach(fieldNode -> fieldWrappers.add(FieldWrapper.from(fieldNode, classWrapper)));\n\n return fieldWrappers;\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/MethodWrapper.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport org.objectweb.asm.Opcodes;\nimport org.objectweb.asm.commons.CodeSizeEvaluator;\nimport org.objectweb.asm.tree.MethodNode;\n\n/**\n * Wrapper around {@link MethodNode}.\n *\n * @author itzsomebody\n */\npublic class MethodWrapper implements Opcodes {\n /*\n * From https://docs.oracle.com/javase/specs/jvms/se11/html/jvms-4.html#jvms-4.7.3\n *\n * Note that even though the specification lists an unsigned 32-bit integer size for code_length, the verifier gets\n * mad if any method has a code_length > 0xFFFF\n */\n private static final int MAX_CODE_SIZE = 0xFFFF;\n\n private MethodNode methodNode;\n private final String originalName;\n private final String originalDescriptor;\n private final ClassWrapper owner;\n\n public MethodWrapper(MethodNode methodNode, ClassWrapper owner) {\n this.methodNode = methodNode;\n this.originalName = methodNode.name;\n this.originalDescriptor = methodNode.desc;\n this.owner = owner;\n }\n\n // -----------------\n // Getters / Setters\n // -----------------\n\n public MethodNode getMethodNode() {\n return methodNode;\n }\n\n public void setMethodNode(MethodNode methodNode) {\n this.methodNode = methodNode;\n }\n\n public String getOriginalName() {\n return originalName;\n }\n\n public String getOriginalDescriptor() {\n return originalDescriptor;\n }\n\n public ClassWrapper getOwner() {\n return owner;\n }\n\n // ------------\n // Access stuff\n // ------------\n\n public void addAccessFlags(int flags) {\n methodNode.access |= flags;\n }\n\n public void removeAccessFlags(int flags) {\n methodNode.access &= ~flags;\n }\n\n public boolean isPublic() {\n return (ACC_PUBLIC & methodNode.access) != 0;\n }\n\n public boolean isPrivate() {\n return (ACC_PRIVATE & methodNode.access) != 0;\n }\n\n public boolean isProtected() {\n return (ACC_PROTECTED & methodNode.access) != 0;\n }\n\n public boolean isStatic() {\n return (ACC_STATIC & methodNode.access) != 0;\n }\n\n public boolean isFinal() {\n return (ACC_FINAL & methodNode.access) != 0;\n }\n\n public boolean isSynchronized() {\n return (ACC_SYNCHRONIZED & methodNode.access) != 0;\n }\n\n public boolean isBridge() {\n return (ACC_BRIDGE & methodNode.access) != 0;\n }\n\n public boolean isVarargs() {\n return (ACC_VARARGS & methodNode.access) != 0;\n }\n\n public boolean isNative() {\n return (ACC_NATIVE & methodNode.access) != 0;\n }\n\n public boolean isAbstract() {\n return (ACC_ABSTRACT & methodNode.access) != 0;\n }\n\n public boolean isStrict() {\n return (ACC_STRICT & methodNode.access) != 0;\n }\n\n public boolean isSynthetic() {\n return (ACC_SYNTHETIC & methodNode.access) != 0;\n }\n\n public boolean isMandated() {\n return (ACC_MANDATED & methodNode.access) != 0;\n }\n\n public boolean isDeprecated() {\n return (ACC_DEPRECATED & methodNode.access) != 0;\n }\n\n // -----\n // Misc.\n // -----\n\n public boolean hasInstructions() {\n return methodNode.instructions.size() > 0;\n }\n\n public boolean hasVisibleAnnotations() {\n return methodNode.visibleAnnotations != null && methodNode.visibleAnnotations.size() > 0;\n }\n\n public int getCodeSize() {\n CodeSizeEvaluator evaluator = new CodeSizeEvaluator(null);\n methodNode.accept(evaluator);\n return evaluator.getMaxSize();\n }\n\n public int getLeewaySize() {\n return MAX_CODE_SIZE - getCodeSize();\n }\n\n public int allocateLocalVar(boolean twoWords) {\n methodNode.maxLocals += (twoWords ? 2 : 1);\n return methodNode.maxLocals - 1;\n }\n\n public static MethodWrapper from(MethodNode methodNode, ClassWrapper owner) {\n return new MethodWrapper(methodNode, owner);\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/MethodWrappers.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class MethodWrappers {\n public static List from(ClassWrapper classWrapper) {\n var classNode = classWrapper.getClassNode();\n var methodWrappers = new ArrayList();\n classNode.methods.forEach(methodNode -> methodWrappers.add(MethodWrapper.from(methodNode, classWrapper)));\n\n return methodWrappers;\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/RadonClassWriter.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport org.objectweb.asm.ClassWriter;\nimport xyz.itzsomebody.radon.Radon;\n\nimport java.util.ArrayDeque;\nimport java.util.HashSet;\n\n/**\n * Custom-implemented version of {@link ClassWriter} which doesn't use the internal JVM classpath when computing\n * stackmap frames.\n *\n * TODO: Perhaps consider creating fully-worked out hierarchies for JVM runtime classes so we don't have to keep checking huge jars\n * TODO: Implement shadow classes\n *\n * @author itzsomebody\n */\npublic class RadonClassWriter extends ClassWriter {\n private static final Radon radon = Radon.getInstance();\n\n public RadonClassWriter(int flags) {\n super(flags);\n }\n\n @Override\n protected String getCommonSuperClass(final String type1, final String type2) {\n if (\"java/lang/Object\".equals(type1) || \"java/lang/Object\".equals(type2))\n return \"java/lang/Object\";\n\n String first = deriveCommonSuperName(type1, type2);\n String second = deriveCommonSuperName(type2, type1);\n if (!\"java/lang/Object\".equals(first)) {\n return first;\n }\n if (!\"java/lang/Object\".equals(second)) {\n return second;\n }\n\n return getCommonSuperClass(radon.getClasspathWrapper(type1).getSuperName(), radon.getClasspathWrapper(type2).getSuperName());\n }\n\n private String deriveCommonSuperName(final String type1, final String type2) {\n ClassWrapper first = radon.getClasspathWrapper(type1);\n ClassWrapper second = radon.getClasspathWrapper(type2);\n if (isAssignableFrom(type1, type2)) {\n return type1;\n } else if (isAssignableFrom(type2, type1)) {\n return type2;\n } else if (first.isInterface() || second.isInterface()) {\n return \"java/lang/Object\";\n } else {\n String temp;\n\n do {\n temp = first.getSuperName();\n first = radon.getClasspathWrapper(temp);\n } while (!isAssignableFrom(temp, type2));\n return temp;\n }\n }\n\n private boolean isAssignableFrom(String type1, String type2) {\n if (\"java/lang/Object\".equals(type1)) {\n return true;\n }\n if (type1.equals(type2)) {\n return true;\n }\n\n ClassWrapper first = radon.getClasspathWrapper(type1);\n radon.getClasspathWrapper(type2); // Ensure type2 was loaded at some point\n\n var allChildren = new HashSet();\n var toProcess = new ArrayDeque();\n first.getChildren().forEach(child -> {\n toProcess.add(child.getName());\n });\n\n while (!toProcess.isEmpty()) {\n String next = toProcess.poll();\n\n if (allChildren.add(next)) {\n ClassWrapper temp = radon.getClasspathWrapper(next);\n temp.getChildren().forEach(child -> {\n toProcess.add(child.getName());\n });\n }\n }\n return allChildren.contains(type2);\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/RadonRemapper.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2021 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport org.objectweb.asm.commons.SimpleRemapper;\n\nimport java.util.Map;\n\npublic class RadonRemapper extends SimpleRemapper {\n public RadonRemapper(Map mappings) {\n super(mappings);\n }\n\n @Override\n public String mapFieldName(String owner, String name, String descriptor) {\n String remappedName = map(owner + '.' + name + ' ' + descriptor);\n return (remappedName != null) ? remappedName : name;\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/asm/ResourceNameRemapper.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2021 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.asm;\n\nimport org.objectweb.asm.ClassVisitor;\nimport org.objectweb.asm.MethodVisitor;\nimport org.objectweb.asm.Opcodes;\n\nimport java.util.Map;\n\n// Stupid way remapping resource names, but works for the most part\n// If you want to do an *actual* job of this, you should use the SourceInterpreter to update strings arguments\n// to methods that grab resources by their name\npublic class ResourceNameRemapper extends ClassVisitor {\n private final Map mappings;\n private final String internalName;\n\n public ResourceNameRemapper(ClassVisitor visitor, Map mappings, String internalName) {\n this(/* latest api */ Opcodes.ASM9, visitor, mappings, internalName);\n }\n\n protected ResourceNameRemapper(int api, ClassVisitor visitor, Map mappings, String internalName) {\n super(api, visitor);\n this.mappings = mappings;\n this.internalName = internalName;\n }\n\n @Override\n public MethodVisitor visitMethod(int access, String name, String descriptor, String signature, String[] exceptions) {\n return new ResourceNameMethodRemapper(super.visitMethod(\n access,\n name,\n descriptor,\n signature,\n exceptions\n ));\n }\n\n class ResourceNameMethodRemapper extends MethodVisitor {\n ResourceNameMethodRemapper(MethodVisitor visitor) {\n this(/* latest api */ Opcodes.ASM9, visitor);\n }\n\n ResourceNameMethodRemapper(int api, MethodVisitor visitor) {\n super(api, visitor);\n }\n\n @Override\n public void visitLdcInsn(Object value) {\n if (value instanceof String) {\n String strValue = (String) value;\n String fullResourcePath;\n\n if (strValue.startsWith(\"/\")) { // JAR root case\n fullResourcePath = strValue.substring(1);\n } else { // relative path case\n int index = internalName.lastIndexOf('/');\n if (index == -1) {\n fullResourcePath = \"\"; // Already at root\n } else {\n fullResourcePath = internalName.substring(0, index + 1) + strValue;\n }\n }\n\n if (mappings.containsKey(fullResourcePath)) {\n super.visitLdcInsn(mappings.get(fullResourcePath));\n } else {\n super.visitLdcInsn(value);\n }\n return;\n }\n super.visitLdcInsn(value);\n }\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/logging/RadonConsoleHandler.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.logging;\n\nimport xyz.itzsomebody.radon.RadonConstants;\n\nimport java.text.SimpleDateFormat;\nimport java.util.Date;\nimport java.util.logging.Formatter;\nimport java.util.logging.LogRecord;\nimport java.util.logging.StreamHandler;\n\n/**\n * A {@link StreamHandler} which outputs to stdout ({@link System#out}).\n *\n * @author itzsomebody\n */\npublic class RadonConsoleHandler extends StreamHandler {\n /**\n * Constructs a {@link StreamHandler} which outputs to stdout ({@link System#out}).\n * \n * The {@link String} pushed into stdout is composed of a timestamp, level, and message.\n */\n public RadonConsoleHandler() {\n super(System.out, new Formatter() {\n @Override\n public String format(final LogRecord record) {\n var formatStr = \"[%s] %s: %s\\n\";\n var dateStr = new SimpleDateFormat(RadonConstants.LOG_TIMESTAMP_FORMAT).format(new Date(record.getMillis()));\n var levelName = record.getLevel().getName();\n var formattedMsg = formatMessage(record);\n\n return String.format(formatStr, dateStr, levelName, formattedMsg);\n }\n });\n }\n}"
},
{
"path": "xyz.itzsomebody.radon/src/main/java/xyz/itzsomebody/radon/utils/logging/RadonLogger.java",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2020 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\npackage xyz.itzsomebody.radon.utils.logging;\n\nimport xyz.itzsomebody.radon.RadonConstants;\nimport xyz.itzsomebody.radon.RadonMain;\n\nimport java.util.logging.Logger;\n\n/**\n * Wrapper around {@link Logger} to push messages into stdout ({@link System#out}). Parent handler inheritance is\n * switched off.\n *\n * @author itzsomebody\n */\npublic class RadonLogger {\n /**\n * Static instance of {@link Logger#getAnonymousLogger()}.\n */\n private static final Logger LOGGER;\n\n static {\n if (RadonConstants.VERBOSE) {\n System.out.println(\"[RadonLogger] Bootstrapping logger\");\n }\n\n LOGGER = Logger.getLogger(\"RadonLogger\");\n if (RadonConstants.VERBOSE) {\n System.out.println(\"[RadonLogger] Created logger instance\");\n }\n\n LOGGER.setUseParentHandlers(false); // Avoid parent handler inheritance\n if (RadonConstants.VERBOSE) {\n System.out.println(\"[RadonLogger] Disabled parent handler inheritance\");\n }\n\n LOGGER.addHandler(new RadonConsoleHandler());\n if (RadonConstants.VERBOSE) {\n System.out.println(\"[RadonLogger] Registered console handler\");\n }\n }\n\n /**\n * Pushes provided message into stdout ({@link System#out}) via {@link Logger#info(String)}.\n *\n * @param msg Message to output into stdout ({@link System#out}).\n */\n public static void info(final String msg) {\n LOGGER.info(msg);\n }\n\n /**\n * Pushes provided message into stdout ({@link System#out}) via {@link Logger#warning(String)}.\n *\n * @param msg Message to output into stdout ({@link System#out}).\n */\n public static void warn(final String msg) {\n LOGGER.warning(msg);\n }\n\n /**\n * Pushes provided message into stdout ({@link System#out}) via {@link Logger#severe(String)}.\n *\n * @param msg Message to output into stdout ({@link System#out}).\n */\n public static void severe(final String msg) {\n LOGGER.severe(msg);\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/resources/asm-license.txt",
"content": " ASM: a very small and fast Java bytecode manipulation framework\n Copyright (c) 2000-2011 INRIA, France Telecom\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions\n are met:\n 1. Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n 2. Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and/or other materials provided with the distribution.\n 3. Neither the name of the copyright holders nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n THE POSSIBILITY OF SUCH DAMAGE.\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/resources/jackson-license.txt",
"content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n"
},
{
"path": "xyz.itzsomebody.radon/src/main/resources/radon-license.txt",
"content": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. \n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The GNU General Public License is a free, copyleft license for\nsoftware and other kinds of works.\n\n The licenses for most software and other practical works are designed\nto take away your freedom to share and change the works. By contrast,\nthe GNU General Public License is intended to guarantee your freedom to\nshare and change all versions of a program--to make sure it remains free\nsoftware for all its users. We, the Free Software Foundation, use the\nGNU General Public License for most of our software; it applies also to\nany other work released this way by its authors. You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthem if you wish), that you receive source code or can get it if you\nwant it, that you can change the software or use pieces of it in new\nfree programs, and that you know you can do these things.\n\n To protect your rights, we need to prevent others from denying you\nthese rights or asking you to surrender the rights. Therefore, you have\ncertain responsibilities if you distribute copies of the software, or if\nyou modify it: responsibilities to respect the freedom of others.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must pass on to the recipients the same\nfreedoms that you received. You must make sure that they, too, receive\nor can get the source code. And you must show them these terms so they\nknow their rights.\n\n Developers that use the GNU GPL protect your rights with two steps:\n(1) assert copyright on the software, and (2) offer you this License\ngiving you legal permission to copy, distribute and/or modify it.\n\n For the developers' and authors' protection, the GPL clearly explains\nthat there is no warranty for this free software. For both users' and\nauthors' sake, the GPL requires that modified versions be marked as\nchanged, so that their problems will not be attributed erroneously to\nauthors of previous versions.\n\n Some devices are designed to deny users access to install or run\nmodified versions of the software inside them, although the manufacturer\ncan do so. This is fundamentally incompatible with the aim of\nprotecting users' freedom to change the software. The systematic\npattern of such abuse occurs in the area of products for individuals to\nuse, which is precisely where it is most unacceptable. Therefore, we\nhave designed this version of the GPL to prohibit the practice for those\nproducts. If such problems arise substantially in other domains, we\nstand ready to extend this provision to those domains in future versions\nof the GPL, as needed to protect the freedom of users.\n\n Finally, every program is threatened constantly by software patents.\nStates should not allow patents to restrict development and use of\nsoftware on general-purpose computers, but in those that do, we wish to\navoid the special danger that patents applied to a free program could\nmake it effectively proprietary. To prevent this, the GPL assures that\npatents cannot be used to render the program non-free.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n TERMS AND CONDITIONS\n\n 0. Definitions.\n\n \"This License\" refers to version 3 of the GNU General Public License.\n\n \"Copyright\" also means copyright-like laws that apply to other kinds of\nworks, such as semiconductor masks.\n\n \"The Program\" refers to any copyrightable work licensed under this\nLicense. Each licensee is addressed as \"you\". \"Licensees\" and\n\"recipients\" may be individuals or organizations.\n\n To \"modify\" a work means to copy from or adapt all or part of the work\nin a fashion requiring copyright permission, other than the making of an\nexact copy. The resulting work is called a \"modified version\" of the\nearlier work or a work \"based on\" the earlier work.\n\n A \"covered work\" means either the unmodified Program or a work based\non the Program.\n\n To \"propagate\" a work means to do anything with it that, without\npermission, would make you directly or secondarily liable for\ninfringement under applicable copyright law, except executing it on a\ncomputer or modifying a private copy. Propagation includes copying,\ndistribution (with or without modification), making available to the\npublic, and in some countries other activities as well.\n\n To \"convey\" a work means any kind of propagation that enables other\nparties to make or receive copies. Mere interaction with a user through\na computer network, with no transfer of a copy, is not conveying.\n\n An interactive user interface displays \"Appropriate Legal Notices\"\nto the extent that it includes a convenient and prominently visible\nfeature that (1) displays an appropriate copyright notice, and (2)\ntells the user that there is no warranty for the work (except to the\nextent that warranties are provided), that licensees may convey the\nwork under this License, and how to view a copy of this License. If\nthe interface presents a list of user commands or options, such as a\nmenu, a prominent item in the list meets this criterion.\n\n 1. Source Code.\n\n The \"source code\" for a work means the preferred form of the work\nfor making modifications to it. \"Object code\" means any non-source\nform of a work.\n\n A \"Standard Interface\" means an interface that either is an official\nstandard defined by a recognized standards body, or, in the case of\ninterfaces specified for a particular programming language, one that\nis widely used among developers working in that language.\n\n The \"System Libraries\" of an executable work include anything, other\nthan the work as a whole, that (a) is included in the normal form of\npackaging a Major Component, but which is not part of that Major\nComponent, and (b) serves only to enable use of the work with that\nMajor Component, or to implement a Standard Interface for which an\nimplementation is available to the public in source code form. A\n\"Major Component\", in this context, means a major essential component\n(kernel, window system, and so on) of the specific operating system\n(if any) on which the executable work runs, or a compiler used to\nproduce the work, or an object code interpreter used to run it.\n\n The \"Corresponding Source\" for a work in object code form means all\nthe source code needed to generate, install, and (for an executable\nwork) run the object code and to modify the work, including scripts to\ncontrol those activities. However, it does not include the work's\nSystem Libraries, or general-purpose tools or generally available free\nprograms which are used unmodified in performing those activities but\nwhich are not part of the work. For example, Corresponding Source\nincludes interface definition files associated with source files for\nthe work, and the source code for shared libraries and dynamically\nlinked subprograms that the work is specifically designed to require,\nsuch as by intimate data communication or control flow between those\nsubprograms and other parts of the work.\n\n The Corresponding Source need not include anything that users\ncan regenerate automatically from other parts of the Corresponding\nSource.\n\n The Corresponding Source for a work in source code form is that\nsame work.\n\n 2. Basic Permissions.\n\n All rights granted under this License are granted for the term of\ncopyright on the Program, and are irrevocable provided the stated\nconditions are met. This License explicitly affirms your unlimited\npermission to run the unmodified Program. The output from running a\ncovered work is covered by this License only if the output, given its\ncontent, constitutes a covered work. This License acknowledges your\nrights of fair use or other equivalent, as provided by copyright law.\n\n You may make, run and propagate covered works that you do not\nconvey, without conditions so long as your license otherwise remains\nin force. You may convey covered works to others for the sole purpose\nof having them make modifications exclusively for you, or provide you\nwith facilities for running those works, provided that you comply with\nthe terms of this License in conveying all material for which you do\nnot control copyright. Those thus making or running the covered works\nfor you must do so exclusively on your behalf, under your direction\nand control, on terms that prohibit them from making any copies of\nyour copyrighted material outside their relationship with you.\n\n Conveying under any other circumstances is permitted solely under\nthe conditions stated below. Sublicensing is not allowed; section 10\nmakes it unnecessary.\n\n 3. Protecting Users' Legal Rights From Anti-Circumvention Law.\n\n No covered work shall be deemed part of an effective technological\nmeasure under any applicable law fulfilling obligations under article\n11 of the WIPO copyright treaty adopted on 20 December 1996, or\nsimilar laws prohibiting or restricting circumvention of such\nmeasures.\n\n When you convey a covered work, you waive any legal power to forbid\ncircumvention of technological measures to the extent such circumvention\nis effected by exercising rights under this License with respect to\nthe covered work, and you disclaim any intention to limit operation or\nmodification of the work as a means of enforcing, against the work's\nusers, your or third parties' legal rights to forbid circumvention of\ntechnological measures.\n\n 4. Conveying Verbatim Copies.\n\n You may convey verbatim copies of the Program's source code as you\nreceive it, in any medium, provided that you conspicuously and\nappropriately publish on each copy an appropriate copyright notice;\nkeep intact all notices stating that this License and any\nnon-permissive terms added in accord with section 7 apply to the code;\nkeep intact all notices of the absence of any warranty; and give all\nrecipients a copy of this License along with the Program.\n\n You may charge any price or no price for each copy that you convey,\nand you may offer support or warranty protection for a fee.\n\n 5. Conveying Modified Source Versions.\n\n You may convey a work based on the Program, or the modifications to\nproduce it from the Program, in the form of source code under the\nterms of section 4, provided that you also meet all of these conditions:\n\n a) The work must carry prominent notices stating that you modified\n it, and giving a relevant date.\n\n b) The work must carry prominent notices stating that it is\n released under this License and any conditions added under section\n 7. This requirement modifies the requirement in section 4 to\n \"keep intact all notices\".\n\n c) You must license the entire work, as a whole, under this\n License to anyone who comes into possession of a copy. This\n License will therefore apply, along with any applicable section 7\n additional terms, to the whole of the work, and all its parts,\n regardless of how they are packaged. This License gives no\n permission to license the work in any other way, but it does not\n invalidate such permission if you have separately received it.\n\n d) If the work has interactive user interfaces, each must display\n Appropriate Legal Notices; however, if the Program has interactive\n interfaces that do not display Appropriate Legal Notices, your\n work need not make them do so.\n\n A compilation of a covered work with other separate and independent\nworks, which are not by their nature extensions of the covered work,\nand which are not combined with it such as to form a larger program,\nin or on a volume of a storage or distribution medium, is called an\n\"aggregate\" if the compilation and its resulting copyright are not\nused to limit the access or legal rights of the compilation's users\nbeyond what the individual works permit. Inclusion of a covered work\nin an aggregate does not cause this License to apply to the other\nparts of the aggregate.\n\n 6. Conveying Non-Source Forms.\n\n You may convey a covered work in object code form under the terms\nof sections 4 and 5, provided that you also convey the\nmachine-readable Corresponding Source under the terms of this License,\nin one of these ways:\n\n a) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by the\n Corresponding Source fixed on a durable physical medium\n customarily used for software interchange.\n\n b) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by a\n written offer, valid for at least three years and valid for as\n long as you offer spare parts or customer support for that product\n model, to give anyone who possesses the object code either (1) a\n copy of the Corresponding Source for all the software in the\n product that is covered by this License, on a durable physical\n medium customarily used for software interchange, for a price no\n more than your reasonable cost of physically performing this\n conveying of source, or (2) access to copy the\n Corresponding Source from a network server at no charge.\n\n c) Convey individual copies of the object code with a copy of the\n written offer to provide the Corresponding Source. This\n alternative is allowed only occasionally and noncommercially, and\n only if you received the object code with such an offer, in accord\n with subsection 6b.\n\n d) Convey the object code by offering access from a designated\n place (gratis or for a charge), and offer equivalent access to the\n Corresponding Source in the same way through the same place at no\n further charge. You need not require recipients to copy the\n Corresponding Source along with the object code. If the place to\n copy the object code is a network server, the Corresponding Source\n may be on a different server (operated by you or a third party)\n that supports equivalent copying facilities, provided you maintain\n clear directions next to the object code saying where to find the\n Corresponding Source. Regardless of what server hosts the\n Corresponding Source, you remain obligated to ensure that it is\n available for as long as needed to satisfy these requirements.\n\n e) Convey the object code using peer-to-peer transmission, provided\n you inform other peers where the object code and Corresponding\n Source of the work are being offered to the general public at no\n charge under subsection 6d.\n\n A separable portion of the object code, whose source code is excluded\nfrom the Corresponding Source as a System Library, need not be\nincluded in conveying the object code work.\n\n A \"User Product\" is either (1) a \"consumer product\", which means any\ntangible personal property which is normally used for personal, family,\nor household purposes, or (2) anything designed or sold for incorporation\ninto a dwelling. In determining whether a product is a consumer product,\ndoubtful cases shall be resolved in favor of coverage. For a particular\nproduct received by a particular user, \"normally used\" refers to a\ntypical or common use of that class of product, regardless of the status\nof the particular user or of the way in which the particular user\nactually uses, or expects or is expected to use, the product. A product\nis a consumer product regardless of whether the product has substantial\ncommercial, industrial or non-consumer uses, unless such uses represent\nthe only significant mode of use of the product.\n\n \"Installation Information\" for a User Product means any methods,\nprocedures, authorization keys, or other information required to install\nand execute modified versions of a covered work in that User Product from\na modified version of its Corresponding Source. The information must\nsuffice to ensure that the continued functioning of the modified object\ncode is in no case prevented or interfered with solely because\nmodification has been made.\n\n If you convey an object code work under this section in, or with, or\nspecifically for use in, a User Product, and the conveying occurs as\npart of a transaction in which the right of possession and use of the\nUser Product is transferred to the recipient in perpetuity or for a\nfixed term (regardless of how the transaction is characterized), the\nCorresponding Source conveyed under this section must be accompanied\nby the Installation Information. But this requirement does not apply\nif neither you nor any third party retains the ability to install\nmodified object code on the User Product (for example, the work has\nbeen installed in ROM).\n\n The requirement to provide Installation Information does not include a\nrequirement to continue to provide support service, warranty, or updates\nfor a work that has been modified or installed by the recipient, or for\nthe User Product in which it has been modified or installed. Access to a\nnetwork may be denied when the modification itself materially and\nadversely affects the operation of the network or violates the rules and\nprotocols for communication across the network.\n\n Corresponding Source conveyed, and Installation Information provided,\nin accord with this section must be in a format that is publicly\ndocumented (and with an implementation available to the public in\nsource code form), and must require no special password or key for\nunpacking, reading or copying.\n\n 7. Additional Terms.\n\n \"Additional permissions\" are terms that supplement the terms of this\nLicense by making exceptions from one or more of its conditions.\nAdditional permissions that are applicable to the entire Program shall\nbe treated as though they were included in this License, to the extent\nthat they are valid under applicable law. If additional permissions\napply only to part of the Program, that part may be used separately\nunder those permissions, but the entire Program remains governed by\nthis License without regard to the additional permissions.\n\n When you convey a copy of a covered work, you may at your option\nremove any additional permissions from that copy, or from any part of\nit. (Additional permissions may be written to require their own\nremoval in certain cases when you modify the work.) You may place\nadditional permissions on material, added by you to a covered work,\nfor which you have or can give appropriate copyright permission.\n\n Notwithstanding any other provision of this License, for material you\nadd to a covered work, you may (if authorized by the copyright holders of\nthat material) supplement the terms of this License with terms:\n\n a) Disclaiming warranty or limiting liability differently from the\n terms of sections 15 and 16 of this License; or\n\n b) Requiring preservation of specified reasonable legal notices or\n author attributions in that material or in the Appropriate Legal\n Notices displayed by works containing it; or\n\n c) Prohibiting misrepresentation of the origin of that material, or\n requiring that modified versions of such material be marked in\n reasonable ways as different from the original version; or\n\n d) Limiting the use for publicity purposes of names of licensors or\n authors of the material; or\n\n e) Declining to grant rights under trademark law for use of some\n trade names, trademarks, or service marks; or\n\n f) Requiring indemnification of licensors and authors of that\n material by anyone who conveys the material (or modified versions of\n it) with contractual assumptions of liability to the recipient, for\n any liability that these contractual assumptions directly impose on\n those licensors and authors.\n\n All other non-permissive additional terms are considered \"further\nrestrictions\" within the meaning of section 10. If the Program as you\nreceived it, or any part of it, contains a notice stating that it is\ngoverned by this License along with a term that is a further\nrestriction, you may remove that term. If a license document contains\na further restriction but permits relicensing or conveying under this\nLicense, you may add to a covered work material governed by the terms\nof that license document, provided that the further restriction does\nnot survive such relicensing or conveying.\n\n If you add terms to a covered work in accord with this section, you\nmust place, in the relevant source files, a statement of the\nadditional terms that apply to those files, or a notice indicating\nwhere to find the applicable terms.\n\n Additional terms, permissive or non-permissive, may be stated in the\nform of a separately written license, or stated as exceptions;\nthe above requirements apply either way.\n\n 8. Termination.\n\n You may not propagate or modify a covered work except as expressly\nprovided under this License. Any attempt otherwise to propagate or\nmodify it is void, and will automatically terminate your rights under\nthis License (including any patent licenses granted under the third\nparagraph of section 11).\n\n However, if you cease all violation of this License, then your\nlicense from a particular copyright holder is reinstated (a)\nprovisionally, unless and until the copyright holder explicitly and\nfinally terminates your license, and (b) permanently, if the copyright\nholder fails to notify you of the violation by some reasonable means\nprior to 60 days after the cessation.\n\n Moreover, your license from a particular copyright holder is\nreinstated permanently if the copyright holder notifies you of the\nviolation by some reasonable means, this is the first time you have\nreceived notice of violation of this License (for any work) from that\ncopyright holder, and you cure the violation prior to 30 days after\nyour receipt of the notice.\n\n Termination of your rights under this section does not terminate the\nlicenses of parties who have received copies or rights from you under\nthis License. If your rights have been terminated and not permanently\nreinstated, you do not qualify to receive new licenses for the same\nmaterial under section 10.\n\n 9. Acceptance Not Required for Having Copies.\n\n You are not required to accept this License in order to receive or\nrun a copy of the Program. Ancillary propagation of a covered work\noccurring solely as a consequence of using peer-to-peer transmission\nto receive a copy likewise does not require acceptance. However,\nnothing other than this License grants you permission to propagate or\nmodify any covered work. These actions infringe copyright if you do\nnot accept this License. Therefore, by modifying or propagating a\ncovered work, you indicate your acceptance of this License to do so.\n\n 10. Automatic Licensing of Downstream Recipients.\n\n Each time you convey a covered work, the recipient automatically\nreceives a license from the original licensors, to run, modify and\npropagate that work, subject to this License. You are not responsible\nfor enforcing compliance by third parties with this License.\n\n An \"entity transaction\" is a transaction transferring control of an\norganization, or substantially all assets of one, or subdividing an\norganization, or merging organizations. If propagation of a covered\nwork results from an entity transaction, each party to that\ntransaction who receives a copy of the work also receives whatever\nlicenses to the work the party's predecessor in interest had or could\ngive under the previous paragraph, plus a right to possession of the\nCorresponding Source of the work from the predecessor in interest, if\nthe predecessor has it or can get it with reasonable efforts.\n\n You may not impose any further restrictions on the exercise of the\nrights granted or affirmed under this License. For example, you may\nnot impose a license fee, royalty, or other charge for exercise of\nrights granted under this License, and you may not initiate litigation\n(including a cross-claim or counterclaim in a lawsuit) alleging that\nany patent claim is infringed by making, using, selling, offering for\nsale, or importing the Program or any portion of it.\n\n 11. Patents.\n\n A \"contributor\" is a copyright holder who authorizes use under this\nLicense of the Program or a work on which the Program is based. The\nwork thus licensed is called the contributor's \"contributor version\".\n\n A contributor's \"essential patent claims\" are all patent claims\nowned or controlled by the contributor, whether already acquired or\nhereafter acquired, that would be infringed by some manner, permitted\nby this License, of making, using, or selling its contributor version,\nbut do not include claims that would be infringed only as a\nconsequence of further modification of the contributor version. For\npurposes of this definition, \"control\" includes the right to grant\npatent sublicenses in a manner consistent with the requirements of\nthis License.\n\n Each contributor grants you a non-exclusive, worldwide, royalty-free\npatent license under the contributor's essential patent claims, to\nmake, use, sell, offer for sale, import and otherwise run, modify and\npropagate the contents of its contributor version.\n\n In the following three paragraphs, a \"patent license\" is any express\nagreement or commitment, however denominated, not to enforce a patent\n(such as an express permission to practice a patent or covenant not to\nsue for patent infringement). To \"grant\" such a patent license to a\nparty means to make such an agreement or commitment not to enforce a\npatent against the party.\n\n If you convey a covered work, knowingly relying on a patent license,\nand the Corresponding Source of the work is not available for anyone\nto copy, free of charge and under the terms of this License, through a\npublicly available network server or other readily accessible means,\nthen you must either (1) cause the Corresponding Source to be so\navailable, or (2) arrange to deprive yourself of the benefit of the\npatent license for this particular work, or (3) arrange, in a manner\nconsistent with the requirements of this License, to extend the patent\nlicense to downstream recipients. \"Knowingly relying\" means you have\nactual knowledge that, but for the patent license, your conveying the\ncovered work in a country, or your recipient's use of the covered work\nin a country, would infringe one or more identifiable patents in that\ncountry that you have reason to believe are valid.\n\n If, pursuant to or in connection with a single transaction or\narrangement, you convey, or propagate by procuring conveyance of, a\ncovered work, and grant a patent license to some of the parties\nreceiving the covered work authorizing them to use, propagate, modify\nor convey a specific copy of the covered work, then the patent license\nyou grant is automatically extended to all recipients of the covered\nwork and works based on it.\n\n A patent license is \"discriminatory\" if it does not include within\nthe scope of its coverage, prohibits the exercise of, or is\nconditioned on the non-exercise of one or more of the rights that are\nspecifically granted under this License. You may not convey a covered\nwork if you are a party to an arrangement with a third party that is\nin the business of distributing software, under which you make payment\nto the third party based on the extent of your activity of conveying\nthe work, and under which the third party grants, to any of the\nparties who would receive the covered work from you, a discriminatory\npatent license (a) in connection with copies of the covered work\nconveyed by you (or copies made from those copies), or (b) primarily\nfor and in connection with specific products or compilations that\ncontain the covered work, unless you entered into that arrangement,\nor that patent license was granted, prior to 28 March 2007.\n\n Nothing in this License shall be construed as excluding or limiting\nany implied license or other defenses to infringement that may\notherwise be available to you under applicable patent law.\n\n 12. No Surrender of Others' Freedom.\n\n If conditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot convey a\ncovered work so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you may\nnot convey it at all. For example, if you agree to terms that obligate you\nto collect a royalty for further conveying from those to whom you convey\nthe Program, the only way you could satisfy both those terms and this\nLicense would be to refrain entirely from conveying the Program.\n\n 13. Use with the GNU Affero General Public License.\n\n Notwithstanding any other provision of this License, you have\npermission to link or combine any covered work with a work licensed\nunder version 3 of the GNU Affero General Public License into a single\ncombined work, and to convey the resulting work. The terms of this\nLicense will continue to apply to the part which is the covered work,\nbut the special requirements of the GNU Affero General Public License,\nsection 13, concerning interaction through a network will apply to the\ncombination as such.\n\n 14. Revised Versions of this License.\n\n The Free Software Foundation may publish revised and/or new versions of\nthe GNU General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\n Each version is given a distinguishing version number. If the\nProgram specifies that a certain numbered version of the GNU General\nPublic License \"or any later version\" applies to it, you have the\noption of following the terms and conditions either of that numbered\nversion or of any later version published by the Free Software\nFoundation. If the Program does not specify a version number of the\nGNU General Public License, you may choose any version ever published\nby the Free Software Foundation.\n\n If the Program specifies that a proxy can decide which future\nversions of the GNU General Public License can be used, that proxy's\npublic statement of acceptance of a version permanently authorizes you\nto choose that version for the Program.\n\n Later license versions may give you additional or different\npermissions. However, no additional obligations are imposed on any\nauthor or copyright holder as a result of your choosing to follow a\nlater version.\n\n 15. Disclaimer of Warranty.\n\n THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\nAPPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\nHOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\nOF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\nIS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\nALL NECESSARY SERVICING, REPAIR OR CORRECTION.\n\n 16. Limitation of Liability.\n\n IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\nTHE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\nGENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\nUSE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\nDATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\nPARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\nEVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\nSUCH DAMAGES.\n\n 17. Interpretation of Sections 15 and 16.\n\n If the disclaimer of warranty and limitation of liability provided\nabove cannot be given local legal effect according to their terms,\nreviewing courts shall apply local law that most closely approximates\nan absolute waiver of all civil liability in connection with the\nProgram, unless a warranty or assumption of liability accompanies a\ncopy of the Program in return for a fee.\n\n END OF TERMS AND CONDITIONS\n"
},
{
"path": "xyz.itzsomebody.radon/src/test/java/me/itzsomebody/radon/transformers/TransformersTest.java",
"content": "package me.itzsomebody.radon.transformers;\n\nimport org.junit.Assert;\nimport org.junit.Test;\nimport xyz.itzsomebody.radon.exclusions.Exclusion;\nimport xyz.itzsomebody.radon.transformers.Transformers;\nimport xyz.itzsomebody.radon.transformers.strings.StringTransformer;\n\npublic class TransformersTest {\n @Test\n public void ensureTransformerExclusionTypeNonNull() throws Exception {\n for (var transformerEnum : Transformers.values()) {\n var transformerConstructor = transformerEnum.getTransformerClass().getConstructor();\n transformerConstructor.setAccessible(true);\n var transformerInstance = transformerConstructor.newInstance();\n\n // Often I'm dumb and forget to put an exclusion type\n Assert.assertNotNull(transformerInstance.getExclusionType());\n }\n }\n\n @Test\n public void ensureTransformerConfigNameNonNull() throws Exception{\n for (var transformerEnum : Transformers.values()) {\n var transformerConstructor = transformerEnum.getTransformerClass().getConstructor();\n transformerConstructor.setAccessible(true);\n var transformerInstance = transformerConstructor.newInstance();\n\n Assert.assertNotNull(transformerInstance.getConfigName());\n }\n }\n\n @Test\n public void ensureTransformerExclusionTypeNameIsSameAsConfigName() throws Exception{\n for (var transformerEnum : Transformers.values()) {\n var transformerConstructor = transformerEnum.getTransformerClass().getConstructor();\n transformerConstructor.setAccessible(true);\n var transformerInstance = transformerConstructor.newInstance();\n\n if (transformerInstance instanceof StringTransformer) {\n // Skip -- mostly likely no problem here\n } else {\n Assert.assertEquals(transformerInstance.getConfigName(), transformerInstance.getExclusionType().name().toLowerCase());\n }\n }\n }\n}\n"
},
{
"path": "xyz.itzsomebody.radon.template/build.gradle",
"content": "/*\n * Radon - An open-source Java obfuscator\n * Copyright (C) 2021 ItzSomebody\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see \n */\n\nplugins {\n id 'java'\n}\n\nsourceCompatibility = javaVer\n\ndependencies {\n testImplementation junit\n}\n"
},
{
"path": "xyz.itzsomebody.radon.template/src/README.md",
"content": "# Template\n\nThis module contains various template classes to use with ASMifier.\n"
},
{
"path": "xyz.itzsomebody.radon.template/src/main/java/xyz/itzsomebody/radon/templates/string/AESPCBCDecryptor.java",
"content": "package xyz.itzsomebody.radon.templates.string;\n\nimport java.nio.charset.StandardCharsets;\nimport java.util.Arrays;\nimport java.util.Base64;\n\npublic class AESPCBCDecryptor {\n public static int[][] sbox;\n public static int[][] invSbox;\n public static int[] rcon; // round constants\n public static int[] expandedKey; // expanded key\n public static int[][] mcTables; // lookup tables for MixColumns\n\n static {\n // SBox\n // See https://crypto.stackexchange.com/questions/85670/need-help-understanding-math-behind-rijndael-s-box\n // for an explanation of how 3 generates GF[2^8]\n sbox = new int[0x10][0x10];\n int p = 1;\n int q = 1;\n\n do {\n p = gfMult(3, p);\n q = gfMult(0xF6, q);\n\n int trans = q; // Affine transformation\n trans ^= ((q << 1) | (q >>> (8 - 1))) & 0xFF;\n trans ^= ((q << 2) | (q >>> (8 - 2))) & 0xFF;\n trans ^= ((q << 3) | (q >>> (8 - 3))) & 0xFF;\n trans ^= ((q << 4) | (q >>> (8 - 4))) & 0xFF;\n sbox[p / 16][p % 16] = (trans ^ 0x63) & 0xFF;\n } while (p != 1);\n\n sbox[0][0] = 0x63; // 0 is never invertible so set manually\n\n // InvSBox\n invSbox = new int[sbox.length][sbox.length];\n for (int row = 0; row < sbox.length; row++) {\n for (int col = 0; col < sbox[0].length; col++) {\n int b = sbox[row][col];\n invSbox[b >> 4][b & 0xF] = (row << 4) | col;\n }\n }\n\n // Round constants\n rcon = new int[10];\n for (int i = 0; i < rcon.length; i++) {\n if (i == 0) {\n rcon[i] = 1;\n } else if (rcon[i - 1] < 0x80) {\n rcon[i] = 2 * rcon[i - 1];\n } else if (rcon[i - 1] >= 0x80) {\n rcon[i] = (2 * rcon[i - 1]) ^ 0x11B;\n }\n }\n for (int i = 0; i < rcon.length; i++) {\n rcon[i] <<= 24;\n }\n\n // Multiplication tables for MixColumns\n mcTables = new int[0xF][];\n mcTables[0xE] = new int[0x100];\n mcTables[0xB] = new int[0x100];\n mcTables[0xD] = new int[0x100];\n mcTables[0x9] = new int[0x100];\n\n for (int mult = 0; mult < mcTables.length; mult++) {\n if (mcTables[mult] != null) {\n int[] table = mcTables[mult];\n\n for (int n = 0; n < table.length; n++) {\n table[n] = gfMult(mult, n);\n }\n }\n }\n }\n\n public static int subWord(int word) {\n int b0 = (word >> (8 * 3)) & 0xFF;\n int b1 = (word >> (8 * 2)) & 0xFF;\n int b2 = (word >> 8) & 0xFF;\n int b3 = word & 0xFF;\n\n return (sbox[b0 >> 4][b0 & 0xF] << 8 * 3)\n | (sbox[b1 >> 4][b1 & 0xF] << 8 * 2)\n | (sbox[b2 >> 4][b2 & 0xF] << 8)\n | (sbox[b3 >> 4][b3 & 0xF]);\n }\n\n public static void keySchedule(int[] key) {\n // AES-128\n int R = 11;\n expandedKey = new int[4 * R];\n\n for (int i = 0; i < expandedKey.length; i++) {\n if (i < key.length) {\n expandedKey[i] = key[i];\n } else if (i % key.length == 0) {\n int b = (expandedKey[i - 1] << 8) | (expandedKey[i - 1] >>> (32 - 8));\n expandedKey[i] = expandedKey[i - key.length];\n expandedKey[i] ^= subWord(b);\n expandedKey[i] ^= rcon[i / key.length - 1];\n } else {\n expandedKey[i] = expandedKey[i - key.length] ^ expandedKey[i - 1];\n }\n }\n }\n\n public static void addRoundKey(int[][] state, int round) {\n for (int row = 0; row < state.length; row++) {\n for (int col = 0; col < state[0].length; col++) {\n int rkey = expandedKey[round * state[0].length + col];\n int xbyte = (rkey >> (8 * (state.length - 1) - 8 * row)) & 0xFF;\n state[row][col] ^= xbyte;\n }\n }\n }\n\n public static void invShiftRows(int[][] state) {\n for (int offset = 0; offset < state.length; offset++) {\n int[] row = state[offset];\n int[] shifted = new int[row.length];\n for (int i = 0; i < row.length; i++) {\n shifted[(i + offset) % 4] = row[i];\n }\n state[offset] = shifted;\n }\n }\n\n public static void invSubBytes(int[][] state) {\n for (int row = 0; row < state.length; row++) {\n for (int col = 0; col < state[row].length; col++) {\n int s = state[row][col];\n int upper = s >> 4;\n int lower = s & 0xF;\n state[row][col] = invSbox[upper][lower];\n }\n }\n }\n\n // Multiply in GF[2^8]\n public static int gfMult(int mult, int b) {\n int result = 0;\n for (int i = 0; i < 8; i++) {\n if ((mult & 0x1) != 0) {\n result ^= b;\n }\n mult >>= 1;\n int mod = 0;\n if ((b & 0x80) != 0) {\n mod = 0x11B;\n }\n b = (b << 1) ^ mod;\n }\n return result;\n }\n\n public static void invMixColumns(int[][] state) {\n for (int col = 0; col < state[0].length; col++) {\n int s1 = mcTables[0xE][state[0][col]] ^ mcTables[0xB][state[1][col]] ^ mcTables[0xD][state[2][col]] ^ mcTables[0x9][state[3][col]];\n int s2 = mcTables[0x9][state[0][col]] ^ mcTables[0xE][state[1][col]] ^ mcTables[0xB][state[2][col]] ^ mcTables[0xD][state[3][col]];\n int s3 = mcTables[0xD][state[0][col]] ^ mcTables[0x9][state[1][col]] ^ mcTables[0xE][state[2][col]] ^ mcTables[0xB][state[3][col]];\n int s4 = mcTables[0xB][state[0][col]] ^ mcTables[0xD][state[1][col]] ^ mcTables[0x9][state[2][col]] ^ mcTables[0xE][state[3][col]];\n\n state[0][col] = s1;\n state[1][col] = s2;\n state[2][col] = s3;\n state[3][col] = s4;\n }\n }\n\n public static void invCipher(int[][] state) {\n int round = 10;\n\n addRoundKey(state, round);\n\n for (round = 9; round > 0; round--) {\n invShiftRows(state);\n invSubBytes(state);\n addRoundKey(state, round);\n invMixColumns(state);\n }\n\n invSubBytes(state);\n invShiftRows(state);\n addRoundKey(state, round);\n }\n\n public static String decrypt(String input, long[] ivInts) {\n // Compute key based on callstack (yes we're doing this meme again)\n var callstack = Thread.currentThread().getStackTrace();\n int[] key = new int[]{\n callstack[1].getClassName().hashCode(),\n callstack[1].getMethodName().hashCode(),\n callstack[2].getClassName().hashCode(),\n callstack[2].getMethodName().hashCode()\n };\n keySchedule(key);\n\n // Convert IV to correct format\n int[] ivBytes = new int[0x10];\n for (int i = 0; i < ivInts.length; i++) {\n for (int j = 0; j < 8; j++) {\n ivBytes[i * 8 + j] = (int) ((ivInts[i] >>> (56 - j * 8)) & 0xFF);\n }\n }\n int[][] iv = create_state(ivBytes);\n\n // Input -> state for InvCipher\n int[] cipherText = design(Base64.getDecoder().decode(input));\n int[][][] states = new int[cipherText.length / 16][][];\n for (int i = 0; i < states.length; i++) {\n int[] subarray = Arrays.copyOfRange(cipherText, i * 16, (i + 1) * 16);\n states[i] = create_state(subarray);\n }\n\n // PCBC decryption alg\n int[][] previousBlock1 = copyBlock(states[0]);\n invCipher(states[0]);\n for (int row = 0; row < states[0].length; row++) {\n for (int col = 0; col < states[0][0].length; col++) {\n states[0][row][col] ^= iv[row][col];\n previousBlock1[row][col] ^= states[0][row][col];\n }\n }\n\n for (int i = 1; i < states.length; i++) {\n int[][] previousBlock2 = copyBlock(states[i]);\n invCipher(states[i]);\n int[][] state = states[i];\n for (int row = 0; row < state.length; row++) {\n for (int col = 0; col < state[0].length; col++) {\n state[row][col] ^= previousBlock1[row][col];\n previousBlock2[row][col] ^= state[row][col];\n }\n }\n previousBlock1 = previousBlock2;\n }\n\n // Reconstruct bytes\n byte[] processed = new byte[cipherText.length];\n for (int i = 0; i < states.length; i++) {\n int[] vector = new int[0x10];\n for (int col = 0; col < states[0].length; col++) {\n for (int row = 0; row < states[0][0].length; row++) {\n vector[col * 4 + row] = states[i][row][col];\n }\n }\n System.arraycopy(resign(vector), 0, processed, i * 16, vector.length);\n }\n\n // Remove padding\n int nPadBytes = processed[processed.length - 1];\n byte[] message = new byte[processed.length - nPadBytes];\n System.arraycopy(processed, 0, message, 0, message.length);\n\n return new String(message, StandardCharsets.UTF_8);\n }\n\n public static int[][] copyBlock(int[][] block) {\n int[][] copy = new int[block.length][block[0].length];\n for (int row = 0; row < block.length; row++) {\n for (int col = 0; col < block[0].length; col++) {\n copy[row][col] = block[row][col];\n }\n }\n return copy;\n }\n\n public static int[] design(byte[] arr) {\n int[] designed = new int[arr.length];\n for (int i = 0; i < arr.length; i++) {\n designed[i] = arr[i] & 0xFF;\n }\n return designed;\n }\n\n public static byte[] resign(int[] arr) {\n byte[] signed = new byte[arr.length];\n for (int i = 0; i < arr.length; i++) {\n signed[i] = (byte) arr[i];\n }\n return signed;\n }\n\n public static int[][] create_state(int[] bytes) {\n int[][] state = new int[4][4];\n for (int i = 0; i < bytes.length; i++) {\n state[i % 4][i / 4] = bytes[i];\n }\n return state;\n }\n}\n"
}
]