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
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 1996-2002
* Sleepycat Software. All rights reserved.
*/
/*
* Copyright (c) 1995, 1996
* The President and Fellows of Harvard University. All rights reserved.
*
* 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. 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.
*
* $Id: db_dispatch.h,v 11.30 2002/06/20 19:34:03 margo Exp $
*/
#ifndef _DB_DISPATCH_H_
#define _DB_DISPATCH_H_
/*
* Declarations and typedefs for the list of transaction IDs used during
* recovery. This is a generic list used to pass along whatever information
* we need during recovery.
*/
typedef enum {
TXNLIST_DELETE,
TXNLIST_LSN,
TXNLIST_PGNO,
TXNLIST_TXNID
} db_txnlist_type;
#define DB_TXNLIST_MASK(hp, n) (n % hp->nslots)
struct __db_txnhead {
u_int32_t maxid; /* Maximum transaction id. */
DB_LSN maxlsn; /* Maximum commit lsn. */
DB_LSN ckplsn; /* LSN of last retained checkpoint. */
DB_LSN trunc_lsn; /* Lsn to which we are going to truncate;
* make sure we abort anyone after this. */
int32_t generation; /* Current generation number. */
int32_t gen_alloc; /* Number of generations allocated. */
struct {
int32_t generation;
u_int32_t txn_min;
u_int32_t txn_max;
} *gen_array; /* Array of txnids associted with a gen. */
int nslots;
LIST_HEAD(__db_headlink, __db_txnlist) head[1];
};
struct __db_txnlist {
db_txnlist_type type;
LIST_ENTRY(__db_txnlist) links;
union {
struct {
u_int32_t txnid;
int32_t generation;
int32_t status;
} t;
struct {
int32_t ntxns;
int32_t maxn;
DB_LSN *lsn_array;
} l;
struct {
int32_t nentries;
int32_t maxentry;
int32_t locked;
char *fname;
int32_t fileid;
db_pgno_t *pgno_array;
u_int8_t uid[DB_FILE_ID_LEN];
} p;
} u;
};
/*
* Flag value for __db_txnlist_lsnadd. Distinguish whether we are replacing
* an entry in the transaction list or adding a new one.
*/
#define TXNLIST_NEW 0x1
#define DB_user_BEGIN 10000
#endif /* !_DB_DISPATCH_H_ */
|
