hirlite 0.0.1

data/vendor/rlite/src/type_zset.h

@@ -0,0 +1,50 @@
+#ifndef _RL_TYPE_ZSET_H
+#define _RL_TYPE_ZSET_H
+
+#include "page_skiplist.h"
+
+#define RL_TYPE_ZSET 'Z'
+
+#define RL_ZSET_AGGREGATE_SUM 0
+#define RL_ZSET_AGGREGATE_MIN 1
+#define RL_ZSET_AGGREGATE_MAX 2
+
+struct rlite;
+
+typedef struct {
+	double min;
+	int minex;
+	double max;
+	int maxex;
+} rl_zrangespec;
+
+typedef struct rl_skiplist_iterator rl_zset_iterator;
+
+int rl_zset_iterator_next(rl_zset_iterator *iterator, double *score, unsigned char **data, long *datalen);
+int rl_zset_iterator_destroy(rl_zset_iterator *iterator);
+
+int rl_zadd(struct rlite *db, const unsigned char *key, long keylen, double score, unsigned char *data, long datalen);
+int rl_zcard(struct rlite *db, const unsigned char *key, long keylen, long *card);
+int rl_zcount(struct rlite *db, const unsigned char *key, long keylen, rl_zrangespec *range, long *count);
+int rl_zincrby(struct rlite *db, const unsigned char *key, long keylen, double score, unsigned char *data, long datalen, double *newscore);
+int rl_zinterstore(struct rlite *db, long keys_size, unsigned char **keys, long *keys_len, double *weights, int aggregate);
+int rl_zlexcount(struct rlite *db, const unsigned char *key, long keylen, unsigned char *min, long minlen, unsigned char *max, long maxlen, long *lexcount);
+int rl_zrange(struct rlite *db, const unsigned char *key, long keylen, long start, long end, rl_zset_iterator **iterator);
+int rl_zrangebylex(struct rlite *db, const unsigned char *key, long keylen, unsigned char *min, long minlen, unsigned char *max, long maxlen, long offset, long count, rl_zset_iterator **iterator);
+int rl_zrangebyscore(struct rlite *db, const unsigned char *key, long keylen, rl_zrangespec *range, long offset, long count, rl_zset_iterator **iterator);
+int rl_zrank(struct rlite *db, const unsigned char *key, long keylen, unsigned char *data, long datalen, long *rank);
+int rl_zrevrange(struct rlite *db, const unsigned char *key, long keylen, long start, long end, rl_zset_iterator **iterator);
+int rl_zrevrangebylex(struct rlite *db, const unsigned char *key, long keylen, unsigned char *max, long maxlen, unsigned char *min, long minlen, long offset, long count, rl_zset_iterator **iterator);
+int rl_zrevrangebyscore(struct rlite *db, const unsigned char *key, long keylen, rl_zrangespec *range, long offset, long count, rl_zset_iterator **iterator);
+int rl_zrevrank(struct rlite *db, const unsigned char *key, long keylen, unsigned char *data, long datalen, long *revrank);
+int rl_zrem(struct rlite *db, const unsigned char *key, long keylen, long members_size, unsigned char **members, long *members_len, long *changed);
+int rl_zremrangebylex(struct rlite *db, const unsigned char *key, long keylen, unsigned char *min, long minlen, unsigned char *max, long maxlen, long *changed);
+int rl_zremrangebyrank(struct rlite *db, const unsigned char *key, long keylen, long start, long end, long *changed);
+int rl_zremrangebyscore(struct rlite *db, const unsigned char *key, long keylen, rl_zrangespec *range, long *changed);
+int rl_zscore(struct rlite *db, const unsigned char *key, long keylen, unsigned char *data, long datalen, double *score);
+int rl_zunionstore(struct rlite *db, long keys_size, unsigned char **keys, long *keys_len, double *weights, int aggregate);
+
+int rl_zset_pages(struct rlite *db, long page, short *pages);
+int rl_zset_delete(struct rlite *db, long value_page);
+
+#endif

data/vendor/rlite/src/util.c

