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
|
/*-
* Copyright (c) 2008-2012 WiredTiger, Inc.
* All rights reserved.
*
* See the file LICENSE for redistribution information.
*/
#define WT_BTREE_MAJOR_VERSION 1 /* Version */
#define WT_BTREE_MINOR_VERSION 0
/*
* The minimum btree leaf and internal page sizes are 512B, the maximum 512MB.
* (The maximum of 512MB is enforced by the software, it could be set as high
* as 4GB.)
*/
#define WT_BTREE_ALLOCATION_SIZE_MIN 512
#define WT_BTREE_ALLOCATION_SIZE_MAX (128 * WT_MEGABYTE)
#define WT_BTREE_PAGE_SIZE_MAX (512 * WT_MEGABYTE)
/*
* Variable-length value items and row-store key/value item lengths are stored
* in 32-bit unsigned integers, meaning the largest theoretical key/value item
* is 4GB. However, in the WT_UPDATE structure we use the UINT32_MAX size as a
* "deleted" flag. Limit the size of a single object to 4GB - 512B: it's a few
* additional bytes if we ever want to store a small structure length plus the
* object size in 32 bits, or if we ever need more denoted values. Storing 4GB
* objects in a Btree borders on clinical insanity, anyway.
*
* Record numbers are stored in 64-bit unsigned integers, meaning the largest
* record number is "really, really big".
*/
#define WT_BTREE_MAX_OBJECT_SIZE (UINT32_MAX - 512)
/*
* Split page size calculation -- we don't want to repeatedly split every time
* a new entry is added, so we split to a smaller-than-maximum page size.
*/
#define WT_SPLIT_PAGE_SIZE(pagesize, allocsize, pct) \
WT_ALIGN(((uintmax_t)(pagesize) * (pct)) / 100, allocsize)
/*
* XXX
* The server threads use their own WT_SESSION_IMPL handles because they may
* want to block (for example, the eviction server calls reconciliation, and
* some of the reconciliation diagnostic code reads pages), and the user's
* session handle is already blocking on a server thread. The problem is the
* server thread needs to reference the correct btree handle, and that's
* hanging off the application's thread of control. For now, I'm just making
* it obvious where that's getting done.
*/
#define WT_SET_BTREE_IN_SESSION(s, b) ((s)->btree = (b))
#define WT_CLEAR_BTREE_IN_SESSION(s) ((s)->btree = NULL)
/*
* WT_BTREE --
* A btree handle.
*/
struct __wt_btree {
WT_RWLOCK *rwlock; /* Lock for shared/exclusive ops */
uint32_t refcnt; /* Sessions using this tree. */
TAILQ_ENTRY(__wt_btree) q; /* Linked list of handles */
const char *name; /* Logical name */
const char *filename; /* File name */
const char *config; /* Configuration string */
enum { BTREE_COL_FIX=1, /* Fixed-length column store */
BTREE_COL_VAR=2, /* Variable-length column store */
BTREE_ROW=3 /* Row-store */
} type; /* Type */
const char *key_format; /* Key format */
const char *key_plan; /* Key projection plan */
const char *idxkey_format; /* Index key format (hides primary) */
const char *value_format; /* Value format */
const char *value_plan; /* Value projection plan */
uint8_t bitcnt; /* Fixed-length field size in bits */
/* Row-store comparison function */
WT_COLLATOR *collator; /* Comparison function */
uint32_t key_gap; /* Row-store prefix key gap */
uint32_t allocsize; /* Allocation size */
uint32_t maxintlpage; /* Internal page max size */
uint32_t maxintlitem; /* Internal page max item size */
uint32_t maxleafpage; /* Leaf page max size */
uint32_t maxleafitem; /* Leaf page max item size */
void *huffman_key; /* Key huffman encoding */
void *huffman_value; /* Value huffman encoding */
/*
* Column-store: track the last record in the file, and keep the last
* page pinned in memory for fast appends, to a skiplist of appended
* entries.
*/
WT_PAGE *last_page; /* Col-store append, last page */
uint64_t last_recno; /* Col-store append, last recno */
WT_SKIP_HEAD **append; /* Appended items */
WT_PAGE *root_page; /* Root page */
WT_ADDR root_addr; /* Replacement root address */
int root_update; /* 0: free original root blocks
1: free saved root blocks and
update on close */
void *block; /* Block manager */
u_int block_header; /* Block manager header length */
WT_PAGE *evict_page; /* Eviction thread's location */
WT_BTREE_STATS *stats; /* Btree statistics */
#define WT_BTREE_BULK 0x01 /* Bulk-load handle */
#define WT_BTREE_EXCLUSIVE 0x02 /* Need exclusive access to handle */
#define WT_BTREE_NO_LOCK 0x04 /* Do not lock the handle */
#define WT_BTREE_OPEN 0x08 /* Handle is open */
#define WT_BTREE_SALVAGE 0x10 /* Handle is for salvage */
#define WT_BTREE_UPGRADE 0x20 /* Handle is for upgrade */
#define WT_BTREE_VERIFY 0x40 /* Handle is for verify */
uint32_t flags;
};
/*
* In diagnostic mode we track the locations from which hazard references
* were acquired.
*/
#ifdef HAVE_DIAGNOSTIC
#define __wt_page_in(a, b, c) \
__wt_page_in_func(a, b, c, __FILE__, __LINE__)
#else
#define __wt_page_in(a, b, c) \
__wt_page_in_func(a, b, c)
#endif
/*
* WT_SALVAGE_COOKIE --
* Encapsulation of salvage information for reconciliation.
*/
struct __wt_salvage_cookie {
uint64_t missing; /* Initial items to create */
uint64_t skip; /* Initial items to skip */
uint64_t take; /* Items to take */
int done; /* Ignore the rest */
};
|
