├── README.md
├── .gitignore
├── decompiled.hpp
├── release.cpp
├── main.cpp
├── decompiled.cpp
├── defs.h
└── LICENSE


/README.md:
--------------------------------------------------------------------------------
 1 | # GrafEq-keygen
 2 | 
 3 | **GrafEq** 注册机，由IDA逆向得到加密算法
 4 | 
 5 | ## 使用方法
 6 | 
 7 | ```
 8 | g++ .\decompiled.cpp .\main.cpp -o keygen
 9 | ```
10 | 
11 | ## 许可证
12 | 
13 | **GPL-3.0 License**
14 | 


--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
 1 | # Prerequisites
 2 | *.d
 3 | 
 4 | # Compiled Object files
 5 | *.slo
 6 | *.lo
 7 | *.o
 8 | *.obj
 9 | 
10 | # Precompiled Headers
11 | *.gch
12 | *.pch
13 | 
14 | # Compiled Dynamic libraries
15 | *.so
16 | *.dylib
17 | *.dll
18 | 
19 | # Fortran module files
20 | *.mod
21 | *.smod
22 | 
23 | # Compiled Static libraries
24 | *.lai
25 | *.la
26 | *.a
27 | *.lib
28 | 
29 | # Executables
30 | *.exe
31 | *.out
32 | *.app
33 | 


--------------------------------------------------------------------------------
/decompiled.hpp:
--------------------------------------------------------------------------------
 1 | #pragma once
 2 | 
 3 | #include "defs.h"
 4 | 
 5 | void ACFXGenCodeSecert(const char *code, _BYTE *secert);
 6 | void ACFXGenCodeSecertBeautify(const char *code, _BYTE *secert);
 7 | char ACFXMatchSecert(const char *name, const _BYTE *secert);
 8 | char ACFXMatchSecertBeautify(const char *name, const _BYTE *secert);
 9 | 
10 | int ACFXLookup(int a1);
11 | char ACFCharToUpper(char a1);
12 | bool ACFCharIsLower(unsigned __int8 a1);
13 | 
14 | static _BYTE ACDXMatchedResult[5];
15 | 
16 | static _BYTE ACDXSecertCode0[32] = {
17 | 	0x59,	//'Y'
18 | 	0x35,	//'5'
19 | 	0x45,	//'E'
20 | 	0x37,	//'7'
21 | 	0x55,	//'U'
22 | 	0x5A,	//'Z'
23 | 	0x39,	//'9'
24 | 	0x58,	//'X'
25 | 	0x50,	//'P'
26 | 	0x32,	//'2'
27 | 	0x33,	//'3'
28 | 	0x51,	//'Q'
29 | 	0x57,	//'W'
30 | 	0x4B,	//'K'
31 | 	0x4D,	//'M'
32 | 	0x4E,	//'N'
33 | 	0x36,	//'6'
34 | 	0x41,	//'A'
35 | 	0x2B,	//'+'
36 | 	0x54,	//'T'
37 | 	0x53,	//'S'
38 | 	0x43,	//'C'
39 | 	0x21,	//'!'
40 | 	0x34,	//'4'
41 | 	0x56,	//'V'
42 | 	0x46,	//'F'
43 | 	0x47,	//'G'
44 | 	0x48,	//'H'
45 | 	0x4A,	//'J'
46 | 	0x52,	//'R'
47 | 	0x2D,	//'-'
48 | 	0x44	//'D'
49 | };
50 | 
51 | static _BYTE ACDXSecretCode1[8] = { // 5 elements enough
52 | 	0x5D,
53 | 	0x22,
54 | 	0x4F,
55 | 	0x4E,
56 | 	0x0FC,
57 | 	0,
58 | 	0,
59 | 	0
60 | };
61 | 
62 | static _BYTE ACDXSecretCode2[8] = { // 5 elements enough
63 | 	2,
64 | 	3,
65 | 	5,
66 | 	8,
67 | 	9,
68 | 	0,
69 | 	0,
70 | 	0
71 | };
72 | 


--------------------------------------------------------------------------------
/release.cpp:
--------------------------------------------------------------------------------
 1 | #include "decompiled.hpp"
 2 | 
 3 | #include <algorithm>
 4 | #include <iostream>
 5 | #include <string>
 6 | #include <cstring>
 7 | #include <cstdlib>
 8 | // #include <windows.h>
 9 | 