@@ -0,0 +1,334 @@
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include <math.h>
+#include "../deps/sha1.h"
+#ifdef DEBUG
+#include <unistd.h>
+#include <sys/stat.h>
+#include <execinfo.h>
+#include <valgrind/valgrind.h>
+#endif
+#include "status.h"
+#include "util.h"
+#include <sys/time.h>
+
+int _sha1_formatter(unsigned char *data, char formatted[40])
+{
+	static const char *hex_lookup = "0123456789ABCDEF";
+	int i;
+	for (i = 0; i < 20; i++) {
+		formatted[i * 2] = hex_lookup[data[i] & 0x0F];
+		formatted[i * 2 + 1] = hex_lookup[(data[i] / 0x0F) & 0x0F];
+	}
+	return RL_OK;
+}
+
+#ifdef DEBUG
+
+int test_mode = 0;
+int failed = 0;
+
+int expect_fail()
+{
+	return failed;
+}
+
+void *rl_malloc(size_t size)
+{
+	if (test_mode == 0) {
+		return malloc(size);
+	}
+	unsigned char digest[20];
+	char hexdigest[41];
+	int j, nptrs;
+	void *r;
+#define SIZE 1000
+	void *buffer[SIZE];
+	char **strings;
+	nptrs = backtrace(buffer, SIZE);
+	strings = backtrace_symbols(buffer, nptrs);
+	if (strings == NULL) {
+		return NULL;
+	}
+
+	SHA1_CTX sha;
+	SHA1Init(&sha);
+	for (j = 0; j < nptrs; j++) {
+		SHA1Update(&sha, (unsigned char *)strings[j], strlen(strings[j]));
+	}
+	SHA1Final(digest, &sha);
+
+	_sha1_formatter(digest, hexdigest);
+
+	const char *dir = "malloc-debug";
+	char subdir[100];
+	mkdir(dir, 0777);
+	long i = strlen(dir);
+	memcpy(subdir, dir, strlen(dir));
+	subdir[i] = '/';
+	subdir[i + 1] = hexdigest[0];
+	subdir[i + 2] = hexdigest[1];
+	subdir[i + 3] = 0;
+	mkdir(subdir, 0777);
+	subdir[i + 3] = '/';
+
+	for (j = 0; j < 38; j++) {
+		subdir[i + 4 + j] = hexdigest[2 + j];
+	}
+	subdir[42] = 0;
+
+	if (access(subdir, F_OK) == 0) {
+		r = malloc(size);
+	}
+	else {
+		hexdigest[40] = 0;
+		fprintf(stderr, "Failing malloc on %s\n", hexdigest);
+
+		FILE *fp = fopen(subdir, "w");
+		for (j = 0; j < nptrs; j++) {
+			fwrite(strings[j], 1, strlen(strings[j]), fp);
+			fwrite("\n", 1, 1, fp);
+		}
+		fclose(fp);
+		failed = 1;
+		fprintf(stderr, "Simulating OOM\n");
+		r = NULL;
+	}
+	free(strings);
+	return r;
+}
+
+void rl_free(void *ptr)
+{
+	free(ptr);
+}
+#endif
+
+
+void put_4bytes(unsigned char *p, long v)
+{
+	p[0] = (unsigned char)(v >> 24);
+	p[1] = (unsigned char)(v >> 16);
+	p[2] = (unsigned char)(v >> 8);
+	p[3] = (unsigned char)v;
+}
+
+int get_4bytes(const unsigned char *p)
+{
+	return (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3];
+}
+
+unsigned long long get_8bytes(const unsigned char *p)
+{
+	unsigned long long retval = 0;
+	retval |= (unsigned long long)p[0] << 56;
+	retval |= (unsigned long long)p[1] << 48;
+	retval |= (unsigned long long)p[2] << 40;
+	retval |= (unsigned long long)p[3] << 32;
+	retval |= (unsigned long long)p[4] << 24;
+	retval |= (unsigned long long)p[5] << 16;
+	retval |= (unsigned long long)p[6] << 8;
+	retval |= (unsigned long long)p[7];
+	return retval;
+}
+
+void put_8bytes(unsigned char *p, unsigned long long v)
+{
+	p[0] = (unsigned char)(v >> 56);
+	p[1] = (unsigned char)(v >> 48);
+	p[2] = (unsigned char)(v >> 40);
+	p[3] = (unsigned char)(v >> 32);
+	p[4] = (unsigned char)(v >> 24);
+	p[5] = (unsigned char)(v >> 16);
+	p[6] = (unsigned char)(v >> 8);
+	p[7] = (unsigned char)v;
+}
+
+int long_cmp(void *v1, void *v2)
+{
+	long a = *((long *)v1), b = *((long *)v2);
+	if (a == b) {
+		return 0;
+	}
+	return a > b ? 1 : -1;
+}
+
+int sha1_cmp(void *v1, void *v2)
+{
+	return memcmp(v1, v2, sizeof(unsigned char) * 20);
+}
+
+#ifdef DEBUG
+int long_formatter(void *v2, char **formatted, int *size)
+{
+	*formatted = rl_malloc(sizeof(char) * 22);
+	if (*formatted == NULL) {
+		return RL_OUT_OF_MEMORY;
+	}
+	*size = snprintf(*formatted, 22, "%ld", *(long *)v2);
+	return RL_OK;
+}
+
+int sha1_formatter(void *v2, char **formatted, int *size)
+{
+	unsigned char *data = (unsigned char *)v2;
+	*formatted = rl_malloc(sizeof(char) * 40);
+	if (*formatted == NULL) {
+		return RL_OUT_OF_MEMORY;
+	}
+	_sha1_formatter(data, *formatted);
+	if (size) {
+		*size = 40;
+	}
+	return RL_OK;
+}
+
+#endif
+
+// Code for serialize/deserialize double comes from
+// http://beej.us/guide/bgnet/output/html/singlepage/bgnet.html#serialization
+
+#define pack754_32(f) (pack754((f), 32, 8))
+#define pack754_64(f) (pack754((f), 64, 11))
+#define unpack754_32(i) (unpack754((i), 32, 8))
+#define unpack754_64(i) (unpack754((i), 64, 11))
+
+unsigned long long pack754(long double f, unsigned bits, unsigned expbits)
+{
+	long double fnorm;
+	int shift;
+	long long sign, exp, significand;
+	unsigned significandbits = bits - expbits - 1; // -1 for sign bit
+
+	if (f == 0.0) {
+		return 0;    // get this special case out of the way
+	}
+
+	// This doesn't look very formal, but the values for +inf and -inf were
+	// calculated using the formula described in
+	// http://stackoverflow.com/a/3421923/551548
+	if ((double)f == (double) - INFINITY) {
+		return 140737360872672;
+	}
+
+	if ((double)f == (double)INFINITY) {
+		return 140737151196432;
+	}
+
+	// check sign and begin normalization
+	if (f < 0) {
+		sign = 1;
+		fnorm = -f;
+	}
+	else {
+		sign = 0;
+		fnorm = f;
+	}
+
+	// get the normalized form of f and track the exponent
+	shift = 0;
+	while(fnorm >= 2.0) {
+		fnorm /= 2.0;
+		shift++;
+	}
+	while(fnorm < 1.0) {
+		fnorm *= 2.0;
+		shift--;
+	}
+	fnorm = fnorm - 1.0;
+
+	// calculate the binary form (non-float) of the significand data
+	significand = fnorm * ((1LL << significandbits) + 0.5f);
+
+	// get the biased exponent
+	exp = shift + ((1 << (expbits - 1)) - 1); // shift + bias
+
+	// return the final answer
+	return (sign << (bits - 1)) | (exp << (bits - expbits - 1)) | significand;
+}
+
+long double unpack754(unsigned long long i, unsigned bits, unsigned expbits)
+{
+	long double result;
+	long long shift;
+	unsigned bias;
+	unsigned significandbits = bits - expbits - 1; // -1 for sign bit
+
+	if (i == 0) {
+		return 0.0;
+	}
+	if (i == 140737360872672) {
+		return -INFINITY;
+	}
+
+	if (i == 140737151196432) {
+		return INFINITY;
+	}
+
+	// pull the significand
+	result = (i & ((1LL << significandbits) - 1)); // mask
+	result /= (1LL << significandbits); // convert back to float
+	result += 1.0f; // add the one back on
+
+	// deal with the exponent
+	bias = (1 << (expbits - 1)) - 1;
+	shift = ((i >> significandbits) & ((1LL << expbits) - 1)) - bias;
+	while(shift > 0) {
+		result *= 2.0;
+		shift--;
+	}
+	while(shift < 0) {
+		result /= 2.0;
+		shift++;
+	}
+
+	// sign it
+	result *= (i >> (bits - 1)) & 1 ? -1.0 : 1.0;
+
+	return result;
+}
+
+double get_double(const unsigned char *p)
+{
+	unsigned long long ull = get_8bytes(p);
+	return unpack754_64(ull);
+}
+
+void put_double(unsigned char *p, double v)
+{
+	unsigned long long ull = pack754_64(v);
+	put_8bytes(p, ull);
+}
+
+int sha1(const unsigned char *data, long datalen, unsigned char digest[20])
+{
+	SHA1_CTX sha;
+	SHA1Init(&sha);
+	SHA1Update(&sha, data, datalen);
+	SHA1Final(digest, &sha);
+	return RL_OK;
+}
+
+unsigned long long rl_mstime()
+{
+	struct timeval tp;
+	gettimeofday(&tp, NULL);
+	return tp.tv_sec * 1000 + tp.tv_usec / 1000;
+}
+
+double rl_strtod(unsigned char *_str, long strlen, unsigned char **_eptr) {
+	double d;
+	char str[40];
+	char *eptr;
+	if (strlen > 39) {
+		strlen = 39;
+	}
+	memcpy(str, _str, strlen);
+	str[strlen] = 0;
+	d = strtod(str, &eptr);
+	if (_eptr) {
+		*_eptr = _str + (eptr - str);
+	}
+	return d;
+}

