compr_rubin.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126
  1. /*
  2. * JFFS2 -- Journalling Flash File System, Version 2.
  3. *
  4. * Copyright (C) 2001 Red Hat, Inc.
  5. *
  6. * Created by Arjan van de Ven <arjanv@redhat.com>
  7. *
  8. * Heavily modified by Russ Dill <Russ.Dill@asu.edu> in an attempt at
  9. * a little more speed.
  10. *
  11. * The original JFFS, from which the design for JFFS2 was derived,
  12. * was designed and implemented by Axis Communications AB.
  13. *
  14. * The contents of this file are subject to the Red Hat eCos Public
  15. * License Version 1.1 (the "Licence"); you may not use this file
  16. * except in compliance with the Licence. You may obtain a copy of
  17. * the Licence at http://www.redhat.com/
  18. *
  19. * Software distributed under the Licence is distributed on an "AS IS"
  20. * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
  21. * See the Licence for the specific language governing rights and
  22. * limitations under the Licence.
  23. *
  24. * The Original Code is JFFS2 - Journalling Flash File System, version 2
  25. *
  26. * Alternatively, the contents of this file may be used under the
  27. * terms of the GNU General Public License version 2 (the "GPL"), in
  28. * which case the provisions of the GPL are applicable instead of the
  29. * above. If you wish to allow the use of your version of this file
  30. * only under the terms of the GPL and not to allow others to use your
  31. * version of this file under the RHEPL, indicate your decision by
  32. * deleting the provisions above and replace them with the notice and
  33. * other provisions required by the GPL. If you do not delete the
  34. * provisions above, a recipient may use your version of this file
  35. * under either the RHEPL or the GPL.
  36. *
  37. * $Id: compr_rubin.c,v 1.2 2002/01/24 22:58:42 rfeany Exp $
  38. *
  39. */
  40. #include <config.h>
  41. #if defined(CONFIG_CMD_JFFS2)
  42. #include <jffs2/jffs2.h>
  43. #include <jffs2/compr_rubin.h>
  44. void rubin_do_decompress(unsigned char *bits, unsigned char *in,
  45. unsigned char *page_out, __u32 destlen)
  46. {
  47. register char *curr = (char *)page_out;
  48. char *end = (char *)(page_out + destlen);
  49. register unsigned long temp;
  50. register unsigned long result;
  51. register unsigned long p;
  52. register unsigned long q;
  53. register unsigned long rec_q;
  54. register unsigned long bit;
  55. register long i0;
  56. unsigned long i;
  57. /* init_pushpull */
  58. temp = *(u32 *) in;
  59. bit = 16;
  60. /* init_rubin */
  61. q = 0;
  62. p = (long) (2 * UPPER_BIT_RUBIN);
  63. /* init_decode */
  64. rec_q = (in[0] << 8) | in[1];
  65. while (curr < end) {
  66. /* in byte */
  67. result = 0;
  68. for (i = 0; i < 8; i++) {
  69. /* decode */
  70. while ((q & UPPER_BIT_RUBIN) || ((p + q) <= UPPER_BIT_RUBIN)) {
  71. q &= ~UPPER_BIT_RUBIN;
  72. q <<= 1;
  73. p <<= 1;
  74. rec_q &= ~UPPER_BIT_RUBIN;
  75. rec_q <<= 1;
  76. rec_q |= (temp >> (bit++ ^ 7)) & 1;
  77. if (bit > 31) {
  78. u32 *p = (u32 *)in;
  79. bit = 0;
  80. temp = *(++p);
  81. in = (unsigned char *)p;
  82. }
  83. }
  84. i0 = (bits[i] * p) >> 8;
  85. if (i0 <= 0) i0 = 1;
  86. /* if it fails, it fails, we have our crc
  87. if (i0 >= p) i0 = p - 1; */
  88. result >>= 1;
  89. if (rec_q < q + i0) {
  90. /* result |= 0x00; */
  91. p = i0;
  92. } else {
  93. result |= 0x80;
  94. p -= i0;
  95. q += i0;
  96. }
  97. }
  98. *(curr++) = result;
  99. }
  100. }
  101. void dynrubin_decompress(unsigned char *data_in, unsigned char *cpage_out,
  102. unsigned long sourcelen, unsigned long dstlen)
  103. {
  104. unsigned char bits[8];
  105. int c;
  106. for (c=0; c<8; c++)
  107. bits[c] = (256 - data_in[c]);
  108. rubin_do_decompress(bits, data_in+8, cpage_out, dstlen);
  109. }
  110. #endif