tioga 1.11 → 1.13

Sign up to get free protection for your applications and to get access to all the features.
Files changed (148) hide show
  1. data/Tioga_README +58 -35
  2. data/{split/scripts → bin}/tioga +1 -1
  3. data/{split → ext/Dobjects}/Dtable/dtable.c +81 -15
  4. data/{split → ext/Dobjects}/Dtable/dtable_intern.h +0 -0
  5. data/ext/Dobjects/Dtable/extconf.rb +7 -0
  6. data/{split → ext/Dobjects}/Dtable/include/dtable.h +0 -0
  7. data/{split → ext/Dobjects}/Dvector/dvector.c +361 -51
  8. data/{split → ext/Dobjects}/Dvector/dvector_intern.h +0 -0
  9. data/ext/Dobjects/Dvector/extconf.rb +22 -0
  10. data/{split/Dtable → ext/Dobjects/Dvector/include}/dvector.h +0 -0
  11. data/ext/Dobjects/Function/extconf.rb +7 -0
  12. data/{split → ext/Dobjects}/Function/function.c +636 -11
  13. data/{split → ext/Dobjects}/Function/joint_qsort.c +0 -0
  14. data/ext/Flate/extconf.rb +26 -0
  15. data/{split → ext}/Flate/flate.c +7 -3
  16. data/{split → ext}/Flate/flate_intern.h +0 -0
  17. data/{split → ext}/Flate/include/flate.h +0 -0
  18. data/ext/Flate/zlib/adler32.c +149 -0
  19. data/ext/Flate/zlib/compress.c +79 -0
  20. data/ext/Flate/zlib/crc32.c +423 -0
  21. data/ext/Flate/zlib/crc32.h +441 -0
  22. data/ext/Flate/zlib/deflate.c +1736 -0
  23. data/ext/Flate/zlib/deflate.h +331 -0
  24. data/ext/Flate/zlib/gzio.c +1026 -0
  25. data/ext/Flate/zlib/infback.c +623 -0
  26. data/ext/Flate/zlib/inffast.c +318 -0
  27. data/ext/Flate/zlib/inffast.h +11 -0
  28. data/ext/Flate/zlib/inffixed.h +94 -0
  29. data/ext/Flate/zlib/inflate.c +1368 -0
  30. data/ext/Flate/zlib/inflate.h +115 -0
  31. data/ext/Flate/zlib/inftrees.c +329 -0
  32. data/ext/Flate/zlib/inftrees.h +55 -0
  33. data/ext/Flate/zlib/trees.c +1219 -0
  34. data/ext/Flate/zlib/trees.h +128 -0
  35. data/ext/Flate/zlib/uncompr.c +61 -0
  36. data/ext/Flate/zlib/zlib.h +1357 -0
  37. data/ext/Flate/zlib/zutil.c +318 -0
  38. data/ext/Flate/zlib/zutil.h +269 -0
  39. data/ext/Tioga/FigureMaker/__shared_axes.c +1373 -0
  40. data/ext/Tioga/FigureMaker/__shared_makers.c +1303 -0
  41. data/{split/Tioga/pdf_font_dicts.c → ext/Tioga/FigureMaker/__shared_pdf_font_dicts.c} +0 -0
  42. data/{split/Tioga/pdfcolor.c → ext/Tioga/FigureMaker/__shared_pdfcolor.c} +0 -0
  43. data/{split/Tioga/pdfcoords.c → ext/Tioga/FigureMaker/__shared_pdfcoords.c} +0 -0
  44. data/{split/Tioga/pdffile.c → ext/Tioga/FigureMaker/__shared_pdffile.c} +0 -0
  45. data/{split/Tioga/pdfimage.c → ext/Tioga/FigureMaker/__shared_pdfimage.c} +0 -0
  46. data/{split/Tioga/pdfpath.c → ext/Tioga/FigureMaker/__shared_pdfpath.c} +0 -0
  47. data/{split/Tioga/pdftext.c → ext/Tioga/FigureMaker/__shared_pdftext.c} +0 -0
  48. data/{split/Tioga/texout.c → ext/Tioga/FigureMaker/__shared_texout.c} +0 -0
  49. data/ext/Tioga/FigureMaker/extconf.rb +7 -0
  50. data/{split/Tioga → ext/Tioga/FigureMaker}/figures.c +14 -2
  51. data/{split/Tioga → ext/Tioga/FigureMaker}/figures.h +0 -0
  52. data/{split/Tioga → ext/Tioga/FigureMaker}/generic.c +1 -2
  53. data/{split/Tioga → ext/Tioga/FigureMaker}/generic.h +0 -1
  54. data/{split/Tioga → ext/Tioga/FigureMaker}/init.c +0 -0
  55. data/{split/Tioga → ext/Tioga/FigureMaker}/pdfs.h +0 -0
  56. data/{split/Tioga → ext/Tioga/FigureMaker/shared}/axes.c +32 -7
  57. data/{split/Tioga → ext/Tioga/FigureMaker/shared}/makers.c +2 -2
  58. data/ext/Tioga/FigureMaker/shared/pdf_font_dicts.c +18253 -0
  59. data/ext/Tioga/FigureMaker/shared/pdfcolor.c +904 -0
  60. data/ext/Tioga/FigureMaker/shared/pdfcoords.c +518 -0
  61. data/ext/Tioga/FigureMaker/shared/pdffile.c +451 -0
  62. data/ext/Tioga/FigureMaker/shared/pdfimage.c +539 -0
  63. data/ext/Tioga/FigureMaker/shared/pdfpath.c +766 -0
  64. data/ext/Tioga/FigureMaker/shared/pdftext.c +710 -0
  65. data/ext/Tioga/FigureMaker/shared/texout.c +533 -0
  66. data/{split/Tioga → ext/Tioga/FigureMaker}/wrappers.c +5 -5
  67. data/{split/Tioga → ext/Tioga/FigureMaker}/wrappers.h +0 -0
  68. data/{split/Dtable → ext/includes}/defs.h +0 -0
  69. data/{split/Dtable → ext/includes}/namespace.h +0 -0
  70. data/{split/Dtable → ext/includes}/safe_double.h +0 -0
  71. data/{split → ext/includes}/symbols.c +0 -1
  72. data/{split/Dtable → ext/includes}/symbols.h +0 -0
  73. data/{split/Dtable/lib → lib/Dobjects}/Dtable_extras.rb +0 -0
  74. data/{split/Dvector/lib → lib/Dobjects}/Dvector_extras.rb +1 -0
  75. data/{split/Function/lib → lib/Dobjects}/Function_extras.rb +0 -0
  76. data/{split/Dvector/lib → lib/Dobjects}/Numeric_extras.rb +0 -0
  77. data/{split/Tioga/lib → lib/Tioga}/Arcs_and_Circles.rb +0 -0
  78. data/{split/Tioga/lib → lib/Tioga}/ColorConstants.rb +0 -0
  79. data/{split/Tioga/lib → lib/Tioga}/Colorbars.rb +0 -0
  80. data/{split/Tioga/lib → lib/Tioga}/Colormaps.rb +0 -0
  81. data/{split/Tioga/lib → lib/Tioga}/Coordinate_Conversions.rb +0 -0
  82. data/{split/Tioga/lib → lib/Tioga}/Creating_Paths.rb +0 -0
  83. data/{split/Tioga/lib → lib/Tioga}/Doc.rb +0 -0
  84. data/{split/Tioga/lib → lib/Tioga}/Executive.rb +0 -0
  85. data/{split/Tioga/lib → lib/Tioga}/FigMkr.rb +13 -70
  86. data/{split/Tioga/lib → lib/Tioga}/FigureConstants.rb +0 -0
  87. data/{split/Tioga/lib → lib/Tioga}/Figures_and_Plots.rb +0 -0
  88. data/{split/Tioga/lib → lib/Tioga}/Images.rb +0 -0
  89. data/{split/Tioga/lib → lib/Tioga}/Legends.rb +0 -0
  90. data/{split/Tioga/lib → lib/Tioga}/MarkerConstants.rb +0 -0
  91. data/{split/Tioga/lib → lib/Tioga}/Markers.rb +0 -0
  92. data/{split/Tioga/lib → lib/Tioga}/Page_Frame_Bounds.rb +0 -0
  93. data/{split/Tioga/lib → lib/Tioga}/Rectangles.rb +0 -0
  94. data/{split/Tioga/lib → lib/Tioga}/Shading.rb +0 -0
  95. data/{split/Tioga/lib → lib/Tioga}/Special_Paths.rb +0 -0
  96. data/{split/Tioga/lib → lib/Tioga}/Strokes.rb +0 -0
  97. data/{split/Tioga/lib → lib/Tioga}/TeX_Text.rb +0 -0
  98. data/{split/Tioga/lib → lib/Tioga}/TexPreamble.rb +0 -0
  99. data/{split/Tioga/lib → lib/Tioga}/Titles_and_Labels.rb +0 -0
  100. data/{split/Tioga/lib → lib/Tioga}/Transparency.rb +0 -0
  101. data/{split/Tioga/lib → lib/Tioga}/Using_Paths.rb +0 -0
  102. data/{split/Tioga/lib → lib/Tioga}/Utils.rb +74 -0
  103. data/{split/Tioga/lib → lib/Tioga}/X_and_Y_Axes.rb +0 -0
  104. data/{split/Tioga/lib → lib/Tioga}/irb_tioga.rb +0 -0
  105. data/{split/Tioga/lib → lib/Tioga}/maker.rb +0 -0
  106. data/{split/Tioga/lib → lib/Tioga}/tioga.rb +0 -0
  107. data/{split/Tioga/lib → lib/Tioga}/tioga_ui.rb +0 -0
  108. data/{split/Tioga/lib → lib/Tioga}/tioga_ui_cmds.rb +0 -0
  109. data/tests/Icon_Test.pdf +0 -0
  110. data/tests/benchmark_dvector_reads.rb +20 -42
  111. data/tests/tc_Dvector.rb +45 -4
  112. data/tests/tc_Flate.rb +4 -5
  113. data/tests/tc_Function.rb +79 -0
  114. data/tests/vg.log +1453 -0
  115. metadata +141 -122
  116. data/split/Dtable/extconf.rb +0 -4
  117. data/split/Dvector/defs.h +0 -39
  118. data/split/Dvector/extconf.rb +0 -4
  119. data/split/Dvector/include/dvector.h +0 -77
  120. data/split/Dvector/namespace.h +0 -59
  121. data/split/Dvector/safe_double.h +0 -104
  122. data/split/Dvector/symbols.h +0 -52
  123. data/split/Flate/defs.h +0 -39
  124. data/split/Flate/extconf.rb +0 -19
  125. data/split/Flate/namespace.h +0 -59
  126. data/split/Flate/safe_double.h +0 -104
  127. data/split/Flate/symbols.h +0 -52
  128. data/split/Function/defs.h +0 -39
  129. data/split/Function/dvector.h +0 -77
  130. data/split/Function/extconf.rb +0 -4
  131. data/split/Function/namespace.h +0 -59
  132. data/split/Function/safe_double.h +0 -104
  133. data/split/Function/symbols.h +0 -52
  134. data/split/Tioga/defs.h +0 -39
  135. data/split/Tioga/dtable.h +0 -35
  136. data/split/Tioga/dvector.h +0 -77
  137. data/split/Tioga/extconf.rb +0 -4
  138. data/split/Tioga/flate.h +0 -98
  139. data/split/Tioga/mk_tioga_sty.rb +0 -53
  140. data/split/Tioga/namespace.h +0 -59
  141. data/split/Tioga/safe_double.h +0 -104
  142. data/split/Tioga/symbols.h +0 -52
  143. data/split/defs.h +0 -39
  144. data/split/extconf.rb +0 -125
  145. data/split/mkmf2.rb +0 -1623
  146. data/split/namespace.h +0 -59
  147. data/split/safe_double.h +0 -104
  148. data/split/symbols.h +0 -52
