@point3/node-rdkafka 3.6.0-1

package/deps/librdkafka/src/rdbuf.h

@@ -0,0 +1,375 @@
+/*
+ * librdkafka - Apache Kafka C library
+ *
+ * Copyright (c) 2017-2022, Magnus Edenhill
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef _RDBUF_H
+#define _RDBUF_H
+
+#ifndef _WIN32
+/* for struct iovec */
+#include <sys/socket.h>
+#include <sys/types.h>
+#endif
+
+#include "rdsysqueue.h"
+
+
+/**
+ * @name Generic byte buffers
+ *
+ * @{
+ *
+ * A buffer is a list of segments, each segment having a memory pointer,
+ * write offset, and capacity.
+ *
+ * The main buffer and segment structure is tailored for append-writing
+ * or append-pushing foreign memory.
+ *
+ * Updates of previously written memory regions are possible through the
+ * use of write_update() that takes an absolute offset.
+ *
+ * The write position is part of the buffer and segment structures, while
+ * read is a separate object (rd_slice_t) that does not affect the buffer.
+ */
+
+
+/**
+ * @brief Buffer segment
+ */
+typedef struct rd_segment_s {
+        TAILQ_ENTRY(rd_segment_s) seg_link; /*<< rbuf_segments Link */
+        char *seg_p;                        /**< Backing-store memory */
+        size_t seg_of;                      /**< Current relative write-position
+                                             *   (length of payload in this segment) */
+        size_t seg_size;                    /**< Allocated size of seg_p */
+        size_t seg_absof;          /**< Absolute offset of this segment's
+                                    *   beginning in the grand rd_buf_t */
+        void (*seg_free)(void *p); /**< Optional free function for seg_p */
+        int seg_flags;             /**< Segment flags */
+        size_t seg_erased;         /** Total number of bytes erased from
+                                    *   this segment. */
+#define RD_SEGMENT_F_RDONLY 0x1    /**< Read-only segment */
+#define RD_SEGMENT_F_FREE                                                      \
+        0x2 /**< Free segment on destroy,                                      \
+             *   e.g, not a fixed segment. */
+} rd_segment_t;
+
+
+
+TAILQ_HEAD(rd_segment_head, rd_segment_s);
+
+/**
+ * @brief Buffer, containing a list of segments.
+ */
+typedef struct rd_buf_s {
+        struct rd_segment_head rbuf_segments; /**< TAILQ list of segments */
+        size_t rbuf_segment_cnt;              /**< Number of segments */
+
+        rd_segment_t *rbuf_wpos; /**< Current write position seg */
+        size_t rbuf_len;         /**< Current (written) length */
+        size_t rbuf_erased;      /**< Total number of bytes
+                                  *   erased from segments.
+                                  *   This amount is taken into
+                                  *   account when checking for
+                                  *   writable space which is
+                                  *   always at the end of the
+                                  *   buffer and thus can't make
+                                  *   use of the erased parts. */
+        size_t rbuf_size;        /**< Total allocated size of
+                                  *   all segments. */
+
+        char *rbuf_extra;       /* Extra memory allocated for
+                                 * use by segment structs,
+                                 * buffer memory, etc. */
+        size_t rbuf_extra_len;  /* Current extra memory used */
+        size_t rbuf_extra_size; /* Total size of extra memory */
+} rd_buf_t;
+
+
+
+/**
+ * @brief A read-only slice of a buffer.
+ */
+typedef struct rd_slice_s {
+        const rd_buf_t *buf;     /**< Pointer to buffer */
+        const rd_segment_t *seg; /**< Current read position segment.
+                                  *   Will point to NULL when end of
+                                  *   slice is reached. */
+        size_t rof;              /**< Relative read offset in segment */
+        size_t start;            /**< Slice start offset in buffer */
+        size_t end;              /**< Slice end offset in buffer+1 */
+} rd_slice_t;
+
+
+
+/**
+ * @returns the current write position (absolute offset)
+ */
+static RD_INLINE RD_UNUSED size_t rd_buf_write_pos(const rd_buf_t *rbuf) {
+        const rd_segment_t *seg = rbuf->rbuf_wpos;
+
+        if (unlikely(!seg)) {
+#if ENABLE_DEVEL
+                rd_assert(rbuf->rbuf_len == 0);
+#endif
+                return 0;
+        }
+#if ENABLE_DEVEL
+        rd_assert(seg->seg_absof + seg->seg_of == rbuf->rbuf_len);
+#endif
+        return seg->seg_absof + seg->seg_of;
+}
+
+
+/**
+ * @returns the number of bytes available for writing (before growing).
+ */
+static RD_INLINE RD_UNUSED size_t rd_buf_write_remains(const rd_buf_t *rbuf) {
+        return rbuf->rbuf_size - (rbuf->rbuf_len + rbuf->rbuf_erased);
+}
+
+
+
+/**
+ * @returns the number of bytes remaining to write to the given segment,
+ *          and sets the \p *p pointer (unless NULL) to the start of
+ *          the contiguous memory.
+ */
+static RD_INLINE RD_UNUSED size_t
+rd_segment_write_remains(const rd_segment_t *seg, void **p) {
+        if (unlikely((seg->seg_flags & RD_SEGMENT_F_RDONLY)))
+                return 0;
+        if (p)
+                *p = (void *)(seg->seg_p + seg->seg_of);
+        return seg->seg_size - seg->seg_of;
+}
+
+
+
+/**
+ * @returns the last segment for the buffer.
+ */
+static RD_INLINE RD_UNUSED rd_segment_t *rd_buf_last(const rd_buf_t *rbuf) {
+        return TAILQ_LAST(&rbuf->rbuf_segments, rd_segment_head);
+}
+
+
+/**
+ * @returns the total written buffer length
+ */
+static RD_INLINE RD_UNUSED size_t rd_buf_len(const rd_buf_t *rbuf) {
+        return rbuf->rbuf_len;
+}
+
+
+int rd_buf_write_seek(rd_buf_t *rbuf, size_t absof);
+
+
+size_t rd_buf_write(rd_buf_t *rbuf, const void *payload, size_t size);
+size_t rd_buf_write_slice(rd_buf_t *rbuf, rd_slice_t *slice);
+size_t rd_buf_write_update(rd_buf_t *rbuf,
+                           size_t absof,
+                           const void *payload,
+                           size_t size);
+void rd_buf_push0(rd_buf_t *rbuf,
+                  const void *payload,
+                  size_t size,
+                  void (*free_cb)(void *),
+                  rd_bool_t writable);
+#define rd_buf_push(rbuf, payload, size, free_cb)                              \
+        rd_buf_push0(rbuf, payload, size, free_cb, rd_false /*not-writable*/)
+#define rd_buf_push_writable(rbuf, payload, size, free_cb)                     \
+        rd_buf_push0(rbuf, payload, size, free_cb, rd_true /*writable*/)
+
+size_t rd_buf_erase(rd_buf_t *rbuf, size_t absof, size_t size);
+
+size_t rd_buf_get_writable(rd_buf_t *rbuf, void **p);
+
+void rd_buf_write_ensure_contig(rd_buf_t *rbuf, size_t size);
+
+void rd_buf_write_ensure(rd_buf_t *rbuf, size_t min_size, size_t max_size);
+
+size_t rd_buf_get_write_iov(const rd_buf_t *rbuf,
+                            struct iovec *iovs,
+                            size_t *iovcntp,
+                            size_t iov_max,
+                            size_t size_max);
+
+void rd_buf_init(rd_buf_t *rbuf, size_t fixed_seg_cnt, size_t buf_size);
+rd_buf_t *rd_buf_new(size_t fixed_seg_cnt, size_t buf_size);
+
+void rd_buf_destroy(rd_buf_t *rbuf);
+void rd_buf_destroy_free(rd_buf_t *rbuf);
+
+void rd_buf_dump(const rd_buf_t *rbuf, int do_hexdump);
+
+int unittest_rdbuf(void);
+
+
+/**@}*/
+
+
+
+/**
+ * @name Buffer reads operate on slices of an rd_buf_t and does not
+ *       modify the underlying rd_buf_t itself.
+ *
+ * @warning A slice will not be valid/safe after the buffer or
+ *          segments have been modified by a buf write operation
+ *          (write, update, write_seek, etc).
+ * @{
+ */
+
+
+/**
+ * @returns the remaining length in the slice
+ */
+#define rd_slice_remains(slice) ((slice)->end - rd_slice_abs_offset(slice))
+
+/**
+ * @returns the total size of the slice, regardless of current position.
+ */
+#define rd_slice_size(slice) ((slice)->end - (slice)->start)
+
+/**
+ * @returns the read position in the slice as a new slice.
+ */
+static RD_INLINE RD_UNUSED rd_slice_t rd_slice_pos(const rd_slice_t *slice) {
+        rd_slice_t newslice = *slice;
+
+        if (!slice->seg)
+                return newslice;
+
+        newslice.start = slice->seg->seg_absof + slice->rof;
+
+        return newslice;
+}
+
+/**
+ * @returns the read position as an absolute buffer byte offset.
+ * @remark this is the buffer offset, not the slice's local offset.
+ */
+static RD_INLINE RD_UNUSED size_t rd_slice_abs_offset(const rd_slice_t *slice) {
+        if (unlikely(!slice->seg)) /* reader has reached the end */
+                return slice->end;
+
+        return slice->seg->seg_absof + slice->rof;
+}
+
+/**
+ * @returns the read position as a byte offset.
+ * @remark this is the slice-local offset, not the backing buffer's offset.
+ */
+static RD_INLINE RD_UNUSED size_t rd_slice_offset(const rd_slice_t *slice) {
+        if (unlikely(!slice->seg)) /* reader has reached the end */
+                return rd_slice_size(slice);
+
+        return (slice->seg->seg_absof + slice->rof) - slice->start;
+}
+
+
+
+int rd_slice_init_seg(rd_slice_t *slice,
+                      const rd_buf_t *rbuf,
+                      const rd_segment_t *seg,
+                      size_t rof,
+                      size_t size);
+int rd_slice_init(rd_slice_t *slice,
+                  const rd_buf_t *rbuf,
+                  size_t absof,
+                  size_t size);
+void rd_slice_init_full(rd_slice_t *slice, const rd_buf_t *rbuf);
+
+size_t rd_slice_reader(rd_slice_t *slice, const void **p);
+size_t rd_slice_peeker(const rd_slice_t *slice, const void **p);
+
+size_t rd_slice_read(rd_slice_t *slice, void *dst, size_t size);
+size_t
+rd_slice_peek(const rd_slice_t *slice, size_t offset, void *dst, size_t size);
+
+size_t rd_slice_read_uvarint(rd_slice_t *slice, uint64_t *nump);
+
+/**
+ * @brief Read a zig-zag varint-encoded signed integer from \p slice,
+ *        storing the decoded number in \p nump on success (return value > 0).
+ *
+ * @returns the number of bytes read on success or 0 in case of
+ *          buffer underflow.
+ */
+static RD_UNUSED RD_INLINE size_t rd_slice_read_varint(rd_slice_t *slice,
+                                                       int64_t *nump) {
+        size_t r;
+        uint64_t unum;
+
+        r = rd_slice_read_uvarint(slice, &unum);
+        if (likely(r > 0)) {
+                /* Zig-zag decoding */
+                *nump = (int64_t)((unum >> 1) ^ -(int64_t)(unum & 1));
+        }
+
+        return r;
+}
+
+
+
+const void *rd_slice_ensure_contig(rd_slice_t *slice, size_t size);
+
+int rd_slice_seek(rd_slice_t *slice, size_t offset);
+
+size_t rd_slice_get_iov(const rd_slice_t *slice,
+                        struct iovec *iovs,
+                        size_t *iovcntp,
+                        size_t iov_max,
+                        size_t size_max);
+
+
+uint32_t rd_slice_crc32(rd_slice_t *slice);
+uint32_t rd_slice_crc32c(rd_slice_t *slice);
+
+
+int rd_slice_narrow(rd_slice_t *slice,
+                    rd_slice_t *save_slice,
+                    size_t size) RD_WARN_UNUSED_RESULT;
+int rd_slice_narrow_relative(rd_slice_t *slice,
+                             rd_slice_t *save_slice,
+                             size_t relsize) RD_WARN_UNUSED_RESULT;
+void rd_slice_widen(rd_slice_t *slice, const rd_slice_t *save_slice);
+int rd_slice_narrow_copy(const rd_slice_t *orig,
+                         rd_slice_t *new_slice,
+                         size_t size) RD_WARN_UNUSED_RESULT;
+int rd_slice_narrow_copy_relative(const rd_slice_t *orig,
+                                  rd_slice_t *new_slice,
+                                  size_t relsize) RD_WARN_UNUSED_RESULT;
+
+void rd_slice_dump(const rd_slice_t *slice, int do_hexdump);
+
+
+/**@}*/
+
+
+
+#endif /* _RDBUF_H */

