hirlite 0.0.1

data/vendor/rlite/src/page_skiplist.h

@@ -0,0 +1,70 @@
+#ifndef _RL_PAGE_SKIPLIST_H
+#define _RL_PAGE_SKIPLIST_H
+
+#include "rlite.h"
+
+#define RL_SKIPLIST_MAXLEVEL 32
+#define RL_SKIPLIST_PROBABILITY 0.25
+
+#define RL_SKIPLIST_BEFORE_SCORE 1
+#define RL_SKIPLIST_UPTO_SCORE 2
+#define RL_SKIPLIST_INCLUDE_SCORE 3
+#define RL_SKIPLIST_EXCLUDE_SCORE 4
+
+struct rlite;
+struct rl_data_type;
+typedef struct {
+	long value;
+	double score;
+	long left;
+	long num_levels;
+	struct rl_skiplist_node_level {
+		long right;
+		long span;
+	} level[];
+} rl_skiplist_node;
+
+typedef struct {
+	long left;
+	long right;
+	long size;
+	long level;
+} rl_skiplist;
+
+typedef struct rl_skiplist_iterator {
+	struct rlite *db;
+	rl_skiplist *skiplist;
+	long node_page;
+	int direction; // 1 for right, -1 for left
+	int position;
+	long size;
+} rl_skiplist_iterator;
+
+int rl_skiplist_create(struct rlite *db, rl_skiplist **skiplist);
+int rl_skiplist_destroy(struct rlite *db, void *skiplist);
+int rl_skiplist_node_create(struct rlite *db, rl_skiplist_node **_node, long level, double score, long value);
+int rl_skiplist_node_destroy(struct rlite *db, void *node);
+int rl_skiplist_iterator_create(struct rlite *db, rl_skiplist_iterator **iterator, rl_skiplist *skiplist, long node_page, int direction, int size);
+int rl_skiplist_iterator_destroy(struct rlite *db, rl_skiplist_iterator *iterator);
+int rl_skiplist_iterator_next(rl_skiplist_iterator *iterator, rl_skiplist_node **node);
+int rl_skiplist_add(struct rlite *db, rl_skiplist *skiplist, long skiplist_page, double score, unsigned char *value, long valuelen);
+int rl_skiplist_first_node(struct rlite *db, rl_skiplist *skiplist, double score, int range_mode, unsigned char *value, long valuelen, rl_skiplist_node **node, long *rank);
+int rl_skiplist_node_by_rank(struct rlite *db, rl_skiplist *skiplist, long rank, rl_skiplist_node **node, long *node_page);
+int rl_skiplist_delete(struct rlite *db, rl_skiplist *skiplist, long skiplist_page, double score, unsigned char *value, long valuelen);
+int rl_skiplist_delete_all(struct rlite *db, rl_skiplist *skiplist);
+
+int rl_skiplist_is_balanced(struct rlite *db, rl_skiplist *skiplist);
+#ifdef DEBUG
+int rl_skiplist_print(struct rlite *db, rl_skiplist *skiplist);
+#endif
+
+int rl_skiplist_serialize(struct rlite *db, void *obj, unsigned char *data);
+int rl_skiplist_deserialize(struct rlite *db, void **obj, void *context, unsigned char *data);
+
+int rl_skiplist_node_serialize(struct rlite *db, void *obj, unsigned char *data);
+int rl_skiplist_node_deserialize(struct rlite *db, void **obj, void *context, unsigned char *data);
+
+int rl_skiplist_pages(struct rlite *db, rl_skiplist *skiplist, short *pages);
+
+
+#endif

data/vendor/rlite/src/page_string.c