10 | using namespace std;
11 | 
12 | void ACFXGetSecertByName(const char *name, _BYTE *secert)
13 | {
14 | 	int nameLen = strlen(name);
15 | 	_BYTE vResult[5];
16 | 	vResult[0] = secert[0] = 0; // rand();
17 | 	vResult[1] = secert[1] = 0; // rand();
18 | 	vResult[2] = secert[4] = 0; // rand();
19 | 	vResult[3] = secert[6] = 0; // rand();
20 | 	vResult[4] = secert[7] = 0; // rand();
21 | 
22 | 	for (int i = 0; i < 5; i++)
23 | 	{
24 | 		char v16 = ACDXSecretCode1[i];
25 | 		for (int j = 0; j < nameLen; j++)
26 | 		{
27 | 			v16 += name[j] | (17 * i + vResult[(i + j) % 5]);
28 | 		}
29 | 		secert[ACDXSecretCode2[i]] = v16;
30 | 	}
31 | }
32 | 
33 | void ACFXGetCodeBySecert(const _BYTE *secert, char *code)
34 | {
35 | 	_BYTE xcode[16];
36 | 	_BYTE s[11];
37 | 	memcpy(s, secert, sizeof s);
38 | 
39 | 	for (size_t i = 0; i < 16; i++)
40 | 	{
41 | 		int bb = i * 5;
42 | 		int c = bb / 8;
43 | 		int cr = bb % 8;
44 | 		xcode[i] = ((s[c] >> cr) | (s[c + 1] << (8 - cr))) & 0b11111;
45 | 	}
46 | 
47 | 	for (size_t i = 0; i < 16; i++)
48 | 	{
49 | 		code[i] = ACDXSecertCode0[xcode[i]];
50 | 	}
51 | }
52 | 
53 | int main()
54 | {
55 | 	ios::sync_with_stdio(false);
56 | 	cin.tie(nullptr), cout.tie(nullptr);
57 | 
58 | 	system("title Keygen 4 GrafEq by:@sfc9982");
59 | 
60 | 	cout << endl;
61 | 	cout << " *-----------------------------------*" << endl;
62 | 	cout << " |    Keygen 4 GrafEq by:@sfc9982    |" << endl;
63 | 	cout << " *-----------------------------------*" << endl;
64 | 	cout << endl;
65 | 	cout << "输入用户名后回车，程序会返回注册码" << endl;
66 | 
67 | 	string name;
68 | 	while (cin >> name)
69 | 	{
70 | 		for (size_t i = 0; i < name.size(); i++)
71 | 			name[i] = toupper(name[i]);
72 | 
73 | 		_BYTE secert[10];
74 | 		ACFXGetSecertByName(name.c_str(), secert);
75 | 		char code[17];
76 | 		code[16] = 0;
77 | 		ACFXGetCodeBySecert(secert, code);
78 | 		cout << code << endl;
79 | 	}
80 | 	
81 | 	cout << "Farewell~" << flush;
82 | 	getchar();
83 | 	return 0;
84 | }


--------------------------------------------------------------------------------
/main.cpp:
--------------------------------------------------------------------------------
 1 | #include "decompiled.hpp"
 2 | 
 3 | #include <algorithm>
 4 | #include <iostream>
 5 | #include <string>
 6 | #include <cstring>
 7 | 
 8 | using namespace std;
 9 | 
