bsdiff 0.0.2 → 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,205 @@
1
+
2
+ /*-------------------------------------------------------------*/
3
+ /*--- Huffman coding low-level stuff ---*/
4
+ /*--- huffman.c ---*/
5
+ /*-------------------------------------------------------------*/
6
+
7
+ /* ------------------------------------------------------------------
8
+ This file is part of bzip2/libbzip2, a program and library for
9
+ lossless, block-sorting data compression.
10
+
11
+ bzip2/libbzip2 version 1.0.8 of 13 July 2019
12
+ Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
13
+
14
+ Please read the WARNING, DISCLAIMER and PATENTS sections in the
15
+ README file.
16
+
17
+ This program is released under the terms of the license contained
18
+ in the file LICENSE.
19
+ ------------------------------------------------------------------ */
20
+
21
+
22
+ #include "bzlib_private.h"
23
+
24
+ /*---------------------------------------------------*/
25
+ #define WEIGHTOF(zz0) ((zz0) & 0xffffff00)
26
+ #define DEPTHOF(zz1) ((zz1) & 0x000000ff)
27
+ #define MYMAX(zz2,zz3) ((zz2) > (zz3) ? (zz2) : (zz3))
28
+
29
+ #define ADDWEIGHTS(zw1,zw2) \
30
+ (WEIGHTOF(zw1)+WEIGHTOF(zw2)) | \
31
+ (1 + MYMAX(DEPTHOF(zw1),DEPTHOF(zw2)))
32
+
33
+ #define UPHEAP(z) \
34
+ { \
35
+ Int32 zz, tmp; \
36
+ zz = z; tmp = heap[zz]; \
37
+ while (weight[tmp] < weight[heap[zz >> 1]]) { \
38
+ heap[zz] = heap[zz >> 1]; \
39
+ zz >>= 1; \
40
+ } \
41
+ heap[zz] = tmp; \
42
+ }
43
+
44
+ #define DOWNHEAP(z) \
45
+ { \
46
+ Int32 zz, yy, tmp; \
47
+ zz = z; tmp = heap[zz]; \
48
+ while (True) { \
49
+ yy = zz << 1; \
50
+ if (yy > nHeap) break; \
51
+ if (yy < nHeap && \
52
+ weight[heap[yy+1]] < weight[heap[yy]]) \
53
+ yy++; \
54
+ if (weight[tmp] < weight[heap[yy]]) break; \
55
+ heap[zz] = heap[yy]; \
56
+ zz = yy; \
57
+ } \
58
+ heap[zz] = tmp; \
59
+ }
60
+
61
+
62
+ /*---------------------------------------------------*/
63
+ void BZ2_hbMakeCodeLengths ( UChar *len,
64
+ Int32 *freq,
65
+ Int32 alphaSize,
66
+ Int32 maxLen )
67
+ {
68
+ /*--
69
+ Nodes and heap entries run from 1. Entry 0
70
+ for both the heap and nodes is a sentinel.
71
+ --*/
72
+ Int32 nNodes, nHeap, n1, n2, i, j, k;
73
+ Bool tooLong;
74
+
75
+ Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ];
76
+ Int32 weight [ BZ_MAX_ALPHA_SIZE * 2 ];
77
+ Int32 parent [ BZ_MAX_ALPHA_SIZE * 2 ];
78
+
79
+ for (i = 0; i < alphaSize; i++)
80
+ weight[i+1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
81
+
82
+ while (True) {
83
+
84
+ nNodes = alphaSize;
85
+ nHeap = 0;
86
+
87
+ heap[0] = 0;
88
+ weight[0] = 0;
89
+ parent[0] = -2;
90
+
91
+ for (i = 1; i <= alphaSize; i++) {
92
+ parent[i] = -1;
93
+ nHeap++;
94
+ heap[nHeap] = i;
95
+ UPHEAP(nHeap);
96
+ }
97
+
98
+ AssertH( nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001 );
99
+
100
+ while (nHeap > 1) {
101
+ n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
102
+ n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
103
+ nNodes++;
104
+ parent[n1] = parent[n2] = nNodes;
105
+ weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
106
+ parent[nNodes] = -1;
107
+ nHeap++;
108
+ heap[nHeap] = nNodes;
109
+ UPHEAP(nHeap);
110
+ }
111
+
112
+ AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 );
113
+
114
+ tooLong = False;
115
+ for (i = 1; i <= alphaSize; i++) {
116
+ j = 0;
117
+ k = i;
118
+ while (parent[k] >= 0) { k = parent[k]; j++; }
119
+ len[i-1] = j;
120
+ if (j > maxLen) tooLong = True;
121
+ }
122
+
123
+ if (! tooLong) break;
124
+
125
+ /* 17 Oct 04: keep-going condition for the following loop used
126
+ to be 'i < alphaSize', which missed the last element,
127
+ theoretically leading to the possibility of the compressor
128
+ looping. However, this count-scaling step is only needed if
129
+ one of the generated Huffman code words is longer than
130
+ maxLen, which up to and including version 1.0.2 was 20 bits,
131
+ which is extremely unlikely. In version 1.0.3 maxLen was
132
+ changed to 17 bits, which has minimal effect on compression
133
+ ratio, but does mean this scaling step is used from time to
134
+ time, enough to verify that it works.
135
+
136
+ This means that bzip2-1.0.3 and later will only produce
137
+ Huffman codes with a maximum length of 17 bits. However, in
138
+ order to preserve backwards compatibility with bitstreams
139
+ produced by versions pre-1.0.3, the decompressor must still
140
+ handle lengths of up to 20. */
141
+
142
+ for (i = 1; i <= alphaSize; i++) {
143
+ j = weight[i] >> 8;
144
+ j = 1 + (j / 2);
145
+ weight[i] = j << 8;
146
+ }
147
+ }
148
+ }
149
+
150
+
151
+ /*---------------------------------------------------*/
152
+ void BZ2_hbAssignCodes ( Int32 *code,
153
+ UChar *length,
154
+ Int32 minLen,
155
+ Int32 maxLen,
156
+ Int32 alphaSize )
157
+ {
158
+ Int32 n, vec, i;
159
+
160
+ vec = 0;
161
+ for (n = minLen; n <= maxLen; n++) {
162
+ for (i = 0; i < alphaSize; i++)
163
+ if (length[i] == n) { code[i] = vec; vec++; };
164
+ vec <<= 1;
165
+ }
166
+ }
167
+
168
+
169
+ /*---------------------------------------------------*/
170
+ void BZ2_hbCreateDecodeTables ( Int32 *limit,
171
+ Int32 *base,
172
+ Int32 *perm,
173
+ UChar *length,
174
+ Int32 minLen,
175
+ Int32 maxLen,
176
+ Int32 alphaSize )
177
+ {
178
+ Int32 pp, i, j, vec;
179
+
180
+ pp = 0;
181
+ for (i = minLen; i <= maxLen; i++)
182
+ for (j = 0; j < alphaSize; j++)
183
+ if (length[j] == i) { perm[pp] = j; pp++; };
184
+
185
+ for (i = 0; i < BZ_MAX_CODE_LEN; i++) base[i] = 0;
186
+ for (i = 0; i < alphaSize; i++) base[length[i]+1]++;
187
+
188
+ for (i = 1; i < BZ_MAX_CODE_LEN; i++) base[i] += base[i-1];
189
+
190
+ for (i = 0; i < BZ_MAX_CODE_LEN; i++) limit[i] = 0;
191
+ vec = 0;
192
+
193
+ for (i = minLen; i <= maxLen; i++) {
194
+ vec += (base[i+1] - base[i]);
195
+ limit[i] = vec-1;
196
+ vec <<= 1;
197
+ }
198
+ for (i = minLen + 1; i <= maxLen; i++)
199
+ base[i] = ((limit[i-1] + 1) << 1) - base[i];
200
+ }
201
+
202
+
203
+ /*-------------------------------------------------------------*/
204
+ /*--- end huffman.c ---*/
205
+ /*-------------------------------------------------------------*/
@@ -0,0 +1,84 @@
1
+
2
+ /*-------------------------------------------------------------*/
3
+ /*--- Table for randomising repetitive blocks ---*/
4
+ /*--- randtable.c ---*/
5
+ /*-------------------------------------------------------------*/
6
+
7
+ /* ------------------------------------------------------------------
8
+ This file is part of bzip2/libbzip2, a program and library for
9
+ lossless, block-sorting data compression.
10
+
11
+ bzip2/libbzip2 version 1.0.8 of 13 July 2019
12
+ Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
13
+
14
+ Please read the WARNING, DISCLAIMER and PATENTS sections in the
15
+ README file.
16
+
17
+ This program is released under the terms of the license contained
18
+ in the file LICENSE.
19
+ ------------------------------------------------------------------ */
20
+
21
+
22
+ #include "bzlib_private.h"
23
+
24
+
25
+ /*---------------------------------------------*/
26
+ Int32 BZ2_rNums[512] = {
27
+ 619, 720, 127, 481, 931, 816, 813, 233, 566, 247,
28
+ 985, 724, 205, 454, 863, 491, 741, 242, 949, 214,
29
+ 733, 859, 335, 708, 621, 574, 73, 654, 730, 472,
30
+ 419, 436, 278, 496, 867, 210, 399, 680, 480, 51,
31
+ 878, 465, 811, 169, 869, 675, 611, 697, 867, 561,
32
+ 862, 687, 507, 283, 482, 129, 807, 591, 733, 623,
33
+ 150, 238, 59, 379, 684, 877, 625, 169, 643, 105,
34
+ 170, 607, 520, 932, 727, 476, 693, 425, 174, 647,
35
+ 73, 122, 335, 530, 442, 853, 695, 249, 445, 515,
36
+ 909, 545, 703, 919, 874, 474, 882, 500, 594, 612,
37
+ 641, 801, 220, 162, 819, 984, 589, 513, 495, 799,
38
+ 161, 604, 958, 533, 221, 400, 386, 867, 600, 782,
39
+ 382, 596, 414, 171, 516, 375, 682, 485, 911, 276,
40
+ 98, 553, 163, 354, 666, 933, 424, 341, 533, 870,
41
+ 227, 730, 475, 186, 263, 647, 537, 686, 600, 224,
42
+ 469, 68, 770, 919, 190, 373, 294, 822, 808, 206,
43
+ 184, 943, 795, 384, 383, 461, 404, 758, 839, 887,
44
+ 715, 67, 618, 276, 204, 918, 873, 777, 604, 560,
45
+ 951, 160, 578, 722, 79, 804, 96, 409, 713, 940,
46
+ 652, 934, 970, 447, 318, 353, 859, 672, 112, 785,
47
+ 645, 863, 803, 350, 139, 93, 354, 99, 820, 908,
48
+ 609, 772, 154, 274, 580, 184, 79, 626, 630, 742,
49
+ 653, 282, 762, 623, 680, 81, 927, 626, 789, 125,
50
+ 411, 521, 938, 300, 821, 78, 343, 175, 128, 250,
51
+ 170, 774, 972, 275, 999, 639, 495, 78, 352, 126,
52
+ 857, 956, 358, 619, 580, 124, 737, 594, 701, 612,
53
+ 669, 112, 134, 694, 363, 992, 809, 743, 168, 974,
54
+ 944, 375, 748, 52, 600, 747, 642, 182, 862, 81,
55
+ 344, 805, 988, 739, 511, 655, 814, 334, 249, 515,
56
+ 897, 955, 664, 981, 649, 113, 974, 459, 893, 228,
57
+ 433, 837, 553, 268, 926, 240, 102, 654, 459, 51,
58
+ 686, 754, 806, 760, 493, 403, 415, 394, 687, 700,
59
+ 946, 670, 656, 610, 738, 392, 760, 799, 887, 653,
60
+ 978, 321, 576, 617, 626, 502, 894, 679, 243, 440,
61
+ 680, 879, 194, 572, 640, 724, 926, 56, 204, 700,
62
+ 707, 151, 457, 449, 797, 195, 791, 558, 945, 679,
63
+ 297, 59, 87, 824, 713, 663, 412, 693, 342, 606,
64
+ 134, 108, 571, 364, 631, 212, 174, 643, 304, 329,
65
+ 343, 97, 430, 751, 497, 314, 983, 374, 822, 928,
66
+ 140, 206, 73, 263, 980, 736, 876, 478, 430, 305,
67
+ 170, 514, 364, 692, 829, 82, 855, 953, 676, 246,
68
+ 369, 970, 294, 750, 807, 827, 150, 790, 288, 923,
69
+ 804, 378, 215, 828, 592, 281, 565, 555, 710, 82,
70
+ 896, 831, 547, 261, 524, 462, 293, 465, 502, 56,
71
+ 661, 821, 976, 991, 658, 869, 905, 758, 745, 193,
72
+ 768, 550, 608, 933, 378, 286, 215, 979, 792, 961,
73
+ 61, 688, 793, 644, 986, 403, 106, 366, 905, 644,
74
+ 372, 567, 466, 434, 645, 210, 389, 550, 919, 135,
75
+ 780, 773, 635, 389, 707, 100, 626, 958, 165, 504,
76
+ 920, 176, 193, 713, 857, 265, 203, 50, 668, 108,
77
+ 645, 990, 626, 197, 510, 357, 358, 850, 858, 364,
78
+ 936, 638
79
+ };
80
+
81
+
82
+ /*-------------------------------------------------------------*/
83
+ /*--- end randtable.c ---*/
84
+ /*-------------------------------------------------------------*/
@@ -1,5 +1,5 @@
1
1
  # frozen_string_literal: true