@@ -0,0 +1,55 @@
+#include <stdlib.h>
+#include <string.h>
+#include "rlite.h"
+#include "page_string.h"
+#include "util.h"
+
+int rl_string_serialize(rlite *db, void *obj, unsigned char *data)
+{
+	memcpy(data, obj, sizeof(char) * db->page_size);
+	return RL_OK;
+}
+
+int rl_string_deserialize(rlite *db, void **obj, void *UNUSED(context), unsigned char *data)
+{
+	int retval;
+	unsigned char *new_data;
+	RL_MALLOC(new_data, sizeof(char) * db->page_size);
+	memcpy(new_data, data, sizeof(char) * db->page_size);
+	*obj = new_data;
+	retval = RL_OK;
+cleanup:
+	return retval;
+}
+
+int rl_string_destroy(rlite *UNUSED(db), void *obj)
+{
+	rl_free(obj);
+	return RL_OK;
+}
+
+int rl_string_create(rlite *db, unsigned char **_data, long *number)
+{
+	unsigned char *data = calloc(db->page_size, sizeof(char));
+	if (!data) {
+		return RL_OUT_OF_MEMORY;
+	}
+	*number = db->next_empty_page;
+	int retval;
+	RL_CALL(rl_write, RL_OK, db, &rl_data_type_string, db->next_empty_page, data);
+	*_data = data;
+	retval = RL_OK;
+cleanup:
+	return retval;
+}
+
+int rl_string_get(rlite *db, unsigned char **_data, long number)
+{
+	void *data;
+	int retval;
+	RL_CALL(rl_read, RL_FOUND, db, &rl_data_type_string, number, NULL, &data, 1);
+	*_data = data;
+	retval = RL_OK;
+cleanup:
+	return retval;
+}

data/vendor/rlite/src/page_string.h

@@ -0,0 +1,12 @@
+#ifndef _RL_PAGE_STRING_H
+#define _RL_PAGE_STRING_H
+
+struct rlite;
+
+int rl_string_serialize(struct rlite *db, void *obj, unsigned char *data);
+int rl_string_deserialize(struct rlite *db, void **obj, void *context, unsigned char *data);
+int rl_string_destroy(struct rlite *db, void *obj);
+int rl_string_create(struct rlite *db, unsigned char **data, long *number);
+int rl_string_get(struct rlite *db, unsigned char **_data, long number);
+
+#endif

data/vendor/rlite/src/pqsort.c