10 | void ACFXGetSecertByName(const char *name, _BYTE *secert)
11 | {
12 | 	int nameLen = strlen(name);
13 | 	_BYTE vResult[5];
14 | 	// vResult[0] = secert[0] = 0; // rand();
15 | 	// vResult[1] = secert[1] = 0; // rand();
16 | 	// vResult[2] = secert[4] = 0; // rand();
17 | 	// vResult[3] = secert[6] = 0; // rand();
18 | 	// vResult[4] = secert[7] = 0; // rand();
19 | 	memset(vResult, 0, sizeof(vResult));
20 | 	memset(secert, 0, sizeof(vResult));
21 | 
22 | 
23 | 	for (int i = 0; i < 5; i++)
24 | 	{
25 | 		char v16 = ACDXSecretCode1[i];
26 | 		for (int j = 0; j < nameLen; j++)
27 | 		{
28 | 			v16 += name[j] | (17 * i + vResult[(i + j) % 5]);
29 | 		}
30 | 		secert[ACDXSecretCode2[i]] = v16;
31 | 	}
32 | 
33 | 	return;
34 | }
35 | 
36 | void ACFXGetCodeBySecert(const _BYTE *secert, char *code)
37 | {
38 | 	_BYTE xcode[16];
39 | 	_BYTE s[11];
40 | 	memcpy(s, secert, sizeof s);
41 | 
42 | 	for (size_t i = 0; i < 16; i++)
43 | 	{
44 | 		int bb = i * 5;
45 | 		int c = bb / 8;
46 | 		int cr = bb % 8;
47 | 		xcode[i] = ((s[c] >> cr) | (s[c + 1] << (8 - cr))) & 0b11111;
48 | 	}
49 | 
50 | 	for (size_t i = 0; i < 16; i++)
51 | 	{
52 | 		code[i] = ACDXSecertCode0[xcode[i]];
53 | 	}
54 | 
55 | 	return;
56 | }
57 | 
58 | int main()
59 | {
60 | 	int mode;
61 | 
62 | 	cout << "Enter mode(0=gen, otherwise=debug):" << endl;
63 | 	cin >> mode;
64 | 	
65 | 	if (mode)
66 | 	{
67 | 		string name, code;
68 | 		_BYTE secert1[10];
69 | 		_BYTE secert2[10];
70 | 		while (cin >> name >> code)
71 | 		{
72 | 			ACFXGenCodeSecert(code.c_str(), secert1);
73 | 			ACFXGenCodeSecertBeautify(code.c_str(), secert2);
74 | 			cout << (ACFXMatchSecertBeautify(name.c_str(), secert1) ? "Matched" : "Failed") << endl;
75 | 		}
76 | 	}
77 | 	else
78 | 	{
79 | 		string name;
80 | 		while (cin >> name)
81 | 		{
82 | 			for (size_t i = 0; i < name.length(); i++)
83 | 				name[i] = toupper(name[i]);
84 | 
85 | 			_BYTE secert[10];
86 | 			ACFXGetSecertByName(name.c_str(), secert);
87 | 			char code[17];
88 | 			code[16] = 0;
89 | 			ACFXGetCodeBySecert(secert, code);
90 | 			cout << code << endl;
91 | 		}
92 | 	}
93 | 
94 | 	getchar();
95 | 
96 | 	return 0;
97 | }


