fast-stats 1.7

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 2333c25bd11e2269552ec7a993f4669e7678a46e
+  data.tar.gz: 24b6f8bfcb9394f491696f0db9a8c821b5fce972
+SHA512:
+  metadata.gz: bb6441cdf70869f5520ae8c27ff87df3d7b9c3c662186ee48e870ee8532f2dac9fbb32b9ede05c5d7c8d385893775c66af0b552211acfc3d9e845f235d601132
+  data.tar.gz: d1d9c73c37d20620009fa0db0ece7039757c41c5096916c5eb1bf106ba2f2c7cef16f6912735d6f4d6e838b154bf26368b38f3fb8dccb299036b42ff987b60fa

data/Makefile

@@ -0,0 +1,23 @@
+.PHONY: all build test copy-lib-files
+
+GEMVERSION = $(shell ruby -e 'require "./lib/stats/version.rb"; puts StatsGem::VERSION')
+$(info gem version is $(GEMVERSION))
+
+all: build test
+
+build: copy-lib-files
+	gem build fast-stats.gemspec
+	gem install fast-stats-$(GEMVERSION).gem
+
+copy-lib-files:
+	if [ ! -d ext/stats/stats ]; then mkdir ext/stats/stats; fi
+	cp ../include/stats/*.h ext/stats/stats
+	cp ../src/*.c ext/stats
+	cp ../ext/*.c ext/stats
+	cp ../ext/*.h ext/stats
+
+test:
+	ruby ./test/test_stats.rb
+
+benchmark:
+	ruby ./test/benchmark_stats.rb

data/ext/stats/.gitignore

@@ -0,0 +1,12 @@
+error.c
+hash.c
+lock.c
+mt19937.c
+mt19937.h
+semaphore.c
+shared_mem.c
+stats
+stats.c
+strlcat.c
+strlcpy.c
+

data/ext/stats/error.c

@@ -0,0 +1,42 @@
+/* error.c */
+
+#include "stats/error.h"
+
+const char * error_message(int code)
+{
+    switch (code)
+    {
+    case S_OK:                                      return "S_OK";
+
+    case ERROR_FAIL:                                return "ERRROR_FAIL";
+    case ERROR_INVALID_PARAMETERS:                  return "ERROR_INVALID_PARAMETERS";
+    case ERROR_MEMORY:                              return "ERROR_MEMORY";
+
+    case ERROR_SHARED_MEM_NAME_TOO_LONG:            return "ERROR_SHARED_MEM_NAME_TOO_LONG";
+    case ERROR_SHARED_MEM_CANNOT_CREATE_DIRECTORY:  return "ERROR_SHARED_MEM_CANNOT_CREATE_DIRECTORY";
+    case ERROR_SHARED_MEM_PATH_NOT_DIRECTORY:       return "ERROR_SHARED_MEM_PATH_NOT_DIRECTORY";
+    case ERROR_SHARED_MEM_CANNOT_CREATE_PATH:       return "ERROR_SHARED_MEM_CANNOT_CREATE_PATH";
+    case ERROR_SHARED_MEM_CANNOT_CREATE_IPC_TOKEN:  return "ERROR_SHARED_MEM_CANNOT_CREATE_IPC_TOKEN";
+    case ERROR_SHARED_MEM_ALREADY_EXISTS:           return "ERROR_SHARED_MEM_ALREADY_EXISTS";
+    case ERROR_SHARED_MEM_DOES_NOT_EXIST:           return "ERROR_SHARED_MEM_DOES_NOT_EXIST";
+    case ERROR_SHARED_MEM_INVALID_SIZE:             return "ERROR_SHARED_MEM_INVALID_SIZE";
+    case ERROR_SHARED_MEM_CANNOT_STAT:              return "ERROR_SHARED_MEM_CANNOT_STAT";
+    case ERROR_SHARED_MEM_CANNOT_OPEN:              return "ERROR_SHARED_MEM_CANNOT_OPEN";
+    case ERROR_SHARED_MEM_CANNOT_ATTACH:            return "ERROR_SHARED_MEM_CANNOT_ATTACH";
+
+    case ERROR_SEMAPHORE_NAME_TOO_LONG:             return "ERROR_SEMAPHORE_NAME_TOO_LONG";
+    case ERROR_SEMAPHORE_CANNOT_CREATE_DIRECTORY:   return "ERROR_SEMAPHORE_CANNOT_CREATE_DIRECTORY";
+    case ERROR_SEMAPHORE_PATH_NOT_DIRECTORY:        return "ERROR_SEMAPHORE_PATH_NOT_DIRECTORY";
+    case ERROR_SEMAPHORE_CANNOT_CREATE_PATH:        return "ERROR_SEMAPHORE_CANNOT_CREATE_PATH";
+    case ERROR_SEMAPHORE_CANNOT_CREATE_IPC_TOKEN:   return "ERROR_SEMAPHORE_CANNOT_CREATE_IPC_TOKEN";
+    case ERROR_SEMAPHORE_ALREADY_EXISTS:            return "ERROR_SEMAPHORE_ALREADY_EXISTS";
+    case ERROR_SEMAPHORE_DOES_NOT_EXIST:            return "ERROR_SEMAPHORE_DOES_NOT_EXIST";
+    case ERROR_SEMAPHORE_INVALID_SIZE:              return "ERROR_SEMAPHORE_INVALID_SIZE";
+    case ERROR_SEMAPHORE_CANNOT_OPEN:               return "ERROR_SEMAPHORE_CANNOT_OPEN";
+
+    case ERROR_STATS_CANNOT_ALLOCATE_COUNTER:       return "ERROR_STATS_CANNOT_ALLOCATE_COUNTER";
+    case ERROR_STATS_KEY_TOO_LONG:                  return "ERROR_STATS_KEY_TOO_LONG";
+
+    }
+    return "UNKNOWN_ERROR";
+}