@@ -0,0 +1,185 @@
+/* The following is the NetBSD libc qsort implementation modified in order to
+ * support partial sorting of ranges for Redis.
+ *
+ * Copyright(C) 2009-2012 Salvatore Sanfilippo. All rights reserved.
+ *
+ * The original copyright notice follows. */
+
+
+/*	$NetBSD: qsort.c,v 1.19 2009/01/30 23:38:44 lukem Exp $	*/
+
+/*-
+ * Copyright (c) 1992, 1993
+ *	The Regents of the University of California.  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. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
+ */
+
+#include <sys/types.h>
+
+#include <errno.h>
+#include <stdlib.h>
+
+static inline char	*med3 (char *, char *, char *,
+    int (*)(const void *, const void *));
+static inline void	 swapfunc (char *, char *, size_t, int);
+
+#define min(a, b)	(a) < (b) ? a : b
+
+/*
+ * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
+ */
+#define swapcode(TYPE, parmi, parmj, n) { 		\
+	size_t i = (n) / sizeof (TYPE); 		\
+	TYPE *pi = (TYPE *)(void *)(parmi); 		\
+	TYPE *pj = (TYPE *)(void *)(parmj); 		\
+	do { 						\
+		TYPE	t = *pi;			\
+		*pi++ = *pj;				\
+		*pj++ = t;				\
+        } while (--i > 0);				\
+}
+
+#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
+	es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
+
+static inline void
+swapfunc(char *a, char *b, size_t n, int swaptype)
+{
+
+	if (swaptype <= 1)
+		swapcode(long, a, b, n)
+	else
+		swapcode(char, a, b, n)
+}
+
+#define swap(a, b)						\
+	if (swaptype == 0) {					\
+		long t = *(long *)(void *)(a);			\
+		*(long *)(void *)(a) = *(long *)(void *)(b);	\
+		*(long *)(void *)(b) = t;			\
+	} else							\
+		swapfunc(a, b, es, swaptype)
+
+#define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype)
+
+static inline char *
+med3(char *a, char *b, char *c,
+    int (*cmp) (const void *, const void *))
+{
+
+	return cmp(a, b) < 0 ?
+	       (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a ))
+              :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c ));
+}
+
+static void
+_pqsort(void *a, size_t n, size_t es,
+    int (*cmp) (const void *, const void *), void *lrange, void *rrange)
+{
+	char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
+	size_t d, r;
+	int swaptype, cmp_result;
+
+loop:	SWAPINIT(a, es);
+	if (n < 7) {
+		for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
+			for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;
+			     pl -= es)
+				swap(pl, pl - es);
+		return;
+	}
+	pm = (char *) a + (n / 2) * es;
+	if (n > 7) {
+		pl = (char *) a;
+		pn = (char *) a + (n - 1) * es;
+		if (n > 40) {
+			d = (n / 8) * es;
+			pl = med3(pl, pl + d, pl + 2 * d, cmp);
+			pm = med3(pm - d, pm, pm + d, cmp);
+			pn = med3(pn - 2 * d, pn - d, pn, cmp);
+		}
+		pm = med3(pl, pm, pn, cmp);
+	}
+	swap(a, pm);
+	pa = pb = (char *) a + es;
+
+	pc = pd = (char *) a + (n - 1) * es;
+	for (;;) {
+		while (pb <= pc && (cmp_result = cmp(pb, a)) <= 0) {
+			if (cmp_result == 0) {
+				swap(pa, pb);
+				pa += es;
+			}
+			pb += es;
+		}
+		while (pb <= pc && (cmp_result = cmp(pc, a)) >= 0) {
+			if (cmp_result == 0) {
+				swap(pc, pd);
+				pd -= es;
+			}
+			pc -= es;
+		}
+		if (pb > pc)
+			break;
+		swap(pb, pc);
+		pb += es;
+		pc -= es;
+	}
+
+	pn = (char *) a + n * es;
+	r = min(pa - (char *) a, pb - pa);
+	vecswap(a, pb - r, r);
+	r = min((size_t)(pd - pc), pn - pd - es);
+	vecswap(pb, pn - r, r);
+	if ((r = pb - pa) > es) {
+                void *_l = a, *_r = ((unsigned char*)a)+r-1;
+                if (!((lrange < _l && rrange < _l) ||
+                    (lrange > _r && rrange > _r)))
+		    _pqsort(a, r / es, es, cmp, lrange, rrange);
+        }
+	if ((r = pd - pc) > es) {
+                void *_l, *_r;
+
+		/* Iterate rather than recurse to save stack space */
+		a = pn - r;
+		n = r / es;
+
+                _l = a;
+                _r = ((unsigned char*)a)+r-1;
+                if (!((lrange < _l && rrange < _l) ||
+                    (lrange > _r && rrange > _r)))
+		    goto loop;
+	}
+/*		qsort(pn - r, r / es, es, cmp);*/
+}
+
+void
+pqsort(void *a, size_t n, size_t es,
+    int (*cmp) (const void *, const void *), size_t lrange, size_t rrange)
+{
+    _pqsort(a,n,es,cmp,((unsigned char*)a)+(lrange*es),
+                       ((unsigned char*)a)+((rrange+1)*es)-1);
+}

data/vendor/rlite/src/pqsort.h

@@ -0,0 +1,40 @@
+/* The following is the NetBSD libc qsort implementation modified in order to
+ * support partial sorting of ranges for Redis.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * 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.
+ *   * Neither the name of Redis nor the names of its contributors may 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.
+ *
+ * See the pqsort.c file for the original copyright notice. */
+
+#ifndef __PQSORT_H
+#define __PQSORT_H
+
+void
+pqsort(void *a, size_t n, size_t es,
+    int (*cmp) (const void *, const void *), size_t lrange, size_t rrange);
+
+#endif