mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 06:44:16 +01:00
refs #5702 remove the old perf_insert_multiple, add the new perf_iibench. it is currently very simple. the first DB is a unique index with an autoincrement key, the rest of the DBs are non-unique and have random keys.
git-svn-id: file:///svn/toku/tokudb@50304 c7de825b-a66e-492c-adef-691d508d4ae1
This commit is contained in:
John Esmet
Yoni Fogel
parent
689a93f5ff
commit
27d87f64c4
3 changed files with 110 additions and 108 deletions
110
src/tests/perf_iibench.cc
Normal file
110
src/tests/perf_iibench.cc
Normal file
|
|
@ -0,0 +1,110 @@
|
|||
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
||||
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
||||
#ident "Copyright (c) 2007-2012 Tokutek Inc. All rights reserved."
|
||||
#ident "$Id: perf_insert_multiple.cc 50140 2012-11-19 19:18:30Z esmet $"
|
||||
|
||||
#include <db.h>
|
||||
#include <portability/toku_atomic.h>
|
||||
|
||||
#include "test.h"
|
||||
#include "threaded_stress_test_helpers.h"
|
||||
|
||||
//
|
||||
// This test tries to emulate iibench at the ydb layer. There is one
|
||||
// unique index with an auto-increment key, plus several non-unique
|
||||
// secondary indexes with random keys.
|
||||
//
|
||||
|
||||
struct iibench_op_extra {
|
||||
uint64_t autoincrement;
|
||||
};
|
||||
|
||||
static uint64_t next_autoincrement(struct iibench_op_extra *info) {
|
||||
return toku_sync_fetch_and_add(&info->autoincrement, 1);
|
||||
}
|
||||
|
||||
static int UU() iibench_put_op(DB_TXN *txn, ARG arg, void *operation_extra, void *stats_extra) {
|
||||
const int num_dbs = arg->cli->num_DBs;
|
||||
DB **dbs = arg->dbp;
|
||||
DB_ENV *env = arg->env;
|
||||
DBT mult_key_dbt[num_dbs];
|
||||
DBT mult_put_dbt[num_dbs];
|
||||
uint32_t mult_put_flags[num_dbs];
|
||||
memset(mult_key_dbt, 0, sizeof(mult_key_dbt));
|
||||
memset(mult_put_dbt, 0, sizeof(mult_put_dbt));
|
||||
memset(mult_put_flags, 0, sizeof(mult_put_dbt));
|
||||
// The first DB is a unique autoincrement index.
|
||||
mult_put_flags[0] = DB_NOOVERWRITE;
|
||||
|
||||
int r = 0;
|
||||
uint8_t valbuf[arg->cli->val_size];
|
||||
ZERO_ARRAY(valbuf);
|
||||
|
||||
uint64_t puts_to_increment = 0;
|
||||
for (uint32_t i = 0; i < arg->cli->txn_size; ++i) {
|
||||
struct iibench_op_extra *CAST_FROM_VOIDP(info, operation_extra);
|
||||
uint64_t key = i == 0 ? next_autoincrement(info) : randu64(arg->random_data);
|
||||
fill_zeroed_array(valbuf, arg->cli->val_size, arg->random_data, arg->cli->compressibility);
|
||||
DBT key_dbt, val_dbt;
|
||||
dbt_init(&key_dbt, &key, sizeof key);
|
||||
dbt_init(&val_dbt, valbuf, sizeof valbuf);
|
||||
r = env->put_multiple(
|
||||
env,
|
||||
dbs[0], // source db.
|
||||
txn,
|
||||
&key_dbt, // source db key
|
||||
&val_dbt, // source db value
|
||||
num_dbs, // total number of dbs
|
||||
dbs, // array of dbs
|
||||
mult_key_dbt, // array of keys
|
||||
mult_put_dbt, // array of values
|
||||
mult_put_flags // array of flags
|
||||
);
|
||||
if (r != 0) {
|
||||
goto cleanup;
|
||||
}
|
||||
puts_to_increment++;
|
||||
if (puts_to_increment == 100) {
|
||||
increment_counter(stats_extra, PUTS, puts_to_increment);
|
||||
puts_to_increment = 0;
|
||||
}
|
||||
}
|
||||
cleanup:
|
||||
return r;
|
||||
}
|
||||
|
||||
static void
|
||||
stress_table(DB_ENV* env, DB** UU(dbp), struct cli_args *cli_args) {
|
||||
if (verbose) printf("starting creation of pthreads\n");
|
||||
const int num_threads = cli_args->num_put_threads;
|
||||
struct iibench_op_extra iib_extra = {
|
||||
.autoincrement = 0
|
||||
};
|
||||
struct arg myargs[num_threads];
|
||||
for (int i = 0; i < num_threads; i++) {
|
||||
arg_init(&myargs[i], dbp, env, cli_args);
|
||||
myargs[i].operation = iibench_put_op;
|
||||
myargs[i].operation_extra = &iib_extra;
|
||||
}
|
||||
// TODO: set generate row for put callback
|
||||
(void) env;
|
||||
|
||||
const bool crash_at_end = false;
|
||||
run_workers(myargs, num_threads, cli_args->num_seconds, crash_at_end, cli_args);
|
||||
}
|
||||
|
||||
int
|
||||
test_main(int argc, char *const argv[]) {
|
||||
struct cli_args args = get_default_args_for_perf();
|
||||
args.num_elements = 0; // want to start with empty DBs
|
||||
parse_stress_test_args(argc, argv, &args);
|
||||
// when there are multiple threads, its valid for two of them to
|
||||
// generate the same key and one of them fail with DB_LOCK_NOTGRANTED
|
||||
if (args.num_put_threads > 1) {
|
||||
args.crash_on_operation_failure = false;
|
||||
}
|
||||
// TODO: Use a more complex, more expensive comparison function that
|
||||
// unpacks keys and walks a descriptor to satisfy the comparison.
|
||||
stress_test_main_with_cmp(&args, stress_uint64_dbt_cmp);
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
||||
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
||||
#ident "Copyright (c) 2007-2012 Tokutek Inc. All rights reserved."
|
||||
#ident "$Id$"
|
||||
|
||||
#include "test.h"
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include <toku_pthread.h>
|
||||
#include <unistd.h>
|
||||
#include <memory.h>
|
||||
#include <sys/stat.h>
|
||||
#include <db.h>
|
||||
|
||||
#include "threaded_stress_test_helpers.h"
|
||||
|
||||
// The intent of this test is to measure the throughput of env->put_multiple
|
||||
// with multiple threads.
|
||||
|
||||
static void
|
||||
stress_table(DB_ENV* env, DB** dbp, struct cli_args *cli_args) {
|
||||
if (verbose) printf("starting creation of pthreads\n");
|
||||
const int num_threads = cli_args->num_put_threads;
|
||||
struct arg myargs[num_threads];
|
||||
struct serial_put_extra spe[num_threads];
|
||||
ZERO_ARRAY(spe);
|
||||
for (int i = 0; i < num_threads; i++) {
|
||||
arg_init(&myargs[i], dbp, env, cli_args);
|
||||
myargs[i].operation = random_put_multiple_op;
|
||||
if (cli_args->serial_insert) {
|
||||
myargs[i].operation_extra = &spe[i];
|
||||
}
|
||||
}
|
||||
const bool crash_at_end = false;
|
||||
run_workers(myargs, num_threads, cli_args->num_seconds, crash_at_end, cli_args);
|
||||
}
|
||||
|
||||
int
|
||||
test_main(int argc, char *const argv[]) {
|
||||
struct cli_args args = get_default_args_for_perf();
|
||||
args.num_elements = 0; // want to start with empty DBs
|
||||
parse_stress_test_args(argc, argv, &args);
|
||||
// when there are multiple threads, its valid for two of them to
|
||||
// generate the same key and one of them fail with DB_LOCK_NOTGRANTED
|
||||
if (args.num_put_threads > 1) {
|
||||
args.crash_on_operation_failure = false;
|
||||
}
|
||||
stress_test_main_with_cmp(&args, stress_uint64_dbt_cmp);
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -761,62 +761,6 @@ cleanup:
|
|||
return r;
|
||||
}
|
||||
|
||||
static int UU() random_put_multiple_op(DB_TXN *txn, ARG arg, void *UU(operation_extra), void *stats_extra) {
|
||||
const int num_dbs = arg->cli->num_DBs;
|
||||
DB **dbs = arg->dbp;
|
||||
DB_ENV *env = arg->env;
|
||||
DBT mult_key_dbt[num_dbs];
|
||||
DBT mult_put_dbt[num_dbs];
|
||||
uint32_t mult_put_flags[num_dbs];
|
||||
memset(mult_key_dbt, 0, sizeof(mult_key_dbt));
|
||||
memset(mult_put_dbt, 0, sizeof(mult_put_dbt));
|
||||
memset(mult_put_flags, 0, sizeof(mult_put_dbt));
|
||||
|
||||
int r = 0;
|
||||
uint8_t rand_key_b[size_t_max(arg->cli->key_size, sizeof(uint64_t))];
|
||||
uint64_t *rand_key_key = cast_to_typeof(rand_key_key) rand_key_b;
|
||||
uint16_t *rand_key_i = cast_to_typeof(rand_key_i) rand_key_b;
|
||||
ZERO_ARRAY(rand_key_b);
|
||||
uint8_t valbuf[arg->cli->val_size];
|
||||
ZERO_ARRAY(valbuf);
|
||||
|
||||
uint64_t puts_to_increment = 0;
|
||||
for (uint32_t i = 0; i < arg->cli->txn_size; ++i) {
|
||||
rand_key_key[0] = randu64(arg->random_data);
|
||||
if (arg->cli->interleave) {
|
||||
rand_key_i[3] = arg->thread_idx;
|
||||
} else {
|
||||
rand_key_i[0] = arg->thread_idx;
|
||||
}
|
||||
fill_zeroed_array(valbuf, arg->cli->val_size, arg->random_data, arg->cli->compressibility);
|
||||
DBT key, val;
|
||||
dbt_init(&key, &rand_key_b, sizeof rand_key_b);
|
||||
dbt_init(&val, valbuf, sizeof valbuf);
|
||||
r = env->put_multiple(
|
||||
env,
|
||||
dbs[0], // source db. this is arbitrary.
|
||||
txn,
|
||||
&key, // source db key
|
||||
&val, // source db value
|
||||
num_dbs, // total number of dbs
|
||||
dbs, // array of dbs
|
||||
mult_key_dbt, // array of keys
|
||||
mult_put_dbt, // array of values
|
||||
mult_put_flags // array of flags
|
||||
);
|
||||
if (r != 0) {
|
||||
goto cleanup;
|
||||
}
|
||||
puts_to_increment++;
|
||||
if (puts_to_increment == 100) {
|
||||
increment_counter(stats_extra, PUTS, puts_to_increment);
|
||||
puts_to_increment = 0;
|
||||
}
|
||||
}
|
||||
cleanup:
|
||||
return r;
|
||||
}
|
||||
|
||||
static int UU() random_put_op(DB_TXN *txn, ARG arg, void *UU(operation_extra), void *stats_extra) {
|
||||
int db_index = myrandom_r(arg->random_data)%arg->cli->num_DBs;
|
||||
DB* db = arg->dbp[db_index];
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue