lzo1x_compress.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280
  1. /*
  2. * LZO1X Compressor from LZO
  3. *
  4. * Copyright (C) 1996-2012 Markus F.X.J. Oberhumer <markus@oberhumer.com>
  5. *
  6. * The full LZO package can be found at:
  7. * http://www.oberhumer.com/opensource/lzo/
  8. *
  9. * Changed for Linux kernel use by:
  10. * Nitin Gupta <nitingupta910@gmail.com>
  11. * Richard Purdie <rpurdie@openedhand.com>
  12. */
  13. #include <linux/module.h>
  14. #include <linux/kernel.h>
  15. #include <asm/unaligned.h>
  16. #include <linux/lzo.h>
  17. #include "lzodefs.h"
  18. static noinline size_t
  19. lzo1x_1_do_compress(const unsigned char *in, size_t in_len,
  20. unsigned char *out, size_t *out_len,
  21. size_t ti, void *wrkmem)
  22. {
  23. const unsigned char *ip;
  24. unsigned char *op;
  25. const unsigned char * const in_end = in + in_len;
  26. const unsigned char * const ip_end = in + in_len - 20;
  27. const unsigned char *ii;
  28. lzo_dict_t * const dict = (lzo_dict_t *) wrkmem;
  29. op = out;
  30. ip = in;
  31. ii = ip;
  32. ip += ti < 4 ? 4 - ti : 0;
  33. for (;;) {
  34. const unsigned char *m_pos;
  35. size_t t, m_len, m_off;
  36. u32 dv;
  37. literal:
  38. ip += 1 + ((ip - ii) >> 5);
  39. next:
  40. if (unlikely(ip >= ip_end))
  41. break;
  42. dv = get_unaligned_le32(ip);
  43. t = ((dv * 0x1824429d) >> (32 - D_BITS)) & D_MASK;
  44. m_pos = in + dict[t];
  45. dict[t] = (lzo_dict_t) (ip - in);
  46. if (unlikely(dv != get_unaligned_le32(m_pos)))
  47. goto literal;
  48. ii -= ti;
  49. ti = 0;
  50. t = ip - ii;
  51. if (t != 0) {
  52. if (t <= 3) {
  53. op[-2] |= t;
  54. COPY4(op, ii);
  55. op += t;
  56. } else if (t <= 16) {
  57. *op++ = (t - 3);
  58. COPY8(op, ii);
  59. COPY8(op + 8, ii + 8);
  60. op += t;
  61. } else {
  62. if (t <= 18) {
  63. *op++ = (t - 3);
  64. } else {
  65. size_t tt = t - 18;
  66. *op++ = 0;
  67. while (unlikely(tt > 255)) {
  68. tt -= 255;
  69. *op++ = 0;
  70. }
  71. *op++ = tt;
  72. }
  73. do {
  74. COPY8(op, ii);
  75. COPY8(op + 8, ii + 8);
  76. op += 16;
  77. ii += 16;
  78. t -= 16;
  79. } while (t >= 16);
  80. if (t > 0) do {
  81. *op++ = *ii++;
  82. } while (--t > 0);
  83. }
  84. }
  85. m_len = 4;
  86. {
  87. #if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && defined(LZO_USE_CTZ64)
  88. u64 v;
  89. v = get_unaligned((const u64 *) (ip + m_len)) ^
  90. get_unaligned((const u64 *) (m_pos + m_len));
  91. if (unlikely(v == 0)) {
  92. do {
  93. m_len += 8;
  94. v = get_unaligned((const u64 *) (ip + m_len)) ^
  95. get_unaligned((const u64 *) (m_pos + m_len));
  96. if (unlikely(ip + m_len >= ip_end))
  97. goto m_len_done;
  98. } while (v == 0);
  99. }
  100. # if defined(__LITTLE_ENDIAN)
  101. m_len += (unsigned) __builtin_ctzll(v) / 8;
  102. # elif defined(__BIG_ENDIAN)
  103. m_len += (unsigned) __builtin_clzll(v) / 8;
  104. # else
  105. # error "missing endian definition"
  106. # endif
  107. #elif defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && defined(LZO_USE_CTZ32)
  108. u32 v;
  109. v = get_unaligned((const u32 *) (ip + m_len)) ^
  110. get_unaligned((const u32 *) (m_pos + m_len));
  111. if (unlikely(v == 0)) {
  112. do {
  113. m_len += 4;
  114. v = get_unaligned((const u32 *) (ip + m_len)) ^
  115. get_unaligned((const u32 *) (m_pos + m_len));
  116. if (v != 0)
  117. break;
  118. m_len += 4;
  119. v = get_unaligned((const u32 *) (ip + m_len)) ^
  120. get_unaligned((const u32 *) (m_pos + m_len));
  121. if (unlikely(ip + m_len >= ip_end))
  122. goto m_len_done;
  123. } while (v == 0);
  124. }
  125. # if defined(__LITTLE_ENDIAN)
  126. m_len += (unsigned) __builtin_ctz(v) / 8;
  127. # elif defined(__BIG_ENDIAN)
  128. m_len += (unsigned) __builtin_clz(v) / 8;
  129. # else
  130. # error "missing endian definition"
  131. # endif
  132. #else
  133. if (unlikely(ip[m_len] == m_pos[m_len])) {
  134. do {
  135. m_len += 1;
  136. if (ip[m_len] != m_pos[m_len])
  137. break;
  138. m_len += 1;
  139. if (ip[m_len] != m_pos[m_len])
  140. break;
  141. m_len += 1;
  142. if (ip[m_len] != m_pos[m_len])
  143. break;
  144. m_len += 1;
  145. if (ip[m_len] != m_pos[m_len])
  146. break;
  147. m_len += 1;
  148. if (ip[m_len] != m_pos[m_len])
  149. break;
  150. m_len += 1;
  151. if (ip[m_len] != m_pos[m_len])
  152. break;
  153. m_len += 1;
  154. if (ip[m_len] != m_pos[m_len])
  155. break;
  156. m_len += 1;
  157. if (unlikely(ip + m_len >= ip_end))
  158. goto m_len_done;
  159. } while (ip[m_len] == m_pos[m_len]);
  160. }
  161. #endif
  162. }
  163. m_len_done:
  164. m_off = ip - m_pos;
  165. ip += m_len;
  166. ii = ip;
  167. if (m_len <= M2_MAX_LEN && m_off <= M2_MAX_OFFSET) {
  168. m_off -= 1;
  169. *op++ = (((m_len - 1) << 5) | ((m_off & 7) << 2));
  170. *op++ = (m_off >> 3);
  171. } else if (m_off <= M3_MAX_OFFSET) {
  172. m_off -= 1;
  173. if (m_len <= M3_MAX_LEN)
  174. *op++ = (M3_MARKER | (m_len - 2));
  175. else {
  176. m_len -= M3_MAX_LEN;
  177. *op++ = M3_MARKER | 0;
  178. while (unlikely(m_len > 255)) {
  179. m_len -= 255;
  180. *op++ = 0;
  181. }
  182. *op++ = (m_len);
  183. }
  184. *op++ = (m_off << 2);
  185. *op++ = (m_off >> 6);
  186. } else {
  187. m_off -= 0x4000;
  188. if (m_len <= M4_MAX_LEN)
  189. *op++ = (M4_MARKER | ((m_off >> 11) & 8)
  190. | (m_len - 2));
  191. else {
  192. m_len -= M4_MAX_LEN;
  193. *op++ = (M4_MARKER | ((m_off >> 11) & 8));
  194. while (unlikely(m_len > 255)) {
  195. m_len -= 255;
  196. *op++ = 0;
  197. }
  198. *op++ = (m_len);
  199. }
  200. *op++ = (m_off << 2);
  201. *op++ = (m_off >> 6);
  202. }
  203. goto next;
  204. }
  205. *out_len = op - out;
  206. return in_end - (ii - ti);
  207. }
  208. int lzo1x_1_compress(const unsigned char *in, size_t in_len,
  209. unsigned char *out, size_t *out_len,
  210. void *wrkmem)
  211. {
  212. const unsigned char *ip = in;
  213. unsigned char *op = out;
  214. size_t l = in_len;
  215. size_t t = 0;
  216. while (l > 20) {
  217. size_t ll = l <= (M4_MAX_OFFSET + 1) ? l : (M4_MAX_OFFSET + 1);
  218. uintptr_t ll_end = (uintptr_t) ip + ll;
  219. if ((ll_end + ((t + ll) >> 5)) <= ll_end)
  220. break;
  221. BUILD_BUG_ON(D_SIZE * sizeof(lzo_dict_t) > LZO1X_1_MEM_COMPRESS);
  222. memset(wrkmem, 0, D_SIZE * sizeof(lzo_dict_t));
  223. t = lzo1x_1_do_compress(ip, ll, op, out_len, t, wrkmem);
  224. ip += ll;
  225. op += *out_len;
  226. l -= ll;
  227. }
  228. t += l;
  229. if (t > 0) {
  230. const unsigned char *ii = in + in_len - t;
  231. if (op == out && t <= 238) {
  232. *op++ = (17 + t);
  233. } else if (t <= 3) {
  234. op[-2] |= t;
  235. } else if (t <= 18) {
  236. *op++ = (t - 3);
  237. } else {
  238. size_t tt = t - 18;
  239. *op++ = 0;
  240. while (tt > 255) {
  241. tt -= 255;
  242. *op++ = 0;
  243. }
  244. *op++ = tt;
  245. }
  246. if (t >= 16) do {
  247. COPY8(op, ii);
  248. COPY8(op + 8, ii + 8);
  249. op += 16;
  250. ii += 16;
  251. t -= 16;
  252. } while (t >= 16);
  253. if (t > 0) do {
  254. *op++ = *ii++;
  255. } while (--t > 0);
  256. }
  257. *op++ = M4_MARKER | 1;
  258. *op++ = 0;
  259. *op++ = 0;
  260. *out_len = op - out;
  261. return LZO_E_OK;
  262. }
  263. EXPORT_SYMBOL_GPL(lzo1x_1_compress);
  264. MODULE_LICENSE("GPL");
  265. MODULE_DESCRIPTION("LZO1X-1 Compressor");