--------------------------------------------------------------------------------
/decompiled.cpp:
--------------------------------------------------------------------------------
  1 | #include "decompiled.hpp"
  2 | 
  3 | #include <cctype>
  4 | #include <cstring>
  5 | 
  6 | void ACFXGenCodeSecertBeautify(const char *code, _BYTE *secert)
  7 | {
  8 | 	char xcode[18];
  9 | 	for (int i = 0; i < 16; i++)
 10 | 		xcode[i] = ACFXLookup(code[i]);
 11 | 	for (int i = 0; i < 10; i++)
 12 | 	{
 13 | 		int c = i * 8 / 5;
 14 | 		int d = i * 8 % 5;
 15 | 		secert[i] = (xcode[c] >> d) |
 16 | 		(xcode[c + 1] << (5 - d)) |
 17 | 		(xcode[c + 2] << (10 - d));
 18 | 	}
 19 | }
 20 | 
 21 | void ACFXGenCodeSecert(const char *code, _BYTE *secert)
 22 | {
 23 | 	int v2; // edi
 24 | 	unsigned int v3; // esi
 25 | 	int v4; // ebx
 26 | 	int v5; // eax
 27 | 	int v6; // eax
 28 | 	unsigned int v7; // ebp
 29 | 	unsigned int v8; // edx
 30 | 	int v9; // ecx
 31 | 	int v10; // [esp+10h] [ebp-Ch]
 32 | 	int secertPtr; // [esp+14h] [ebp-8h]
 33 | 	signed __int16 v12; // [esp+18h] [ebp-4h]
 34 | 
 35 | 	v2 = 0;
 36 | 	v12 = 80;
 37 | 	v3 = 80;
 38 | 	secertPtr = 0;
 39 | 	v10 = 0;
 40 | 	do
 41 | 	{
 42 | 		if ((unsigned __int16)v2 <= 0x1Bu)
 43 | 		{
 44 | 			v4 = (unsigned __int16)((unsigned __int16)(27 - v2) / 5u + 1);
 45 | 			v2 += v4 + 4 * v4;
 46 | 			do
 47 | 			{
 48 | 				v5 = (unsigned __int16)v10;
 49 | 				LOBYTE(v5) = code[(unsigned __int16)v10++];
 50 | 				v12 -= 5;
 51 | 				v3 = ((unsigned __int16)ACFXLookup(v5) << 27) | (v3 >> 5);
 52 | 				--v4;
 53 | 			} while (v4);
 54 | 		}
 55 | 		if ((unsigned __int16)v2 >= 8u)
 56 | 		{
 57 | 			v6 = (unsigned __int16)v2;
 58 | 			v7 = (unsigned int)(unsigned __int16)v2 >> 3;
 59 | 			do
 60 | 			{
 61 | 				v8 = v3 >> (32 - v6);
 62 | 				v9 = (unsigned __int16)secertPtr++;
 63 | 				v2 += 65528;
 64 | 				v6 -= 8;
 65 | 				--v7;
 66 | 				secert[v9] = v8;
 67 | 			} while (v7);
 68 | 		}
 69 | 	} while (v12);
 70 | }
 71 | 
 72 | char ACFXMatchSecertBeautify(const char *name, const _BYTE *secert)
 73 | {
 74 | 	int nameLen = strlen(name); // bp
 75 | 	_BYTE vResult[5];
 76 | 	vResult[0] = secert[0];
 77 | 	vResult[1] = secert[1];
 78 | 	vResult[2] = secert[4];
 79 | 	vResult[3] = secert[6];
 80 | 	vResult[4] = secert[7];
 81 | 
 82 | 	int v9 = 0; // eax
 83 | 	while (1)
 84 | 	{
 85 | 		char v16 = ACDXSecretCode1[v9];
 86 | 		for (int i = 0; i < nameLen; i++)
 87 | 		{
 88 | 			v16 += name[i] | (17 * v9 + vResult[(i + v9) % 5]);
 89 | 		}
 90 | 		if (secert[ACDXSecretCode2[v9]] != v16)
 91 | 			break;
 92 | 		++v9;
 93 | 		if (v9 >= 5)
 94 | 		{
 95 | 			for (int i = 0; i < 5; i++)
 96 | 				ACDXMatchedResult[i] = vResult[i];
 97 | 			return 1;
 98 | 		}
 99 | 	}
100 | 	return 0;
101 | }
102 | 
103 | char __cdecl ACFXMatchSecert(const char *name, _BYTE *secert)
104 | {
105 | 	const char *xname = 0; // ecx
106 | 	_BYTE *secert1; // ebx
107 | 	char secertAt4; // dl
108 | 	const char *xname1; // edi
109 | 	char secertAt1; // cl
110 | 	char secertAt6; // al
111 | 	char secertAt7; // cl
112 | 	unsigned __int16 xnameLength0; // bp
113 | 	int v9; // eax
114 | 	int tmpV9cpy0; // esi
115 | 	const char *v11; // ecx
116 | 	int v12; // esi
117 | 	int v13; // edi
118 | 	int v14; // edx
119 | 	char v16; // [esp+13h] [ebp-1Dh]
120 | 	int v17; // [esp+14h] [ebp-1Ch]
121 | 	const char *xname2; // [esp+18h] [ebp-18h]
122 | 	int tmpV9cpy1; // [esp+1Ch] [ebp-14h]
123 | 	unsigned __int16 xnameLength1; // [esp+20h] [ebp-10h]
124 | 	int v21; // [esp+24h] [ebp-Ch]
125 | 	char secertAt7_2; // [esp+28h] [ebp-8h]
126 | 
127 | 	secert1 = secert;
128 | 	secertAt4 = secert[4];
129 | 	xname1 = xname;
130 | 	secertAt1 = secert[1];
131 | 	LOBYTE(v21) = *secert;
132 | 	secertAt6 = secert[6];
133 | 	BYTE1(v21) = secertAt1;
134 | 	secertAt7 = secert[7];
135 | 	xname2 = xname1;
136 | 	BYTE2(v21) = secertAt4;
137 | 	HIBYTE(v21) = secertAt6;
138 | 	secertAt7_2 = secertAt7;
139 | 	xnameLength0 = strlen(xname1);
140 | 	v9 = 0;
141 | 	xnameLength1 = xnameLength0;
142 | 	v17 = 0;
143 | 	while (1)
144 | 	{
145 | 		tmpV9cpy0 = (signed __int16)v9;
146 | 		tmpV9cpy1 = (signed __int16)v9;
147 | 		v16 = ACDXSecretCode1[(signed __int16)v9];
148 | 		if (xnameLength0 > 0u)
149 | 		{
150 | 			v11 = xname1;
151 | 			v12 = (signed __int16)v9 - (_DWORD)xname1; //如果此行报错，尝试加上"-fpermissive"参数后进行编译
152 | 			v13 = xnameLength0;
153 | 			do
154 | 			{
155 | 				v14 = (signed int)&(v11++)[v12] % 5; //如果此行报错，尝试加上"-fpermissive"参数后进行编译
156 | 				v16 += *(v11 - 1) | (17 * v9 + *((_BYTE *)&v21 + v14));
157 | 				--v13;
158 | 			} while (v13);
159 | 			secert1 = secert;
160 | 			xname1 = xname2;
161 | 			v9 = v17;
162 | 			xnameLength0 = xnameLength1;
163 | 			tmpV9cpy0 = tmpV9cpy1;
164 | 		}
165 | 		if (secert1[(unsigned __int8)ACDXSecretCode2[tmpV9cpy0]] != v16)
166 | 			break;
167 | 		v17 = ++v9;
168 | 		if ((signed __int16)v9 >= 5)
169 | 		{
170 | 			*((unsigned *)ACDXMatchedResult) = v21;
171 | 			ACDXMatchedResult[4] = secertAt7_2;
172 | 			return 1;
173 | 		}
174 | 	}
175 | 	return 0;
176 | }
177 | 
178 | int ACFXLookup(int a1)
179 | {
180 | 	char v1; // cl
181 | 	int result; // eax
182 | 
183 | 	v1 = ACFCharToUpper(a1);
184 | 	result = 0;
185 | 	while (v1 != ACDXSecertCode0[(unsigned __int16)result])
186 | 	{
187 | 		if ((unsigned __int16)++result >= 0x20u)
188 | 			return 0;
189 | 	}
190 | 	return result;
191 | }
192 | 
193 | char ACFCharToUpper(char a1)
194 | {
195 | 	if (ACFCharIsLower(a1))
196 | 		// a1 -= 32;
197 | 		a1 &= '_'; //Some bitwise optimazation tricks
198 | 	return a1;
199 | }
200 | 
201 | bool ACFCharIsLower(unsigned __int8 a1)
202 | {
203 | 	return a1 <= 0x7Fu && islower(a1);
204 | }
205 | 


