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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
use std::mem;
use std::cmp;

pub use crate::error::Error;

pub fn decompress(
    in_buf: &[u8]
) -> Result<Vec<u8>, Error>
{
    let mut out_idx:    usize = 0;
    let mut in_idx:     usize = 0;
    let mut nibble_idx: usize = 0;

    let mut indicator:     u32 = 0;
    let mut indicator_bit: u32 = 0;

    let mut length: usize;
    let mut offset: usize;

    let mut out_buf: Vec<u8> = Vec::new();

    while in_idx < in_buf.len() {
        if indicator_bit == 0 {
            indicator = u32::from(in_buf[in_idx + 3]) << 24
                        | u32::from(in_buf[in_idx + 2]) << 16
                        | u32::from(in_buf[in_idx + 1]) << 8
                        | u32::from(in_buf[in_idx]);

            in_idx = in_idx + mem::size_of::<u32>();

            indicator_bit = 32;
        }

        indicator_bit -= 1;

        // Check whether the bit specified by indicator_bit is set or not
        // set in indicator. For example, if indicator_bit has value 4
        // check whether the 4th bit of the value in indicator is set.
        if ((indicator >> indicator_bit) & 1) == 0 {
            if in_idx >= in_buf.len() {
                return Err(Error::MemLimit);
            }

            out_buf.push(in_buf[in_idx]);

            in_idx += mem::size_of::<u8>();
            out_idx += mem::size_of::<u8>();
        } else {
            if (in_idx + 1) >= in_buf.len() {
                return Err(Error::MemLimit);
            }

            length = usize::from(in_buf[in_idx + 1]) << 8
                    | usize::from(in_buf[in_idx]);

            in_idx += mem::size_of::<u16>();

            offset = length / 8;
            length = length % 8;

            if length == 7 {
                if nibble_idx == 0 {
                    nibble_idx = in_idx;

                    if in_idx >= in_buf.len() {
                        return Err(Error::MemLimit);
                    }

                    length = (in_buf[in_idx] % 16).into();

                    in_idx += mem::size_of::<u8>();
                } else {
                    if nibble_idx >= in_buf.len() {
                        return Err(Error::MemLimit);
                    }

                    length = (in_buf[nibble_idx] / 16).into();
                    nibble_idx = 0;
                }

                if length == 15 {
                    if in_idx >= in_buf.len() {
                        return Err(Error::MemLimit);
                    }

                    length = in_buf[in_idx].into();

                    in_idx += mem::size_of::<u8>();

                    if length == 255 {
                        if (in_idx + 1) >= in_buf.len() {
                            return Err(Error::MemLimit);
                        }

                        length = usize::from(in_buf[in_idx + 1]) << 8
                                | usize::from(in_buf[in_idx]);

                        in_idx += mem::size_of::<u16>();

                        length -= 15 + 7;
                    }
                    length -= 15;
                }
                length += 7;
            }

            length += 3;

            while length != 0 {
                if (offset + 1) > out_idx {
                    return Err(Error::CorruptedData);
                }

                out_buf.push(out_buf[out_idx - offset - 1]);

                out_idx += mem::size_of::<u8>();
                length -= mem::size_of::<u8>();
            }
        }
    }

    Ok(out_buf)
}

