stormlib 1.0.0 → 1.0.1

data/ext/stormlib/StormLib/src/wdk/sources-wdk-tommath.c

@@ -0,0 +1,123 @@
+// This is a source file for WDK build of StormLib
+// It is copied to the root folder during the build process
+
+#pragma warning(disable:4334)             // warning C4334: '<<' : result of 32-bit shift implicitly converted to 64 bits (was 64-bit shift intended?)
+
+#include "src\libtommath\bn_fast_mp_invmod.c"
+#include "src\libtommath\bn_fast_mp_montgomery_reduce.c"
+#include "src\libtommath\bn_fast_s_mp_mul_digs.c"
+#include "src\libtommath\bn_fast_s_mp_mul_high_digs.c"
+#include "src\libtommath\bn_fast_s_mp_sqr.c"
+#include "src\libtommath\bn_mp_2expt.c"
+#include "src\libtommath\bn_mp_abs.c"
+#include "src\libtommath\bn_mp_add.c"
+#include "src\libtommath\bn_mp_add_d.c"
+#include "src\libtommath\bn_mp_addmod.c"
+#include "src\libtommath\bn_mp_and.c"
+#include "src\libtommath\bn_mp_clamp.c"
+#include "src\libtommath\bn_mp_clear.c"
+#include "src\libtommath\bn_mp_clear_multi.c"
+#include "src\libtommath\bn_mp_cmp.c"
+#include "src\libtommath\bn_mp_cmp_d.c"
+#include "src\libtommath\bn_mp_cmp_mag.c"
+#include "src\libtommath\bn_mp_cnt_lsb.c"
+#include "src\libtommath\bn_mp_copy.c"
+#include "src\libtommath\bn_mp_count_bits.c"
+#include "src\libtommath\bn_mp_div.c"
+#include "src\libtommath\bn_mp_div_2.c"
+#include "src\libtommath\bn_mp_div_2d.c"
+#include "src\libtommath\bn_mp_div_3.c"
+#include "src\libtommath\bn_mp_div_d.c"
+#include "src\libtommath\bn_mp_dr_is_modulus.c"
+#include "src\libtommath\bn_mp_dr_reduce.c"
+#include "src\libtommath\bn_mp_dr_setup.c"
+#include "src\libtommath\bn_mp_exch.c"
+#include "src\libtommath\bn_mp_expt_d.c"
+#include "src\libtommath\bn_mp_exptmod.c"
+#include "src\libtommath\bn_mp_exptmod_fast.c"
+#include "src\libtommath\bn_mp_exteuclid.c"
+#include "src\libtommath\bn_mp_fread.c"
+#include "src\libtommath\bn_mp_fwrite.c"
+#include "src\libtommath\bn_mp_gcd.c"
+#include "src\libtommath\bn_mp_get_int.c"
+#include "src\libtommath\bn_mp_grow.c"
+#include "src\libtommath\bn_mp_init.c"
+#include "src\libtommath\bn_mp_init_copy.c"
+#include "src\libtommath\bn_mp_init_multi.c"
+#include "src\libtommath\bn_mp_init_set.c"
+#include "src\libtommath\bn_mp_init_set_int.c"
+#include "src\libtommath\bn_mp_init_size.c"
+#include "src\libtommath\bn_mp_invmod.c"
+#include "src\libtommath\bn_mp_invmod_slow.c"
+#include "src\libtommath\bn_mp_is_square.c"
+#include "src\libtommath\bn_mp_jacobi.c"
+#include "src\libtommath\bn_mp_karatsuba_mul.c"
+#include "src\libtommath\bn_mp_karatsuba_sqr.c"
+#include "src\libtommath\bn_mp_lcm.c"
+#include "src\libtommath\bn_mp_lshd.c"
+#include "src\libtommath\bn_mp_mod.c"
+#include "src\libtommath\bn_mp_mod_2d.c"
+#include "src\libtommath\bn_mp_mod_d.c"
+#include "src\libtommath\bn_mp_montgomery_calc_normalization.c"
+#include "src\libtommath\bn_mp_montgomery_reduce.c"
+#include "src\libtommath\bn_mp_montgomery_setup.c"
+#include "src\libtommath\bn_mp_mul.c"
+#include "src\libtommath\bn_mp_mul_2.c"
+#include "src\libtommath\bn_mp_mul_2d.c"
+#include "src\libtommath\bn_mp_mul_d.c"
+#include "src\libtommath\bn_mp_mulmod.c"
+#include "src\libtommath\bn_mp_n_root.c"
+#include "src\libtommath\bn_mp_neg.c"
+#include "src\libtommath\bn_mp_or.c"
+#include "src\libtommath\bn_mp_prime_fermat.c"
+#include "src\libtommath\bn_mp_prime_is_divisible.c"
+#include "src\libtommath\bn_mp_prime_is_prime.c"
+#include "src\libtommath\bn_mp_prime_miller_rabin.c"
+#include "src\libtommath\bn_mp_prime_next_prime.c"
+#include "src\libtommath\bn_mp_prime_rabin_miller_trials.c"
+#include "src\libtommath\bn_mp_prime_random_ex.c"
+#include "src\libtommath\bn_mp_radix_size.c"
+#include "src\libtommath\bn_mp_radix_smap.c"
+#include "src\libtommath\bn_mp_rand.c"
+#include "src\libtommath\bn_mp_read_radix.c"
+#include "src\libtommath\bn_mp_read_signed_bin.c"
+#include "src\libtommath\bn_mp_read_unsigned_bin.c"
+#include "src\libtommath\bn_mp_reduce.c"
+#include "src\libtommath\bn_mp_reduce_2k.c"
+#include "src\libtommath\bn_mp_reduce_2k_l.c"
+#include "src\libtommath\bn_mp_reduce_2k_setup.c"
+#include "src\libtommath\bn_mp_reduce_2k_setup_l.c"
+#include "src\libtommath\bn_mp_reduce_is_2k.c"
+#include "src\libtommath\bn_mp_reduce_is_2k_l.c"
+#include "src\libtommath\bn_mp_reduce_setup.c"
+#include "src\libtommath\bn_mp_rshd.c"
+#include "src\libtommath\bn_mp_set.c"
+#include "src\libtommath\bn_mp_set_int.c"
+#include "src\libtommath\bn_mp_shrink.c"
+#include "src\libtommath\bn_mp_signed_bin_size.c"
+#include "src\libtommath\bn_mp_sqr.c"
+#include "src\libtommath\bn_mp_sqrmod.c"
+#include "src\libtommath\bn_mp_sqrt.c"
+#include "src\libtommath\bn_mp_sub.c"
+#include "src\libtommath\bn_mp_sub_d.c"
+#include "src\libtommath\bn_mp_submod.c"
+#include "src\libtommath\bn_mp_to_signed_bin.c"
+#include "src\libtommath\bn_mp_to_signed_bin_n.c"
+#include "src\libtommath\bn_mp_to_unsigned_bin.c"
+#include "src\libtommath\bn_mp_to_unsigned_bin_n.c"
+#include "src\libtommath\bn_mp_toom_mul.c"
+#include "src\libtommath\bn_mp_toom_sqr.c"
+#include "src\libtommath\bn_mp_toradix.c"
+#include "src\libtommath\bn_mp_toradix_n.c"
+#include "src\libtommath\bn_mp_unsigned_bin_size.c"
+#include "src\libtommath\bn_mp_xor.c"
+#include "src\libtommath\bn_mp_zero.c"
+#include "src\libtommath\bn_prime_tab.c"
+#include "src\libtommath\bn_reverse.c"
+#include "src\libtommath\bn_s_mp_add.c"
+#include "src\libtommath\bn_s_mp_exptmod.c"
+#include "src\libtommath\bn_s_mp_mul_digs.c"
+#include "src\libtommath\bn_s_mp_mul_high_digs.c"
+#include "src\libtommath\bn_s_mp_sqr.c"
+#include "src\libtommath\bn_s_mp_sub.c"
+#include "src\libtommath\bncore.c"

