mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 23:04:20 +01:00
test the big ydb lock with multiple put threads. closes #7
git-svn-id: file:///svn/tokudb@1697 c7de825b-a66e-492c-adef-691d508d4ae1
This commit is contained in:
parent
eb7701b0f7
commit
ad246368df
2 changed files with 114 additions and 1 deletions
|
@ -24,8 +24,9 @@ else
|
|||
UNSETTOKUENV=
|
||||
LIBEXT=so
|
||||
ifdef BDBDIR
|
||||
BDB_LDFLAGS += -Wl,-rpath,$(BDBDIR)/lib -lpthread
|
||||
BDB_LDFLAGS += -Wl,-rpath,$(BDBDIR)/lib
|
||||
endif
|
||||
BDB_LDFLAGS += -lpthread
|
||||
TDB_LOADLIBES = -L../ -ldb -Wl,-rpath,.. -lpthread
|
||||
VGRIND=valgrind --quiet --error-exitcode=1 --leak-check=yes
|
||||
endif
|
||||
|
|
112
src/tests/test_db_thread_insert.c
Normal file
112
src/tests/test_db_thread_insert.c
Normal file
|
@ -0,0 +1,112 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <assert.h>
|
||||
#include <errno.h>
|
||||
#include <sys/stat.h>
|
||||
#include <arpa/inet.h>
|
||||
#include <db.h>
|
||||
#include <pthread.h>
|
||||
#include "test.h"
|
||||
|
||||
typedef unsigned int my_t;
|
||||
|
||||
struct db_inserter {
|
||||
pthread_t tid;
|
||||
DB *db;
|
||||
my_t startno, endno;
|
||||
};
|
||||
|
||||
int db_put(DB *db, my_t k, my_t v) {
|
||||
DBT key, val;
|
||||
int r = db->put(db, 0, dbt_init(&key, &k, sizeof k), dbt_init(&val, &v, sizeof v), DB_YESOVERWRITE);
|
||||
return r;
|
||||
}
|
||||
|
||||
void *do_inserts(void *arg) {
|
||||
struct db_inserter *mywork = (struct db_inserter *) arg;
|
||||
printf("%lu:do_inserts:start:%d-%d\n", pthread_self(), mywork->startno, mywork->endno);
|
||||
my_t i;
|
||||
for (i=mywork->startno; i < mywork->endno; i++) {
|
||||
int r = db_put(mywork->db, htonl(i), i); assert(r == 0);
|
||||
}
|
||||
|
||||
printf("%lu:do_inserts:end\n", pthread_self());
|
||||
pthread_exit(0);
|
||||
return 0;
|
||||
}
|
||||
|
||||
int usage() {
|
||||
fprintf(stderr, "test [-n NTUPLES] [-p NTHREADS]\n");
|
||||
fprintf(stderr, "default NTUPLES=1000000\n");
|
||||
fprintf(stderr, "default NTHREADS=2\n");
|
||||
return 1;
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[]) {
|
||||
const char *dbfile = "test.db";
|
||||
const char *dbname = "main";
|
||||
int nthreads = 2;
|
||||
my_t n = 1000000;
|
||||
|
||||
system("rm -rf " DIR);
|
||||
mkdir(DIR, 0777);
|
||||
|
||||
int i;
|
||||
for (i=1; i<argc; i++) {
|
||||
char *arg = argv[i];
|
||||
if (0 == strcmp(arg, "-h") || 0 == strcmp(arg, "--help")) {
|
||||
return usage();
|
||||
}
|
||||
if (0 == strcmp(arg, "-v") || 0 == strcmp(arg, "--verbose")) {
|
||||
verbose = 1;
|
||||
continue;
|
||||
}
|
||||
if (0 == strcmp(arg, "-p")) {
|
||||
if (i+1 >= argc) return usage();
|
||||
nthreads = atoi(argv[++i]);
|
||||
continue;
|
||||
}
|
||||
if (0 == strcmp(arg, "-n")) {
|
||||
if (i+1 >= argc) return usage();
|
||||
n = atoi(argv[++i]);
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
int r;
|
||||
DB_ENV *env;
|
||||
|
||||
r = db_env_create(&env, 0); assert(r == 0);
|
||||
r = env->set_cachesize(env, 0, 128000000, 1); assert(r == 0);
|
||||
r = env->open(env, DIR, DB_CREATE + DB_THREAD + DB_PRIVATE + DB_INIT_MPOOL + DB_INIT_LOCK, 0777); assert(r == 0);
|
||||
|
||||
DB *db;
|
||||
|
||||
r = db_create(&db, env, 0); assert(r == 0);
|
||||
r = db->open(db, 0, dbfile, dbname, DB_BTREE, DB_CREATE + DB_THREAD, 0777); assert(r == 0);
|
||||
|
||||
struct db_inserter work[nthreads];
|
||||
|
||||
for (i=0; i<nthreads; i++) {
|
||||
work[i].db = db;
|
||||
work[i].startno = i*n/nthreads;
|
||||
work[i].endno = work[i].startno + n/nthreads;
|
||||
if (i+1 == nthreads)
|
||||
work[i].endno = n;
|
||||
}
|
||||
|
||||
for (i=0; i<nthreads; i++) {
|
||||
r = pthread_create(&work[i].tid, 0, do_inserts, &work[i]); assert(r == 0);
|
||||
}
|
||||
|
||||
for (i=0; i<nthreads; i++) {
|
||||
void *ret;
|
||||
r = pthread_join(work[i].tid, &ret); assert(r == 0);
|
||||
}
|
||||
|
||||
r = db->close(db, 0); assert(r == 0);
|
||||
r = env->close(env, 0); assert(r == 0);
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Add table
Reference in a new issue