pub fn compress(
    in_buf: &[u8]
) -> Result<Vec<u8>, Error>
{

    let mut in_idx:    usize = 0;
    let mut out_idx:   usize;
    let mut byte_left: usize;

    let mut max_off:  usize;
    let mut best_off: usize;

    let mut max_len:  usize;
    let mut best_len: usize;

    let mut indic:        u32 = 0;
    let mut indic_pos:    usize;
    let mut indic_bit:    u32 = 0;
    let mut nibble_index: usize = 0;
    
    let mut metadata_size: usize;
    let mut metadata:      usize;
    let mut dest_off:      usize;

    let mut str1_off: usize;
    let mut str2_off: usize;

    let mut out_buf: Vec<u8> = Vec::new();

    // Metadata placeholder
    out_buf.push(0);
    out_buf.push(0);
    out_buf.push(0);
    out_buf.push(0);

    out_idx = mem::size_of::<u32>();
    indic_pos = 0;

    byte_left = in_buf.len();

    while byte_left >= 3 {
        let mut found: bool = false;

        max_off = in_idx;

        str1_off = in_idx;

        best_len = 3;
        best_off = 0;

        max_off = cmp::min(0x1FFF, max_off);

        // search for the longest match in the window for the lookahead buffer
        for offset in 1..=max_off {
            let len: usize = 0;
            str2_off = str1_off - offset;

            // maximum len we can encode into metadata
            max_len = cmp::min(255 + 15 + 7 + 3, byte_left);

            for len in 0..max_len {
                if in_buf[str1_off + len] != in_buf[str2_off + len] {
                    break;
                }
            }

            // We check if len is better than the value found before, including the
            // sequence of identical bytes
            if len > best_len {
                found = true;
                best_len = len;
                best_off = offset;
            }
        }

        if found {
            metadata_size = 0;
            dest_off = out_idx;

            if best_len < 10 {
                // Classical meta-data
                metadata = ((best_off - 1) << 3) | (best_len - 3);
                out_buf[dest_off + metadata_size] = metadata as u8;
                out_buf[dest_off + metadata_size + 1] = (metadata >> 8) as u8;
                metadata_size += mem::size_of::<u16>();
            } else {
                metadata = ((best_off - 1) << 3) | 7;
                out_buf[dest_off + metadata_size] = metadata as u8;
                out_buf[dest_off + metadata_size + 1] = (metadata >> 8) as u8;
                metadata_size += mem::size_of::<u16>();

                if best_len < (15 + 7 + 3) {
                    // Shared byte
                    if nibble_index == 0 {
                        out_buf[out_idx + metadata_size] = ((best_len - (3 + 7)) & 0xF) as u8;
                        metadata_size += mem::size_of::<u8>();
                    } else {
                        out_buf[nibble_index] = out_buf[nibble_index] & 0xF;
                        out_buf[nibble_index] = out_buf[nibble_index] | ((best_len - (3 + 7)) * 16) as u8;
                    }
                } else if best_len < (3 + 7 + 15 + 255) {
                    // Shared byte
                    if nibble_index == 0 {
                        out_buf[out_idx + metadata_size] = 15;
                        metadata_size += mem::size_of::<u8>();
                    } else {
                        out_buf[nibble_index] = out_buf[nibble_index] & 0xF;
                        out_buf[nibble_index] = out_buf[nibble_index] | (15 * 16);
                    }

                    // Additional best_len
                    out_buf[out_idx + metadata_size] = (best_len - (3 + 7 + 15)) as u8;
                    metadata_size += mem::size_of::<u8>();
                } else {
                    // Shared byte
                    if nibble_index == 0 {
                        out_buf[out_idx + metadata_size] = out_buf[out_idx + metadata_size] | 15;
                        metadata_size += mem::size_of::<u8>();
                    } else {
                        out_buf[nibble_index] = out_buf[nibble_index] | (15 << 4);
                    }

                    // Additional best_len
                    out_buf[out_idx + metadata_size] = 255;
                    metadata_size += mem::size_of::<u8>();

                    out_buf[out_idx + metadata_size] = (best_len - 3) as u8;
                    out_buf[out_idx + metadata_size + 1] = ((best_len - 3) >> 8) as u8;
                    metadata_size += mem::size_of::<u16>();
                }
            }

            indic |= 1 << (32 - ((indic_bit % 32) + 1));

            if best_len > 9 {
                if nibble_index == 0 {
                    nibble_index = out_idx + mem::size_of::<u16>();
                } else {
                    nibble_index = 0;
                }
            }

            out_idx += metadata_size;
            in_idx += best_len;
            byte_left -= best_len;
        } else {
            out_buf.push(in_buf[in_idx]);
            out_idx += 1;
            in_idx += 1;

            byte_left -= 1;
        }

        indic_bit += 1;

        if ((indic_bit - 1) % 32) > (indic_bit % 32) {
            out_buf[indic_pos + 0] = indic as u8;
            out_buf[indic_pos + 1] = (indic >> 8) as u8;
            out_buf[indic_pos + 2] = (indic >> 16) as u8;
            out_buf[indic_pos + 3] = (indic >> 24) as u8;

            indic = 0;
            indic_pos = out_idx;
            // Metadata placeholder
            out_buf.push(0);
            out_buf.push(0);
            out_buf.push(0);
            out_buf.push(0);
            out_idx = out_idx + mem::size_of::<u32>();
        }
    }

    while in_idx < in_buf.len() {
        out_buf.push(in_buf[in_idx]);
        indic_bit += 1;

        in_idx += 1;
        out_idx += 1;
        if ((indic_bit - 1) % 32) > (indic_bit % 32) {
            out_buf[indic_pos + 0] = indic as u8;
            out_buf[indic_pos + 1] = (indic >> 8) as u8;
            out_buf[indic_pos + 2] = (indic >> 16) as u8;
            out_buf[indic_pos + 3] = (indic >> 24) as u8;

            indic = 0;
            indic_pos = out_idx;
            out_idx = out_idx + mem::size_of::<u32>();
        }
    }

    if (indic_bit % 32) > 0 {
        while (indic_bit % 32) != 0 {
            indic |= 1 << (32 - ((indic_bit % 32) + 1));
            indic_bit += 1;
        }

        out_buf[indic_pos + 0] = indic as u8;
        out_buf[indic_pos + 1] = (indic >> 8) as u8;
        out_buf[indic_pos + 2] = (indic >> 16) as u8;
        out_buf[indic_pos + 3] = (indic >> 24) as u8;

        // out_idx = out_idx + mem::size_of::<u32>();
    }

    Ok(out_buf)
}