├── HeapDiff ├── HeapDiff.sln ├── HeapDiff │ ├── HeapDiff.vcxproj │ ├── HeapDiff.vcxproj.filters │ └── Source.cpp └── Pintool │ └── MemHeapTool.cpp ├── LICENSE └── README.md /HeapDiff/HeapDiff.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio 14 4 | VisualStudioVersion = 14.0.24720.0 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "HeapDiff", "HeapDiff\HeapDiff.vcxproj", "{45DE9DF6-7278-412E-AB5F-05A58BB95A0C}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|x64 = Debug|x64 11 | Debug|x86 = Debug|x86 12 | Release|x64 = Release|x64 13 | Release|x86 = Release|x86 14 | EndGlobalSection 15 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 16 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Debug|x64.ActiveCfg = Debug|x64 17 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Debug|x64.Build.0 = Debug|x64 18 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Debug|x86.ActiveCfg = Debug|Win32 19 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Debug|x86.Build.0 = Debug|Win32 20 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Release|x64.ActiveCfg = Release|x64 21 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Release|x64.Build.0 = Release|x64 22 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Release|x86.ActiveCfg = Release|Win32 23 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C}.Release|x86.Build.0 = Release|Win32 24 | EndGlobalSection 25 | GlobalSection(SolutionProperties) = preSolution 26 | HideSolutionNode = FALSE 27 | EndGlobalSection 28 | EndGlobal 29 | -------------------------------------------------------------------------------- /HeapDiff/HeapDiff/HeapDiff.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 | {45DE9DF6-7278-412E-AB5F-05A58BB95A0C} 23 | Win32Proj 24 | HeapDiff 25 | 8.1 26 | 27 | 28 | 29 | Application 30 | true 31 | v140 32 | Unicode 33 | 34 | 35 | Application 36 | false 37 | v140 38 | true 39 | Unicode 40 | 41 | 42 | Application 43 | true 44 | v140 45 | Unicode 46 | 47 | 48 | Application 49 | false 50 | v140 51 | true 52 | Unicode 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | true 74 | 75 | 76 | true 77 | 78 | 79 | false 80 | 81 | 82 | false 83 | 84 | 85 | 86 | 87 | 88 | Level3 89 | Disabled 90 | WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) 91 | true 92 | 93 | 94 | Console 95 | true 96 | 97 | 98 | 99 | 100 | 101 | 102 | Level3 103 | Disabled 104 | _DEBUG;_CONSOLE;%(PreprocessorDefinitions) 105 | true 106 | 107 | 108 | Console 109 | true 110 | 111 | 112 | 113 | 114 | Level3 115 | 116 | 117 | MaxSpeed 118 | true 119 | true 120 | WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 121 | true 122 | 123 | 124 | Console 125 | true 126 | true 127 | true 128 | 129 | 130 | 131 | 132 | Level3 133 | 134 | 135 | MaxSpeed 136 | true 137 | true 138 | NDEBUG;_CONSOLE;%(PreprocessorDefinitions) 139 | true 140 | 141 | 142 | Console 143 | true 144 | true 145 | true 146 | 147 | 148 | 149 | 150 | 151 | 152 | 153 | 154 | -------------------------------------------------------------------------------- /HeapDiff/HeapDiff/HeapDiff.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;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 | -------------------------------------------------------------------------------- /HeapDiff/HeapDiff/Source.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #include 9 | #include 10 | 11 | using Byte = unsigned char; 12 | using Address = DWORD_PTR; 13 | 14 | using ByteDiff = std::pair; 15 | using AddressDiff = std::pair
; 16 | 17 | using Heap = std::set>; 18 | using HeapDiff = std::set>; 19 | using HeapDiffRange = std::set>>; 21 | 22 | using pNtSuspendProcess = NTSTATUS (NTAPI *)(HANDLE processHandle); 23 | using pNtResumeProcess = NTSTATUS (NTAPI *)(HANDLE processHandle); 24 | 25 | pNtSuspendProcess NtSuspendProcess = nullptr; 26 | pNtResumeProcess NtResumeProcess = nullptr; 27 | 28 | const HANDLE GetProcessHandle(const DWORD processId) 29 | { 30 | const DWORD flags = PROCESS_QUERY_INFORMATION | 31 | PROCESS_VM_READ | PROCESS_VM_WRITE | PROCESS_SUSPEND_RESUME; 32 | 33 | const HANDLE processHandle = OpenProcess(flags, false, processId); 34 | if (processHandle == nullptr) 35 | { 36 | fprintf(stderr, "Could not get process handle. " 37 | "Error = 0x%X\n", GetLastError()); 38 | exit(-1); 39 | } 40 | 41 | return processHandle; 42 | } 43 | 44 | const bool IsReadable(const HANDLE processHandle, const DWORD_PTR heapAddress, const size_t size) 45 | { 46 | MEMORY_BASIC_INFORMATION memInfo = { 0 }; 47 | 48 | const SIZE_T readSize = VirtualQueryEx(processHandle, (LPCVOID)heapAddress, &memInfo, size); 49 | if (readSize == 0) 50 | { 51 | fprintf(stderr, "Could not query memory region 0x%p " 52 | "Error = 0x%X", (void *)heapAddress, GetLastError()); 53 | return false; 54 | } 55 | 56 | return ((memInfo.State & MEM_COMMIT) && !(memInfo.Protect & PAGE_NOACCESS)); 57 | } 58 | 59 | void ReadHeapData(const HANDLE processHandle, const DWORD_PTR heapAddress, const size_t size, Heap &heapInfo, 60 | std::unique_ptr &heapBuffer, size_t &reserveSize) 61 | { 62 | if (size > reserveSize) 63 | { 64 | heapBuffer = std::unique_ptr(new unsigned char[size]); 65 | reserveSize = size; 66 | } 67 | 68 | SIZE_T bytesRead = 0; 69 | const BOOL success = ReadProcessMemory(processHandle, (LPCVOID)heapAddress, heapBuffer.get(), size, &bytesRead); 70 | 71 | if (success == 0) 72 | { 73 | fprintf(stderr, "Could not read process memory at 0x%p " 74 | "Error = 0x%X\n", (void *)heapAddress, GetLastError()); 75 | return; 76 | } 77 | if (bytesRead != size) 78 | { 79 | fprintf(stderr, "Could not read process all memory at 0x%p " 80 | "Error = 0x%X\n", (void *)heapAddress, GetLastError()); 81 | return; 82 | } 83 | 84 | for (size_t i = 0; i < size; ++i) 85 | { 86 | heapInfo.emplace_hint(std::end(heapInfo), std::make_pair((heapAddress + i), heapBuffer[i])); 87 | } 88 | } 89 | 90 | const Heap EnumerateProcessHeap(const DWORD processId, const HANDLE processHandle) 91 | { 92 | HANDLE snapshot = CreateToolhelp32Snapshot(TH32CS_SNAPHEAPLIST, processId); 93 | if (snapshot == INVALID_HANDLE_VALUE) 94 | { 95 | fprintf(stderr, "Could not create toolhelp snapshot. " 96 | "Error = 0x%X\n", GetLastError()); 97 | exit(-1); 98 | } 99 | 100 | Heap processHeapInfo; 101 | 102 | (void)NtSuspendProcess(processHandle); 103 | 104 | size_t reserveSize = 4096; 105 | std::unique_ptr heapBuffer(new unsigned char[reserveSize]); 106 | 107 | HEAPLIST32 heapList = { 0 }; 108 | heapList.dwSize = sizeof(HEAPLIST32); 109 | if (Heap32ListFirst(snapshot, &heapList)) 110 | { 111 | do 112 | { 113 | HEAPENTRY32 heapEntry = { 0 }; 114 | heapEntry.dwSize = sizeof(HEAPENTRY32); 115 | 116 | if (Heap32First(&heapEntry, processId, heapList.th32HeapID)) 117 | { 118 | do 119 | { 120 | if (IsReadable(processHandle, heapEntry.dwAddress, heapEntry.dwSize)) 121 | { 122 | ReadHeapData(processHandle, heapEntry.dwAddress, heapEntry.dwSize, 123 | processHeapInfo, heapBuffer, reserveSize); 124 | } 125 | 126 | heapEntry.dwSize = sizeof(HEAPENTRY32); 127 | } while (Heap32Next(&heapEntry)); 128 | } 129 | 130 | heapList.dwSize = sizeof(HEAPLIST32); 131 | } while (Heap32ListNext(snapshot, &heapList)); 132 | } 133 | 134 | (void)NtResumeProcess(processHandle); 135 | 136 | (void)CloseHandle(snapshot); 137 | 138 | return processHeapInfo; 139 | } 140 | 141 | const HeapDiff GetHeapDiffs(const Heap &firstHeap, Heap &secondHeap) 142 | { 143 | HeapDiff heapDiff; 144 | 145 | for (auto &heapEntry : firstHeap) 146 | { 147 | auto &secondHeapEntry = std::find_if(std::begin(secondHeap), std::end(secondHeap), 148 | [&](const std::pair &entry) -> bool 149 | { 150 | return entry.first == heapEntry.first; 151 | }); 152 | 153 | if (secondHeapEntry != std::end(secondHeap)) 154 | { 155 | if (heapEntry.second != secondHeapEntry->second) 156 | { 157 | //Entries in both heaps but are different 158 | heapDiff.emplace_hint(std::end(heapDiff), 159 | heapEntry.first, std::make_pair(heapEntry.second, secondHeapEntry->second)); 160 | } 161 | secondHeap.erase(secondHeapEntry); 162 | } 163 | else 164 | { 165 | //Entries in first heap and not in second heap 166 | heapDiff.emplace_hint(std::end(heapDiff), 167 | heapEntry.first, std::make_pair(heapEntry.second, heapEntry.second)); 168 | } 169 | } 170 | 171 | for (auto &newEntries : secondHeap) 172 | { 173 | //Entries in second heap and not in first heap 174 | heapDiff.emplace_hint(std::end(heapDiff), 175 | newEntries.first, std::make_pair(newEntries.second, newEntries.second)); 176 | } 177 | 178 | return heapDiff; 179 | } 180 | 181 | const HeapDiffRange MergeHeapBlocks(const HeapDiff &heapDiff) 182 | { 183 | HeapDiffRange heapRange; 184 | 185 | if (heapDiff.size() == 1) 186 | { 187 | auto &diff = std::begin(heapDiff); 188 | 189 | std::vector byteDiffs; 190 | byteDiffs.emplace_back(std::make_pair(diff->second.first, diff->second.second)); 191 | AddressDiff addressDiffs(diff->first, diff->first); 192 | 193 | heapRange.emplace_hint(std::end(heapRange), std::make_pair(std::move(addressDiffs), 194 | std::move(byteDiffs))); 195 | } 196 | else if (heapDiff.size() > 1) 197 | { 198 | auto &iter = std::begin(heapDiff); 199 | while (iter != std::end(heapDiff)) 200 | { 201 | DWORD_PTR firstAddress = iter->first; 202 | DWORD_PTR lastAddress = iter->first; 203 | std::vector byteDiffs; 204 | 205 | size_t size = 0; 206 | while (iter != std::end(heapDiff)) 207 | { 208 | byteDiffs.push_back(iter->second); 209 | 210 | ++iter; 211 | ++size; 212 | if (iter == std::end(heapDiff)) 213 | { 214 | break; 215 | } 216 | if ((iter->first - 1) != lastAddress) 217 | { 218 | break; 219 | } 220 | lastAddress = iter->first; 221 | } 222 | 223 | heapRange.emplace_hint(std::end(heapRange), std::make_pair(std::make_pair(firstAddress, lastAddress), 224 | byteDiffs)); 225 | } 226 | } 227 | 228 | return heapRange; 229 | } 230 | 231 | void PrintBlocks(const HeapDiffRange &mergedRange, size_t minimumSize = 0, bool outputBytes = false) 232 | { 233 | for (auto &diff : mergedRange) 234 | { 235 | if (diff.second.size() >= minimumSize) 236 | { 237 | size_t size = diff.first.second - diff.first.first; 238 | ++size; 239 | 240 | fprintf(stderr, "Heap block: 0x%p -> 0x%p " 241 | "Size = %i (0x%X)\n", 242 | (void *)diff.first.first, (void *)diff.first.second, 243 | (int)size, (int)size); 244 | if (outputBytes) 245 | { 246 | for (size_t i = 0; i < size; ++i) 247 | { 248 | auto IsPrintable = [](Byte first, Byte second) 249 | { 250 | return (first >= 0x20 && first <= 0x7E) && 251 | (second >= 0x20 && second <= 0x7E); 252 | }; 253 | if (IsPrintable(diff.second[i].first, diff.second[i].second)) 254 | { 255 | fprintf(stderr, " %c -> %c\n", 256 | diff.second[i].first, diff.second[i].second); 257 | } 258 | } 259 | fprintf(stderr, "\n"); 260 | } 261 | } 262 | } 263 | } 264 | 265 | int main(int argc, char *argv[]) 266 | { 267 | const HMODULE hNtDll = GetModuleHandle(L"ntdll.dll"); 268 | 269 | NtSuspendProcess = (pNtSuspendProcess)GetProcAddress(hNtDll, "NtSuspendProcess"); 270 | NtResumeProcess = (pNtResumeProcess)GetProcAddress(hNtDll, "NtResumeProcess"); 271 | 272 | if (NtSuspendProcess == nullptr || NtResumeProcess == nullptr) 273 | { 274 | fprintf(stderr, "Could not locate NtSuspendProcess/NtResumeProcess.\n"); 275 | exit(-1); 276 | } 277 | 278 | if (argc < 2) 279 | { 280 | fprintf(stderr, "Usage: %s [process id: int] [min heap change size: int]" 281 | " [print block contents: 0/1]\n", 282 | argv[0]); 283 | exit(-1); 284 | } 285 | 286 | const DWORD processId = atoi(argv[1]); 287 | if (processId == 0) 288 | { 289 | fprintf(stderr, "Invalid process id entered.\n"); 290 | exit(-1); 291 | } 292 | 293 | const int heapCutoff = (argc >= 3) ? atoi(argv[2]) : 0; 294 | const bool printBlocks = (argc >= 4) ? (atoi(argv[3]) == 1) : false; 295 | 296 | const HANDLE processHandle = GetProcessHandle(processId); 297 | 298 | auto &first = EnumerateProcessHeap(processId, processHandle); 299 | auto second = EnumerateProcessHeap(processId, processHandle); 300 | 301 | auto diff = GetHeapDiffs(first, second); 302 | 303 | auto mergedDiff = MergeHeapBlocks(diff); 304 | 305 | PrintBlocks(mergedDiff, heapCutoff, printBlocks); 306 | 307 | return 0; 308 | } -------------------------------------------------------------------------------- /HeapDiff/Pintool/MemHeapTool.cpp: -------------------------------------------------------------------------------- 1 | #include "pin.H" 2 | 3 | #include 4 | #include 5 | 6 | //Quick and dirty hack due to name conflicts between 7 | //pin.h and windows.h. Abstract out Windows-specific calls 8 | //to other files if you are using this code as a template 9 | //so it looks less ugly 10 | namespace WinApi 11 | { 12 | #include 13 | } 14 | 15 | FILE *trace = NULL; 16 | std::set heapAddresses; 17 | 18 | bool IsInHeap(void *address) 19 | { 20 | using namespace WinApi; 21 | 22 | return heapAddresses.find((DWORD_PTR)address) != std::end(heapAddresses); 23 | } 24 | 25 | VOID OnMemoryWriteBefore(VOID *ip, VOID *addr) 26 | { 27 | if(IsInHeap(addr)) 28 | { 29 | fprintf(trace, "Heap entry 0x%p has been modified.\n", addr); 30 | } 31 | } 32 | 33 | VOID OnInstruction(INS instr, VOID *v) 34 | { 35 | UINT32 memOperands = INS_MemoryOperandCount(instr); 36 | 37 | for (UINT32 memOp = 0; memOp < memOperands; memOp++) 38 | { 39 | if (INS_MemoryOperandIsWritten(instr, memOp)) 40 | { 41 | INS_InsertPredicatedCall( 42 | instr, IPOINT_BEFORE, (AFUNPTR)OnMemoryWriteBefore, 43 | IARG_INST_PTR, 44 | IARG_MEMORYOP_EA, memOp, 45 | IARG_END); 46 | } 47 | } 48 | } 49 | 50 | VOID Fini(INT32 code, VOID *v) 51 | { 52 | (void)fclose(trace); 53 | } 54 | 55 | INT32 Usage() 56 | { 57 | PIN_ERROR( "This Pintool tracks all heap writes\n" 58 | + KNOB_BASE::StringKnobSummary() + "\n"); 59 | return -1; 60 | } 61 | 62 | void WalkHeaps(WinApi::HANDLE *heaps, const size_t size) 63 | { 64 | using namespace WinApi; 65 | 66 | fprintf(stderr, "Walking %i heaps.\n", size); 67 | 68 | for(size_t i = 0; i < size; ++i) 69 | { 70 | if(HeapLock(heaps[i]) == FALSE) 71 | { 72 | fprintf(stderr, "Could not lock heap 0x%X" 73 | "Error = 0x%X\n", heaps[i], GetLastError()); 74 | continue; 75 | } 76 | 77 | PROCESS_HEAP_ENTRY heapEntry = { 0 }; 78 | heapEntry.lpData = NULL; 79 | while(HeapWalk(heaps[i], &heapEntry) != FALSE) 80 | { 81 | for(size_t j = 0; j < heapEntry.cbData; ++j) 82 | { 83 | heapAddresses.insert(std::end(heapAddresses), 84 | (DWORD_PTR)heapEntry.lpData + j); 85 | } 86 | } 87 | 88 | fprintf(stderr, "HeapWalk finished with 0x%X\n", GetLastError()); 89 | 90 | if(HeapUnlock(heaps[i]) == FALSE) 91 | { 92 | fprintf(stderr, "Could not unlock heap 0x%X" 93 | "Error = 0x%X\n", heaps[i], GetLastError()); 94 | } 95 | } 96 | 97 | size_t numHeapAddresses = heapAddresses.size(); 98 | fprintf(stderr, "Found %i (0x%X) heap addresses.\n", 99 | numHeapAddresses, numHeapAddresses); 100 | 101 | } 102 | 103 | WinApi::HANDLE *GetHeapHandles(size_t &outSize) 104 | { 105 | using namespace WinApi; 106 | 107 | const size_t maxHeaps = 32; 108 | HANDLE *heapHandles = new HANDLE[maxHeaps]; 109 | memset(heapHandles, 0, maxHeaps * sizeof(HANDLE)); 110 | 111 | DWORD numHeaps = GetProcessHeaps(maxHeaps, heapHandles); 112 | 113 | fprintf(stderr, "Process has %i heaps.\n", numHeaps); 114 | 115 | outSize = numHeaps; 116 | 117 | return heapHandles; 118 | } 119 | 120 | void InitializeDebugConsole() 121 | { 122 | using namespace WinApi; 123 | 124 | if(AllocConsole()) 125 | { 126 | freopen("CONOUT$", "w", stderr); 127 | SetConsoleTitle("Console"); 128 | SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 129 | FOREGROUND_RED |FOREGROUND_GREEN | FOREGROUND_BLUE); 130 | fprintf(stderr, "PIN DLL loaded.\n"); 131 | } 132 | } 133 | 134 | int main(int argc, char *argv[]) 135 | { 136 | if (PIN_Init(argc, argv)) 137 | { 138 | return Usage(); 139 | } 140 | 141 | InitializeDebugConsole(); 142 | 143 | size_t numHeaps = 0; 144 | WinApi::HANDLE *heapHandles = GetHeapHandles(numHeaps); 145 | WalkHeaps(heapHandles, numHeaps); 146 | 147 | trace = fopen("pinatrace.out", "w"); 148 | 149 | INS_AddInstrumentFunction(OnInstruction, 0); 150 | PIN_AddFiniFunction(Fini, 0); 151 | 152 | PIN_StartProgram(); 153 | 154 | return 0; 155 | } -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU AFFERO GENERAL PUBLIC LICENSE 2 | Version 3, 19 November 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 Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published 637 | by the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # heapdiff 2 | Diffing process heaps 3 | 4 | 12/23/2015 - http://www.codereversing.com/archives/286 5 | --------------------------------------------------------------------------------