--------------------------------------------------------------------------------
/defs.h:
--------------------------------------------------------------------------------
  1 | #pragma once
  2 | 
  3 | /*
  4 | 
  5 |    This file contains definitions used by the Hex-Rays decompiler output.
  6 |    It has type definitions and convenience macros to make the
  7 |    output more readable.
  8 | 
  9 |    Copyright (c) 2007 Hex-Rays
 10 | 
 11 | */
 12 | 
 13 | #if defined(__GNUC__)
 14 | typedef          long long ll;
 15 | typedef unsigned long long ull;
 16 | #define __int64 long long
 17 | #define __int32 int
 18 | #define __int16 short
 19 | #define __int8  char
 20 | #define MAKELL(num) num ## LL
 21 | #define FMT_64 "ll"
 22 | #elif defined(_MSC_VER)
 23 | typedef          __int64 ll;
 24 | typedef unsigned __int64 ull;
 25 | #define MAKELL(num) num ## i64
 26 | #define FMT_64 "I64"
 27 | #elif defined (__BORLANDC__)
 28 | typedef          __int64 ll;
 29 | typedef unsigned __int64 ull;
 30 | #define MAKELL(num) num ## i64
 31 | #define FMT_64 "L"
 32 | #else
 33 | #error "unknown compiler"
 34 | #endif
 35 | typedef unsigned int uint;
 36 | typedef unsigned char uchar;
 37 | typedef unsigned short ushort;
 38 | //typedef unsigned long ulong;
 39 | 
 40 | typedef          char   int8;
 41 | typedef   signed char   sint8;
 42 | typedef unsigned char   uint8;
 43 | typedef          short  int16;
 44 | typedef   signed short  sint16;
 45 | typedef unsigned short  uint16;
 46 | typedef          int    int32;
 47 | typedef   signed int    sint32;
 48 | typedef unsigned int    uint32;
 49 | typedef ll              int64;
 50 | typedef ll              sint64;
 51 | typedef ull             uint64;
 52 | 
 53 | // Partially defined types:
 54 | #define _BYTE  uint8
 55 | #define _WORD  uint16
 56 | #define _DWORD uint32
 57 | #define _QWORD uint64
 58 | #if !defined(_MSC_VER)
 59 | #define _LONGLONG __int128
 60 | #endif
 61 | 
 62 | #ifndef _WINDOWS_
 63 | typedef int8 BYTE;
 64 | typedef int16 WORD;
 65 | typedef int32 DWORD;
 66 | typedef int32 LONG;
 67 | #endif
 68 | typedef int64 QWORD;
 69 | #ifndef __cplusplus
 70 | typedef int bool;       // we want to use bool in our C programs
 71 | #endif
 72 | 
 73 | // Some convenience macros to make partial accesses nicer
 74 | // first unsigned macros:
 75 | #define LOBYTE(x)   (*((_BYTE*)&(x)))   // low byte
 76 | #define LOWORD(x)   (*((_WORD*)&(x)))   // low word
 77 | #define LODWORD(x)  (*((_DWORD*)&(x)))  // low dword
 78 | #define HIBYTE(x)   (*((_BYTE*)(&(x)+1)-1))
 79 | #define HIWORD(x)   (*((_WORD*)(&(x)+1)-1))
 80 | #define HIDWORD(x)  (*((_DWORD*)(&(x)+1)-1))
 81 | #define BYTEn(x, n)   (*((_BYTE*)&(x)+n))
 82 | #define WORDn(x, n)   (*((_WORD*)&(x)+n))
 83 | #define BYTE1(x)   BYTEn(x,  1)         // byte 1 (counting from 0)
 84 | #define BYTE2(x)   BYTEn(x,  2)
 85 | #define BYTE3(x)   BYTEn(x,  3)
 86 | #define BYTE4(x)   BYTEn(x,  4)
 87 | #define BYTE5(x)   BYTEn(x,  5)
 88 | #define BYTE6(x)   BYTEn(x,  6)
 89 | #define BYTE7(x)   BYTEn(x,  7)
 90 | #define BYTE8(x)   BYTEn(x,  8)
 91 | #define BYTE9(x)   BYTEn(x,  9)
 92 | #define BYTE10(x)  BYTEn(x, 10)
 93 | #define BYTE11(x)  BYTEn(x, 11)
 94 | #define BYTE12(x)  BYTEn(x, 12)
 95 | #define BYTE13(x)  BYTEn(x, 13)
 96 | #define BYTE14(x)  BYTEn(x, 14)
 97 | #define BYTE15(x)  BYTEn(x, 15)
 98 | #define WORD1(x)   WORDn(x,  1)
 99 | #define WORD2(x)   WORDn(x,  2)         // third word of the object, unsigned
