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
|
/*-
* Copyright (c) 2014-2015 MongoDB, Inc.
* Copyright (c) 2008-2014 WiredTiger, Inc.
* All rights reserved.
*
* See the file LICENSE for redistribution information.
*/
#include "wt_internal.h"
static int __stat_page(WT_SESSION_IMPL *, WT_PAGE *, WT_DSRC_STATS *);
static int __stat_page_col_var(WT_PAGE *, WT_DSRC_STATS *);
static int __stat_page_row_leaf(WT_PAGE *, WT_DSRC_STATS *);
/*
* __wt_btree_stat_init --
* Initialize the Btree statistics.
*/
int
__wt_btree_stat_init(WT_SESSION_IMPL *session, WT_CURSOR_STAT *cst)
{
WT_BM *bm;
WT_BTREE *btree;
WT_DECL_RET;
WT_DSRC_STATS *stats;
WT_REF *next_walk;
btree = S2BT(session);
bm = btree->bm;
stats = &btree->dhandle->stats;
WT_RET(bm->stat(bm, session, stats));
WT_STAT_SET(stats, btree_fixed_len, btree->bitcnt);
WT_STAT_SET(stats, btree_maximum_depth, btree->maximum_depth);
WT_STAT_SET(stats, btree_maxintlpage, btree->maxintlpage);
WT_STAT_SET(stats, btree_maxintlkey, btree->maxintlkey);
WT_STAT_SET(stats, btree_maxleafpage, btree->maxleafpage);
WT_STAT_SET(stats, btree_maxleafkey, btree->maxleafkey);
WT_STAT_SET(stats, btree_maxleafvalue, btree->maxleafvalue);
/* Everything else is really, really expensive. */
if (!F_ISSET(cst, WT_CONN_STAT_ALL))
return (0);
/*
* Clear the statistics we're about to count.
*/
WT_STAT_SET(stats, btree_column_deleted, 0);
WT_STAT_SET(stats, btree_column_fix, 0);
WT_STAT_SET(stats, btree_column_internal, 0);
WT_STAT_SET(stats, btree_column_variable, 0);
WT_STAT_SET(stats, btree_entries, 0);
WT_STAT_SET(stats, btree_overflow, 0);
WT_STAT_SET(stats, btree_row_internal, 0);
WT_STAT_SET(stats, btree_row_leaf, 0);
next_walk = NULL;
while ((ret = __wt_tree_walk(session, &next_walk, NULL, 0)) == 0 &&
next_walk != NULL) {
WT_WITH_PAGE_INDEX(session,
ret = __stat_page(session, next_walk->page, stats));
WT_RET(ret);
}
return (ret == WT_NOTFOUND ? 0 : ret);
}
/*
* __stat_page --
* Stat any Btree page.
*/
static int
__stat_page(WT_SESSION_IMPL *session, WT_PAGE *page, WT_DSRC_STATS *stats)
{
WT_PAGE_INDEX *pindex;
/*
* All internal pages and overflow pages are trivial, all we track is
* a count of the page type.
*/
switch (page->type) {
case WT_PAGE_COL_FIX:
WT_STAT_INCR(stats, btree_column_fix);
WT_STAT_INCRV(stats, btree_entries, page->pg_fix_entries);
break;
case WT_PAGE_COL_INT:
WT_STAT_INCR(stats, btree_column_internal);
pindex = WT_INTL_INDEX_COPY(page);
WT_STAT_INCRV(stats, btree_entries, pindex->entries);
break;
case WT_PAGE_COL_VAR:
WT_RET(__stat_page_col_var(page, stats));
break;
case WT_PAGE_OVFL:
WT_STAT_INCR(stats, btree_overflow);
break;
case WT_PAGE_ROW_INT:
WT_STAT_INCR(stats, btree_row_internal);
pindex = WT_INTL_INDEX_COPY(page);
WT_STAT_INCRV(stats, btree_entries, pindex->entries);
break;
case WT_PAGE_ROW_LEAF:
WT_RET(__stat_page_row_leaf(page, stats));
break;
WT_ILLEGAL_VALUE(session);
}
return (0);
}
/*
* __stat_page_col_var --
* Stat a WT_PAGE_COL_VAR page.
*/
static int
__stat_page_col_var(WT_PAGE *page, WT_DSRC_STATS *stats)
{
WT_CELL *cell;
WT_CELL_UNPACK *unpack, _unpack;
WT_COL *cip;
WT_INSERT *ins;
WT_UPDATE *upd;
uint32_t i;
int orig_deleted;
unpack = &_unpack;
WT_STAT_INCR(stats, btree_column_variable);
/*
* Walk the page, counting regular and overflow data items, and checking
* to be sure any updates weren't deletions. If the item was updated,
* assume it was updated by an item of the same size (it's expensive to
* figure out if it will require the same space or not, especially if
* there's Huffman encoding).
*/
WT_COL_FOREACH(page, cip, i) {
if ((cell = WT_COL_PTR(page, cip)) == NULL) {
orig_deleted = 1;
WT_STAT_INCR(stats, btree_column_deleted);
} else {
orig_deleted = 0;
__wt_cell_unpack(cell, unpack);
WT_STAT_INCRV(
stats, btree_entries, __wt_cell_rle(unpack));
}
/*
* Walk the insert list, checking for changes. For each insert
* we find, correct the original count based on its state.
*/
WT_SKIP_FOREACH(ins, WT_COL_UPDATE(page, cip)) {
upd = ins->upd;
if (WT_UPDATE_DELETED_ISSET(upd)) {
if (orig_deleted)
continue;
WT_STAT_INCR(stats, btree_column_deleted);
WT_STAT_DECR(stats, btree_entries);
} else {
if (!orig_deleted)
continue;
WT_STAT_DECR(stats, btree_column_deleted);
WT_STAT_INCR(stats, btree_entries);
}
}
}
return (0);
}
/*
* __stat_page_row_leaf --
* Stat a WT_PAGE_ROW_LEAF page.
*/
static int
__stat_page_row_leaf(WT_PAGE *page, WT_DSRC_STATS *stats)
{
WT_INSERT *ins;
WT_ROW *rip;
WT_UPDATE *upd;
uint32_t cnt, i;
WT_STAT_INCR(stats, btree_row_leaf);
/*
* Stat any K/V pairs inserted into the page before the first from-disk
* key on the page.
*/
cnt = 0;
WT_SKIP_FOREACH(ins, WT_ROW_INSERT_SMALLEST(page))
if (!WT_UPDATE_DELETED_ISSET(ins->upd))
++cnt;
/* Stat the page's K/V pairs. */
WT_ROW_FOREACH(page, rip, i) {
upd = WT_ROW_UPDATE(page, rip);
if (upd == NULL || !WT_UPDATE_DELETED_ISSET(upd))
++cnt;
/* Stat inserted K/V pairs. */
WT_SKIP_FOREACH(ins, WT_ROW_INSERT(page, rip))
if (!WT_UPDATE_DELETED_ISSET(ins->upd))
++cnt;
}
WT_STAT_INCRV(stats, btree_entries, cnt);
return (0);
}
|
