/*
- * LiZzaRd -- Fast compression method based on Lempel-Ziv 77
+ * LiZaRd -- Fast compression method based on Lempel-Ziv 77
*
* (c) 2004, Robert Spalek <robert@ucw.cz>
*
- * The file format is based on LZO1X and
- * the compression method is based on zlib.
+ * This software may be freely distributed and used according to the terms
+ * of the GNU Lesser General Public License.
*/
-#define LIZZARD_NEEDS_CHARS 8
+#ifndef _UCW_LIZARD_H
+#define _UCW_LIZARD_H
+
+#define LIZARD_NEEDS_CHARS 8
/* The compression routine needs input buffer 8 characters longer, because it
* does not check the input bounds all the time. */
-#define LIZZARD_MAX_MULTIPLY 23./22
-#define LIZZARD_MAX_ADD 4
+#define LIZARD_MAX_MULTIPLY 23./22
+#define LIZARD_MAX_ADD 4
/* In the worst case, the compressed file will not be longer than its
* original length * 23/22 + 4.
*
* The multiplicative constant comes from 19-byte incompressible string
* followed by a 3-sequence that can be compressed into 2-byte link. This
* breaks the copy-mode and it needs to be restarted with a new header. The
- * total length is 2(header) + 2(link) + 19(string) = 23.
+ * total length is 2(header) + 19(string) + 2(link) = 23.
*/
-int lizzard_compress(byte *in, uns in_len, byte *out);
-int lizzard_decompress(byte *in, byte *out);
+/* lizard.c */
+int lizard_compress(const byte *in, uns in_len, byte *out);
+int lizard_decompress(const byte *in, byte *out);
+
+/* lizard-safe.c */
+struct lizard_buffer;
+
+struct lizard_buffer *lizard_alloc(void);
+void lizard_free(struct lizard_buffer *buf);
+byte *lizard_decompress_safe(const byte *in, struct lizard_buffer *buf, uns expected_length);
+
+/* adler32.c */
+uns update_adler32(uns adler, const byte *ptr, uns len);
+
+static inline uns
+adler32(const byte *buf, uns len)
+{
+ return update_adler32(1, buf, len);
+}
+
+#endif