@@ -0,0 +1,441 @@
1
+ /* crc32.h -- tables for rapid CRC calculation
2
+ * Generated automatically by crc32.c
3
+ */
4
+
5
+ local const unsigned long FAR crc_table[TBLS][256] =
6
+ {
7
+ {
8
+ 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
9
+ 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
10
+ 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
11
+ 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
12
+ 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
13
+ 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
14
+ 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
15
+ 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
16
+ 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
17
+ 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
18
+ 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
19
+ 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
20
+ 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
21
+ 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
22
+ 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
23
+ 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
24
+ 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
25
+ 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
26
+ 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
27
+ 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
28
+ 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
29
+ 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
30
+ 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
31
+ 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
32
+ 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
33
+ 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
34
+ 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
35
+ 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
36
+ 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
37
+ 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
38
+ 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
39
+ 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
40
+ 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
41
+ 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
42
+ 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
43
+ 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
44
+ 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
45
+ 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
46
+ 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
47
+ 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
48
+ 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
49
+ 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
50
+ 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
51
+ 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
52
+ 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
53
+ 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
54
+ 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
55
+ 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
56
+ 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
57
+ 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
58
+ 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
59
+ 0x2d02ef8dUL
60
+ #ifdef BYFOUR
61
+ },
62
+ {
63
+ 0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL,
64
+ 0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL,
65
+ 0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL,
66
+ 0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL,
67
+ 0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL,
68
+ 0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL,
69
+ 0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL,
70
+ 0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL,
71
+ 0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL,
72
+ 0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL,
73
+ 0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL,
74
+ 0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL,
75
+ 0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL,
76
+ 0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL,
77
+ 0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL,
78
+ 0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL,
79
+ 0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL,
80
+ 0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL,
81
+ 0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL,
82
+ 0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL,
83
+ 0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL,
84
+ 0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL,
85
+ 0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL,
86
+ 0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL,
87
+ 0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL,
88
+ 0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL,
89
+ 0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL,
90
+ 0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL,
91
+ 0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL,
92
+ 0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL,
93
+ 0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL,
94
+ 0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL,
95
+ 0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL,
96
+ 0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL,
97
+ 0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL,
98
+ 0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL,
99
+ 0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL,
100
+ 0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL,
101
+ 0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL,
102
+ 0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL,
103
+ 0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL,
104
+ 0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL,
105
+ 0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL,
106
+ 0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL,
107
+ 0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL,
108
+ 0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL,
109
+ 0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL,
110
+ 0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL,
111
+ 0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL,
112
+ 0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL,
113
+ 0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL,
114
+ 0x9324fd72UL
115
+ },
116
+ {
117
+ 0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL,
118
+ 0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL,
119
+ 0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL,
120
+ 0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL,
121
+ 0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL,
122
+ 0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL,
123
+ 0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL,
124
+ 0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL,
125
+ 0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL,
126
+ 0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL,
127
+ 0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL,
128
+ 0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL,
129
+ 0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL,
130
+ 0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL,
131
+ 0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL,
132
+ 0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL,
133
+ 0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL,
134
+ 0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL,
135
+ 0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL,
136
+ 0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL,
137
+ 0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL,
138
+ 0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL,
139
+ 0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL,
140
+ 0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL,
141
+ 0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL,
142
+ 0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL,
143
+ 0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL,
144
+ 0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL,
145
+ 0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL,
146
+ 0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL,
147
+ 0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL,
148
+ 0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL,
149
+ 0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL,
150
+ 0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL,
151
+ 0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL,
152
+ 0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL,
153
+ 0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL,
154
+ 0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL,
155
+ 0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL,
156
+ 0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL,
157
+ 0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL,
158
+ 0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL,
159
+ 0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL,
160
+ 0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL,
161
+ 0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL,
162
+ 0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL,
163
+ 0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL,
164
+ 0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL,
165
+ 0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL,
166
+ 0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL,
167
+ 0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL,
168
+ 0xbe9834edUL
169
+ },
170
+ {
171
+ 0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL,
172
+ 0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL,
173
+ 0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL,
174
+ 0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL,
175
+ 0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL,
176
+ 0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL,
177
+ 0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL,
178
+ 0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL,
179
+ 0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL,
180
+ 0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL,
181
+ 0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL,
182
+ 0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL,
183
+ 0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL,
184
+ 0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL,
185
+ 0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL,
186
+ 0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL,
187
+ 0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL,
188
+ 0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL,
189
+ 0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL,
190
+ 0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL,
191
+ 0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL,
192
+ 0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL,
193
+ 0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL,
194
+ 0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL,
195
+ 0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL,
196
+ 0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL,
197
+ 0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL,
198
+ 0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL,
199
+ 0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL,
200
+ 0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL,
201
+ 0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL,
202
+ 0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL,
203
+ 0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL,
204
+ 0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL,
205
+ 0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL,
206
+ 0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL,
207
+ 0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL,
208
+ 0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL,
209
+ 0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL,
210
+ 0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL,
211
+ 0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL,
212
+ 0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL,
213
+ 0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL,
214
+ 0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL,
215
+ 0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL,
216
+ 0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL,
217
+ 0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL,
218
+ 0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL,
219
+ 0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL,
220
+ 0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL,
221
+ 0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL,
222
+ 0xde0506f1UL
223
+ },
224
+ {
225
+ 0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL,
226
+ 0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL,
227
+ 0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL,
228
+ 0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL,
229
+ 0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL,
230
+ 0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL,
231
+ 0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL,
232
+ 0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL,
233
+ 0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL,
234
+ 0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL,
235
+ 0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL,
236
+ 0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL,
237
+ 0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL,
238
+ 0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL,
239
+ 0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL,
240
+ 0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL,
241
+ 0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL,
242
+ 0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL,
243
+ 0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL,
244
+ 0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL,
245
+ 0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL,
246
+ 0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL,
247
+ 0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL,
248
+ 0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL,
249
+ 0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL,
250
+ 0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL,
251
+ 0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL,
252
+ 0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL,
253
+ 0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL,
254
+ 0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL,
255
+ 0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL,
256
+ 0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL,
257
+ 0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL,
258
+ 0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL,
259
+ 0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL,
260
+ 0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL,
261
+ 0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL,
262
+ 0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL,
263
+ 0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL,
264
+ 0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL,
265
+ 0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL,
266
+ 0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL,
267
+ 0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL,
268
+ 0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL,
269
+ 0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL,
270
+ 0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL,
271
+ 0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL,
272
+ 0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL,
273
+ 0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL,
274
+ 0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL,
275
+ 0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL,
276
+ 0x8def022dUL
277
+ },
278
+ {
279
+ 0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL,
280
+ 0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL,
281
+ 0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL,
282
+ 0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL,
283
+ 0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL,
284
+ 0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL,
285
+ 0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL,
286
+ 0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL,
287
+ 0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL,
288
+ 0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL,
289
+ 0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL,
290
+ 0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL,
291
+ 0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL,
292
+ 0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL,
293
+ 0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL,
294
+ 0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL,
295
+ 0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL,
296
+ 0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL,
297
+ 0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL,
298
+ 0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL,
299
+ 0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL,
300
+ 0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL,
301
+ 0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL,
302
+ 0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL,
303
+ 0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL,
304
+ 0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL,
305
+ 0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL,
306
+ 0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL,
307
+ 0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL,
308
+ 0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL,
309
+ 0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL,
310
+ 0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL,
311
+ 0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL,
312
+ 0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL,
313
+ 0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL,
314
+ 0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL,
315
+ 0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL,
316
+ 0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL,
317
+ 0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL,
318
+ 0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL,
319
+ 0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL,
320
+ 0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL,
321
+ 0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL,
322
+ 0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL,
323
+ 0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL,
324
+ 0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL,
325
+ 0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL,
326
+ 0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL,
327
+ 0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL,
328
+ 0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL,
329
+ 0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL,
330
+ 0x72fd2493UL
331
+ },
332
+ {
333
+ 0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL,
334
+ 0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL,
335
+ 0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL,
336
+ 0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL,
337
+ 0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL,
338
+ 0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL,
339
+ 0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL,
340
+ 0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL,
341
+ 0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL,
342
+ 0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL,
343
+ 0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL,
344
+ 0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL,
345
+ 0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL,
346
+ 0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL,
347
+ 0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL,
348
+ 0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL,
349
+ 0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL,
350
+ 0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL,
351
+ 0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL,
352
+ 0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL,
353
+ 0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL,
354
+ 0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL,
355
+ 0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL,
356
+ 0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL,
357
+ 0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL,
358
+ 0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL,
359
+ 0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL,
360
+ 0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL,
361
+ 0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL,
362
+ 0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL,
363
+ 0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL,
364
+ 0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL,
365
+ 0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL,
366
+ 0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL,
367
+ 0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL,
368
+ 0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL,
369
+ 0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL,
370
+ 0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL,
371
+ 0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL,
372
+ 0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL,
373
+ 0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL,
374
+ 0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL,
375
+ 0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL,
376
+ 0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL,
377
+ 0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL,
378
+ 0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL,
379
+ 0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL,
380
+ 0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL,
381
+ 0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL,
382
+ 0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL,
383
+ 0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL,
384
+ 0xed3498beUL
385
+ },
386
+ {
387
+ 0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL,
388
+ 0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL,
389
+ 0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL,
390
+ 0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL,
391
+ 0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL,
392
+ 0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL,
393
+ 0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL,
394
+ 0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL,
395
+ 0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL,
396
+ 0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL,
397
+ 0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL,
398
+ 0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL,
399
+ 0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL,
400
+ 0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL,
401
+ 0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL,
402
+ 0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL,
403
+ 0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL,
404
+ 0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL,
405
+ 0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL,
406
+ 0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL,
407
+ 0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL,
408
+ 0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL,
409
+ 0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL,
410
+ 0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL,
411
+ 0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL,
412
+ 0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL,
413
+ 0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL,
414
+ 0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL,
415
+ 0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL,
416
+ 0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL,
417
+ 0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL,
418
+ 0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL,
419
+ 0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL,
420
+ 0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL,
421
+ 0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL,
422
+ 0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL,
423
+ 0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL,
424
+ 0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL,
425
+ 0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL,
426
+ 0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL,
427
+ 0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL,
428
+ 0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL,
429
+ 0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL,
430
+ 0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL,
431
+ 0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL,
432
+ 0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL,
433
+ 0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL,
434
+ 0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL,
435
+ 0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL,
436
+ 0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL,
437
+ 0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL,
438
+ 0xf10605deUL
439
+ #endif
440
+ }
441
+ };
@@ -0,0 +1,1736 @@
1
+ /* deflate.c -- compress data using the deflation algorithm
2
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
3
+ * For conditions of distribution and use, see copyright notice in zlib.h
4
+ */
5
+
6
+ /*
7
+ * ALGORITHM
8
+ *
9
+ * The "deflation" process depends on being able to identify portions
10
+ * of the input text which are identical to earlier input (within a
11
+ * sliding window trailing behind the input currently being processed).
12
+ *
13
+ * The most straightforward technique turns out to be the fastest for
14
+ * most input files: try all possible matches and select the longest.
15
+ * The key feature of this algorithm is that insertions into the string
16
+ * dictionary are very simple and thus fast, and deletions are avoided
17
+ * completely. Insertions are performed at each input character, whereas
18
+ * string matches are performed only when the previous match ends. So it
19
+ * is preferable to spend more time in matches to allow very fast string
20
+ * insertions and avoid deletions. The matching algorithm for small
21
+ * strings is inspired from that of Rabin & Karp. A brute force approach
22
+ * is used to find longer strings when a small match has been found.
23
+ * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
24
+ * (by Leonid Broukhis).
25
+ * A previous version of this file used a more sophisticated algorithm
26
+ * (by Fiala and Greene) which is guaranteed to run in linear amortized
27
+ * time, but has a larger average cost, uses more memory and is patented.
28
+ * However the F&G algorithm may be faster for some highly redundant
29
+ * files if the parameter max_chain_length (described below) is too large.
30
+ *
31
+ * ACKNOWLEDGEMENTS
32
+ *
33
+ * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
34
+ * I found it in 'freeze' written by Leonid Broukhis.
35
+ * Thanks to many people for bug reports and testing.
36
+ *
37
+ * REFERENCES
38
+ *
39
+ * Deutsch, L.P.,"DEFLATE Compressed Data Format Specification".
40
+ * Available in http://www.ietf.org/rfc/rfc1951.txt
41
+ *
42
+ * A description of the Rabin and Karp algorithm is given in the book
43
+ * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
44
+ *
45
+ * Fiala,E.R., and Greene,D.H.
46
+ * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
47
+ *
48
+ */
49
+
50
+ /* @(#) $Id$ */
51
+
52
+ #include "deflate.h"
53
+
54
+ const char deflate_copyright[] =
55
+ " deflate 1.2.3 Copyright 1995-2005 Jean-loup Gailly ";
56
+ /*
57
+ If you use the zlib library in a product, an acknowledgment is welcome
58
+ in the documentation of your product. If for some reason you cannot
59
+ include such an acknowledgment, I would appreciate that you keep this
60
+ copyright string in the executable of your product.
61
+ */
62
+
63
+ /* ===========================================================================
64
+ * Function prototypes.
65
+ */
66
+ typedef enum {
67
+ need_more, /* block not completed, need more input or more output */
68
+ block_done, /* block flush performed */
69
+ finish_started, /* finish started, need only more output at next deflate */
70
+ finish_done /* finish done, accept no more input or output */
71
+ } block_state;
72
+
73
+ typedef block_state (*compress_func) OF((deflate_state *s, int flush));
74
+ /* Compression function. Returns the block state after the call. */
75
+
76
+ local void fill_window OF((deflate_state *s));
77
+ local block_state deflate_stored OF((deflate_state *s, int flush));
78
+ local block_state deflate_fast OF((deflate_state *s, int flush));
79
+ #ifndef FASTEST
80
+ local block_state deflate_slow OF((deflate_state *s, int flush));
81
+ #endif
82
+ local void lm_init OF((deflate_state *s));
83
+ local void putShortMSB OF((deflate_state *s, uInt b));
84
+ local void flush_pending OF((z_streamp strm));
85
+ local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));
86
+ #ifndef FASTEST
87
+ #ifdef ASMV
88
+ void match_init OF((void)); /* asm code initialization */
89
+ uInt longest_match OF((deflate_state *s, IPos cur_match));
90
+ #else
91
+ local uInt longest_match OF((deflate_state *s, IPos cur_match));
92
+ #endif
93
+ #endif
94
+ local uInt longest_match_fast OF((deflate_state *s, IPos cur_match));
95
+
96
+ #ifdef DEBUG
97
+ local void check_match OF((deflate_state *s, IPos start, IPos match,
98
+ int length));
99
+ #endif
100
+
101
+ /* ===========================================================================
102
+ * Local data
103
+ */
104
+
105
+ #define NIL 0
106
+ /* Tail of hash chains */
107
+
108
+ #ifndef TOO_FAR
109
+ # define TOO_FAR 4096
110
+ #endif
111
+ /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
112
+
113
+ #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
114
+ /* Minimum amount of lookahead, except at the end of the input file.
115
+ * See deflate.c for comments about the MIN_MATCH+1.
116
+ */
117
+
118
+ /* Values for max_lazy_match, good_match and max_chain_length, depending on
119
+ * the desired pack level (0..9). The values given below have been tuned to
120
+ * exclude worst case performance for pathological files. Better values may be
121
+ * found for specific files.
122
+ */
123
+ typedef struct config_s {
124
+ ush good_length; /* reduce lazy search above this match length */
125
+ ush max_lazy; /* do not perform lazy search above this match length */
126
+ ush nice_length; /* quit search above this match length */
127
+ ush max_chain;
128
+ compress_func func;
129
+ } config;
130
+
131
+ #ifdef FASTEST
132
+ local const config configuration_table[2] = {
133
+ /* good lazy nice chain */
134
+ /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */
135
+ /* 1 */ {4, 4, 8, 4, deflate_fast}}; /* max speed, no lazy matches */
136
+ #else
137
+ local const config configuration_table[10] = {
138
+ /* good lazy nice chain */
139
+ /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */
140
+ /* 1 */ {4, 4, 8, 4, deflate_fast}, /* max speed, no lazy matches */
141
+ /* 2 */ {4, 5, 16, 8, deflate_fast},
142
+ /* 3 */ {4, 6, 32, 32, deflate_fast},
143
+
144
+ /* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */
145
+ /* 5 */ {8, 16, 32, 32, deflate_slow},
146
+ /* 6 */ {8, 16, 128, 128, deflate_slow},
147
+ /* 7 */ {8, 32, 128, 256, deflate_slow},
148
+ /* 8 */ {32, 128, 258, 1024, deflate_slow},
149
+ /* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */
150
+ #endif
151
+
152
+ /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
153
+ * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
154
+ * meaning.
155
+ */
156
+
157
+ #define EQUAL 0
158
+ /* result of memcmp for equal strings */
159
+
160
+ #ifndef NO_DUMMY_DECL
161
+ struct static_tree_desc_s {int dummy;}; /* for buggy compilers */
162
+ #endif
163
+
164
+ /* ===========================================================================
165
+ * Update a hash value with the given input byte
166
+ * IN assertion: all calls to to UPDATE_HASH are made with consecutive
167
+ * input characters, so that a running hash key can be computed from the
168
+ * previous key instead of complete recalculation each time.
169
+ */
170
+ #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask)
171
+
172
+
173
+ /* ===========================================================================
174
+ * Insert string str in the dictionary and set match_head to the previous head
175
+ * of the hash chain (the most recent string with same hash key). Return
176
+ * the previous length of the hash chain.
177
+ * If this file is compiled with -DFASTEST, the compression level is forced
178
+ * to 1, and no hash chains are maintained.
179
+ * IN assertion: all calls to to INSERT_STRING are made with consecutive
180
+ * input characters and the first MIN_MATCH bytes of str are valid
181
+ * (except for the last MIN_MATCH-1 bytes of the input file).
182
+ */
183
+ #ifdef FASTEST
184
+ #define INSERT_STRING(s, str, match_head) \
185
+ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
186
+ match_head = s->head[s->ins_h], \
187
+ s->head[s->ins_h] = (Pos)(str))
188
+ #else
189
+ #define INSERT_STRING(s, str, match_head) \
190
+ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
191
+ match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
192
+ s->head[s->ins_h] = (Pos)(str))
193
+ #endif
194
+
195
+ /* ===========================================================================
196
+ * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
197
+ * prev[] will be initialized on the fly.
198
+ */
199
+ #define CLEAR_HASH(s) \
200
+ s->head[s->hash_size-1] = NIL; \
201
+ zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
202
+
203
+ /* ========================================================================= */
204
+ int ZEXPORT deflateInit_(strm, level, version, stream_size)
205
+ z_streamp strm;
206
+ int level;
207
+ const char *version;
208
+ int stream_size;
209
+ {
210
+ return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,
211
+ Z_DEFAULT_STRATEGY, version, stream_size);
212
+ /* To do: ignore strm->next_in if we use it as window */
213
+ }
214
+
215
+ /* ========================================================================= */
216
+ int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
217
+ version, stream_size)
218
+ z_streamp strm;
219
+ int level;
220
+ int method;
221
+ int windowBits;
222
+ int memLevel;
223
+ int strategy;
224
+ const char *version;
225
+ int stream_size;
226
+ {
227
+ deflate_state *s;
228
+ int wrap = 1;
229
+ static const char my_version[] = ZLIB_VERSION;
230
+
231
+ ushf *overlay;
232
+ /* We overlay pending_buf and d_buf+l_buf. This works since the average
233
+ * output size for (length,distance) codes is <= 24 bits.
234
+ */
235
+
236
+ if (version == Z_NULL || version[0] != my_version[0] ||
237
+ stream_size != sizeof(z_stream)) {
238
+ return Z_VERSION_ERROR;
239
+ }
240
+ if (strm == Z_NULL) return Z_STREAM_ERROR;
241
+
242
+ strm->msg = Z_NULL;
243
+ if (strm->zalloc == (alloc_func)0) {
244
+ strm->zalloc = zcalloc;
245
+ strm->opaque = (voidpf)0;
246
+ }
247
+ if (strm->zfree == (free_func)0) strm->zfree = zcfree;
248
+
249
+ #ifdef FASTEST
250
+ if (level != 0) level = 1;
251
+ #else
252
+ if (level == Z_DEFAULT_COMPRESSION) level = 6;
253
+ #endif
254
+
255
+ if (windowBits < 0) { /* suppress zlib wrapper */
256
+ wrap = 0;
257
+ windowBits = -windowBits;
258
+ }
259
+ #ifdef GZIP
260
+ else if (windowBits > 15) {
261
+ wrap = 2; /* write gzip wrapper instead */
262
+ windowBits -= 16;
263
+ }
264
+ #endif
265
+ if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
266
+ windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
267
+ strategy < 0 || strategy > Z_FIXED) {
268
+ return Z_STREAM_ERROR;
269
+ }
270
+ if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */
271
+ s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));
272
+ if (s == Z_NULL) return Z_MEM_ERROR;
273
+ strm->state = (struct internal_state FAR *)s;
274
+ s->strm = strm;
275
+
276
+ s->wrap = wrap;
277
+ s->gzhead = Z_NULL;
278
+ s->w_bits = windowBits;
279
+ s->w_size = 1 << s->w_bits;
280
+ s->w_mask = s->w_size - 1;
281
+
282
+ s->hash_bits = memLevel + 7;
283
+ s->hash_size = 1 << s->hash_bits;
284
+ s->hash_mask = s->hash_size - 1;
285
+ s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
286
+
287
+ s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
288
+ s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));
289
+ s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));
290
+
291
+ s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */
292
+
293
+ overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
294
+ s->pending_buf = (uchf *) overlay;
295
+ s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
296
+
297
+ if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
298
+ s->pending_buf == Z_NULL) {
299
+ s->status = FINISH_STATE;
300
+ strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);
301
+ deflateEnd (strm);
302
+ return Z_MEM_ERROR;
303
+ }
304
+ s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
305
+ s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
306
+
307
+ s->level = level;
308
+ s->strategy = strategy;
309
+ s->method = (Byte)method;
310
+
311
+ return deflateReset(strm);
312
+ }
313
+
314
+ /* ========================================================================= */
315
+ int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)
316
+ z_streamp strm;
317
+ const Bytef *dictionary;
318
+ uInt dictLength;
319
+ {
320
+ deflate_state *s;
321
+ uInt length = dictLength;
322
+ uInt n;
323
+ IPos hash_head = 0;
324
+
325
+ if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||
326
+ strm->state->wrap == 2 ||
327
+ (strm->state->wrap == 1 && strm->state->status != INIT_STATE))
328
+ return Z_STREAM_ERROR;
329
+
330
+ s = strm->state;
331
+ if (s->wrap)
332
+ strm->adler = adler32(strm->adler, dictionary, dictLength);
333
+
334
+ if (length < MIN_MATCH) return Z_OK;
335
+ if (length > MAX_DIST(s)) {
336
+ length = MAX_DIST(s);
337
+ dictionary += dictLength - length; /* use the tail of the dictionary */
338
+ }
339
+ zmemcpy(s->window, dictionary, length);
340
+ s->strstart = length;
341
+ s->block_start = (long)length;
342
+
343
+ /* Insert all strings in the hash table (except for the last two bytes).
344
+ * s->lookahead stays null, so s->ins_h will be recomputed at the next
345
+ * call of fill_window.
346
+ */
347
+ s->ins_h = s->window[0];
348
+ UPDATE_HASH(s, s->ins_h, s->window[1]);
349
+ for (n = 0; n <= length - MIN_MATCH; n++) {
350
+ INSERT_STRING(s, n, hash_head);
351
+ }
352
+ if (hash_head) hash_head = 0; /* to make compiler happy */
353
+ return Z_OK;
354
+ }
355
+
356
+ /* ========================================================================= */
357
+ int ZEXPORT deflateReset (strm)
358
+ z_streamp strm;
359
+ {
360
+ deflate_state *s;
361
+
362
+ if (strm == Z_NULL || strm->state == Z_NULL ||
363
+ strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {
364
+ return Z_STREAM_ERROR;
365
+ }
366
+
367
+ strm->total_in = strm->total_out = 0;
368
+ strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */
369
+ strm->data_type = Z_UNKNOWN;
370
+
371
+ s = (deflate_state *)strm->state;
372
+ s->pending = 0;
373
+ s->pending_out = s->pending_buf;
374
+
375
+ if (s->wrap < 0) {
376
+ s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */
377
+ }
378
+ s->status = s->wrap ? INIT_STATE : BUSY_STATE;
379
+ strm->adler =
380
+ #ifdef GZIP
381
+ s->wrap == 2 ? crc32(0L, Z_NULL, 0) :
382
+ #endif
383
+ adler32(0L, Z_NULL, 0);
384
+ s->last_flush = Z_NO_FLUSH;
385
+
386
+ _tr_init(s);
387
+ lm_init(s);
388
+
389
+ return Z_OK;
390
+ }
391
+
392
+ /* ========================================================================= */
393
+ int ZEXPORT deflateSetHeader (strm, head)
394
+ z_streamp strm;
395
+ gz_headerp head;
396
+ {
397
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
398
+ if (strm->state->wrap != 2) return Z_STREAM_ERROR;
399
+ strm->state->gzhead = head;
400
+ return Z_OK;
401
+ }
402
+
403
+ /* ========================================================================= */
404
+ int ZEXPORT deflatePrime (strm, bits, value)
405
+ z_streamp strm;
406
+ int bits;
407
+ int value;
408
+ {
409
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
410
+ strm->state->bi_valid = bits;
411
+ strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
412
+ return Z_OK;
413
+ }
414
+
415
+ /* ========================================================================= */
416
+ int ZEXPORT deflateParams(strm, level, strategy)
417
+ z_streamp strm;
418
+ int level;
419
+ int strategy;
420
+ {
421
+ deflate_state *s;
422
+ compress_func func;
423
+ int err = Z_OK;
424
+
425
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
426
+ s = strm->state;
427
+
428
+ #ifdef FASTEST
429
+ if (level != 0) level = 1;
430
+ #else
431
+ if (level == Z_DEFAULT_COMPRESSION) level = 6;
432
+ #endif
433
+ if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
434
+ return Z_STREAM_ERROR;
435
+ }
436
+ func = configuration_table[s->level].func;
437
+
438
+ if (func != configuration_table[level].func && strm->total_in != 0) {
439
+ /* Flush the last buffer: */
440
+ err = deflate(strm, Z_PARTIAL_FLUSH);
441
+ }
442
+ if (s->level != level) {
443
+ s->level = level;
444
+ s->max_lazy_match = configuration_table[level].max_lazy;
445
+ s->good_match = configuration_table[level].good_length;
446
+ s->nice_match = configuration_table[level].nice_length;
447
+ s->max_chain_length = configuration_table[level].max_chain;
448
+ }
449
+ s->strategy = strategy;
450
+ return err;
451
+ }
452
+
453
+ /* ========================================================================= */
454
+ int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
455
+ z_streamp strm;
456
+ int good_length;
457
+ int max_lazy;
458
+ int nice_length;
459
+ int max_chain;
460
+ {
461
+ deflate_state *s;
462
+
463
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
464
+ s = strm->state;
465
+ s->good_match = good_length;
466
+ s->max_lazy_match = max_lazy;
467
+ s->nice_match = nice_length;
468
+ s->max_chain_length = max_chain;
469
+ return Z_OK;
470
+ }
471
+
472
+ /* =========================================================================
473
+ * For the default windowBits of 15 and memLevel of 8, this function returns
474
+ * a close to exact, as well as small, upper bound on the compressed size.
475
+ * They are coded as constants here for a reason--if the #define's are
476
+ * changed, then this function needs to be changed as well. The return
477
+ * value for 15 and 8 only works for those exact settings.
478
+ *
479
+ * For any setting other than those defaults for windowBits and memLevel,
480
+ * the value returned is a conservative worst case for the maximum expansion
481
+ * resulting from using fixed blocks instead of stored blocks, which deflate
482
+ * can emit on compressed data for some combinations of the parameters.
483
+ *
484
+ * This function could be more sophisticated to provide closer upper bounds
485
+ * for every combination of windowBits and memLevel, as well as wrap.
486
+ * But even the conservative upper bound of about 14% expansion does not
487
+ * seem onerous for output buffer allocation.
488
+ */
489
+ uLong ZEXPORT deflateBound(strm, sourceLen)
490
+ z_streamp strm;
491
+ uLong sourceLen;
492
+ {
493
+ deflate_state *s;
494
+ uLong destLen;
495
+
496
+ /* conservative upper bound */
497
+ destLen = sourceLen +
498
+ ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 11;
499
+
500
+ /* if can't get parameters, return conservative bound */
501
+ if (strm == Z_NULL || strm->state == Z_NULL)
502
+ return destLen;
503
+
504
+ /* if not default parameters, return conservative bound */
505
+ s = strm->state;
506
+ if (s->w_bits != 15 || s->hash_bits != 8 + 7)
507
+ return destLen;
508
+
509
+ /* default settings: return tight bound for that case */
510
+ return compressBound(sourceLen);
511
+ }
512
+
513
+ /* =========================================================================
514
+ * Put a short in the pending buffer. The 16-bit value is put in MSB order.
515
+ * IN assertion: the stream state is correct and there is enough room in
516
+ * pending_buf.
517
+ */
518
+ local void putShortMSB (s, b)
519
+ deflate_state *s;
520
+ uInt b;
521
+ {
522
+ put_byte(s, (Byte)(b >> 8));
523
+ put_byte(s, (Byte)(b & 0xff));
524
+ }
525
+
526
+ /* =========================================================================
527
+ * Flush as much pending output as possible. All deflate() output goes
528
+ * through this function so some applications may wish to modify it
529
+ * to avoid allocating a large strm->next_out buffer and copying into it.
530
+ * (See also read_buf()).
531
+ */
532
+ local void flush_pending(strm)
533
+ z_streamp strm;
534
+ {
535
+ unsigned len = strm->state->pending;
536
+
537
+ if (len > strm->avail_out) len = strm->avail_out;
538
+ if (len == 0) return;
539
+
540
+ zmemcpy(strm->next_out, strm->state->pending_out, len);
541
+ strm->next_out += len;
542
+ strm->state->pending_out += len;
543
+ strm->total_out += len;
544
+ strm->avail_out -= len;
545
+ strm->state->pending -= len;
546
+ if (strm->state->pending == 0) {
547
+ strm->state->pending_out = strm->state->pending_buf;
548
+ }
549
+ }
550
+
551
+ /* ========================================================================= */
552
+ int ZEXPORT deflate (strm, flush)
553
+ z_streamp strm;
554
+ int flush;
555
+ {
556
+ int old_flush; /* value of flush param for previous deflate call */
557
+ deflate_state *s;
558
+
559
+ if (strm == Z_NULL || strm->state == Z_NULL ||
560
+ flush > Z_FINISH || flush < 0) {
561
+ return Z_STREAM_ERROR;
562
+ }
563
+ s = strm->state;
564
+
565
+ if (strm->next_out == Z_NULL ||
566
+ (strm->next_in == Z_NULL && strm->avail_in != 0) ||
567
+ (s->status == FINISH_STATE && flush != Z_FINISH)) {
568
+ ERR_RETURN(strm, Z_STREAM_ERROR);
569
+ }
570
+ if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);
571
+
572
+ s->strm = strm; /* just in case */
573
+ old_flush = s->last_flush;
574
+ s->last_flush = flush;
575
+
576
+ /* Write the header */
577
+ if (s->status == INIT_STATE) {
578
+ #ifdef GZIP
579
+ if (s->wrap == 2) {
580
+ strm->adler = crc32(0L, Z_NULL, 0);
581
+ put_byte(s, 31);
582
+ put_byte(s, 139);
583
+ put_byte(s, 8);
584
+ if (s->gzhead == NULL) {
585
+ put_byte(s, 0);
586
+ put_byte(s, 0);
587
+ put_byte(s, 0);
588
+ put_byte(s, 0);
589
+ put_byte(s, 0);
590
+ put_byte(s, s->level == 9 ? 2 :
591
+ (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
592
+ 4 : 0));
593
+ put_byte(s, OS_CODE);
594
+ s->status = BUSY_STATE;
595
+ }
596
+ else {
597
+ put_byte(s, (s->gzhead->text ? 1 : 0) +
598
+ (s->gzhead->hcrc ? 2 : 0) +
599
+ (s->gzhead->extra == Z_NULL ? 0 : 4) +
600
+ (s->gzhead->name == Z_NULL ? 0 : 8) +
601
+ (s->gzhead->comment == Z_NULL ? 0 : 16)
602
+ );
603
+ put_byte(s, (Byte)(s->gzhead->time & 0xff));
604
+ put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
605
+ put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
606
+ put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
607
+ put_byte(s, s->level == 9 ? 2 :
608
+ (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
609
+ 4 : 0));
610
+ put_byte(s, s->gzhead->os & 0xff);
611
+ if (s->gzhead->extra != NULL) {
612
+ put_byte(s, s->gzhead->extra_len & 0xff);
613
+ put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);
614
+ }
615
+ if (s->gzhead->hcrc)
616
+ strm->adler = crc32(strm->adler, s->pending_buf,
617
+ s->pending);
618
+ s->gzindex = 0;
619
+ s->status = EXTRA_STATE;
620
+ }
621
+ }
622
+ else
623
+ #endif
624
+ {
625
+ uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
626
+ uInt level_flags;
627
+
628
+ if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)
629
+ level_flags = 0;
630
+ else if (s->level < 6)
631
+ level_flags = 1;
632
+ else if (s->level == 6)
633
+ level_flags = 2;
634
+ else
635
+ level_flags = 3;
636
+ header |= (level_flags << 6);
637
+ if (s->strstart != 0) header |= PRESET_DICT;
638
+ header += 31 - (header % 31);
639
+
640
+ s->status = BUSY_STATE;
641
+ putShortMSB(s, header);
642
+
643
+ /* Save the adler32 of the preset dictionary: */
644
+ if (s->strstart != 0) {
645
+ putShortMSB(s, (uInt)(strm->adler >> 16));
646
+ putShortMSB(s, (uInt)(strm->adler & 0xffff));
647
+ }
648
+ strm->adler = adler32(0L, Z_NULL, 0);
649
+ }
650
+ }
651
+ #ifdef GZIP
652
+ if (s->status == EXTRA_STATE) {
653
+ if (s->gzhead->extra != NULL) {
654
+ uInt beg = s->pending; /* start of bytes to update crc */
655
+
656
+ while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {
657
+ if (s->pending == s->pending_buf_size) {
658
+ if (s->gzhead->hcrc && s->pending > beg)
659
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
660
+ s->pending - beg);
661
+ flush_pending(strm);
662
+ beg = s->pending;
663
+ if (s->pending == s->pending_buf_size)
664
+ break;
665
+ }
666
+ put_byte(s, s->gzhead->extra[s->gzindex]);
667
+ s->gzindex++;
668
+ }
669
+ if (s->gzhead->hcrc && s->pending > beg)
670
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
671
+ s->pending - beg);
672
+ if (s->gzindex == s->gzhead->extra_len) {
673
+ s->gzindex = 0;
674
+ s->status = NAME_STATE;
675
+ }
676
+ }
677
+ else
678
+ s->status = NAME_STATE;
679
+ }
680
+ if (s->status == NAME_STATE) {
681
+ if (s->gzhead->name != NULL) {
682
+ uInt beg = s->pending; /* start of bytes to update crc */
683
+ int val;
684
+
685
+ do {
686
+ if (s->pending == s->pending_buf_size) {
687
+ if (s->gzhead->hcrc && s->pending > beg)
688
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
689
+ s->pending - beg);
690
+ flush_pending(strm);
691
+ beg = s->pending;
692
+ if (s->pending == s->pending_buf_size) {
693
+ val = 1;
694
+ break;
695
+ }
696
+ }
697
+ val = s->gzhead->name[s->gzindex++];
698
+ put_byte(s, val);
699
+ } while (val != 0);
700
+ if (s->gzhead->hcrc && s->pending > beg)
701
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
702
+ s->pending - beg);
703
+ if (val == 0) {
704
+ s->gzindex = 0;
705
+ s->status = COMMENT_STATE;
706
+ }
707
+ }
708
+ else
709
+ s->status = COMMENT_STATE;
710
+ }
711
+ if (s->status == COMMENT_STATE) {
712
+ if (s->gzhead->comment != NULL) {
713
+ uInt beg = s->pending; /* start of bytes to update crc */
714
+ int val;
715
+
716
+ do {
717
+ if (s->pending == s->pending_buf_size) {
718
+ if (s->gzhead->hcrc && s->pending > beg)
719
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
720
+ s->pending - beg);
721
+ flush_pending(strm);
722
+ beg = s->pending;
723
+ if (s->pending == s->pending_buf_size) {
724
+ val = 1;
725
+ break;
726
+ }
727
+ }
728
+ val = s->gzhead->comment[s->gzindex++];
729
+ put_byte(s, val);
730
+ } while (val != 0);
731
+ if (s->gzhead->hcrc && s->pending > beg)
732
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
733
+ s->pending - beg);
734
+ if (val == 0)
735
+ s->status = HCRC_STATE;
736
+ }
737
+ else
738
+ s->status = HCRC_STATE;
739
+ }
740
+ if (s->status == HCRC_STATE) {
741
+ if (s->gzhead->hcrc) {
742
+ if (s->pending + 2 > s->pending_buf_size)
743
+ flush_pending(strm);
744
+ if (s->pending + 2 <= s->pending_buf_size) {
745
+ put_byte(s, (Byte)(strm->adler & 0xff));
746
+ put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
747
+ strm->adler = crc32(0L, Z_NULL, 0);
748
+ s->status = BUSY_STATE;
749
+ }
750
+ }
751
+ else
752
+ s->status = BUSY_STATE;
753
+ }
754
+ #endif
755
+
756
+ /* Flush as much pending output as possible */
757
+ if (s->pending != 0) {
758
+ flush_pending(strm);
759
+ if (strm->avail_out == 0) {
760
+ /* Since avail_out is 0, deflate will be called again with
761
+ * more output space, but possibly with both pending and
762
+ * avail_in equal to zero. There won't be anything to do,
763
+ * but this is not an error situation so make sure we
764
+ * return OK instead of BUF_ERROR at next call of deflate:
765
+ */
766
+ s->last_flush = -1;
767
+ return Z_OK;
768
+ }
769
+
770
+ /* Make sure there is something to do and avoid duplicate consecutive
771
+ * flushes. For repeated and useless calls with Z_FINISH, we keep
772
+ * returning Z_STREAM_END instead of Z_BUF_ERROR.
773
+ */
774
+ } else if (strm->avail_in == 0 && flush <= old_flush &&
775
+ flush != Z_FINISH) {
776
+ ERR_RETURN(strm, Z_BUF_ERROR);
777
+ }
778
+
779
+ /* User must not provide more input after the first FINISH: */
780
+ if (s->status == FINISH_STATE && strm->avail_in != 0) {
781
+ ERR_RETURN(strm, Z_BUF_ERROR);
782
+ }
783
+
784
+ /* Start a new block or continue the current one.
785
+ */
786
+ if (strm->avail_in != 0 || s->lookahead != 0 ||
787
+ (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {
788
+ block_state bstate;
789
+
790
+ bstate = (*(configuration_table[s->level].func))(s, flush);
791
+
792
+ if (bstate == finish_started || bstate == finish_done) {
793
+ s->status = FINISH_STATE;
794
+ }
795
+ if (bstate == need_more || bstate == finish_started) {
796
+ if (strm->avail_out == 0) {
797
+ s->last_flush = -1; /* avoid BUF_ERROR next call, see above */
798
+ }
799
+ return Z_OK;
800
+ /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
801
+ * of deflate should use the same flush parameter to make sure
802
+ * that the flush is complete. So we don't have to output an
803
+ * empty block here, this will be done at next call. This also
804
+ * ensures that for a very small output buffer, we emit at most
805
+ * one empty block.
806
+ */
807
+ }
808
+ if (bstate == block_done) {
809
+ if (flush == Z_PARTIAL_FLUSH) {
810
+ _tr_align(s);
811
+ } else { /* FULL_FLUSH or SYNC_FLUSH */
812
+ _tr_stored_block(s, (char*)0, 0L, 0);
813
+ /* For a full flush, this empty block will be recognized
814
+ * as a special marker by inflate_sync().
815
+ */
816
+ if (flush == Z_FULL_FLUSH) {
817
+ CLEAR_HASH(s); /* forget history */
818
+ }
819
+ }
820
+ flush_pending(strm);
821
+ if (strm->avail_out == 0) {
822
+ s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */
823
+ return Z_OK;
824
+ }
825
+ }
826
+ }
827
+ Assert(strm->avail_out > 0, "bug2");
828
+
829
+ if (flush != Z_FINISH) return Z_OK;
830
+ if (s->wrap <= 0) return Z_STREAM_END;
831
+
832
+ /* Write the trailer */
833
+ #ifdef GZIP
834
+ if (s->wrap == 2) {
835
+ put_byte(s, (Byte)(strm->adler & 0xff));
836
+ put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
837
+ put_byte(s, (Byte)((strm->adler >> 16) & 0xff));
838
+ put_byte(s, (Byte)((strm->adler >> 24) & 0xff));
839
+ put_byte(s, (Byte)(strm->total_in & 0xff));
840
+ put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));
841
+ put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));
842
+ put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));
843
+ }
844
+ else
845
+ #endif
846
+ {
847
+ putShortMSB(s, (uInt)(strm->adler >> 16));
848
+ putShortMSB(s, (uInt)(strm->adler & 0xffff));
849
+ }
850
+ flush_pending(strm);
851
+ /* If avail_out is zero, the application will call deflate again
852
+ * to flush the rest.
853
+ */
854
+ if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */
855
+ return s->pending != 0 ? Z_OK : Z_STREAM_END;
856
+ }
857
+
858
+ /* ========================================================================= */
859
+ int ZEXPORT deflateEnd (strm)
860
+ z_streamp strm;
861
+ {
862
+ int status;
863
+
864
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
865
+
866
+ status = strm->state->status;
867
+ if (status != INIT_STATE &&
868
+ status != EXTRA_STATE &&
869
+ status != NAME_STATE &&
870
+ status != COMMENT_STATE &&
871
+ status != HCRC_STATE &&
872
+ status != BUSY_STATE &&
873
+ status != FINISH_STATE) {
874
+ return Z_STREAM_ERROR;
875
+ }
876
+
877
+ /* Deallocate in reverse order of allocations: */
878
+ TRY_FREE(strm, strm->state->pending_buf);
879
+ TRY_FREE(strm, strm->state->head);
880
+ TRY_FREE(strm, strm->state->prev);
881
+ TRY_FREE(strm, strm->state->window);
882
+
883
+ ZFREE(strm, strm->state);
884
+ strm->state = Z_NULL;
885
+
886
+ return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;
887
+ }
888
+
889
+ /* =========================================================================
890
+ * Copy the source state to the destination state.
891
+ * To simplify the source, this is not supported for 16-bit MSDOS (which
892
+ * doesn't have enough memory anyway to duplicate compression states).
893
+ */
894
+ int ZEXPORT deflateCopy (dest, source)
895
+ z_streamp dest;
896
+ z_streamp source;
897
+ {
898
+ #ifdef MAXSEG_64K
899
+ return Z_STREAM_ERROR;
900
+ #else
901
+ deflate_state *ds;
902
+ deflate_state *ss;
903
+ ushf *overlay;
904
+
905
+
906
+ if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {
907
+ return Z_STREAM_ERROR;
908
+ }
909
+
910
+ ss = source->state;
911
+
912
+ zmemcpy(dest, source, sizeof(z_stream));
913
+
914
+ ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
915
+ if (ds == Z_NULL) return Z_MEM_ERROR;
916
+ dest->state = (struct internal_state FAR *) ds;
917
+ zmemcpy(ds, ss, sizeof(deflate_state));
918
+ ds->strm = dest;
919
+
920
+ ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
921
+ ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));
922
+ ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos));
923
+ overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
924
+ ds->pending_buf = (uchf *) overlay;
925
+
926
+ if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
927
+ ds->pending_buf == Z_NULL) {
928
+ deflateEnd (dest);
929
+ return Z_MEM_ERROR;
930
+ }
931
+ /* following zmemcpy do not work for 16-bit MSDOS */
932
+ zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
933
+ zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
934
+ zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));
935
+ zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
936
+
937
+ ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);
938
+ ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
939
+ ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
940
+
941
+ ds->l_desc.dyn_tree = ds->dyn_ltree;
942
+ ds->d_desc.dyn_tree = ds->dyn_dtree;
943
+ ds->bl_desc.dyn_tree = ds->bl_tree;
944
+
945
+ return Z_OK;
946
+ #endif /* MAXSEG_64K */
947
+ }
948
+
949
+ /* ===========================================================================
950
+ * Read a new buffer from the current input stream, update the adler32
951
+ * and total number of bytes read. All deflate() input goes through
952
+ * this function so some applications may wish to modify it to avoid
953
+ * allocating a large strm->next_in buffer and copying from it.
954
+ * (See also flush_pending()).
955
+ */
956
+ local int read_buf(strm, buf, size)
957
+ z_streamp strm;
958
+ Bytef *buf;
959
+ unsigned size;
960
+ {
961
+ unsigned len = strm->avail_in;
962
+
963
+ if (len > size) len = size;
964
+ if (len == 0) return 0;
965
+
966
+ strm->avail_in -= len;
967
+
968
+ if (strm->state->wrap == 1) {
969
+ strm->adler = adler32(strm->adler, strm->next_in, len);
970
+ }
971
+ #ifdef GZIP
972
+ else if (strm->state->wrap == 2) {
973
+ strm->adler = crc32(strm->adler, strm->next_in, len);
974
+ }
975
+ #endif
976
+ zmemcpy(buf, strm->next_in, len);
977
+ strm->next_in += len;
978
+ strm->total_in += len;
979
+
980
+ return (int)len;
981
+ }
982
+
983
+ /* ===========================================================================
984
+ * Initialize the "longest match" routines for a new zlib stream
985
+ */
986
+ local void lm_init (s)
987
+ deflate_state *s;
988
+ {
989
+ s->window_size = (ulg)2L*s->w_size;
990
+
991
+ CLEAR_HASH(s);
992
+
993
+ /* Set the default configuration parameters:
994
+ */
995
+ s->max_lazy_match = configuration_table[s->level].max_lazy;
996
+ s->good_match = configuration_table[s->level].good_length;
997
+ s->nice_match = configuration_table[s->level].nice_length;
998
+ s->max_chain_length = configuration_table[s->level].max_chain;
999
+
1000
+ s->strstart = 0;
1001
+ s->block_start = 0L;
1002
+ s->lookahead = 0;
1003
+ s->match_length = s->prev_length = MIN_MATCH-1;
1004
+ s->match_available = 0;
1005
+ s->ins_h = 0;
1006
+ #ifndef FASTEST
1007
+ #ifdef ASMV
1008
+ match_init(); /* initialize the asm code */
1009
+ #endif
1010
+ #endif
1011
+ }
1012
+
1013
+ #ifndef FASTEST
1014
+ /* ===========================================================================
1015
+ * Set match_start to the longest match starting at the given string and
1016
+ * return its length. Matches shorter or equal to prev_length are discarded,
1017
+ * in which case the result is equal to prev_length and match_start is
1018
+ * garbage.
1019
+ * IN assertions: cur_match is the head of the hash chain for the current
1020
+ * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1021
+ * OUT assertion: the match length is not greater than s->lookahead.
1022
+ */
1023
+ #ifndef ASMV
1024
+ /* For 80x86 and 680x0, an optimized version will be provided in match.asm or
1025
+ * match.S. The code will be functionally equivalent.
1026
+ */
1027
+ local uInt longest_match(s, cur_match)
1028
+ deflate_state *s;
1029
+ IPos cur_match; /* current match */
1030
+ {
1031
+ unsigned chain_length = s->max_chain_length;/* max hash chain length */
1032
+ register Bytef *scan = s->window + s->strstart; /* current string */
1033
+ register Bytef *match; /* matched string */
1034
+ register int len; /* length of current match */
1035
+ int best_len = s->prev_length; /* best match length so far */
1036
+ int nice_match = s->nice_match; /* stop if match long enough */
1037
+ IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1038
+ s->strstart - (IPos)MAX_DIST(s) : NIL;
1039
+ /* Stop when cur_match becomes <= limit. To simplify the code,
1040
+ * we prevent matches with the string of window index 0.
1041
+ */
1042
+ Posf *prev = s->prev;
1043
+ uInt wmask = s->w_mask;
1044
+
1045
+ #ifdef UNALIGNED_OK
1046
+ /* Compare two bytes at a time. Note: this is not always beneficial.
1047
+ * Try with and without -DUNALIGNED_OK to check.
1048
+ */
1049
+ register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1050
+ register ush scan_start = *(ushf*)scan;
1051
+ register ush scan_end = *(ushf*)(scan+best_len-1);
1052
+ #else
1053
+ register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1054
+ register Byte scan_end1 = scan[best_len-1];
1055
+ register Byte scan_end = scan[best_len];
1056
+ #endif
1057
+
1058
+ /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1059
+ * It is easy to get rid of this optimization if necessary.
1060
+ */
1061
+ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1062
+
1063
+ /* Do not waste too much time if we already have a good match: */
1064
+ if (s->prev_length >= s->good_match) {
1065
+ chain_length >>= 2;
1066
+ }
1067
+ /* Do not look for matches beyond the end of the input. This is necessary
1068
+ * to make deflate deterministic.
1069
+ */
1070
+ if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1071
+
1072
+ Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1073
+
1074
+ do {
1075
+ Assert(cur_match < s->strstart, "no future");
1076
+ match = s->window + cur_match;
1077
+
1078
+ /* Skip to next match if the match length cannot increase
1079
+ * or if the match length is less than 2. Note that the checks below
1080
+ * for insufficient lookahead only occur occasionally for performance
1081
+ * reasons. Therefore uninitialized memory will be accessed, and
1082
+ * conditional jumps will be made that depend on those values.
1083
+ * However the length of the match is limited to the lookahead, so
1084
+ * the output of deflate is not affected by the uninitialized values.
1085
+ */
1086
+ #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1087
+ /* This code assumes sizeof(unsigned short) == 2. Do not use
1088
+ * UNALIGNED_OK if your compiler uses a different size.
1089
+ */
1090
+ if (*(ushf*)(match+best_len-1) != scan_end ||
1091
+ *(ushf*)match != scan_start) continue;
1092
+
1093
+ /* It is not necessary to compare scan[2] and match[2] since they are
1094
+ * always equal when the other bytes match, given that the hash keys
1095
+ * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1096
+ * strstart+3, +5, ... up to strstart+257. We check for insufficient
1097
+ * lookahead only every 4th comparison; the 128th check will be made
1098
+ * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1099
+ * necessary to put more guard bytes at the end of the window, or
1100
+ * to check more often for insufficient lookahead.
1101
+ */
1102
+ Assert(scan[2] == match[2], "scan[2]?");
1103
+ scan++, match++;
1104
+ do {
1105
+ } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1106
+ *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1107
+ *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1108
+ *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1109
+ scan < strend);
1110
+ /* The funny "do {}" generates better code on most compilers */
1111
+
1112
+ /* Here, scan <= window+strstart+257 */
1113
+ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1114
+ if (*scan == *match) scan++;
1115
+
1116
+ len = (MAX_MATCH - 1) - (int)(strend-scan);
1117
+ scan = strend - (MAX_MATCH-1);
1118
+
1119
+ #else /* UNALIGNED_OK */
1120
+
1121
+ if (match[best_len] != scan_end ||
1122
+ match[best_len-1] != scan_end1 ||
1123
+ *match != *scan ||
1124
+ *++match != scan[1]) continue;
1125
+
1126
+ /* The check at best_len-1 can be removed because it will be made
1127
+ * again later. (This heuristic is not always a win.)
1128
+ * It is not necessary to compare scan[2] and match[2] since they
1129
+ * are always equal when the other bytes match, given that
1130
+ * the hash keys are equal and that HASH_BITS >= 8.
1131
+ */
1132
+ scan += 2, match++;
1133
+ Assert(*scan == *match, "match[2]?");
1134
+
1135
+ /* We check for insufficient lookahead only every 8th comparison;
1136
+ * the 256th check will be made at strstart+258.
1137
+ */
1138
+ do {
1139
+ } while (*++scan == *++match && *++scan == *++match &&
1140
+ *++scan == *++match && *++scan == *++match &&
1141
+ *++scan == *++match && *++scan == *++match &&
1142
+ *++scan == *++match && *++scan == *++match &&
1143
+ scan < strend);
1144
+
1145
+ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1146
+
1147
+ len = MAX_MATCH - (int)(strend - scan);
1148
+ scan = strend - MAX_MATCH;
1149
+
1150
+ #endif /* UNALIGNED_OK */
1151
+
1152
+ if (len > best_len) {
1153
+ s->match_start = cur_match;
1154
+ best_len = len;
1155
+ if (len >= nice_match) break;
1156
+ #ifdef UNALIGNED_OK
1157
+ scan_end = *(ushf*)(scan+best_len-1);
1158
+ #else
1159
+ scan_end1 = scan[best_len-1];
1160
+ scan_end = scan[best_len];
1161
+ #endif
1162
+ }
1163
+ } while ((cur_match = prev[cur_match & wmask]) > limit
1164
+ && --chain_length != 0);
1165
+
1166
+ if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
1167
+ return s->lookahead;
1168
+ }
1169
+ #endif /* ASMV */
1170
+ #endif /* FASTEST */
1171
+
1172
+ /* ---------------------------------------------------------------------------
1173
+ * Optimized version for level == 1 or strategy == Z_RLE only
1174
+ */
1175
+ local uInt longest_match_fast(s, cur_match)
1176
+ deflate_state *s;
1177
+ IPos cur_match; /* current match */
1178
+ {
1179
+ register Bytef *scan = s->window + s->strstart; /* current string */
1180
+ register Bytef *match; /* matched string */
1181
+ register int len; /* length of current match */
1182
+ register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1183
+
1184
+ /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1185
+ * It is easy to get rid of this optimization if necessary.
1186
+ */
1187
+ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1188
+
1189
+ Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1190
+
1191
+ Assert(cur_match < s->strstart, "no future");
1192
+
1193
+ match = s->window + cur_match;
1194
+
1195
+ /* Return failure if the match length is less than 2:
1196
+ */
1197
+ if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1198
+
1199
+ /* The check at best_len-1 can be removed because it will be made
1200
+ * again later. (This heuristic is not always a win.)
1201
+ * It is not necessary to compare scan[2] and match[2] since they
1202
+ * are always equal when the other bytes match, given that
1203
+ * the hash keys are equal and that HASH_BITS >= 8.
1204
+ */
1205
+ scan += 2, match += 2;
1206
+ Assert(*scan == *match, "match[2]?");
1207
+
1208
+ /* We check for insufficient lookahead only every 8th comparison;
1209
+ * the 256th check will be made at strstart+258.
1210
+ */
1211
+ do {
1212
+ } while (*++scan == *++match && *++scan == *++match &&
1213
+ *++scan == *++match && *++scan == *++match &&
1214
+ *++scan == *++match && *++scan == *++match &&
1215
+ *++scan == *++match && *++scan == *++match &&
1216
+ scan < strend);
1217
+
1218
+ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1219
+
1220
+ len = MAX_MATCH - (int)(strend - scan);
1221
+
1222
+ if (len < MIN_MATCH) return MIN_MATCH - 1;
1223
+
1224
+ s->match_start = cur_match;
1225
+ return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
1226
+ }
1227
+
1228
+ #ifdef DEBUG
1229
+ /* ===========================================================================
1230
+ * Check that the match at match_start is indeed a match.
1231
+ */
1232
+ local void check_match(s, start, match, length)
1233
+ deflate_state *s;
1234
+ IPos start, match;
1235
+ int length;
1236
+ {
1237
+ /* check that the match is indeed a match */
1238
+ if (zmemcmp(s->window + match,
1239
+ s->window + start, length) != EQUAL) {
1240
+ fprintf(stderr, " start %u, match %u, length %d\n",
1241
+ start, match, length);
1242
+ do {
1243
+ fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
1244
+ } while (--length != 0);
1245
+ z_error("invalid match");
1246
+ }
1247
+ if (z_verbose > 1) {
1248
+ fprintf(stderr,"\\[%d,%d]", start-match, length);
1249
+ do { putc(s->window[start++], stderr); } while (--length != 0);
1250
+ }
1251
+ }
1252
+ #else
1253
+ # define check_match(s, start, match, length)
1254
+ #endif /* DEBUG */
1255
+
1256
+ /* ===========================================================================
1257
+ * Fill the window when the lookahead becomes insufficient.
1258
+ * Updates strstart and lookahead.
1259
+ *
1260
+ * IN assertion: lookahead < MIN_LOOKAHEAD
1261
+ * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
1262
+ * At least one byte has been read, or avail_in == 0; reads are
1263
+ * performed for at least two bytes (required for the zip translate_eol
1264
+ * option -- not supported here).
1265
+ */
1266
+ local void fill_window(s)
1267
+ deflate_state *s;
1268
+ {
1269
+ register unsigned n, m;
1270
+ register Posf *p;
1271
+ unsigned more; /* Amount of free space at the end of the window. */
1272
+ uInt wsize = s->w_size;
1273
+
1274
+ do {
1275
+ more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1276
+
1277
+ /* Deal with !@#$% 64K limit: */
1278
+ if (sizeof(int) <= 2) {
1279
+ if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1280
+ more = wsize;
1281
+
1282
+ } else if (more == (unsigned)(-1)) {
1283
+ /* Very unlikely, but possible on 16 bit machine if
1284
+ * strstart == 0 && lookahead == 1 (input done a byte at time)
1285
+ */
1286
+ more--;
1287
+ }
1288
+ }
1289
+
1290
+ /* If the window is almost full and there is insufficient lookahead,
1291
+ * move the upper half to the lower one to make room in the upper half.
1292
+ */
1293
+ if (s->strstart >= wsize+MAX_DIST(s)) {
1294
+
1295
+ zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
1296
+ s->match_start -= wsize;
1297
+ s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
1298
+ s->block_start -= (long) wsize;
1299
+
1300
+ /* Slide the hash table (could be avoided with 32 bit values
1301
+ at the expense of memory usage). We slide even when level == 0
1302
+ to keep the hash table consistent if we switch back to level > 0
1303
+ later. (Using level 0 permanently is not an optimal usage of
1304
+ zlib, so we don't care about this pathological case.)
1305
+ */
1306
+ /* %%% avoid this when Z_RLE */
1307
+ n = s->hash_size;
1308
+ p = &s->head[n];
1309
+ do {
1310
+ m = *--p;
1311
+ *p = (Pos)(m >= wsize ? m-wsize : NIL);
1312
+ } while (--n);
1313
+
1314
+ n = wsize;
1315
+ #ifndef FASTEST
1316
+ p = &s->prev[n];
1317
+ do {
1318
+ m = *--p;
1319
+ *p = (Pos)(m >= wsize ? m-wsize : NIL);
1320
+ /* If n is not on any hash chain, prev[n] is garbage but
1321
+ * its value will never be used.
1322
+ */
1323
+ } while (--n);
1324
+ #endif
1325
+ more += wsize;
1326
+ }
1327
+ if (s->strm->avail_in == 0) return;
1328
+
1329
+ /* If there was no sliding:
1330
+ * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
1331
+ * more == window_size - lookahead - strstart
1332
+ * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1333
+ * => more >= window_size - 2*WSIZE + 2
1334
+ * In the BIG_MEM or MMAP case (not yet supported),
1335
+ * window_size == input_size + MIN_LOOKAHEAD &&
1336
+ * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1337
+ * Otherwise, window_size == 2*WSIZE so more >= 2.
1338
+ * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
1339
+ */
1340
+ Assert(more >= 2, "more < 2");
1341
+
1342
+ n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1343
+ s->lookahead += n;
1344
+
1345
+ /* Initialize the hash value now that we have some input: */
1346
+ if (s->lookahead >= MIN_MATCH) {
1347
+ s->ins_h = s->window[s->strstart];
1348
+ UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1349
+ #if MIN_MATCH != 3
1350
+ Call UPDATE_HASH() MIN_MATCH-3 more times
1351
+ #endif
1352
+ }
1353
+ /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1354
+ * but this is not important since only literal bytes will be emitted.
1355
+ */
1356
+
1357
+ } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1358
+ }
1359
+
1360
+ /* ===========================================================================
1361
+ * Flush the current block, with given end-of-file flag.
1362
+ * IN assertion: strstart is set to the end of the current match.
1363
+ */
1364
+ #define FLUSH_BLOCK_ONLY(s, eof) { \
1365
+ _tr_flush_block(s, (s->block_start >= 0L ? \
1366
+ (charf *)&s->window[(unsigned)s->block_start] : \
1367
+ (charf *)Z_NULL), \
1368
+ (ulg)((long)s->strstart - s->block_start), \
1369
+ (eof)); \
1370
+ s->block_start = s->strstart; \
1371
+ flush_pending(s->strm); \
1372
+ Tracev((stderr,"[FLUSH]")); \
1373
+ }
1374
+
1375
+ /* Same but force premature exit if necessary. */
1376
+ #define FLUSH_BLOCK(s, eof) { \
1377
+ FLUSH_BLOCK_ONLY(s, eof); \
1378
+ if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \
1379
+ }
1380
+
1381
+ /* ===========================================================================
1382
+ * Copy without compression as much as possible from the input stream, return
1383
+ * the current block state.
1384
+ * This function does not insert new strings in the dictionary since
1385
+ * uncompressible data is probably not useful. This function is used
1386
+ * only for the level=0 compression option.
1387
+ * NOTE: this function should be optimized to avoid extra copying from
1388
+ * window to pending_buf.
1389
+ */
1390
+ local block_state deflate_stored(s, flush)
1391
+ deflate_state *s;
1392
+ int flush;
1393
+ {
1394
+ /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
1395
+ * to pending_buf_size, and each stored block has a 5 byte header:
1396
+ */
1397
+ ulg max_block_size = 0xffff;
1398
+ ulg max_start;
1399
+
1400
+ if (max_block_size > s->pending_buf_size - 5) {
1401
+ max_block_size = s->pending_buf_size - 5;
1402
+ }
1403
+
1404
+ /* Copy as much as possible from input to output: */
1405
+ for (;;) {
1406
+ /* Fill the window as much as possible: */
1407
+ if (s->lookahead <= 1) {
1408
+
1409
+ Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1410
+ s->block_start >= (long)s->w_size, "slide too late");
1411
+
1412
+ fill_window(s);
1413
+ if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;
1414
+
1415
+ if (s->lookahead == 0) break; /* flush the current block */
1416
+ }
1417
+ Assert(s->block_start >= 0L, "block gone");
1418
+
1419
+ s->strstart += s->lookahead;
1420
+ s->lookahead = 0;
1421
+
1422
+ /* Emit a stored block if pending_buf will be full: */
1423
+ max_start = s->block_start + max_block_size;
1424
+ if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1425
+ /* strstart == 0 is possible when wraparound on 16-bit machine */
1426
+ s->lookahead = (uInt)(s->strstart - max_start);
1427
+ s->strstart = (uInt)max_start;
1428
+ FLUSH_BLOCK(s, 0);
1429
+ }
1430
+ /* Flush if we may have to slide, otherwise block_start may become
1431
+ * negative and the data will be gone:
1432
+ */
1433
+ if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1434
+ FLUSH_BLOCK(s, 0);
1435
+ }
1436
+ }
1437
+ FLUSH_BLOCK(s, flush == Z_FINISH);
1438
+ return flush == Z_FINISH ? finish_done : block_done;
1439
+ }
1440
+
1441
+ /* ===========================================================================
1442
+ * Compress as much as possible from the input stream, return the current
1443
+ * block state.
1444
+ * This function does not perform lazy evaluation of matches and inserts
1445
+ * new strings in the dictionary only for unmatched strings or for short
1446
+ * matches. It is used only for the fast compression options.
1447
+ */
1448
+ local block_state deflate_fast(s, flush)
1449
+ deflate_state *s;
1450
+ int flush;
1451
+ {
1452
+ IPos hash_head = NIL; /* head of the hash chain */
1453
+ int bflush; /* set if current block must be flushed */
1454
+
1455
+ for (;;) {
1456
+ /* Make sure that we always have enough lookahead, except
1457
+ * at the end of the input file. We need MAX_MATCH bytes
1458
+ * for the next match, plus MIN_MATCH bytes to insert the
1459
+ * string following the next match.
1460
+ */
1461
+ if (s->lookahead < MIN_LOOKAHEAD) {
1462
+ fill_window(s);
1463
+ if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1464
+ return need_more;
1465
+ }
1466
+ if (s->lookahead == 0) break; /* flush the current block */
1467
+ }
1468
+
1469
+ /* Insert the string window[strstart .. strstart+2] in the
1470
+ * dictionary, and set hash_head to the head of the hash chain:
1471
+ */
1472
+ if (s->lookahead >= MIN_MATCH) {
1473
+ INSERT_STRING(s, s->strstart, hash_head);
1474
+ }
1475
+
1476
+ /* Find the longest match, discarding those <= prev_length.
1477
+ * At this point we have always match_length < MIN_MATCH
1478
+ */
1479
+ if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1480
+ /* To simplify the code, we prevent matches with the string
1481
+ * of window index 0 (in particular we have to avoid a match
1482
+ * of the string with itself at the start of the input file).
1483
+ */
1484
+ #ifdef FASTEST
1485
+ if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) ||
1486
+ (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {
1487
+ s->match_length = longest_match_fast (s, hash_head);
1488
+ }
1489
+ #else
1490
+ if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
1491
+ s->match_length = longest_match (s, hash_head);
1492
+ } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
1493
+ s->match_length = longest_match_fast (s, hash_head);
1494
+ }
1495
+ #endif
1496
+ /* longest_match() or longest_match_fast() sets match_start */
1497
+ }
1498
+ if (s->match_length >= MIN_MATCH) {
1499
+ check_match(s, s->strstart, s->match_start, s->match_length);
1500
+
1501
+ _tr_tally_dist(s, s->strstart - s->match_start,
1502
+ s->match_length - MIN_MATCH, bflush);
1503
+
1504
+ s->lookahead -= s->match_length;
1505
+
1506
+ /* Insert new strings in the hash table only if the match length
1507
+ * is not too large. This saves time but degrades compression.
1508
+ */
1509
+ #ifndef FASTEST
1510
+ if (s->match_length <= s->max_insert_length &&
1511
+ s->lookahead >= MIN_MATCH) {
1512
+ s->match_length--; /* string at strstart already in table */
1513
+ do {
1514
+ s->strstart++;
1515
+ INSERT_STRING(s, s->strstart, hash_head);
1516
+ /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1517
+ * always MIN_MATCH bytes ahead.
1518
+ */
1519
+ } while (--s->match_length != 0);
1520
+ s->strstart++;
1521
+ } else
1522
+ #endif
1523
+ {
1524
+ s->strstart += s->match_length;
1525
+ s->match_length = 0;
1526
+ s->ins_h = s->window[s->strstart];
1527
+ UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1528
+ #if MIN_MATCH != 3
1529
+ Call UPDATE_HASH() MIN_MATCH-3 more times
1530
+ #endif
1531
+ /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1532
+ * matter since it will be recomputed at next deflate call.
1533
+ */
1534
+ }
1535
+ } else {
1536
+ /* No match, output a literal byte */
1537
+ Tracevv((stderr,"%c", s->window[s->strstart]));
1538
+ _tr_tally_lit (s, s->window[s->strstart], bflush);
1539
+ s->lookahead--;
1540
+ s->strstart++;
1541
+ }
1542
+ if (bflush) FLUSH_BLOCK(s, 0);
1543
+ }
1544
+ FLUSH_BLOCK(s, flush == Z_FINISH);
1545
+ return flush == Z_FINISH ? finish_done : block_done;
1546
+ }
1547
+
1548
+ #ifndef FASTEST
1549
+ /* ===========================================================================
1550
+ * Same as above, but achieves better compression. We use a lazy
1551
+ * evaluation for matches: a match is finally adopted only if there is
1552
+ * no better match at the next window position.
1553
+ */
1554
+ local block_state deflate_slow(s, flush)
1555
+ deflate_state *s;
1556
+ int flush;
1557
+ {
1558
+ IPos hash_head = NIL; /* head of hash chain */
1559
+ int bflush; /* set if current block must be flushed */
1560
+
1561
+ /* Process the input block. */
1562
+ for (;;) {
1563
+ /* Make sure that we always have enough lookahead, except
1564
+ * at the end of the input file. We need MAX_MATCH bytes
1565
+ * for the next match, plus MIN_MATCH bytes to insert the
1566
+ * string following the next match.
1567
+ */
1568
+ if (s->lookahead < MIN_LOOKAHEAD) {
1569
+ fill_window(s);
1570
+ if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1571
+ return need_more;
1572
+ }
1573
+ if (s->lookahead == 0) break; /* flush the current block */
1574
+ }
1575
+
1576
+ /* Insert the string window[strstart .. strstart+2] in the
1577
+ * dictionary, and set hash_head to the head of the hash chain:
1578
+ */
1579
+ if (s->lookahead >= MIN_MATCH) {
1580
+ INSERT_STRING(s, s->strstart, hash_head);
1581
+ }
1582
+
1583
+ /* Find the longest match, discarding those <= prev_length.
1584
+ */
1585
+ s->prev_length = s->match_length, s->prev_match = s->match_start;
1586
+ s->match_length = MIN_MATCH-1;
1587
+
1588
+ if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
1589
+ s->strstart - hash_head <= MAX_DIST(s)) {
1590
+ /* To simplify the code, we prevent matches with the string
1591
+ * of window index 0 (in particular we have to avoid a match
1592
+ * of the string with itself at the start of the input file).
1593
+ */
1594
+ if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
1595
+ s->match_length = longest_match (s, hash_head);
1596
+ } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
1597
+ s->match_length = longest_match_fast (s, hash_head);
1598
+ }
1599
+ /* longest_match() or longest_match_fast() sets match_start */
1600
+
1601
+ if (s->match_length <= 5 && (s->strategy == Z_FILTERED
1602
+ #if TOO_FAR <= 32767
1603
+ || (s->match_length == MIN_MATCH &&
1604
+ s->strstart - s->match_start > TOO_FAR)
1605
+ #endif
1606
+ )) {
1607
+
1608
+ /* If prev_match is also MIN_MATCH, match_start is garbage
1609
+ * but we will ignore the current match anyway.
1610
+ */
1611
+ s->match_length = MIN_MATCH-1;
1612
+ }
1613
+ }
1614
+ /* If there was a match at the previous step and the current
1615
+ * match is not better, output the previous match:
1616
+ */
1617
+ if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1618
+ uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1619
+ /* Do not insert strings in hash table beyond this. */
1620
+
1621
+ check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1622
+
1623
+ _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1624
+ s->prev_length - MIN_MATCH, bflush);
1625
+
1626
+ /* Insert in hash table all strings up to the end of the match.
1627
+ * strstart-1 and strstart are already inserted. If there is not
1628
+ * enough lookahead, the last two strings are not inserted in
1629
+ * the hash table.
1630
+ */
1631
+ s->lookahead -= s->prev_length-1;
1632
+ s->prev_length -= 2;
1633
+ do {
1634
+ if (++s->strstart <= max_insert) {
1635
+ INSERT_STRING(s, s->strstart, hash_head);
1636
+ }
1637
+ } while (--s->prev_length != 0);
1638
+ s->match_available = 0;
1639
+ s->match_length = MIN_MATCH-1;
1640
+ s->strstart++;
1641
+
1642
+ if (bflush) FLUSH_BLOCK(s, 0);
1643
+
1644
+ } else if (s->match_available) {
1645
+ /* If there was no match at the previous position, output a
1646
+ * single literal. If there was a match but the current match
1647
+ * is longer, truncate the previous match to a single literal.
1648
+ */
1649
+ Tracevv((stderr,"%c", s->window[s->strstart-1]));
1650
+ _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1651
+ if (bflush) {
1652
+ FLUSH_BLOCK_ONLY(s, 0);
1653
+ }
1654
+ s->strstart++;
1655
+ s->lookahead--;
1656
+ if (s->strm->avail_out == 0) return need_more;
1657
+ } else {
1658
+ /* There is no previous match to compare with, wait for
1659
+ * the next step to decide.
1660
+ */
1661
+ s->match_available = 1;
1662
+ s->strstart++;
1663
+ s->lookahead--;
1664
+ }
1665
+ }
1666
+ Assert (flush != Z_NO_FLUSH, "no flush?");
1667
+ if (s->match_available) {
1668
+ Tracevv((stderr,"%c", s->window[s->strstart-1]));
1669
+ _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1670
+ s->match_available = 0;
1671
+ }
1672
+ FLUSH_BLOCK(s, flush == Z_FINISH);
1673
+ return flush == Z_FINISH ? finish_done : block_done;
1674
+ }
1675
+ #endif /* FASTEST */
1676
+
1677
+ #if 0
1678
+ /* ===========================================================================
1679
+ * For Z_RLE, simply look for runs of bytes, generate matches only of distance
1680
+ * one. Do not maintain a hash table. (It will be regenerated if this run of
1681
+ * deflate switches away from Z_RLE.)
1682
+ */
1683
+ local block_state deflate_rle(s, flush)
1684
+ deflate_state *s;
1685
+ int flush;
1686
+ {
1687
+ int bflush; /* set if current block must be flushed */
1688
+ uInt run; /* length of run */
1689
+ uInt max; /* maximum length of run */
1690
+ uInt prev; /* byte at distance one to match */
1691
+ Bytef *scan; /* scan for end of run */
1692
+
1693
+ for (;;) {
1694
+ /* Make sure that we always have enough lookahead, except
1695
+ * at the end of the input file. We need MAX_MATCH bytes
1696
+ * for the longest encodable run.
1697
+ */
1698
+ if (s->lookahead < MAX_MATCH) {
1699
+ fill_window(s);
1700
+ if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
1701
+ return need_more;
1702
+ }
1703
+ if (s->lookahead == 0) break; /* flush the current block */
1704
+ }
1705
+
1706
+ /* See how many times the previous byte repeats */
1707
+ run = 0;
1708
+ if (s->strstart > 0) { /* if there is a previous byte, that is */
1709
+ max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
1710
+ scan = s->window + s->strstart - 1;
1711
+ prev = *scan++;
1712
+ do {
1713
+ if (*scan++ != prev)
1714
+ break;
1715
+ } while (++run < max);
1716
+ }
1717
+
1718
+ /* Emit match if have run of MIN_MATCH or longer, else emit literal */
1719
+ if (run >= MIN_MATCH) {
1720
+ check_match(s, s->strstart, s->strstart - 1, run);
1721
+ _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);
1722
+ s->lookahead -= run;
1723
+ s->strstart += run;
1724
+ } else {
1725
+ /* No match, output a literal byte */
1726
+ Tracevv((stderr,"%c", s->window[s->strstart]));
1727
+ _tr_tally_lit (s, s->window[s->strstart], bflush);
1728
+ s->lookahead--;
1729
+ s->strstart++;
1730
+ }
1731
+ if (bflush) FLUSH_BLOCK(s, 0);
1732
+ }
1733
+ FLUSH_BLOCK(s, flush == Z_FINISH);
1734
+ return flush == Z_FINISH ? finish_done : block_done;
1735
+ }
1736
+ #endif