1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/*-
* Public Domain 2014-2019 MongoDB, Inc.
* Public Domain 2008-2014 WiredTiger, Inc.
*
* This is free and unencumbered software released into the public domain.
*
* Anyone is free to copy, modify, publish, use, compile, sell, or
* distribute this software, either in source code form or as a compiled
* binary, for any purpose, commercial or non-commercial, and by any
* means.
*
* In jurisdictions that recognize copyright laws, the author or authors
* of this software dedicate any and all copyright interest in the
* software to the public domain. We make this dedication for the benefit
* of the public at large and to the detriment of our heirs and
* successors. We intend this dedication to be an overt act of
* relinquishment in perpetuity of all present and future rights to this
* software under copyright law.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "test_util.h"
#define KEY "key"
#define VALUE "value,value,value"
static int ignore_errors;
static int
handle_error(WT_EVENT_HANDLER *handler,
WT_SESSION *session, int error, const char *message)
{
(void)(handler);
/* Skip the error messages we're expecting to see. */
if (ignore_errors > 0 &&
(strstr(message, "requires key be set") != NULL ||
strstr(message, "requires value be set") != NULL)) {
--ignore_errors;
return (0);
}
(void)fprintf(stderr, "%s: %s\n",
message, session->strerror(session, error));
return (0);
}
static WT_EVENT_HANDLER event_handler = {
handle_error,
NULL,
NULL,
NULL
};
static void
cursor_scope_ops(WT_SESSION *session, const char *uri)
{
struct {
const char *op;
enum { INSERT, MODIFY, SEARCH, SEARCH_NEAR,
REMOVE, REMOVE_POS, RESERVE, UPDATE } func;
const char *config;
} *op, ops[] = {
/*
* The ops order is specific: insert has to happen first so
* other operations are possible, and remove has to be last.
*/
{ "insert", INSERT, NULL, },
{ "search", SEARCH, NULL, },
{ "search", SEARCH_NEAR, NULL, },
{ "reserve", RESERVE, NULL, },
{ "insert", MODIFY, NULL, },
{ "update", UPDATE, NULL, },
{ "remove", REMOVE, NULL, },
{ "remove", REMOVE_POS, NULL, },
{ NULL, INSERT, NULL }
};
WT_CURSOR *cursor;
#define MODIFY_ENTRIES 2
WT_MODIFY entries[MODIFY_ENTRIES];
WT_ITEM vu;
uint64_t keyr;
const char *key, *vs;
char keybuf[100], valuebuf[100];
int exact;
bool recno, vstring;
/* Reserve requires a running transaction. */
testutil_check(session->begin_transaction(session, NULL));
cursor = NULL;
for (op = ops; op->op != NULL; op++) {
key = vs = NULL;
memset(&vu, 0, sizeof(vu));
/* Open a cursor. */
if (cursor != NULL)
testutil_check(cursor->close(cursor));
testutil_check(session->open_cursor(
session, uri, NULL, op->config, &cursor));
/* Operations change based on the key/value formats. */
recno = strcmp(cursor->key_format, "r") == 0;
vstring = strcmp(cursor->value_format, "S") == 0;
/* Modify is only possible with "item" values. */
if (vstring && op->func == MODIFY)
continue;
/*
* Set up application buffers so we can detect overwrites
* or failure to copy application information into library
* memory.
*/
if (recno)
cursor->set_key(cursor, (uint64_t)1);
else {
strcpy(keybuf, KEY);
cursor->set_key(cursor, keybuf);
}
strcpy(valuebuf, VALUE);
if (vstring)
cursor->set_value(cursor, valuebuf);
else {
vu.size = strlen(vu.data = valuebuf);
cursor->set_value(cursor, &vu);
}
/*
* The application must keep key and value memory valid until
* the next operation that positions the cursor, modifies the
* data, or resets or closes the cursor.
*
* Modifying either the key or value buffers is not permitted.
*/
switch (op->func) {
case INSERT:
testutil_check(cursor->insert(cursor));
break;
case MODIFY:
/* Modify, but don't really change anything. */
entries[0].data.data = &VALUE[0];
entries[0].data.size = 2;
entries[0].offset = 0;
entries[0].size = 2;
entries[1].data.data = &VALUE[3];
entries[1].data.size = 5;
entries[1].offset = 3;
entries[1].size = 5;
testutil_check(
cursor->modify(cursor, entries, MODIFY_ENTRIES));
break;
case SEARCH:
testutil_check(cursor->search(cursor));
break;
case SEARCH_NEAR:
testutil_check(cursor->search_near(cursor, &exact));
break;
case REMOVE_POS:
/*
* Remove has two modes, one where the remove is based
* on a cursor position, the other where it's based on
* a set key. The results are different, so test them
* separately.
*/
testutil_check(cursor->search(cursor));
/* FALLTHROUGH */
case REMOVE:
testutil_check(cursor->remove(cursor));
break;
case RESERVE:
testutil_check(cursor->reserve(cursor));
break;
case UPDATE:
testutil_check(cursor->update(cursor));
break;
}
/*
* The cursor should no longer reference application memory,
* and application buffers can be safely overwritten.
*/
memset(keybuf, 'K', sizeof(keybuf));
memset(valuebuf, 'V', sizeof(valuebuf));
/*
* Check that get_key/get_value behave as expected after the
* operation.
*/
switch (op->func) {
case INSERT:
case REMOVE:
/*
* Insert and remove configured with a search key do
* not position the cursor and have no key or value.
*
* There should be two error messages, ignore them.
*/
ignore_errors = 2;
if (recno)
testutil_assert(
cursor->get_key(cursor, &keyr) != 0);
else
testutil_assert(
cursor->get_key(cursor, &key) != 0);
if (vstring)
testutil_assert(
cursor->get_value(cursor, &vs) != 0);
else
testutil_assert(
cursor->get_value(cursor, &vu) != 0);
testutil_assert(ignore_errors == 0);
break;
case REMOVE_POS:
/*
* Remove configured with a cursor position has a key,
* but no value.
*
* There should be one error message, ignore it.
*/
if (recno) {
testutil_assert(
cursor->get_key(cursor, &keyr) == 0);
testutil_assert(keyr == 1);
} else {
testutil_assert(
cursor->get_key(cursor, &key) == 0);
testutil_assert(key != keybuf);
testutil_assert(strcmp(key, KEY) == 0);
}
ignore_errors = 1;
if (vstring)
testutil_assert(
cursor->get_value(cursor, &vs) != 0);
else
testutil_assert(
cursor->get_value(cursor, &vu) != 0);
testutil_assert(ignore_errors == 0);
break;
case MODIFY:
case RESERVE:
case SEARCH:
case SEARCH_NEAR:
case UPDATE:
/*
* Modify, reserve, search, search-near and update all
* position the cursor and have both a key and value.
*
* Any key/value should not reference application
* memory.
*/
if (recno) {
testutil_assert(
cursor->get_key(cursor, &keyr) == 0);
testutil_assert(keyr == 1);
} else {
testutil_assert(
cursor->get_key(cursor, &key) == 0);
testutil_assert(key != keybuf);
testutil_assert(strcmp(key, KEY) == 0);
}
if (vstring) {
testutil_assert(
cursor->get_value(cursor, &vs) == 0);
testutil_assert(vs != valuebuf);
testutil_assert(strcmp(vs, VALUE) == 0);
} else {
testutil_assert(
cursor->get_value(cursor, &vu) == 0);
testutil_assert(vu.data != valuebuf);
testutil_assert(vu.size == strlen(VALUE));
testutil_assert(
memcmp(vu.data, VALUE, strlen(VALUE)) == 0);
}
break;
}
/*
* We have more than one remove operation, add the key back
* in.
*/
if (op->func == REMOVE || op->func == REMOVE_POS) {
if (recno)
cursor->set_key(cursor, (uint64_t)1);
else {
strcpy(keybuf, KEY);
cursor->set_key(cursor, keybuf);
}
strcpy(valuebuf, VALUE);
if (vstring)
cursor->set_value(cursor, valuebuf);
else {
vu.size = strlen(vu.data = valuebuf);
cursor->set_value(cursor, &vu);
}
testutil_check(cursor->insert(cursor));
}
}
}
static void
run(WT_CONNECTION *conn, const char *uri, const char *config)
{
WT_SESSION *session;
testutil_check(conn->open_session(conn, NULL, NULL, &session));
testutil_check(session->create(session, uri, config));
cursor_scope_ops(session, uri);
testutil_check(session->close(session, NULL));
}
int
main(int argc, char *argv[])
{
TEST_OPTS *opts, _opts;
opts = &_opts;
memset(opts, 0, sizeof(*opts));
testutil_check(testutil_parse_opts(argc, argv, opts));
testutil_make_work_dir(opts->home);
testutil_check(
wiredtiger_open(opts->home, &event_handler, "create", &opts->conn));
run(opts->conn, "file:file.SS", "key_format=S,value_format=S");
run(opts->conn, "file:file.Su", "key_format=S,value_format=u");
run(opts->conn, "file:file.rS", "key_format=r,value_format=S");
run(opts->conn, "file:file.ru", "key_format=r,value_format=u");
run(opts->conn, "lsm:lsm.SS", "key_format=S,value_format=S");
run(opts->conn, "lsm:lsm.Su", "key_format=S,value_format=u");
run(opts->conn, "table:table.SS", "key_format=S,value_format=S");
run(opts->conn, "table:table.Su", "key_format=S,value_format=u");
run(opts->conn, "table:table.rS", "key_format=r,value_format=S");
run(opts->conn, "table:table.ru", "key_format=r,value_format=u");
testutil_cleanup(opts);
return (EXIT_SUCCESS);
}
|