package/deps/librdkafka/src/rdcrc32.c

@@ -0,0 +1,114 @@
+/*
+ * librdkafka - Apache Kafka C library
+ *
+ * Copyright (c) 2018-2022, Magnus Edenhill
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+/**
+ * \file rdcrc32.c
+ * Functions and types for CRC checks.
+ *
+ *
+ *
+ * Generated on Tue May  8 17:37:04 2012,
+ * by pycrc v0.7.10, http://www.tty1.net/pycrc/
+ * using the configuration:
+ *    Width        = 32
+ *    Poly         = 0x04c11db7
+ *    XorIn        = 0xffffffff
+ *    ReflectIn    = True
+ *    XorOut       = 0xffffffff
+ *    ReflectOut   = True
+ *    Algorithm    = table-driven
+ *****************************************************************************/
+#include "rdcrc32.h" /* include the header file generated with pycrc */
+#include <stdlib.h>
+#include <stdint.h>
+
+/**
+ * Static table used for the table_driven implementation.
+ *****************************************************************************/
+const rd_crc32_t crc_table[256] = {
+    0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
+    0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
+    0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
+    0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
+    0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
+    0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
+    0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
+    0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
+    0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
+    0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
+    0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
+    0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
+    0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
+    0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
+    0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
+    0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
+    0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
+    0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
+    0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
+    0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
+    0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
+    0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
+    0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
+    0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
+    0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
+    0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
+    0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
+    0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
+    0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
+    0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
+    0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
+    0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
+    0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
+    0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
+    0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
+    0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
+    0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
+    0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
+    0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
+    0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
+    0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
+    0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
+    0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d};
+
+/**
+ * Reflect all bits of a \a data word of \a data_len bytes.
+ *
+ * \param data         The data word to be reflected.
+ * \param data_len     The width of \a data expressed in number of bits.
+ * \return             The reflected data.
+ *****************************************************************************/
+rd_crc32_t rd_crc32_reflect(rd_crc32_t data, size_t data_len) {
+        unsigned int i;
+        rd_crc32_t ret;
+
+        ret = data & 0x01;
+        for (i = 1; i < data_len; i++) {
+                data >>= 1;
+                ret = (ret << 1) | (data & 0x01);
+        }
+        return ret;
+}