data/vendor/rlite/src/util.h

@@ -0,0 +1,71 @@
+#ifndef _RL_UTIL_H
+#define _RL_UTIL_H
+
+#include <float.h>
+#include <ctype.h>
+#include <string.h>
+#include <limits.h>
+#include "../deps/utilfromredis.h"
+
+// http://stackoverflow.com/questions/1701055/what-is-the-maximum-length-in-chars-needed-to-represent-any-double-value
+#define MAX_DOUBLE_DIGITS (3 + DBL_MANT_DIG - DBL_MIN_EXP)
+#define MAX_LLONG_DIGITS 22
+
+#ifdef DEBUG
+int expect_fail();
+extern int test_mode;
+void *rl_malloc(size_t size);
+void rl_free(void *ptr);
+#else
+#define rl_malloc malloc
+#define rl_free free
+#endif
+
+#define RL_MALLOC(obj, size)\
+	obj = rl_malloc(size);\
+	if (!obj) {\
+		retval = RL_OUT_OF_MEMORY;\
+		goto cleanup;\
+	}
+
+#define RL_REALLOC(ptr, size)\
+	tmp = realloc(ptr, size);\
+	if (!tmp) {\
+		retval = RL_OUT_OF_MEMORY;\
+		goto cleanup;\
+	}\
+	ptr = tmp;
+
+#define RL_CALL(func, expected, ...)\
+	retval = func(__VA_ARGS__);\
+	if (expected != retval) goto cleanup;
+
+#define RL_CALL2(func, expected, expected2, ...)\
+	retval = func(__VA_ARGS__);\
+	if (expected != retval && expected2 != retval) goto cleanup;
+
+#ifdef __GNUC__
+#  define UNUSED(x) UNUSED_ ## x __attribute__((__unused__))
+#else
+#  define UNUSED(x) UNUSED_ ## x
+#endif
+
+int get_4bytes(const unsigned char *p);
+void put_4bytes(unsigned char *p, long v);
+unsigned long long get_8bytes(const unsigned char *p);
+void put_8bytes(unsigned char *p, unsigned long long v);
+int long_cmp(void *v1, void *v2);
+int sha1_cmp(void *v1, void *v2);
+int double_cmp(void *v1, void *v2);
+#ifdef DEBUG
+int long_formatter(void *v2, char **formatted, int *size);
+int sha1_formatter(void *v2, char **formatted, int *size);
+int double_formatter(void *v2, char **formatted, int *size);
+#endif
+double get_double(const unsigned char *p);
+void put_double(unsigned char *p, double v);
+int sha1(const unsigned char *data, long datalen, unsigned char digest[20]);
+unsigned long long rl_mstime();
+double rl_strtod(unsigned char *str, long strlen, unsigned char **eptr);
+
+#endif