data/ext/stormlib/StormLib/src/wdk/sources-wdk-zlib.c

@@ -0,0 +1,21 @@
+// This is a source file for WDK build of StormLib
+// It is copied to the root folder during the build process
+
+#pragma warning(disable:4242)            // deflate.c(1693) : warning C4242: '=' : conversion from 'unsigned int' to 'Bytef', possible loss of data
+
+#define NO_DUMMY_DECL
+#define NO_GZIP
+#include "src\zlib\adler32.c"
+#undef DO1
+#undef DO8
+#undef MIN
+#include "src\zlib\compress.c"
+#include "src\zlib\crc32.c"
+#include "src\zlib\deflate.c"
+#include "src\zlib\trees.c"
+#include "src\zlib\zutil.c"
+
+#undef COPY                             // Conflicting definition
+#include "src\zlib\inflate.c"
+#include "src\zlib\inffast.c"
+#include "src\zlib\inftrees.c"

data/ext/stormlib/StormLib/src/zlib/adler32.c

@@ -0,0 +1,169 @@
+/* adler32.c -- compute the Adler-32 checksum of a data stream
+ * Copyright (C) 1995-2007 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#include "zutil.h"
+
+#define local static
+
+local uLong adler32_combine_(uLong adler1, uLong adler2, z_off64_t len2);
+
+#define BASE 65521UL    /* largest prime smaller than 65536 */
+#define NMAX 5552
+/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
+
+#define DO1(buf,i)  {adler += (buf)[i]; sum2 += adler;}
+#define DO2(buf,i)  DO1(buf,i); DO1(buf,i+1);
+#define DO4(buf,i)  DO2(buf,i); DO2(buf,i+2);
+#define DO8(buf,i)  DO4(buf,i); DO4(buf,i+4);
+#define DO16(buf)   DO8(buf,0); DO8(buf,8);
+
+/* use NO_DIVIDE if your processor does not do division in hardware */
+#ifdef NO_DIVIDE
+#  define MOD(a) \
+    do { \
+        if (a >= (BASE << 16)) a -= (BASE << 16); \
+        if (a >= (BASE << 15)) a -= (BASE << 15); \
+        if (a >= (BASE << 14)) a -= (BASE << 14); \
+        if (a >= (BASE << 13)) a -= (BASE << 13); \
+        if (a >= (BASE << 12)) a -= (BASE << 12); \
+        if (a >= (BASE << 11)) a -= (BASE << 11); \
+        if (a >= (BASE << 10)) a -= (BASE << 10); \
+        if (a >= (BASE << 9)) a -= (BASE << 9); \
+        if (a >= (BASE << 8)) a -= (BASE << 8); \
+        if (a >= (BASE << 7)) a -= (BASE << 7); \
+        if (a >= (BASE << 6)) a -= (BASE << 6); \
+        if (a >= (BASE << 5)) a -= (BASE << 5); \
+        if (a >= (BASE << 4)) a -= (BASE << 4); \
+        if (a >= (BASE << 3)) a -= (BASE << 3); \
+        if (a >= (BASE << 2)) a -= (BASE << 2); \
+        if (a >= (BASE << 1)) a -= (BASE << 1); \
+        if (a >= BASE) a -= BASE; \
+    } while (0)
+#  define MOD4(a) \
+    do { \
+        if (a >= (BASE << 4)) a -= (BASE << 4); \
+        if (a >= (BASE << 3)) a -= (BASE << 3); \
+        if (a >= (BASE << 2)) a -= (BASE << 2); \
+        if (a >= (BASE << 1)) a -= (BASE << 1); \
+        if (a >= BASE) a -= BASE; \
+    } while (0)
+#else
+#  define MOD(a) a %= BASE
+#  define MOD4(a) a %= BASE
+#endif
+
+/* ========================================================================= */
+uLong ZEXPORT adler32(adler, buf, len)
+    uLong adler;
+    const Bytef *buf;
+    uInt len;
+{
+    unsigned long sum2;
+    unsigned n;
+
+    /* split Adler-32 into component sums */
+    sum2 = (adler >> 16) & 0xffff;
+    adler &= 0xffff;
+
+    /* in case user likes doing a byte at a time, keep it fast */
+    if (len == 1) {
+        adler += buf[0];
+        if (adler >= BASE)
+            adler -= BASE;
+        sum2 += adler;
+        if (sum2 >= BASE)
+            sum2 -= BASE;
+        return adler | (sum2 << 16);
+    }
+
+    /* initial Adler-32 value (deferred check for len == 1 speed) */
+    if (buf == Z_NULL)
+        return 1L;
+
+    /* in case short lengths are provided, keep it somewhat fast */
+    if (len < 16) {
+        while (len--) {
+            adler += *buf++;
+            sum2 += adler;
+        }
+        if (adler >= BASE)
+            adler -= BASE;
+        MOD4(sum2);             /* only added so many BASE's */
+        return adler | (sum2 << 16);
+    }
+
+    /* do length NMAX blocks -- requires just one modulo operation */
+    while (len >= NMAX) {
+        len -= NMAX;
+        n = NMAX / 16;          /* NMAX is divisible by 16 */
+        do {
+            DO16(buf);          /* 16 sums unrolled */
+            buf += 16;
+        } while (--n);
+        MOD(adler);
+        MOD(sum2);
+    }
+
+    /* do remaining bytes (less than NMAX, still just one modulo) */
+    if (len) {                  /* avoid modulos if none remaining */
+        while (len >= 16) {
+            len -= 16;
+            DO16(buf);
+            buf += 16;
+        }
+        while (len--) {
+            adler += *buf++;
+            sum2 += adler;
+        }
+        MOD(adler);
+        MOD(sum2);
+    }
+
+    /* return recombined sums */
+    return adler | (sum2 << 16);
+}
+
+/* ========================================================================= */
+local uLong adler32_combine_(adler1, adler2, len2)
+    uLong adler1;
+    uLong adler2;
+    z_off64_t len2;
+{
+    unsigned long sum1;
+    unsigned long sum2;
+    unsigned rem;
+
+    /* the derivation of this formula is left as an exercise for the reader */
+    rem = (unsigned)(len2 % BASE);
+    sum1 = adler1 & 0xffff;
+    sum2 = rem * sum1;
+    MOD(sum2);
+    sum1 += (adler2 & 0xffff) + BASE - 1;
+    sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
+    if (sum1 >= BASE) sum1 -= BASE;
+    if (sum1 >= BASE) sum1 -= BASE;
+    if (sum2 >= (BASE << 1)) sum2 -= (BASE << 1);
+    if (sum2 >= BASE) sum2 -= BASE;
+    return sum1 | (sum2 << 16);
+}
+
+/* ========================================================================= */
+uLong ZEXPORT adler32_combine(adler1, adler2, len2)
+    uLong adler1;
+    uLong adler2;
+    z_off_t len2;
+{
+    return adler32_combine_(adler1, adler2, len2);
+}
+
+uLong ZEXPORT adler32_combine64(adler1, adler2, len2)
+    uLong adler1;
+    uLong adler2;
+    z_off64_t len2;
+{
+    return adler32_combine_(adler1, adler2, len2);
+}

