├── .gitignore ├── Decode.jar ├── DexHacker ├── .DS_Store ├── DexHacker.xcodeproj │ ├── project.pbxproj │ ├── project.xcworkspace │ │ ├── contents.xcworkspacedata │ │ ├── xcshareddata │ │ │ └── DexHacker.xccheckout │ │ └── xcuserdata │ │ │ └── BunnyBlue.xcuserdatad │ │ │ └── UserInterfaceState.xcuserstate │ └── xcuserdata │ │ └── BunnyBlue.xcuserdatad │ │ └── xcschemes │ │ ├── DexHacker.xcscheme │ │ └── xcschememanagement.plist └── DexHacker │ ├── DexHacker.cpp │ ├── DexHacker.h │ ├── base64.c │ ├── base64.h │ └── main.cpp ├── DexReverse ├── .classpath ├── .gitignore ├── .project ├── libs │ ├── aa.jar │ └── commons-io-2.4.jar └── src │ └── io │ └── github │ └── bunnyblue │ └── dexdump │ ├── Boot.java │ ├── encoder │ └── Base64.java │ ├── odex │ └── ODex.java │ └── util │ ├── DexChecker.java │ └── DexProcessor.java ├── LICENSE ├── README.cn.md ├── README.md ├── api_19 ├── .DS_Store ├── dvm_patch │ ├── Android.mk │ ├── DexFile.cpp │ ├── DexHacker.cpp │ ├── DexHacker.h │ ├── base64.c │ └── base64.h ├── libdvm_arm.so └── libdvm_x86.so └── art └── image.png /.gitignore: -------------------------------------------------------------------------------- 1 | # Compiled Object files 2 | *.slo 3 | *.lo 4 | *.o 5 | *.obj 6 | 7 | # Precompiled Headers 8 | *.gch 9 | *.pch 10 | 11 | # Compiled Dynamic libraries 12 | 13 | *.dylib 14 | *.dll 15 | 16 | # Fortran module files 17 | *.mod 18 | 19 | # Compiled Static libraries 20 | *.lai 21 | *.la 22 | *.a 23 | *.lib 24 | 25 | # Executables 26 | *.exe 27 | *.out 28 | *.app 29 | /bin/ 30 | -------------------------------------------------------------------------------- /Decode.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/Decode.jar -------------------------------------------------------------------------------- /DexHacker/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/DexHacker/.DS_Store -------------------------------------------------------------------------------- /DexHacker/DexHacker.xcodeproj/project.pbxproj: -------------------------------------------------------------------------------- 1 | // !$*UTF8*$! 2 | { 3 | archiveVersion = 1; 4 | classes = { 5 | }; 6 | objectVersion = 46; 7 | objects = { 8 | 9 | /* Begin PBXBuildFile section */ 10 | D47AE7871B397DC600022743 /* main.cpp in Sources */ = {isa = PBXBuildFile; fileRef = D47AE7861B397DC600022743 /* main.cpp */; }; 11 | D47AE7911B397E0800022743 /* DexHacker.cpp in Sources */ = {isa = PBXBuildFile; fileRef = D47AE78D1B397E0800022743 /* DexHacker.cpp */; }; 12 | D47AE7921B397E0800022743 /* base64.c in Sources */ = {isa = PBXBuildFile; fileRef = D47AE78F1B397E0800022743 /* base64.c */; }; 13 | /* End PBXBuildFile section */ 14 | 15 | /* Begin PBXCopyFilesBuildPhase section */ 16 | D47AE7811B397DC600022743 /* CopyFiles */ = { 17 | isa = PBXCopyFilesBuildPhase; 18 | buildActionMask = 2147483647; 19 | dstPath = /usr/share/man/man1/; 20 | dstSubfolderSpec = 0; 21 | files = ( 22 | ); 23 | runOnlyForDeploymentPostprocessing = 1; 24 | }; 25 | /* End PBXCopyFilesBuildPhase section */ 26 | 27 | /* Begin PBXFileReference section */ 28 | D47AE7831B397DC600022743 /* DexHacker */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = DexHacker; sourceTree = BUILT_PRODUCTS_DIR; }; 29 | D47AE7861B397DC600022743 /* main.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = main.cpp; sourceTree = ""; }; 30 | D47AE78D1B397E0800022743 /* DexHacker.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = DexHacker.cpp; sourceTree = ""; }; 31 | D47AE78E1B397E0800022743 /* DexHacker.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = DexHacker.h; sourceTree = ""; }; 32 | D47AE78F1B397E0800022743 /* base64.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = base64.c; sourceTree = ""; }; 33 | D47AE7901B397E0800022743 /* base64.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = base64.h; sourceTree = ""; }; 34 | /* End PBXFileReference section */ 35 | 36 | /* Begin PBXFrameworksBuildPhase section */ 37 | D47AE7801B397DC600022743 /* Frameworks */ = { 38 | isa = PBXFrameworksBuildPhase; 39 | buildActionMask = 2147483647; 40 | files = ( 41 | ); 42 | runOnlyForDeploymentPostprocessing = 0; 43 | }; 44 | /* End PBXFrameworksBuildPhase section */ 45 | 46 | /* Begin PBXGroup section */ 47 | D47AE77A1B397DC600022743 = { 48 | isa = PBXGroup; 49 | children = ( 50 | D47AE7851B397DC600022743 /* DexHacker */, 51 | D47AE7841B397DC600022743 /* Products */, 52 | ); 53 | sourceTree = ""; 54 | }; 55 | D47AE7841B397DC600022743 /* Products */ = { 56 | isa = PBXGroup; 57 | children = ( 58 | D47AE7831B397DC600022743 /* DexHacker */, 59 | ); 60 | name = Products; 61 | sourceTree = ""; 62 | }; 63 | D47AE7851B397DC600022743 /* DexHacker */ = { 64 | isa = PBXGroup; 65 | children = ( 66 | D47AE78D1B397E0800022743 /* DexHacker.cpp */, 67 | D47AE78E1B397E0800022743 /* DexHacker.h */, 68 | D47AE78F1B397E0800022743 /* base64.c */, 69 | D47AE7901B397E0800022743 /* base64.h */, 70 | D47AE7861B397DC600022743 /* main.cpp */, 71 | ); 72 | path = DexHacker; 73 | sourceTree = ""; 74 | }; 75 | /* End PBXGroup section */ 76 | 77 | /* Begin PBXNativeTarget section */ 78 | D47AE7821B397DC600022743 /* DexHacker */ = { 79 | isa = PBXNativeTarget; 80 | buildConfigurationList = D47AE78A1B397DC600022743 /* Build configuration list for PBXNativeTarget "DexHacker" */; 81 | buildPhases = ( 82 | D47AE77F1B397DC600022743 /* Sources */, 83 | D47AE7801B397DC600022743 /* Frameworks */, 84 | D47AE7811B397DC600022743 /* CopyFiles */, 85 | ); 86 | buildRules = ( 87 | ); 88 | dependencies = ( 89 | ); 90 | name = DexHacker; 91 | productName = DexHacker; 92 | productReference = D47AE7831B397DC600022743 /* DexHacker */; 93 | productType = "com.apple.product-type.tool"; 94 | }; 95 | /* End PBXNativeTarget section */ 96 | 97 | /* Begin PBXProject section */ 98 | D47AE77B1B397DC600022743 /* Project object */ = { 99 | isa = PBXProject; 100 | attributes = { 101 | LastUpgradeCheck = 0630; 102 | ORGANIZATIONNAME = BunnyBlue; 103 | TargetAttributes = { 104 | D47AE7821B397DC600022743 = { 105 | CreatedOnToolsVersion = 6.3.2; 106 | }; 107 | }; 108 | }; 109 | buildConfigurationList = D47AE77E1B397DC600022743 /* Build configuration list for PBXProject "DexHacker" */; 110 | compatibilityVersion = "Xcode 3.2"; 111 | developmentRegion = English; 112 | hasScannedForEncodings = 0; 113 | knownRegions = ( 114 | en, 115 | ); 116 | mainGroup = D47AE77A1B397DC600022743; 117 | productRefGroup = D47AE7841B397DC600022743 /* Products */; 118 | projectDirPath = ""; 119 | projectRoot = ""; 120 | targets = ( 121 | D47AE7821B397DC600022743 /* DexHacker */, 122 | ); 123 | }; 124 | /* End PBXProject section */ 125 | 126 | /* Begin PBXSourcesBuildPhase section */ 127 | D47AE77F1B397DC600022743 /* Sources */ = { 128 | isa = PBXSourcesBuildPhase; 129 | buildActionMask = 2147483647; 130 | files = ( 131 | D47AE7871B397DC600022743 /* main.cpp in Sources */, 132 | D47AE7921B397E0800022743 /* base64.c in Sources */, 133 | D47AE7911B397E0800022743 /* DexHacker.cpp in Sources */, 134 | ); 135 | runOnlyForDeploymentPostprocessing = 0; 136 | }; 137 | /* End PBXSourcesBuildPhase section */ 138 | 139 | /* Begin XCBuildConfiguration section */ 140 | D47AE7881B397DC600022743 /* Debug */ = { 141 | isa = XCBuildConfiguration; 142 | buildSettings = { 143 | ALWAYS_SEARCH_USER_PATHS = NO; 144 | CLANG_CXX_LANGUAGE_STANDARD = "gnu++0x"; 145 | CLANG_CXX_LIBRARY = "libc++"; 146 | CLANG_ENABLE_MODULES = YES; 147 | CLANG_ENABLE_OBJC_ARC = YES; 148 | CLANG_WARN_BOOL_CONVERSION = YES; 149 | CLANG_WARN_CONSTANT_CONVERSION = YES; 150 | CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR; 151 | CLANG_WARN_EMPTY_BODY = YES; 152 | CLANG_WARN_ENUM_CONVERSION = YES; 153 | CLANG_WARN_INT_CONVERSION = YES; 154 | CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR; 155 | CLANG_WARN_UNREACHABLE_CODE = YES; 156 | CLANG_WARN__DUPLICATE_METHOD_MATCH = YES; 157 | COPY_PHASE_STRIP = NO; 158 | DEBUG_INFORMATION_FORMAT = dwarf; 159 | ENABLE_STRICT_OBJC_MSGSEND = YES; 160 | GCC_C_LANGUAGE_STANDARD = gnu99; 161 | GCC_DYNAMIC_NO_PIC = NO; 162 | GCC_NO_COMMON_BLOCKS = YES; 163 | GCC_OPTIMIZATION_LEVEL = 0; 164 | GCC_PREPROCESSOR_DEFINITIONS = ( 165 | "DEBUG=1", 166 | "$(inherited)", 167 | ); 168 | GCC_SYMBOLS_PRIVATE_EXTERN = NO; 169 | GCC_WARN_64_TO_32_BIT_CONVERSION = YES; 170 | GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR; 171 | GCC_WARN_UNDECLARED_SELECTOR = YES; 172 | GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE; 173 | GCC_WARN_UNUSED_FUNCTION = YES; 174 | GCC_WARN_UNUSED_VARIABLE = YES; 175 | MACOSX_DEPLOYMENT_TARGET = 10.11; 176 | MTL_ENABLE_DEBUG_INFO = YES; 177 | ONLY_ACTIVE_ARCH = YES; 178 | SDKROOT = macosx; 179 | }; 180 | name = Debug; 181 | }; 182 | D47AE7891B397DC600022743 /* Release */ = { 183 | isa = XCBuildConfiguration; 184 | buildSettings = { 185 | ALWAYS_SEARCH_USER_PATHS = NO; 186 | CLANG_CXX_LANGUAGE_STANDARD = "gnu++0x"; 187 | CLANG_CXX_LIBRARY = "libc++"; 188 | CLANG_ENABLE_MODULES = YES; 189 | CLANG_ENABLE_OBJC_ARC = YES; 190 | CLANG_WARN_BOOL_CONVERSION = YES; 191 | CLANG_WARN_CONSTANT_CONVERSION = YES; 192 | CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR; 193 | CLANG_WARN_EMPTY_BODY = YES; 194 | CLANG_WARN_ENUM_CONVERSION = YES; 195 | CLANG_WARN_INT_CONVERSION = YES; 196 | CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR; 197 | CLANG_WARN_UNREACHABLE_CODE = YES; 198 | CLANG_WARN__DUPLICATE_METHOD_MATCH = YES; 199 | COPY_PHASE_STRIP = NO; 200 | DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym"; 201 | ENABLE_NS_ASSERTIONS = NO; 202 | ENABLE_STRICT_OBJC_MSGSEND = YES; 203 | GCC_C_LANGUAGE_STANDARD = gnu99; 204 | GCC_NO_COMMON_BLOCKS = YES; 205 | GCC_WARN_64_TO_32_BIT_CONVERSION = YES; 206 | GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR; 207 | GCC_WARN_UNDECLARED_SELECTOR = YES; 208 | GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE; 209 | GCC_WARN_UNUSED_FUNCTION = YES; 210 | GCC_WARN_UNUSED_VARIABLE = YES; 211 | MACOSX_DEPLOYMENT_TARGET = 10.11; 212 | MTL_ENABLE_DEBUG_INFO = NO; 213 | SDKROOT = macosx; 214 | }; 215 | name = Release; 216 | }; 217 | D47AE78B1B397DC600022743 /* Debug */ = { 218 | isa = XCBuildConfiguration; 219 | buildSettings = { 220 | PRODUCT_NAME = "$(TARGET_NAME)"; 221 | }; 222 | name = Debug; 223 | }; 224 | D47AE78C1B397DC600022743 /* Release */ = { 225 | isa = XCBuildConfiguration; 226 | buildSettings = { 227 | PRODUCT_NAME = "$(TARGET_NAME)"; 228 | }; 229 | name = Release; 230 | }; 231 | /* End XCBuildConfiguration section */ 232 | 233 | /* Begin XCConfigurationList section */ 234 | D47AE77E1B397DC600022743 /* Build configuration list for PBXProject "DexHacker" */ = { 235 | isa = XCConfigurationList; 236 | buildConfigurations = ( 237 | D47AE7881B397DC600022743 /* Debug */, 238 | D47AE7891B397DC600022743 /* Release */, 239 | ); 240 | defaultConfigurationIsVisible = 0; 241 | defaultConfigurationName = Release; 242 | }; 243 | D47AE78A1B397DC600022743 /* Build configuration list for PBXNativeTarget "DexHacker" */ = { 244 | isa = XCConfigurationList; 245 | buildConfigurations = ( 246 | D47AE78B1B397DC600022743 /* Debug */, 247 | D47AE78C1B397DC600022743 /* Release */, 248 | ); 249 | defaultConfigurationIsVisible = 0; 250 | }; 251 | /* End XCConfigurationList section */ 252 | }; 253 | rootObject = D47AE77B1B397DC600022743 /* Project object */; 254 | } 255 | -------------------------------------------------------------------------------- /DexHacker/DexHacker.xcodeproj/project.xcworkspace/contents.xcworkspacedata: -------------------------------------------------------------------------------- 1 | 2 | 4 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /DexHacker/DexHacker.xcodeproj/project.xcworkspace/xcshareddata/DexHacker.xccheckout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | IDESourceControlProjectFavoriteDictionaryKey 6 | 7 | IDESourceControlProjectIdentifier 8 | 44771559-C053-4611-A0CE-07ECB2163B94 9 | IDESourceControlProjectName 10 | project 11 | IDESourceControlProjectOriginsDictionary 12 | 13 | 58E1D885AF0CEA61EF90097DD490DF126287094A 14 | https://github.com/bunnyblue/DexExtractor 15 | 16 | IDESourceControlProjectPath 17 | DexHacker/DexHacker.xcodeproj/project.xcworkspace 18 | IDESourceControlProjectRelativeInstallPathDictionary 19 | 20 | 58E1D885AF0CEA61EF90097DD490DF126287094A 21 | ../../.. 22 | 23 | IDESourceControlProjectURL 24 | https://github.com/bunnyblue/DexExtractor 25 | IDESourceControlProjectVersion 26 | 111 27 | IDESourceControlProjectWCCIdentifier 28 | 58E1D885AF0CEA61EF90097DD490DF126287094A 29 | IDESourceControlProjectWCConfigurations 30 | 31 | 32 | IDESourceControlRepositoryExtensionIdentifierKey 33 | public.vcs.git 34 | IDESourceControlWCCIdentifierKey 35 | 58E1D885AF0CEA61EF90097DD490DF126287094A 36 | IDESourceControlWCCName 37 | DexExtractor 38 | 39 | 40 | 41 | 42 | -------------------------------------------------------------------------------- /DexHacker/DexHacker.xcodeproj/project.xcworkspace/xcuserdata/BunnyBlue.xcuserdatad/UserInterfaceState.xcuserstate: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/DexHacker/DexHacker.xcodeproj/project.xcworkspace/xcuserdata/BunnyBlue.xcuserdatad/UserInterfaceState.xcuserstate -------------------------------------------------------------------------------- /DexHacker/DexHacker.xcodeproj/xcuserdata/BunnyBlue.xcuserdatad/xcschemes/DexHacker.xcscheme: -------------------------------------------------------------------------------- 1 | 2 | 5 | 8 | 9 | 15 | 21 | 22 | 23 | 24 | 25 | 30 | 31 | 32 | 33 | 39 | 40 | 41 | 42 | 51 | 53 | 59 | 60 | 61 | 62 | 63 | 64 | 70 | 72 | 78 | 79 | 80 | 81 | 83 | 84 | 87 | 88 | 89 | -------------------------------------------------------------------------------- /DexHacker/DexHacker.xcodeproj/xcuserdata/BunnyBlue.xcuserdatad/xcschemes/xcschememanagement.plist: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | SchemeUserState 6 | 7 | DexHacker.xcscheme 8 | 9 | orderHint 10 | 0 11 | 12 | 13 | SuppressBuildableAutocreation 14 | 15 | D47AE7821B397DC600022743 16 | 17 | primary 18 | 19 | 20 | 21 | 22 | 23 | -------------------------------------------------------------------------------- /DexHacker/DexHacker/DexHacker.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // DexHacker.cpp 3 | // 4 | // 5 | // Created by BunnyBlue on 6/23/15. 6 | // 7 | // 8 | 9 | #include "DexHacker.h" 10 | void DexHacker::writeDex2Encoded(unsigned char *data, size_t length){ 11 | 12 | 13 | 14 | 15 | #ifdef CODE_DVM 16 | ALOGE("--pacthed-- inject .dex length %d flag=%d",length,flags); 17 | 18 | char dexbuffer[64]={0}; 19 | 20 | char dexbufferNamed[128]={0}; 21 | char bufferProcess[256]={0}; 22 | 23 | bufferProcess= getProcessName(bufferProcess); 24 | sprintf(dexbuffer, "classes_%d", length); 25 | strcat(dexbufferNamed,"/sdcard/"); 26 | if (bufferProcess!=NULL) { 27 | strcat(dexbufferNamed,bufferProcess); 28 | strcat(dexbufferNamed,dexbuffer); 29 | }else{ 30 | ALOGE("--pacthed-- , FAULT pid not found\n"); 31 | return; 32 | } 33 | // strcat(dexbufferNamed,dexbuffer); 34 | strcat(dexbufferNamed,".dex"); 35 | 36 | ALOGE("--pacthed-- , %s\n", dexbufferNamed); 37 | 38 | ALOGE("--pacthed-- debug dalvikParse find dex try write file "); 39 | 40 | int status = remove(dexbufferNamed); 41 | 42 | if( status == 0 ) 43 | ALOGE("%s file deleted successfully.\n",dexbufferNamed); 44 | else 45 | { 46 | ALOGE("Unable to delete the file\n"); 47 | 48 | } 49 | 50 | 51 | u1* buffer_data_dest=(u1*)malloc((length+1)*sizeof(u1)); 52 | memcpy(buffer_data_dest, data, length); 53 | FILE *fp = fopen(dexbufferNamed,"wb"); 54 | 55 | 56 | if(NULL==fp){ 57 | ALOGE("--pacthed-- , can't create file ! maybe you need mount sdcard again!"); 58 | ALOGE( "%s data %s\n", strerror(errno),data); 59 | 60 | }else{ 61 | ALOGE("--pacthed-- create file %s ",dexbufferNamed); 62 | int dex_lem_local=length>2048?1024:length; 63 | 64 | unsigned char *dst=(unsigned char*)malloc(length*2.5); 65 | unsigned long dlen=length*2.5; 66 | base64_encode(dst, &dlen, data, length); 67 | 68 | fwrite(dst, dlen, 1, fp); 69 | //fwrite(data, sizeof(u1), length, fp); 70 | ALOGE("--pacthed-- create file end "); 71 | 72 | //fflush(fp); 73 | fclose(fp); 74 | fp = NULL; 75 | } 76 | free(buffer_data_dest); 77 | #else 78 | 79 | 80 | 81 | char dexbuffer[64]={0}; 82 | char dexbufferNamed[128]={0}; 83 | sprintf(dexbuffer, "classes_%d", length); 84 | //strcat(dexbufferNamed,"); 85 | strcat(dexbufferNamed,dexbuffer); 86 | strcat(dexbufferNamed,".dex"); 87 | 88 | 89 | 90 | int status = remove(dexbufferNamed); 91 | 92 | FILE *fp = fopen(dexbufferNamed,"wb"); 93 | 94 | 95 | if(NULL==fp){ 96 | 97 | }else{ 98 | 99 | unsigned char *dst=(unsigned char*)malloc(length*2.5); 100 | unsigned long dlen=length*2.5; 101 | base64_encode(dst, &dlen, data, length); 102 | 103 | fwrite(dst, dlen, 1, fp); 104 | 105 | //fflush(fp); 106 | fclose(fp); 107 | fp = NULL; 108 | } 109 | 110 | 111 | #endif 112 | 113 | 114 | } 115 | void DexHacker::writeEncodedDex2Dex(const char *encodedDex){ 116 | FILE *srcDexFile=fopen(encodedDex,"rb"); 117 | std::string outDexFile(encodedDex); 118 | outDexFile.append(".read.dex"); 119 | 120 | 121 | FILE *outFile=fopen(outDexFile.c_str(), "wb"); 122 | 123 | if (srcDexFile!=NULL) { 124 | fseek(srcDexFile,0,SEEK_END); 125 | long fsize =ftell(srcDexFile); 126 | rewind(srcDexFile); 127 | 128 | std::cout<0){ 181 | int read_count = read(fd_t, buffer, BUFLEN); 182 | 183 | if(read_count>0){ 184 | 185 | return buffer; 186 | } 187 | 188 | 189 | } 190 | 191 | return NULL; 192 | } -------------------------------------------------------------------------------- /DexHacker/DexHacker/DexHacker.h: -------------------------------------------------------------------------------- 1 | // 2 | // DexHacker.h 3 | // 4 | // 5 | // Created by BunnyBlue on 6/23/15. 6 | // 7 | // 8 | 9 | #ifndef ____DexHacker__ 10 | #define ____DexHacker__ 11 | #include 12 | #include 13 | #include 14 | #include "base64.h" 15 | #include 16 | #include 17 | #include 18 | #include 19 | #define BUFLEN 1024 20 | class DexHacker{ 21 | public: 22 | void writeDex2Encoded(unsigned char * data,size_t length); 23 | void writeEncodedDex2Dex(const char *dexPath); 24 | char * getProcessName(char * buffer); 25 | }; 26 | #endif /* defined(____DexHacker__) */ 27 | -------------------------------------------------------------------------------- /DexHacker/DexHacker/base64.c: -------------------------------------------------------------------------------- 1 | /* 2 | * RFC 1521 base64 encoding/decoding 3 | * 4 | * Copyright (C) 2006-2013, Brainspark B.V. 5 | * 6 | * This file is part of PolarSSL (http://www.polarssl.org) 7 | * Lead Maintainer: Paul Bakker 8 | * 9 | * All rights reserved. 10 | * 11 | * This program is free software; you can redistribute it and/or modify 12 | * it under the terms of the GNU General Public License as published by 13 | * the Free Software Foundation; either version 2 of the License, or 14 | * (at your option) any later version. 15 | * 16 | * This program is distributed in the hope that it will be useful, 17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 19 | * GNU General Public License for more details. 20 | * 21 | * You should have received a copy of the GNU General Public License along 22 | * with this program; if not, write to the Free Software Foundation, Inc., 23 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 24 | */ 25 | 26 | #define POLARSSL_BASE64_C 27 | #define POLARSSL_SELF_TEST 28 | 29 | #if defined(POLARSSL_BASE64_C) 30 | 31 | #include "base64.h" 32 | 33 | #if defined(_MSC_VER) && !defined(EFIX64) && !defined(EFI32) 34 | #include 35 | typedef UINT32 uint32_t; 36 | #else 37 | #include 38 | #endif 39 | 40 | static const unsigned char base64_enc_map[64] = 41 | { 42 | 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 43 | 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 44 | 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 45 | 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 46 | 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 47 | 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', 48 | '8', '9', '+', '/' 49 | }; 50 | 51 | static const unsigned char base64_dec_map[128] = 52 | { 53 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 54 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 55 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 56 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 57 | 127, 127, 127, 62, 127, 127, 127, 63, 52, 53, 58 | 54, 55, 56, 57, 58, 59, 60, 61, 127, 127, 59 | 127, 64, 127, 127, 127, 0, 1, 2, 3, 4, 60 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 61 | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 62 | 25, 127, 127, 127, 127, 127, 127, 26, 27, 28, 63 | 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 64 | 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 65 | 49, 50, 51, 127, 127, 127, 127, 127 66 | }; 67 | 68 | /* 69 | * Encode a buffer into base64 format 70 | */ 71 | int base64_encode( unsigned char *dst, size_t *dlen, 72 | const unsigned char *src, size_t slen ) 73 | { 74 | size_t i, n; 75 | int C1, C2, C3; 76 | unsigned char *p; 77 | 78 | if( slen == 0 ) 79 | return( 0 ); 80 | 81 | n = (slen << 3) / 6; 82 | 83 | switch( (slen << 3) - (n * 6) ) 84 | { 85 | case 2: n += 3; break; 86 | case 4: n += 2; break; 87 | default: break; 88 | } 89 | 90 | if( *dlen < n + 1 ) 91 | { 92 | *dlen = n + 1; 93 | return( POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL ); 94 | } 95 | 96 | n = (slen / 3) * 3; 97 | 98 | for( i = 0, p = dst; i < n; i += 3 ) 99 | { 100 | C1 = *src++; 101 | C2 = *src++; 102 | C3 = *src++; 103 | 104 | *p++ = base64_enc_map[(C1 >> 2) & 0x3F]; 105 | *p++ = base64_enc_map[(((C1 & 3) << 4) + (C2 >> 4)) & 0x3F]; 106 | *p++ = base64_enc_map[(((C2 & 15) << 2) + (C3 >> 6)) & 0x3F]; 107 | *p++ = base64_enc_map[C3 & 0x3F]; 108 | } 109 | 110 | if( i < slen ) 111 | { 112 | C1 = *src++; 113 | C2 = ((i + 1) < slen) ? *src++ : 0; 114 | 115 | *p++ = base64_enc_map[(C1 >> 2) & 0x3F]; 116 | *p++ = base64_enc_map[(((C1 & 3) << 4) + (C2 >> 4)) & 0x3F]; 117 | 118 | if( (i + 1) < slen ) 119 | *p++ = base64_enc_map[((C2 & 15) << 2) & 0x3F]; 120 | else *p++ = '='; 121 | 122 | *p++ = '='; 123 | } 124 | 125 | *dlen = p - dst; 126 | *p = 0; 127 | 128 | return( 0 ); 129 | } 130 | 131 | /* 132 | * Decode a base64-formatted buffer 133 | */ 134 | int base64_decode( unsigned char *dst, size_t *dlen, 135 | const unsigned char *src, size_t slen ) 136 | { 137 | size_t i, n; 138 | uint32_t j, x; 139 | unsigned char *p; 140 | 141 | for( i = n = j = 0; i < slen; i++ ) 142 | { 143 | if( ( slen - i ) >= 2 && 144 | src[i] == '\r' && src[i + 1] == '\n' ) 145 | continue; 146 | 147 | if( src[i] == '\n' ) 148 | continue; 149 | 150 | if( src[i] == '=' && ++j > 2 ) 151 | return( POLARSSL_ERR_BASE64_INVALID_CHARACTER ); 152 | 153 | if( src[i] > 127 || base64_dec_map[src[i]] == 127 ) 154 | return( POLARSSL_ERR_BASE64_INVALID_CHARACTER ); 155 | 156 | if( base64_dec_map[src[i]] < 64 && j != 0 ) 157 | return( POLARSSL_ERR_BASE64_INVALID_CHARACTER ); 158 | 159 | n++; 160 | } 161 | 162 | if( n == 0 ) 163 | return( 0 ); 164 | 165 | n = ((n * 6) + 7) >> 3; 166 | 167 | if( dst == NULL || *dlen < n ) 168 | { 169 | *dlen = n; 170 | return( POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL ); 171 | } 172 | 173 | for( j = 3, n = x = 0, p = dst; i > 0; i--, src++ ) 174 | { 175 | if( *src == '\r' || *src == '\n' ) 176 | continue; 177 | 178 | j -= ( base64_dec_map[*src] == 64 ); 179 | x = (x << 6) | ( base64_dec_map[*src] & 0x3F ); 180 | 181 | if( ++n == 4 ) 182 | { 183 | n = 0; 184 | if( j > 0 ) *p++ = (unsigned char)( x >> 16 ); 185 | if( j > 1 ) *p++ = (unsigned char)( x >> 8 ); 186 | if( j > 2 ) *p++ = (unsigned char)( x ); 187 | } 188 | } 189 | 190 | *dlen = p - dst; 191 | 192 | return( 0 ); 193 | } 194 | 195 | #if defined(POLARSSL_SELF_TEST) 196 | 197 | #include 198 | #include 199 | 200 | static const unsigned char base64_test_dec[64] = 201 | { 202 | 0x24, 0x48, 0x6E, 0x56, 0x87, 0x62, 0x5A, 0xBD, 203 | 0xBF, 0x17, 0xD9, 0xA2, 0xC4, 0x17, 0x1A, 0x01, 204 | 0x94, 0xED, 0x8F, 0x1E, 0x11, 0xB3, 0xD7, 0x09, 205 | 0x0C, 0xB6, 0xE9, 0x10, 0x6F, 0x22, 0xEE, 0x13, 206 | 0xCA, 0xB3, 0x07, 0x05, 0x76, 0xC9, 0xFA, 0x31, 207 | 0x6C, 0x08, 0x34, 0xFF, 0x8D, 0xC2, 0x6C, 0x38, 208 | 0x00, 0x43, 0xE9, 0x54, 0x97, 0xAF, 0x50, 0x4B, 209 | 0xD1, 0x41, 0xBA, 0x95, 0x31, 0x5A, 0x0B, 0x97 210 | }; 211 | 212 | static const unsigned char base64_test_enc[] = 213 | "JEhuVodiWr2/F9mixBcaAZTtjx4Rs9cJDLbpEG8i7hPK" 214 | "swcFdsn6MWwINP+Nwmw4AEPpVJevUEvRQbqVMVoLlw=="; 215 | 216 | /* 217 | * Checkup routine 218 | */ 219 | int base64_self_test( int verbose ) 220 | { 221 | size_t len; 222 | const unsigned char *src; 223 | unsigned char buffer[128]; 224 | 225 | if( verbose != 0 ) 226 | printf( " Base64 encoding test: " ); 227 | 228 | len = sizeof( buffer ); 229 | src = base64_test_dec; 230 | 231 | if( base64_encode( buffer, &len, src, 64 ) != 0 || 232 | memcmp( base64_test_enc, buffer, 88 ) != 0 ) 233 | { 234 | if( verbose != 0 ) 235 | printf( "failed\n" ); 236 | 237 | return( 1 ); 238 | } 239 | 240 | if( verbose != 0 ) 241 | printf( "passed\n Base64 decoding test: " ); 242 | 243 | len = sizeof( buffer ); 244 | src = base64_test_enc; 245 | 246 | if( base64_decode( buffer, &len, src, 88 ) != 0 || 247 | memcmp( base64_test_dec, buffer, 64 ) != 0 ) 248 | { 249 | if( verbose != 0 ) 250 | printf( "failed\n" ); 251 | 252 | return( 1 ); 253 | } 254 | 255 | if( verbose != 0 ) 256 | printf( "passed\n\n" ); 257 | 258 | return( 0 ); 259 | } 260 | 261 | #endif 262 | 263 | #endif 264 | -------------------------------------------------------------------------------- /DexHacker/DexHacker/base64.h: -------------------------------------------------------------------------------- 1 | /** 2 | * \file base64.h 3 | * 4 | * \brief RFC 1521 base64 encoding/decoding 5 | * 6 | * Copyright (C) 2006-2010, Brainspark B.V. 7 | * 8 | * This file is part of PolarSSL (http://www.polarssl.org) 9 | * Lead Maintainer: Paul Bakker 10 | * 11 | * All rights reserved. 12 | * 13 | * This program is free software; you can redistribute it and/or modify 14 | * it under the terms of the GNU General Public License as published by 15 | * the Free Software Foundation; either version 2 of the License, or 16 | * (at your option) any later version. 17 | * 18 | * This program is distributed in the hope that it will be useful, 19 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 20 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 21 | * GNU General Public License for more details. 22 | * 23 | * You should have received a copy of the GNU General Public License along 24 | * with this program; if not, write to the Free Software Foundation, Inc., 25 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 26 | */ 27 | #define POLARSSL_BASE64_C 28 | #define POLARSSL_SELF_TEST 29 | #ifndef POLARSSL_BASE64_H 30 | #define POLARSSL_BASE64_H 31 | 32 | #include 33 | 34 | #define POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL -0x002A /**< Output buffer too small. */ 35 | #define POLARSSL_ERR_BASE64_INVALID_CHARACTER -0x002C /**< Invalid character in input. */ 36 | 37 | #ifdef __cplusplus 38 | extern "C" { 39 | #endif 40 | 41 | /** 42 | * \brief Encode a buffer into base64 format 43 | * 44 | * \param dst destination buffer 45 | * \param dlen size of the buffer 46 | * \param src source buffer 47 | * \param slen amount of data to be encoded 48 | * 49 | * \return 0 if successful, or POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL. 50 | * *dlen is always updated to reflect the amount 51 | * of data that has (or would have) been written. 52 | * 53 | * \note Call this function with *dlen = 0 to obtain the 54 | * required buffer size in *dlen 55 | */ 56 | int base64_encode( unsigned char *dst, size_t *dlen, 57 | const unsigned char *src, size_t slen ); 58 | 59 | /** 60 | * \brief Decode a base64-formatted buffer 61 | * 62 | * \param dst destination buffer 63 | * \param dlen size of the buffer 64 | * \param src source buffer 65 | * \param slen amount of data to be decoded 66 | * 67 | * \return 0 if successful, POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL, or 68 | * POLARSSL_ERR_BASE64_INVALID_CHARACTER if the input data is 69 | * not correct. *dlen is always updated to reflect the amount 70 | * of data that has (or would have) been written. 71 | * 72 | * \note Call this function with *dlen = 0 to obtain the 73 | * required buffer size in *dlen 74 | */ 75 | int base64_decode( unsigned char *dst, size_t *dlen, 76 | const unsigned char *src, size_t slen ); 77 | int base64_self_test( int verbose ); 78 | 79 | 80 | #ifdef __cplusplus 81 | } 82 | #endif 83 | 84 | #endif /* base64.h */ 85 | -------------------------------------------------------------------------------- /DexHacker/DexHacker/main.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // main.cpp 3 | // DexHacker 4 | // 5 | // Created by BunnyBlue on 6/23/15. 6 | // Copyright (c) 2015 BunnyBlue. All rights reserved. 7 | // 8 | 9 | #include 10 | 11 | int main(int argc, const char * argv[]) { 12 | // insert code here... 13 | std::cout << "Hello, World!\n"; 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /DexReverse/.classpath: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /DexReverse/.gitignore: -------------------------------------------------------------------------------- 1 | /bin/ 2 | -------------------------------------------------------------------------------- /DexReverse/.project: -------------------------------------------------------------------------------- 1 | 2 | 3 | DexReverse 4 | 5 | 6 | 7 | 8 | 9 | org.eclipse.jdt.core.javabuilder 10 | 11 | 12 | 13 | 14 | 15 | org.eclipse.jdt.core.javanature 16 | 17 | 18 | -------------------------------------------------------------------------------- /DexReverse/libs/aa.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/DexReverse/libs/aa.jar -------------------------------------------------------------------------------- /DexReverse/libs/commons-io-2.4.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/DexReverse/libs/commons-io-2.4.jar -------------------------------------------------------------------------------- /DexReverse/src/io/github/bunnyblue/dexdump/Boot.java: -------------------------------------------------------------------------------- 1 | /** 2 | * 3 | */ 4 | package io.github.bunnyblue.dexdump; 5 | 6 | import io.github.bunnyblue.dexdump.odex.ODex; 7 | import io.github.bunnyblue.dexdump.util.DexChecker; 8 | import io.github.bunnyblue.dexdump.util.DexProcessor; 9 | 10 | import java.io.File; 11 | import java.io.IOException; 12 | import java.util.Collection; 13 | 14 | import org.apache.commons.io.FileUtils; 15 | 16 | /** 17 | * @author BunnyBlue 18 | * 19 | */ 20 | public class Boot { 21 | 22 | /** 23 | * @param args 24 | */ 25 | public static void main(String[] args) { 26 | // TODO Auto-generated method stub 27 | String dir = null; 28 | if (args != null && args.length > 0) { 29 | dir = args[0]; 30 | 31 | } else { 32 | System.out.println(" add dir "); 33 | } 34 | Collection dexFiles = FileUtils.listFiles(new File(dir), 35 | new String[] { "dex" }, false); 36 | 37 | for (File file : dexFiles) { 38 | try { 39 | System.out.println("Boot.main()" + file.getAbsolutePath() + DexChecker.isDex(file)); 40 | if (!DexChecker.isDex(file)) { 41 | DexProcessor.decodeDex(file); 42 | } 43 | 44 | } catch (IOException e) { 45 | // TODO Auto-generated catch block 46 | e.printStackTrace(); 47 | } 48 | } 49 | 50 | // deodex(); 51 | // tesst(); 52 | System.out.println("Boot.main()"); 53 | } 54 | 55 | // Boot.deodex()/Users/BunnyBlue/Downloads/jeb2demo/com.gome.eshopnewclasses_3940056.read.dextrue 56 | 57 | public static void deodex() { 58 | Collection dexFiles = FileUtils.listFiles(new File("/Users/BunnyBlue/Downloads/jeb2demo"), 59 | new String[] { "dex" }, false); 60 | 61 | for (File file : dexFiles) { 62 | try { 63 | 64 | if (DexChecker.isOdexFileFile(file)) { 65 | System.err.println("Boot.deodex()" + file.getAbsolutePath() + DexChecker.isOdexFileFile(file)); 66 | // ODex.dumpToSmalli("/Users/BunnyBlue/Downloads/jeb2demo/system/framework", 67 | // file); 68 | } 69 | 70 | } catch (IOException e) { 71 | // TODO Auto-generated catch block 72 | e.printStackTrace(); 73 | } 74 | } 75 | } 76 | 77 | public static void tesst() { 78 | Collection dexFiles = FileUtils.listFiles(new File("/Users/BunnyBlue/Downloads/jeb2demo"), 79 | new String[] { "dex" }, false); 80 | File file=new File("/Users/BunnyBlue/Downloads/jeb2demo/com.gome.eshopnewclasses_3940056.read.dex"); 81 | ODex.dumpToSmalli("/Users/BunnyBlue/Downloads/jeb2demo/system/framework", file); 82 | // for (File file : dexFiles) { 83 | // try { 84 | // 85 | // if (DexChecker.isOdexFileFile(file)) { 86 | // System.err.println("Boot.deodex()" + file.getAbsolutePath() + DexChecker.isOdexFileFile(file)); 87 | // // ODex.dumpToSmalli("/Users/BunnyBlue/Downloads/jeb2demo/system/framework", 88 | // // file); 89 | // } 90 | // 91 | // } catch (IOException e) { 92 | // // TODO Auto-generated catch block 93 | // e.printStackTrace(); 94 | // } 95 | // } 96 | } 97 | 98 | } 99 | -------------------------------------------------------------------------------- /DexReverse/src/io/github/bunnyblue/dexdump/encoder/Base64.java: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (C) 2010 The Android Open Source Project 3 | * 4 | * Licensed under the Apache License, Version 2.0 (the "License"); 5 | * you may not use this file except in compliance with the License. 6 | * You may obtain a copy of the License at 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 10 | * Unless required by applicable law or agreed to in writing, software 11 | * distributed under the License is distributed on an "AS IS" BASIS, 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 | * See the License for the specific language governing permissions and 14 | * limitations under the License. 15 | */ 16 | 17 | package io.github.bunnyblue.dexdump.encoder; 18 | 19 | import java.io.UnsupportedEncodingException; 20 | 21 | /** 22 | * Utilities for encoding and decoding the Base64 representation of 23 | * binary data. See RFCs 2045 and 3548. 26 | */ 27 | public class Base64 { 28 | /** 29 | * Default values for encoder/decoder flags. 30 | */ 31 | public static final int DEFAULT = 0; 32 | 33 | /** 34 | * Encoder flag bit to omit the padding '=' characters at the end 35 | * of the output (if any). 36 | */ 37 | public static final int NO_PADDING = 1; 38 | 39 | /** 40 | * Encoder flag bit to omit all line terminators (i.e., the output 41 | * will be on one long line). 42 | */ 43 | public static final int NO_WRAP = 2; 44 | 45 | /** 46 | * Encoder flag bit to indicate lines should be terminated with a 47 | * CRLF pair instead of just an LF. Has no effect if {@code 48 | * NO_WRAP} is specified as well. 49 | */ 50 | public static final int CRLF = 4; 51 | 52 | /** 53 | * Encoder/decoder flag bit to indicate using the "URL and 54 | * filename safe" variant of Base64 (see RFC 3548 section 4) where 55 | * {@code -} and {@code _} are used in place of {@code +} and 56 | * {@code /}. 57 | */ 58 | public static final int URL_SAFE = 8; 59 | 60 | /** 61 | * Flag to pass to {@link Base64OutputStream} to indicate that it 62 | * should not close the output stream it is wrapping when it 63 | * itself is closed. 64 | */ 65 | public static final int NO_CLOSE = 16; 66 | 67 | // -------------------------------------------------------- 68 | // shared code 69 | // -------------------------------------------------------- 70 | 71 | /* package */ static abstract class Coder { 72 | public byte[] output; 73 | public int op; 74 | 75 | /** 76 | * Encode/decode another block of input data. this.output is 77 | * provided by the caller, and must be big enough to hold all 78 | * the coded data. On exit, this.opwill be set to the length 79 | * of the coded data. 80 | * 81 | * @param finish true if this is the final call to process for 82 | * this object. Will finalize the coder state and 83 | * include any final bytes in the output. 84 | * 85 | * @return true if the input so far is good; false if some 86 | * error has been detected in the input stream.. 87 | */ 88 | public abstract boolean process(byte[] input, int offset, int len, boolean finish); 89 | 90 | /** 91 | * @return the maximum number of bytes a call to process() 92 | * could produce for the given number of input bytes. This may 93 | * be an overestimate. 94 | */ 95 | public abstract int maxOutputSize(int len); 96 | } 97 | 98 | // -------------------------------------------------------- 99 | // decoding 100 | // -------------------------------------------------------- 101 | 102 | /** 103 | * Decode the Base64-encoded data in input and return the data in 104 | * a new byte array. 105 | * 106 | *

