1 /* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 // vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
3 #ident "$Id$"
4 /*======
5 This file is part of PerconaFT.
6
7
8 Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
9
10 PerconaFT is free software: you can redistribute it and/or modify
11 it under the terms of the GNU General Public License, version 2,
12 as published by the Free Software Foundation.
13
14 PerconaFT is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
21
22 ----------------------------------------
23
24 PerconaFT is free software: you can redistribute it and/or modify
25 it under the terms of the GNU Affero General Public License, version 3,
26 as published by the Free Software Foundation.
27
28 PerconaFT is distributed in the hope that it will be useful,
29 but WITHOUT ANY WARRANTY; without even the implied warranty of
30 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
31 GNU Affero General Public License for more details.
32
33 You should have received a copy of the GNU Affero General Public License
34 along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
35 ======= */
36
37 #ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
38
39 #include "test.h"
40
41
42 /* Like test_log5 except abort. */
43
44
45 #include <db.h>
46 #include <stdlib.h>
47 #include <sys/stat.h>
48 #include <sys/types.h>
49 #include <memory.h>
50
51 // TOKU_TEST_FILENAME is defined in the Makefile
52
53 struct in_db;
54 struct in_db {
55 long int r;
56 int i;
57 struct in_db *next;
58 } *items=0;
59
make_db(void)60 static void make_db (void) {
61 DB_ENV *env;
62 DB *db;
63 DB_TXN *tid;
64 int r;
65 int i;
66
67 int maxcount = 24073;
68
69 toku_os_recursive_delete(TOKU_TEST_FILENAME);
70 r=toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); assert(r==0);
71 r=db_env_create(&env, 0); assert(r==0);
72
73 r=env->open(env, TOKU_TEST_FILENAME, DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_MPOOL|DB_INIT_TXN|DB_CREATE|DB_PRIVATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
74 r=db_create(&db, env, 0); CKERR(r);
75 r=env->txn_begin(env, 0, &tid, 0); assert(r==0);
76 r=db->open(db, tid, "foo.db", 0, DB_BTREE, DB_CREATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
77 r=tid->commit(tid, 0); assert(r==0);
78 r=env->txn_begin(env, 0, &tid, 0); assert(r==0);
79
80 for (i=0; i<maxcount; i++) {
81 char hello[30], there[30];
82 DBT key,data;
83 struct in_db *XMALLOC(newitem);
84 newitem->r = random();
85 newitem->i = i;
86 newitem->next = items;
87 items = newitem;
88 snprintf(hello, sizeof(hello), "hello%ld.%d", newitem->r, newitem->i);
89 snprintf(there, sizeof(hello), "there%d", i);
90 memset(&key, 0, sizeof(key));
91 memset(&data, 0, sizeof(data));
92 key.data = hello; key.size=strlen(hello)+1;
93 data.data = there; data.size=strlen(there)+1;
94 r=db->put(db, tid, &key, &data, 0); assert(r==0);
95 }
96 r=tid->abort(tid); assert(r==0);
97 {
98 struct in_db *l=items;
99 for (l=items; l; l=l->next) {
100 char hello[30];
101 DBT key,data;
102 snprintf(hello, sizeof(hello), "hello%ld.%d", l->r, l->i);
103 memset(&key, 0, sizeof(key));
104 memset(&data, 0, sizeof(data));
105 key.data = hello; key.size=strlen(hello)+1;
106 r=db->get(db, 0, &key, &data, 0);
107 assert(r==DB_NOTFOUND);
108 }
109 }
110 r=db->close(db, 0); assert(r==0);
111 r=env->close(env, 0); assert(r==0);
112 while (items) {
113 struct in_db *next=items->next;
114 toku_free(items);
115 items=next;
116 }
117 }
118
119 int
test_main(int argc,char * const argv[])120 test_main (int argc __attribute__((__unused__)), char *const argv[] __attribute__((__unused__))) {
121 make_db();
122 return 0;
123 }
124