Loading...
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 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 | // SPDX-License-Identifier: GPL-2.0-or-later /* * 842 Software Decompression * * Copyright (C) 2015 Dan Streetman, IBM Corp * * See 842.h for details of the 842 compressed format. */ #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt #define MODULE_NAME "842_decompress" #include "842.h" #include "842_debugfs.h" /* rolling fifo sizes */ #define I2_FIFO_SIZE (2 * (1 << I2_BITS)) #define I4_FIFO_SIZE (4 * (1 << I4_BITS)) #define I8_FIFO_SIZE (8 * (1 << I8_BITS)) static u8 decomp_ops[OPS_MAX][4] = { { D8, N0, N0, N0 }, { D4, D2, I2, N0 }, { D4, I2, D2, N0 }, { D4, I2, I2, N0 }, { D4, I4, N0, N0 }, { D2, I2, D4, N0 }, { D2, I2, D2, I2 }, { D2, I2, I2, D2 }, { D2, I2, I2, I2 }, { D2, I2, I4, N0 }, { I2, D2, D4, N0 }, { I2, D4, I2, N0 }, { I2, D2, I2, D2 }, { I2, D2, I2, I2 }, { I2, D2, I4, N0 }, { I2, I2, D4, N0 }, { I2, I2, D2, I2 }, { I2, I2, I2, D2 }, { I2, I2, I2, I2 }, { I2, I2, I4, N0 }, { I4, D4, N0, N0 }, { I4, D2, I2, N0 }, { I4, I2, D2, N0 }, { I4, I2, I2, N0 }, { I4, I4, N0, N0 }, { I8, N0, N0, N0 } }; struct sw842_param { u8 *in; u8 bit; u64 ilen; u8 *out; u8 *ostart; u64 olen; }; #define beN_to_cpu(d, s) \ ((s) == 2 ? be16_to_cpu(get_unaligned((__be16 *)d)) : \ (s) == 4 ? be32_to_cpu(get_unaligned((__be32 *)d)) : \ (s) == 8 ? be64_to_cpu(get_unaligned((__be64 *)d)) : \ 0) static int next_bits(struct sw842_param *p, u64 *d, u8 n); static int __split_next_bits(struct sw842_param *p, u64 *d, u8 n, u8 s) { u64 tmp = 0; int ret; if (n <= s) { pr_debug("split_next_bits invalid n %u s %u\n", n, s); return -EINVAL; } ret = next_bits(p, &tmp, n - s); if (ret) return ret; ret = next_bits(p, d, s); if (ret) return ret; *d |= tmp << s; return 0; } static int next_bits(struct sw842_param *p, u64 *d, u8 n) { u8 *in = p->in, b = p->bit, bits = b + n; if (n > 64) { pr_debug("next_bits invalid n %u\n", n); return -EINVAL; } /* split this up if reading > 8 bytes, or if we're at the end of * the input buffer and would read past the end */ if (bits > 64) return __split_next_bits(p, d, n, 32); else if (p->ilen < 8 && bits > 32 && bits <= 56) return __split_next_bits(p, d, n, 16); else if (p->ilen < 4 && bits > 16 && bits <= 24) return __split_next_bits(p, d, n, 8); if (DIV_ROUND_UP(bits, 8) > p->ilen) return -EOVERFLOW; if (bits <= 8) *d = *in >> (8 - bits); else if (bits <= 16) *d = be16_to_cpu(get_unaligned((__be16 *)in)) >> (16 - bits); else if (bits <= 32) *d = be32_to_cpu(get_unaligned((__be32 *)in)) >> (32 - bits); else *d = be64_to_cpu(get_unaligned((__be64 *)in)) >> (64 - bits); *d &= GENMASK_ULL(n - 1, 0); p->bit += n; if (p->bit > 7) { p->in += p->bit / 8; p->ilen -= p->bit / 8; p->bit %= 8; } return 0; } static int do_data(struct sw842_param *p, u8 n) { u64 v; int ret; if (n > p->olen) return -ENOSPC; ret = next_bits(p, &v, n * 8); if (ret) return ret; switch (n) { case 2: put_unaligned(cpu_to_be16((u16)v), (__be16 *)p->out); break; case 4: put_unaligned(cpu_to_be32((u32)v), (__be32 *)p->out); break; case 8: put_unaligned(cpu_to_be64((u64)v), (__be64 *)p->out); break; default: return -EINVAL; } p->out += n; p->olen -= n; return 0; } static int __do_index(struct sw842_param *p, u8 size, u8 bits, u64 fsize) { u64 index, offset, total = round_down(p->out - p->ostart, 8); int ret; ret = next_bits(p, &index, bits); if (ret) return ret; offset = index * size; /* a ring buffer of fsize is used; correct the offset */ if (total > fsize) { /* this is where the current fifo is */ u64 section = round_down(total, fsize); /* the current pos in the fifo */ u64 pos = total - section; /* if the offset is past/at the pos, we need to * go back to the last fifo section */ if (offset >= pos) section -= fsize; offset += section; } if (offset + size > total) { pr_debug("index%x %lx points past end %lx\n", size, (unsigned long)offset, (unsigned long)total); return -EINVAL; } if (size != 2 && size != 4 && size != 8) WARN(1, "__do_index invalid size %x\n", size); else pr_debug("index%x to %lx off %lx adjoff %lx tot %lx data %lx\n", size, (unsigned long)index, (unsigned long)(index * size), (unsigned long)offset, (unsigned long)total, (unsigned long)beN_to_cpu(&p->ostart[offset], size)); memcpy(p->out, &p->ostart[offset], size); p->out += size; p->olen -= size; return 0; } static int do_index(struct sw842_param *p, u8 n) { switch (n) { case 2: return __do_index(p, 2, I2_BITS, I2_FIFO_SIZE); case 4: return __do_index(p, 4, I4_BITS, I4_FIFO_SIZE); case 8: return __do_index(p, 8, I8_BITS, I8_FIFO_SIZE); default: return -EINVAL; } } static int do_op(struct sw842_param *p, u8 o) { int i, ret = 0; if (o >= OPS_MAX) return -EINVAL; for (i = 0; i < 4; i++) { u8 op = decomp_ops[o][i]; pr_debug("op is %x\n", op); switch (op & OP_ACTION) { case OP_ACTION_DATA: ret = do_data(p, op & OP_AMOUNT); break; case OP_ACTION_INDEX: ret = do_index(p, op & OP_AMOUNT); break; case OP_ACTION_NOOP: break; default: pr_err("Internal error, invalid op %x\n", op); return -EINVAL; } if (ret) return ret; } if (sw842_template_counts) atomic_inc(&template_count[o]); return 0; } /** * sw842_decompress * * Decompress the 842-compressed buffer of length @ilen at @in * to the output buffer @out, using no more than @olen bytes. * * The compressed buffer must be only a single 842-compressed buffer, * with the standard format described in the comments in 842.h * Processing will stop when the 842 "END" template is detected, * not the end of the buffer. * * Returns: 0 on success, error on failure. The @olen parameter * will contain the number of output bytes written on success, or * 0 on error. */ int sw842_decompress(const u8 *in, unsigned int ilen, u8 *out, unsigned int *olen) { struct sw842_param p; int ret; u64 op, rep, tmp, bytes, total; u64 crc; p.in = (u8 *)in; p.bit = 0; p.ilen = ilen; p.out = out; p.ostart = out; p.olen = *olen; total = p.olen; *olen = 0; do { ret = next_bits(&p, &op, OP_BITS); if (ret) return ret; pr_debug("template is %lx\n", (unsigned long)op); switch (op) { case OP_REPEAT: ret = next_bits(&p, &rep, REPEAT_BITS); if (ret) return ret; if (p.out == out) /* no previous bytes */ return -EINVAL; /* copy rep + 1 */ rep++; if (rep * 8 > p.olen) return -ENOSPC; while (rep-- > 0) { memcpy(p.out, p.out - 8, 8); p.out += 8; p.olen -= 8; } if (sw842_template_counts) atomic_inc(&template_repeat_count); break; case OP_ZEROS: if (8 > p.olen) return -ENOSPC; memset(p.out, 0, 8); p.out += 8; p.olen -= 8; if (sw842_template_counts) atomic_inc(&template_zeros_count); break; case OP_SHORT_DATA: ret = next_bits(&p, &bytes, SHORT_DATA_BITS); if (ret) return ret; if (!bytes || bytes > SHORT_DATA_BITS_MAX) return -EINVAL; while (bytes-- > 0) { ret = next_bits(&p, &tmp, 8); if (ret) return ret; *p.out = (u8)tmp; p.out++; p.olen--; } if (sw842_template_counts) atomic_inc(&template_short_data_count); break; case OP_END: if (sw842_template_counts) atomic_inc(&template_end_count); break; default: /* use template */ ret = do_op(&p, op); if (ret) return ret; break; } } while (op != OP_END); /* * crc(0:31) is saved in compressed data starting with the * next bit after End of stream template. */ ret = next_bits(&p, &crc, CRC_BITS); if (ret) return ret; /* * Validate CRC saved in compressed data. */ if (crc != (u64)crc32_be(0, out, total - p.olen)) { pr_debug("CRC mismatch for decompression\n"); return -EINVAL; } if (unlikely((total - p.olen) > UINT_MAX)) return -ENOSPC; *olen = total - p.olen; return 0; } EXPORT_SYMBOL_GPL(sw842_decompress); static int __init sw842_init(void) { if (sw842_template_counts) sw842_debugfs_create(); return 0; } module_init(sw842_init); static void __exit sw842_exit(void) { if (sw842_template_counts) sw842_debugfs_remove(); } module_exit(sw842_exit); MODULE_LICENSE("GPL"); MODULE_DESCRIPTION("Software 842 Decompressor"); MODULE_AUTHOR("Dan Streetman <ddstreet@ieee.org>"); |