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
|
# Copyright (C) 2004, 2005 by Martin Pool
# Copyright (C) 2005 by Canonical Ltd
# 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
######################################################################
# consistency checks
import bzrlib
def _ass(a, b):
if a != b:
bzrlib.errors.bailout("check failed: %r != %r" % (a, b))
def check(branch, verbose=True):
print 'checking tree %r' % branch.base
print 'checking entire revision history is present'
last_ptr = None
for rid in branch.revision_history():
print ' revision {%s}' % rid
rev = branch.get_revision(rid)
_ass(rev.revision_id, rid)
_ass(rev.precursor, last_ptr)
last_ptr = rid
#mutter("checking tree")
#check_patches_exist()
#check_patch_chaining()
#check_patch_uniqueness()
#check_inventory()
print ("tree looks OK")
## TODO: Check that previous-inventory and previous-manifest
## are the same as those stored in the previous changeset.
## TODO: Check all patches present in patch directory are
## mentioned in patch history; having an orphaned patch only gives
## a warning.
## TODO: Check cached data is consistent with data reconstructed
## from scratch.
## TODO: Check no control files are versioned.
## TODO: Check that the before-hash of each file in a later
## revision matches the after-hash in the previous revision to
## touch it.
def check_inventory():
mutter("checking inventory file and ids...")
seen_ids = Set()
seen_names = Set()
for l in controlfile('inventory').readlines():
parts = l.split()
if len(parts) != 2:
bailout("malformed inventory line: " + `l`)
file_id, name = parts
if file_id in seen_ids:
bailout("duplicated file id " + file_id)
seen_ids.add(file_id)
if name in seen_names:
bailout("duplicated file name in inventory: " + quotefn(name))
seen_names.add(name)
if is_control_file(name):
raise BzrError("control file %s present in inventory" % quotefn(name))
def check_patches_exist():
"""Check constraint of current version: all patches exist"""
mutter("checking all patches are present...")
for pid in revision_history():
read_patch_header(pid)
def check_patch_chaining():
"""Check ancestry of patches and history file is consistent"""
mutter("checking patch chaining...")
prev = None
for pid in revision_history():
log_prev = read_patch_header(pid).precursor
if log_prev != prev:
bailout("inconsistent precursor links on " + pid)
prev = pid
def check_patch_uniqueness():
"""Make sure no patch is listed twice in the history.
This should be implied by having correct ancestry but I'll check it
anyhow."""
mutter("checking history for duplicates...")
seen = Set()
for pid in revision_history():
if pid in seen:
bailout("patch " + pid + " appears twice in history")
seen.add(pid)
|