Skip to content

N
node-sqlite3
Commit fe984b91 by Konstantin Käfer
Options

cleanup repository

parent 17cf082b
Showing with 0 additions and 388 deletions
demo.js deleted 100644 → 0
var sqlite3 = require('./lib/sqlite3');
var db = new sqlite3.Database(':memory:');
db.prepare("CREATE TABLE foo (text bar)").run().finalize(function() {
db.prepare("INSERT INTO foo VALUES('bar baz boo')").run().finalize(function() {
db.prepare("SELECT * FROM foo").run(function(err, row) {
console.log(row);
}).run(function(err, row) {
console.log(row);
});
});
});
deps/mpool-2.1.0/ChangeLog.1 deleted 100644 → 0
2006-05-31 Gray Watson <>
* Version 2.1.0 released.
* Added MPOOL_ERROR_PNT_OVER to distinguish between pointer
overwrite and mpool structure overwrite.
2005-05-20 Gray Watson <>
* Version 2.0.0 released.
* First external publication of library.
Thu Mar 4 10:14:21 1999 Gray Watson <>
* Reworked the way the blocks were split up.
* Removed the round arguments. Not used.
Wed Mar 3 19:29:38 1999 Gray Watson <>
* Moved to random(). Fucking rand() was hiding a lot of problems
from me.
* Added some additional sanity checks in free().
* Added mpool_set_max_pages to the library.
Thu Feb 25 12:41:51 1999 Gray Watson <>
* Added log_function transaction callback.
Thu Feb 25 09:53:33 1999 Gray Watson <>
* Changed the default page size to 16 * getpagesize.
Wed Feb 24 17:52:52 1999 Gray Watson <>
* Major reworking of internals to simplify structures.
Fri Feb 19 12:52:55 1999 Gray Watson <>
* Made a number of changes to the internals which removed the
addr_to_block as a performance pig.
Tue Feb 16 21:11:23 1999 Gray Watson <>
* Added ability for free to look up in the free bit lists for
memory to use.
* Added mpool_clear. Good idea.
Thu Feb 11 02:53:45 1999 Gray Watson <>
* Finally a working version. Looks much better.
* Added rounding sizes so it will allocate aligned memory.
* Added minimum size to the mpool_free function to speed it up.
Wed Feb 10 23:30:48 1999 Gray Watson <>
* Version 1 with new fine grained memory resolution almost
working.
Fri May 2 02:26:28 1997 Gray Watson <>
* Moved to MAP_PRIVATE from MAP_SHARED.
* Fixed the min/max handling.
* Added additional info to mpool_stat.
Thu May 1 16:51:06 1997 Gray Watson <>
* Added page-size information request.
* Added better no-memory errors.
Thu Apr 24 01:58:41 1997 Gray Watson <>
* Added handling of null for debugging purposes.
Mon Apr 14 03:31:26 1997 Gray Watson <>
* Started the mpool routines.
deps/mpool-2.1.0/Makefile deleted 100644 → 0
#
# $Id: Makefile.all,v 1.1.1.1 2005/05/20 19:58:29 gray Exp $
#
HFLS = mpool.h
OBJS = mpool.o
CC = gcc
CFLAGS = -g -I. $(DEFINES) -fPIC
#CFLAGS = -g -I.
LDFLAGS =
RANLIB = ranlib
DESTDIR = /usr/local
TEST = mpool_t
LIBRARY = libmpool.a
all : $(LIBRARY) $(UTIL)
clean :
rm -f a.out core *.o *.t
rm -f $(LIBRARY) $(TEST)
install : $(HFLS) $(LIBRARY)
install -c -m 444 $(HFLS) $(DESTDIR)/include
install -c -m 444 $(LIBRARY) $(DESTDIR)/lib
$(RANLIB) $(DESTDIR)/libo/$(LIBRARY)
$(LIBRARY) : $(OBJS)
ar cr $(LIBRARY) $?
$(RANLIB) $@
tests : $(TEST)
$(TEST) : $(TEST).o $(LIBRARY)
rm -f $@
$(CC) $(LDFLAGS) $(TEST).o $(LIBRARY)
mv a.out $@
$(UTIL) : $(UTIL).o $(LIBRARY)
rm -f $@
$(CC) $(LDFLAGS) $(UTIL).o $(LIBRARY)
mv a.out $@
.c.o :
rm -f $@
$(CC) $(CFLAGS) -c $< -o $@
#
# Below are dependencies that are automatically generated by make
# depend. Please do not edit by hand.
#
mpool.o: mpool.c mpool.h mpool_loc.h
mpool_t.o: mpool_t.c mpool.h
deps/mpool-2.1.0/NEWS deleted 100644 → 0
-------------------------------------------------------------------------------
$Id: NEWS,v 1.2 2006/05/31 20:28:31 gray Exp $
-------------------------------------------------------------------------------
Version 2.1.0:
* Added MPOOL_ERROR_PNT_OVER to show pointer overwrites.
Version 2.0.0:
* Initial external release of library after use since 1996.
deps/mpool-2.1.0/README deleted 100644 → 0
-------------------------------------------------------------------------------
$Id: README,v 1.2 2005/05/22 19:49:30 gray Exp $
-------------------------------------------------------------------------------
BACKGROUND:
This is a memory pool library which was written to allow a program to
have heaps that it could destroy without fragmenting memory. You can
have multiple heaps and reset them easily completely reclaiming the
memory (as opposed to standard heaps).
With it you can mpool_open() a new heap, then mpool_alloc(),
mpool_calloc(), mpool_realloc(), mpool_free() to your heart's content.
Once you are done with the memory-pool you can run mpool_clear() or
mpool_close() and completely remove the memory associated with the
pools. This is very handy if you are working with some large blocks
of memory and want to reset back to a clean state.
Check out the mpool.h file for more information. Sorry for minimal
docs.
-------------------------------------------------------------------------------
INSTALLATION:
1) Typing 'make' should be enough to build libskip.a.
2) Typing 'make tests' should make the mpool_t test program.
-------------------------------------------------------------------------------
REPOSITORY:
The newest versions of the library are available from:
http://256.com/sources/mpool/
-------------------------------------------------------------------------------
AUTHOR:
If you have any questions or problems feel free to send me mail.
Gray Watson
http://256.com/gray/
-------------------------------------------------------------------------------
deps/mpool-2.1.0/mpool_loc.h deleted 100644 → 0
/*
* Memory pool local defines.
*
* Copyright 1996 by Gray Watson.
*
* This file is part of the mpool package.
*
* Permission to use, copy, modify, and distribute this software for
* any purpose and without fee is hereby granted, provided that the
* above copyright notice and this permission notice appear in all
* copies, and that the name of Gray Watson not be used in advertising
* or publicity pertaining to distribution of the document or software
* without specific, written prior permission.
*
* Gray Watson makes no representations about the suitability of the
* software described herein for any purpose. It is provided "as is"
* without express or implied warranty.
*
* The author may be reached via http://256.com/gray/
*
* $Id: mpool_loc.h,v 1.2 2005/05/20 20:08:54 gray Exp $
*/
#ifndef __MPOOL_LOC_H__
#define __MPOOL_LOC_H__
#define MPOOL_MAGIC 0xABACABA /* magic for struct */
#define BLOCK_MAGIC 0xB1B1007 /* magic for blocks */
#define FENCE_MAGIC0 (unsigned char)(0xFAU) /* 1st magic mem byte */
#define FENCE_MAGIC1 (unsigned char)(0xD3U) /* 2nd magic mem byte */
#define FENCE_SIZE 2 /* fence space */
#define MIN_ALLOCATION (sizeof(mpool_free_t)) /* min alloc */
#define MAX_FREE_SEARCH 10240 /* max size to search */
#define MAX_FREE_LIST_SEARCH 100 /* max looking for free mem */
/*
* bitflag tools for Variable and a Flag
*/
#define BIT_FLAG(x) (1 << (x))
#define BIT_SET(v,f) (v) |= (f)
#define BIT_CLEAR(v,f) (v) &= ~(f)
#define BIT_IS_SET(v,f) ((v) & (f))
#define BIT_TOGGLE(v,f) (v) ^= (f)
#define SET_POINTER(pnt, val) \
do { \
if ((pnt) != NULL) { \
(*(pnt)) = (val); \
} \
} while(0)
#define BLOCK_FLAG_USED BIT_FLAG(0) /* block is used */
#define BLOCK_FLAG_FREE BIT_FLAG(1) /* block is free */
#define DEFAULT_PAGE_MULT 16 /* pagesize = this * getpagesize*/
/* How many pages SIZE bytes resides in. We add in the block header. */
#define PAGES_IN_SIZE(mp_p, size) (((size) + sizeof(mpool_block_t) + \
(mp_p)->mp_page_size - 1) / \
(mp_p)->mp_page_size)
#define SIZE_OF_PAGES(mp_p, page_n) ((page_n) * (mp_p)->mp_page_size)
#define MAX_BITS 30 /* we only can allocate 1gb chunks */
#define MAX_BLOCK_USER_MEMORY(mp_p) ((mp_p)->mp_page_size - \
sizeof(mpool_block_t))
#define FIRST_ADDR_IN_BLOCK(block_p) (void *)((char *)(block_p) + \
sizeof(mpool_block_t))
#define MEMORY_IN_BLOCK(block_p) ((char *)(block_p)->mb_bounds_p - \
((char *)(block_p) + \
sizeof(mpool_block_t)))
typedef struct {
unsigned int mp_magic; /* magic number for struct */
unsigned int mp_flags; /* flags for the struct */
unsigned long mp_alloc_c; /* number of allocations */
unsigned long mp_user_alloc; /* user bytes allocated */
unsigned long mp_max_alloc; /* maximum user bytes allocated */
unsigned int mp_page_c; /* number of pages allocated */
unsigned int mp_max_pages; /* maximum number of pages to use */
unsigned int mp_page_size; /* page-size of our system */
int mp_fd; /* fd for /dev/zero if mmap-ing */
off_t mp_top; /* top of our allocations in fd */
mpool_log_func_t mp_log_func; /* log callback function */
void *mp_addr; /* current address for mmaping */
void *mp_min_p; /* min address in pool for checks */
void *mp_bounds_p; /* max address in pool for checks */
struct mpool_block_st *mp_first_p; /* first memory block we are using */
struct mpool_block_st *mp_last_p; /* last memory block we are using */
struct mpool_block_st *mp_free[MAX_BITS + 1]; /* free lists based on size */
unsigned int mp_magic2; /* upper magic for overwrite sanity */
} mpool_t;
/* for debuggers to be able to interrogate the generic type in the .h file */
typedef mpool_t mpool_ext_t;
/*
* Block header structure. This structure *MUST* be long-word
* aligned.
*/
typedef struct mpool_block_st {
unsigned int mb_magic; /* magic number for block header */
void *mb_bounds_p; /* block boundary location */
struct mpool_block_st *mb_next_p; /* linked list next pointer */
unsigned int mb_magic2; /* upper magic for overwrite sanity */
} mpool_block_t;
/*
* Free list structure.
*/
typedef struct {
void *mf_next_p; /* pointer to the next free address */
unsigned long mf_size; /* size of the free block */
} mpool_free_t;
#endif /* ! __MPOOL_LOC_H__ */
deps/sqlite/sqlite3.c deleted 100644 → 0
This source diff could not be displayed because it is too large. You can view the blob instead.
deps/sqlite/sqlite3.h deleted 100644 → 0
This source diff could not be displayed because it is too large. You can view the blob instead.
src/deferred_call.h deleted 100644 → 0
#ifndef NODE_SQLITE3_SRC_DEFERRED_CALL_H
#define NODE_SQLITE3_SRC_DEFERRED_CALL_H
#include <v8.h>
using namespace v8;
namespace Deferred {
enum Mode {
Concurrent,
Exclusive
};
template <typename T> class Call {
public:
Persistent<Function> callback_;
Persistent<Object> receiver_;
enum Mode mode_;
T data_;
int argc_;
Persistent<Value>* argv_;
public:
Call(const Arguments& args, const T data, Mode mode = Concurrent) {
callback_ = Persistent<Function>::New(args.Callee());
receiver_ = Persistent<Object>::New(args.This());
mode_ = mode;
data_ = data;
argc_ = args.Length();
argv_ = new Persistent<Value>[argc_];
for (int i = 0; i < argc_; i++) {
argv_[i] = Persistent<Value>::New(args[i]);
}
}
~Call() {
for (int i = 0; i < argc_; i++) {
argv_[i].Dispose();
}
delete[] argv_;
callback_.Dispose();
receiver_.Dispose();
}
inline Mode Mode() {
return mode_;
}
inline const T Data() {
return data_;
}
inline Local<Value> Invoke() {
return callback_->Call(receiver_, argc_, argv_);
}
};
}
#endif
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment