Skip to content
This repository was archived by the owner on Dec 27, 2020. It is now read-only.

Commit 2b60bcf

Browse files
author
Andrea Corna
committed
Add patchr and diffr tools
1 parent 0ded9c9 commit 2b60bcf

File tree

9 files changed

+1767
-1
lines changed

9 files changed

+1767
-1
lines changed

common/getopt.h

Lines changed: 109 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,109 @@
1+
/* ResidualVM - A 3D game interpreter
2+
*
3+
* ResidualVM is the legal property of its developers, whose names
4+
* are too numerous to list here. Please refer to the AUTHORS
5+
* file distributed with this source distribution.
6+
7+
* This library is distributed in the hope that it will be useful,
8+
* but WITHOUT ANY WARRANTY; without even the implied warranty of
9+
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
10+
* Lesser General Public License for more details.
11+
12+
* You should have received a copy of the GNU Lesser General Public
13+
* License along with this library; if not, write to the Free Software
14+
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
15+
*
16+
*/
17+
18+
#ifndef GETOPT_H
19+
#define GETOPT_H
20+
21+
#ifdef POSIX
22+
#include <unistd.h>
23+
#else
24+
//Fallback getopt
25+
//Based on XGetopt by Hans Dietrich. Removed non-portable unicode support
26+
// XGetopt.h Version 1.2
27+
//
28+
// Author: Hans Dietrich
29+
30+
//
31+
// This software is released into the public domain.
32+
// You are free to use it in any way you like.
33+
//
34+
// This software is provided "as is" with no expressed
35+
// or implied warranty. I accept no liability for any
36+
// damage or loss of business that this software may cause.
37+
//
38+
// http://www.codeproject.com/KB/cpp/xgetopt.aspx
39+
//
40+
///////////////////////////////////////////////////////////////////////////////
41+
42+
// BUGS
43+
// 1) Long options are not supported.
44+
// 2) The GNU double-colon extension is not supported.
45+
// 3) The environment variable POSIXLY_CORRECT is not supported.
46+
// 4) The + syntax is not supported.
47+
// 5) The automatic permutation of arguments is not supported.
48+
49+
50+
char *optarg; // global argument pointer
51+
int optind = 0; // global argv index
52+
53+
int getopt(int argc, char * const argv[], const char *optstring) {
54+
static char *next = NULL;
55+
if (optind == 0)
56+
next = NULL;
57+
58+
optarg = NULL;
59+
60+
if (next == NULL || *next == '\0') {
61+
if (optind == 0)
62+
optind++;
63+
64+
if (optind >= argc || argv[optind][0] != '-' || argv[optind][1] == '\0') {
65+
optarg = NULL;
66+
if (optind < argc)
67+
optarg = argv[optind];
68+
return -1;
69+
}
70+
71+
if (strcmp(argv[optind], "--") == 0) {
72+
optind++;
73+
optarg = NULL;
74+
if (optind < argc)
75+
optarg = argv[optind];
76+
return -1;
77+
}
78+
79+
next = argv[optind];
80+
next++; // skip past -
81+
optind++;
82+
}
83+
84+
char c = *next++;
85+
const char *cp = strchr(optstring, c);
86+
87+
if (cp == NULL || c == ':')
88+
return '?';
89+
90+
cp++;
91+
if (*cp == ':') {
92+
if (*next != '\0') {
93+
optarg = next;
94+
next = NULL;
95+
}
96+
else if (optind < argc) {
97+
optarg = argv[optind];
98+
optind++;
99+
}
100+
else {
101+
return '?';
102+
}
103+
}
104+
105+
return c;
106+
}
107+
108+
#endif //POSIX
109+
#endif //GETOPT_H

common/md5.cpp