The padding '=' characters at the end are considered optional, but 107 | * if any are present, there must be the correct number of them. 108 | * 109 | * @param str the input String to decode, which is converted to 110 | * bytes using the default charset 111 | * @param flags controls certain features of the decoded output. 112 | * Pass {@code DEFAULT} to decode standard Base64. 113 | * 114 | * @throws IllegalArgumentException if the input contains 115 | * incorrect padding 116 | */ 117 | public static byte[] decode(String str, int flags) { 118 | return decode(str.getBytes(), flags); 119 | } 120 | 121 | /** 122 | * Decode the Base64-encoded data in input and return the data in 123 | * a new byte array. 124 | * 125 | *

The padding '=' characters at the end are considered optional, but 126 | * if any are present, there must be the correct number of them. 127 | * 128 | * @param input the input array to decode 129 | * @param flags controls certain features of the decoded output. 130 | * Pass {@code DEFAULT} to decode standard Base64. 131 | * 132 | * @throws IllegalArgumentException if the input contains 133 | * incorrect padding 134 | */ 135 | public static byte[] decode(byte[] input, int flags) { 136 | return decode(input, 0, input.length, flags); 137 | } 138 | 139 | /** 140 | * Decode the Base64-encoded data in input and return the data in 141 | * a new byte array. 142 | * 143 | *

The padding '=' characters at the end are considered optional, but 144 | * if any are present, there must be the correct number of them. 145 | * 146 | * @param input the data to decode 147 | * @param offset the position within the input array at which to start 148 | * @param len the number of bytes of input to decode 149 | * @param flags controls certain features of the decoded output. 150 | * Pass {@code DEFAULT} to decode standard Base64. 151 | * 152 | * @throws IllegalArgumentException if the input contains 153 | * incorrect padding 154 | */ 155 | public static byte[] decode(byte[] input, int offset, int len, int flags) { 156 | // Allocate space for the most data the input could represent. 157 | // (It could contain less if it contains whitespace, etc.) 158 | Decoder decoder = new Decoder(flags, new byte[len*3/4]); 159 | 160 | if (!decoder.process(input, offset, len, true)) { 161 | throw new IllegalArgumentException("bad base-64"); 162 | } 163 | 164 | // Maybe we got lucky and allocated exactly enough output space. 165 | if (decoder.op == decoder.output.length) { 166 | return decoder.output; 167 | } 168 | 169 | // Need to shorten the array, so allocate a new one of the 170 | // right size and copy. 171 | byte[] temp = new byte[decoder.op]; 172 | System.arraycopy(decoder.output, 0, temp, 0, decoder.op); 173 | return temp; 174 | } 175 | 176 | /* package */ static class Decoder extends Coder { 177 | /** 178 | * Lookup table for turning bytes into their position in the 179 | * Base64 alphabet. 180 | */ 181 | private static final int DECODE[] = { 182 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 183 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 184 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63, 185 | 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1, -1, 186 | -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 187 | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, 188 | -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 189 | 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, 190 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 191 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 192 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 193 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 194 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 195 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 196 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 197 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 198 | }; 199 | 200 | /** 201 | * Decode lookup table for the "web safe" variant (RFC 3548 202 | * sec. 4) where - and _ replace + and /. 203 | */ 204 | private static final int DECODE_WEBSAFE[] = { 205 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 206 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 207 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, 208 | 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1, -1, 209 | -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 210 | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, 63, 211 | -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 212 | 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, 213 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 214 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 215 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 216 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 217 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 218 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 219 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 220 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 221 | }; 222 | 223 | /** Non-data values in the DECODE arrays. */ 224 | private static final int SKIP = -1; 225 | private static final int EQUALS = -2; 226 | 227 | /** 228 | * States 0-3 are reading through the next input tuple. 229 | * State 4 is having read one '=' and expecting exactly 230 | * one more. 231 | * State 5 is expecting no more data or padding characters 232 | * in the input. 233 | * State 6 is the error state; an error has been detected 234 | * in the input and no future input can "fix" it. 235 | */ 236 | private int state; // state number (0 to 6) 237 | private int value; 238 | 239 | final private int[] alphabet; 240 | 241 | public Decoder(int flags, byte[] output) { 242 | this.output = output; 243 | 244 | alphabet = ((flags & URL_SAFE) == 0) ? DECODE : DECODE_WEBSAFE; 245 | state = 0; 246 | value = 0; 247 | } 248 | 249 | /** 250 | * @return an overestimate for the number of bytes {@code 251 | * len} bytes could decode to. 252 | */ 253 | @Override 254 | public int maxOutputSize(int len) { 255 | return len * 3/4 + 10; 256 | } 257 | 258 | /** 259 | * Decode another block of input data. 260 | * 261 | * @return true if the state machine is still healthy. false if 262 | * bad base-64 data has been detected in the input stream. 263 | */ 264 | @Override 265 | public boolean process(byte[] input, int offset, int len, boolean finish) { 266 | if (this.state == 6) return false; 267 | 268 | int p = offset; 269 | len += offset; 270 | 271 | // Using local variables makes the decoder about 12% 272 | // faster than if we manipulate the member variables in 273 | // the loop. (Even alphabet makes a measurable 274 | // difference, which is somewhat surprising to me since 275 | // the member variable is final.) 276 | int state = this.state; 277 | int value = this.value; 278 | int op = 0; 279 | final byte[] output = this.output; 280 | final int[] alphabet = this.alphabet; 281 | 282 | while (p < len) { 283 | // Try the fast path: we're starting a new tuple and the 284 | // next four bytes of the input stream are all data 285 | // bytes. This corresponds to going through states 286 | // 0-1-2-3-0. We expect to use this method for most of 287 | // the data. 288 | // 289 | // If any of the next four bytes of input are non-data 290 | // (whitespace, etc.), value will end up negative. (All 291 | // the non-data values in decode are small negative 292 | // numbers, so shifting any of them up and or'ing them 293 | // together will result in a value with its top bit set.) 294 | // 295 | // You can remove this whole block and the output should 296 | // be the same, just slower. 297 | if (state == 0) { 298 | while (p+4 <= len && 299 | (value = ((alphabet[input[p] & 0xff] << 18) | 300 | (alphabet[input[p+1] & 0xff] << 12) | 301 | (alphabet[input[p+2] & 0xff] << 6) | 302 | (alphabet[input[p+3] & 0xff]))) >= 0) { 303 | output[op+2] = (byte) value; 304 | output[op+1] = (byte) (value >> 8); 305 | output[op] = (byte) (value >> 16); 306 | op += 3; 307 | p += 4; 308 | } 309 | if (p >= len) break; 310 | } 311 | 312 | // The fast path isn't available -- either we've read a 313 | // partial tuple, or the next four input bytes aren't all 314 | // data, or whatever. Fall back to the slower state 315 | // machine implementation. 316 | 317 | int d = alphabet[input[p++] & 0xff]; 318 | 319 | switch (state) { 320 | case 0: 321 | if (d >= 0) { 322 | value = d; 323 | ++state; 324 | } else if (d != SKIP) { 325 | this.state = 6; 326 | return false; 327 | } 328 | break; 329 | 330 | case 1: 331 | if (d >= 0) { 332 | value = (value << 6) | d; 333 | ++state; 334 | } else if (d != SKIP) { 335 | this.state = 6; 336 | return false; 337 | } 338 | break; 339 | 340 | case 2: 341 | if (d >= 0) { 342 | value = (value << 6) | d; 343 | ++state; 344 | } else if (d == EQUALS) { 345 | // Emit the last (partial) output tuple; 346 | // expect exactly one more padding character. 347 | output[op++] = (byte) (value >> 4); 348 | state = 4; 349 | } else if (d != SKIP) { 350 | this.state = 6; 351 | return false; 352 | } 353 | break; 354 | 355 | case 3: 356 | if (d >= 0) { 357 | // Emit the output triple and return to state 0. 358 | value = (value << 6) | d; 359 | output[op+2] = (byte) value; 360 | output[op+1] = (byte) (value >> 8); 361 | output[op] = (byte) (value >> 16); 362 | op += 3; 363 | state = 0; 364 | } else if (d == EQUALS) { 365 | // Emit the last (partial) output tuple; 366 | // expect no further data or padding characters. 367 | output[op+1] = (byte) (value >> 2); 368 | output[op] = (byte) (value >> 10); 369 | op += 2; 370 | state = 5; 371 | } else if (d != SKIP) { 372 | this.state = 6; 373 | return false; 374 | } 375 | break; 376 | 377 | case 4: 378 | if (d == EQUALS) { 379 | ++state; 380 | } else if (d != SKIP) { 381 | this.state = 6; 382 | return false; 383 | } 384 | break; 385 | 386 | case 5: 387 | if (d != SKIP) { 388 | this.state = 6; 389 | return false; 390 | } 391 | break; 392 | } 393 | } 394 | 395 | if (!finish) { 396 | // We're out of input, but a future call could provide 397 | // more. 398 | this.state = state; 399 | this.value = value; 400 | this.op = op; 401 | return true; 402 | } 403 | 404 | // Done reading input. Now figure out where we are left in 405 | // the state machine and finish up. 406 | 407 | switch (state) { 408 | case 0: 409 | // Output length is a multiple of three. Fine. 410 | break; 411 | case 1: 412 | // Read one extra input byte, which isn't enough to 413 | // make another output byte. Illegal. 414 | this.state = 6; 415 | return false; 416 | case 2: 417 | // Read two extra input bytes, enough to emit 1 more 418 | // output byte. Fine. 419 | output[op++] = (byte) (value >> 4); 420 | break; 421 | case 3: 422 | // Read three extra input bytes, enough to emit 2 more 423 | // output bytes. Fine. 424 | output[op++] = (byte) (value >> 10); 425 | output[op++] = (byte) (value >> 2); 426 | break; 427 | case 4: 428 | // Read one padding '=' when we expected 2. Illegal. 429 | this.state = 6; 430 | return false; 431 | case 5: 432 | // Read all the padding '='s we expected and no more. 433 | // Fine. 434 | break; 435 | } 436 | 437 | this.state = state; 438 | this.op = op; 439 | return true; 440 | } 441 | } 442 | 443 | // -------------------------------------------------------- 444 | // encoding 445 | // -------------------------------------------------------- 446 | 447 | /** 448 | * Base64-encode the given data and return a newly allocated 449 | * String with the result. 450 | * 451 | * @param input the data to encode 452 | * @param flags controls certain features of the encoded output. 453 | * Passing {@code DEFAULT} results in output that 454 | * adheres to RFC 2045. 455 | */ 456 | public static String encodeToString(byte[] input, int flags) { 457 | try { 458 | return new String(encode(input, flags), "US-ASCII"); 459 | } catch (UnsupportedEncodingException e) { 460 | // US-ASCII is guaranteed to be available. 461 | throw new AssertionError(e); 462 | } 463 | } 464 | 465 | /** 466 | * Base64-encode the given data and return a newly allocated 467 | * String with the result. 468 | * 469 | * @param input the data to encode 470 | * @param offset the position within the input array at which to 471 | * start 472 | * @param len the number of bytes of input to encode 473 | * @param flags controls certain features of the encoded output. 474 | * Passing {@code DEFAULT} results in output that 475 | * adheres to RFC 2045. 476 | */ 477 | public static String encodeToString(byte[] input, int offset, int len, int flags) { 478 | try { 479 | return new String(encode(input, offset, len, flags), "US-ASCII"); 480 | } catch (UnsupportedEncodingException e) { 481 | // US-ASCII is guaranteed to be available. 482 | throw new AssertionError(e); 483 | } 484 | } 485 | 486 | /** 487 | * Base64-encode the given data and return a newly allocated 488 | * byte[] with the result. 489 | * 490 | * @param input the data to encode 491 | * @param flags controls certain features of the encoded output. 492 | * Passing {@code DEFAULT} results in output that 493 | * adheres to RFC 2045. 494 | */ 495 | public static byte[] encode(byte[] input, int flags) { 496 | return encode(input, 0, input.length, flags); 497 | } 498 | 499 | /** 500 | * Base64-encode the given data and return a newly allocated 501 | * byte[] with the result. 502 | * 503 | * @param input the data to encode 504 | * @param offset the position within the input array at which to 505 | * start 506 | * @param len the number of bytes of input to encode 507 | * @param flags controls certain features of the encoded output. 508 | * Passing {@code DEFAULT} results in output that 509 | * adheres to RFC 2045. 510 | */ 511 | public static byte[] encode(byte[] input, int offset, int len, int flags) { 512 | Encoder encoder = new Encoder(flags, null); 513 | 514 | // Compute the exact length of the array we will produce. 515 | int output_len = len / 3 * 4; 516 | 517 | // Account for the tail of the data and the padding bytes, if any. 518 | if (encoder.do_padding) { 519 | if (len % 3 > 0) { 520 | output_len += 4; 521 | } 522 | } else { 523 | switch (len % 3) { 524 | case 0: break; 525 | case 1: output_len += 2; break; 526 | case 2: output_len += 3; break; 527 | } 528 | } 529 | 530 | // Account for the newlines, if any. 531 | if (encoder.do_newline && len > 0) { 532 | output_len += (((len-1) / (3 * Encoder.LINE_GROUPS)) + 1) * 533 | (encoder.do_cr ? 2 : 1); 534 | } 535 | 536 | encoder.output = new byte[output_len]; 537 | encoder.process(input, offset, len, true); 538 | 539 | assert encoder.op == output_len; 540 | 541 | return encoder.output; 542 | } 543 | 544 | /* package */ static class Encoder extends Coder { 545 | /** 546 | * Emit a new line every this many output tuples. Corresponds to 547 | * a 76-character line length (the maximum allowable according to 548 | * RFC 2045). 549 | */ 550 | public static final int LINE_GROUPS = 19; 551 | 552 | /** 553 | * Lookup table for turning Base64 alphabet positions (6 bits) 554 | * into output bytes. 555 | */ 556 | private static final byte ENCODE[] = { 557 | 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 558 | 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 559 | 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 560 | 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '+', '/', 561 | }; 562 | 563 | /** 564 | * Lookup table for turning Base64 alphabet positions (6 bits) 565 | * into output bytes. 566 | */ 567 | private static final byte ENCODE_WEBSAFE[] = { 568 | 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 569 | 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 570 | 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 571 | 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '_', 572 | }; 573 | 574 | final private byte[] tail; 575 | /* package */ int tailLen; 576 | private int count; 577 | 578 | final public boolean do_padding; 579 | final public boolean do_newline; 580 | final public boolean do_cr; 581 | final private byte[] alphabet; 582 | 583 | public Encoder(int flags, byte[] output) { 584 | this.output = output; 585 | 586 | do_padding = (flags & NO_PADDING) == 0; 587 | do_newline = (flags & NO_WRAP) == 0; 588 | do_cr = (flags & CRLF) != 0; 589 | alphabet = ((flags & URL_SAFE) == 0) ? ENCODE : ENCODE_WEBSAFE; 590 | 591 | tail = new byte[2]; 592 | tailLen = 0; 593 | 594 | count = do_newline ? LINE_GROUPS : -1; 595 | } 596 | 597 | /** 598 | * @return an overestimate for the number of bytes {@code 599 | * len} bytes could encode to. 600 | */ 601 | @Override 602 | public int maxOutputSize(int len) { 603 | return len * 8/5 + 10; 604 | } 605 | 606 | @Override 607 | public boolean process(byte[] input, int offset, int len, boolean finish) { 608 | // Using local variables makes the encoder about 9% faster. 609 | final byte[] alphabet = this.alphabet; 610 | final byte[] output = this.output; 611 | int op = 0; 612 | int count = this.count; 613 | 614 | int p = offset; 615 | len += offset; 616 | int v = -1; 617 | 618 | // First we need to concatenate the tail of the previous call 619 | // with any input bytes available now and see if we can empty 620 | // the tail. 621 | 622 | switch (tailLen) { 623 | case 0: 624 | // There was no tail. 625 | break; 626 | 627 | case 1: 628 | if (p+2 <= len) { 629 | // A 1-byte tail with at least 2 bytes of 630 | // input available now. 631 | v = ((tail[0] & 0xff) << 16) | 632 | ((input[p++] & 0xff) << 8) | 633 | (input[p++] & 0xff); 634 | tailLen = 0; 635 | }; 636 | break; 637 | 638 | case 2: 639 | if (p+1 <= len) { 640 | // A 2-byte tail with at least 1 byte of input. 641 | v = ((tail[0] & 0xff) << 16) | 642 | ((tail[1] & 0xff) << 8) | 643 | (input[p++] & 0xff); 644 | tailLen = 0; 645 | } 646 | break; 647 | } 648 | 649 | if (v != -1) { 650 | output[op++] = alphabet[(v >> 18) & 0x3f]; 651 | output[op++] = alphabet[(v >> 12) & 0x3f]; 652 | output[op++] = alphabet[(v >> 6) & 0x3f]; 653 | output[op++] = alphabet[v & 0x3f]; 654 | if (--count == 0) { 655 | if (do_cr) output[op++] = '\r'; 656 | output[op++] = '\n'; 657 | count = LINE_GROUPS; 658 | } 659 | } 660 | 661 | // At this point either there is no tail, or there are fewer 662 | // than 3 bytes of input available. 663 | 664 | // The main loop, turning 3 input bytes into 4 output bytes on 665 | // each iteration. 666 | while (p+3 <= len) { 667 | v = ((input[p] & 0xff) << 16) | 668 | ((input[p+1] & 0xff) << 8) | 669 | (input[p+2] & 0xff); 670 | output[op] = alphabet[(v >> 18) & 0x3f]; 671 | output[op+1] = alphabet[(v >> 12) & 0x3f]; 672 | output[op+2] = alphabet[(v >> 6) & 0x3f]; 673 | output[op+3] = alphabet[v & 0x3f]; 674 | p += 3; 675 | op += 4; 676 | if (--count == 0) { 677 | if (do_cr) output[op++] = '\r'; 678 | output[op++] = '\n'; 679 | count = LINE_GROUPS; 680 | } 681 | } 682 | 683 | if (finish) { 684 | // Finish up the tail of the input. Note that we need to 685 | // consume any bytes in tail before any bytes 686 | // remaining in input; there should be at most two bytes 687 | // total. 688 | 689 | if (p-tailLen == len-1) { 690 | int t = 0; 691 | v = ((tailLen > 0 ? tail[t++] : input[p++]) & 0xff) << 4; 692 | tailLen -= t; 693 | output[op++] = alphabet[(v >> 6) & 0x3f]; 694 | output[op++] = alphabet[v & 0x3f]; 695 | if (do_padding) { 696 | output[op++] = '='; 697 | output[op++] = '='; 698 | } 699 | if (do_newline) { 700 | if (do_cr) output[op++] = '\r'; 701 | output[op++] = '\n'; 702 | } 703 | } else if (p-tailLen == len-2) { 704 | int t = 0; 705 | v = (((tailLen > 1 ? tail[t++] : input[p++]) & 0xff) << 10) | 706 | (((tailLen > 0 ? tail[t++] : input[p++]) & 0xff) << 2); 707 | tailLen -= t; 708 | output[op++] = alphabet[(v >> 12) & 0x3f]; 709 | output[op++] = alphabet[(v >> 6) & 0x3f]; 710 | output[op++] = alphabet[v & 0x3f]; 711 | if (do_padding) { 712 | output[op++] = '='; 713 | } 714 | if (do_newline) { 715 | if (do_cr) output[op++] = '\r'; 716 | output[op++] = '\n'; 717 | } 718 | } else if (do_newline && op > 0 && count != LINE_GROUPS) { 719 | if (do_cr) output[op++] = '\r'; 720 | output[op++] = '\n'; 721 | } 722 | 723 | assert tailLen == 0; 724 | assert p == len; 725 | } else { 726 | // Save the leftovers in tail to be consumed on the next 727 | // call to encodeInternal. 728 | 729 | if (p == len-1) { 730 | tail[tailLen++] = input[p]; 731 | } else if (p == len-2) { 732 | tail[tailLen++] = input[p]; 733 | tail[tailLen++] = input[p+1]; 734 | } 735 | } 736 | 737 | this.op = op; 738 | this.count = count; 739 | 740 | return true; 741 | } 742 | } 743 | 744 | private Base64() { } // don't instantiate 745 | } 746 | -------------------------------------------------------------------------------- /DexReverse/src/io/github/bunnyblue/dexdump/odex/ODex.java: -------------------------------------------------------------------------------- 1 | package io.github.bunnyblue.dexdump.odex; 2 | 3 | import java.io.File; 4 | import java.io.IOException; 5 | 6 | import org.apache.commons.io.FileUtils; 7 | 8 | 9 | 10 | public class ODex { 11 | public static boolean dumpToSmalli(String bootPath, File dexFile) { 12 | // org.jf.baksmali.main aa; 13 | java.lang.String bootclass = "--bootclasspath"; 14 | String odexdir = dexFile.getAbsolutePath() + "smali"; 15 | try { 16 | FileUtils.deleteDirectory(new File(odexdir)); 17 | } catch (IOException e) { 18 | // TODO Auto-generated catch block 19 | e.printStackTrace(); 20 | } 21 | File odexDir = new File(odexdir); 22 | odexDir.mkdirs(); 23 | String[] args = new String[] { bootclass, bootPath, "-x", "--output", odexDir.getAbsolutePath(), 24 | dexFile.getAbsolutePath() }; 25 | 26 | 27 | // try { 28 | // org.jf.baksmali.main.main(args); 29 | // smaliToDex(odexDir); 30 | // System.out.println("ODex.dumpToSmalli(------------------------)"); 31 | // } catch (IOException e) { 32 | // // TODO Auto-generated catch block 33 | // // e.printStackTrace(); 34 | // } finally { 35 | // // smaliToDex(odexDir); 36 | // // String data = null; 37 | // // data.charAt(2); 38 | // // System.out.println("xxxxxxxxxxxxx" + odexDir.getAbsolutePath()); 39 | // } 40 | 41 | 42 | 43 | return false; 44 | } 45 | 46 | public static void smaliToDex(File smaliDir) { 47 | if (!smaliDir.isDirectory()) { 48 | return; 49 | } 50 | String odexdir = smaliDir.getAbsolutePath().replace("dexsmali", "_deodex.dex"); 51 | 52 | String[] args = new String[] { "--output", odexdir, smaliDir.getAbsolutePath() }; 53 | System.out.println(odexdir); 54 | // org.jf.smali.main.main(args); 55 | 56 | } 57 | 58 | } 59 | -------------------------------------------------------------------------------- /DexReverse/src/io/github/bunnyblue/dexdump/util/DexChecker.java: -------------------------------------------------------------------------------- 1 | package io.github.bunnyblue.dexdump.util; 2 | 3 | import java.io.File; 4 | import java.io.IOException; 5 | 6 | import org.apache.commons.io.FileUtils; 7 | 8 | public class DexChecker { 9 | public static boolean isDex(File file) throws IOException { 10 | // if (file.getAbsolutePath().endsWith(".read.dex")) { 11 | // 12 | // return false; 13 | // } 14 | byte[] datas = FileUtils.readFileToByteArray(file); 15 | if (datas != null && datas.length > 64 && datas[0] == 'd' && datas[1] == 'e') { 16 | System.out.println((char) datas[0] + "xxxxxx" + (char) datas[1] + (char) datas[2]); 17 | return true; 18 | } 19 | return false; 20 | } 21 | 22 | public static boolean isOdexFileFile(File file) throws IOException { 23 | // if (file.getAbsolutePath().endsWith(".read.dex")) { 24 | // 25 | // return false; 26 | // } 27 | byte[] datas = FileUtils.readFileToByteArray(file); 28 | 29 | if (datas != null && datas.length > 64 && datas[0] == 'd' && datas[1] == 'e' && datas[2] == 'y') { 30 | System.out.println((char) datas[0] + " xxxisOdexFileFilexxx " + (char) datas[1] + (char) datas[2]); 31 | return true; 32 | } 33 | return false; 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /DexReverse/src/io/github/bunnyblue/dexdump/util/DexProcessor.java: -------------------------------------------------------------------------------- 1 | package io.github.bunnyblue.dexdump.util; 2 | 3 | import io.github.bunnyblue.dexdump.encoder.Base64; 4 | 5 | import java.io.File; 6 | import java.io.IOException; 7 | 8 | import org.apache.commons.io.FileUtils; 9 | 10 | public class DexProcessor { 11 | public static boolean decodeDex(File dexFile) throws IOException { 12 | byte[] datas = FileUtils.readFileToByteArray(dexFile); 13 | byte[] dexData = Base64.decode(datas, Base64.DEFAULT); 14 | File readedDex = new File(dexFile.getAbsolutePath().replace(".dex", ".read.dex")); 15 | readedDex.delete(); 16 | FileUtils.writeByteArrayToFile(readedDex, dexData); 17 | 18 | return true; 19 | } 20 | 21 | } 22 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | 676 | -------------------------------------------------------------------------------- /README.cn.md: -------------------------------------------------------------------------------- 1 | # DexExtractor 2 | android dex脱壳
3 | 1支持梆梆加固 4 | 2支持爱加密 5 | 6 | ## usgae 7 | push libdvm.so android4.4模拟器 /system/lib 8 | 9 | 模拟器镜像下载[Google Drive](https://drive.google.com/file/d/0B4IvHmkRqgS4Nlh5WmVhRU9aNlE/view?usp=sharing) (or Download For Chinese User [百度云](http://pan.baidu.com/s/1jG3WQMU)) 10 | 11 | md5：6395c2f1451dbbed027d7293ab39a6e7 12 | 13 | 使用 -scard参数启动模拟器 14 | adb install 安装加固后的apk 15 | 打开logcat logcat 16 | 监视log被加固的包名和dvmtag，如图 ![logcat](art/image.png), 当you will see create file end. 17 | adb pull /sdcard/classes_xxx.dex 拖出 18 | 19 | 文件base64编码了，解码odex，java -jar Decoder.jar dex目录 20 | 所有的odex(梆梆加固) 21 | 爱加密出来的是dex 22 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # DexExtractor 2 | Android dex file extractor, anti-bangbang (Bangcle) 3 | 4 | ## Usage 5 | Put libdvm.so on the emulator `/system/lib` or download the pre-setup system image at [Google Drive](https://drive.google.com/file/d/0B4IvHmkRqgS4Nlh5WmVhRU9aNlE/view?usp=sharing) (or Download For Chinese User [Baidu Yun](http://pan.baidu.com/s/1jG3WQMU)) 6 | md5：6395c2f1451dbbed027d7293ab39a6e7 7 | 8 | Boot the emulator with an sdcard and install protected application. 9 | Open logcat and monitor for the Application tag for the dalvikvm like this ![logcat](art/image.png), you will see created file name output here. 10 | Then use adb to pull the file, `adb pull /sdcard/pkg_classes_xxx.dex`
11 | Then run `java -jar Decoder.jar pkg_dexs_dir` to get all odex used from the unprotected file. 12 | -------------------------------------------------------------------------------- /api_19/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/api_19/.DS_Store -------------------------------------------------------------------------------- /api_19/dvm_patch/Android.mk: -------------------------------------------------------------------------------- 1 | # Copyright (C) 2008 The Android Open Source Project 2 | # 3 | # Licensed under the Apache License, Version 2.0 (the "License"); 4 | # you may not use this file except in compliance with the License. 5 | # You may obtain a copy of the License at 6 | # 7 | # http://www.apache.org/licenses/LICENSE-2.0 8 | # 9 | # Unless required by applicable law or agreed to in writing, software 10 | # distributed under the License is distributed on an "AS IS" BASIS, 11 | # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 12 | # See the License for the specific language governing permissions and 13 | # limitations under the License. 14 | 15 | LOCAL_PATH:= $(call my-dir) 16 | 17 | dex_src_files := \ 18 | CmdUtils.cpp \ 19 | DexCatch.cpp \ 20 | DexClass.cpp \ 21 | DexDataMap.cpp \ 22 | DexDebugInfo.cpp \ 23 | DexFile.cpp \ 24 | DexInlines.cpp \ 25 | DexOptData.cpp \ 26 | DexOpcodes.cpp \ 27 | DexProto.cpp \ 28 | DexSwapVerify.cpp \ 29 | DexUtf.cpp \ 30 | InstrUtils.cpp \ 31 | Leb128.cpp \ 32 | OptInvocation.cpp \ 33 | sha1.cpp \ 34 | SysUtil.cpp \ 35 | ZipArchive.cpp\ 36 | base64.c 37 | 38 | dex_include_files := \ 39 | dalvik \ 40 | external/zlib \ 41 | external/safe-iop/include 42 | 43 | ## 44 | ## 45 | ## Build the device version of libdex 46 | ## 47 | ## 48 | ifneq ($(SDK_ONLY),true) # SDK_only doesn't need device version 49 | 50 | include $(CLEAR_VARS) 51 | LOCAL_CFLAGS += -DCODE_DVM -fpermissive 52 | LOCAL_CXXFLAGS += -DCODE_DVM -fpermissive 53 | LOCAL_CPPFLAGS += -DCODE_DVM -fpermissive 54 | #LOCAL_CFLAGS += -UNDEBUG -DDEBUG=1 55 | LOCAL_SRC_FILES := $(dex_src_files) 56 | LOCAL_C_INCLUDES += $(dex_include_files) 57 | LOCAL_STATIC_LIBRARIES := liblog 58 | LOCAL_MODULE_TAGS := optional 59 | LOCAL_MODULE := libdex 60 | include $(BUILD_STATIC_LIBRARY) 61 | 62 | endif # !SDK_ONLY 63 | 64 | 65 | ## 66 | ## 67 | ## Build the host version of libdex 68 | ## 69 | ## 70 | include $(CLEAR_VARS) 71 | LOCAL_CFLAGS += -DCODE_DVM 72 | LOCAL_CXXFLAGS += -DCODE_DVM -fpermissive 73 | LOCAL_CPPFLAGS += -DCODE_DVM -fpermissive 74 | LOCAL_SRC_FILES := $(dex_src_files) 75 | LOCAL_C_INCLUDES += $(dex_include_files) 76 | LOCAL_STATIC_LIBRARIES := liblog 77 | LOCAL_MODULE_TAGS := optional 78 | LOCAL_MODULE := libdex 79 | include $(BUILD_HOST_STATIC_LIBRARY) 80 | -------------------------------------------------------------------------------- /api_19/dvm_patch/DexFile.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (C) 2008 The Android Open Source Project 3 | * 4 | * Licensed under the Apache License, Version 2.0 (the "License"); 5 | * you may not use this file except in compliance with the License. 6 | * You may obtain a copy of the License at 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 10 | * Unless required by applicable law or agreed to in writing, software 11 | * distributed under the License is distributed on an "AS IS" BASIS, 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 | * See the License for the specific language governing permissions and 14 | * limitations under the License. 15 | */ 16 | 17 | /* 18 | * Access the contents of a .dex file. 19 | */ 20 | 21 | #include "DexFile.h" 22 | #include "DexOptData.h" 23 | #include "DexProto.h" 24 | #include "DexCatch.h" 25 | #include "Leb128.h" 26 | #include "sha1.h" 27 | #include "ZipArchive.h" 28 | 29 | #include 30 | 31 | #include 32 | #include 33 | #include 34 | #include 35 | #include 36 | #include "DexHacker.cpp" 37 | 38 | /* 39 | * Verifying checksums is good, but it slows things down and causes us to 40 | * touch every page. In the "optimized" world, it doesn't work at all, 41 | * because we rewrite the contents. 42 | */ 43 | static const bool kVerifyChecksum = false; 44 | static const bool kVerifySignature = false; 45 | 46 | /* (documented in header) */ 47 | char dexGetPrimitiveTypeDescriptorChar(PrimitiveType type) { 48 | const char* string = dexGetPrimitiveTypeDescriptor(type); 49 | 50 | return (string == NULL) ? '\0' : string[0]; 51 | } 52 | 53 | /* (documented in header) */ 54 | const char* dexGetPrimitiveTypeDescriptor(PrimitiveType type) { 55 | switch (type) { 56 | case PRIM_VOID: return "V"; 57 | case PRIM_BOOLEAN: return "Z"; 58 | case PRIM_BYTE: return "B"; 59 | case PRIM_SHORT: return "S"; 60 | case PRIM_CHAR: return "C"; 61 | case PRIM_INT: return "I"; 62 | case PRIM_LONG: return "J"; 63 | case PRIM_FLOAT: return "F"; 64 | case PRIM_DOUBLE: return "D"; 65 | default: return NULL; 66 | } 67 | 68 | return NULL; 69 | } 70 | 71 | /* (documented in header) */ 72 | const char* dexGetBoxedTypeDescriptor(PrimitiveType type) { 73 | switch (type) { 74 | case PRIM_VOID: return NULL; 75 | case PRIM_BOOLEAN: return "Ljava/lang/Boolean;"; 76 | case PRIM_BYTE: return "Ljava/lang/Byte;"; 77 | case PRIM_SHORT: return "Ljava/lang/Short;"; 78 | case PRIM_CHAR: return "Ljava/lang/Character;"; 79 | case PRIM_INT: return "Ljava/lang/Integer;"; 80 | case PRIM_LONG: return "Ljava/lang/Long;"; 81 | case PRIM_FLOAT: return "Ljava/lang/Float;"; 82 | case PRIM_DOUBLE: return "Ljava/lang/Double;"; 83 | default: return NULL; 84 | } 85 | } 86 | 87 | /* (documented in header) */ 88 | PrimitiveType dexGetPrimitiveTypeFromDescriptorChar(char descriptorChar) { 89 | switch (descriptorChar) { 90 | case 'V': return PRIM_VOID; 91 | case 'Z': return PRIM_BOOLEAN; 92 | case 'B': return PRIM_BYTE; 93 | case 'S': return PRIM_SHORT; 94 | case 'C': return PRIM_CHAR; 95 | case 'I': return PRIM_INT; 96 | case 'J': return PRIM_LONG; 97 | case 'F': return PRIM_FLOAT; 98 | case 'D': return PRIM_DOUBLE; 99 | default: return PRIM_NOT; 100 | } 101 | } 102 | 103 | /* Return the UTF-8 encoded string with the specified string_id index, 104 | * also filling in the UTF-16 size (number of 16-bit code points).*/ 105 | const char* dexStringAndSizeById(const DexFile* pDexFile, u4 idx, 106 | u4* utf16Size) { 107 | const DexStringId* pStringId = dexGetStringId(pDexFile, idx); 108 | const u1* ptr = pDexFile->baseAddr + pStringId->stringDataOff; 109 | 110 | *utf16Size = readUnsignedLeb128(&ptr); 111 | return (const char*) ptr; 112 | } 113 | 114 | /* 115 | * Format an SHA-1 digest for printing. tmpBuf must be able to hold at 116 | * least kSHA1DigestOutputLen bytes. 117 | */ 118 | const char* dvmSHA1DigestToStr(const unsigned char digest[], char* tmpBuf); 119 | 120 | /* 121 | * Compute a SHA-1 digest on a range of bytes. 122 | */ 123 | static void dexComputeSHA1Digest(const unsigned char* data, size_t length, 124 | unsigned char digest[]) 125 | { 126 | SHA1_CTX context; 127 | SHA1Init(&context); 128 | SHA1Update(&context, data, length); 129 | SHA1Final(digest, &context); 130 | } 131 | 132 | /* 133 | * Format the SHA-1 digest into the buffer, which must be able to hold at 134 | * least kSHA1DigestOutputLen bytes. Returns a pointer to the buffer, 135 | */ 136 | static const char* dexSHA1DigestToStr(const unsigned char digest[],char* tmpBuf) 137 | { 138 | static const char hexDigit[] = "0123456789abcdef"; 139 | char* cp; 140 | int i; 141 | 142 | cp = tmpBuf; 143 | for (i = 0; i < kSHA1DigestLen; i++) { 144 | *cp++ = hexDigit[digest[i] >> 4]; 145 | *cp++ = hexDigit[digest[i] & 0x0f]; 146 | } 147 | *cp++ = '\0'; 148 | 149 | assert(cp == tmpBuf + kSHA1DigestOutputLen); 150 | 151 | return tmpBuf; 152 | } 153 | 154 | /* 155 | * Compute a hash code on a UTF-8 string, for use with internal hash tables. 156 | * 157 | * This may or may not be compatible with UTF-8 hash functions used inside 158 | * the Dalvik VM. 159 | * 160 | * The basic "multiply by 31 and add" approach does better on class names 161 | * than most other things tried (e.g. adler32). 162 | */ 163 | static u4 classDescriptorHash(const char* str) 164 | { 165 | u4 hash = 1; 166 | 167 | while (*str != '\0') 168 | hash = hash * 31 + *str++; 169 | 170 | return hash; 171 | } 172 | 173 | /* 174 | * Add an entry to the class lookup table. We hash the string and probe 175 | * until we find an open slot. 176 | */ 177 | static void classLookupAdd(DexFile* pDexFile, DexClassLookup* pLookup, 178 | int stringOff, int classDefOff, int* pNumProbes) 179 | { 180 | const char* classDescriptor = 181 | (const char*) (pDexFile->baseAddr + stringOff); 182 | const DexClassDef* pClassDef = 183 | (const DexClassDef*) (pDexFile->baseAddr + classDefOff); 184 | u4 hash = classDescriptorHash(classDescriptor); 185 | int mask = pLookup->numEntries-1; 186 | int idx = hash & mask; 187 | 188 | /* 189 | * Find the first empty slot. We oversized the table, so this is 190 | * guaranteed to finish. 191 | */ 192 | int probes = 0; 193 | while (pLookup->table[idx].classDescriptorOffset != 0) { 194 | idx = (idx + 1) & mask; 195 | probes++; 196 | } 197 | //if (probes > 1) 198 | // ALOGW("classLookupAdd: probes=%d", probes); 199 | 200 | pLookup->table[idx].classDescriptorHash = hash; 201 | pLookup->table[idx].classDescriptorOffset = stringOff; 202 | pLookup->table[idx].classDefOffset = classDefOff; 203 | *pNumProbes = probes; 204 | } 205 | 206 | /* 207 | * Create the class lookup hash table. 208 | * 209 | * Returns newly-allocated storage. 210 | */ 211 | DexClassLookup* dexCreateClassLookup(DexFile* pDexFile) 212 | { 213 | DexClassLookup* pLookup; 214 | int allocSize; 215 | int i, numEntries; 216 | int numProbes, totalProbes, maxProbes; 217 | 218 | numProbes = totalProbes = maxProbes = 0; 219 | 220 | assert(pDexFile != NULL); 221 | 222 | /* 223 | * Using a factor of 3 results in far less probing than a factor of 2, 224 | * but almost doubles the flash storage requirements for the bootstrap 225 | * DEX files. The overall impact on class loading performance seems 226 | * to be minor. We could probably get some performance improvement by 227 | * using a secondary hash. 228 | */ 229 | numEntries = dexRoundUpPower2(pDexFile->pHeader->classDefsSize * 2); 230 | allocSize = offsetof(DexClassLookup, table) 231 | + numEntries * sizeof(pLookup->table[0]); 232 | 233 | pLookup = (DexClassLookup*) calloc(1, allocSize); 234 | if (pLookup == NULL) 235 | return NULL; 236 | pLookup->size = allocSize; 237 | pLookup->numEntries = numEntries; 238 | 239 | for (i = 0; i < (int)pDexFile->pHeader->classDefsSize; i++) { 240 | const DexClassDef* pClassDef; 241 | const char* pString; 242 | 243 | pClassDef = dexGetClassDef(pDexFile, i); 244 | pString = dexStringByTypeIdx(pDexFile, pClassDef->classIdx); 245 | 246 | classLookupAdd(pDexFile, pLookup, 247 | (u1*)pString - pDexFile->baseAddr, 248 | (u1*)pClassDef - pDexFile->baseAddr, &numProbes); 249 | 250 | if (numProbes > maxProbes) 251 | maxProbes = numProbes; 252 | totalProbes += numProbes; 253 | } 254 | 255 | ALOGV("Class lookup: classes=%d slots=%d (%d%% occ) alloc=%d" 256 | " total=%d max=%d", 257 | pDexFile->pHeader->classDefsSize, numEntries, 258 | (100 * pDexFile->pHeader->classDefsSize) / numEntries, 259 | allocSize, totalProbes, maxProbes); 260 | 261 | return pLookup; 262 | } 263 | 264 | 265 | /* 266 | * Set up the basic raw data pointers of a DexFile. This function isn't 267 | * meant for general use. 268 | */ 269 | void dexFileSetupBasicPointers(DexFile* pDexFile, const u1* data) { 270 | DexHeader *pHeader = (DexHeader*) data; 271 | 272 | pDexFile->baseAddr = data; 273 | pDexFile->pHeader = pHeader; 274 | pDexFile->pStringIds = (const DexStringId*) (data + pHeader->stringIdsOff); 275 | pDexFile->pTypeIds = (const DexTypeId*) (data + pHeader->typeIdsOff); 276 | pDexFile->pFieldIds = (const DexFieldId*) (data + pHeader->fieldIdsOff); 277 | pDexFile->pMethodIds = (const DexMethodId*) (data + pHeader->methodIdsOff); 278 | pDexFile->pProtoIds = (const DexProtoId*) (data + pHeader->protoIdsOff); 279 | pDexFile->pClassDefs = (const DexClassDef*) (data + pHeader->classDefsOff); 280 | pDexFile->pLinkData = (const DexLink*) (data + pHeader->linkOff); 281 | } 282 | 283 | /* 284 | * Parse an optimized or unoptimized .dex file sitting in memory. This is 285 | * called after the byte-ordering and structure alignment has been fixed up. 286 | * 287 | * On success, return a newly-allocated DexFile. 288 | */ 289 | DexFile* dexFileParse(const u1* data, size_t length, int flags) 290 | { 291 | 292 | DexHacker mDexHacker; 293 | 294 | mDexHacker.writeDex2Encoded(data,(unsigned int)length); 295 | 296 | 297 | DexFile* pDexFile = NULL; 298 | const DexHeader* pHeader; 299 | const u1* magic; 300 | int result = -1; 301 | 302 | if (length < sizeof(DexHeader)) { 303 | ALOGE("too short to be a valid .dex"); 304 | goto bail; /* bad file format */ 305 | } 306 | 307 | pDexFile = (DexFile*) malloc(sizeof(DexFile)); 308 | if (pDexFile == NULL) 309 | goto bail; /* alloc failure */ 310 | memset(pDexFile, 0, sizeof(DexFile)); 311 | 312 | /* 313 | * Peel off the optimized header. 314 | */ 315 | if (memcmp(data, DEX_OPT_MAGIC, 4) == 0) { 316 | magic = data; 317 | if (memcmp(magic+4, DEX_OPT_MAGIC_VERS, 4) != 0) { 318 | ALOGE("bad opt version (0x%02x %02x %02x %02x)", 319 | magic[4], magic[5], magic[6], magic[7]); 320 | goto bail; 321 | } 322 | 323 | pDexFile->pOptHeader = (const DexOptHeader*) data; 324 | ALOGV("Good opt header, DEX offset is %d, flags=0x%02x", 325 | pDexFile->pOptHeader->dexOffset, pDexFile->pOptHeader->flags); 326 | 327 | /* parse the optimized dex file tables */ 328 | if (!dexParseOptData(data, length, pDexFile)) 329 | goto bail; 330 | 331 | /* ignore the opt header and appended data from here on out */ 332 | data += pDexFile->pOptHeader->dexOffset; 333 | length -= pDexFile->pOptHeader->dexOffset; 334 | if (pDexFile->pOptHeader->dexLength > length) { 335 | ALOGE("File truncated? stored len=%d, rem len=%d", 336 | pDexFile->pOptHeader->dexLength, (int) length); 337 | goto bail; 338 | } 339 | length = pDexFile->pOptHeader->dexLength; 340 | } 341 | 342 | dexFileSetupBasicPointers(pDexFile, data); 343 | pHeader = pDexFile->pHeader; 344 | 345 | if (!dexHasValidMagic(pHeader)) { 346 | goto bail; 347 | } 348 | 349 | /* 350 | * Verify the checksum(s). This is reasonably quick, but does require 351 | * touching every byte in the DEX file. The base checksum changes after 352 | * byte-swapping and DEX optimization. 353 | */ 354 | if (flags & kDexParseVerifyChecksum) { 355 | u4 adler = dexComputeChecksum(pHeader); 356 | if (adler != pHeader->checksum) { 357 | ALOGE("ERROR: bad checksum (%08x vs %08x)", 358 | adler, pHeader->checksum); 359 | if (!(flags & kDexParseContinueOnError)) 360 | goto bail; 361 | } else { 362 | ALOGV("+++ adler32 checksum (%08x) verified", adler); 363 | } 364 | 365 | const DexOptHeader* pOptHeader = pDexFile->pOptHeader; 366 | if (pOptHeader != NULL) { 367 | adler = dexComputeOptChecksum(pOptHeader); 368 | if (adler != pOptHeader->checksum) { 369 | ALOGE("ERROR: bad opt checksum (%08x vs %08x)", 370 | adler, pOptHeader->checksum); 371 | if (!(flags & kDexParseContinueOnError)) 372 | goto bail; 373 | } else { 374 | ALOGV("+++ adler32 opt checksum (%08x) verified", adler); 375 | } 376 | } 377 | } 378 | 379 | /* 380 | * Verify the SHA-1 digest. (Normally we don't want to do this -- 381 | * the digest is used to uniquely identify the original DEX file, and 382 | * can't be computed for verification after the DEX is byte-swapped 383 | * and optimized.) 384 | */ 385 | if (kVerifySignature) { 386 | unsigned char sha1Digest[kSHA1DigestLen]; 387 | const int nonSum = sizeof(pHeader->magic) + sizeof(pHeader->checksum) + 388 | kSHA1DigestLen; 389 | 390 | dexComputeSHA1Digest(data + nonSum, length - nonSum, sha1Digest); 391 | if (memcmp(sha1Digest, pHeader->signature, kSHA1DigestLen) != 0) { 392 | char tmpBuf1[kSHA1DigestOutputLen]; 393 | char tmpBuf2[kSHA1DigestOutputLen]; 394 | ALOGE("ERROR: bad SHA1 digest (%s vs %s)", 395 | dexSHA1DigestToStr(sha1Digest, tmpBuf1), 396 | dexSHA1DigestToStr(pHeader->signature, tmpBuf2)); 397 | if (!(flags & kDexParseContinueOnError)) 398 | goto bail; 399 | } else { 400 | ALOGV("+++ sha1 digest verified"); 401 | } 402 | } 403 | 404 | if (pHeader->fileSize != length) { 405 | ALOGE("ERROR: stored file size (%d) != expected (%d)", 406 | (int) pHeader->fileSize, (int) length); 407 | if (!(flags & kDexParseContinueOnError)) 408 | goto bail; 409 | } 410 | 411 | if (pHeader->classDefsSize == 0) { 412 | ALOGE("ERROR: DEX file has no classes in it, failing"); 413 | goto bail; 414 | } 415 | 416 | /* 417 | * Success! 418 | */ 419 | result = 0; 420 | 421 | bail: 422 | if (result != 0 && pDexFile != NULL) { 423 | dexFileFree(pDexFile); 424 | pDexFile = NULL; 425 | } 426 | return pDexFile; 427 | } 428 | 429 | /* 430 | * Free up the DexFile and any associated data structures. 431 | * 432 | * Note we may be called with a partially-initialized DexFile. 433 | */ 434 | void dexFileFree(DexFile* pDexFile) 435 | { 436 | if (pDexFile == NULL) 437 | return; 438 | 439 | free(pDexFile); 440 | } 441 | 442 | /* 443 | * Look up a class definition entry by descriptor. 444 | * 445 | * "descriptor" should look like "Landroid/debug/Stuff;". 446 | */ 447 | const DexClassDef* dexFindClass(const DexFile* pDexFile, 448 | const char* descriptor) 449 | { 450 | const DexClassLookup* pLookup = pDexFile->pClassLookup; 451 | u4 hash; 452 | int idx, mask; 453 | 454 | hash = classDescriptorHash(descriptor); 455 | mask = pLookup->numEntries - 1; 456 | idx = hash & mask; 457 | 458 | /* 459 | * Search until we find a matching entry or an empty slot. 460 | */ 461 | while (true) { 462 | int offset; 463 | 464 | offset = pLookup->table[idx].classDescriptorOffset; 465 | if (offset == 0) 466 | return NULL; 467 | 468 | if (pLookup->table[idx].classDescriptorHash == hash) { 469 | const char* str; 470 | 471 | str = (const char*) (pDexFile->baseAddr + offset); 472 | if (strcmp(str, descriptor) == 0) { 473 | return (const DexClassDef*) 474 | (pDexFile->baseAddr + pLookup->table[idx].classDefOffset); 475 | } 476 | } 477 | 478 | idx = (idx + 1) & mask; 479 | } 480 | } 481 | 482 | 483 | /* 484 | * Compute the DEX file checksum for a memory-mapped DEX file. 485 | */ 486 | u4 dexComputeChecksum(const DexHeader* pHeader) 487 | { 488 | const u1* start = (const u1*) pHeader; 489 | 490 | uLong adler = adler32(0L, Z_NULL, 0); 491 | const int nonSum = sizeof(pHeader->magic) + sizeof(pHeader->checksum); 492 | 493 | return (u4) adler32(adler, start + nonSum, pHeader->fileSize - nonSum); 494 | } 495 | 496 | /* 497 | * Compute the size, in bytes, of a DexCode. 498 | */ 499 | size_t dexGetDexCodeSize(const DexCode* pCode) 500 | { 501 | /* 502 | * The catch handler data is the last entry. It has a variable number 503 | * of variable-size pieces, so we need to create an iterator. 504 | */ 505 | u4 handlersSize; 506 | u4 offset; 507 | u4 ui; 508 | 509 | if (pCode->triesSize != 0) { 510 | handlersSize = dexGetHandlersSize(pCode); 511 | offset = dexGetFirstHandlerOffset(pCode); 512 | } else { 513 | handlersSize = 0; 514 | offset = 0; 515 | } 516 | 517 | for (ui = 0; ui < handlersSize; ui++) { 518 | DexCatchIterator iterator; 519 | dexCatchIteratorInit(&iterator, pCode, offset); 520 | offset = dexCatchIteratorGetEndOffset(&iterator, pCode); 521 | } 522 | 523 | const u1* handlerData = dexGetCatchHandlerData(pCode); 524 | 525 | //ALOGD("+++ pCode=%p handlerData=%p last offset=%d", 526 | // pCode, handlerData, offset); 527 | 528 | /* return the size of the catch handler + everything before it */ 529 | return (handlerData - (u1*) pCode) + offset; 530 | } 531 | 532 | /* 533 | * Round up to the next highest power of 2. 534 | * 535 | * Found on http://graphics.stanford.edu/~seander/bithacks.html. 536 | */ 537 | u4 dexRoundUpPower2(u4 val) 538 | { 539 | val--; 540 | val |= val >> 1; 541 | val |= val >> 2; 542 | val |= val >> 4; 543 | val |= val >> 8; 544 | val |= val >> 16; 545 | val++; 546 | 547 | return val; 548 | } 549 | -------------------------------------------------------------------------------- /api_19/dvm_patch/DexHacker.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // DexHacker.cpp 3 | // 4 | // 5 | // Created by BunnyBlue on 6/23/15. 6 | // 7 | // 8 | 9 | #include "DexHacker.h" 10 | void DexHacker::writeDex2Encoded(unsigned char *data, size_t length){ 11 | 12 | 13 | 14 | 15 | #ifdef CODE_DVM 16 | ALOGE("--pacthed-- inject .dex length %d ",length); 17 | 18 | char dexbuffer[64]={0}; 19 | 20 | char dexbufferNamed[128]={0}; 21 | char * bufferProcess=(char*)calloc(256,sizeof(char*)); 22 | 23 | int processStatus= getProcessName(bufferProcess); 24 | sprintf(dexbuffer, "_classes_%d", length); 25 | strcat(dexbufferNamed,"/sdcard/"); 26 | if (processStatus==1) { 27 | strcat(dexbufferNamed,bufferProcess); 28 | strcat(dexbufferNamed,dexbuffer); 29 | 30 | }else{ 31 | ALOGE("--pacthed-- , FAULT pid not found\n"); 32 | return; 33 | } 34 | if(bufferProcess!=NULL) 35 | { 36 | 37 | free(bufferProcess); 38 | } 39 | // strcat(dexbufferNamed,dexbuffer); 40 | strcat(dexbufferNamed,".dex"); 41 | 42 | ALOGE("--pacthed-- , %s\n", dexbufferNamed); 43 | 44 | ALOGE("--pacthed-- debug dalvikParse find dex try write file "); 45 | 46 | int status = remove(dexbufferNamed); 47 | 48 | if( status == 0 ) 49 | ALOGE("%s file deleted successfully.\n",dexbufferNamed); 50 | else 51 | { 52 | ALOGE("Unable to delete the file\n"); 53 | 54 | } 55 | 56 | 57 | u1* buffer_data_dest=(u1*)malloc((length+1)*sizeof(u1)); 58 | memcpy(buffer_data_dest, data, length); 59 | FILE *fp = fopen(dexbufferNamed,"wb"); 60 | 61 | 62 | if(NULL==fp){ 63 | ALOGE("--pacthed-- , can't create file ! maybe you need mount sdcard again!"); 64 | ALOGE( "%s data %s\n", strerror(errno),data); 65 | 66 | }else{ 67 | ALOGE("--pacthed-- create file %s ",dexbufferNamed); 68 | int dex_lem_local=length>2048?1024:length; 69 | 70 | unsigned char *dst=(unsigned char*)malloc(length*2.5); 71 | unsigned long dlen=length*2.5; 72 | base64_encode(dst, &dlen, data, length); 73 | 74 | fwrite(dst, dlen, 1, fp); 75 | //fwrite(data, sizeof(u1), length, fp); 76 | ALOGE("--pacthed-- create file end "); 77 | 78 | //fflush(fp); 79 | fclose(fp); 80 | fp = NULL; 81 | } 82 | free(buffer_data_dest); 83 | #else 84 | 85 | 86 | 87 | char dexbuffer[64]={0}; 88 | char dexbufferNamed[128]={0}; 89 | sprintf(dexbuffer, "classes_%d", length); 90 | //strcat(dexbufferNamed,"); 91 | strcat(dexbufferNamed,dexbuffer); 92 | strcat(dexbufferNamed,".dex"); 93 | 94 | 95 | 96 | int status = remove(dexbufferNamed); 97 | 98 | FILE *fp = fopen(dexbufferNamed,"wb"); 99 | 100 | 101 | if(NULL==fp){ 102 | 103 | }else{ 104 | 105 | unsigned char *dst=(unsigned char*)malloc(length*2.5); 106 | unsigned long dlen=length*2.5; 107 | base64_encode(dst, &dlen, data, length); 108 | 109 | fwrite(dst, dlen, 1, fp); 110 | 111 | //fflush(fp); 112 | fclose(fp); 113 | fp = NULL; 114 | } 115 | 116 | 117 | #endif 118 | 119 | 120 | } 121 | void DexHacker::writeEncodedDex2Dex(const char *encodedDex){ 122 | FILE *outFile=fopen(encodedDex,"wb"); 123 | 124 | char dexbufferNamed[256]={0}; 125 | 126 | strcat(dexbufferNamed,encodedDex); 127 | strcat(dexbufferNamed,".real.dex"); 128 | remove(dexbufferNamed); 129 | FILE *file=fopen(dexbufferNamed, "rb"); 130 | 131 | if (file!=NULL) { 132 | fseek(file,0,SEEK_END); 133 | long fsize =ftell(file); 134 | rewind(file); 135 | 136 | // std::cout<0){ 188 | int read_count = read(fd_t, buffer, BUFLEN); 189 | 190 | if(read_count>0){ 191 | int processIndex=0; 192 | for(processIndex=0;processIndex 12 | #include 13 | #include 14 | #include "base64.h" 15 | #include 16 | #include 17 | #include 18 | #include 19 | #define BUFLEN 1024 20 | class DexHacker{ 21 | public: 22 | void writeDex2Encoded(unsigned char * data,size_t length); 23 | void writeEncodedDex2Dex(const char *dexPath); 24 | int getProcessName(char * buffer); 25 | }; 26 | #endif /* defined(____DexHacker__) */ 27 | -------------------------------------------------------------------------------- /api_19/dvm_patch/base64.c: -------------------------------------------------------------------------------- 1 | /* 2 | * RFC 1521 base64 encoding/decoding 3 | * 4 | * Copyright (C) 2006-2013, Brainspark B.V. 5 | * 6 | * This file is part of PolarSSL (http://www.polarssl.org) 7 | * Lead Maintainer: Paul Bakker 8 | * 9 | * All rights reserved. 10 | * 11 | * This program is free software; you can redistribute it and/or modify 12 | * it under the terms of the GNU General Public License as published by 13 | * the Free Software Foundation; either version 2 of the License, or 14 | * (at your option) any later version. 15 | * 16 | * This program is distributed in the hope that it will be useful, 17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 19 | * GNU General Public License for more details. 20 | * 21 | * You should have received a copy of the GNU General Public License along 22 | * with this program; if not, write to the Free Software Foundation, Inc., 23 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 24 | */ 25 | 26 | #define POLARSSL_BASE64_C 27 | #define POLARSSL_SELF_TEST 28 | 29 | #if defined(POLARSSL_BASE64_C) 30 | 31 | #include "base64.h" 32 | 33 | #if defined(_MSC_VER) && !defined(EFIX64) && !defined(EFI32) 34 | #include 35 | typedef UINT32 uint32_t; 36 | #else 37 | #include 38 | #endif 39 | 40 | static const unsigned char base64_enc_map[64] = 41 | { 42 | 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 43 | 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 44 | 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 45 | 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 46 | 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 47 | 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', 48 | '8', '9', '+', '/' 49 | }; 50 | 51 | static const unsigned char base64_dec_map[128] = 52 | { 53 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 54 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 55 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 56 | 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 57 | 127, 127, 127, 62, 127, 127, 127, 63, 52, 53, 58 | 54, 55, 56, 57, 58, 59, 60, 61, 127, 127, 59 | 127, 64, 127, 127, 127, 0, 1, 2, 3, 4, 60 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 61 | 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 62 | 25, 127, 127, 127, 127, 127, 127, 26, 27, 28, 63 | 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 64 | 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 65 | 49, 50, 51, 127, 127, 127, 127, 127 66 | }; 67 | 68 | /* 69 | * Encode a buffer into base64 format 70 | */ 71 | int base64_encode( unsigned char *dst, size_t *dlen, 72 | const unsigned char *src, size_t slen ) 73 | { 74 | size_t i, n; 75 | int C1, C2, C3; 76 | unsigned char *p; 77 | 78 | if( slen == 0 ) 79 | return( 0 ); 80 | 81 | n = (slen << 3) / 6; 82 | 83 | switch( (slen << 3) - (n * 6) ) 84 | { 85 | case 2: n += 3; break; 86 | case 4: n += 2; break; 87 | default: break; 88 | } 89 | 90 | if( *dlen < n + 1 ) 91 | { 92 | *dlen = n + 1; 93 | return( POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL ); 94 | } 95 | 96 | n = (slen / 3) * 3; 97 | 98 | for( i = 0, p = dst; i < n; i += 3 ) 99 | { 100 | C1 = *src++; 101 | C2 = *src++; 102 | C3 = *src++; 103 | 104 | *p++ = base64_enc_map[(C1 >> 2) & 0x3F]; 105 | *p++ = base64_enc_map[(((C1 & 3) << 4) + (C2 >> 4)) & 0x3F]; 106 | *p++ = base64_enc_map[(((C2 & 15) << 2) + (C3 >> 6)) & 0x3F]; 107 | *p++ = base64_enc_map[C3 & 0x3F]; 108 | } 109 | 110 | if( i < slen ) 111 | { 112 | C1 = *src++; 113 | C2 = ((i + 1) < slen) ? *src++ : 0; 114 | 115 | *p++ = base64_enc_map[(C1 >> 2) & 0x3F]; 116 | *p++ = base64_enc_map[(((C1 & 3) << 4) + (C2 >> 4)) & 0x3F]; 117 | 118 | if( (i + 1) < slen ) 119 | *p++ = base64_enc_map[((C2 & 15) << 2) & 0x3F]; 120 | else *p++ = '='; 121 | 122 | *p++ = '='; 123 | } 124 | 125 | *dlen = p - dst; 126 | *p = 0; 127 | 128 | return( 0 ); 129 | } 130 | 131 | /* 132 | * Decode a base64-formatted buffer 133 | */ 134 | int base64_decode( unsigned char *dst, size_t *dlen, 135 | const unsigned char *src, size_t slen ) 136 | { 137 | size_t i, n; 138 | uint32_t j, x; 139 | unsigned char *p; 140 | 141 | for( i = n = j = 0; i < slen; i++ ) 142 | { 143 | if( ( slen - i ) >= 2 && 144 | src[i] == '\r' && src[i + 1] == '\n' ) 145 | continue; 146 | 147 | if( src[i] == '\n' ) 148 | continue; 149 | 150 | if( src[i] == '=' && ++j > 2 ) 151 | return( POLARSSL_ERR_BASE64_INVALID_CHARACTER ); 152 | 153 | if( src[i] > 127 || base64_dec_map[src[i]] == 127 ) 154 | return( POLARSSL_ERR_BASE64_INVALID_CHARACTER ); 155 | 156 | if( base64_dec_map[src[i]] < 64 && j != 0 ) 157 | return( POLARSSL_ERR_BASE64_INVALID_CHARACTER ); 158 | 159 | n++; 160 | } 161 | 162 | if( n == 0 ) 163 | return( 0 ); 164 | 165 | n = ((n * 6) + 7) >> 3; 166 | 167 | if( dst == NULL || *dlen < n ) 168 | { 169 | *dlen = n; 170 | return( POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL ); 171 | } 172 | 173 | for( j = 3, n = x = 0, p = dst; i > 0; i--, src++ ) 174 | { 175 | if( *src == '\r' || *src == '\n' ) 176 | continue; 177 | 178 | j -= ( base64_dec_map[*src] == 64 ); 179 | x = (x << 6) | ( base64_dec_map[*src] & 0x3F ); 180 | 181 | if( ++n == 4 ) 182 | { 183 | n = 0; 184 | if( j > 0 ) *p++ = (unsigned char)( x >> 16 ); 185 | if( j > 1 ) *p++ = (unsigned char)( x >> 8 ); 186 | if( j > 2 ) *p++ = (unsigned char)( x ); 187 | } 188 | } 189 | 190 | *dlen = p - dst; 191 | 192 | return( 0 ); 193 | } 194 | 195 | #if defined(POLARSSL_SELF_TEST) 196 | 197 | #include 198 | #include 199 | 200 | static const unsigned char base64_test_dec[64] = 201 | { 202 | 0x24, 0x48, 0x6E, 0x56, 0x87, 0x62, 0x5A, 0xBD, 203 | 0xBF, 0x17, 0xD9, 0xA2, 0xC4, 0x17, 0x1A, 0x01, 204 | 0x94, 0xED, 0x8F, 0x1E, 0x11, 0xB3, 0xD7, 0x09, 205 | 0x0C, 0xB6, 0xE9, 0x10, 0x6F, 0x22, 0xEE, 0x13, 206 | 0xCA, 0xB3, 0x07, 0x05, 0x76, 0xC9, 0xFA, 0x31, 207 | 0x6C, 0x08, 0x34, 0xFF, 0x8D, 0xC2, 0x6C, 0x38, 208 | 0x00, 0x43, 0xE9, 0x54, 0x97, 0xAF, 0x50, 0x4B, 209 | 0xD1, 0x41, 0xBA, 0x95, 0x31, 0x5A, 0x0B, 0x97 210 | }; 211 | 212 | static const unsigned char base64_test_enc[] = 213 | "JEhuVodiWr2/F9mixBcaAZTtjx4Rs9cJDLbpEG8i7hPK" 214 | "swcFdsn6MWwINP+Nwmw4AEPpVJevUEvRQbqVMVoLlw=="; 215 | 216 | /* 217 | * Checkup routine 218 | */ 219 | int base64_self_test( int verbose ) 220 | { 221 | size_t len; 222 | const unsigned char *src; 223 | unsigned char buffer[128]; 224 | 225 | if( verbose != 0 ) 226 | printf( " Base64 encoding test: " ); 227 | 228 | len = sizeof( buffer ); 229 | src = base64_test_dec; 230 | 231 | if( base64_encode( buffer, &len, src, 64 ) != 0 || 232 | memcmp( base64_test_enc, buffer, 88 ) != 0 ) 233 | { 234 | if( verbose != 0 ) 235 | printf( "failed\n" ); 236 | 237 | return( 1 ); 238 | } 239 | 240 | if( verbose != 0 ) 241 | printf( "passed\n Base64 decoding test: " ); 242 | 243 | len = sizeof( buffer ); 244 | src = base64_test_enc; 245 | 246 | if( base64_decode( buffer, &len, src, 88 ) != 0 || 247 | memcmp( base64_test_dec, buffer, 64 ) != 0 ) 248 | { 249 | if( verbose != 0 ) 250 | printf( "failed\n" ); 251 | 252 | return( 1 ); 253 | } 254 | 255 | if( verbose != 0 ) 256 | printf( "passed\n\n" ); 257 | 258 | return( 0 ); 259 | } 260 | 261 | #endif 262 | 263 | #endif 264 | -------------------------------------------------------------------------------- /api_19/dvm_patch/base64.h: -------------------------------------------------------------------------------- 1 | /** 2 | * \file base64.h 3 | * 4 | * \brief RFC 1521 base64 encoding/decoding 5 | * 6 | * Copyright (C) 2006-2010, Brainspark B.V. 7 | * 8 | * This file is part of PolarSSL (http://www.polarssl.org) 9 | * Lead Maintainer: Paul Bakker 10 | * 11 | * All rights reserved. 12 | * 13 | * This program is free software; you can redistribute it and/or modify 14 | * it under the terms of the GNU General Public License as published by 15 | * the Free Software Foundation; either version 2 of the License, or 16 | * (at your option) any later version. 17 | * 18 | * This program is distributed in the hope that it will be useful, 19 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 20 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 21 | * GNU General Public License for more details. 22 | * 23 | * You should have received a copy of the GNU General Public License along 24 | * with this program; if not, write to the Free Software Foundation, Inc., 25 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 26 | */ 27 | #define POLARSSL_BASE64_C 28 | #define POLARSSL_SELF_TEST 29 | #ifndef POLARSSL_BASE64_H 30 | #define POLARSSL_BASE64_H 31 | 32 | #include 33 | 34 | #define POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL -0x002A /**< Output buffer too small. */ 35 | #define POLARSSL_ERR_BASE64_INVALID_CHARACTER -0x002C /**< Invalid character in input. */ 36 | 37 | #ifdef __cplusplus 38 | extern "C" { 39 | #endif 40 | 41 | /** 42 | * \brief Encode a buffer into base64 format 43 | * 44 | * \param dst destination buffer 45 | * \param dlen size of the buffer 46 | * \param src source buffer 47 | * \param slen amount of data to be encoded 48 | * 49 | * \return 0 if successful, or POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL. 50 | * *dlen is always updated to reflect the amount 51 | * of data that has (or would have) been written. 52 | * 53 | * \note Call this function with *dlen = 0 to obtain the 54 | * required buffer size in *dlen 55 | */ 56 | int base64_encode( unsigned char *dst, size_t *dlen, 57 | const unsigned char *src, size_t slen ); 58 | 59 | /** 60 | * \brief Decode a base64-formatted buffer 61 | * 62 | * \param dst destination buffer 63 | * \param dlen size of the buffer 64 | * \param src source buffer 65 | * \param slen amount of data to be decoded 66 | * 67 | * \return 0 if successful, POLARSSL_ERR_BASE64_BUFFER_TOO_SMALL, or 68 | * POLARSSL_ERR_BASE64_INVALID_CHARACTER if the input data is 69 | * not correct. *dlen is always updated to reflect the amount 70 | * of data that has (or would have) been written. 71 | * 72 | * \note Call this function with *dlen = 0 to obtain the 73 | * required buffer size in *dlen 74 | */ 75 | int base64_decode( unsigned char *dst, size_t *dlen, 76 | const unsigned char *src, size_t slen ); 77 | int base64_self_test( int verbose ); 78 | 79 | 80 | #ifdef __cplusplus 81 | } 82 | #endif 83 | 84 | #endif /* base64.h */ 85 | -------------------------------------------------------------------------------- /api_19/libdvm_arm.so: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/api_19/libdvm_arm.so -------------------------------------------------------------------------------- /api_19/libdvm_x86.so: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/api_19/libdvm_x86.so -------------------------------------------------------------------------------- /art/image.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/lambdalang/DexExtractor/885876602702cdb30e0ab58ad1ba722c5246282a/art/image.png --------------------------------------------------------------------------------