Show More
@@ -1,886 +1,888 b'' | |||||
1 | # censor code related to censoring revision |
|
1 | # censor code related to censoring revision | |
2 | # coding: utf8 |
|
2 | # coding: utf8 | |
3 | # |
|
3 | # | |
4 | # Copyright 2021 Pierre-Yves David <pierre-yves.david@octobus.net> |
|
4 | # Copyright 2021 Pierre-Yves David <pierre-yves.david@octobus.net> | |
5 | # Copyright 2015 Google, Inc <martinvonz@google.com> |
|
5 | # Copyright 2015 Google, Inc <martinvonz@google.com> | |
6 | # |
|
6 | # | |
7 | # This software may be used and distributed according to the terms of the |
|
7 | # This software may be used and distributed according to the terms of the | |
8 | # GNU General Public License version 2 or any later version. |
|
8 | # GNU General Public License version 2 or any later version. | |
9 |
|
9 | |||
10 | import binascii |
|
10 | import binascii | |
11 | import contextlib |
|
11 | import contextlib | |
12 | import os |
|
12 | import os | |
13 | import struct |
|
13 | import struct | |
14 |
|
14 | |||
15 | from ..node import ( |
|
15 | from ..node import ( | |
16 | nullrev, |
|
16 | nullrev, | |
17 | ) |
|
17 | ) | |
18 | from .constants import ( |
|
18 | from .constants import ( | |
19 | COMP_MODE_PLAIN, |
|
19 | COMP_MODE_PLAIN, | |
20 | ENTRY_DATA_COMPRESSED_LENGTH, |
|
20 | ENTRY_DATA_COMPRESSED_LENGTH, | |
21 | ENTRY_DATA_COMPRESSION_MODE, |
|
21 | ENTRY_DATA_COMPRESSION_MODE, | |
22 | ENTRY_DATA_OFFSET, |
|
22 | ENTRY_DATA_OFFSET, | |
23 | ENTRY_DATA_UNCOMPRESSED_LENGTH, |
|
23 | ENTRY_DATA_UNCOMPRESSED_LENGTH, | |
24 | ENTRY_DELTA_BASE, |
|
24 | ENTRY_DELTA_BASE, | |
25 | ENTRY_LINK_REV, |
|
25 | ENTRY_LINK_REV, | |
26 | ENTRY_NODE_ID, |
|
26 | ENTRY_NODE_ID, | |
27 | ENTRY_PARENT_1, |
|
27 | ENTRY_PARENT_1, | |
28 | ENTRY_PARENT_2, |
|
28 | ENTRY_PARENT_2, | |
29 | ENTRY_SIDEDATA_COMPRESSED_LENGTH, |
|
29 | ENTRY_SIDEDATA_COMPRESSED_LENGTH, | |
30 | ENTRY_SIDEDATA_COMPRESSION_MODE, |
|
30 | ENTRY_SIDEDATA_COMPRESSION_MODE, | |
31 | ENTRY_SIDEDATA_OFFSET, |
|
31 | ENTRY_SIDEDATA_OFFSET, | |
32 | REVIDX_ISCENSORED, |
|
32 | REVIDX_ISCENSORED, | |
33 | REVLOGV0, |
|
33 | REVLOGV0, | |
34 | REVLOGV1, |
|
34 | REVLOGV1, | |
35 | ) |
|
35 | ) | |
36 | from ..i18n import _ |
|
36 | from ..i18n import _ | |
37 |
|
37 | |||
38 | from .. import ( |
|
38 | from .. import ( | |
39 | error, |
|
39 | error, | |
40 | mdiff, |
|
40 | mdiff, | |
41 | pycompat, |
|
41 | pycompat, | |
42 | revlogutils, |
|
42 | revlogutils, | |
43 | util, |
|
43 | util, | |
44 | ) |
|
44 | ) | |
45 | from ..utils import ( |
|
45 | from ..utils import ( | |
46 | storageutil, |
|
46 | storageutil, | |
47 | ) |
|
47 | ) | |
48 | from . import ( |
|
48 | from . import ( | |
49 | constants, |
|
49 | constants, | |
50 | deltas, |
|
50 | deltas, | |
51 | ) |
|
51 | ) | |
52 |
|
52 | |||
53 |
|
53 | |||
54 | def v1_censor(rl, tr, censornode, tombstone=b''): |
|
54 | def v1_censor(rl, tr, censornode, tombstone=b''): | |
55 | """censors a revision in a "version 1" revlog""" |
|
55 | """censors a revision in a "version 1" revlog""" | |
56 | assert rl._format_version == constants.REVLOGV1, rl._format_version |
|
56 | assert rl._format_version == constants.REVLOGV1, rl._format_version | |
57 |
|
57 | |||
58 | # avoid cycle |
|
58 | # avoid cycle | |
59 | from .. import revlog |
|
59 | from .. import revlog | |
60 |
|
60 | |||
61 | censorrev = rl.rev(censornode) |
|
61 | censorrev = rl.rev(censornode) | |
62 | tombstone = storageutil.packmeta({b'censored': tombstone}, b'') |
|
62 | tombstone = storageutil.packmeta({b'censored': tombstone}, b'') | |
63 |
|
63 | |||
64 | # Rewriting the revlog in place is hard. Our strategy for censoring is |
|
64 | # Rewriting the revlog in place is hard. Our strategy for censoring is | |
65 | # to create a new revlog, copy all revisions to it, then replace the |
|
65 | # to create a new revlog, copy all revisions to it, then replace the | |
66 | # revlogs on transaction close. |
|
66 | # revlogs on transaction close. | |
67 | # |
|
67 | # | |
68 | # This is a bit dangerous. We could easily have a mismatch of state. |
|
68 | # This is a bit dangerous. We could easily have a mismatch of state. | |
69 | newrl = revlog.revlog( |
|
69 | newrl = revlog.revlog( | |
70 | rl.opener, |
|
70 | rl.opener, | |
71 | target=rl.target, |
|
71 | target=rl.target, | |
72 | radix=rl.radix, |
|
72 | radix=rl.radix, | |
73 | postfix=b'tmpcensored', |
|
73 | postfix=b'tmpcensored', | |
74 | censorable=True, |
|
74 | censorable=True, | |
75 | ) |
|
75 | ) | |
76 | newrl._format_version = rl._format_version |
|
76 | newrl._format_version = rl._format_version | |
77 | newrl._format_flags = rl._format_flags |
|
77 | newrl._format_flags = rl._format_flags | |
78 | newrl._generaldelta = rl._generaldelta |
|
78 | newrl._generaldelta = rl._generaldelta | |
79 | newrl._parse_index = rl._parse_index |
|
79 | newrl._parse_index = rl._parse_index | |
80 |
|
80 | |||
81 | for rev in rl.revs(): |
|
81 | for rev in rl.revs(): | |
82 | node = rl.node(rev) |
|
82 | node = rl.node(rev) | |
83 | p1, p2 = rl.parents(node) |
|
83 | p1, p2 = rl.parents(node) | |
84 |
|
84 | |||
85 | if rev == censorrev: |
|
85 | if rev == censorrev: | |
86 | newrl.addrawrevision( |
|
86 | newrl.addrawrevision( | |
87 | tombstone, |
|
87 | tombstone, | |
88 | tr, |
|
88 | tr, | |
89 | rl.linkrev(censorrev), |
|
89 | rl.linkrev(censorrev), | |
90 | p1, |
|
90 | p1, | |
91 | p2, |
|
91 | p2, | |
92 | censornode, |
|
92 | censornode, | |
93 | constants.REVIDX_ISCENSORED, |
|
93 | constants.REVIDX_ISCENSORED, | |
94 | ) |
|
94 | ) | |
95 |
|
95 | |||
96 | if newrl.deltaparent(rev) != nullrev: |
|
96 | if newrl.deltaparent(rev) != nullrev: | |
97 | m = _(b'censored revision stored as delta; cannot censor') |
|
97 | m = _(b'censored revision stored as delta; cannot censor') | |
98 | h = _( |
|
98 | h = _( | |
99 | b'censoring of revlogs is not fully implemented;' |
|
99 | b'censoring of revlogs is not fully implemented;' | |
100 | b' please report this bug' |
|
100 | b' please report this bug' | |
101 | ) |
|
101 | ) | |
102 | raise error.Abort(m, hint=h) |
|
102 | raise error.Abort(m, hint=h) | |
103 | continue |
|
103 | continue | |
104 |
|
104 | |||
105 | if rl.iscensored(rev): |
|
105 | if rl.iscensored(rev): | |
106 | if rl.deltaparent(rev) != nullrev: |
|
106 | if rl.deltaparent(rev) != nullrev: | |
107 | m = _( |
|
107 | m = _( | |
108 | b'cannot censor due to censored ' |
|
108 | b'cannot censor due to censored ' | |
109 | b'revision having delta stored' |
|
109 | b'revision having delta stored' | |
110 | ) |
|
110 | ) | |
111 | raise error.Abort(m) |
|
111 | raise error.Abort(m) | |
112 | rawtext = rl._chunk(rev) |
|
112 | rawtext = rl._chunk(rev) | |
113 | else: |
|
113 | else: | |
114 | rawtext = rl.rawdata(rev) |
|
114 | rawtext = rl.rawdata(rev) | |
115 |
|
115 | |||
116 | newrl.addrawrevision( |
|
116 | newrl.addrawrevision( | |
117 | rawtext, tr, rl.linkrev(rev), p1, p2, node, rl.flags(rev) |
|
117 | rawtext, tr, rl.linkrev(rev), p1, p2, node, rl.flags(rev) | |
118 | ) |
|
118 | ) | |
119 |
|
119 | |||
120 | tr.addbackup(rl._indexfile, location=b'store') |
|
120 | tr.addbackup(rl._indexfile, location=b'store') | |
121 | if not rl._inline: |
|
121 | if not rl._inline: | |
122 | tr.addbackup(rl._datafile, location=b'store') |
|
122 | tr.addbackup(rl._datafile, location=b'store') | |
123 |
|
123 | |||
124 | rl.opener.rename(newrl._indexfile, rl._indexfile) |
|
124 | rl.opener.rename(newrl._indexfile, rl._indexfile) | |
125 | if not rl._inline: |
|
125 | if not rl._inline: | |
126 | rl.opener.rename(newrl._datafile, rl._datafile) |
|
126 | rl.opener.rename(newrl._datafile, rl._datafile) | |
127 |
|
127 | |||
128 | rl.clearcaches() |
|
128 | rl.clearcaches() | |
129 | rl._loadindex() |
|
129 | rl._loadindex() | |
130 |
|
130 | |||
131 |
|
131 | |||
132 | def v2_censor(revlog, tr, censornode, tombstone=b''): |
|
132 | def v2_censor(revlog, tr, censornode, tombstone=b''): | |
133 | """censors a revision in a "version 2" revlog""" |
|
133 | """censors a revision in a "version 2" revlog""" | |
134 | assert revlog._format_version != REVLOGV0, revlog._format_version |
|
134 | assert revlog._format_version != REVLOGV0, revlog._format_version | |
135 | assert revlog._format_version != REVLOGV1, revlog._format_version |
|
135 | assert revlog._format_version != REVLOGV1, revlog._format_version | |
136 |
|
136 | |||
137 | censor_revs = {revlog.rev(censornode)} |
|
137 | censor_revs = {revlog.rev(censornode)} | |
138 | _rewrite_v2(revlog, tr, censor_revs, tombstone) |
|
138 | _rewrite_v2(revlog, tr, censor_revs, tombstone) | |
139 |
|
139 | |||
140 |
|
140 | |||
141 | def _rewrite_v2(revlog, tr, censor_revs, tombstone=b''): |
|
141 | def _rewrite_v2(revlog, tr, censor_revs, tombstone=b''): | |
142 | """rewrite a revlog to censor some of its content |
|
142 | """rewrite a revlog to censor some of its content | |
143 |
|
143 | |||
144 | General principle |
|
144 | General principle | |
145 |
|
145 | |||
146 | We create new revlog files (index/data/sidedata) to copy the content of |
|
146 | We create new revlog files (index/data/sidedata) to copy the content of | |
147 | the existing data without the censored data. |
|
147 | the existing data without the censored data. | |
148 |
|
148 | |||
149 | We need to recompute new delta for any revision that used the censored |
|
149 | We need to recompute new delta for any revision that used the censored | |
150 | revision as delta base. As the cumulative size of the new delta may be |
|
150 | revision as delta base. As the cumulative size of the new delta may be | |
151 | large, we store them in a temporary file until they are stored in their |
|
151 | large, we store them in a temporary file until they are stored in their | |
152 | final destination. |
|
152 | final destination. | |
153 |
|
153 | |||
154 | All data before the censored data can be blindly copied. The rest needs |
|
154 | All data before the censored data can be blindly copied. The rest needs | |
155 | to be copied as we go and the associated index entry needs adjustement. |
|
155 | to be copied as we go and the associated index entry needs adjustement. | |
156 | """ |
|
156 | """ | |
157 | assert revlog._format_version != REVLOGV0, revlog._format_version |
|
157 | assert revlog._format_version != REVLOGV0, revlog._format_version | |
158 | assert revlog._format_version != REVLOGV1, revlog._format_version |
|
158 | assert revlog._format_version != REVLOGV1, revlog._format_version | |
159 |
|
159 | |||
160 | old_index = revlog.index |
|
160 | old_index = revlog.index | |
161 | docket = revlog._docket |
|
161 | docket = revlog._docket | |
162 |
|
162 | |||
163 | tombstone = storageutil.packmeta({b'censored': tombstone}, b'') |
|
163 | tombstone = storageutil.packmeta({b'censored': tombstone}, b'') | |
164 |
|
164 | |||
165 | first_excl_rev = min(censor_revs) |
|
165 | first_excl_rev = min(censor_revs) | |
166 |
|
166 | |||
167 | first_excl_entry = revlog.index[first_excl_rev] |
|
167 | first_excl_entry = revlog.index[first_excl_rev] | |
168 | index_cutoff = revlog.index.entry_size * first_excl_rev |
|
168 | index_cutoff = revlog.index.entry_size * first_excl_rev | |
169 | data_cutoff = first_excl_entry[ENTRY_DATA_OFFSET] >> 16 |
|
169 | data_cutoff = first_excl_entry[ENTRY_DATA_OFFSET] >> 16 | |
170 | sidedata_cutoff = revlog.sidedata_cut_off(first_excl_rev) |
|
170 | sidedata_cutoff = revlog.sidedata_cut_off(first_excl_rev) | |
171 |
|
171 | |||
172 | with pycompat.unnamedtempfile(mode=b"w+b") as tmp_storage: |
|
172 | with pycompat.unnamedtempfile(mode=b"w+b") as tmp_storage: | |
173 | # rev → (new_base, data_start, data_end, compression_mode) |
|
173 | # rev → (new_base, data_start, data_end, compression_mode) | |
174 | rewritten_entries = _precompute_rewritten_delta( |
|
174 | rewritten_entries = _precompute_rewritten_delta( | |
175 | revlog, |
|
175 | revlog, | |
176 | old_index, |
|
176 | old_index, | |
177 | censor_revs, |
|
177 | censor_revs, | |
178 | tmp_storage, |
|
178 | tmp_storage, | |
179 | ) |
|
179 | ) | |
180 |
|
180 | |||
181 | all_files = _setup_new_files( |
|
181 | all_files = _setup_new_files( | |
182 | revlog, |
|
182 | revlog, | |
183 | index_cutoff, |
|
183 | index_cutoff, | |
184 | data_cutoff, |
|
184 | data_cutoff, | |
185 | sidedata_cutoff, |
|
185 | sidedata_cutoff, | |
186 | ) |
|
186 | ) | |
187 |
|
187 | |||
188 | # we dont need to open the old index file since its content already |
|
188 | # we dont need to open the old index file since its content already | |
189 | # exist in a usable form in `old_index`. |
|
189 | # exist in a usable form in `old_index`. | |
190 | with all_files() as open_files: |
|
190 | with all_files() as open_files: | |
191 | ( |
|
191 | ( | |
192 | old_data_file, |
|
192 | old_data_file, | |
193 | old_sidedata_file, |
|
193 | old_sidedata_file, | |
194 | new_index_file, |
|
194 | new_index_file, | |
195 | new_data_file, |
|
195 | new_data_file, | |
196 | new_sidedata_file, |
|
196 | new_sidedata_file, | |
197 | ) = open_files |
|
197 | ) = open_files | |
198 |
|
198 | |||
199 | # writing the censored revision |
|
199 | # writing the censored revision | |
200 |
|
200 | |||
201 | # Writing all subsequent revisions |
|
201 | # Writing all subsequent revisions | |
202 | for rev in range(first_excl_rev, len(old_index)): |
|
202 | for rev in range(first_excl_rev, len(old_index)): | |
203 | if rev in censor_revs: |
|
203 | if rev in censor_revs: | |
204 | _rewrite_censor( |
|
204 | _rewrite_censor( | |
205 | revlog, |
|
205 | revlog, | |
206 | old_index, |
|
206 | old_index, | |
207 | open_files, |
|
207 | open_files, | |
208 | rev, |
|
208 | rev, | |
209 | tombstone, |
|
209 | tombstone, | |
210 | ) |
|
210 | ) | |
211 | else: |
|
211 | else: | |
212 | _rewrite_simple( |
|
212 | _rewrite_simple( | |
213 | revlog, |
|
213 | revlog, | |
214 | old_index, |
|
214 | old_index, | |
215 | open_files, |
|
215 | open_files, | |
216 | rev, |
|
216 | rev, | |
217 | rewritten_entries, |
|
217 | rewritten_entries, | |
218 | tmp_storage, |
|
218 | tmp_storage, | |
219 | ) |
|
219 | ) | |
220 | docket.write(transaction=None, stripping=True) |
|
220 | docket.write(transaction=None, stripping=True) | |
221 |
|
221 | |||
222 |
|
222 | |||
223 | def _precompute_rewritten_delta( |
|
223 | def _precompute_rewritten_delta( | |
224 | revlog, |
|
224 | revlog, | |
225 | old_index, |
|
225 | old_index, | |
226 | excluded_revs, |
|
226 | excluded_revs, | |
227 | tmp_storage, |
|
227 | tmp_storage, | |
228 | ): |
|
228 | ): | |
229 | """Compute new delta for revisions whose delta is based on revision that |
|
229 | """Compute new delta for revisions whose delta is based on revision that | |
230 | will not survive as is. |
|
230 | will not survive as is. | |
231 |
|
231 | |||
232 | Return a mapping: {rev → (new_base, data_start, data_end, compression_mode)} |
|
232 | Return a mapping: {rev → (new_base, data_start, data_end, compression_mode)} | |
233 | """ |
|
233 | """ | |
234 | dc = deltas.deltacomputer(revlog) |
|
234 | dc = deltas.deltacomputer(revlog) | |
235 | rewritten_entries = {} |
|
235 | rewritten_entries = {} | |
236 | first_excl_rev = min(excluded_revs) |
|
236 | first_excl_rev = min(excluded_revs) | |
237 | with revlog._segmentfile._open_read() as dfh: |
|
237 | with revlog._segmentfile._open_read() as dfh: | |
238 | for rev in range(first_excl_rev, len(old_index)): |
|
238 | for rev in range(first_excl_rev, len(old_index)): | |
239 | if rev in excluded_revs: |
|
239 | if rev in excluded_revs: | |
240 | # this revision will be preserved as is, so we don't need to |
|
240 | # this revision will be preserved as is, so we don't need to | |
241 | # consider recomputing a delta. |
|
241 | # consider recomputing a delta. | |
242 | continue |
|
242 | continue | |
243 | entry = old_index[rev] |
|
243 | entry = old_index[rev] | |
244 | if entry[ENTRY_DELTA_BASE] not in excluded_revs: |
|
244 | if entry[ENTRY_DELTA_BASE] not in excluded_revs: | |
245 | continue |
|
245 | continue | |
246 | # This is a revision that use the censored revision as the base |
|
246 | # This is a revision that use the censored revision as the base | |
247 | # for its delta. We need a need new deltas |
|
247 | # for its delta. We need a need new deltas | |
248 | if entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] == 0: |
|
248 | if entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] == 0: | |
249 | # this revision is empty, we can delta against nullrev |
|
249 | # this revision is empty, we can delta against nullrev | |
250 | rewritten_entries[rev] = (nullrev, 0, 0, COMP_MODE_PLAIN) |
|
250 | rewritten_entries[rev] = (nullrev, 0, 0, COMP_MODE_PLAIN) | |
251 | else: |
|
251 | else: | |
252 |
|
252 | |||
253 | text = revlog.rawdata(rev, _df=dfh) |
|
253 | text = revlog.rawdata(rev, _df=dfh) | |
254 | info = revlogutils.revisioninfo( |
|
254 | info = revlogutils.revisioninfo( | |
255 | node=entry[ENTRY_NODE_ID], |
|
255 | node=entry[ENTRY_NODE_ID], | |
256 | p1=revlog.node(entry[ENTRY_PARENT_1]), |
|
256 | p1=revlog.node(entry[ENTRY_PARENT_1]), | |
257 | p2=revlog.node(entry[ENTRY_PARENT_2]), |
|
257 | p2=revlog.node(entry[ENTRY_PARENT_2]), | |
258 | btext=[text], |
|
258 | btext=[text], | |
259 | textlen=len(text), |
|
259 | textlen=len(text), | |
260 | cachedelta=None, |
|
260 | cachedelta=None, | |
261 | flags=entry[ENTRY_DATA_OFFSET] & 0xFFFF, |
|
261 | flags=entry[ENTRY_DATA_OFFSET] & 0xFFFF, | |
262 | ) |
|
262 | ) | |
263 | d = dc.finddeltainfo( |
|
263 | d = dc.finddeltainfo( | |
264 | info, dfh, excluded_bases=excluded_revs, target_rev=rev |
|
264 | info, dfh, excluded_bases=excluded_revs, target_rev=rev | |
265 | ) |
|
265 | ) | |
266 | default_comp = revlog._docket.default_compression_header |
|
266 | default_comp = revlog._docket.default_compression_header | |
267 | comp_mode, d = deltas.delta_compression(default_comp, d) |
|
267 | comp_mode, d = deltas.delta_compression(default_comp, d) | |
268 | # using `tell` is a bit lazy, but we are not here for speed |
|
268 | # using `tell` is a bit lazy, but we are not here for speed | |
269 | start = tmp_storage.tell() |
|
269 | start = tmp_storage.tell() | |
270 | tmp_storage.write(d.data[1]) |
|
270 | tmp_storage.write(d.data[1]) | |
271 | end = tmp_storage.tell() |
|
271 | end = tmp_storage.tell() | |
272 | rewritten_entries[rev] = (d.base, start, end, comp_mode) |
|
272 | rewritten_entries[rev] = (d.base, start, end, comp_mode) | |
273 | return rewritten_entries |
|
273 | return rewritten_entries | |
274 |
|
274 | |||
275 |
|
275 | |||
276 | def _setup_new_files( |
|
276 | def _setup_new_files( | |
277 | revlog, |
|
277 | revlog, | |
278 | index_cutoff, |
|
278 | index_cutoff, | |
279 | data_cutoff, |
|
279 | data_cutoff, | |
280 | sidedata_cutoff, |
|
280 | sidedata_cutoff, | |
281 | ): |
|
281 | ): | |
282 | """ |
|
282 | """ | |
283 |
|
283 | |||
284 | return a context manager to open all the relevant files: |
|
284 | return a context manager to open all the relevant files: | |
285 | - old_data_file, |
|
285 | - old_data_file, | |
286 | - old_sidedata_file, |
|
286 | - old_sidedata_file, | |
287 | - new_index_file, |
|
287 | - new_index_file, | |
288 | - new_data_file, |
|
288 | - new_data_file, | |
289 | - new_sidedata_file, |
|
289 | - new_sidedata_file, | |
290 |
|
290 | |||
291 | The old_index_file is not here because it is accessed through the |
|
291 | The old_index_file is not here because it is accessed through the | |
292 | `old_index` object if the caller function. |
|
292 | `old_index` object if the caller function. | |
293 | """ |
|
293 | """ | |
294 | docket = revlog._docket |
|
294 | docket = revlog._docket | |
295 | old_index_filepath = revlog.opener.join(docket.index_filepath()) |
|
295 | old_index_filepath = revlog.opener.join(docket.index_filepath()) | |
296 | old_data_filepath = revlog.opener.join(docket.data_filepath()) |
|
296 | old_data_filepath = revlog.opener.join(docket.data_filepath()) | |
297 | old_sidedata_filepath = revlog.opener.join(docket.sidedata_filepath()) |
|
297 | old_sidedata_filepath = revlog.opener.join(docket.sidedata_filepath()) | |
298 |
|
298 | |||
299 | new_index_filepath = revlog.opener.join(docket.new_index_file()) |
|
299 | new_index_filepath = revlog.opener.join(docket.new_index_file()) | |
300 | new_data_filepath = revlog.opener.join(docket.new_data_file()) |
|
300 | new_data_filepath = revlog.opener.join(docket.new_data_file()) | |
301 | new_sidedata_filepath = revlog.opener.join(docket.new_sidedata_file()) |
|
301 | new_sidedata_filepath = revlog.opener.join(docket.new_sidedata_file()) | |
302 |
|
302 | |||
303 | util.copyfile(old_index_filepath, new_index_filepath, nb_bytes=index_cutoff) |
|
303 | util.copyfile(old_index_filepath, new_index_filepath, nb_bytes=index_cutoff) | |
304 | util.copyfile(old_data_filepath, new_data_filepath, nb_bytes=data_cutoff) |
|
304 | util.copyfile(old_data_filepath, new_data_filepath, nb_bytes=data_cutoff) | |
305 | util.copyfile( |
|
305 | util.copyfile( | |
306 | old_sidedata_filepath, |
|
306 | old_sidedata_filepath, | |
307 | new_sidedata_filepath, |
|
307 | new_sidedata_filepath, | |
308 | nb_bytes=sidedata_cutoff, |
|
308 | nb_bytes=sidedata_cutoff, | |
309 | ) |
|
309 | ) | |
310 | revlog.opener.register_file(docket.index_filepath()) |
|
310 | revlog.opener.register_file(docket.index_filepath()) | |
311 | revlog.opener.register_file(docket.data_filepath()) |
|
311 | revlog.opener.register_file(docket.data_filepath()) | |
312 | revlog.opener.register_file(docket.sidedata_filepath()) |
|
312 | revlog.opener.register_file(docket.sidedata_filepath()) | |
313 |
|
313 | |||
314 | docket.index_end = index_cutoff |
|
314 | docket.index_end = index_cutoff | |
315 | docket.data_end = data_cutoff |
|
315 | docket.data_end = data_cutoff | |
316 | docket.sidedata_end = sidedata_cutoff |
|
316 | docket.sidedata_end = sidedata_cutoff | |
317 |
|
317 | |||
318 | # reload the revlog internal information |
|
318 | # reload the revlog internal information | |
319 | revlog.clearcaches() |
|
319 | revlog.clearcaches() | |
320 | revlog._loadindex(docket=docket) |
|
320 | revlog._loadindex(docket=docket) | |
321 |
|
321 | |||
322 | @contextlib.contextmanager |
|
322 | @contextlib.contextmanager | |
323 | def all_files_opener(): |
|
323 | def all_files_opener(): | |
324 | # hide opening in an helper function to please check-code, black |
|
324 | # hide opening in an helper function to please check-code, black | |
325 | # and various python version at the same time |
|
325 | # and various python version at the same time | |
326 | with open(old_data_filepath, 'rb') as old_data_file: |
|
326 | with open(old_data_filepath, 'rb') as old_data_file: | |
327 | with open(old_sidedata_filepath, 'rb') as old_sidedata_file: |
|
327 | with open(old_sidedata_filepath, 'rb') as old_sidedata_file: | |
328 | with open(new_index_filepath, 'r+b') as new_index_file: |
|
328 | with open(new_index_filepath, 'r+b') as new_index_file: | |
329 | with open(new_data_filepath, 'r+b') as new_data_file: |
|
329 | with open(new_data_filepath, 'r+b') as new_data_file: | |
330 | with open( |
|
330 | with open( | |
331 | new_sidedata_filepath, 'r+b' |
|
331 | new_sidedata_filepath, 'r+b' | |
332 | ) as new_sidedata_file: |
|
332 | ) as new_sidedata_file: | |
333 | new_index_file.seek(0, os.SEEK_END) |
|
333 | new_index_file.seek(0, os.SEEK_END) | |
334 | assert new_index_file.tell() == index_cutoff |
|
334 | assert new_index_file.tell() == index_cutoff | |
335 | new_data_file.seek(0, os.SEEK_END) |
|
335 | new_data_file.seek(0, os.SEEK_END) | |
336 | assert new_data_file.tell() == data_cutoff |
|
336 | assert new_data_file.tell() == data_cutoff | |
337 | new_sidedata_file.seek(0, os.SEEK_END) |
|
337 | new_sidedata_file.seek(0, os.SEEK_END) | |
338 | assert new_sidedata_file.tell() == sidedata_cutoff |
|
338 | assert new_sidedata_file.tell() == sidedata_cutoff | |
339 | yield ( |
|
339 | yield ( | |
340 | old_data_file, |
|
340 | old_data_file, | |
341 | old_sidedata_file, |
|
341 | old_sidedata_file, | |
342 | new_index_file, |
|
342 | new_index_file, | |
343 | new_data_file, |
|
343 | new_data_file, | |
344 | new_sidedata_file, |
|
344 | new_sidedata_file, | |
345 | ) |
|
345 | ) | |
346 |
|
346 | |||
347 | return all_files_opener |
|
347 | return all_files_opener | |
348 |
|
348 | |||
349 |
|
349 | |||
350 | def _rewrite_simple( |
|
350 | def _rewrite_simple( | |
351 | revlog, |
|
351 | revlog, | |
352 | old_index, |
|
352 | old_index, | |
353 | all_files, |
|
353 | all_files, | |
354 | rev, |
|
354 | rev, | |
355 | rewritten_entries, |
|
355 | rewritten_entries, | |
356 | tmp_storage, |
|
356 | tmp_storage, | |
357 | ): |
|
357 | ): | |
358 | """append a normal revision to the index after the rewritten one(s)""" |
|
358 | """append a normal revision to the index after the rewritten one(s)""" | |
359 | ( |
|
359 | ( | |
360 | old_data_file, |
|
360 | old_data_file, | |
361 | old_sidedata_file, |
|
361 | old_sidedata_file, | |
362 | new_index_file, |
|
362 | new_index_file, | |
363 | new_data_file, |
|
363 | new_data_file, | |
364 | new_sidedata_file, |
|
364 | new_sidedata_file, | |
365 | ) = all_files |
|
365 | ) = all_files | |
366 | entry = old_index[rev] |
|
366 | entry = old_index[rev] | |
367 | flags = entry[ENTRY_DATA_OFFSET] & 0xFFFF |
|
367 | flags = entry[ENTRY_DATA_OFFSET] & 0xFFFF | |
368 | old_data_offset = entry[ENTRY_DATA_OFFSET] >> 16 |
|
368 | old_data_offset = entry[ENTRY_DATA_OFFSET] >> 16 | |
369 |
|
369 | |||
370 | if rev not in rewritten_entries: |
|
370 | if rev not in rewritten_entries: | |
371 | old_data_file.seek(old_data_offset) |
|
371 | old_data_file.seek(old_data_offset) | |
372 | new_data_size = entry[ENTRY_DATA_COMPRESSED_LENGTH] |
|
372 | new_data_size = entry[ENTRY_DATA_COMPRESSED_LENGTH] | |
373 | new_data = old_data_file.read(new_data_size) |
|
373 | new_data = old_data_file.read(new_data_size) | |
374 | data_delta_base = entry[ENTRY_DELTA_BASE] |
|
374 | data_delta_base = entry[ENTRY_DELTA_BASE] | |
375 | d_comp_mode = entry[ENTRY_DATA_COMPRESSION_MODE] |
|
375 | d_comp_mode = entry[ENTRY_DATA_COMPRESSION_MODE] | |
376 | else: |
|
376 | else: | |
377 | ( |
|
377 | ( | |
378 | data_delta_base, |
|
378 | data_delta_base, | |
379 | start, |
|
379 | start, | |
380 | end, |
|
380 | end, | |
381 | d_comp_mode, |
|
381 | d_comp_mode, | |
382 | ) = rewritten_entries[rev] |
|
382 | ) = rewritten_entries[rev] | |
383 | new_data_size = end - start |
|
383 | new_data_size = end - start | |
384 | tmp_storage.seek(start) |
|
384 | tmp_storage.seek(start) | |
385 | new_data = tmp_storage.read(new_data_size) |
|
385 | new_data = tmp_storage.read(new_data_size) | |
386 |
|
386 | |||
387 | # It might be faster to group continuous read/write operation, |
|
387 | # It might be faster to group continuous read/write operation, | |
388 | # however, this is censor, an operation that is not focussed |
|
388 | # however, this is censor, an operation that is not focussed | |
389 | # around stellar performance. So I have not written this |
|
389 | # around stellar performance. So I have not written this | |
390 | # optimisation yet. |
|
390 | # optimisation yet. | |
391 | new_data_offset = new_data_file.tell() |
|
391 | new_data_offset = new_data_file.tell() | |
392 | new_data_file.write(new_data) |
|
392 | new_data_file.write(new_data) | |
393 |
|
393 | |||
394 | sidedata_size = entry[ENTRY_SIDEDATA_COMPRESSED_LENGTH] |
|
394 | sidedata_size = entry[ENTRY_SIDEDATA_COMPRESSED_LENGTH] | |
395 | new_sidedata_offset = new_sidedata_file.tell() |
|
395 | new_sidedata_offset = new_sidedata_file.tell() | |
396 | if 0 < sidedata_size: |
|
396 | if 0 < sidedata_size: | |
397 | old_sidedata_offset = entry[ENTRY_SIDEDATA_OFFSET] |
|
397 | old_sidedata_offset = entry[ENTRY_SIDEDATA_OFFSET] | |
398 | old_sidedata_file.seek(old_sidedata_offset) |
|
398 | old_sidedata_file.seek(old_sidedata_offset) | |
399 | new_sidedata = old_sidedata_file.read(sidedata_size) |
|
399 | new_sidedata = old_sidedata_file.read(sidedata_size) | |
400 | new_sidedata_file.write(new_sidedata) |
|
400 | new_sidedata_file.write(new_sidedata) | |
401 |
|
401 | |||
402 | data_uncompressed_length = entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] |
|
402 | data_uncompressed_length = entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] | |
403 | sd_com_mode = entry[ENTRY_SIDEDATA_COMPRESSION_MODE] |
|
403 | sd_com_mode = entry[ENTRY_SIDEDATA_COMPRESSION_MODE] | |
404 | assert data_delta_base <= rev, (data_delta_base, rev) |
|
404 | assert data_delta_base <= rev, (data_delta_base, rev) | |
405 |
|
405 | |||
406 | new_entry = revlogutils.entry( |
|
406 | new_entry = revlogutils.entry( | |
407 | flags=flags, |
|
407 | flags=flags, | |
408 | data_offset=new_data_offset, |
|
408 | data_offset=new_data_offset, | |
409 | data_compressed_length=new_data_size, |
|
409 | data_compressed_length=new_data_size, | |
410 | data_uncompressed_length=data_uncompressed_length, |
|
410 | data_uncompressed_length=data_uncompressed_length, | |
411 | data_delta_base=data_delta_base, |
|
411 | data_delta_base=data_delta_base, | |
412 | link_rev=entry[ENTRY_LINK_REV], |
|
412 | link_rev=entry[ENTRY_LINK_REV], | |
413 | parent_rev_1=entry[ENTRY_PARENT_1], |
|
413 | parent_rev_1=entry[ENTRY_PARENT_1], | |
414 | parent_rev_2=entry[ENTRY_PARENT_2], |
|
414 | parent_rev_2=entry[ENTRY_PARENT_2], | |
415 | node_id=entry[ENTRY_NODE_ID], |
|
415 | node_id=entry[ENTRY_NODE_ID], | |
416 | sidedata_offset=new_sidedata_offset, |
|
416 | sidedata_offset=new_sidedata_offset, | |
417 | sidedata_compressed_length=sidedata_size, |
|
417 | sidedata_compressed_length=sidedata_size, | |
418 | data_compression_mode=d_comp_mode, |
|
418 | data_compression_mode=d_comp_mode, | |
419 | sidedata_compression_mode=sd_com_mode, |
|
419 | sidedata_compression_mode=sd_com_mode, | |
420 | ) |
|
420 | ) | |
421 | revlog.index.append(new_entry) |
|
421 | revlog.index.append(new_entry) | |
422 | entry_bin = revlog.index.entry_binary(rev) |
|
422 | entry_bin = revlog.index.entry_binary(rev) | |
423 | new_index_file.write(entry_bin) |
|
423 | new_index_file.write(entry_bin) | |
424 |
|
424 | |||
425 | revlog._docket.index_end = new_index_file.tell() |
|
425 | revlog._docket.index_end = new_index_file.tell() | |
426 | revlog._docket.data_end = new_data_file.tell() |
|
426 | revlog._docket.data_end = new_data_file.tell() | |
427 | revlog._docket.sidedata_end = new_sidedata_file.tell() |
|
427 | revlog._docket.sidedata_end = new_sidedata_file.tell() | |
428 |
|
428 | |||
429 |
|
429 | |||
430 | def _rewrite_censor( |
|
430 | def _rewrite_censor( | |
431 | revlog, |
|
431 | revlog, | |
432 | old_index, |
|
432 | old_index, | |
433 | all_files, |
|
433 | all_files, | |
434 | rev, |
|
434 | rev, | |
435 | tombstone, |
|
435 | tombstone, | |
436 | ): |
|
436 | ): | |
437 | """rewrite and append a censored revision""" |
|
437 | """rewrite and append a censored revision""" | |
438 | ( |
|
438 | ( | |
439 | old_data_file, |
|
439 | old_data_file, | |
440 | old_sidedata_file, |
|
440 | old_sidedata_file, | |
441 | new_index_file, |
|
441 | new_index_file, | |
442 | new_data_file, |
|
442 | new_data_file, | |
443 | new_sidedata_file, |
|
443 | new_sidedata_file, | |
444 | ) = all_files |
|
444 | ) = all_files | |
445 | entry = old_index[rev] |
|
445 | entry = old_index[rev] | |
446 |
|
446 | |||
447 | # XXX consider trying the default compression too |
|
447 | # XXX consider trying the default compression too | |
448 | new_data_size = len(tombstone) |
|
448 | new_data_size = len(tombstone) | |
449 | new_data_offset = new_data_file.tell() |
|
449 | new_data_offset = new_data_file.tell() | |
450 | new_data_file.write(tombstone) |
|
450 | new_data_file.write(tombstone) | |
451 |
|
451 | |||
452 | # we are not adding any sidedata as they might leak info about the censored version |
|
452 | # we are not adding any sidedata as they might leak info about the censored version | |
453 |
|
453 | |||
454 | link_rev = entry[ENTRY_LINK_REV] |
|
454 | link_rev = entry[ENTRY_LINK_REV] | |
455 |
|
455 | |||
456 | p1 = entry[ENTRY_PARENT_1] |
|
456 | p1 = entry[ENTRY_PARENT_1] | |
457 | p2 = entry[ENTRY_PARENT_2] |
|
457 | p2 = entry[ENTRY_PARENT_2] | |
458 |
|
458 | |||
459 | new_entry = revlogutils.entry( |
|
459 | new_entry = revlogutils.entry( | |
460 | flags=constants.REVIDX_ISCENSORED, |
|
460 | flags=constants.REVIDX_ISCENSORED, | |
461 | data_offset=new_data_offset, |
|
461 | data_offset=new_data_offset, | |
462 | data_compressed_length=new_data_size, |
|
462 | data_compressed_length=new_data_size, | |
463 | data_uncompressed_length=new_data_size, |
|
463 | data_uncompressed_length=new_data_size, | |
464 | data_delta_base=rev, |
|
464 | data_delta_base=rev, | |
465 | link_rev=link_rev, |
|
465 | link_rev=link_rev, | |
466 | parent_rev_1=p1, |
|
466 | parent_rev_1=p1, | |
467 | parent_rev_2=p2, |
|
467 | parent_rev_2=p2, | |
468 | node_id=entry[ENTRY_NODE_ID], |
|
468 | node_id=entry[ENTRY_NODE_ID], | |
469 | sidedata_offset=0, |
|
469 | sidedata_offset=0, | |
470 | sidedata_compressed_length=0, |
|
470 | sidedata_compressed_length=0, | |
471 | data_compression_mode=COMP_MODE_PLAIN, |
|
471 | data_compression_mode=COMP_MODE_PLAIN, | |
472 | sidedata_compression_mode=COMP_MODE_PLAIN, |
|
472 | sidedata_compression_mode=COMP_MODE_PLAIN, | |
473 | ) |
|
473 | ) | |
474 | revlog.index.append(new_entry) |
|
474 | revlog.index.append(new_entry) | |
475 | entry_bin = revlog.index.entry_binary(rev) |
|
475 | entry_bin = revlog.index.entry_binary(rev) | |
476 | new_index_file.write(entry_bin) |
|
476 | new_index_file.write(entry_bin) | |
477 | revlog._docket.index_end = new_index_file.tell() |
|
477 | revlog._docket.index_end = new_index_file.tell() | |
478 | revlog._docket.data_end = new_data_file.tell() |
|
478 | revlog._docket.data_end = new_data_file.tell() | |
479 |
|
479 | |||
480 |
|
480 | |||
481 | def _get_filename_from_filelog_index(path): |
|
481 | def _get_filename_from_filelog_index(path): | |
482 | # Drop the extension and the `data/` prefix |
|
482 | # Drop the extension and the `data/` prefix | |
483 | path_part = path.rsplit(b'.', 1)[0].split(b'/', 1) |
|
483 | path_part = path.rsplit(b'.', 1)[0].split(b'/', 1) | |
484 | if len(path_part) < 2: |
|
484 | if len(path_part) < 2: | |
485 | msg = _(b"cannot recognize filelog from filename: '%s'") |
|
485 | msg = _(b"cannot recognize filelog from filename: '%s'") | |
486 | msg %= path |
|
486 | msg %= path | |
487 | raise error.Abort(msg) |
|
487 | raise error.Abort(msg) | |
488 |
|
488 | |||
489 | return path_part[1] |
|
489 | return path_part[1] | |
490 |
|
490 | |||
491 |
|
491 | |||
492 | def _filelog_from_filename(repo, path): |
|
492 | def _filelog_from_filename(repo, path): | |
493 | """Returns the filelog for the given `path`. Stolen from `engine.py`""" |
|
493 | """Returns the filelog for the given `path`. Stolen from `engine.py`""" | |
494 |
|
494 | |||
495 | from .. import filelog # avoid cycle |
|
495 | from .. import filelog # avoid cycle | |
496 |
|
496 | |||
497 | fl = filelog.filelog(repo.svfs, path) |
|
497 | fl = filelog.filelog(repo.svfs, path) | |
498 | return fl |
|
498 | return fl | |
499 |
|
499 | |||
500 |
|
500 | |||
501 | def _write_swapped_parents(repo, rl, rev, offset, fp): |
|
501 | def _write_swapped_parents(repo, rl, rev, offset, fp): | |
502 | """Swaps p1 and p2 and overwrites the revlog entry for `rev` in `fp`""" |
|
502 | """Swaps p1 and p2 and overwrites the revlog entry for `rev` in `fp`""" | |
503 | from ..pure import parsers # avoid cycle |
|
503 | from ..pure import parsers # avoid cycle | |
504 |
|
504 | |||
505 | if repo._currentlock(repo._lockref) is None: |
|
505 | if repo._currentlock(repo._lockref) is None: | |
506 | # Let's be paranoid about it |
|
506 | # Let's be paranoid about it | |
507 | msg = "repo needs to be locked to rewrite parents" |
|
507 | msg = "repo needs to be locked to rewrite parents" | |
508 | raise error.ProgrammingError(msg) |
|
508 | raise error.ProgrammingError(msg) | |
509 |
|
509 | |||
510 | index_format = parsers.IndexObject.index_format |
|
510 | index_format = parsers.IndexObject.index_format | |
511 | entry = rl.index[rev] |
|
511 | entry = rl.index[rev] | |
512 | new_entry = list(entry) |
|
512 | new_entry = list(entry) | |
513 | new_entry[5], new_entry[6] = entry[6], entry[5] |
|
513 | new_entry[5], new_entry[6] = entry[6], entry[5] | |
514 | packed = index_format.pack(*new_entry[:8]) |
|
514 | packed = index_format.pack(*new_entry[:8]) | |
515 | fp.seek(offset) |
|
515 | fp.seek(offset) | |
516 | fp.write(packed) |
|
516 | fp.write(packed) | |
517 |
|
517 | |||
518 |
|
518 | |||
519 | def _reorder_filelog_parents(repo, fl, to_fix): |
|
519 | def _reorder_filelog_parents(repo, fl, to_fix): | |
520 | """ |
|
520 | """ | |
521 | Swaps p1 and p2 for all `to_fix` revisions of filelog `fl` and writes the |
|
521 | Swaps p1 and p2 for all `to_fix` revisions of filelog `fl` and writes the | |
522 | new version to disk, overwriting the old one with a rename. |
|
522 | new version to disk, overwriting the old one with a rename. | |
523 | """ |
|
523 | """ | |
524 | from ..pure import parsers # avoid cycle |
|
524 | from ..pure import parsers # avoid cycle | |
525 |
|
525 | |||
526 | ui = repo.ui |
|
526 | ui = repo.ui | |
527 | assert len(to_fix) > 0 |
|
527 | assert len(to_fix) > 0 | |
528 | rl = fl._revlog |
|
528 | rl = fl._revlog | |
529 | if rl._format_version != constants.REVLOGV1: |
|
529 | if rl._format_version != constants.REVLOGV1: | |
530 | msg = "expected version 1 revlog, got version '%d'" % rl._format_version |
|
530 | msg = "expected version 1 revlog, got version '%d'" % rl._format_version | |
531 | raise error.ProgrammingError(msg) |
|
531 | raise error.ProgrammingError(msg) | |
532 |
|
532 | |||
533 | index_file = rl._indexfile |
|
533 | index_file = rl._indexfile | |
534 | new_file_path = index_file + b'.tmp-parents-fix' |
|
534 | new_file_path = index_file + b'.tmp-parents-fix' | |
535 | repaired_msg = _(b"repaired revision %d of 'filelog %s'\n") |
|
535 | repaired_msg = _(b"repaired revision %d of 'filelog %s'\n") | |
536 |
|
536 | |||
537 | with ui.uninterruptible(): |
|
537 | with ui.uninterruptible(): | |
538 | try: |
|
538 | try: | |
539 | util.copyfile( |
|
539 | util.copyfile( | |
540 | rl.opener.join(index_file), |
|
540 | rl.opener.join(index_file), | |
541 | rl.opener.join(new_file_path), |
|
541 | rl.opener.join(new_file_path), | |
542 | checkambig=rl._checkambig, |
|
542 | checkambig=rl._checkambig, | |
543 | ) |
|
543 | ) | |
544 |
|
544 | |||
545 | with rl.opener(new_file_path, mode=b"r+") as fp: |
|
545 | with rl.opener(new_file_path, mode=b"r+") as fp: | |
546 | if rl._inline: |
|
546 | if rl._inline: | |
547 | index = parsers.InlinedIndexObject(fp.read()) |
|
547 | index = parsers.InlinedIndexObject(fp.read()) | |
548 | for rev in fl.revs(): |
|
548 | for rev in fl.revs(): | |
549 | if rev in to_fix: |
|
549 | if rev in to_fix: | |
550 | offset = index._calculate_index(rev) |
|
550 | offset = index._calculate_index(rev) | |
551 | _write_swapped_parents(repo, rl, rev, offset, fp) |
|
551 | _write_swapped_parents(repo, rl, rev, offset, fp) | |
552 | ui.write(repaired_msg % (rev, index_file)) |
|
552 | ui.write(repaired_msg % (rev, index_file)) | |
553 | else: |
|
553 | else: | |
554 | index_format = parsers.IndexObject.index_format |
|
554 | index_format = parsers.IndexObject.index_format | |
555 | for rev in to_fix: |
|
555 | for rev in to_fix: | |
556 | offset = rev * index_format.size |
|
556 | offset = rev * index_format.size | |
557 | _write_swapped_parents(repo, rl, rev, offset, fp) |
|
557 | _write_swapped_parents(repo, rl, rev, offset, fp) | |
558 | ui.write(repaired_msg % (rev, index_file)) |
|
558 | ui.write(repaired_msg % (rev, index_file)) | |
559 |
|
559 | |||
560 | rl.opener.rename(new_file_path, index_file) |
|
560 | rl.opener.rename(new_file_path, index_file) | |
561 | rl.clearcaches() |
|
561 | rl.clearcaches() | |
562 | rl._loadindex() |
|
562 | rl._loadindex() | |
563 | finally: |
|
563 | finally: | |
564 | util.tryunlink(new_file_path) |
|
564 | util.tryunlink(new_file_path) | |
565 |
|
565 | |||
566 |
|
566 | |||
567 | def _is_revision_affected(fl, filerev, metadata_cache=None): |
|
567 | def _is_revision_affected(fl, filerev, metadata_cache=None): | |
568 | full_text = lambda: fl._revlog.rawdata(filerev) |
|
568 | full_text = lambda: fl._revlog.rawdata(filerev) | |
569 | parent_revs = lambda: fl._revlog.parentrevs(filerev) |
|
569 | parent_revs = lambda: fl._revlog.parentrevs(filerev) | |
570 | return _is_revision_affected_inner( |
|
570 | return _is_revision_affected_inner( | |
571 | full_text, parent_revs, filerev, metadata_cache |
|
571 | full_text, parent_revs, filerev, metadata_cache | |
572 | ) |
|
572 | ) | |
573 |
|
573 | |||
574 |
|
574 | |||
575 | def _is_revision_affected_inner( |
|
575 | def _is_revision_affected_inner( | |
576 | full_text, |
|
576 | full_text, | |
577 | parents_revs, |
|
577 | parents_revs, | |
578 | filerev, |
|
578 | filerev, | |
579 | metadata_cache=None, |
|
579 | metadata_cache=None, | |
580 | ): |
|
580 | ): | |
581 | """Mercurial currently (5.9rc0) uses `p1 == nullrev and p2 != nullrev` as a |
|
581 | """Mercurial currently (5.9rc0) uses `p1 == nullrev and p2 != nullrev` as a | |
582 | special meaning compared to the reverse in the context of filelog-based |
|
582 | special meaning compared to the reverse in the context of filelog-based | |
583 | copytracing. issue6528 exists because new code assumed that parent ordering |
|
583 | copytracing. issue6528 exists because new code assumed that parent ordering | |
584 | didn't matter, so this detects if the revision contains metadata (since |
|
584 | didn't matter, so this detects if the revision contains metadata (since | |
585 | it's only used for filelog-based copytracing) and its parents are in the |
|
585 | it's only used for filelog-based copytracing) and its parents are in the | |
586 | "wrong" order.""" |
|
586 | "wrong" order.""" | |
587 | try: |
|
587 | try: | |
588 | raw_text = full_text() |
|
588 | raw_text = full_text() | |
589 | except error.CensoredNodeError: |
|
589 | except error.CensoredNodeError: | |
590 | # We don't care about censored nodes as they never carry metadata |
|
590 | # We don't care about censored nodes as they never carry metadata | |
591 | return False |
|
591 | return False | |
592 | has_meta = raw_text.startswith(b'\x01\n') |
|
592 | ||
|
593 | # raw text can be a `memoryview`, which doesn't implement `startswith` | |||
|
594 | has_meta = len(raw_text) >= 2 and bytes(raw_text[:2]) == b'\x01\n' | |||
593 | if metadata_cache is not None: |
|
595 | if metadata_cache is not None: | |
594 | metadata_cache[filerev] = has_meta |
|
596 | metadata_cache[filerev] = has_meta | |
595 | if has_meta: |
|
597 | if has_meta: | |
596 | (p1, p2) = parents_revs() |
|
598 | (p1, p2) = parents_revs() | |
597 | if p1 != nullrev and p2 == nullrev: |
|
599 | if p1 != nullrev and p2 == nullrev: | |
598 | return True |
|
600 | return True | |
599 | return False |
|
601 | return False | |
600 |
|
602 | |||
601 |
|
603 | |||
602 | def _is_revision_affected_fast(repo, fl, filerev, metadata_cache): |
|
604 | def _is_revision_affected_fast(repo, fl, filerev, metadata_cache): | |
603 | rl = fl._revlog |
|
605 | rl = fl._revlog | |
604 | is_censored = lambda: rl.iscensored(filerev) |
|
606 | is_censored = lambda: rl.iscensored(filerev) | |
605 | delta_base = lambda: rl.deltaparent(filerev) |
|
607 | delta_base = lambda: rl.deltaparent(filerev) | |
606 | delta = lambda: rl._chunk(filerev) |
|
608 | delta = lambda: rl._chunk(filerev) | |
607 | full_text = lambda: rl.rawdata(filerev) |
|
609 | full_text = lambda: rl.rawdata(filerev) | |
608 | parent_revs = lambda: rl.parentrevs(filerev) |
|
610 | parent_revs = lambda: rl.parentrevs(filerev) | |
609 | return _is_revision_affected_fast_inner( |
|
611 | return _is_revision_affected_fast_inner( | |
610 | is_censored, |
|
612 | is_censored, | |
611 | delta_base, |
|
613 | delta_base, | |
612 | delta, |
|
614 | delta, | |
613 | full_text, |
|
615 | full_text, | |
614 | parent_revs, |
|
616 | parent_revs, | |
615 | filerev, |
|
617 | filerev, | |
616 | metadata_cache, |
|
618 | metadata_cache, | |
617 | ) |
|
619 | ) | |
618 |
|
620 | |||
619 |
|
621 | |||
620 | def _is_revision_affected_fast_inner( |
|
622 | def _is_revision_affected_fast_inner( | |
621 | is_censored, |
|
623 | is_censored, | |
622 | delta_base, |
|
624 | delta_base, | |
623 | delta, |
|
625 | delta, | |
624 | full_text, |
|
626 | full_text, | |
625 | parent_revs, |
|
627 | parent_revs, | |
626 | filerev, |
|
628 | filerev, | |
627 | metadata_cache, |
|
629 | metadata_cache, | |
628 | ): |
|
630 | ): | |
629 | """Optimization fast-path for `_is_revision_affected`. |
|
631 | """Optimization fast-path for `_is_revision_affected`. | |
630 |
|
632 | |||
631 | `metadata_cache` is a dict of `{rev: has_metadata}` which allows any |
|
633 | `metadata_cache` is a dict of `{rev: has_metadata}` which allows any | |
632 | revision to check if its base has metadata, saving computation of the full |
|
634 | revision to check if its base has metadata, saving computation of the full | |
633 | text, instead looking at the current delta. |
|
635 | text, instead looking at the current delta. | |
634 |
|
636 | |||
635 | This optimization only works if the revisions are looked at in order.""" |
|
637 | This optimization only works if the revisions are looked at in order.""" | |
636 |
|
638 | |||
637 | if is_censored(): |
|
639 | if is_censored(): | |
638 | # Censored revisions don't contain metadata, so they cannot be affected |
|
640 | # Censored revisions don't contain metadata, so they cannot be affected | |
639 | metadata_cache[filerev] = False |
|
641 | metadata_cache[filerev] = False | |
640 | return False |
|
642 | return False | |
641 |
|
643 | |||
642 | p1, p2 = parent_revs() |
|
644 | p1, p2 = parent_revs() | |
643 | if p1 == nullrev or p2 != nullrev: |
|
645 | if p1 == nullrev or p2 != nullrev: | |
644 | return False |
|
646 | return False | |
645 |
|
647 | |||
646 | delta_parent = delta_base() |
|
648 | delta_parent = delta_base() | |
647 | parent_has_metadata = metadata_cache.get(delta_parent) |
|
649 | parent_has_metadata = metadata_cache.get(delta_parent) | |
648 | if parent_has_metadata is None: |
|
650 | if parent_has_metadata is None: | |
649 | return _is_revision_affected_inner( |
|
651 | return _is_revision_affected_inner( | |
650 | full_text, |
|
652 | full_text, | |
651 | parent_revs, |
|
653 | parent_revs, | |
652 | filerev, |
|
654 | filerev, | |
653 | metadata_cache, |
|
655 | metadata_cache, | |
654 | ) |
|
656 | ) | |
655 |
|
657 | |||
656 | chunk = delta() |
|
658 | chunk = delta() | |
657 | if not len(chunk): |
|
659 | if not len(chunk): | |
658 | # No diff for this revision |
|
660 | # No diff for this revision | |
659 | return parent_has_metadata |
|
661 | return parent_has_metadata | |
660 |
|
662 | |||
661 | header_length = 12 |
|
663 | header_length = 12 | |
662 | if len(chunk) < header_length: |
|
664 | if len(chunk) < header_length: | |
663 | raise error.Abort(_(b"patch cannot be decoded")) |
|
665 | raise error.Abort(_(b"patch cannot be decoded")) | |
664 |
|
666 | |||
665 | start, _end, _length = struct.unpack(b">lll", chunk[:header_length]) |
|
667 | start, _end, _length = struct.unpack(b">lll", chunk[:header_length]) | |
666 |
|
668 | |||
667 | if start < 2: # len(b'\x01\n') == 2 |
|
669 | if start < 2: # len(b'\x01\n') == 2 | |
668 | # This delta does *something* to the metadata marker (if any). |
|
670 | # This delta does *something* to the metadata marker (if any). | |
669 | # Check it the slow way |
|
671 | # Check it the slow way | |
670 | is_affected = _is_revision_affected_inner( |
|
672 | is_affected = _is_revision_affected_inner( | |
671 | full_text, |
|
673 | full_text, | |
672 | parent_revs, |
|
674 | parent_revs, | |
673 | filerev, |
|
675 | filerev, | |
674 | metadata_cache, |
|
676 | metadata_cache, | |
675 | ) |
|
677 | ) | |
676 | return is_affected |
|
678 | return is_affected | |
677 |
|
679 | |||
678 | # The diff did not remove or add the metadata header, it's then in the same |
|
680 | # The diff did not remove or add the metadata header, it's then in the same | |
679 | # situation as its parent |
|
681 | # situation as its parent | |
680 | metadata_cache[filerev] = parent_has_metadata |
|
682 | metadata_cache[filerev] = parent_has_metadata | |
681 | return parent_has_metadata |
|
683 | return parent_has_metadata | |
682 |
|
684 | |||
683 |
|
685 | |||
684 | def _from_report(ui, repo, context, from_report, dry_run): |
|
686 | def _from_report(ui, repo, context, from_report, dry_run): | |
685 | """ |
|
687 | """ | |
686 | Fix the revisions given in the `from_report` file, but still checks if the |
|
688 | Fix the revisions given in the `from_report` file, but still checks if the | |
687 | revisions are indeed affected to prevent an unfortunate cyclic situation |
|
689 | revisions are indeed affected to prevent an unfortunate cyclic situation | |
688 | where we'd swap well-ordered parents again. |
|
690 | where we'd swap well-ordered parents again. | |
689 |
|
691 | |||
690 | See the doc for `debug_fix_issue6528` for the format documentation. |
|
692 | See the doc for `debug_fix_issue6528` for the format documentation. | |
691 | """ |
|
693 | """ | |
692 | ui.write(_(b"loading report file '%s'\n") % from_report) |
|
694 | ui.write(_(b"loading report file '%s'\n") % from_report) | |
693 |
|
695 | |||
694 | with context(), open(from_report, mode='rb') as f: |
|
696 | with context(), open(from_report, mode='rb') as f: | |
695 | for line in f.read().split(b'\n'): |
|
697 | for line in f.read().split(b'\n'): | |
696 | if not line: |
|
698 | if not line: | |
697 | continue |
|
699 | continue | |
698 | filenodes, filename = line.split(b' ', 1) |
|
700 | filenodes, filename = line.split(b' ', 1) | |
699 | fl = _filelog_from_filename(repo, filename) |
|
701 | fl = _filelog_from_filename(repo, filename) | |
700 | to_fix = set( |
|
702 | to_fix = set( | |
701 | fl.rev(binascii.unhexlify(n)) for n in filenodes.split(b',') |
|
703 | fl.rev(binascii.unhexlify(n)) for n in filenodes.split(b',') | |
702 | ) |
|
704 | ) | |
703 | excluded = set() |
|
705 | excluded = set() | |
704 |
|
706 | |||
705 | for filerev in to_fix: |
|
707 | for filerev in to_fix: | |
706 | if _is_revision_affected(fl, filerev): |
|
708 | if _is_revision_affected(fl, filerev): | |
707 | msg = b"found affected revision %d for filelog '%s'\n" |
|
709 | msg = b"found affected revision %d for filelog '%s'\n" | |
708 | ui.warn(msg % (filerev, filename)) |
|
710 | ui.warn(msg % (filerev, filename)) | |
709 | else: |
|
711 | else: | |
710 | msg = _(b"revision %s of file '%s' is not affected\n") |
|
712 | msg = _(b"revision %s of file '%s' is not affected\n") | |
711 | msg %= (binascii.hexlify(fl.node(filerev)), filename) |
|
713 | msg %= (binascii.hexlify(fl.node(filerev)), filename) | |
712 | ui.warn(msg) |
|
714 | ui.warn(msg) | |
713 | excluded.add(filerev) |
|
715 | excluded.add(filerev) | |
714 |
|
716 | |||
715 | to_fix = to_fix - excluded |
|
717 | to_fix = to_fix - excluded | |
716 | if not to_fix: |
|
718 | if not to_fix: | |
717 | msg = _(b"no affected revisions were found for '%s'\n") |
|
719 | msg = _(b"no affected revisions were found for '%s'\n") | |
718 | ui.write(msg % filename) |
|
720 | ui.write(msg % filename) | |
719 | continue |
|
721 | continue | |
720 | if not dry_run: |
|
722 | if not dry_run: | |
721 | _reorder_filelog_parents(repo, fl, sorted(to_fix)) |
|
723 | _reorder_filelog_parents(repo, fl, sorted(to_fix)) | |
722 |
|
724 | |||
723 |
|
725 | |||
724 | def filter_delta_issue6528(revlog, deltas_iter): |
|
726 | def filter_delta_issue6528(revlog, deltas_iter): | |
725 | """filter incomind deltas to repaire issue 6528 on the fly""" |
|
727 | """filter incomind deltas to repaire issue 6528 on the fly""" | |
726 | metadata_cache = {} |
|
728 | metadata_cache = {} | |
727 |
|
729 | |||
728 | deltacomputer = deltas.deltacomputer(revlog) |
|
730 | deltacomputer = deltas.deltacomputer(revlog) | |
729 |
|
731 | |||
730 | for rev, d in enumerate(deltas_iter, len(revlog)): |
|
732 | for rev, d in enumerate(deltas_iter, len(revlog)): | |
731 | ( |
|
733 | ( | |
732 | node, |
|
734 | node, | |
733 | p1_node, |
|
735 | p1_node, | |
734 | p2_node, |
|
736 | p2_node, | |
735 | linknode, |
|
737 | linknode, | |
736 | deltabase, |
|
738 | deltabase, | |
737 | delta, |
|
739 | delta, | |
738 | flags, |
|
740 | flags, | |
739 | sidedata, |
|
741 | sidedata, | |
740 | ) = d |
|
742 | ) = d | |
741 |
|
743 | |||
742 | if not revlog.index.has_node(deltabase): |
|
744 | if not revlog.index.has_node(deltabase): | |
743 | raise error.LookupError( |
|
745 | raise error.LookupError( | |
744 | deltabase, revlog.radix, _(b'unknown parent') |
|
746 | deltabase, revlog.radix, _(b'unknown parent') | |
745 | ) |
|
747 | ) | |
746 | base_rev = revlog.rev(deltabase) |
|
748 | base_rev = revlog.rev(deltabase) | |
747 | if not revlog.index.has_node(p1_node): |
|
749 | if not revlog.index.has_node(p1_node): | |
748 | raise error.LookupError(p1_node, revlog.radix, _(b'unknown parent')) |
|
750 | raise error.LookupError(p1_node, revlog.radix, _(b'unknown parent')) | |
749 | p1_rev = revlog.rev(p1_node) |
|
751 | p1_rev = revlog.rev(p1_node) | |
750 | if not revlog.index.has_node(p2_node): |
|
752 | if not revlog.index.has_node(p2_node): | |
751 | raise error.LookupError(p2_node, revlog.radix, _(b'unknown parent')) |
|
753 | raise error.LookupError(p2_node, revlog.radix, _(b'unknown parent')) | |
752 | p2_rev = revlog.rev(p2_node) |
|
754 | p2_rev = revlog.rev(p2_node) | |
753 |
|
755 | |||
754 | is_censored = lambda: bool(flags & REVIDX_ISCENSORED) |
|
756 | is_censored = lambda: bool(flags & REVIDX_ISCENSORED) | |
755 | delta_base = lambda: revlog.rev(delta_base) |
|
757 | delta_base = lambda: revlog.rev(delta_base) | |
756 | delta_base = lambda: base_rev |
|
758 | delta_base = lambda: base_rev | |
757 | parent_revs = lambda: (p1_rev, p2_rev) |
|
759 | parent_revs = lambda: (p1_rev, p2_rev) | |
758 |
|
760 | |||
759 | def full_text(): |
|
761 | def full_text(): | |
760 | # note: being able to reuse the full text computation in the |
|
762 | # note: being able to reuse the full text computation in the | |
761 | # underlying addrevision would be useful however this is a bit too |
|
763 | # underlying addrevision would be useful however this is a bit too | |
762 | # intrusive the for the "quick" issue6528 we are writing before the |
|
764 | # intrusive the for the "quick" issue6528 we are writing before the | |
763 | # 5.8 release |
|
765 | # 5.8 release | |
764 | textlen = mdiff.patchedsize(revlog.size(base_rev), delta) |
|
766 | textlen = mdiff.patchedsize(revlog.size(base_rev), delta) | |
765 |
|
767 | |||
766 | revinfo = revlogutils.revisioninfo( |
|
768 | revinfo = revlogutils.revisioninfo( | |
767 | node, |
|
769 | node, | |
768 | p1_node, |
|
770 | p1_node, | |
769 | p2_node, |
|
771 | p2_node, | |
770 | [None], |
|
772 | [None], | |
771 | textlen, |
|
773 | textlen, | |
772 | (base_rev, delta), |
|
774 | (base_rev, delta), | |
773 | flags, |
|
775 | flags, | |
774 | ) |
|
776 | ) | |
775 | # cached by the global "writing" context |
|
777 | # cached by the global "writing" context | |
776 | assert revlog._writinghandles is not None |
|
778 | assert revlog._writinghandles is not None | |
777 | if revlog._inline: |
|
779 | if revlog._inline: | |
778 | fh = revlog._writinghandles[0] |
|
780 | fh = revlog._writinghandles[0] | |
779 | else: |
|
781 | else: | |
780 | fh = revlog._writinghandles[1] |
|
782 | fh = revlog._writinghandles[1] | |
781 | return deltacomputer.buildtext(revinfo, fh) |
|
783 | return deltacomputer.buildtext(revinfo, fh) | |
782 |
|
784 | |||
783 | is_affected = _is_revision_affected_fast_inner( |
|
785 | is_affected = _is_revision_affected_fast_inner( | |
784 | is_censored, |
|
786 | is_censored, | |
785 | delta_base, |
|
787 | delta_base, | |
786 | lambda: delta, |
|
788 | lambda: delta, | |
787 | full_text, |
|
789 | full_text, | |
788 | parent_revs, |
|
790 | parent_revs, | |
789 | rev, |
|
791 | rev, | |
790 | metadata_cache, |
|
792 | metadata_cache, | |
791 | ) |
|
793 | ) | |
792 | if is_affected: |
|
794 | if is_affected: | |
793 | d = ( |
|
795 | d = ( | |
794 | node, |
|
796 | node, | |
795 | p2_node, |
|
797 | p2_node, | |
796 | p1_node, |
|
798 | p1_node, | |
797 | linknode, |
|
799 | linknode, | |
798 | deltabase, |
|
800 | deltabase, | |
799 | delta, |
|
801 | delta, | |
800 | flags, |
|
802 | flags, | |
801 | sidedata, |
|
803 | sidedata, | |
802 | ) |
|
804 | ) | |
803 | yield d |
|
805 | yield d | |
804 |
|
806 | |||
805 |
|
807 | |||
806 | def repair_issue6528( |
|
808 | def repair_issue6528( | |
807 | ui, repo, dry_run=False, to_report=None, from_report=None, paranoid=False |
|
809 | ui, repo, dry_run=False, to_report=None, from_report=None, paranoid=False | |
808 | ): |
|
810 | ): | |
809 | from .. import store # avoid cycle |
|
811 | from .. import store # avoid cycle | |
810 |
|
812 | |||
811 | @contextlib.contextmanager |
|
813 | @contextlib.contextmanager | |
812 | def context(): |
|
814 | def context(): | |
813 | if dry_run or to_report: # No need for locking |
|
815 | if dry_run or to_report: # No need for locking | |
814 | yield |
|
816 | yield | |
815 | else: |
|
817 | else: | |
816 | with repo.wlock(), repo.lock(): |
|
818 | with repo.wlock(), repo.lock(): | |
817 | yield |
|
819 | yield | |
818 |
|
820 | |||
819 | if from_report: |
|
821 | if from_report: | |
820 | return _from_report(ui, repo, context, from_report, dry_run) |
|
822 | return _from_report(ui, repo, context, from_report, dry_run) | |
821 |
|
823 | |||
822 | report_entries = [] |
|
824 | report_entries = [] | |
823 |
|
825 | |||
824 | with context(): |
|
826 | with context(): | |
825 | files = list( |
|
827 | files = list( | |
826 | (file_type, path) |
|
828 | (file_type, path) | |
827 | for (file_type, path, _e, _s) in repo.store.datafiles() |
|
829 | for (file_type, path, _e, _s) in repo.store.datafiles() | |
828 | if path.endswith(b'.i') and file_type & store.FILEFLAGS_FILELOG |
|
830 | if path.endswith(b'.i') and file_type & store.FILEFLAGS_FILELOG | |
829 | ) |
|
831 | ) | |
830 |
|
832 | |||
831 | progress = ui.makeprogress( |
|
833 | progress = ui.makeprogress( | |
832 | _(b"looking for affected revisions"), |
|
834 | _(b"looking for affected revisions"), | |
833 | unit=_(b"filelogs"), |
|
835 | unit=_(b"filelogs"), | |
834 | total=len(files), |
|
836 | total=len(files), | |
835 | ) |
|
837 | ) | |
836 | found_nothing = True |
|
838 | found_nothing = True | |
837 |
|
839 | |||
838 | for file_type, path in files: |
|
840 | for file_type, path in files: | |
839 | if ( |
|
841 | if ( | |
840 | not path.endswith(b'.i') |
|
842 | not path.endswith(b'.i') | |
841 | or not file_type & store.FILEFLAGS_FILELOG |
|
843 | or not file_type & store.FILEFLAGS_FILELOG | |
842 | ): |
|
844 | ): | |
843 | continue |
|
845 | continue | |
844 | progress.increment() |
|
846 | progress.increment() | |
845 | filename = _get_filename_from_filelog_index(path) |
|
847 | filename = _get_filename_from_filelog_index(path) | |
846 | fl = _filelog_from_filename(repo, filename) |
|
848 | fl = _filelog_from_filename(repo, filename) | |
847 |
|
849 | |||
848 | # Set of filerevs (or hex filenodes if `to_report`) that need fixing |
|
850 | # Set of filerevs (or hex filenodes if `to_report`) that need fixing | |
849 | to_fix = set() |
|
851 | to_fix = set() | |
850 | metadata_cache = {} |
|
852 | metadata_cache = {} | |
851 | for filerev in fl.revs(): |
|
853 | for filerev in fl.revs(): | |
852 | affected = _is_revision_affected_fast( |
|
854 | affected = _is_revision_affected_fast( | |
853 | repo, fl, filerev, metadata_cache |
|
855 | repo, fl, filerev, metadata_cache | |
854 | ) |
|
856 | ) | |
855 | if paranoid: |
|
857 | if paranoid: | |
856 | slow = _is_revision_affected(fl, filerev) |
|
858 | slow = _is_revision_affected(fl, filerev) | |
857 | if slow != affected: |
|
859 | if slow != affected: | |
858 | msg = _(b"paranoid check failed for '%s' at node %s") |
|
860 | msg = _(b"paranoid check failed for '%s' at node %s") | |
859 | node = binascii.hexlify(fl.node(filerev)) |
|
861 | node = binascii.hexlify(fl.node(filerev)) | |
860 | raise error.Abort(msg % (filename, node)) |
|
862 | raise error.Abort(msg % (filename, node)) | |
861 | if affected: |
|
863 | if affected: | |
862 | msg = b"found affected revision %d for filelog '%s'\n" |
|
864 | msg = b"found affected revision %d for filelog '%s'\n" | |
863 | ui.warn(msg % (filerev, path)) |
|
865 | ui.warn(msg % (filerev, path)) | |
864 | found_nothing = False |
|
866 | found_nothing = False | |
865 | if not dry_run: |
|
867 | if not dry_run: | |
866 | if to_report: |
|
868 | if to_report: | |
867 | to_fix.add(binascii.hexlify(fl.node(filerev))) |
|
869 | to_fix.add(binascii.hexlify(fl.node(filerev))) | |
868 | else: |
|
870 | else: | |
869 | to_fix.add(filerev) |
|
871 | to_fix.add(filerev) | |
870 |
|
872 | |||
871 | if to_fix: |
|
873 | if to_fix: | |
872 | to_fix = sorted(to_fix) |
|
874 | to_fix = sorted(to_fix) | |
873 | if to_report: |
|
875 | if to_report: | |
874 | report_entries.append((filename, to_fix)) |
|
876 | report_entries.append((filename, to_fix)) | |
875 | else: |
|
877 | else: | |
876 | _reorder_filelog_parents(repo, fl, to_fix) |
|
878 | _reorder_filelog_parents(repo, fl, to_fix) | |
877 |
|
879 | |||
878 | if found_nothing: |
|
880 | if found_nothing: | |
879 | ui.write(_(b"no affected revisions were found\n")) |
|
881 | ui.write(_(b"no affected revisions were found\n")) | |
880 |
|
882 | |||
881 | if to_report and report_entries: |
|
883 | if to_report and report_entries: | |
882 | with open(to_report, mode="wb") as f: |
|
884 | with open(to_report, mode="wb") as f: | |
883 | for path, to_fix in report_entries: |
|
885 | for path, to_fix in report_entries: | |
884 | f.write(b"%s %s\n" % (b",".join(to_fix), path)) |
|
886 | f.write(b"%s %s\n" % (b",".join(to_fix), path)) | |
885 |
|
887 | |||
886 | progress.complete() |
|
888 | progress.complete() |
General Comments 0
You need to be logged in to leave comments.
Login now