100 | #define WORD3(x)   WORDn(x,  3)
101 | #define WORD4(x)   WORDn(x,  4)
102 | #define WORD5(x)   WORDn(x,  5)
103 | #define WORD6(x)   WORDn(x,  6)
104 | #define WORD7(x)   WORDn(x,  7)
105 | 
106 | // now signed macros (the same but with sign extension)
107 | #define SLOBYTE(x)   (*((int8*)&(x)))
108 | #define SLOWORD(x)   (*((int16*)&(x)))
109 | #define SLODWORD(x)  (*((int32*)&(x)))
110 | #define SHIBYTE(x)   (*((int8*)&(x)+1))
111 | #define SHIWORD(x)   (*((int16*)&(x)+1))
112 | #define SHIDWORD(x)  (*((int32*)&(x)+1))
113 | #define SBYTEn(x, n)   (*((int8*)&(x)+n))
114 | #define SWORDn(x, n)   (*((int16*)&(x)+n))
115 | #define SBYTE1(x)   SBYTEn(x,  1)
116 | #define SBYTE2(x)   SBYTEn(x,  2)
117 | #define SBYTE3(x)   SBYTEn(x,  3)
118 | #define SBYTE4(x)   SBYTEn(x,  4)
119 | #define SBYTE5(x)   SBYTEn(x,  5)
120 | #define SBYTE6(x)   SBYTEn(x,  6)
121 | #define SBYTE7(x)   SBYTEn(x,  7)
122 | #define SBYTE8(x)   SBYTEn(x,  8)
123 | #define SBYTE9(x)   SBYTEn(x,  9)
124 | #define SBYTE10(x)  SBYTEn(x, 10)
125 | #define SBYTE11(x)  SBYTEn(x, 11)
126 | #define SBYTE12(x)  SBYTEn(x, 12)
127 | #define SBYTE13(x)  SBYTEn(x, 13)
128 | #define SBYTE14(x)  SBYTEn(x, 14)
129 | #define SBYTE15(x)  SBYTEn(x, 15)
130 | #define SWORD1(x)   SWORDn(x,  1)
131 | #define SWORD2(x)   SWORDn(x,  2)
132 | #define SWORD3(x)   SWORDn(x,  3)
133 | #define SWORD4(x)   SWORDn(x,  4)
134 | #define SWORD5(x)   SWORDn(x,  5)
135 | #define SWORD6(x)   SWORDn(x,  6)
136 | #define SWORD7(x)   SWORDn(x,  7)
137 | 
138 | 
139 | // Helper functions to represent some assembly instructions.
140 | 
141 | #ifdef __cplusplus
142 | 
143 | // Fill memory block with an integer value
144 | inline void memset32(void *ptr, uint32 value, int count)
145 | {
146 | 	uint32 *p = (uint32 *)ptr;
147 | 	for (int i = 0; i < count; i++)
148 | 		*p++ = value;
149 | }
150 | 
151 | // Generate a reference to pair of operands
152 | template<class T>  int16 __PAIR__(int8  high, T low) { return (((int16)high) << sizeof(high) * 8) | uint8(low); }
153 | template<class T>  int32 __PAIR__(int16 high, T low) { return (((int32)high) << sizeof(high) * 8) | uint16(low); }
154 | template<class T>  int64 __PAIR__(int32 high, T low) { return (((int64)high) << sizeof(high) * 8) | uint32(low); }
155 | template<class T> uint16 __PAIR__(uint8  high, T low) { return (((uint16)high) << sizeof(high) * 8) | uint8(low); }
156 | template<class T> uint32 __PAIR__(uint16 high, T low) { return (((uint32)high) << sizeof(high) * 8) | uint16(low); }
157 | template<class T> uint64 __PAIR__(uint32 high, T low) { return (((uint64)high) << sizeof(high) * 8) | uint32(low); }
158 | 
159 | // rotate left
160 | template<class T> T __ROL__(T value, uint count)
161 | {
162 | 	const uint nbits = sizeof(T) * 8;
163 | 	count %= nbits;
164 | 
165 | 	T high = value >> (nbits - count);
166 | 	value <<= count;
167 | 	value |= high;
168 | 	return value;
169 | }
170 | 
171 | // rotate right
172 | template<class T> T __ROR__(T value, uint count)
173 | {
174 | 	const uint nbits = sizeof(T) * 8;
175 | 	count %= nbits;
176 | 
177 | 	T low = value << (nbits - count);
178 | 	value >>= count;
179 | 	value |= low;
180 | 	return value;
181 | }
182 | 
183 | // carry flag of left shift
184 | template<class T> int8 __MKCSHL__(T value, uint count)
185 | {
186 | 	const uint nbits = sizeof(T) * 8;
187 | 	count %= nbits;
188 | 
189 | 	return (value >> (nbits - count)) & 1;
190 | }
191 | 
192 | // carry flag of right shift
193 | template<class T> int8 __MKCSHR__(T value, uint count)
194 | {
195 | 	return (value >> (count - 1)) & 1;
196 | }
197 | 
198 | // sign flag
199 | template<class T> int8 __SETS__(T x)
200 | {
201 | 	if (sizeof(T) == 1)
202 | 		return int8(x) < 0;
203 | 	if (sizeof(T) == 2)
204 | 		return int16(x) < 0;
205 | 	if (sizeof(T) == 4)
206 | 		return int32(x) < 0;
207 | 	return int64(x) < 0;
208 | }
209 | 
210 | // overflow flag of subtraction (x-y)
211 | template<class T, class U> int8 __OFSUB__(T x, U y)
212 | {
213 | 	if (sizeof(T) < sizeof(U))
214 | 	{
215 | 		U x2 = x;
216 | 		int8 sx = __SETS__(x2);
217 | 		return (sx ^ __SETS__(y)) & (sx ^ __SETS__(x2 - y));
218 | 	}
219 | 	else
220 | 	{
221 | 		T y2 = y;
222 | 		int8 sx = __SETS__(x);
223 | 		return (sx ^ __SETS__(y2)) & (sx ^ __SETS__(x - y2));
224 | 	}
225 | }
226 | 
227 | // overflow flag of addition (x+y)
228 | template<class T, class U> int8 __OFADD__(T x, U y)
229 | {
230 | 	if (sizeof(T) < sizeof(U))
231 | 	{
232 | 		U x2 = x;
233 | 		int8 sx = __SETS__(x2);
234 | 		return ((1 ^ sx) ^ __SETS__(y)) & (sx ^ __SETS__(x2 + y));
235 | 	}
236 | 	else
237 | 	{
238 | 		T y2 = y;
239 | 		int8 sx = __SETS__(x);
240 | 		return ((1 ^ sx) ^ __SETS__(y2)) & (sx ^ __SETS__(x + y2));
241 | 	}
242 | }
243 | 
244 | // carry flag of subtraction (x-y)
245 | template<class T, class U> int8 __CFSUB__(T x, U y)
246 | {
247 | 	int size = sizeof(T) > sizeof(U) ? sizeof(T) : sizeof(U);
248 | 	if (size == 1)
249 | 		return uint8(x) < uint8(y);
250 | 	if (size == 2)
251 | 		return uint16(x) < uint16(y);
252 | 	if (size == 4)
253 | 		return uint32(x) < uint32(y);
254 | 	return uint64(x) < uint64(y);
255 | }
256 | 
257 | // carry flag of addition (x+y)
258 | template<class T, class U> int8 __CFADD__(T x, U y)
259 | {
260 | 	int size = sizeof(T) > sizeof(U) ? sizeof(T) : sizeof(U);
261 | 	if (size == 1)
262 | 		return uint8(x) > uint8(x + y);
263 | 	if (size == 2)
264 | 		return uint16(x) > uint16(x + y);
265 | 	if (size == 4)
266 | 		return uint32(x) > uint32(x + y);
267 | 	return uint64(x) > uint64(x + y);
268 | }
269 | 
270 | #else
271 | // The following definition is not quite correct because it always returns
272 | // uint64. The above C++ functions are good, though.
273 | #define __PAIR__(high, low) (((uint64)(high)<<sizeof(high)*8) | low)
274 | // For C, we just provide macros, they are not quite correct.
275 | #define __ROL__(x, y) __rotl__(x, y)      // Rotate left
276 | #define __ROR__(x, y) __rotr__(x, y)      // Rotate right
277 | #define __CFSHL__(x, y) invalid_operation // Generate carry flag for (x<<y)
278 | #define __CFSHR__(x, y) invalid_operation // Generate carry flag for (x>>y)
279 | #define __CFADD__(x, y) invalid_operation // Generate carry flag for (x+y)
280 | #define __CFSUB__(x, y) invalid_operation // Generate carry flag for (x-y)
281 | #define __OFADD__(x, y) invalid_operation // Generate overflow flag for (x+y)
282 | #define __OFSUB__(x, y) invalid_operation // Generate overflow flag for (x-y)
283 | #endif
284 | 
285 | // No definition for rcl/rcr because the carry flag is unknown
286 | #define __RCL__(x, y)    invalid_operation // Rotate left thru carry
287 | #define __RCR__(x, y)    invalid_operation // Rotate right thru carry
288 | #define __MKCRCL__(x, y) invalid_operation // Generate carry flag for a RCL
289 | #define __MKCRCR__(x, y) invalid_operation // Generate carry flag for a RCR
290 | #define __SETP__(x, y)   invalid_operation // Generate parity flag for (x-y)
291 | 
292 | // In the decompilation listing there are some objects declarared as _UNKNOWN
293 | // because we could not determine their types. Since the C compiler does not
294 | // accept void item declarations, we replace them by anything of our choice,
295 | // for example a char:
296 | 
297 | #define _UNKNOWN char
298 | 
299 | //#ifdef _MSC_VER
300 | //#define snprintf _snprintf
301 | //#define vsnprintf _vsnprintf
302 | //#endif
303 | 


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     <one line to give the program's name and a brief idea of what it does.>
635 |     Copyright (C) <year>  <name of author>
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <https://www.gnu.org/licenses/>.
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 |     <program>  Copyright (C) <year>  <name of author>
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 | <https://www.gnu.org/licenses/>.
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 | <https://www.gnu.org/licenses/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------