1
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
5
COPYING CONDITIONS NOTICE:
7
This program is free software; you can redistribute it and/or modify
8
it under the terms of version 2 of the GNU General Public License as
9
published by the Free Software Foundation, and provided that the
10
following conditions are met:
12
* Redistributions of source code must retain this COPYING
13
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
14
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
15
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
18
* Redistributions in binary form must reproduce this COPYING
19
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
20
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
21
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
22
GRANT (below) in the documentation and/or other materials
23
provided with the distribution.
25
You should have received a copy of the GNU General Public License
26
along with this program; if not, write to the Free Software
27
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
32
TokuDB, Tokutek Fractal Tree Indexing Library.
33
Copyright (C) 2007-2013 Tokutek, Inc.
37
This program is distributed in the hope that it will be useful, but
38
WITHOUT ANY WARRANTY; without even the implied warranty of
39
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
40
General Public License for more details.
42
UNIVERSITY PATENT NOTICE:
44
The technology is licensed by the Massachusetts Institute of
45
Technology, Rutgers State University of New Jersey, and the Research
46
Foundation of State University of New York at Stony Brook under
47
United States of America Serial No. 11/760379 and to the patents
48
and/or patent applications resulting from it.
50
PATENT MARKING NOTICE:
52
This software is covered by US Patent No. 8,185,551.
53
This software is covered by US Patent No. 8,489,638.
57
"THIS IMPLEMENTATION" means the copyrightable works distributed by
58
Tokutek as part of the Fractal Tree project.
60
"PATENT CLAIMS" means the claims of patents that are owned or
61
licensable by Tokutek, both currently or in the future; and that in
62
the absence of this license would be infringed by THIS
63
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
65
"PATENT CHALLENGE" shall mean a challenge to the validity,
66
patentability, enforceability and/or non-infringement of any of the
67
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
69
Tokutek hereby grants to you, for the term and geographical scope of
70
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
71
irrevocable (except as stated in this section) patent license to
72
make, have made, use, offer to sell, sell, import, transfer, and
73
otherwise run, modify, and propagate the contents of THIS
74
IMPLEMENTATION, where such license applies only to the PATENT
75
CLAIMS. This grant does not include claims that would be infringed
76
only as a consequence of further modifications of THIS
77
IMPLEMENTATION. If you or your agent or licensee institute or order
78
or agree to the institution of patent litigation against any entity
79
(including a cross-claim or counterclaim in a lawsuit) alleging that
80
THIS IMPLEMENTATION constitutes direct or contributory patent
81
infringement, or inducement of patent infringement, then any rights
82
granted to you under this License shall terminate as of the date
83
such litigation is filed. If you or your agent or exclusive
84
licensee institute or order or agree to the institution of a PATENT
85
CHALLENGE, then Tokutek may terminate any rights granted to you
89
#ident "Copyright (c) 2010-2013 Tokutek Inc. All rights reserved."
90
#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."
92
// The purpose of this test is force errors returned from the generate function
94
#define DONT_DEPRECATE_MALLOC
95
#define DONT_DEPRECATE_WRITES
98
#include "ftloader-internal.h"
99
#include "ftloader-error-injector.h"
101
#include <portability/toku_path.h>
104
static int generate(DB *dest_db, DB *src_db, DBT_ARRAY *dest_keys, DBT_ARRAY *dest_vals, const DBT *src_key, const DBT *src_val) {
105
if (verbose) printf("%s %p %p %p %p %p %p\n", __FUNCTION__, dest_db, src_db, dest_keys, dest_vals, src_key, src_val);
106
toku_dbt_array_resize(dest_keys, 1);
107
toku_dbt_array_resize(dest_vals, 1);
108
DBT *dest_key = &dest_keys->dbts[0];
109
DBT *dest_val = &dest_vals->dbts[0];
111
assert(dest_db == NULL); assert(src_db == NULL);
114
if (event_count_trigger == event_add_and_fetch()) {
118
copy_dbt(dest_key, src_key);
119
copy_dbt(dest_val, src_val);
123
if (verbose) printf("%s %d\n", __FUNCTION__, result);
127
static int qsort_compare_ints (const void *a, const void *b) {
128
int avalue = *(int*)a;
129
int bvalue = *(int*)b;
130
if (avalue<bvalue) return -1;
131
if (avalue>bvalue) return +1;
135
static int compare_int(DB *desc, const DBT *akey, const DBT *bkey) {
136
assert(desc == NULL);
137
assert(akey->size == sizeof (int));
138
assert(bkey->size == sizeof (int));
139
return qsort_compare_ints(akey->data, bkey->data);
142
static void populate_rowset(struct rowset *rowset, int seq, int nrows) {
143
for (int i = 0; i < nrows; i++) {
144
int k = seq * nrows + i;
145
int v = seq * nrows + i;
147
toku_fill_dbt(&key, &k, sizeof k);
149
toku_fill_dbt(&val, &v, sizeof v);
150
add_row(rowset, &key, &val);
154
static void test_extractor(int nrows, int nrowsets, bool expect_fail) {
155
if (verbose) printf("%s %d %d\n", __FUNCTION__, nrows, nrowsets);
159
// open the ft_loader. this runs the extractor.
163
const char *fnames[N];
164
ft_compare_func compares[N];
165
for (int i = 0; i < N; i++) {
169
compares[i] = compare_int;
173
r = toku_ft_loader_open(&loader, NULL, generate, NULL, N, brts, dbs, fnames, compares, "tempXXXXXX", ZERO_LSN, TXNID_NONE, true, 0, false);
176
struct rowset *rowset[nrowsets];
177
for (int i = 0 ; i < nrowsets; i++) {
178
rowset[i] = (struct rowset *) toku_malloc(sizeof (struct rowset));
180
init_rowset(rowset[i], toku_ft_loader_get_rowset_budget_for_testing());
181
populate_rowset(rowset[i], i, nrows);
184
// feed rowsets to the extractor
185
for (int i = 0; i < nrowsets; i++) {
186
r = queue_enq(loader->primary_rowset_queue, rowset[i], 1, NULL);
190
r = toku_ft_loader_finish_extractor(loader);
194
r = toku_ft_loader_get_error(loader, &loader_error);
197
assert(expect_fail ? loader_error != 0 : loader_error == 0);
199
// abort the ft_loader. this ends the test
200
r = toku_ft_loader_abort(loader, true);
204
static int nrows = 1;
205
static int nrowsets = 2;
207
static int usage(const char *progname) {
208
fprintf(stderr, "Usage:\n %s [-h] [-v] [-q] [-s] [-r %d] [--rowsets %d]\n", progname, nrows, nrowsets);
212
int test_main (int argc, const char *argv[]) {
213
const char *progname=argv[0];
216
if (strcmp(argv[0],"-h")==0) {
217
return usage(progname);
218
} else if (strcmp(argv[0],"-v")==0) {
220
} else if (strcmp(argv[0],"-q")==0) {
222
} else if (strcmp(argv[0],"-r") == 0 && argc >= 1) {
224
nrows = atoi(argv[0]);
225
} else if (strcmp(argv[0],"--nrowsets") == 0 && argc >= 1) {
227
nrowsets = atoi(argv[0]);
228
} else if (strcmp(argv[0],"-s") == 0) {
229
toku_ft_loader_set_size_factor(1);
230
} else if (argc!=1) {
231
return usage(progname);
241
test_extractor(nrows, nrowsets, false);
244
int event_limit = event_count;
245
if (verbose) printf("event_limit=%d\n", event_limit);
247
for (int i = 1; i <= event_limit; i++) {
248
reset_event_counts();
249
event_count_trigger = i;
250
test_extractor(nrows, nrowsets, true);