Lines changed: 269 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,269 @@
1+
/* ScummVM Tools
2+
* Copyright (C) 2002-2009 The ScummVM project
3+
*
4+
* This program is free software; you can redistribute it and/or
5+
* modify it under the terms of the GNU General Public License
6+
* as published by the Free Software Foundation; either version 2
7+
* of the License, or (at your option) any later version.
8+
9+
* This program is distributed in the hope that it will be useful,
10+
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11+
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12+
* GNU General Public License for more details.
13+
14+
* You should have received a copy of the GNU General Public License
15+
* along with this program; if not, write to the Free Software
16+
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17+
*
18+
* $URL$
19+
* $Id$
20+
*
21+
*/
22+
23+
#include "common/md5.h"
24+
#include "common/endian.h"
25+
26+
#include <stdio.h>
27+
#include <string.h>
28+
29+
namespace Common {
30+
31+
#define GET_UINT32(n, b, i) (n) = READ_LE_UINT32(b + i)
32+
#define PUT_UINT32(n, b, i) WRITE_LE_UINT32(b + i, n)
33+
34+
void md5_starts(md5_context *ctx) {
35+
ctx->total[0] = 0;
36+
ctx->total[1] = 0;
37+
38+
ctx->state[0] = 0x67452301;
39+
ctx->state[1] = 0xEFCDAB89;
40+
ctx->state[2] = 0x98BADCFE;
41+
ctx->state[3] = 0x10325476;
42+
}
43+
44+
static void md5_process(md5_context *ctx, const uint8 data[64]) {
45+
uint32 X[16], A, B, C, D;
46+
47+
GET_UINT32(X[0], data, 0);
48+
GET_UINT32(X[1], data, 4);
49+
GET_UINT32(X[2], data, 8);
50+
GET_UINT32(X[3], data, 12);
51+
GET_UINT32(X[4], data, 16);
52+
GET_UINT32(X[5], data, 20);
53+
GET_UINT32(X[6], data, 24);
54+
GET_UINT32(X[7], data, 28);
55+
GET_UINT32(X[8], data, 32);
56+
GET_UINT32(X[9], data, 36);
57+
GET_UINT32(X[10], data, 40);
58+
GET_UINT32(X[11], data, 44);
59+
GET_UINT32(X[12], data, 48);
60+
GET_UINT32(X[13], data, 52);
61+
GET_UINT32(X[14], data, 56);
62+
GET_UINT32(X[15], data, 60);
63+
64+
#define S(x, n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
65+
66+
#define P(a, b, c, d, k, s, t) \
67+
{ \
68+
a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \
69+
}
70+
71+
A = ctx->state[0];
72+
B = ctx->state[1];
73+
C = ctx->state[2];
74+
D = ctx->state[3];
75+
76+
#define F(x, y, z) (z ^ (x & (y ^ z)))
77+
78+
P(A, B, C, D, 0, 7, 0xD76AA478);
79+
P(D, A, B, C, 1, 12, 0xE8C7B756);
80+
P(C, D, A, B, 2, 17, 0x242070DB);
81+
P(B, C, D, A, 3, 22, 0xC1BDCEEE);
82+
P(A, B, C, D, 4, 7, 0xF57C0FAF);
83+
P(D, A, B, C, 5, 12, 0x4787C62A);
84+
P(C, D, A, B, 6, 17, 0xA8304613);
85+
P(B, C, D, A, 7, 22, 0xFD469501);
86+
P(A, B, C, D, 8, 7, 0x698098D8);
87+
P(D, A, B, C, 9, 12, 0x8B44F7AF);
88+
P(C, D, A, B, 10, 17, 0xFFFF5BB1);
89+
P(B, C, D, A, 11, 22, 0x895CD7BE);
90+
P(A, B, C, D, 12, 7, 0x6B901122);
91+
P(D, A, B, C, 13, 12, 0xFD987193);
92+
P(C, D, A, B, 14, 17, 0xA679438E);
93+
P(B, C, D, A, 15, 22, 0x49B40821);
94+
95+
#undef F
96+
97+
#define F(x, y, z) (y ^ (z & (x ^ y)))
98+
99+
P(A, B, C, D, 1, 5, 0xF61E2562);
100+
P(D, A, B, C, 6, 9, 0xC040B340);
101+
P(C, D, A, B, 11, 14, 0x265E5A51);
102+
P(B, C, D, A, 0, 20, 0xE9B6C7AA);
103+
P(A, B, C, D, 5, 5, 0xD62F105D);
104+
P(D, A, B, C, 10, 9, 0x02441453);
105+
P(C, D, A, B, 15, 14, 0xD8A1E681);
106+
P(B, C, D, A, 4, 20, 0xE7D3FBC8);
107+
P(A, B, C, D, 9, 5, 0x21E1CDE6);
108+
P(D, A, B, C, 14, 9, 0xC33707D6);
109+
P(C, D, A, B, 3, 14, 0xF4D50D87);
110+
P(B, C, D, A, 8, 20, 0x455A14ED);
111+
P(A, B, C, D, 13, 5, 0xA9E3E905);
112+
P(D, A, B, C, 2, 9, 0xFCEFA3F8);
113+
P(C, D, A, B, 7, 14, 0x676F02D9);
114+
P(B, C, D, A, 12, 20, 0x8D2A4C8A);
115+
116+
#undef F
117+
118+
#define F(x, y, z) (x ^ y ^ z)
119+
120+
P(A, B, C, D, 5, 4, 0xFFFA3942);
121+
P(D, A, B, C, 8, 11, 0x8771F681);
122+
P(C, D, A, B, 11, 16, 0x6D9D6122);
123+
P(B, C, D, A, 14, 23, 0xFDE5380C);
124+
P(A, B, C, D, 1, 4, 0xA4BEEA44);
125+
P(D, A, B, C, 4, 11, 0x4BDECFA9);
126+
P(C, D, A, B, 7, 16, 0xF6BB4B60);
127+
P(B, C, D, A, 10, 23, 0xBEBFBC70);
128+
P(A, B, C, D, 13, 4, 0x289B7EC6);
129+
P(D, A, B, C, 0, 11, 0xEAA127FA);
130+
P(C, D, A, B, 3, 16, 0xD4EF3085);
131+
P(B, C, D, A, 6, 23, 0x04881D05);
132+
P(A, B, C, D, 9, 4, 0xD9D4D039);
133+
P(D, A, B, C, 12, 11, 0xE6DB99E5);
134+
P(C, D, A, B, 15, 16, 0x1FA27CF8);
135+
P(B, C, D, A, 2, 23, 0xC4AC5665);
136+
137+
#undef F
138+
139+
#define F(x, y, z) (y ^ (x | ~z))
140+
141+
P(A, B, C, D, 0, 6, 0xF4292244);
142+
P(D, A, B, C, 7, 10, 0x432AFF97);
143+
P(C, D, A, B, 14, 15, 0xAB9423A7);
144+
P(B, C, D, A, 5, 21, 0xFC93A039);
145+
P(A, B, C, D, 12, 6, 0x655B59C3);
146+
P(D, A, B, C, 3, 10, 0x8F0CCC92);
147+
P(C, D, A, B, 10, 15, 0xFFEFF47D);
148+
P(B, C, D, A, 1, 21, 0x85845DD1);
149+
P(A, B, C, D, 8, 6, 0x6FA87E4F);
150+
P(D, A, B, C, 15, 10, 0xFE2CE6E0);
151+
P(C, D, A, B, 6, 15, 0xA3014314);
152+
P(B, C, D, A, 13, 21, 0x4E0811A1);
153+
P(A, B, C, D, 4, 6, 0xF7537E82);
154+
P(D, A, B, C, 11, 10, 0xBD3AF235);
155+
P(C, D, A, B, 2, 15, 0x2AD7D2BB);
156+
P(B, C, D, A, 9, 21, 0xEB86D391);
157+
158+
#undef F
159+
160+
ctx->state[0] += A;
161+
ctx->state[1] += B;
162+
ctx->state[2] += C;
163+
ctx->state[3] += D;
164+
}
165+
166+
void md5_update(md5_context *ctx, const uint8 *input, uint32 length) {
167+
uint32 left, fill;
168+
169+
if (!length)
170+
return;
171+
172+
left = ctx->total[0] & 0x3F;
173+
fill = 64 - left;
174+
175+
ctx->total[0] += length;
176+
ctx->total[0] &= 0xFFFFFFFF;
177+
178+
if (ctx->total[0] < length)
179+
ctx->total[1]++;
180+
181+
if (left && length >= fill) {
182+
memcpy((void *)(ctx->buffer + left), (const void *)input, fill);
183+
md5_process(ctx, ctx->buffer);
184+
length -= fill;
185+
input += fill;
186+
left = 0;
187+
}
188+
189+
while (length >= 64) {
190+
md5_process(ctx, input);
191+
length -= 64;
192+
input += 64;
193+
}
194+
195+
if (length) {
196+
memcpy((void *)(ctx->buffer + left), (const void *)input, length);
197+
}
198+
}
199+
200+
static const uint8 md5_padding[64] = {
201+
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
202+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
203+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
204+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
205+
};
206+
207+
void md5_finish(md5_context *ctx, uint8 digest[16]) {
208+
uint32 last, padn;
209+
uint32 high, low;
210+
uint8 msglen[8];
211+
212+
high = (ctx->total[0] >> 29) | (ctx->total[1] << 3);
213+
low = (ctx->total[0] << 3);
214+
215+
PUT_UINT32(low, msglen, 0);
216+
PUT_UINT32(high, msglen, 4);
217+
218+
last = ctx->total[0] & 0x3F;
219+
padn = (last < 56) ? (56 - last) : (120 - last);
220+
221+
md5_update(ctx, md5_padding, padn);
222+
md5_update(ctx, msglen, 8);
223+
224+
PUT_UINT32(ctx->state[0], digest, 0);
225+
PUT_UINT32(ctx->state[1], digest, 4);
226+
PUT_UINT32(ctx->state[2], digest, 8);
227+
PUT_UINT32(ctx->state[3], digest, 12);
228+
}
229+
230+
bool md5_file(const char *name, uint8 digest[16], uint32 length) {
231+
FILE *f;
232+
233+
f = fopen(name, "rb");
234+
if (f == NULL) {
235+
printf("md5_file couldn't open '%s'", name);
236+
return false;
237+
}
238+
239+
md5_context ctx;
240+
uint32 i;
241+
unsigned char buf[1000];
242+
bool restricted = (length != 0);
243+
int readlen;
244+
245+
if (!restricted || sizeof(buf) <= length)
246+
readlen = sizeof(buf);
247+
else
248+
readlen = length;
249+
250+
md5_starts(&ctx);
251+
252+
253+
while ((i = (uint32)fread(buf, 1, readlen, f)) > 0) {
254+
md5_update(&ctx, buf, i);
255+
256+
length -= i;
257+
if (restricted && length == 0)
258+
break;
259+
260+
if (restricted && sizeof(buf) > length)
261+
readlen = length;
262+
}
263+
264+
md5_finish(&ctx, digest);
265+
fclose(f);
266+
return true;
267+
}
268+
269+
}

0 commit comments

Comments
 (0)