data/ext/stormlib/StormLib/src/zlib/compress.c

@@ -0,0 +1,80 @@
+/* compress.c -- compress a memory buffer
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+/* ===========================================================================
+     Compresses the source buffer into the destination buffer. The level
+   parameter has the same meaning as in deflateInit.  sourceLen is the byte
+   length of the source buffer. Upon entry, destLen is the total size of the
+   destination buffer, which must be at least 0.1% larger than sourceLen plus
+   12 bytes. Upon exit, destLen is the actual size of the compressed buffer.
+
+     compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
+   memory, Z_BUF_ERROR if there was not enough room in the output buffer,
+   Z_STREAM_ERROR if the level parameter is invalid.
+*/
+int ZEXPORT compress2 (dest, destLen, source, sourceLen, level)
+    Bytef *dest;
+    uLongf *destLen;
+    const Bytef *source;
+    uLong sourceLen;
+    int level;
+{
+    z_stream stream;
+    int err;
+
+    stream.next_in = (Bytef*)source;
+    stream.avail_in = (uInt)sourceLen;
+#ifdef MAXSEG_64K
+    /* Check for source > 64K on 16-bit machine: */
+    if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
+#endif
+    stream.next_out = dest;
+    stream.avail_out = (uInt)*destLen;
+    if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;
+
+    stream.zalloc = (alloc_func)0;
+    stream.zfree = (free_func)0;
+    stream.opaque = (voidpf)0;
+
+    err = deflateInit(&stream, level);
+    if (err != Z_OK) return err;
+
+    err = deflate(&stream, Z_FINISH);
+    if (err != Z_STREAM_END) {
+        deflateEnd(&stream);
+        return err == Z_OK ? Z_BUF_ERROR : err;
+    }
+    *destLen = stream.total_out;
+
+    err = deflateEnd(&stream);
+    return err;
+}
+
+/* ===========================================================================
+ */
+int ZEXPORT compress (dest, destLen, source, sourceLen)
+    Bytef *dest;
+    uLongf *destLen;
+    const Bytef *source;
+    uLong sourceLen;
+{
+    return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);
+}
+
+/* ===========================================================================
+     If the default memLevel or windowBits for deflateInit() is changed, then
+   this function needs to be updated.
+ */
+uLong ZEXPORT compressBound (sourceLen)
+    uLong sourceLen;
+{
+    return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) +
+           (sourceLen >> 25) + 13;
+}

data/ext/stormlib/StormLib/src/zlib/compress_zlib.c

@@ -0,0 +1,5 @@
+// Some compilers (e.g. Visual Studio 2012) don't like the name conflict between
+// zlib\compress.c and bzip2\compress.c. This file is plain wrapper for compress.c
+// in order to create obj file with a different name.
+
+#include "compress.c"