mirror of
https://github.com/MariaDB/server.git
synced 2025-01-23 07:14:17 +01:00
460 lines
17 KiB
C
460 lines
17 KiB
C
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
|
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
|
#ident "$Id$"
|
|
/*
|
|
COPYING CONDITIONS NOTICE:
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of version 2 of the GNU General Public License as
|
|
published by the Free Software Foundation, and provided that the
|
|
following conditions are met:
|
|
|
|
* Redistributions of source code must retain this COPYING
|
|
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
|
|
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
|
|
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
|
|
GRANT (below).
|
|
|
|
* Redistributions in binary form must reproduce this COPYING
|
|
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
|
|
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
|
|
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
|
|
GRANT (below) in the documentation and/or other materials
|
|
provided with the distribution.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301, USA.
|
|
|
|
COPYRIGHT NOTICE:
|
|
|
|
TokuDB, Tokutek Fractal Tree Indexing Library.
|
|
Copyright (C) 2007-2013 Tokutek, Inc.
|
|
|
|
DISCLAIMER:
|
|
|
|
This program is distributed in the hope that it will be useful, but
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
General Public License for more details.
|
|
|
|
UNIVERSITY PATENT NOTICE:
|
|
|
|
The technology is licensed by the Massachusetts Institute of
|
|
Technology, Rutgers State University of New Jersey, and the Research
|
|
Foundation of State University of New York at Stony Brook under
|
|
United States of America Serial No. 11/760379 and to the patents
|
|
and/or patent applications resulting from it.
|
|
|
|
PATENT MARKING NOTICE:
|
|
|
|
This software is covered by US Patent No. 8,185,551.
|
|
|
|
PATENT RIGHTS GRANT:
|
|
|
|
"THIS IMPLEMENTATION" means the copyrightable works distributed by
|
|
Tokutek as part of the Fractal Tree project.
|
|
|
|
"PATENT CLAIMS" means the claims of patents that are owned or
|
|
licensable by Tokutek, both currently or in the future; and that in
|
|
the absence of this license would be infringed by THIS
|
|
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
|
|
|
|
"PATENT CHALLENGE" shall mean a challenge to the validity,
|
|
patentability, enforceability and/or non-infringement of any of the
|
|
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
|
|
|
|
Tokutek hereby grants to you, for the term and geographical scope of
|
|
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
|
|
irrevocable (except as stated in this section) patent license to
|
|
make, have made, use, offer to sell, sell, import, transfer, and
|
|
otherwise run, modify, and propagate the contents of THIS
|
|
IMPLEMENTATION, where such license applies only to the PATENT
|
|
CLAIMS. This grant does not include claims that would be infringed
|
|
only as a consequence of further modifications of THIS
|
|
IMPLEMENTATION. If you or your agent or licensee institute or order
|
|
or agree to the institution of patent litigation against any entity
|
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
|
THIS IMPLEMENTATION constitutes direct or contributory patent
|
|
infringement, or inducement of patent infringement, then any rights
|
|
granted to you under this License shall terminate as of the date
|
|
such litigation is filed. If you or your agent or exclusive
|
|
licensee institute or order or agree to the institution of a PATENT
|
|
CHALLENGE, then Tokutek may terminate any rights granted to you
|
|
under this License.
|
|
*/
|
|
|
|
#ident "Copyright (c) 2007-2013 Tokutek Inc. All rights reserved."
|
|
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
|
|
|
|
/* Scan the bench.tokudb/bench.db over and over. */
|
|
#define DONT_DEPRECATE_MALLOC
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include <stdint.h>
|
|
#include <inttypes.h>
|
|
#ifdef BDB
|
|
#include <db.h>
|
|
#define DIRSUF bdb
|
|
#else
|
|
#include <tokudb.h>
|
|
#define DIRSUF tokudb
|
|
#endif
|
|
#include <assert.h>
|
|
#include <errno.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <sys/stat.h>
|
|
#include <fcntl.h>
|
|
#include <sys/time.h>
|
|
|
|
static const char *pname;
|
|
static enum run_mode { RUN_HWC, RUN_LWC, RUN_VERIFY, RUN_RANGE} run_mode = RUN_HWC;
|
|
static int do_txns=1, prelock=0, prelockflag=0;
|
|
static u_int32_t lock_flag = 0;
|
|
static long limitcount=-1;
|
|
static u_int32_t cachesize = 127*1024*1024;
|
|
static u_int64_t start_range = 0, end_range = 0;
|
|
static int n_experiments = 2;
|
|
static int bulk_fetch = 1;
|
|
|
|
static int print_usage (const char *argv0) {
|
|
fprintf(stderr, "Usage:\n%s [--verify-lwc | --lwc | --nohwc] [--prelock] [--prelockflag] [--prelockwriteflag] [--env DIR]\n", argv0);
|
|
fprintf(stderr, " --verify-lwc means to run the light weight cursor and the heavyweight cursor to verify that they get the same answer.\n");
|
|
fprintf(stderr, " --lwc run light weight cursors instead of heavy weight cursors\n");
|
|
fprintf(stderr, " --prelock acquire a read lock on the entire table before running\n");
|
|
fprintf(stderr, " --prelockflag pass DB_PRELOCKED to the the cursor get operation whenever the locks have been acquired\n");
|
|
fprintf(stderr, " --prelockwriteflag pass DB_PRELOCKED_WRITE to the cursor get operation\n");
|
|
fprintf(stderr, " --nox no transactions (no locking)\n");
|
|
fprintf(stderr, " --count COUNT read the first COUNT rows and then stop.\n");
|
|
fprintf(stderr, " --cachesize N set the env cachesize to N bytes\n");
|
|
fprintf(stderr, " --srandom N srandom(N)\n");
|
|
fprintf(stderr, " --env DIR put db files in DIR instead of default\n");
|
|
fprintf(stderr, " --bulk_fetch 0|1 do bulk fetch on lwc operations (default: 1)\n");
|
|
return 1;
|
|
}
|
|
|
|
static DB_ENV *env;
|
|
static DB *db;
|
|
static DB_TXN *tid=0;
|
|
|
|
#define STRINGIFY2(s) #s
|
|
#define STRINGIFY(s) STRINGIFY2(s)
|
|
static const char *dbdir = "./bench." STRINGIFY(DIRSUF); /* DIRSUF is passed in as a -D argument to the compiler. */
|
|
static int env_open_flags_yesx = DB_CREATE|DB_PRIVATE|DB_INIT_MPOOL|DB_INIT_TXN|DB_INIT_LOG|DB_INIT_LOCK;
|
|
static int env_open_flags_nox = DB_CREATE|DB_PRIVATE|DB_INIT_MPOOL;
|
|
static char *dbfilename = "bench.db";
|
|
|
|
|
|
static void parse_args (int argc, const char *argv[]) {
|
|
pname=argv[0];
|
|
argc--; argv++;
|
|
int specified_run_mode=0;
|
|
while (argc>0) {
|
|
if (strcmp(*argv,"--verify-lwc")==0) {
|
|
if (specified_run_mode && run_mode!=RUN_VERIFY) { two_modes: fprintf(stderr, "You specified two run modes\n"); exit(1); }
|
|
run_mode = RUN_VERIFY;
|
|
} else if (strcmp(*argv, "--lwc")==0) {
|
|
if (specified_run_mode && run_mode!=RUN_LWC) goto two_modes;
|
|
run_mode = RUN_LWC;
|
|
} else if (strcmp(*argv, "--hwc")==0) {
|
|
if (specified_run_mode && run_mode!=RUN_VERIFY) goto two_modes;
|
|
run_mode = RUN_HWC;
|
|
} else if (strcmp(*argv, "--prelock")==0) prelock=1;
|
|
#ifdef TOKUDB
|
|
else if (strcmp(*argv, "--prelockflag")==0) { prelockflag=1; lock_flag = DB_PRELOCKED; }
|
|
else if (strcmp(*argv, "--prelockwriteflag")==0) { prelockflag=1; lock_flag = DB_PRELOCKED_WRITE; }
|
|
#endif
|
|
else if (strcmp(*argv, "--nox")==0) { do_txns=0; }
|
|
else if (strcmp(*argv, "--count")==0) {
|
|
char *end;
|
|
argc--; argv++;
|
|
errno=0; limitcount=strtol(*argv, &end, 10); assert(errno==0);
|
|
printf("Limiting count to %ld\n", limitcount);
|
|
} else if (strcmp(*argv, "--cachesize")==0 && argc>0) {
|
|
char *end;
|
|
argc--; argv++;
|
|
cachesize=(u_int32_t)strtol(*argv, &end, 10);
|
|
} else if (strcmp(*argv, "--env") == 0) {
|
|
argc--; argv++;
|
|
if (argc==0) exit(print_usage(pname));
|
|
dbdir = *argv;
|
|
} else if (strcmp(*argv, "--range") == 0 && argc > 2) {
|
|
run_mode = RUN_RANGE;
|
|
argc--; argv++;
|
|
start_range = strtoll(*argv, NULL, 10);
|
|
argc--; argv++;
|
|
end_range = strtoll(*argv, NULL, 10);
|
|
} else if (strcmp(*argv, "--experiments") == 0 && argc > 1) {
|
|
argc--; argv++;
|
|
n_experiments = strtol(*argv, NULL, 10);
|
|
} else if (strcmp(*argv, "--srandom") == 0 && argc > 1) {
|
|
argc--; argv++;
|
|
srandom(atoi(*argv));
|
|
} else if (strcmp(*argv, "--bulk_fetch") == 0 && argc > 1) {
|
|
argc--; argv++;
|
|
bulk_fetch = atoi(*argv);
|
|
} else {
|
|
exit(print_usage(pname));
|
|
}
|
|
argc--; argv++;
|
|
}
|
|
//Prelocking is meaningless without transactions
|
|
if (do_txns==0) {
|
|
prelockflag=0;
|
|
lock_flag=0;
|
|
prelock=0;
|
|
}
|
|
}
|
|
|
|
static void scanscan_setup (void) {
|
|
int r;
|
|
r = db_env_create(&env, 0); assert(r==0);
|
|
r = env->set_cachesize(env, 0, cachesize, 1); assert(r==0);
|
|
r = env->open(env, dbdir, do_txns? env_open_flags_yesx : env_open_flags_nox, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH); assert(r==0);
|
|
r = db_create(&db, env, 0); assert(r==0);
|
|
if (do_txns) {
|
|
r = env->txn_begin(env, 0, &tid, 0); assert(r==0);
|
|
}
|
|
r = db->open(db, tid, dbfilename, NULL, DB_BTREE, 0, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH); assert(r==0);
|
|
#ifdef TOKUDB
|
|
if (prelock) {
|
|
r = db->pre_acquire_table_lock(db, tid);
|
|
assert(r==0);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
static void scanscan_shutdown (void) {
|
|
int r;
|
|
r = db->close(db, 0); assert(r==0);
|
|
if (do_txns) {
|
|
r = tid->commit(tid, 0); assert(r==0);
|
|
}
|
|
r = env->close(env, 0); assert(r==0);
|
|
}
|
|
|
|
static double gettime (void) {
|
|
struct timeval tv;
|
|
int r = gettimeofday(&tv, 0);
|
|
assert(r==0);
|
|
return tv.tv_sec + 1e-6*tv.tv_usec;
|
|
}
|
|
|
|
static void scanscan_hwc (void) {
|
|
int r;
|
|
int counter=0;
|
|
for (counter=0; counter<n_experiments; counter++) {
|
|
long long totalbytes=0;
|
|
int rowcounter=0;
|
|
double prevtime = gettime();
|
|
DBT k,v;
|
|
DBC *dbc;
|
|
r = db->cursor(db, tid, &dbc, 0); assert(r==0);
|
|
memset(&k, 0, sizeof(k));
|
|
memset(&v, 0, sizeof(v));
|
|
u_int32_t c_get_flags = DB_NEXT;
|
|
if (prelockflag && (counter || prelock)) {
|
|
c_get_flags |= lock_flag;
|
|
}
|
|
while (0 == (r = dbc->c_get(dbc, &k, &v, c_get_flags))) {
|
|
|
|
//printf("r=%d\n", r);
|
|
|
|
totalbytes += k.size + v.size;
|
|
rowcounter++;
|
|
if (limitcount>0 && rowcounter>=limitcount) break;
|
|
}
|
|
assert(r==DB_NOTFOUND);
|
|
r = dbc->c_close(dbc); assert(r==0);
|
|
double thistime = gettime();
|
|
double tdiff = thistime-prevtime;
|
|
printf("Scan %lld bytes (%d rows) in %9.6fs at %9fMB/s\n", totalbytes, rowcounter, tdiff, 1e-6*totalbytes/tdiff);
|
|
}
|
|
}
|
|
|
|
#ifdef TOKUDB
|
|
|
|
struct extra_count {
|
|
long long totalbytes;
|
|
int rowcounter;
|
|
};
|
|
|
|
static int counttotalbytes (DBT const *key, DBT const *data, void *extrav) {
|
|
struct extra_count *e=extrav;
|
|
e->totalbytes += key->size + data->size;
|
|
e->rowcounter++;
|
|
return bulk_fetch ? TOKUDB_CURSOR_CONTINUE : 0;
|
|
}
|
|
|
|
static void scanscan_lwc (void) {
|
|
int r;
|
|
int counter=0;
|
|
for (counter=0; counter<n_experiments; counter++) {
|
|
struct extra_count e = {0,0};
|
|
double prevtime = gettime();
|
|
DBC *dbc;
|
|
r = db->cursor(db, tid, &dbc, 0); assert(r==0);
|
|
u_int32_t f_flags = 0;
|
|
if (prelockflag && (counter || prelock)) {
|
|
f_flags |= lock_flag;
|
|
}
|
|
long rowcounter=0;
|
|
while (0 == (r = dbc->c_getf_next(dbc, f_flags, counttotalbytes, &e))) {
|
|
rowcounter++;
|
|
if (limitcount>0 && rowcounter>=limitcount) break;
|
|
}
|
|
r = dbc->c_close(dbc); assert(r==0);
|
|
double thistime = gettime();
|
|
double tdiff = thistime-prevtime;
|
|
printf("LWC Scan %lld bytes (%d rows) in %9.6fs at %9fMB/s\n", e.totalbytes, e.rowcounter, tdiff, 1e-6*e.totalbytes/tdiff);
|
|
}
|
|
}
|
|
#endif
|
|
|
|
static void scanscan_range (void) {
|
|
int r;
|
|
|
|
double texperiments[n_experiments];
|
|
u_int64_t k = 0;
|
|
char kv[8];
|
|
DBT key, val;
|
|
|
|
int counter;
|
|
for (counter = 0; counter < n_experiments; counter++) {
|
|
|
|
if (1) { //if ((counter&1) == 0) {
|
|
makekey:
|
|
// generate a random key in the key range
|
|
k = (start_range + (random() % (end_range - start_range))) * (1<<6);
|
|
int i;
|
|
for (i = 0; i < 8; i++)
|
|
kv[i] = k >> (56-8*i);
|
|
}
|
|
memset(&key, 0, sizeof key); key.data = &kv, key.size = sizeof kv;
|
|
memset(&val, 0, sizeof val);
|
|
|
|
double tstart = gettime();
|
|
|
|
DBC *dbc;
|
|
r = db->cursor(db, tid, &dbc, 0); assert(r==0);
|
|
|
|
// set the cursor to the random key
|
|
r = dbc->c_get(dbc, &key, &val, DB_SET_RANGE+lock_flag);
|
|
if (r != 0) {
|
|
assert(r == DB_NOTFOUND);
|
|
printf("%s:%d %" PRIu64 "\n", __FUNCTION__, __LINE__, k);
|
|
goto makekey;
|
|
}
|
|
|
|
#ifdef TOKUDB
|
|
// do the range scan
|
|
long rowcounter = 0;
|
|
struct extra_count e = {0,0};
|
|
while (limitcount > 0 && rowcounter < limitcount) {
|
|
r = dbc->c_getf_next(dbc, prelockflag ? lock_flag : 0, counttotalbytes, &e);
|
|
if (r != 0)
|
|
break;
|
|
rowcounter++;
|
|
}
|
|
#endif
|
|
|
|
r = dbc->c_close(dbc);
|
|
assert(r==0);
|
|
|
|
texperiments[counter] = gettime() - tstart;
|
|
printf("%" PRIu64 " %f\n", k, texperiments[counter]); fflush(stdout);
|
|
}
|
|
|
|
// print the times
|
|
double tsum = 0.0, tmin = 0.0, tmax = 0.0;
|
|
for (counter = 0; counter < n_experiments; counter++) {
|
|
if (counter==0 || texperiments[counter] < tmin)
|
|
tmin = texperiments[counter];
|
|
if (counter==0 || texperiments[counter] > tmax)
|
|
tmax = texperiments[counter];
|
|
tsum += texperiments[counter];
|
|
}
|
|
printf("%f %f %f/%d = %f\n", tmin, tmax, tsum, n_experiments, tsum / n_experiments);
|
|
}
|
|
|
|
#ifdef TOKUDB
|
|
|
|
struct extra_verify {
|
|
long long totalbytes;
|
|
int rowcounter;
|
|
DBT k,v; // the k and v are gotten using the old cursor
|
|
};
|
|
|
|
static int
|
|
checkbytes (DBT const *key, DBT const *data, void *extrav) {
|
|
struct extra_verify *e=extrav;
|
|
e->totalbytes += key->size + data->size;
|
|
e->rowcounter++;
|
|
assert(e->k.size == key->size);
|
|
assert(e->v.size == data->size);
|
|
assert(memcmp(e->k.data, key->data, key->size)==0);
|
|
assert(memcmp(e->v.data, data->data, data->size)==0);
|
|
assert(e->k.data != key->data);
|
|
assert(e->v.data != data->data);
|
|
return 0;
|
|
}
|
|
|
|
|
|
static void scanscan_verify (void) {
|
|
int r;
|
|
int counter=0;
|
|
for (counter=0; counter<n_experiments; counter++) {
|
|
struct extra_verify v;
|
|
v.totalbytes=0;
|
|
v.rowcounter=0;
|
|
double prevtime = gettime();
|
|
DBC *dbc1, *dbc2;
|
|
r = db->cursor(db, tid, &dbc1, 0); assert(r==0);
|
|
r = db->cursor(db, tid, &dbc2, 0); assert(r==0);
|
|
memset(&v.k, 0, sizeof(v.k));
|
|
memset(&v.v, 0, sizeof(v.v));
|
|
u_int32_t f_flags = 0;
|
|
u_int32_t c_get_flags = DB_NEXT;
|
|
if (prelockflag && (counter || prelock)) {
|
|
f_flags |= lock_flag;
|
|
c_get_flags |= lock_flag;
|
|
}
|
|
while (1) {
|
|
int r1,r2;
|
|
r2 = dbc1->c_get(dbc1, &v.k, &v.v, c_get_flags);
|
|
r1 = dbc2->c_getf_next(dbc2, f_flags, checkbytes, &v);
|
|
assert(r1==r2);
|
|
if (r1) break;
|
|
}
|
|
r = dbc1->c_close(dbc1); assert(r==0);
|
|
r = dbc2->c_close(dbc2); assert(r==0);
|
|
double thistime = gettime();
|
|
double tdiff = thistime-prevtime;
|
|
printf("verify %lld bytes (%d rows) in %9.6fs at %9fMB/s\n", v.totalbytes, v.rowcounter, tdiff, 1e-6*v.totalbytes/tdiff);
|
|
}
|
|
}
|
|
|
|
#endif
|
|
|
|
int main (int argc, const char *argv[]) {
|
|
|
|
parse_args(argc,argv);
|
|
|
|
scanscan_setup();
|
|
switch (run_mode) {
|
|
case RUN_HWC: scanscan_hwc(); break;
|
|
#ifdef TOKUDB
|
|
case RUN_LWC: scanscan_lwc(); break;
|
|
case RUN_VERIFY: scanscan_verify(); break;
|
|
#endif
|
|
case RUN_RANGE: scanscan_range(); break;
|
|
default: assert(0); break;
|
|
}
|
|
scanscan_shutdown();
|
|
|
|
return 0;
|
|
}
|