data/ext/stats/extconf.rb

@@ -0,0 +1,18 @@
+require 'mkmf'
+require 'rbconfig'
+
+$CFLAGS << ' -Wall -Wno-multichar'
+$CFLAGS << ' -Wextra -O0 -ggdb3' if ENV['DEBUG']
+
+$CFLAGS << ' -DDEBUG=1' if ENV['DEBUG']
+$CFLAGS << ' -DDEBUG=0' unless ENV['DEBUG']
+
+$uname = `uname -a`
+if /linux/i =~ $uname
+  $CFLAGS << ' -DLINUX'
+  have_library('rt','clock_gettime') && append_library($libs,'rt')
+end
+
+$CFLAGS << ' -DDARWIN' if /darwin/i =~ $uname
+
+create_makefile('stats/stats')

data/ext/stats/hash.c

@@ -0,0 +1,66 @@
+/*
+ * Paul Hsieh's SuperFastHash function
+ *
+ * http://www.azillionmonkeys.com/qed/hash.html
+ *
+ * Released under LGPL 2.1
+ */
+
+#include "stats/hash.h"
+
+#undef get16bits
+#if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__)
+#define get16bits(d) (*((const uint16_t *) (d)))
+#endif
+
+#if !defined (get16bits)
+#define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8)\
+                       +(uint32_t)(((const uint8_t *)(d))[0]) )
+#endif
+
+uint32_t fast_hash(const char * data, int len)
+{
+    uint32_t hash = len, tmp;
+    int rem;
+
+    if (len <= 0 || data == 0)
+        return 0;
+
+    rem = len & 3;
+    len >>= 2;
+
+    /* Main loop */
+    for (;len > 0; len--) {
+        hash  += get16bits (data);
+        tmp    = (get16bits (data+2) << 11) ^ hash;
+        hash   = (hash << 16) ^ tmp;
+        data  += 2*sizeof (uint16_t);
+        hash  += hash >> 11;
+    }
+
+    /* Handle end cases */
+    switch (rem) {
+        case 3: hash += get16bits (data);
+                hash ^= hash << 16;
+                hash ^= ((signed char)data[sizeof (uint16_t)]) << 18;
+                hash += hash >> 11;
+                break;
+        case 2: hash += get16bits (data);
+                hash ^= hash << 11;
+                hash += hash >> 17;
+                break;
+        case 1: hash += (signed char)*data;
+                hash ^= hash << 10;
+                hash += hash >> 1;
+    }
+
+    /* Force "avalanching" of final 127 bits */
+    hash ^= hash << 3;
+    hash += hash >> 5;
+    hash ^= hash << 4;
+    hash += hash >> 17;
+    hash ^= hash << 25;
+    hash += hash >> 6;
+
+    return hash;
+}

data/ext/stats/lock.c

@@ -0,0 +1,39 @@
+/* lock.c */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "stats/error.h"
+#include "stats/lock.h"
+
+int lock_create(const char * name, struct lock **lock_out)
+{
+    struct lock * lock;
+    int err;
+
+    if (lock_out == NULL)
+        return ERROR_INVALID_PARAMETERS;
+
+    lock = malloc(sizeof(struct lock));
+    if (!lock)
+        return ERROR_MEMORY;
+
+    err = lock_init(lock,name);
+    if (err == S_OK)
+    {
+        *lock_out = lock;
+    }
+    else
+    {
+        free(lock);
+        *lock_out = NULL;
+    }
+
+    return err;
+}
+
+
+void lock_free(struct lock *lock)
+{
+    free(lock);
+}

data/ext/stats/mt19937.c

