Show More
@@ -1,305 +1,303 b'' | |||||
1 | # verify.py - repository integrity checking for Mercurial |
|
1 | # verify.py - repository integrity checking for Mercurial | |
2 | # |
|
2 | # | |
3 | # Copyright 2006, 2007 Matt Mackall <mpm@selenic.com> |
|
3 | # Copyright 2006, 2007 Matt Mackall <mpm@selenic.com> | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | from node import nullid, short |
|
8 | from node import nullid, short | |
9 | from i18n import _ |
|
9 | from i18n import _ | |
10 | import os |
|
10 | import os | |
11 | import revlog, util, error |
|
11 | import revlog, util, error | |
12 |
|
12 | |||
13 | def verify(repo): |
|
13 | def verify(repo): | |
14 | lock = repo.lock() |
|
14 | lock = repo.lock() | |
15 | try: |
|
15 | try: | |
16 | return _verify(repo) |
|
16 | return _verify(repo) | |
17 | finally: |
|
17 | finally: | |
18 | lock.release() |
|
18 | lock.release() | |
19 |
|
19 | |||
20 | def _verify(repo): |
|
20 | def _verify(repo): | |
21 | mflinkrevs = {} |
|
21 | mflinkrevs = {} | |
22 | filelinkrevs = {} |
|
22 | filelinkrevs = {} | |
23 | filenodes = {} |
|
23 | filenodes = {} | |
24 | revisions = 0 |
|
24 | revisions = 0 | |
25 | badrevs = set() |
|
25 | badrevs = set() | |
26 | errors = [0] |
|
26 | errors = [0] | |
27 | warnings = [0] |
|
27 | warnings = [0] | |
28 | ui = repo.ui |
|
28 | ui = repo.ui | |
29 | cl = repo.changelog |
|
29 | cl = repo.changelog | |
30 | mf = repo.manifest |
|
30 | mf = repo.manifest | |
31 | lrugetctx = util.lrucachefunc(repo.changectx) |
|
31 | lrugetctx = util.lrucachefunc(repo.changectx) | |
32 |
|
32 | |||
33 | if not repo.cancopy(): |
|
33 | if not repo.cancopy(): | |
34 | raise util.Abort(_("cannot verify bundle or remote repos")) |
|
34 | raise util.Abort(_("cannot verify bundle or remote repos")) | |
35 |
|
35 | |||
36 | def err(linkrev, msg, filename=None): |
|
36 | def err(linkrev, msg, filename=None): | |
37 | if linkrev is not None: |
|
37 | if linkrev is not None: | |
38 | badrevs.add(linkrev) |
|
38 | badrevs.add(linkrev) | |
39 | else: |
|
39 | else: | |
40 | linkrev = '?' |
|
40 | linkrev = '?' | |
41 | msg = "%s: %s" % (linkrev, msg) |
|
41 | msg = "%s: %s" % (linkrev, msg) | |
42 | if filename: |
|
42 | if filename: | |
43 | msg = "%s@%s" % (filename, msg) |
|
43 | msg = "%s@%s" % (filename, msg) | |
44 | ui.warn(" " + msg + "\n") |
|
44 | ui.warn(" " + msg + "\n") | |
45 | errors[0] += 1 |
|
45 | errors[0] += 1 | |
46 |
|
46 | |||
47 | def exc(linkrev, msg, inst, filename=None): |
|
47 | def exc(linkrev, msg, inst, filename=None): | |
48 | if isinstance(inst, KeyboardInterrupt): |
|
48 | if isinstance(inst, KeyboardInterrupt): | |
49 | ui.warn(_("interrupted")) |
|
49 | ui.warn(_("interrupted")) | |
50 | raise |
|
50 | raise | |
51 | if not str(inst): |
|
51 | if not str(inst): | |
52 | inst = repr(inst) |
|
52 | inst = repr(inst) | |
53 | err(linkrev, "%s: %s" % (msg, inst), filename) |
|
53 | err(linkrev, "%s: %s" % (msg, inst), filename) | |
54 |
|
54 | |||
55 | def warn(msg): |
|
55 | def warn(msg): | |
56 | ui.warn(msg + "\n") |
|
56 | ui.warn(msg + "\n") | |
57 | warnings[0] += 1 |
|
57 | warnings[0] += 1 | |
58 |
|
58 | |||
59 | def checklog(obj, name, linkrev): |
|
59 | def checklog(obj, name, linkrev): | |
60 | if not len(obj) and (havecl or havemf): |
|
60 | if not len(obj) and (havecl or havemf): | |
61 | err(linkrev, _("empty or missing %s") % name) |
|
61 | err(linkrev, _("empty or missing %s") % name) | |
62 | return |
|
62 | return | |
63 |
|
63 | |||
64 | d = obj.checksize() |
|
64 | d = obj.checksize() | |
65 | if d[0]: |
|
65 | if d[0]: | |
66 | err(None, _("data length off by %d bytes") % d[0], name) |
|
66 | err(None, _("data length off by %d bytes") % d[0], name) | |
67 | if d[1]: |
|
67 | if d[1]: | |
68 | err(None, _("index contains %d extra bytes") % d[1], name) |
|
68 | err(None, _("index contains %d extra bytes") % d[1], name) | |
69 |
|
69 | |||
70 | if obj.version != revlog.REVLOGV0: |
|
70 | if obj.version != revlog.REVLOGV0: | |
71 | if not revlogv1: |
|
71 | if not revlogv1: | |
72 | warn(_("warning: `%s' uses revlog format 1") % name) |
|
72 | warn(_("warning: `%s' uses revlog format 1") % name) | |
73 | elif revlogv1: |
|
73 | elif revlogv1: | |
74 | warn(_("warning: `%s' uses revlog format 0") % name) |
|
74 | warn(_("warning: `%s' uses revlog format 0") % name) | |
75 |
|
75 | |||
76 | def checkentry(obj, i, node, seen, linkrevs, f): |
|
76 | def checkentry(obj, i, node, seen, linkrevs, f): | |
77 | lr = obj.linkrev(obj.rev(node)) |
|
77 | lr = obj.linkrev(obj.rev(node)) | |
78 | if lr < 0 or (havecl and lr not in linkrevs): |
|
78 | if lr < 0 or (havecl and lr not in linkrevs): | |
79 | if lr < 0 or lr >= len(cl): |
|
79 | if lr < 0 or lr >= len(cl): | |
80 | msg = _("rev %d points to nonexistent changeset %d") |
|
80 | msg = _("rev %d points to nonexistent changeset %d") | |
81 | else: |
|
81 | else: | |
82 | msg = _("rev %d points to unexpected changeset %d") |
|
82 | msg = _("rev %d points to unexpected changeset %d") | |
83 | err(None, msg % (i, lr), f) |
|
83 | err(None, msg % (i, lr), f) | |
84 | if linkrevs: |
|
84 | if linkrevs: | |
85 | if f and len(linkrevs) > 1: |
|
85 | if f and len(linkrevs) > 1: | |
86 | try: |
|
86 | try: | |
87 | # attempt to filter down to real linkrevs |
|
87 | # attempt to filter down to real linkrevs | |
88 | linkrevs = [l for l in linkrevs |
|
88 | linkrevs = [l for l in linkrevs | |
89 | if lrugetctx(l)[f].filenode() == node] |
|
89 | if lrugetctx(l)[f].filenode() == node] | |
90 | except: |
|
90 | except: | |
91 | pass |
|
91 | pass | |
92 | warn(_(" (expected %s)") % " ".join(map(str, linkrevs))) |
|
92 | warn(_(" (expected %s)") % " ".join(map(str, linkrevs))) | |
93 | lr = None # can't be trusted |
|
93 | lr = None # can't be trusted | |
94 |
|
94 | |||
95 | try: |
|
95 | try: | |
96 | p1, p2 = obj.parents(node) |
|
96 | p1, p2 = obj.parents(node) | |
97 | if p1 not in seen and p1 != nullid: |
|
97 | if p1 not in seen and p1 != nullid: | |
98 | err(lr, _("unknown parent 1 %s of %s") % |
|
98 | err(lr, _("unknown parent 1 %s of %s") % | |
99 | (short(p1), short(n)), f) |
|
99 | (short(p1), short(n)), f) | |
100 | if p2 not in seen and p2 != nullid: |
|
100 | if p2 not in seen and p2 != nullid: | |
101 | err(lr, _("unknown parent 2 %s of %s") % |
|
101 | err(lr, _("unknown parent 2 %s of %s") % | |
102 | (short(p2), short(p1)), f) |
|
102 | (short(p2), short(p1)), f) | |
103 | except Exception, inst: |
|
103 | except Exception, inst: | |
104 | exc(lr, _("checking parents of %s") % short(node), inst, f) |
|
104 | exc(lr, _("checking parents of %s") % short(node), inst, f) | |
105 |
|
105 | |||
106 | if node in seen: |
|
106 | if node in seen: | |
107 | err(lr, _("duplicate revision %d (%d)") % (i, seen[n]), f) |
|
107 | err(lr, _("duplicate revision %d (%d)") % (i, seen[n]), f) | |
108 | seen[n] = i |
|
108 | seen[n] = i | |
109 | return lr |
|
109 | return lr | |
110 |
|
110 | |||
111 | if os.path.exists(repo.sjoin("journal")): |
|
111 | if os.path.exists(repo.sjoin("journal")): | |
112 | ui.warn(_("abandoned transaction found - run hg recover\n")) |
|
112 | ui.warn(_("abandoned transaction found - run hg recover\n")) | |
113 |
|
113 | |||
114 | revlogv1 = cl.version != revlog.REVLOGV0 |
|
114 | revlogv1 = cl.version != revlog.REVLOGV0 | |
115 | if ui.verbose or not revlogv1: |
|
115 | if ui.verbose or not revlogv1: | |
116 | ui.status(_("repository uses revlog format %d\n") % |
|
116 | ui.status(_("repository uses revlog format %d\n") % | |
117 | (revlogv1 and 1 or 0)) |
|
117 | (revlogv1 and 1 or 0)) | |
118 |
|
118 | |||
119 | havecl = len(cl) > 0 |
|
119 | havecl = len(cl) > 0 | |
120 | havemf = len(mf) > 0 |
|
120 | havemf = len(mf) > 0 | |
121 |
|
121 | |||
122 | ui.status(_("checking changesets\n")) |
|
122 | ui.status(_("checking changesets\n")) | |
123 | seen = {} |
|
123 | seen = {} | |
124 | checklog(cl, "changelog", 0) |
|
124 | checklog(cl, "changelog", 0) | |
125 | total = len(repo) |
|
125 | total = len(repo) | |
126 | for i in repo: |
|
126 | for i in repo: | |
127 | ui.progress(_('checking'), i, total=total, unit=_('changesets')) |
|
127 | ui.progress(_('checking'), i, total=total, unit=_('changesets')) | |
128 | n = cl.node(i) |
|
128 | n = cl.node(i) | |
129 | checkentry(cl, i, n, seen, [i], "changelog") |
|
129 | checkentry(cl, i, n, seen, [i], "changelog") | |
130 |
|
130 | |||
131 | try: |
|
131 | try: | |
132 | changes = cl.read(n) |
|
132 | changes = cl.read(n) | |
133 | mflinkrevs.setdefault(changes[0], []).append(i) |
|
133 | mflinkrevs.setdefault(changes[0], []).append(i) | |
134 | for f in changes[3]: |
|
134 | for f in changes[3]: | |
135 | filelinkrevs.setdefault(f, []).append(i) |
|
135 | filelinkrevs.setdefault(f, []).append(i) | |
136 | except Exception, inst: |
|
136 | except Exception, inst: | |
137 | exc(i, _("unpacking changeset %s") % short(n), inst) |
|
137 | exc(i, _("unpacking changeset %s") % short(n), inst) | |
138 | ui.progress(_('checking'), None) |
|
138 | ui.progress(_('checking'), None) | |
139 |
|
139 | |||
140 | ui.status(_("checking manifests\n")) |
|
140 | ui.status(_("checking manifests\n")) | |
141 | seen = {} |
|
141 | seen = {} | |
142 | checklog(mf, "manifest", 0) |
|
142 | checklog(mf, "manifest", 0) | |
143 | total = len(mf) |
|
143 | total = len(mf) | |
144 | for i in mf: |
|
144 | for i in mf: | |
145 | ui.progress(_('checking'), i, total=total, unit=_('manifests')) |
|
145 | ui.progress(_('checking'), i, total=total, unit=_('manifests')) | |
146 | n = mf.node(i) |
|
146 | n = mf.node(i) | |
147 | lr = checkentry(mf, i, n, seen, mflinkrevs.get(n, []), "manifest") |
|
147 | lr = checkentry(mf, i, n, seen, mflinkrevs.get(n, []), "manifest") | |
148 | if n in mflinkrevs: |
|
148 | if n in mflinkrevs: | |
149 | del mflinkrevs[n] |
|
149 | del mflinkrevs[n] | |
150 | else: |
|
150 | else: | |
151 | err(lr, _("%s not in changesets") % short(n), "manifest") |
|
151 | err(lr, _("%s not in changesets") % short(n), "manifest") | |
152 |
|
152 | |||
153 | try: |
|
153 | try: | |
154 | for f, fn in mf.readdelta(n).iteritems(): |
|
154 | for f, fn in mf.readdelta(n).iteritems(): | |
155 | if not f: |
|
155 | if not f: | |
156 | err(lr, _("file without name in manifest")) |
|
156 | err(lr, _("file without name in manifest")) | |
157 | elif f != "/dev/null": |
|
157 | elif f != "/dev/null": | |
158 | filenodes.setdefault(f, {}).setdefault(fn, lr) |
|
158 | filenodes.setdefault(f, {}).setdefault(fn, lr) | |
159 | except Exception, inst: |
|
159 | except Exception, inst: | |
160 | exc(lr, _("reading manifest delta %s") % short(n), inst) |
|
160 | exc(lr, _("reading manifest delta %s") % short(n), inst) | |
161 | ui.progress(_('checking'), None) |
|
161 | ui.progress(_('checking'), None) | |
162 |
|
162 | |||
163 | ui.status(_("crosschecking files in changesets and manifests\n")) |
|
163 | ui.status(_("crosschecking files in changesets and manifests\n")) | |
164 |
|
164 | |||
165 | total = len(mflinkrevs) + len(filelinkrevs) + len(filenodes) |
|
165 | total = len(mflinkrevs) + len(filelinkrevs) + len(filenodes) | |
166 | count = 0 |
|
166 | count = 0 | |
167 | if havemf: |
|
167 | if havemf: | |
168 | for c, m in sorted([(c, m) for m in mflinkrevs |
|
168 | for c, m in sorted([(c, m) for m in mflinkrevs | |
169 | for c in mflinkrevs[m]]): |
|
169 | for c in mflinkrevs[m]]): | |
170 | count += 1 |
|
170 | count += 1 | |
171 | if m == nullid: |
|
171 | if m == nullid: | |
172 | continue |
|
172 | continue | |
173 | ui.progress(_('crosschecking'), count, total=total) |
|
173 | ui.progress(_('crosschecking'), count, total=total) | |
174 | err(c, _("changeset refers to unknown manifest %s") % short(m)) |
|
174 | err(c, _("changeset refers to unknown manifest %s") % short(m)) | |
175 | mflinkrevs = None # del is bad here due to scope issues |
|
175 | mflinkrevs = None # del is bad here due to scope issues | |
176 |
|
176 | |||
177 | for f in sorted(filelinkrevs): |
|
177 | for f in sorted(filelinkrevs): | |
178 | count += 1 |
|
178 | count += 1 | |
179 | if m == nullid: |
|
|||
180 | continue |
|
|||
181 | ui.progress(_('crosschecking'), count, total=total) |
|
179 | ui.progress(_('crosschecking'), count, total=total) | |
182 | if f not in filenodes: |
|
180 | if f not in filenodes: | |
183 | lr = filelinkrevs[f][0] |
|
181 | lr = filelinkrevs[f][0] | |
184 | err(lr, _("in changeset but not in manifest"), f) |
|
182 | err(lr, _("in changeset but not in manifest"), f) | |
185 |
|
183 | |||
186 | if havecl: |
|
184 | if havecl: | |
187 | for f in sorted(filenodes): |
|
185 | for f in sorted(filenodes): | |
188 | count += 1 |
|
186 | count += 1 | |
189 | ui.progress(_('crosschecking'), count, total=total) |
|
187 | ui.progress(_('crosschecking'), count, total=total) | |
190 | if f not in filelinkrevs: |
|
188 | if f not in filelinkrevs: | |
191 | try: |
|
189 | try: | |
192 | fl = repo.file(f) |
|
190 | fl = repo.file(f) | |
193 | lr = min([fl.linkrev(fl.rev(n)) for n in filenodes[f]]) |
|
191 | lr = min([fl.linkrev(fl.rev(n)) for n in filenodes[f]]) | |
194 | except: |
|
192 | except: | |
195 | lr = None |
|
193 | lr = None | |
196 | err(lr, _("in manifest but not in changeset"), f) |
|
194 | err(lr, _("in manifest but not in changeset"), f) | |
197 |
|
195 | |||
198 | ui.progress(_('crosschecking'), None) |
|
196 | ui.progress(_('crosschecking'), None) | |
199 |
|
197 | |||
200 | ui.status(_("checking files\n")) |
|
198 | ui.status(_("checking files\n")) | |
201 |
|
199 | |||
202 | storefiles = set() |
|
200 | storefiles = set() | |
203 | for f, f2, size in repo.store.datafiles(): |
|
201 | for f, f2, size in repo.store.datafiles(): | |
204 | if not f: |
|
202 | if not f: | |
205 | err(None, _("cannot decode filename '%s'") % f2) |
|
203 | err(None, _("cannot decode filename '%s'") % f2) | |
206 | elif size > 0 or not revlogv1: |
|
204 | elif size > 0 or not revlogv1: | |
207 | storefiles.add(f) |
|
205 | storefiles.add(f) | |
208 |
|
206 | |||
209 | files = sorted(set(filenodes) | set(filelinkrevs)) |
|
207 | files = sorted(set(filenodes) | set(filelinkrevs)) | |
210 | total = len(files) |
|
208 | total = len(files) | |
211 | for i, f in enumerate(files): |
|
209 | for i, f in enumerate(files): | |
212 | ui.progress(_('checking'), i, item=f, total=total) |
|
210 | ui.progress(_('checking'), i, item=f, total=total) | |
213 | try: |
|
211 | try: | |
214 | linkrevs = filelinkrevs[f] |
|
212 | linkrevs = filelinkrevs[f] | |
215 | except KeyError: |
|
213 | except KeyError: | |
216 | # in manifest but not in changelog |
|
214 | # in manifest but not in changelog | |
217 | linkrevs = [] |
|
215 | linkrevs = [] | |
218 |
|
216 | |||
219 | if linkrevs: |
|
217 | if linkrevs: | |
220 | lr = linkrevs[0] |
|
218 | lr = linkrevs[0] | |
221 | else: |
|
219 | else: | |
222 | lr = None |
|
220 | lr = None | |
223 |
|
221 | |||
224 | try: |
|
222 | try: | |
225 | fl = repo.file(f) |
|
223 | fl = repo.file(f) | |
226 | except error.RevlogError, e: |
|
224 | except error.RevlogError, e: | |
227 | err(lr, _("broken revlog! (%s)") % e, f) |
|
225 | err(lr, _("broken revlog! (%s)") % e, f) | |
228 | continue |
|
226 | continue | |
229 |
|
227 | |||
230 | for ff in fl.files(): |
|
228 | for ff in fl.files(): | |
231 | try: |
|
229 | try: | |
232 | storefiles.remove(ff) |
|
230 | storefiles.remove(ff) | |
233 | except KeyError: |
|
231 | except KeyError: | |
234 | err(lr, _("missing revlog!"), ff) |
|
232 | err(lr, _("missing revlog!"), ff) | |
235 |
|
233 | |||
236 | checklog(fl, f, lr) |
|
234 | checklog(fl, f, lr) | |
237 | seen = {} |
|
235 | seen = {} | |
238 | rp = None |
|
236 | rp = None | |
239 | for i in fl: |
|
237 | for i in fl: | |
240 | revisions += 1 |
|
238 | revisions += 1 | |
241 | n = fl.node(i) |
|
239 | n = fl.node(i) | |
242 | lr = checkentry(fl, i, n, seen, linkrevs, f) |
|
240 | lr = checkentry(fl, i, n, seen, linkrevs, f) | |
243 | if f in filenodes: |
|
241 | if f in filenodes: | |
244 | if havemf and n not in filenodes[f]: |
|
242 | if havemf and n not in filenodes[f]: | |
245 | err(lr, _("%s not in manifests") % (short(n)), f) |
|
243 | err(lr, _("%s not in manifests") % (short(n)), f) | |
246 | else: |
|
244 | else: | |
247 | del filenodes[f][n] |
|
245 | del filenodes[f][n] | |
248 |
|
246 | |||
249 | # verify contents |
|
247 | # verify contents | |
250 | try: |
|
248 | try: | |
251 | l = len(fl.read(n)) |
|
249 | l = len(fl.read(n)) | |
252 | rp = fl.renamed(n) |
|
250 | rp = fl.renamed(n) | |
253 | if l != fl.size(i): |
|
251 | if l != fl.size(i): | |
254 | if len(fl.revision(n)) != fl.size(i): |
|
252 | if len(fl.revision(n)) != fl.size(i): | |
255 | err(lr, _("unpacked size is %s, %s expected") % |
|
253 | err(lr, _("unpacked size is %s, %s expected") % | |
256 | (l, fl.size(i)), f) |
|
254 | (l, fl.size(i)), f) | |
257 | except Exception, inst: |
|
255 | except Exception, inst: | |
258 | exc(lr, _("unpacking %s") % short(n), inst, f) |
|
256 | exc(lr, _("unpacking %s") % short(n), inst, f) | |
259 |
|
257 | |||
260 | # check renames |
|
258 | # check renames | |
261 | try: |
|
259 | try: | |
262 | if rp: |
|
260 | if rp: | |
263 | if lr is not None and ui.verbose: |
|
261 | if lr is not None and ui.verbose: | |
264 | ctx = lrugetctx(lr) |
|
262 | ctx = lrugetctx(lr) | |
265 | found = False |
|
263 | found = False | |
266 | for pctx in ctx.parents(): |
|
264 | for pctx in ctx.parents(): | |
267 | if rp[0] in pctx: |
|
265 | if rp[0] in pctx: | |
268 | found = True |
|
266 | found = True | |
269 | break |
|
267 | break | |
270 | if not found: |
|
268 | if not found: | |
271 | warn(_("warning: copy source of '%s' not" |
|
269 | warn(_("warning: copy source of '%s' not" | |
272 | " in parents of %s") % (f, ctx)) |
|
270 | " in parents of %s") % (f, ctx)) | |
273 | fl2 = repo.file(rp[0]) |
|
271 | fl2 = repo.file(rp[0]) | |
274 | if not len(fl2): |
|
272 | if not len(fl2): | |
275 | err(lr, _("empty or missing copy source revlog %s:%s") |
|
273 | err(lr, _("empty or missing copy source revlog %s:%s") | |
276 | % (rp[0], short(rp[1])), f) |
|
274 | % (rp[0], short(rp[1])), f) | |
277 | elif rp[1] == nullid: |
|
275 | elif rp[1] == nullid: | |
278 | ui.note(_("warning: %s@%s: copy source" |
|
276 | ui.note(_("warning: %s@%s: copy source" | |
279 | " revision is nullid %s:%s\n") |
|
277 | " revision is nullid %s:%s\n") | |
280 | % (f, lr, rp[0], short(rp[1]))) |
|
278 | % (f, lr, rp[0], short(rp[1]))) | |
281 | else: |
|
279 | else: | |
282 | fl2.rev(rp[1]) |
|
280 | fl2.rev(rp[1]) | |
283 | except Exception, inst: |
|
281 | except Exception, inst: | |
284 | exc(lr, _("checking rename of %s") % short(n), inst, f) |
|
282 | exc(lr, _("checking rename of %s") % short(n), inst, f) | |
285 |
|
283 | |||
286 | # cross-check |
|
284 | # cross-check | |
287 | if f in filenodes: |
|
285 | if f in filenodes: | |
288 | fns = [(lr, n) for n, lr in filenodes[f].iteritems()] |
|
286 | fns = [(lr, n) for n, lr in filenodes[f].iteritems()] | |
289 | for lr, node in sorted(fns): |
|
287 | for lr, node in sorted(fns): | |
290 | err(lr, _("%s in manifests not found") % short(node), f) |
|
288 | err(lr, _("%s in manifests not found") % short(node), f) | |
291 | ui.progress(_('checking'), None) |
|
289 | ui.progress(_('checking'), None) | |
292 |
|
290 | |||
293 | for f in storefiles: |
|
291 | for f in storefiles: | |
294 | warn(_("warning: orphan revlog '%s'") % f) |
|
292 | warn(_("warning: orphan revlog '%s'") % f) | |
295 |
|
293 | |||
296 | ui.status(_("%d files, %d changesets, %d total revisions\n") % |
|
294 | ui.status(_("%d files, %d changesets, %d total revisions\n") % | |
297 | (len(files), len(cl), revisions)) |
|
295 | (len(files), len(cl), revisions)) | |
298 | if warnings[0]: |
|
296 | if warnings[0]: | |
299 | ui.warn(_("%d warnings encountered!\n") % warnings[0]) |
|
297 | ui.warn(_("%d warnings encountered!\n") % warnings[0]) | |
300 | if errors[0]: |
|
298 | if errors[0]: | |
301 | ui.warn(_("%d integrity errors encountered!\n") % errors[0]) |
|
299 | ui.warn(_("%d integrity errors encountered!\n") % errors[0]) | |
302 | if badrevs: |
|
300 | if badrevs: | |
303 | ui.warn(_("(first damaged changeset appears to be %d)\n") |
|
301 | ui.warn(_("(first damaged changeset appears to be %d)\n") | |
304 | % min(badrevs)) |
|
302 | % min(badrevs)) | |
305 | return 1 |
|
303 | return 1 |
General Comments 0
You need to be logged in to leave comments.
Login now