inftrees.h 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
  1. #ifndef INFTREES_H_
  2. #define INFTREES_H_
  3. /* inftrees.h -- header to use inftrees.c
  4. * Copyright (C) 1995-2022 Mark Adler
  5. * For conditions of distribution and use, see copyright notice in zlib.h
  6. */
  7. /* WARNING: this file should *not* be used by applications. It is
  8. part of the implementation of the compression library and is
  9. subject to change. Applications should only use zlib.h.
  10. */
  11. /* Structure for decoding tables. Each entry provides either the
  12. information needed to do the operation requested by the code that
  13. indexed that table entry, or it provides a pointer to another
  14. table that indexes more bits of the code. op indicates whether
  15. the entry is a pointer to another table, a literal, a length or
  16. distance, an end-of-block, or an invalid code. For a table
  17. pointer, the low four bits of op is the number of index bits of
  18. that table. For a length or distance, the low four bits of op
  19. is the number of extra bits to get after the code. bits is
  20. the number of bits in this code or part of the code to drop off
  21. of the bit buffer. val is the actual byte to output in the case
  22. of a literal, the base length or distance, or the offset from
  23. the current table to the next table. Each entry is four bytes. */
  24. typedef struct {
  25. unsigned char op; /* operation, extra bits, table bits */
  26. unsigned char bits; /* bits in this part of the code */
  27. uint16_t val; /* offset in table or code value */
  28. } code;
  29. /* op values as set by inflate_table():
  30. 00000000 - literal
  31. 0000tttt - table link, tttt != 0 is the number of table index bits
  32. 0001eeee - length or distance, eeee is the number of extra bits
  33. 01100000 - end of block
  34. 01000000 - invalid code
  35. */
  36. /* Maximum size of the dynamic table. The maximum number of code structures is
  37. 1924, which is the sum of 1332 for literal/length codes and 592 for distance
  38. codes. These values were found by exhaustive searches using the program
  39. examples/enough.c found in the zlib distributions. The arguments to that
  40. program are the number of symbols, the initial root table size, and the
  41. maximum bit length of a code. "enough 286 10 15" for literal/length codes
  42. returns 1332, and "enough 30 9 15" for distance codes returns 592.
  43. The initial root table size (10 or 9) is found in the fifth argument of the
  44. inflate_table() calls in inflate.c and infback.c. If the root table size is
  45. changed, then these maximum sizes would be need to be recalculated and
  46. updated. */
  47. #define ENOUGH_LENS 1332
  48. #define ENOUGH_DISTS 592
  49. #define ENOUGH (ENOUGH_LENS+ENOUGH_DISTS)
  50. /* Type of code to build for inflate_table() */
  51. typedef enum {
  52. CODES,
  53. LENS,
  54. DISTS
  55. } codetype;
  56. int Z_INTERNAL zng_inflate_table (codetype type, uint16_t *lens, unsigned codes,
  57. code * *table, unsigned *bits, uint16_t *work);
  58. #endif /* INFTREES_H_ */