metadata

@@ -0,0 +1,151 @@
+--- !ruby/object:Gem::Specification
+name: hirlite
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Sebastian Waisbrot
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-02-28 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.7.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 0.7.1
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 5.5.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 5.5.1
+description: Ruby wrapper for hirlite
+email:
+- seppo0010@gmail.com
+executables: []
+extensions:
+- ext/hirlite_ext/extconf.rb
+extra_rdoc_files: []
+files:
+- LICENSE
+- Rakefile
+- ext/hirlite_ext/extconf.rb
+- ext/hirlite_ext/hirlite_ext.c
+- ext/hirlite_ext/hirlite_ext.h
+- ext/hirlite_ext/rlite.c
+- lib/hirlite.rb
+- lib/hirlite/rlite.rb
+- lib/hirlite/version.rb
+- vendor/rlite/Makefile
+- vendor/rlite/deps/crc64.c
+- vendor/rlite/deps/crc64.h
+- vendor/rlite/deps/endianconv.h
+- vendor/rlite/deps/hyperloglog.c
+- vendor/rlite/deps/hyperloglog.h
+- vendor/rlite/deps/lzf.h
+- vendor/rlite/deps/lzfP.h
+- vendor/rlite/deps/lzf_c.c
+- vendor/rlite/deps/lzf_d.c
+- vendor/rlite/deps/sha1.c
+- vendor/rlite/deps/sha1.h
+- vendor/rlite/deps/utilfromredis.c
+- vendor/rlite/deps/utilfromredis.h
+- vendor/rlite/src/Makefile
+- vendor/rlite/src/constants.h
+- vendor/rlite/src/dump.c
+- vendor/rlite/src/dump.h
+- vendor/rlite/src/hirlite.c
+- vendor/rlite/src/hirlite.h
+- vendor/rlite/src/page_btree.c
+- vendor/rlite/src/page_btree.h
+- vendor/rlite/src/page_key.c
+- vendor/rlite/src/page_key.h
+- vendor/rlite/src/page_list.c
+- vendor/rlite/src/page_list.h
+- vendor/rlite/src/page_long.c
+- vendor/rlite/src/page_long.h
+- vendor/rlite/src/page_multi_string.c
+- vendor/rlite/src/page_multi_string.h
+- vendor/rlite/src/page_skiplist.c
+- vendor/rlite/src/page_skiplist.h
+- vendor/rlite/src/page_string.c
+- vendor/rlite/src/page_string.h
+- vendor/rlite/src/pqsort.c
+- vendor/rlite/src/pqsort.h
+- vendor/rlite/src/restore.c
+- vendor/rlite/src/restore.h
+- vendor/rlite/src/rlite.c
+- vendor/rlite/src/rlite.h
+- vendor/rlite/src/sort.c
+- vendor/rlite/src/sort.h
+- vendor/rlite/src/status.h
+- vendor/rlite/src/type_hash.c
+- vendor/rlite/src/type_hash.h
+- vendor/rlite/src/type_list.c
+- vendor/rlite/src/type_list.h
+- vendor/rlite/src/type_set.c
+- vendor/rlite/src/type_set.h
+- vendor/rlite/src/type_string.c
+- vendor/rlite/src/type_string.h
+- vendor/rlite/src/type_zset.c
+- vendor/rlite/src/type_zset.h
+- vendor/rlite/src/util.c
+- vendor/rlite/src/util.h
+homepage: http://github.com/seppo0010/hirlite-rb
+licenses:
+- BSD-3-Clause
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.6
+signing_key: 
+specification_version: 4
+summary: Ruby wrapper for hirlite
+test_files: []