lzo1x_compress.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * LZO1X Compressor from LZO
  4. *
  5. * Copyright (C) 1996-2012 Markus F.X.J. Oberhumer <markus@oberhumer.com>
  6. *
  7. * The full LZO package can be found at:
  8. * http://www.oberhumer.com/opensource/lzo/
  9. *
  10. * Changed for Linux kernel use by:
  11. * Nitin Gupta <nitingupta910@gmail.com>
  12. * Richard Purdie <rpurdie@openedhand.com>
  13. */
  14. #include <linux/module.h>
  15. #include <linux/kernel.h>
  16. #include <linux/unaligned.h>
  17. #include <linux/lzo.h>
  18. #include "lzodefs.h"
  19. #undef LZO_UNSAFE
  20. #ifndef LZO_SAFE
  21. #define LZO_UNSAFE 1
  22. #define LZO_SAFE(name) name
  23. #define HAVE_OP(x) 1
  24. #endif
  25. #define NEED_OP(x) if (unlikely(!HAVE_OP(x))) goto output_overrun
  26. static noinline int
  27. LZO_SAFE(lzo1x_1_do_compress)(const unsigned char *in, size_t in_len,
  28. unsigned char **out, unsigned char *op_end,
  29. size_t *tp, void *wrkmem,
  30. signed char *state_offset,
  31. const unsigned char bitstream_version)
  32. {
  33. const unsigned char *ip;
  34. unsigned char *op;
  35. const unsigned char * const in_end = in + in_len;
  36. const unsigned char * const ip_end = in + in_len - 20;
  37. const unsigned char *ii;
  38. lzo_dict_t * const dict = (lzo_dict_t *) wrkmem;
  39. size_t ti = *tp;
  40. op = *out;
  41. ip = in;
  42. ii = ip;
  43. ip += ti < 4 ? 4 - ti : 0;
  44. for (;;) {
  45. const unsigned char *m_pos = NULL;
  46. size_t t, m_len, m_off;
  47. u32 dv;
  48. u32 run_length = 0;
  49. literal:
  50. ip += 1 + ((ip - ii) >> 5);
  51. next:
  52. if (unlikely(ip >= ip_end))
  53. break;
  54. dv = get_unaligned_le32(ip);
  55. if (dv == 0 && bitstream_version) {
  56. const unsigned char *ir = ip + 4;
  57. const unsigned char *limit = min(ip_end, ip + MAX_ZERO_RUN_LENGTH + 1);
  58. #if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && \
  59. defined(LZO_FAST_64BIT_MEMORY_ACCESS)
  60. u64 dv64;
  61. for (; (ir + 32) <= limit; ir += 32) {
  62. dv64 = get_unaligned((u64 *)ir);
  63. dv64 |= get_unaligned((u64 *)ir + 1);
  64. dv64 |= get_unaligned((u64 *)ir + 2);
  65. dv64 |= get_unaligned((u64 *)ir + 3);
  66. if (dv64)
  67. break;
  68. }
  69. for (; (ir + 8) <= limit; ir += 8) {
  70. dv64 = get_unaligned((u64 *)ir);
  71. if (dv64) {
  72. # if defined(__LITTLE_ENDIAN)
  73. ir += __builtin_ctzll(dv64) >> 3;
  74. # elif defined(__BIG_ENDIAN)
  75. ir += __builtin_clzll(dv64) >> 3;
  76. # else
  77. # error "missing endian definition"
  78. # endif
  79. break;
  80. }
  81. }
  82. #else
  83. while ((ir < (const unsigned char *)
  84. ALIGN((uintptr_t)ir, 4)) &&
  85. (ir < limit) && (*ir == 0))
  86. ir++;
  87. if (IS_ALIGNED((uintptr_t)ir, 4)) {
  88. for (; (ir + 4) <= limit; ir += 4) {
  89. dv = *((u32 *)ir);
  90. if (dv) {
  91. # if defined(__LITTLE_ENDIAN)
  92. ir += __builtin_ctz(dv) >> 3;
  93. # elif defined(__BIG_ENDIAN)
  94. ir += __builtin_clz(dv) >> 3;
  95. # else
  96. # error "missing endian definition"
  97. # endif
  98. break;
  99. }
  100. }
  101. }
  102. #endif
  103. while (likely(ir < limit) && unlikely(*ir == 0))
  104. ir++;
  105. run_length = ir - ip;
  106. if (run_length > MAX_ZERO_RUN_LENGTH)
  107. run_length = MAX_ZERO_RUN_LENGTH;
  108. } else {
  109. t = ((dv * 0x1824429d) >> (32 - D_BITS)) & D_MASK;
  110. m_pos = in + dict[t];
  111. dict[t] = (lzo_dict_t) (ip - in);
  112. if (unlikely(dv != get_unaligned_le32(m_pos)))
  113. goto literal;
  114. }
  115. ii -= ti;
  116. ti = 0;
  117. t = ip - ii;
  118. if (t != 0) {
  119. if (t <= 3) {
  120. op[*state_offset] |= t;
  121. NEED_OP(4);
  122. COPY4(op, ii);
  123. op += t;
  124. } else if (t <= 16) {
  125. NEED_OP(17);
  126. *op++ = (t - 3);
  127. COPY8(op, ii);
  128. COPY8(op + 8, ii + 8);
  129. op += t;
  130. } else {
  131. if (t <= 18) {
  132. NEED_OP(1);
  133. *op++ = (t - 3);
  134. } else {
  135. size_t tt = t - 18;
  136. NEED_OP(1);
  137. *op++ = 0;
  138. while (unlikely(tt > 255)) {
  139. tt -= 255;
  140. NEED_OP(1);
  141. *op++ = 0;
  142. }
  143. NEED_OP(1);
  144. *op++ = tt;
  145. }
  146. NEED_OP(t);
  147. do {
  148. COPY8(op, ii);
  149. COPY8(op + 8, ii + 8);
  150. op += 16;
  151. ii += 16;
  152. t -= 16;
  153. } while (t >= 16);
  154. if (t > 0) do {
  155. *op++ = *ii++;
  156. } while (--t > 0);
  157. }
  158. }
  159. if (unlikely(run_length)) {
  160. ip += run_length;
  161. run_length -= MIN_ZERO_RUN_LENGTH;
  162. NEED_OP(4);
  163. put_unaligned_le32((run_length << 21) | 0xfffc18
  164. | (run_length & 0x7), op);
  165. op += 4;
  166. run_length = 0;
  167. *state_offset = -3;
  168. goto finished_writing_instruction;
  169. }
  170. m_len = 4;
  171. {
  172. #if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && defined(LZO_USE_CTZ64)
  173. u64 v;
  174. v = get_unaligned((const u64 *) (ip + m_len)) ^
  175. get_unaligned((const u64 *) (m_pos + m_len));
  176. if (unlikely(v == 0)) {
  177. do {
  178. m_len += 8;
  179. v = get_unaligned((const u64 *) (ip + m_len)) ^
  180. get_unaligned((const u64 *) (m_pos + m_len));
  181. if (unlikely(ip + m_len >= ip_end))
  182. goto m_len_done;
  183. } while (v == 0);
  184. }
  185. # if defined(__LITTLE_ENDIAN)
  186. m_len += (unsigned) __builtin_ctzll(v) / 8;
  187. # elif defined(__BIG_ENDIAN)
  188. m_len += (unsigned) __builtin_clzll(v) / 8;
  189. # else
  190. # error "missing endian definition"
  191. # endif
  192. #elif defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && defined(LZO_USE_CTZ32)
  193. u32 v;
  194. v = get_unaligned((const u32 *) (ip + m_len)) ^
  195. get_unaligned((const u32 *) (m_pos + m_len));
  196. if (unlikely(v == 0)) {
  197. do {
  198. m_len += 4;
  199. v = get_unaligned((const u32 *) (ip + m_len)) ^
  200. get_unaligned((const u32 *) (m_pos + m_len));
  201. if (v != 0)
  202. break;
  203. m_len += 4;
  204. v = get_unaligned((const u32 *) (ip + m_len)) ^
  205. get_unaligned((const u32 *) (m_pos + m_len));
  206. if (unlikely(ip + m_len >= ip_end))
  207. goto m_len_done;
  208. } while (v == 0);
  209. }
  210. # if defined(__LITTLE_ENDIAN)
  211. m_len += (unsigned) __builtin_ctz(v) / 8;
  212. # elif defined(__BIG_ENDIAN)
  213. m_len += (unsigned) __builtin_clz(v) / 8;
  214. # else
  215. # error "missing endian definition"
  216. # endif
  217. #else
  218. if (unlikely(ip[m_len] == m_pos[m_len])) {
  219. do {
  220. m_len += 1;
  221. if (ip[m_len] != m_pos[m_len])
  222. break;
  223. m_len += 1;
  224. if (ip[m_len] != m_pos[m_len])
  225. break;
  226. m_len += 1;
  227. if (ip[m_len] != m_pos[m_len])
  228. break;
  229. m_len += 1;
  230. if (ip[m_len] != m_pos[m_len])
  231. break;
  232. m_len += 1;
  233. if (ip[m_len] != m_pos[m_len])
  234. break;
  235. m_len += 1;
  236. if (ip[m_len] != m_pos[m_len])
  237. break;
  238. m_len += 1;
  239. if (ip[m_len] != m_pos[m_len])
  240. break;
  241. m_len += 1;
  242. if (unlikely(ip + m_len >= ip_end))
  243. goto m_len_done;
  244. } while (ip[m_len] == m_pos[m_len]);
  245. }
  246. #endif
  247. }
  248. m_len_done:
  249. m_off = ip - m_pos;
  250. ip += m_len;
  251. if (m_len <= M2_MAX_LEN && m_off <= M2_MAX_OFFSET) {
  252. m_off -= 1;
  253. NEED_OP(2);
  254. *op++ = (((m_len - 1) << 5) | ((m_off & 7) << 2));
  255. *op++ = (m_off >> 3);
  256. } else if (m_off <= M3_MAX_OFFSET) {
  257. m_off -= 1;
  258. NEED_OP(1);
  259. if (m_len <= M3_MAX_LEN)
  260. *op++ = (M3_MARKER | (m_len - 2));
  261. else {
  262. m_len -= M3_MAX_LEN;
  263. *op++ = M3_MARKER | 0;
  264. while (unlikely(m_len > 255)) {
  265. m_len -= 255;
  266. NEED_OP(1);
  267. *op++ = 0;
  268. }
  269. NEED_OP(1);
  270. *op++ = (m_len);
  271. }
  272. NEED_OP(2);
  273. *op++ = (m_off << 2);
  274. *op++ = (m_off >> 6);
  275. } else {
  276. m_off -= 0x4000;
  277. NEED_OP(1);
  278. if (m_len <= M4_MAX_LEN)
  279. *op++ = (M4_MARKER | ((m_off >> 11) & 8)
  280. | (m_len - 2));
  281. else {
  282. if (unlikely(((m_off & 0x403f) == 0x403f)
  283. && (m_len >= 261)
  284. && (m_len <= 264))
  285. && likely(bitstream_version)) {
  286. // Under lzo-rle, block copies
  287. // for 261 <= length <= 264 and
  288. // (distance & 0x80f3) == 0x80f3
  289. // can result in ambiguous
  290. // output. Adjust length
  291. // to 260 to prevent ambiguity.
  292. ip -= m_len - 260;
  293. m_len = 260;
  294. }
  295. m_len -= M4_MAX_LEN;
  296. *op++ = (M4_MARKER | ((m_off >> 11) & 8));
  297. while (unlikely(m_len > 255)) {
  298. NEED_OP(1);
  299. m_len -= 255;
  300. *op++ = 0;
  301. }
  302. NEED_OP(1);
  303. *op++ = (m_len);
  304. }
  305. NEED_OP(2);
  306. *op++ = (m_off << 2);
  307. *op++ = (m_off >> 6);
  308. }
  309. *state_offset = -2;
  310. finished_writing_instruction:
  311. ii = ip;
  312. goto next;
  313. }
  314. *out = op;
  315. *tp = in_end - (ii - ti);
  316. return LZO_E_OK;
  317. output_overrun:
  318. return LZO_E_OUTPUT_OVERRUN;
  319. }
  320. static int LZO_SAFE(lzogeneric1x_1_compress)(
  321. const unsigned char *in, size_t in_len,
  322. unsigned char *out, size_t *out_len,
  323. void *wrkmem, const unsigned char bitstream_version)
  324. {
  325. unsigned char * const op_end = out + *out_len;
  326. const unsigned char *ip = in;
  327. unsigned char *op = out;
  328. unsigned char *data_start;
  329. size_t l = in_len;
  330. size_t t = 0;
  331. signed char state_offset = -2;
  332. unsigned int m4_max_offset;
  333. // LZO v0 will never write 17 as first byte (except for zero-length
  334. // input), so this is used to version the bitstream
  335. if (bitstream_version > 0) {
  336. *op++ = 17;
  337. *op++ = bitstream_version;
  338. m4_max_offset = M4_MAX_OFFSET_V1;
  339. } else {
  340. m4_max_offset = M4_MAX_OFFSET_V0;
  341. }
  342. data_start = op;
  343. while (l > 20) {
  344. size_t ll = min_t(size_t, l, m4_max_offset + 1);
  345. uintptr_t ll_end = (uintptr_t) ip + ll;
  346. int err;
  347. if ((ll_end + ((t + ll) >> 5)) <= ll_end)
  348. break;
  349. BUILD_BUG_ON(D_SIZE * sizeof(lzo_dict_t) > LZO1X_1_MEM_COMPRESS);
  350. memset(wrkmem, 0, D_SIZE * sizeof(lzo_dict_t));
  351. err = LZO_SAFE(lzo1x_1_do_compress)(
  352. ip, ll, &op, op_end, &t, wrkmem,
  353. &state_offset, bitstream_version);
  354. if (err != LZO_E_OK)
  355. return err;
  356. ip += ll;
  357. l -= ll;
  358. }
  359. t += l;
  360. if (t > 0) {
  361. const unsigned char *ii = in + in_len - t;
  362. if (op == data_start && t <= 238) {
  363. NEED_OP(1);
  364. *op++ = (17 + t);
  365. } else if (t <= 3) {
  366. op[state_offset] |= t;
  367. } else if (t <= 18) {
  368. NEED_OP(1);
  369. *op++ = (t - 3);
  370. } else {
  371. size_t tt = t - 18;
  372. NEED_OP(1);
  373. *op++ = 0;
  374. while (tt > 255) {
  375. tt -= 255;
  376. NEED_OP(1);
  377. *op++ = 0;
  378. }
  379. NEED_OP(1);
  380. *op++ = tt;
  381. }
  382. NEED_OP(t);
  383. if (t >= 16) do {
  384. COPY8(op, ii);
  385. COPY8(op + 8, ii + 8);
  386. op += 16;
  387. ii += 16;
  388. t -= 16;
  389. } while (t >= 16);
  390. if (t > 0) do {
  391. *op++ = *ii++;
  392. } while (--t > 0);
  393. }
  394. NEED_OP(3);
  395. *op++ = M4_MARKER | 1;
  396. *op++ = 0;
  397. *op++ = 0;
  398. *out_len = op - out;
  399. return LZO_E_OK;
  400. output_overrun:
  401. return LZO_E_OUTPUT_OVERRUN;
  402. }
  403. int LZO_SAFE(lzo1x_1_compress)(const unsigned char *in, size_t in_len,
  404. unsigned char *out, size_t *out_len,
  405. void *wrkmem)
  406. {
  407. return LZO_SAFE(lzogeneric1x_1_compress)(
  408. in, in_len, out, out_len, wrkmem, 0);
  409. }
  410. int LZO_SAFE(lzorle1x_1_compress)(const unsigned char *in, size_t in_len,
  411. unsigned char *out, size_t *out_len,
  412. void *wrkmem)
  413. {
  414. return LZO_SAFE(lzogeneric1x_1_compress)(
  415. in, in_len, out, out_len, wrkmem, LZO_VERSION);
  416. }
  417. EXPORT_SYMBOL_GPL(LZO_SAFE(lzo1x_1_compress));
  418. EXPORT_SYMBOL_GPL(LZO_SAFE(lzorle1x_1_compress));
  419. #ifndef LZO_UNSAFE
  420. MODULE_LICENSE("GPL");
  421. MODULE_DESCRIPTION("LZO1X-1 Compressor");
  422. #endif