/Warden DLL/crevold.c

https://github.com/Hdx/Battle.net-Warden · C · 207 lines · 160 code · 28 blank · 19 comment · 66 complexity · 9e7297e3c02087b360a537164f035769 MD5 · raw file 

    

  1. #include "crevold.h"

    2. 

  2. /*void wwrite_to_file(const uint8_t *data){

    3. 

  3. 	FILE *fp;

    4. 

  4. 	fopen_s(&fp, "WardenLog.txt", "a");

    5. 

  5. 	fwrite(data, 1, strlen(data), fp);

    6. 

  6. 	fclose(fp);

    7. 

  7. }*/

    8. 

  8. 

    9. 

  9. uint32_t __stdcall crev_ver1(uint8_t *archive_time, uint8_t *archive_name, uint8_t *seed, uint8_t *ini_file, uint8_t *ini_header, uint32_t *version, uint32_t *checksum, uint8_t *result){

    10. 

  10. 	return crev_old(0, archive_name[7] - '0', seed, ini_file, ini_header, version, checksum, result);

    11. 

  11. }

    12. 

  12. 

    13. 

  13. uint32_t __stdcall crev_ver2(uint8_t *archive_time, uint8_t *archive_name, uint8_t *seed, uint8_t *ini_file, uint8_t *ini_header, uint32_t *version, uint32_t *checksum, uint8_t *result){

    14. 

  14. 	return crev_old(1, archive_name[9] - '0', seed, ini_file, ini_header, version, checksum, result);

    15. 

  15. }

    16. 

  16. 

    17. 

  17. uint32_t __stdcall crev_old(uint32_t padd, uint8_t archive_ver, uint8_t *seed, uint8_t *ini_file, uint8_t *ini_header, uint32_t *version, uint32_t *checksum, uint8_t *result){

    18. 

  18. 	uint64_t A = 0;

    19. 

  19. 	uint64_t B = 0;

    20. 

  20. 	uint64_t C = 0;

    21. 

  21. 	uint32_t S = 0;

    22. 

  22. 	uint32_t x = 0;

    23. 

  23. 	uint32_t y = 0;

    24. 

  24. 	uint32_t file_size = 0;

    25. 

  25. 	uint8_t  ops[4];

    26. 

  26. 	uint8_t *files[4];

    27. 

  27. 	uint8_t *buff = safe_malloc(MAX_PATH);

    28. 

  28. 	const uint8_t *keys[] = {"Exe", "Util", "Network"};

    29. 

  29. 	const uint32_t seeds[] = {0xE7F4CB62, 0xF6A14FFC, 0xAA5504AF, 0x871FCDC2, 0x11BF6A18, 0xC57292E6, 0x7927D27E, 0x2FEC8733};

    30. 

  30. 

    31. 

  31. 	uint8_t *tok;

    32. 

  32. 	uint8_t *tok_pos;

    33. 

  33. 	//uint8_t *tmp = safe_malloc(MAX_PATH * 2);

    34. 

  34. 

    35. 

  35. 	if(archive_ver > 7){

    36. 

  36. 		free(buff);

    37. 

  37. 		return CREV_UNKNOWN_REVISION;

    38. 

  38. 	}

    39. 

  39. 

    40. 

  40. 	tok = strtok_s(seed, " ", &tok_pos);

    41. 

  41. 	for(x = 0; x < 3; x++){

    42. 

  42. 		if(tok == NULL)

    43. 

  43. 			return CREV_MALFORMED_SEED;

    44. 

  44. 		if(tok[1] == '='){

    45. 

  45. 			if(tok[0] == 'A' || tok[0] == 'a') A = strtoul((uint8_t*)&tok[2], NULL, 10);

    46. 

  46. 			if(tok[0] == 'B' || tok[0] == 'b') B = strtoul((uint8_t*)&tok[2], NULL, 10);

    47. 

  47. 			if(tok[0] == 'C' || tok[0] == 'c') C = strtoul((uint8_t*)&tok[2], NULL, 10);

    48. 

  48. 		}else{

    49. 

  49. 			return CREV_MALFORMED_SEED;

    50. 

  50. 		}

    51. 

  51. 		tok = strtok_s(NULL, " ", &tok_pos);

    52. 

  52. 	}

    53. 

  53. 	/*

    54. 

  54. 	 *sprintf_s(tmp, MAX_PATH * 2, "A: %lu\n", A); wwrite_to_file(tmp);

    55. 

  55. 	 *sprintf_s(tmp, MAX_PATH * 2, "B: %lu\n", B); wwrite_to_file(tmp);

    56. 

  56. 	 *sprintf_s(tmp, MAX_PATH * 2, "C: %lu\n", C); wwrite_to_file(tmp);

    57. 

  57. 	 */

    58. 

  58. 	

    59. 

  59. 	tok = strtok_s(NULL, " ", &tok_pos); //Skip the '4'

    60. 

  60. 

    61. 

  61. 	for(x = 0; x < 4; x++){

    62. 

  62. 		if(tok == NULL)

    63. 

  63. 			return CREV_MALFORMED_SEED;

    64. 

  64. 		ops[x] = tok[3];

    65. 

  65. 		tok[3] = '.';

    66. 

  66. 		switch(x){

    67. 

  67. 			case 0: if(_stricmp(tok, "A=A.S") != 0) return CREV_MALFORMED_SEED; break;

    68. 

  68. 			case 1: if(_stricmp(tok, "B=B.C") != 0) return CREV_MALFORMED_SEED; break;

    69. 

  69. 			case 2: if(_stricmp(tok, "C=C.A") != 0) return CREV_MALFORMED_SEED; break;

    70. 

  70. 			case 3: if(_stricmp(tok, "A=A.B") != 0) return CREV_MALFORMED_SEED; break;

    71. 

  71. 		}

    72. 

  72. 		tok = strtok_s(NULL, " ", &tok_pos);

    73. 

  73. 	}

    74. 

  74. 

    75. 

  75. 	//sprintf_s(tmp, MAX_PATH * 2, "Ops: %c%c%c%c\n", ops[0], ops[1], ops[2], ops[3]); wwrite_to_file(tmp);

    76. 

  76. 

    77. 

  77. 	read_ini_new(ini_file, ini_header, "Path", "", buff, MAX_PATH);

    78. 

  78. 	files[0] = safe_malloc(MAX_PATH);

    79. 

  79. 	combine_paths(buff, "", files[0], MAX_PATH);

    80. 

  80. 

    81. 

  81. 	for(x = 1; x < 4; x++){

    82. 

  82. 		read_ini_new(ini_file, ini_header, (uint8_t*)keys[x-1], "\xFF", buff, MAX_PATH);

    83. 

  83. 		if(buff[0] == 0xFF){

    84. 

  84. 			for(y = 0; y < x; y++)

    85. 

  85. 				if(files[y] != NULL) free(files[y]);

    86. 

  86. 			sprintf_s(result, crev_max_result(), "%s\x00", keys[x-1]);

    87. 

  87. 			return CREV_MISSING_FILENAME;

    88. 

  88. 		}

    89. 

  89. 

    90. 

  90. 		files[x] = safe_malloc(MAX_PATH);

    91. 

  91. 		combine_paths(files[0], buff, files[x], MAX_PATH);

    92. 

  92. 	}

    93. 

  93. 	free(buff);

    94. 

  94. 	/*

    95. 

  95. 	 *sprintf_s(tmp, MAX_PATH * 2, "Path:    %s\n", files[0]); wwrite_to_file(tmp);

    96. 

  96. 	 *sprintf_s(tmp, MAX_PATH * 2, "Exe:     %s %d\n", files[1], get_file_size(files[1])); wwrite_to_file(tmp);

    97. 

  97. 	 *sprintf_s(tmp, MAX_PATH * 2, "Util:    %s %d\n", files[2], get_file_size(files[2])); wwrite_to_file(tmp);

    98. 

  98. 	 *sprintf_s(tmp, MAX_PATH * 2, "Network: %s %d\n", files[3], get_file_size(files[3])); wwrite_to_file(tmp);

    99. 

  99. 	 */

    100. 

  100. 

    101. 

  101. 	A ^= seeds[archive_ver];

    102. 

  102. 	for(x = 1; x < 4; x++){

    103. 

  103. 		file_size = get_file_size(files[x]);

    104. 

  104. 		if((file_size % 1024) != 0){

    105. 

  105. 			if(padd == 1) file_size += (1024 - (file_size % 1024));

    106. 

  106. 			else          file_size -= (file_size % 1024);

    107. 

  107. 		}

    108. 

  108. 

    109. 

  109. 		if(file_size == 0){

    110. 

  110. 			sprintf_s(result, CREV_MAX_RESULT, files[x]);

    111. 

  111. 			return CREV_MISSING_FILE;

    112. 

  112. 		}

    113. 

  113. 

    114. 

  114. 		buff = safe_malloc(file_size);

    115. 

  115. 		get_file_data(files[x], buff, file_size, padd);

    116. 

  116. 

    117. 

  117. 		for(y = 0; y < file_size; y+= 4){

    118. 

  118. 			S = (*(uint32_t*)&buff[y]);

    119. 

  119. 		    switch (ops[0]) {

    120. 

  120.                 case '^': A ^= S; break;

    121. 

  121.                 case '+': A += S; break;

    122. 

  122.                 case '-': A -= S; break;

    123. 

  123.                 case '*': A *= S; break;

    124. 

  124.                 case '/': A /= S; break;

    125. 

  125.             }

    126. 

  126.             switch (ops[1]){

    127. 

  127.                 case '^': B ^= C; break;

    128. 

  128.                 case '+': B += C; break;

    129. 

  129.                 case '-': B -= C; break;

    130. 

  130.                 case '*': B *= C; break;

    131. 

  131.                 case '/': B /= C; break;

    132. 

  132.             }

    133. 

  133.             switch (ops[2]){

    134. 

  134.                 case '^': C ^= A; break;

    135. 

  135.                 case '+': C += A; break;

    136. 

  136.                 case '-': C -= A; break;

    137. 

  137.                 case '*': C *= A; break;

    138. 

  138.                 case '/': C /= A; break;

    139. 

  139.             }

    140. 

  140.             switch (ops[3]){

    141. 

  141.                 case '^': A ^= B; break;

    142. 

  142.                 case '+': A += B; break;

    143. 

  143.                 case '-': A -= B; break;

    144. 

  144.                 case '*': A *= B; break;

    145. 

  145.                 case '/': A /= B; break;

    146. 

  146.             }

    147. 

  147. 		}

    148. 

  148. 		free(buff);

    149. 

  149. 	}

    150. 

  150. 	*checksum = (uint32_t)(C & 0x00000000FFFFFFFF);

    151. 

  151. 	*version = crev_get_file_version(files[1]);

    152. 

  152. 	S = crev_get_file_information(files[1], result, CREV_MAX_RESULT);

    153. 

  153. 

    154. 

  154. 	for(x = 0; x < 4; x++){

    155. 

  155. 		if(files[x] != NULL)

    156. 

  156. 			free(files[x]);

    157. 

  157. 	}

    158. 

  158. 

    159. 

  159. 	return S;

    160. 

  160. }

    161. 

  161. 

    162. 

  162. uint32_t crev_get_file_information(uint8_t *file, uint8_t *buffer, uint32_t size){

    163. 

  163. 	uint8_t   *file_name;

    164. 

  164. 	uint32_t   x = 0;

    165. 

  165. 	uint32_t   len = 0;

    166. 

  166. 	FILETIME   ft;

    167. 

  167. 	SYSTEMTIME st;

    168. 

  168. 	HANDLE     fhandle;

    169. 

  169. 

    170. 

  170. 	sprintf_s(buffer, size, file);

    171. 

  171. 

    172. 

  172. 	len = strlen(file);

    173. 

  173. 	if(len == 0) return CREV_FILE_INFO_ERROR;

    174. 

  174. 

    175. 

  175. 	file_name = safe_malloc(len);

    176. 

  176. 	for(x = len; x != 0; x--){

    177. 

  177. 		if(file[x] == '\\' || file[x] == '/')

    178. 

  178. 			break;

    179. 

  179. 	}

    180. 

  180. 	memcpy(file_name, (uint8_t*)(&file[x+1]), len - x + 1);

    181. 

  181. 

    182. 

  182. 	fhandle = CreateFile(file, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);

    183. 

  183. 

    184. 

  184. 	if(fhandle == INVALID_HANDLE_VALUE){

    185. 

  185. 		free(file_name);

    186. 

  186. 		return CREV_FILE_INFO_ERROR;

    187. 

  187. 	}

    188. 

  188. 

    189. 

  189. 	if(GetFileTime(fhandle, NULL, &ft, NULL) == 0){

    190. 

  190. 		free(file_name);

    191. 

  191. 		CloseHandle(fhandle);

    192. 

  192. 		return CREV_FILE_INFO_ERROR;

    193. 

  193. 	}

    194. 

  194. 	len = GetFileSize(fhandle, NULL);

    195. 

  195. 	CloseHandle(fhandle);

    196. 

  196. 

    197. 

  197. 	if(FileTimeToSystemTime(&ft, &st) == 0){

    198. 

  198. 		free(file_name);

    199. 

  199. 		return CREV_FILE_INFO_ERROR;

    200. 

  200. 	}

    201. 

  201. 

    202. 

  202. 	sprintf_s(buffer, size, "%s %02u/%02u/%02u %02u:%02u:%02u %lu",

    203. 

  203. 		file_name, st.wMonth, st.wDay, (st.wYear % 100), st.wHour, st.wMinute, st.wSecond, len);

    204. 

  204. 

    205. 

  205. 	free(file_name);

    206. 

  206. 	return CREV_SUCCESS;

    207. 

  207. }
    208.