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
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 1996, 1997
* Sleepycat Software. All rights reserved.
*/
/*
* Copyright (c) 1995, 1996
* The President and Fellows of Harvard University. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Margo Seltzer.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "config.h"
#ifndef lint
static const char sccsid[] = "@(#)txn.c 10.39 (Sleepycat) 1/8/98";
#endif /* not lint */
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <errno.h>
#include <fcntl.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#endif
#include "shqueue.h"
#include "db_int.h"
#include "db_page.h"
#include "db_shash.h"
#include "txn.h"
#include "db_dispatch.h"
#include "lock.h"
#include "log.h"
#include "db_am.h"
#include "common_ext.h"
static int __txn_check_running __P((const DB_TXN *));
static int __txn_create __P((DB_ENV *, const char *, u_int));
static int __txn_end __P((DB_TXN *, int));
static int __txn_grow_region __P((DB_TXNMGR *));
static int __txn_undo __P((DB_TXN *));
static int __txn_validate_region __P((DB_TXNMGR *));
/*
* This file contains the top level routines of the transaction library.
* It assumes that a lock manager and log manager that conform to the db_log(3)
* and db_lock(3) interfaces exist.
*
* Create and initialize a transaction region in shared memory.
* Return 0 on success, errno on failure.
*/
static int
__txn_create(dbenv, path, mode)
DB_ENV *dbenv;
const char *path;
u_int mode;
{
DB_TXNREGION *txn_region;
time_t now;
int fd, maxtxns, ret;
maxtxns = dbenv->tx_max != 0 ? dbenv->tx_max : 1000;
(void)time(&now);
/* Region may have existed. If it didn't, the open will fail. */
if ((ret = __db_rcreate(dbenv, DB_APP_NONE, path, DEFAULT_TXN_FILE,
mode, TXN_REGION_SIZE(maxtxns), 0, &fd, &txn_region)) != 0)
return (ret);
txn_region->magic = DB_TXNMAGIC;
txn_region->version = DB_TXNVERSION;
txn_region->maxtxns = maxtxns;
txn_region->last_txnid = TXN_MINIMUM;
/* XXX If we ever do more types of locking and logging, this changes. */
txn_region->logtype = 0;
txn_region->locktype = 0;
txn_region->time_ckp = now;
ZERO_LSN(txn_region->last_ckp);
ZERO_LSN(txn_region->pending_ckp);
SH_TAILQ_INIT(&txn_region->active_txn);
__db_shalloc_init((void *)&txn_region[1],
TXN_REGION_SIZE(maxtxns) - sizeof(DB_TXNREGION));
/* Unlock the region. */
(void)__db_mutex_unlock(&txn_region->hdr.lock, fd);
/* Now unmap and close the region. */
if ((ret = __db_rclose(dbenv, fd, txn_region)) != 0) {
(void)txn_unlink(path, 1 /* force */, dbenv);
return (ret);
}
return (0);
}
int
txn_open(path, flags, mode, dbenv, mgrpp)
const char *path;
int flags, mode;
DB_ENV *dbenv;
DB_TXNMGR **mgrpp;
{
DB_TXNMGR *tmgrp;
DB_TXNREGION *txn_regionp;
int fd, ret, retry_cnt;
tmgrp = NULL;
txn_regionp = NULL;
fd = -1;
/* Validate arguments. */
if (dbenv == NULL)
return (EINVAL);
#ifdef HAVE_SPINLOCKS
#define OKFLAGS (DB_CREATE | DB_THREAD | DB_TXN_NOSYNC)
#else
#define OKFLAGS (DB_CREATE | DB_TXN_NOSYNC)
#endif
if ((ret = __db_fchk(dbenv, "txn_open", flags, OKFLAGS)) != 0)
return (ret);
retry_cnt = 0;
retry: if (LF_ISSET(DB_CREATE) && (ret = __txn_create(dbenv, path, mode)) != 0)
if (ret == EAGAIN && ++retry_cnt < 0) {
(void)__db_sleep(1, 0);
goto retry;
} else /* We did not really create the region */
flags &= ~DB_CREATE;
retry_cnt = 0;
retry1: if ((ret = __db_ropen(dbenv, DB_APP_NONE, path, DEFAULT_TXN_FILE,
flags & ~(DB_CREATE | DB_THREAD | DB_TXN_NOSYNC),
&fd, &txn_regionp)) != 0) {
if (ret == EAGAIN && ++retry_cnt < 3) {
(void)__db_sleep(1, 0);
goto retry1;
}
goto out;
}
/* Check if valid region. */
if (txn_regionp->magic != DB_TXNMAGIC) {
__db_err(dbenv, "txn_open: Bad magic number");
ret = EINVAL;
goto out;
}
/* Now, create the transaction manager structure and set its fields. */
if ((tmgrp = (DB_TXNMGR *)__db_malloc(sizeof(DB_TXNMGR))) == NULL) {
__db_err(dbenv, "txn_open: %s", strerror(ENOMEM));
ret = ENOMEM;
goto out;
}
tmgrp->dbenv = dbenv;
tmgrp->recover =
dbenv->tx_recover == NULL ? __db_dispatch : dbenv->tx_recover;
tmgrp->region = txn_regionp;
tmgrp->reg_size = txn_regionp->hdr.size;
tmgrp->fd = fd;
tmgrp->flags = LF_ISSET(DB_TXN_NOSYNC | DB_THREAD);
tmgrp->mem = &txn_regionp[1];
tmgrp->mutexp = NULL;
TAILQ_INIT(&tmgrp->txn_chain);
if (LF_ISSET(DB_THREAD)) {
LOCK_TXNREGION(tmgrp);
if ((ret = __db_shalloc(tmgrp->mem, sizeof(db_mutex_t),
MUTEX_ALIGNMENT, &tmgrp->mutexp)) == 0)
/*
* Since we only get here if threading is turned on, we
* know that we have spinlocks, so the offset is going
* to be ignored. We put 0 here as a valid placeholder.
*/
__db_mutex_init(tmgrp->mutexp, 0);
UNLOCK_TXNREGION(tmgrp);
if (ret != 0)
goto out;
}
*mgrpp = tmgrp;
return (0);
out: if (txn_regionp != NULL)
(void)__db_rclose(dbenv, fd, txn_regionp);
if (flags & DB_CREATE)
(void)txn_unlink(path, 1, dbenv);
if (tmgrp != NULL) {
if (tmgrp->mutexp != NULL) {
LOCK_TXNREGION(tmgrp);
__db_shalloc_free(tmgrp->mem, tmgrp->mutexp);
UNLOCK_TXNREGION(tmgrp);
}
__db_free(tmgrp);
}
return (ret);
}
/*
* Internally, we use TXN_DETAIL structures, but we allocate and return
* DB_TXN structures that provide access to the transaction ID and the
* offset in the transaction region of the TXN_DETAIL structure.
*/
int
txn_begin(tmgrp, parent, txnpp)
DB_TXNMGR *tmgrp;
DB_TXN *parent;
DB_TXN **txnpp;
{
TXN_DETAIL *txnp;
DB_TXN *retp;
int id, ret;
LOCK_TXNREGION(tmgrp);
if ((ret = __txn_validate_region(tmgrp)) != 0)
goto err;
/* Allocate a new transaction detail structure. */
if ((ret = __db_shalloc(tmgrp->mem, sizeof(TXN_DETAIL), 0, &txnp)) != 0
&& ret == ENOMEM && (ret = __txn_grow_region(tmgrp)) == 0)
ret = __db_shalloc(tmgrp->mem, sizeof(TXN_DETAIL), 0, &txnp);
if (ret != 0)
goto err;
/* Make sure that last_txnid is not going to wrap around. */
if (tmgrp->region->last_txnid == TXN_INVALID)
return (EINVAL);
if ((retp = (DB_TXN *)__db_malloc(sizeof(DB_TXN))) == NULL) {
__db_err(tmgrp->dbenv, "txn_begin : %s", strerror(ENOMEM));
ret = ENOMEM;
goto err1;
}
id = ++tmgrp->region->last_txnid;
tmgrp->region->nbegins++;
txnp->txnid = id;
ZERO_LSN(txnp->last_lsn);
ZERO_LSN(txnp->begin_lsn);
txnp->last_lock = 0;
txnp->status = TXN_RUNNING;
SH_TAILQ_INSERT_HEAD(&tmgrp->region->active_txn,
txnp, links, __txn_detail);
UNLOCK_TXNREGION(tmgrp);
ZERO_LSN(retp->last_lsn);
retp->txnid = id;
retp->parent = parent;
retp->off = (u_int8_t *)txnp - (u_int8_t *)tmgrp->region;
retp->mgrp = tmgrp;
if (tmgrp->dbenv->lg_info != NULL &&
(ret = __txn_regop_log(tmgrp->dbenv->lg_info,
retp, &txnp->begin_lsn, 0, TXN_BEGIN)) != 0) {
/* Deallocate transaction. */
LOCK_TXNREGION(tmgrp);
SH_TAILQ_REMOVE(&tmgrp->region->active_txn,
txnp, links, __txn_detail);
__db_shalloc_free(tmgrp->mem, txnp);
UNLOCK_TXNREGION(tmgrp);
__db_free(retp);
return (ret);
}
LOCK_TXNTHREAD(tmgrp);
TAILQ_INSERT_TAIL(&tmgrp->txn_chain, retp, links);
UNLOCK_TXNTHREAD(tmgrp);
*txnpp = retp;
return (0);
err1:
__db_shalloc_free(tmgrp->mem, txnp);
err:
UNLOCK_TXNREGION(tmgrp);
return (ret);
}
/*
* txn_commit --
* Commit a transaction.
*/
int
txn_commit(txnp)
DB_TXN *txnp;
{
DB_LOG *logp;
int ret;
if ((ret = __txn_check_running(txnp)) != 0)
return (ret);
/* Sync the log. */
if ((logp = txnp->mgrp->dbenv->lg_info) != NULL &&
(ret = __txn_regop_log(logp,
txnp, &txnp->last_lsn,
F_ISSET(txnp->mgrp, DB_TXN_NOSYNC) ? 0 : DB_FLUSH, TXN_COMMIT))
!= 0)
return (ret);
return (__txn_end(txnp, 1));
}
/*
* txn_abort --
* Abort a transcation.
*/
int
txn_abort(txnp)
DB_TXN *txnp;
{
int ret;
if ((ret = __txn_check_running(txnp)) != 0)
return (ret);
if ((ret = __txn_undo(txnp)) != 0) {
__db_err(txnp->mgrp->dbenv,
"txn_abort: Log undo failed %s", strerror(ret));
return (ret);
}
return (__txn_end(txnp, 0));
}
/*
* Flush the log so a future commit is guaranteed to succeed.
*/
int
txn_prepare(txnp)
DB_TXN *txnp;
{
int ret;
TXN_DETAIL *tp;
if ((ret = __txn_check_running(txnp)) != 0)
return (ret);
if (txnp->mgrp->dbenv->lg_info != NULL) {
if ((ret = log_flush(txnp->mgrp->dbenv->lg_info,
&txnp->last_lsn)) != 0)
__db_err(txnp->mgrp->dbenv,
"txn_prepare: log_flush failed %s\n",
strerror(ret));
return (ret);
}
LOCK_TXNTHREAD(txnp->mgrp);
tp = (TXN_DETAIL *)((u_int8_t *)txnp->mgrp->region + txnp->off);
tp->status = TXN_PREPARED;
UNLOCK_TXNTHREAD(txnp->mgrp);
return (ret);
}
/*
* Return the transaction ID associated with a particular transaction
*/
u_int32_t
txn_id(txnp)
DB_TXN *txnp;
{
return (txnp->txnid);
}
/*
* txn_close --
* Close the transaction region, does not imply a checkpoint.
*/
int
txn_close(tmgrp)
DB_TXNMGR *tmgrp;
{
DB_TXN *txnp;
int ret, t_ret;
/*
* This function had better only be called once per process
* (i.e., not per thread), so there should be no synchronization
* required.
*/
for (ret = 0, txnp = TAILQ_FIRST(&tmgrp->txn_chain);
txnp != TAILQ_END(&tmgrp->txn_chain);
txnp = TAILQ_FIRST(&tmgrp->txn_chain)) {
if ((t_ret = txn_abort(txnp)) != 0 && ret == 0)
ret = t_ret;
}
if (tmgrp->dbenv->lg_info && (t_ret =
log_flush(tmgrp->dbenv->lg_info, NULL)) != 0 &&
ret == 0)
ret = t_ret;
if (tmgrp->mutexp != NULL) {
LOCK_TXNREGION(tmgrp);
__db_shalloc_free(tmgrp->mem, tmgrp->mutexp);
UNLOCK_TXNREGION(tmgrp);
}
if ((t_ret = __db_rclose(tmgrp->dbenv, tmgrp->fd, tmgrp->region)) != 0
&& ret == 0)
ret = t_ret;
if (ret == 0)
__db_free(tmgrp);
return (ret);
}
/*
* txn_unlink --
* Remove the transaction region.
*/
int
txn_unlink(path, force, dbenv)
const char *path;
int force;
DB_ENV *dbenv;
{
return (__db_runlink(dbenv,
DB_APP_NONE, path, DEFAULT_TXN_FILE, force));
}
/* Internal routines. */
/*
* Return 0 if the txnp is reasonable, otherwise returns EINVAL.
*/
static int
__txn_check_running(txnp)
const DB_TXN *txnp;
{
TXN_DETAIL *tp;
tp = NULL;
if (txnp != NULL && txnp->mgrp != NULL && txnp->mgrp->region != NULL) {
tp = (TXN_DETAIL *)((u_int8_t *)txnp->mgrp->region + txnp->off);
if (tp->status != TXN_RUNNING)
tp = NULL;
}
return (tp == NULL ? EINVAL : 0);
}
static int
__txn_end(txnp, is_commit)
DB_TXN *txnp;
int is_commit;
{
DB_TXNMGR *mgr;
TXN_DETAIL *tp;
DB_LOCKREQ request;
int ret;
u_int32_t locker;
mgr = txnp->mgrp;
LOCK_TXNTHREAD(mgr);
TAILQ_REMOVE(&mgr->txn_chain, txnp, links);
UNLOCK_TXNTHREAD(mgr);
/* Release the locks. */
locker = txnp->txnid;
request.op = DB_LOCK_PUT_ALL;
if (mgr->dbenv->lk_info) {
ret = lock_vec(mgr->dbenv->lk_info, locker, 0,
&request, 1, NULL);
if (ret != 0 && (ret != DB_LOCK_DEADLOCK || is_commit)) {
__db_err(mgr->dbenv, "%s: release locks failed %s",
is_commit ? "txn_commit" : "txn_abort",
strerror(ret));
return (ret);
}
}
/* End the transaction. */
LOCK_TXNREGION(mgr);
tp = (TXN_DETAIL *)((u_int8_t *)mgr->region + txnp->off);
SH_TAILQ_REMOVE(&mgr->region->active_txn, tp, links, __txn_detail);
__db_shalloc_free(mgr->mem, tp);
if (is_commit)
mgr->region->ncommits++;
else
mgr->region->naborts++;
UNLOCK_TXNREGION(mgr);
FREE(txnp, sizeof(*txnp));
return (0);
}
/*
* __txn_undo --
* Undo the transaction with id txnid. Returns 0 on success and
* errno on failure.
*/
static int
__txn_undo(txnp)
DB_TXN *txnp;
{
DB_TXNMGR *mgr;
DB_LOG *logp;
DBT rdbt;
DB_LSN key_lsn;
int ret;
mgr = txnp->mgrp;
logp = mgr->dbenv->lg_info;
if (logp == NULL)
return (0);
/*
* This is the simplest way to code this, but if the mallocs during
* recovery turn out to be a performance issue, we can do the
* allocation here and use DB_DBT_USERMEM.
*/
memset(&rdbt, 0, sizeof(rdbt));
if (F_ISSET(logp, DB_AM_THREAD))
F_SET(&rdbt, DB_DBT_MALLOC);
key_lsn = txnp->last_lsn; /* structure assignment */
for (ret = 0; ret == 0 && !IS_ZERO_LSN(key_lsn);) {
/*
* The dispatch routine returns the lsn of the record
* before the current one in the key_lsn argument.
*/
if ((ret = log_get(logp, &key_lsn, &rdbt, DB_SET)) == 0) {
ret =
mgr->recover(logp, &rdbt, &key_lsn, TXN_UNDO, NULL);
if (F_ISSET(logp, DB_AM_THREAD) && rdbt.data != NULL) {
__db_free(rdbt.data);
rdbt.data = NULL;
}
}
if (ret != 0)
return (ret);
}
return (ret);
}
/*
* Transaction checkpoint.
* If either kbytes or minutes is non-zero, then we only take the checkpoint
* more than "minutes" minutes have passed since the last checkpoint or if
* more than "kbytes" of log data have been written since the last checkpoint.
* When taking a checkpoint, find the oldest active transaction and figure out
* its first LSN. This is the lowest LSN we can checkpoint, since any record
* written after since that point may be involved in a transaction and may
* therefore need to be undone in the case of an abort.
*/
int
txn_checkpoint(mgr, kbytes, minutes)
const DB_TXNMGR *mgr;
int kbytes, minutes;
{
TXN_DETAIL *txnp;
DB_LSN ckp_lsn, last_ckp;
DB_LOG *dblp;
u_int32_t kbytes_written;
time_t last_ckp_time, now;
int ret;
/* Check usage. */
if (kbytes < 0 || minutes < 0)
return (EINVAL);
/*
* Check if we need to run recovery.
*/
ZERO_LSN(ckp_lsn);
if (minutes != 0) {
(void)time(&now);
LOCK_TXNREGION(mgr);
last_ckp_time = mgr->region->time_ckp;
UNLOCK_TXNREGION(mgr);
if (now - last_ckp_time >= (time_t)(minutes * 60))
goto do_ckp;
}
if (kbytes != 0) {
dblp = mgr->dbenv->lg_info;
LOCK_LOGREGION(dblp);
kbytes_written =
dblp->lp->stat.st_wc_mbytes * 1024 +
dblp->lp->stat.st_wc_bytes / 1024;
ckp_lsn = dblp->lp->lsn;
UNLOCK_LOGREGION(dblp);
if (kbytes_written >= (u_int32_t)kbytes)
goto do_ckp;
}
/*
* If we checked time and data and didn't go to checkpoint,
* we're done.
*/
if (minutes != 0 || kbytes != 0)
return (0);
do_ckp:
if (IS_ZERO_LSN(ckp_lsn)) {
dblp = mgr->dbenv->lg_info;
LOCK_LOGREGION(dblp);
ckp_lsn = dblp->lp->lsn;
UNLOCK_LOGREGION(dblp);
}
/*
* We have to find an LSN such that all transactions begun
* before that LSN are complete.
*/
LOCK_TXNREGION(mgr);
if (!IS_ZERO_LSN(mgr->region->pending_ckp))
ckp_lsn = mgr->region->pending_ckp;
else
for (txnp =
SH_TAILQ_FIRST(&mgr->region->active_txn, __txn_detail);
txnp != NULL;
txnp = SH_TAILQ_NEXT(txnp, links, __txn_detail)) {
/*
* Look through the active transactions for the
* lowest begin lsn.
*/
if (!IS_ZERO_LSN(txnp->begin_lsn) &&
log_compare(&txnp->begin_lsn, &ckp_lsn) < 0)
ckp_lsn = txnp->begin_lsn;
}
mgr->region->pending_ckp = ckp_lsn;
UNLOCK_TXNREGION(mgr);
if (mgr->dbenv->mp_info != NULL &&
(ret = memp_sync(mgr->dbenv->mp_info, &ckp_lsn)) != 0) {
/*
* ret < 0 means that there are still buffers to flush;
* the checkpoint is not complete. Back off and try again.
*/
if (ret > 0)
__db_err(mgr->dbenv,
"txn_checkpoint: system failure in memp_sync %s\n",
strerror(ret));
return (ret);
}
if (mgr->dbenv->lg_info != NULL) {
LOCK_TXNREGION(mgr);
last_ckp = mgr->region->last_ckp;
ZERO_LSN(mgr->region->pending_ckp);
UNLOCK_TXNREGION(mgr);
if ((ret = __txn_ckp_log(mgr->dbenv->lg_info,
NULL, &ckp_lsn, DB_CHECKPOINT, &ckp_lsn, &last_ckp)) != 0) {
__db_err(mgr->dbenv,
"txn_checkpoint: log failed at LSN [%ld %ld] %s\n",
(long)ckp_lsn.file, (long)ckp_lsn.offset,
strerror(ret));
return (ret);
}
LOCK_TXNREGION(mgr);
mgr->region->last_ckp = ckp_lsn;
(void)time(&mgr->region->time_ckp);
UNLOCK_TXNREGION(mgr);
}
return (0);
}
/*
* This is called at every interface to verify if the region
* has changed size, and if so, to remap the region in and
* reset the process pointers.
*/
static int
__txn_validate_region(tp)
DB_TXNMGR *tp;
{
int ret;
if (tp->reg_size == tp->region->hdr.size)
return (0);
/* Grow the region. */
if ((ret = __db_rremap(tp->dbenv, tp->region,
tp->reg_size, tp->region->hdr.size, tp->fd, &tp->region)) != 0)
return (ret);
tp->reg_size = tp->region->hdr.size;
tp->mem = &tp->region[1];
return (0);
}
static int
__txn_grow_region(tp)
DB_TXNMGR *tp;
{
size_t incr;
u_int32_t mutex_offset, oldmax;
u_int8_t *curaddr;
int ret;
oldmax = tp->region->maxtxns;
incr = oldmax * sizeof(DB_TXN);
mutex_offset = (u_int8_t *)tp->mutexp - (u_int8_t *)tp->region;
if ((ret = __db_rgrow(tp->dbenv, tp->fd, incr)) != 0)
return (ret);
if ((ret = __db_rremap(tp->dbenv, tp->region,
tp->reg_size, tp->reg_size + incr, tp->fd, &tp->region)) != 0)
return (ret);
/* Throw the new space on the free list. */
curaddr = (u_int8_t *)tp->region + tp->reg_size;
tp->mem = &tp->region[1];
tp->reg_size += incr;
tp->mutexp = (db_mutex_t *)((u_int8_t *)tp->region + mutex_offset);
*((size_t *)curaddr) = incr - sizeof(size_t);
curaddr += sizeof(size_t);
__db_shalloc_free(tp->mem, curaddr);
tp->region->maxtxns = 2 * oldmax;
return (0);
}
int
txn_stat(mgr, statp, db_malloc)
DB_TXNMGR *mgr;
DB_TXN_STAT **statp;
void *(*db_malloc) __P((size_t));
{
DB_TXN_STAT *stats;
TXN_DETAIL *txnp;
size_t nbytes;
u_int32_t nactive, ndx;
LOCK_TXNREGION(mgr);
nactive = mgr->region->nbegins -
mgr->region->naborts - mgr->region->ncommits;
UNLOCK_TXNREGION(mgr);
/*
* Allocate a bunch of extra active structures to handle any
* that have been created since we unlocked the region.
*/
nbytes = sizeof(DB_TXN_STAT) + sizeof(DB_TXN_ACTIVE) * (nactive + 200);
if (db_malloc == NULL)
stats = (DB_TXN_STAT *)__db_malloc(nbytes);
else
stats = (DB_TXN_STAT *)db_malloc(nbytes);
if (stats == NULL)
return (ENOMEM);
LOCK_TXNREGION(mgr);
stats->st_last_txnid = mgr->region->last_txnid;
stats->st_last_ckp = mgr->region->last_ckp;
stats->st_maxtxns = mgr->region->maxtxns;
stats->st_naborts = mgr->region->naborts;
stats->st_nbegins = mgr->region->nbegins;
stats->st_ncommits = mgr->region->ncommits;
stats->st_pending_ckp = mgr->region->pending_ckp;
stats->st_time_ckp = mgr->region->time_ckp;
stats->st_nactive = stats->st_nbegins -
stats->st_naborts - stats->st_ncommits;
if (stats->st_nactive > nactive + 200)
stats->st_nactive = nactive + 200;
stats->st_txnarray = (DB_TXN_ACTIVE *)&stats[1];
ndx = 0;
for (txnp = SH_TAILQ_FIRST(&mgr->region->active_txn, __txn_detail);
txnp != NULL;
txnp = SH_TAILQ_NEXT(txnp, links, __txn_detail)) {
stats->st_txnarray[ndx].txnid = txnp->txnid;
stats->st_txnarray[ndx].lsn = txnp->begin_lsn;
ndx++;
if (ndx >= stats->st_nactive)
break;
}
UNLOCK_TXNREGION(mgr);
*statp = stats;
return (0);
}
|