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
|
/* btreecheck.h: Btree checking
*
* Copyright 1999,2000,2001 BrightStation PLC
* Copyright 2002 Ananova Ltd
* Copyright 2002,2004,2005,2006 Olly Betts
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
* USA
*/
#ifndef OM_HGUARD_BTREECHECK_H
#define OM_HGUARD_BTREECHECK_H
#include "btree.h"
#include <iostream>
#include <string>
class BtreeCheck : public Btree {
public:
static void check(const string & name, int opts,
std::ostream &out = std::cout);
private:
BtreeCheck(const std::string &name_, bool readonly, std::ostream &out_)
: Btree(name_, readonly), out(out_) { }
void block_check(Cursor * C_, int j, int opts);
int block_usage(const byte * p) const;
void report_block(int m, int n, const byte * p) const;
void report_block_full(int m, int n, const byte * p) const;
void report_cursor(int N, const Cursor *C_) const;
void failure(int n) const;
void print_key(const byte * p, int c, int j) const;
void print_tag(const byte * p, int c, int j) const;
void print_spaces(int n) const;
void print_bytes(int n, const byte * p) const;
mutable std::ostream &out;
};
#define OPT_SHORT_TREE 1
#define OPT_FULL_TREE 2
#define OPT_SHOW_BITMAP 4
#define OPT_SHOW_STATS 8
#endif /* OM_HGUARD_BTREECHECK_H */
|