2
2
 
3
3
  module Bsdiff
4
- VERSION = '0.0.2'
4
+ VERSION = '0.1.0'
5
5
  end
data/lib/bsdiff.rb CHANGED
@@ -1,6 +1,7 @@
1
1
  # frozen_string_literal: true
2
2
 
3
3
  require_relative 'bsdiff/version'
4
+
4
5
  begin
5
6
  require_relative 'bsdiff.so'
6
7
  rescue LoadError => e
metadata CHANGED
@@ -1,13 +1,13 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: bsdiff
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.0.2
4
+ version: 0.1.0
5
5
  platform: ruby
6
6
  authors:
7
7
  - MatzFan
8
8
  bindir: exe
9
9
  cert_chain: []
10
- date: 2024-10-09 00:00:00.000000000 Z
10
+ date: 2024-10-13 00:00:00.000000000 Z
11
11
  dependencies: []
12
12
  description: Ruby bindings for bsdiff and bspatch
13
13
  executables: []
@@ -28,6 +28,15 @@ files:
28
28
  - ext/bsdiff/bspatch.h
29
29
  - ext/bsdiff/extconf.rb
30
30
  - ext/bsdiff/rb_bsdiff.c
31
+ - ext/bzip2/blocksort.c
32
+ - ext/bzip2/bzlib.c
33
+ - ext/bzip2/bzlib.h
34
+ - ext/bzip2/bzlib_private.h
35
+ - ext/bzip2/compress.c
36
+ - ext/bzip2/crctable.c
37
+ - ext/bzip2/decompress.c
38
+ - ext/bzip2/huffman.c
39
+ - ext/bzip2/randtable.c
31
40
  - lib/bsdiff.rb
32
41
  - lib/bsdiff/version.rb
33
42
  - sig/bsdiff.rbs