1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
// mwasmarm patcher v1.1
// Patches the Metrowerk C compiler assembler to stop the line ending bug.
// Changelog:
// v1.1: Added patch definitions and looped over them to find the matching
// definition as well as the version.
struct PatchDef {
char *version;
char *sha1before;
char *sha1after;
int offsetPatch;
int newByte;
};
struct PatchDef gPatchDefs[] = {
// mwasmarm 1.2/base definition
{
"mwasmarm 1.2/base",
"87f942cc0a0e90e73550d8d6f3fffcdeb5f69fa5",
"2f1ccff22eaa443bb79235ca6477d3b86bdfd7e4",
0x57614,
0x5
},
// mwasmarm 2.0/base definition
{
"mwasmarm 2.0/base",
"9d63877c776245129b4727b41d3e9e63cfc9cd28",
"f5dea73bf90791e104cb59458bebae8b08a55484",
0x57644,
0x5
},
// mwasmarm 2.0/sp2p4 definition
{
"mwasmarm 2.0/sp2p4",
"448cb0c7f1ace4393e9a9562f819f7a9f049be83",
"c82161527277b991a1b77e14617a93bcd19cf95c",
0x57834,
0x5
},
{
}
};
void sha1_process_block (const unsigned char * block, uint32_t * state);
// Credit to ax6 for implementation
unsigned char * calculate_sha1 (const void * data, unsigned length) {
uint32_t state[5] = {0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0};
const char * current;
unsigned remaining;
for (current = data, remaining = length; remaining >= 64; current += 64, remaining -= 64) sha1_process_block(current, state);
// technically only {0} is necessary, but better safe than sorry
unsigned char last_block[64] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
memcpy(last_block, current, remaining);
last_block[remaining] = 0x80;
if (remaining >= 56) {
sha1_process_block(last_block, state);
memset(last_block, 0, 64);
}
unsigned long long bit_length = ((unsigned long long) length) << 3;
for (remaining = 5; remaining; remaining --) {
last_block[58 + remaining] = bit_length;
bit_length >>= 8;
}
sha1_process_block(last_block, state);
unsigned char * result = malloc(20);
for (remaining = 0; remaining < 20; remaining ++) result[remaining] = state[remaining >> 2] >> ((~remaining & 3) << 3);
return result;
}
static inline unsigned sha1_rotate (unsigned value, unsigned count) {
return (value << count) | (value >> (32 - count));
}
void sha1_process_block (const unsigned char * block, uint32_t * state) {
uint32_t words[80];
unsigned pos, temp, count, a, b, c, d, e;
// constants used by SHA-1; they are actually simply the square roots of 2, 3, 5 and 10 as a fixed-point number (2.30 format)
const uint32_t hash_constants[4] = {0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6};
memset(words, 0, 16 * sizeof(uint32_t));
for (pos = 0; pos < 64; pos ++) words[pos >> 2] = (words[pos >> 2] << 8) | block[pos];
for (pos = 16; pos < 80; pos ++) words[pos] = sha1_rotate(words[pos - 3] ^ words[pos - 8] ^ words[pos - 14] ^ words[pos - 16], 1);
a = *state;
b = state[1];
c = state[2];
d = state[3];
e = state[4];
for (pos = 0; pos < 4; pos ++) for (count = 0; count < 20; count ++) {
temp = sha1_rotate(a, 5) + e + words[pos * 20 + count] + hash_constants[pos];
switch (pos) {
case 0:
temp += (b & c) | (~b & d);
break;
case 2:
temp += (b & c) | (b & d) | (c & d);
break;
default:
temp += b ^ c ^ d;
}
e = d;
d = c;
c = sha1_rotate(b, 30);
b = a;
a = temp;
}
*state += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
}
void fatal_printf(char *str, ...) {
va_list args;
va_start(args, str);
vprintf(str, args);
va_end(args);
exit(1);
}
// return size in bytes
int get_file_size (FILE * fp) {
int curpos = ftell(fp);
fseek(fp, 0, SEEK_END);
int result = ftell(fp);
fseek(fp, curpos, SEEK_SET);
return result;
}
#define SHA_DIGEST_LENGTH 20
void print_help(void) {
printf("mwasmarm patcher usage: input (example: mwasmarm_patcher mwasmarm.exe)\n");
}
int main(int argc, char *argv[]) {
if (argc != 2) {
print_help();
return 1;
} else {
// Open the file and sha1 read it.
FILE *f = fopen(argv[1], "rb+");
if(f == NULL) {
fatal_printf("ERROR: No file detected\n");
}
int fsize = get_file_size(f);
unsigned char *string = malloc(fsize + 1);
if(string == NULL) {
fatal_printf("ERROR: Failed to allocate string variable\n");
}
int readvar = fread(string, 1, fsize, f); // var to surpress warning
// Check if sha1 matches either known assembler hashes.
unsigned char *sha1 = calculate_sha1(string, fsize);
if(sha1 == NULL) {
fatal_printf("ERROR: Failed to retrieve sha1 hash\n");
}
free(string);
unsigned char buf[SHA_DIGEST_LENGTH*2];
for (int i=0; i < SHA_DIGEST_LENGTH; i++) {
sprintf((unsigned char*)&(buf[i*2]), "%02x", sha1[i]);
}
for(int i = 0; gPatchDefs[i].sha1before != NULL; i++) {
// check if already patched for the current loop.
if(!strcmp(buf, gPatchDefs[i].sha1after)) {
printf("Supported patched version detected (%s): no action needed\n", gPatchDefs[i].version);
return 0;
} else if(!strcmp(buf, gPatchDefs[i].sha1before)) {
fseek(f, gPatchDefs[i].offsetPatch, SEEK_SET);
fputc(gPatchDefs[i].newByte, f);
printf("Supported unpatched version detected (%s): assembler patched\n", gPatchDefs[i].version);
return 0;
}
}
fatal_printf("ERROR: Unsupported mwasmarm.exe version\n");
}
return 0;
}
|
