range_common.h 2.3 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. ///////////////////////////////////////////////////////////////////////////////
  2. //
  3. /// \file range_common.h
  4. /// \brief Common things for range encoder and decoder
  5. ///
  6. // Authors: Igor Pavlov
  7. // Lasse Collin
  8. //
  9. // This file has been put into the public domain.
  10. // You can do whatever you want with this file.
  11. //
  12. ///////////////////////////////////////////////////////////////////////////////
  13. #ifndef LZMA_RANGE_COMMON_H
  14. #define LZMA_RANGE_COMMON_H
  15. #include "common.h"
  16. ///////////////
  17. // Constants //
  18. ///////////////
  19. #define RC_SHIFT_BITS 8
  20. #define RC_TOP_BITS 24
  21. #define RC_TOP_VALUE (UINT32_C(1) << RC_TOP_BITS)
  22. #define RC_BIT_MODEL_TOTAL_BITS 11
  23. #define RC_BIT_MODEL_TOTAL (UINT32_C(1) << RC_BIT_MODEL_TOTAL_BITS)
  24. #define RC_MOVE_BITS 5
  25. ////////////
  26. // Macros //
  27. ////////////
  28. // Resets the probability so that both 0 and 1 have probability of 50 %
  29. #define bit_reset(prob) \
  30. prob = RC_BIT_MODEL_TOTAL >> 1
  31. // This does the same for a complete bit tree.
  32. // (A tree represented as an array.)
  33. #define bittree_reset(probs, bit_levels) \
  34. for (uint32_t bt_i = 0; bt_i < (1 << (bit_levels)); ++bt_i) \
  35. bit_reset((probs)[bt_i])
  36. //////////////////////
  37. // Type definitions //
  38. //////////////////////
  39. /// \brief Type of probabilities used with range coder
  40. ///
  41. /// This needs to be at least 12-bit integer, so uint16_t is a logical choice.
  42. /// However, on some architecture and compiler combinations, a bigger type
  43. /// may give better speed, because the probability variables are accessed
  44. /// a lot. On the other hand, bigger probability type increases cache
  45. /// footprint, since there are 2 to 14 thousand probability variables in
  46. /// LZMA (assuming the limit of lc + lp <= 4; with lc + lp <= 12 there
  47. /// would be about 1.5 million variables).
  48. ///
  49. /// With malicious files, the initialization speed of the LZMA decoder can
  50. /// become important. In that case, smaller probability variables mean that
  51. /// there is less bytes to write to RAM, which makes initialization faster.
  52. /// With big probability type, the initialization can become so slow that it
  53. /// can be a problem e.g. for email servers doing virus scanning.
  54. ///
  55. /// I will be sticking to uint16_t unless some specific architectures
  56. /// are *much* faster (20-50 %) with uint32_t.
  57. typedef uint16_t probability;
  58. #endif