1 /*
2  * Copyright (c) 2020 Ori Bernstein
3  * Copyright (c) 2021 Stefan Sperling <stsp@openbsd.org>
4  *
5  * Permission to use, copy, modify, and distribute this software for any
6  * purpose with or without fee is hereby granted, provided that the above
7  * copyright notice and this permission notice appear in all copies.
8  *
9  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16  */
17 
18 #include <sys/types.h>
19 #include <sys/queue.h>
20 
21 #include <assert.h>
22 #include <endian.h>
23 #include <errno.h>
24 #include <limits.h>
25 #include <stdint.h>
26 #include <stdio.h>
27 #include <stdlib.h>
28 #include <string.h>
29 #include <sha1.h>
30 
31 #include "got_error.h"
32 
33 #include "got_lib_deltify.h"
34 
35 #ifndef MIN
36 #define	MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
37 #endif
38 
39 static uint32_t geartab[] = {
40     0x67ed26b7, 0x32da500c, 0x53d0fee0, 0xce387dc7, 0xcd406d90, 0x2e83a4d4,
41     0x9fc9a38d, 0xb67259dc, 0xca6b1722, 0x6d2ea08c, 0x235cea2e, 0x3149bb5f,
42     0x1beda787, 0x2a6b77d5, 0x2f22d9ac, 0x91fc0544, 0xe413acfa, 0x5a30ff7a,
43     0xad6fdde0, 0x444fd0f5, 0x7ad87864, 0x58c5ff05, 0x8d2ec336, 0x2371f853,
44     0x550f8572, 0x6aa448dd, 0x7c9ddbcf, 0x95221e14, 0x2a82ec33, 0xcbec5a78,
45     0xc6795a0d, 0x243995b7, 0x1c909a2f, 0x4fded51c, 0x635d334b, 0x0e2b9999,
46     0x2702968d, 0x856de1d5, 0x3325d60e, 0xeb6a7502, 0xec2a9844, 0x0905835a,
47     0xa1820375, 0xa4be5cab, 0x96a6c058, 0x2c2ccd70, 0xba40fce3, 0xd794c46b,
48     0x8fbae83e, 0xc3aa7899, 0x3d3ff8ed, 0xa0d42b5b, 0x571c0c97, 0xd2811516,
49     0xf7e7b96c, 0x4fd2fcbd, 0xe2fdec94, 0x282cc436, 0x78e8e95c, 0x80a3b613,
50     0xcfbee20c, 0xd4a32d1c, 0x2a12ff13, 0x6af82936, 0xe5630258, 0x8efa6a98,
51     0x294fb2d1, 0xdeb57086, 0x5f0fddb3, 0xeceda7ce, 0x4c87305f, 0x3a6d3307,
52     0xe22d2942, 0x9d060217, 0x1e42ed02, 0xb6f63b52, 0x4367f39f, 0x055cf262,
53     0x03a461b2, 0x5ef9e382, 0x386bc03a, 0x2a1e79c7, 0xf1a0058b, 0xd4d2dea9,
54     0x56baf37d, 0x5daff6cc, 0xf03a951d, 0xaef7de45, 0xa8f4581e, 0x3960b555,
55     0xffbfff6d, 0xbe702a23, 0x8f5b6d6f, 0x061739fb, 0x98696f47, 0x3fd596d4,
56     0x151eac6b, 0xa9fcc4f5, 0x69181a12, 0x3ac5a107, 0xb5198fe7, 0x96bcb1da,
57     0x1b5ddf8e, 0xc757d650, 0x65865c3a, 0x8fc0a41a, 0x87435536, 0x99eda6f2,
58     0x41874794, 0x29cff4e8, 0xb70efd9a, 0x3103f6e7, 0x84d2453b, 0x15a450bd,
59     0x74f49af1, 0x60f664b1, 0xa1c86935, 0xfdafbce1, 0xe36353e3, 0x5d9ba739,
60     0xbc0559ba, 0x708b0054, 0xd41d808c, 0xb2f31723, 0x9027c41f, 0xf136d165,
61     0xb5374b12, 0x9420a6ac, 0x273958b6, 0xe6c2fad0, 0xebdc1f21, 0xfb33af8b,
62     0xc71c25cd, 0xe9a2d8e5, 0xbeb38a50, 0xbceb7cc2, 0x4e4e73f0, 0xcd6c251d,
63     0xde4c032c, 0x4b04ac30, 0x725b8b21, 0x4eb8c33b, 0x20d07b75, 0x0567aa63,
64     0xb56b2bb7, 0xc1f5fd3a, 0xcafd35ca, 0x470dd4da, 0xfe4f94cd, 0xfb8de424,
65     0xe8dbcf40, 0xfe50a37a, 0x62db5b5d, 0xf32f4ab6, 0x2c4a8a51, 0x18473dc0,
66     0xfe0cbb6e, 0xfe399efd, 0xdf34ecc9, 0x6ccd5055, 0x46097073, 0x139135c2,
67     0x721c76f6, 0x1c6a94b4, 0x6eee014d, 0x8a508e02, 0x3da538f5, 0x280d394f,
68     0x5248a0c4, 0x3ce94c6c, 0x9a71ad3a, 0x8493dd05, 0xe43f0ab6, 0x18e4ed42,
69     0x6c5c0e09, 0x42b06ec9, 0x8d330343, 0xa45b6f59, 0x2a573c0c, 0xd7fd3de6,
70     0xeedeab68, 0x5c84dafc, 0xbbd1b1a8, 0xa3ce1ad1, 0x85b70bed, 0xb6add07f,
71     0xa531309c, 0x8f8ab852, 0x564de332, 0xeac9ed0c, 0x73da402c, 0x3ec52761,
72     0x43af2f4d, 0xd6ff45c8, 0x4c367462, 0xd553bd6a, 0x44724855, 0x3b2aa728,
73     0x56e5eb65, 0xeaf16173, 0x33fa42ff, 0xd714bb5d, 0xfbd0a3b9, 0xaf517134,
74     0x9416c8cd, 0x534cf94f, 0x548947c2, 0x34193569, 0x32f4389a, 0xfe7028bc,
75     0xed73b1ed, 0x9db95770, 0x468e3922, 0x0440c3cd, 0x60059a62, 0x33504562,
76     0x2b229fbd, 0x5174dca5, 0xf7028752, 0xd63c6aa8, 0x31276f38, 0x0646721c,
77     0xb0191da8, 0xe00e6de0, 0x9eac1a6e, 0x9f7628a5, 0xed6c06ea, 0x0bb8af15,
78     0xf119fb12, 0x38693c1c, 0x732bc0fe, 0x84953275, 0xb82ec888, 0x33a4f1b3,
79     0x3099835e, 0x028a8782, 0x5fdd51d7, 0xc6c717b3, 0xb06caf71, 0x17c8c111,
80     0x61bad754, 0x9fd03061, 0xe09df1af, 0x3bc9eb73, 0x85878413, 0x9889aaf2,
81     0x3f5a9e46, 0x42c9f01f, 0x9984a4f4, 0xd5de43cc, 0xd294daed, 0xbecba2d2,
82     0xf1f6e72c, 0x5551128a, 0x83af87e2, 0x6f0342ba,
83 };
84 
85 static uint64_t
86 hashblk(const unsigned char *p, off_t n)
87 {
88 	unsigned char buf[SHA1_DIGEST_LENGTH];
89 	uint64_t h;
90 	SHA1_CTX ctx;
91 	SHA1Init(&ctx);
92 	SHA1Update(&ctx, p, n);
93 	SHA1Final(buf, &ctx);
94 	memcpy(&h, buf, sizeof(h));
95 	return be64toh(h);
96 }
97 
98 static const struct got_error *
99 addblk(struct got_delta_table *dt, FILE *f, off_t len, off_t offset, uint64_t h)
100 {
101 	const struct got_error *err = NULL;
102 	int i, nalloc;
103 	uint8_t buf[GOT_DELTIFY_MAXCHUNK];
104 	size_t r = 0;
105 
106 	if (len == 0)
107 		return NULL;
108 
109 	i = h % dt->nalloc;
110 	while (dt->blocks[i].len != 0) {
111 		if (r == 0) {
112 			if (fseeko(f, offset, SEEK_SET) == -1)
113 				return got_error_from_errno("fseeko");
114 			r = fread(buf, 1, len, f);
115 			if (r != len) {
116 				if (ferror(f))
117 					return got_ferror(f, GOT_ERR_IO);
118 				return NULL;
119 			}
120 		}
121 		/*
122 		 * Avoid adding duplicate blocks.
123 		 * NB: A matching hash is insufficient for detecting equality.
124 		 * The hash can only detect inequality, so only check 'len'.
125 		 */
126 		if (len == dt->blocks[i].len) {
127 			uint8_t buf2[GOT_DELTIFY_MAXCHUNK];
128 			if (fseeko(f, dt->blocks[i].offset, SEEK_SET) == -1)
129 				return got_error_from_errno("fseeko");
130 			if (fread(buf2, 1, len, f) != len)
131 				return got_ferror(f, GOT_ERR_IO);
132 			if (memcmp(buf, buf2, len) == 0)
133 				return NULL;
134 		}
135 
136 		i = (i + 1) % dt->nalloc;
137 	}
138 	assert(dt->blocks[i].len == 0);
139 	dt->blocks[i].len = len;
140 	dt->blocks[i].offset = offset;
141 	dt->blocks[i].hash = h;
142 	dt->nblocks++;
143 	if (dt->nalloc < 2 * dt->nblocks) {
144 		struct got_delta_block *db;
145 		nalloc = dt->nalloc * 2;
146 		db = dt->blocks;
147 		dt->blocks = calloc(nalloc, sizeof(struct got_delta_block));
148 		if (dt->blocks == NULL) {
149 			err = got_error_from_errno("calloc");
150 			dt->blocks = db;
151 			return err;
152 		}
153 		dt->nalloc = nalloc;
154 		/*
155 		 * Recompute all block positions. Hash-based indices of blocks
156 		 * in the array depend on the allocated length of the array.
157 		 */
158 		dt->nblocks = 0;
159 		for (i = 0; i < nalloc; i++) {
160 			if (db[i].len == 0)
161 				continue;
162 			err = addblk(dt, f, db[i].len, db[i].offset,
163 			    db[i].hash);
164 			if (err)
165 				break;
166 		}
167 		free(db);
168 	}
169 
170 	return err;
171 }
172 
173 static const struct got_error *
174 lookupblk(struct got_delta_block **block, struct got_delta_table *dt,
175     unsigned char *p, off_t len, FILE *basefile)
176 {
177 	int i;
178 	uint64_t h;
179 	uint8_t buf[GOT_DELTIFY_MAXCHUNK];
180 	size_t r;
181 
182 	*block = NULL;
183 
184 	h = hashblk(p, len);
185 	for (i = h % dt->nalloc; dt->blocks[i].len != 0;
186 	     i = (i + 1) % dt->nalloc) {
187 		if (dt->blocks[i].hash != h ||
188 		    dt->blocks[i].len != len)
189 			continue;
190 		if (fseeko(basefile, dt->blocks[i].offset, SEEK_SET) == -1)
191 			return got_error_from_errno("fseeko");
192 		r = fread(buf, 1, len, basefile);
193 		if (r != len)
194 			return got_ferror(basefile, GOT_ERR_IO);
195 		if (memcmp(p, buf, len) == 0) {
196 			*block = &dt->blocks[i];
197 			break;
198 		}
199 	}
200 	return NULL;
201 }
202 
203 static const struct got_error *
204 nextblk(uint8_t *buf, off_t *blocklen, FILE *f)
205 {
206 	uint32_t gh;
207 	const unsigned char *p;
208 	size_t r;
209 	off_t pos = ftello(f);
210 
211 	*blocklen = 0;
212 
213 	r = fread(buf, 1, GOT_DELTIFY_MAXCHUNK, f);
214 	if (r == 0 && ferror(f))
215 		return got_ferror(f, GOT_ERR_IO);
216 	if (r < GOT_DELTIFY_MINCHUNK)
217 		return NULL; /* no more delta-worthy blocks left */
218 
219 	/* Got a deltifiable block. Find the split-point where it ends. */
220 	p = buf + GOT_DELTIFY_MINCHUNK;
221 	gh = 0;
222 	while (p != buf + r) {
223 		gh = (gh << 1) + geartab[*p++];
224 		if ((gh & GOT_DELTIFY_SPLITMASK) == 0)
225 			break;
226 	}
227 
228 	*blocklen = (p - buf);
229 	if (fseeko(f, pos + *blocklen, SEEK_SET) == -1)
230 		return got_error_from_errno("fseeko");
231 
232 	return NULL;
233 }
234 
235 const struct got_error *
236 got_deltify_init(struct got_delta_table **dt, FILE *f, off_t fileoffset,
237     off_t filesize)
238 {
239 	const struct got_error *err = NULL;
240 	uint64_t h;
241 
242 	*dt = calloc(1, sizeof(**dt));
243 	if (*dt == NULL)
244 		return got_error_from_errno("calloc");
245 
246 	(*dt)->nblocks = 0;
247 	(*dt)->nalloc = 128;
248 	(*dt)->blocks = calloc((*dt)->nalloc, sizeof(struct got_delta_block));
249 	if ((*dt)->blocks == NULL) {
250 		err = got_error_from_errno("calloc");
251 		goto done;
252 	}
253 
254 	if (fseeko(f, fileoffset, SEEK_SET) == -1)
255 		return got_error_from_errno("fseeko");
256 
257 	while (fileoffset < filesize) {
258 		uint8_t buf[GOT_DELTIFY_MAXCHUNK];
259 		off_t blocklen;
260 		err = nextblk(buf, &blocklen, f);
261 		if (err)
262 			goto done;
263 		if (blocklen == 0)
264 			break;
265 		h = hashblk(buf, blocklen);
266 		err = addblk(*dt, f, blocklen, fileoffset, h);
267 		if (err)
268 			goto done;
269 		fileoffset += blocklen;
270 	}
271 done:
272 	if (err) {
273 		free((*dt)->blocks);
274 		free(*dt);
275 		*dt = NULL;
276 	}
277 
278 	return err;
279 }
280 
281 void
282 got_deltify_free(struct got_delta_table *dt)
283 {
284 	free(dt->blocks);
285 	free(dt);
286 }
287 
288 static const struct got_error *
289 emitdelta(struct got_delta_instruction **deltas, int *ndeltas, int copy,
290     off_t offset, off_t len)
291 {
292 	struct got_delta_instruction *d, *p;
293 
294 	*ndeltas += 1;
295 	p = reallocarray(*deltas, *ndeltas,
296 	    sizeof(struct got_delta_instruction));
297 	if (p == NULL)
298 		return got_error_from_errno("realloc");
299 	*deltas = p;
300 	d = &(*deltas)[*ndeltas - 1];
301 	d->copy = copy;
302 	d->offset = offset;
303 	d->len = len;
304 	return NULL;
305 }
306 
307 static const struct got_error *
308 stretchblk(FILE *basefile, struct got_delta_block *block, FILE *f,
309     off_t filesize, off_t *blocklen)
310 {
311 	uint8_t basebuf[GOT_DELTIFY_MAXCHUNK], buf[GOT_DELTIFY_MAXCHUNK];
312 	size_t base_r, r, i;
313 	off_t orig_blocklen = *blocklen;
314 	off_t pos = ftello(f);
315 	int buf_equal = 1;
316 
317 	if (fseeko(basefile, block->offset, SEEK_SET) == -1)
318 		return got_error_from_errno("fseeko");
319 
320 	while (buf_equal && *blocklen < (1 << 24) - 1) {
321 		base_r = fread(basebuf, 1, sizeof(basebuf), basefile);
322 		if (base_r == 0) {
323 			if (ferror(basefile))
324 				return got_ferror(basefile, GOT_ERR_IO);
325 			break;
326 		}
327 		r = fread(buf, 1, sizeof(buf), f);
328 		if (r == 0) {
329 			if (ferror(f))
330 				return got_ferror(f, GOT_ERR_IO);
331 			break;
332 		}
333 		for (i = 0; i < MIN(base_r, r); i++) {
334 			if (buf[i] != basebuf[i]) {
335 				buf_equal = 0;
336 				break;
337 			}
338 			(*blocklen)++;
339 		}
340 	}
341 
342 	if (fseeko(f, pos + *blocklen - orig_blocklen, SEEK_SET) == -1)
343 		return got_error_from_errno("fseeko");
344 
345 	return NULL;
346 }
347 
348 const struct got_error *
349 got_deltify(struct got_delta_instruction **deltas, int *ndeltas,
350     FILE *f, off_t fileoffset, off_t filesize,
351     struct got_delta_table *dt, FILE *basefile,
352     off_t basefile_size)
353 {
354 	const struct got_error *err = NULL;
355 	const off_t offset0 = fileoffset;
356 
357 	*deltas = NULL;
358 	*ndeltas = 0;
359 
360 	/*
361 	 * offset0 indicates where data to be deltified begins.
362 	 * For example, we want to avoid deltifying a Git object header at
363 	 * the beginning of the file.
364 	 */
365 	if (fseeko(f, offset0, SEEK_SET) == -1)
366 		return got_error_from_errno("fseeko");
367 
368 	while (fileoffset < filesize) {
369 		uint8_t buf[GOT_DELTIFY_MAXCHUNK];
370 		off_t blocklen;
371 		struct got_delta_block *block;
372 		err = nextblk(buf, &blocklen, f);
373 		if (err)
374 			break;
375 		if (blocklen == 0)
376 			break;
377 		err = lookupblk(&block, dt, buf, blocklen, basefile);
378 		if (err)
379 			break;
380 		if (block != NULL) {
381 			/*
382 			 * We have found a matching block in the delta base.
383 			 * Attempt to stretch the block as far as possible and
384 			 * generate a copy instruction.
385 			 */
386 			err = stretchblk(basefile, block, f, filesize,
387 			    &blocklen);
388 			if (err)
389 				break;
390 			emitdelta(deltas, ndeltas, 1, block->offset, blocklen);
391 		} else {
392 			/*
393 			 * No match.
394 			 * This block needs to be sourced from the file itself.
395 			 */
396 			emitdelta(deltas, ndeltas, 0, fileoffset - offset0,
397 			    blocklen);
398 		}
399 		fileoffset += blocklen;
400 	}
401 
402 	if (err) {
403 		free(*deltas);
404 		*deltas = NULL;
405 		*ndeltas = 0;
406 	}
407 	return err;
408 }