package/deps/librdkafka/src/rdcrc32.h

@@ -0,0 +1,170 @@
+/*
+ * librdkafka - Apache Kafka C library
+ *
+ * Copyright (c) 2018-2022, Magnus Edenhill
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+/**
+ * \file rdcrc32.h
+ * Functions and types for CRC checks.
+ *
+ * Generated on Tue May  8 17:36:59 2012,
+ * by pycrc v0.7.10, http://www.tty1.net/pycrc/
+ *
+ * NOTE: Contains librd modifications:
+ *       - rd_crc32() helper.
+ *       - __RDCRC32___H__ define (was missing the '32' part).
+ *
+ * using the configuration:
+ *    Width        = 32
+ *    Poly         = 0x04c11db7
+ *    XorIn        = 0xffffffff
+ *    ReflectIn    = True
+ *    XorOut       = 0xffffffff
+ *    ReflectOut   = True
+ *    Algorithm    = table-driven
+ *****************************************************************************/
+#ifndef __RDCRC32___H__
+#define __RDCRC32___H__
+
+#include "rd.h"
+
+#include <stdlib.h>
+#include <stdint.h>
+
+#if WITH_ZLIB
+#include <zlib.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+/**
+ * The definition of the used algorithm.
+ *****************************************************************************/
+#define CRC_ALGO_TABLE_DRIVEN 1
+
+
+/**
+ * The type of the CRC values.
+ *
+ * This type must be big enough to contain at least 32 bits.
+ *****************************************************************************/
+typedef uint32_t rd_crc32_t;
+
+#if !WITH_ZLIB
+extern const rd_crc32_t crc_table[256];
+#endif
+
+
+/**
+ * Reflect all bits of a \a data word of \a data_len bytes.
+ *
+ * \param data         The data word to be reflected.
+ * \param data_len     The width of \a data expressed in number of bits.
+ * \return             The reflected data.
+ *****************************************************************************/
+rd_crc32_t rd_crc32_reflect(rd_crc32_t data, size_t data_len);
+
+
+/**
+ * Calculate the initial crc value.
+ *
+ * \return     The initial crc value.
+ *****************************************************************************/
+static RD_INLINE rd_crc32_t rd_crc32_init(void) {
+#if WITH_ZLIB
+        return crc32(0, NULL, 0);
+#else
+        return 0xffffffff;
+#endif
+}
+
+
+/**
+ * Update the crc value with new data.
+ *
+ * \param crc      The current crc value.
+ * \param data     Pointer to a buffer of \a data_len bytes.
+ * \param data_len Number of bytes in the \a data buffer.
+ * \return         The updated crc value.
+ *****************************************************************************/
+/**
+ * Update the crc value with new data.
+ *
+ * \param crc      The current crc value.
+ * \param data     Pointer to a buffer of \a data_len bytes.
+ * \param data_len Number of bytes in the \a data buffer.
+ * \return         The updated crc value.
+ *****************************************************************************/
+static RD_INLINE RD_UNUSED rd_crc32_t rd_crc32_update(rd_crc32_t crc,
+                                                      const unsigned char *data,
+                                                      size_t data_len) {
+#if WITH_ZLIB
+        rd_assert(data_len <= UINT_MAX);
+        return crc32(crc, data, (uInt)data_len);
+#else
+        unsigned int tbl_idx;
+
+        while (data_len--) {
+                tbl_idx = (crc ^ *data) & 0xff;
+                crc     = (crc_table[tbl_idx] ^ (crc >> 8)) & 0xffffffff;
+
+                data++;
+        }
+        return crc & 0xffffffff;
+#endif
+}
+
+
+/**
+ * Calculate the final crc value.
+ *
+ * \param crc  The current crc value.
+ * \return     The final crc value.
+ *****************************************************************************/
+static RD_INLINE rd_crc32_t rd_crc32_finalize(rd_crc32_t crc) {
+#if WITH_ZLIB
+        return crc;
+#else
+        return crc ^ 0xffffffff;
+#endif
+}
+
+
+/**
+ * Wrapper for performing CRC32 on the provided buffer.
+ */
+static RD_INLINE rd_crc32_t rd_crc32(const char *data, size_t data_len) {
+        return rd_crc32_finalize(rd_crc32_update(
+            rd_crc32_init(), (const unsigned char *)data, data_len));
+}
+
+#ifdef __cplusplus
+} /* closing brace for extern "C" */
+#endif
+
+#endif /* __RDCRC32___H__ */