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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 1996, 1997, 1998, 1999, 2000
* Sleepycat Software. All rights reserved.
*/
#include "db_config.h"
#ifndef lint
static const char revid[] = "$Id: db_iface.c,v 11.34 2001/01/11 18:19:51 bostic Exp $";
#endif /* not lint */
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#include <errno.h>
#endif
#include "db_int.h"
#include "db_page.h"
#include "db_am.h"
#include "btree.h"
static int __db_curinval __P((const DB_ENV *));
static int __db_rdonly __P((const DB_ENV *, const char *));
static int __dbt_ferr __P((const DB *, const char *, const DBT *, int));
/*
* __db_cursorchk --
* Common cursor argument checking routine.
*
* PUBLIC: int __db_cursorchk __P((const DB *, u_int32_t, int));
*/
int
__db_cursorchk(dbp, flags, isrdonly)
const DB *dbp;
u_int32_t flags;
int isrdonly;
{
/* Check for invalid function flags. */
switch (flags) {
case 0:
break;
case DB_WRITECURSOR:
if (isrdonly)
return (__db_rdonly(dbp->dbenv, "DB->cursor"));
if (!CDB_LOCKING(dbp->dbenv))
return (__db_ferr(dbp->dbenv, "DB->cursor", 0));
break;
case DB_WRITELOCK:
if (isrdonly)
return (__db_rdonly(dbp->dbenv, "DB->cursor"));
break;
default:
return (__db_ferr(dbp->dbenv, "DB->cursor", 0));
}
return (0);
}
/*
* __db_ccountchk --
* Common cursor count argument checking routine.
*
* PUBLIC: int __db_ccountchk __P((const DB *, u_int32_t, int));
*/
int
__db_ccountchk(dbp, flags, isvalid)
const DB *dbp;
u_int32_t flags;
int isvalid;
{
/* Check for invalid function flags. */
switch (flags) {
case 0:
break;
default:
return (__db_ferr(dbp->dbenv, "DBcursor->c_count", 0));
}
/*
* The cursor must be initialized, return EINVAL for an invalid cursor,
* otherwise 0.
*/
return (isvalid ? 0 : __db_curinval(dbp->dbenv));
}
/*
* __db_cdelchk --
* Common cursor delete argument checking routine.
*
* PUBLIC: int __db_cdelchk __P((const DB *, u_int32_t, int, int));
*/
int
__db_cdelchk(dbp, flags, isrdonly, isvalid)
const DB *dbp;
u_int32_t flags;
int isrdonly, isvalid;
{
/* Check for changes to a read-only tree. */
if (isrdonly)
return (__db_rdonly(dbp->dbenv, "c_del"));
/* Check for invalid function flags. */
switch (flags) {
case 0:
break;
default:
return (__db_ferr(dbp->dbenv, "DBcursor->c_del", 0));
}
/*
* The cursor must be initialized, return EINVAL for an invalid cursor,
* otherwise 0.
*/
return (isvalid ? 0 : __db_curinval(dbp->dbenv));
}
/*
* __db_cgetchk --
* Common cursor get argument checking routine.
*
* PUBLIC: int __db_cgetchk __P((const DB *, DBT *, DBT *, u_int32_t, int));
*/
int
__db_cgetchk(dbp, key, data, flags, isvalid)
const DB *dbp;
DBT *key, *data;
u_int32_t flags;
int isvalid;
{
int ret;
/*
* Check for read-modify-write validity. DB_RMW doesn't make sense
* with CDB cursors since if you're going to write the cursor, you
* had to create it with DB_WRITECURSOR. Regardless, we check for
* LOCKING_ON and not STD_LOCKING, as we don't want to disallow it.
* If this changes, confirm that DB does not itself set the DB_RMW
* flag in a path where CDB may have been configured.
*/
if (LF_ISSET(DB_RMW)) {
if (!LOCKING_ON(dbp->dbenv)) {
__db_err(dbp->dbenv,
"the DB_RMW flag requires locking");
return (EINVAL);
}
LF_CLR(DB_RMW);
}
/* Check for invalid function flags. */
switch (flags) {
case DB_CONSUME:
case DB_CONSUME_WAIT:
if (dbp->type != DB_QUEUE)
goto err;
break;
case DB_CURRENT:
case DB_FIRST:
case DB_GET_BOTH:
case DB_LAST:
case DB_NEXT:
case DB_NEXT_DUP:
case DB_NEXT_NODUP:
case DB_PREV:
case DB_PREV_NODUP:
case DB_SET:
case DB_SET_RANGE:
break;
case DB_GET_BOTHC:
if (dbp->type == DB_QUEUE)
goto err;
break;
case DB_GET_RECNO:
if (!F_ISSET(dbp, DB_BT_RECNUM))
goto err;
break;
case DB_SET_RECNO:
if (!F_ISSET(dbp, DB_BT_RECNUM))
goto err;
break;
default:
err: return (__db_ferr(dbp->dbenv, "DBcursor->c_get", 0));
}
/* Check for invalid key/data flags. */
if ((ret = __dbt_ferr(dbp, "key", key, 0)) != 0)
return (ret);
if ((ret = __dbt_ferr(dbp, "data", data, 0)) != 0)
return (ret);
/*
* The cursor must be initialized for DB_CURRENT or DB_NEXT_DUP,
* return EINVAL for an invalid cursor, otherwise 0.
*/
if (isvalid || (flags != DB_CURRENT && flags != DB_NEXT_DUP))
return (0);
return (__db_curinval(dbp->dbenv));
}
/*
* __db_cputchk --
* Common cursor put argument checking routine.
*
* PUBLIC: int __db_cputchk __P((const DB *,
* PUBLIC: const DBT *, DBT *, u_int32_t, int, int));
*/
int
__db_cputchk(dbp, key, data, flags, isrdonly, isvalid)
const DB *dbp;
const DBT *key;
DBT *data;
u_int32_t flags;
int isrdonly, isvalid;
{
int key_flags, ret;
key_flags = 0;
/* Check for changes to a read-only tree. */
if (isrdonly)
return (__db_rdonly(dbp->dbenv, "c_put"));
/* Check for invalid function flags. */
switch (flags) {
case DB_AFTER:
case DB_BEFORE:
switch (dbp->type) {
case DB_BTREE:
case DB_HASH: /* Only with unsorted duplicates. */
if (!F_ISSET(dbp, DB_AM_DUP))
goto err;
if (dbp->dup_compare != NULL)
goto err;
break;
case DB_QUEUE: /* Not permitted. */
goto err;
case DB_RECNO: /* Only with mutable record numbers. */
if (!F_ISSET(dbp, DB_RE_RENUMBER))
goto err;
key_flags = 1;
break;
default:
goto err;
}
break;
case DB_CURRENT:
/*
* If there is a comparison function, doing a DB_CURRENT
* must not change the part of the data item that is used
* for the comparison.
*/
break;
case DB_NODUPDATA:
if (!F_ISSET(dbp, DB_AM_DUPSORT))
goto err;
/* FALLTHROUGH */
case DB_KEYFIRST:
case DB_KEYLAST:
if (dbp->type == DB_QUEUE || dbp->type == DB_RECNO)
goto err;
key_flags = 1;
break;
default:
err: return (__db_ferr(dbp->dbenv, "DBcursor->c_put", 0));
}
/* Check for invalid key/data flags. */
if (key_flags && (ret = __dbt_ferr(dbp, "key", key, 0)) != 0)
return (ret);
if ((ret = __dbt_ferr(dbp, "data", data, 0)) != 0)
return (ret);
/*
* The cursor must be initialized for anything other than DB_KEYFIRST
* and DB_KEYLAST, return EINVAL for an invalid cursor, otherwise 0.
*/
if (isvalid || flags == DB_KEYFIRST ||
flags == DB_KEYLAST || flags == DB_NODUPDATA)
return (0);
return (__db_curinval(dbp->dbenv));
}
/*
* __db_closechk --
* DB->close flag check.
*
* PUBLIC: int __db_closechk __P((const DB *, u_int32_t));
*/
int
__db_closechk(dbp, flags)
const DB *dbp;
u_int32_t flags;
{
/* Check for invalid function flags. */
switch (flags) {
case 0:
case DB_NOSYNC:
break;
default:
return (__db_ferr(dbp->dbenv, "DB->close", 0));
}
return (0);
}
/*
* __db_delchk --
* Common delete argument checking routine.
*
* PUBLIC: int __db_delchk __P((const DB *, DBT *, u_int32_t, int));
*/
int
__db_delchk(dbp, key, flags, isrdonly)
const DB *dbp;
DBT *key;
u_int32_t flags;
int isrdonly;
{
COMPQUIET(key, NULL);
/* Check for changes to a read-only tree. */
if (isrdonly)
return (__db_rdonly(dbp->dbenv, "delete"));
/* Check for invalid function flags. */
switch (flags) {
case 0:
break;
default:
return (__db_ferr(dbp->dbenv, "DB->del", 0));
}
return (0);
}
/*
* __db_getchk --
* Common get argument checking routine.
*
* PUBLIC: int __db_getchk __P((const DB *, const DBT *, DBT *, u_int32_t));
*/
int
__db_getchk(dbp, key, data, flags)
const DB *dbp;
const DBT *key;
DBT *data;
u_int32_t flags;
{
int ret;
/*
* Check for read-modify-write validity. DB_RMW doesn't make sense
* with CDB cursors since if you're going to write the cursor, you
* had to create it with DB_WRITECURSOR. Regardless, we check for
* LOCKING_ON and not STD_LOCKING, as we don't want to disallow it.
* If this changes, confirm that DB does not itself set the DB_RMW
* flag in a path where CDB may have been configured.
*/
if (LF_ISSET(DB_RMW)) {
if (!LOCKING_ON(dbp->dbenv)) {
__db_err(dbp->dbenv,
"the DB_RMW flag requires locking");
return (EINVAL);
}
LF_CLR(DB_RMW);
}
/* Check for invalid function flags. */
switch (flags) {
case 0:
case DB_GET_BOTH:
break;
case DB_SET_RECNO:
if (!F_ISSET(dbp, DB_BT_RECNUM))
goto err;
break;
case DB_CONSUME:
case DB_CONSUME_WAIT:
if (dbp->type == DB_QUEUE)
break;
/* Fall through */
default:
err: return (__db_ferr(dbp->dbenv, "DB->get", 0));
}
/* Check for invalid key/data flags. */
if ((ret = __dbt_ferr(dbp, "key", key, flags == DB_SET_RECNO)) != 0)
return (ret);
if ((ret = __dbt_ferr(dbp, "data", data, 1)) != 0)
return (ret);
return (0);
}
/*
* __db_joinchk --
* Common join argument checking routine.
*
* PUBLIC: int __db_joinchk __P((const DB *, DBC * const *, u_int32_t));
*/
int
__db_joinchk(dbp, curslist, flags)
const DB *dbp;
DBC * const *curslist;
u_int32_t flags;
{
DB_TXN *txn;
int i;
switch (flags) {
case 0:
case DB_JOIN_NOSORT:
break;
default:
return (__db_ferr(dbp->dbenv, "DB->join", 0));
}
if (curslist == NULL || curslist[0] == NULL) {
__db_err(dbp->dbenv,
"At least one secondary cursor must be specified to DB->join");
return (EINVAL);
}
txn = curslist[0]->txn;
for (i = 1; curslist[i] != NULL; i++)
if (curslist[i]->txn != txn) {
__db_err(dbp->dbenv,
"All secondary cursors must share the same transaction");
return (EINVAL);
}
return (0);
}
/*
* __db_joingetchk --
* Common join_get argument checking routine.
*
* PUBLIC: int __db_joingetchk __P((const DB *, DBT *, u_int32_t));
*/
int
__db_joingetchk(dbp, key, flags)
const DB *dbp;
DBT *key;
u_int32_t flags;
{
if (LF_ISSET(DB_RMW)) {
if (!LOCKING_ON(dbp->dbenv)) {
__db_err(dbp->dbenv,
"the DB_RMW flag requires locking");
return (EINVAL);
}
LF_CLR(DB_RMW);
}
switch (flags) {
case 0:
case DB_JOIN_ITEM:
break;
default:
return (__db_ferr(dbp->dbenv, "DBcursor->c_get", 0));
}
/*
* A partial get of the key of a join cursor don't make much sense;
* the entire key is necessary to query the primary database
* and find the datum, and so regardless of the size of the key
* it would not be a performance improvement. Since it would require
* special handling, we simply disallow it.
*
* A partial get of the data, however, potentially makes sense (if
* all possible data are a predictable large structure, for instance)
* and causes us no headaches, so we permit it.
*/
if (F_ISSET(key, DB_DBT_PARTIAL)) {
__db_err(dbp->dbenv,
"DB_DBT_PARTIAL may not be set on key during join_get");
return (EINVAL);
}
return (0);
}
/*
* __db_putchk --
* Common put argument checking routine.
*
* PUBLIC: int __db_putchk
* PUBLIC: __P((const DB *, DBT *, const DBT *, u_int32_t, int, int));
*/
int
__db_putchk(dbp, key, data, flags, isrdonly, isdup)
const DB *dbp;
DBT *key;
const DBT *data;
u_int32_t flags;
int isrdonly, isdup;
{
int ret;
/* Check for changes to a read-only tree. */
if (isrdonly)
return (__db_rdonly(dbp->dbenv, "put"));
/* Check for invalid function flags. */
switch (flags) {
case 0:
case DB_NOOVERWRITE:
break;
case DB_APPEND:
if (dbp->type != DB_RECNO && dbp->type != DB_QUEUE)
goto err;
break;
case DB_NODUPDATA:
if (F_ISSET(dbp, DB_AM_DUPSORT))
break;
/* FALLTHROUGH */
default:
err: return (__db_ferr(dbp->dbenv, "DB->put", 0));
}
/* Check for invalid key/data flags. */
if ((ret = __dbt_ferr(dbp, "key", key, 0)) != 0)
return (ret);
if ((ret = __dbt_ferr(dbp, "data", data, 0)) != 0)
return (ret);
/* Check for partial puts in the presence of duplicates. */
if (isdup && F_ISSET(data, DB_DBT_PARTIAL)) {
__db_err(dbp->dbenv,
"a partial put in the presence of duplicates requires a cursor operation");
return (EINVAL);
}
return (0);
}
/*
* __db_removechk --
* DB->remove flag check.
*
* PUBLIC: int __db_removechk __P((const DB *, u_int32_t));
*/
int
__db_removechk(dbp, flags)
const DB *dbp;
u_int32_t flags;
{
/* Check for invalid function flags. */
switch (flags) {
case 0:
break;
default:
return (__db_ferr(dbp->dbenv, "DB->remove", 0));
}
return (0);
}
/*
* __db_statchk --
* Common stat argument checking routine.
*
* PUBLIC: int __db_statchk __P((const DB *, u_int32_t));
*/
int
__db_statchk(dbp, flags)
const DB *dbp;
u_int32_t flags;
{
/* Check for invalid function flags. */
switch (flags) {
case 0:
case DB_CACHED_COUNTS:
break;
case DB_RECORDCOUNT:
if (dbp->type == DB_RECNO)
break;
if (dbp->type == DB_BTREE && F_ISSET(dbp, DB_BT_RECNUM))
break;
goto err;
default:
err: return (__db_ferr(dbp->dbenv, "DB->stat", 0));
}
return (0);
}
/*
* __db_syncchk --
* Common sync argument checking routine.
*
* PUBLIC: int __db_syncchk __P((const DB *, u_int32_t));
*/
int
__db_syncchk(dbp, flags)
const DB *dbp;
u_int32_t flags;
{
/* Check for invalid function flags. */
switch (flags) {
case 0:
break;
default:
return (__db_ferr(dbp->dbenv, "DB->sync", 0));
}
return (0);
}
/*
* __dbt_ferr --
* Check a DBT for flag errors.
*/
static int
__dbt_ferr(dbp, name, dbt, check_thread)
const DB *dbp;
const char *name;
const DBT *dbt;
int check_thread;
{
DB_ENV *dbenv;
int ret;
dbenv = dbp->dbenv;
/*
* Check for invalid DBT flags. We allow any of the flags to be
* specified to any DB or DBcursor call so that applications can
* set DB_DBT_MALLOC when retrieving a data item from a secondary
* database and then specify that same DBT as a key to a primary
* database, without having to clear flags.
*/
if ((ret = __db_fchk(dbenv, name, dbt->flags,
DB_DBT_MALLOC | DB_DBT_DUPOK |
DB_DBT_REALLOC | DB_DBT_USERMEM | DB_DBT_PARTIAL)) != 0)
return (ret);
switch (F_ISSET(dbt, DB_DBT_MALLOC | DB_DBT_REALLOC | DB_DBT_USERMEM)) {
case 0:
case DB_DBT_MALLOC:
case DB_DBT_REALLOC:
case DB_DBT_USERMEM:
break;
default:
return (__db_ferr(dbenv, name, 1));
}
if (check_thread && DB_IS_THREADED(dbp) &&
!F_ISSET(dbt, DB_DBT_MALLOC | DB_DBT_REALLOC | DB_DBT_USERMEM)) {
__db_err(dbenv,
"DB_THREAD mandates memory allocation flag on DBT %s",
name);
return (EINVAL);
}
return (0);
}
/*
* __db_rdonly --
* Common readonly message.
*/
static int
__db_rdonly(dbenv, name)
const DB_ENV *dbenv;
const char *name;
{
__db_err(dbenv, "%s: attempt to modify a read-only tree", name);
return (EACCES);
}
/*
* __db_curinval
* Report that a cursor is in an invalid state.
*/
static int
__db_curinval(dbenv)
const DB_ENV *dbenv;
{
__db_err(dbenv,
"Cursor position must be set before performing this operation");
return (EINVAL);
}
|