@@ -0,0 +1,209 @@
+/*
+   A C-program for MT19937, with initialization improved 2002/1/26.
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   Before using, initialize the state by using init_genrand(seed)
+   or init_by_array(init_key, key_length).
+
+   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
+   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.
+
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
+        permission.
+
+   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.
+
+
+   Any feedback is very welcome.
+   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
+*/
+
+#include <stdio.h>
+#include "mt19937.h"
+
+/* Period parameters */
+#define N 624
+#define M 397
+#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
+#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
+#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
+
+static unsigned long mt[N]; /* the array for the state vector  */
+static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
+
+/* initializes mt[N] with a seed */
+void init_genrand(unsigned long s)
+{
+    mt[0]= s & 0xffffffffUL;
+    for (mti=1; mti<N; mti++) {
+        mt[mti] =
+            (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
+        /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
+        /* In the previous versions, MSBs of the seed affect   */
+        /* only MSBs of the array mt[].                        */
+        /* 2002/01/09 modified by Makoto Matsumoto             */
+        mt[mti] &= 0xffffffffUL;
+        /* for >32 bit machines */
+    }
+}
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+/* slight change for C++, 2004/2/26 */
+void init_by_array(unsigned long init_key[], int key_length)
+{
+    int i, j, k;
+    init_genrand(19650218UL);
+    i=1; j=0;
+    k = (N>key_length ? N : key_length);
+    for (; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+            + init_key[j] + j; /* non linear */
+        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+        i++; j++;
+        if (i>=N) { mt[0] = mt[N-1]; i=1; }
+        if (j>=key_length) j=0;
+    }
+    for (k=N-1; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
+          - i; /* non linear */
+        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+        i++;
+        if (i>=N) { mt[0] = mt[N-1]; i=1; }
+    }
+
+    mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
+}
+
+/* generates a random number on [0,0xffffffff]-interval */
+unsigned long genrand_int32(void)
+{
+    unsigned long y;
+    static unsigned long mag01[2]={0x0UL, MATRIX_A};
+    /* mag01[x] = x * MATRIX_A  for x=0,1 */
+
+    if (mti >= N) { /* generate N words at one time */
+        int kk;
+
+        if (mti == N+1)   /* if init_genrand() has not been called, */
+            init_genrand(5489UL); /* a default initial seed is used */
+
+        for (kk=0;kk<N-M;kk++) {
+            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+            mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
+        }
+        for (;kk<N-1;kk++) {
+            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+            mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
+        }
+        y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
+        mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
+
+        mti = 0;
+    }
+
+    y = mt[mti++];
+
+    /* Tempering */
+    y ^= (y >> 11);
+    y ^= (y << 7) & 0x9d2c5680UL;
+    y ^= (y << 15) & 0xefc60000UL;
+    y ^= (y >> 18);
+
+    return y;
+}
+
+/* generates a random number on [0,0x7fffffff]-interval */
+long genrand_int31(void)
+{
+    return (long)(genrand_int32()>>1);
+}
+
+/* generates a random number on [0,1]-real-interval */
+double genrand_real1(void)
+{
+    return genrand_int32()*(1.0/4294967295.0);
+    /* divided by 2^32-1 */
+}
+
+/* generates a random number on [0,1)-real-interval */
+double genrand_real2(void)
+{
+    return genrand_int32()*(1.0/4294967296.0);
+    /* divided by 2^32 */
+}
+
+/* generates a random number on (0,1)-real-interval */
+double genrand_real3(void)
+{
+    return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
+    /* divided by 2^32 */
+}
+
+/* generates a random number on [0,1) with 53-bit resolution*/
+double genrand_res53(void)
+{
+    unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
+    return(a*67108864.0+b)*(1.0/9007199254740992.0);
+}
+/* These real versions are due to Isaku Wada, 2002/01/09 added */
+
+
+void init_rng()
+{
+    unsigned long seeds[16];
+    FILE * fp;
+
+    fp = fopen("/dev/urandom", "r");
+    if (fp)
+    {
+        fread(seeds,sizeof(unsigned long),16,fp);
+        fclose(fp);
+    }
+
+    init_by_array(seeds,16);
+}
+
+#if 0
+int main(void)
+{
+    int i;
+    unsigned long init[4]={0x123, 0x234, 0x345, 0x456}, length=4;
+    init_by_array(init, length);
+    printf("1000 outputs of genrand_int32()\n");
+    for (i=0; i<1000; i++) {
+      printf("%10lu ", genrand_int32());
+      if (i%5==4) printf("\n");
+    }
+    printf("\n1000 outputs of genrand_real2()\n");
+    for (i=0; i<1000; i++) {
+      printf("%10.8f ", genrand_real2());
+      if (i%5==4) printf("\n");
+    }
+    return 0;
+}
+#endif

data/ext/stats/mt19937.h

@@ -0,0 +1,16 @@
+/* mt19937.h */
+
+#ifndef _MT19937_H_
+#define _MT19937_H_
+
+void init_rng();
+void init_genrand(unsigned long s);
+void init_by_array(unsigned long init_key[], int key_length);
+unsigned long genrand_int32(void);
+long genrand_int31(void);
+double genrand_real1(void);
+double genrand_real2(void);
+double genrand_real3(void);
+double genrand_res53(void);
+
+#endif