Show More
@@ -1,414 +1,436 b'' | |||
|
1 | 1 | # censor code related to censoring revision |
|
2 | 2 | # coding: utf8 |
|
3 | 3 | # |
|
4 | 4 | # Copyright 2021 Pierre-Yves David <pierre-yves.david@octobus.net> |
|
5 | 5 | # Copyright 2015 Google, Inc <martinvonz@google.com> |
|
6 | 6 | # |
|
7 | 7 | # This software may be used and distributed according to the terms of the |
|
8 | 8 | # GNU General Public License version 2 or any later version. |
|
9 | 9 | |
|
10 | 10 | import contextlib |
|
11 | 11 | import os |
|
12 | 12 | |
|
13 | 13 | from ..node import ( |
|
14 | 14 | nullrev, |
|
15 | 15 | ) |
|
16 | 16 | from .constants import ( |
|
17 | 17 | COMP_MODE_PLAIN, |
|
18 | 18 | ENTRY_DATA_COMPRESSED_LENGTH, |
|
19 | 19 | ENTRY_DATA_COMPRESSION_MODE, |
|
20 | 20 | ENTRY_DATA_OFFSET, |
|
21 | 21 | ENTRY_DATA_UNCOMPRESSED_LENGTH, |
|
22 | 22 | ENTRY_DELTA_BASE, |
|
23 | 23 | ENTRY_LINK_REV, |
|
24 | 24 | ENTRY_NODE_ID, |
|
25 | 25 | ENTRY_PARENT_1, |
|
26 | 26 | ENTRY_PARENT_2, |
|
27 | 27 | ENTRY_SIDEDATA_COMPRESSED_LENGTH, |
|
28 | 28 | ENTRY_SIDEDATA_COMPRESSION_MODE, |
|
29 | 29 | ENTRY_SIDEDATA_OFFSET, |
|
30 | 30 | REVLOGV0, |
|
31 | 31 | REVLOGV1, |
|
32 | 32 | ) |
|
33 | 33 | from ..i18n import _ |
|
34 | 34 | |
|
35 | 35 | from .. import ( |
|
36 | 36 | error, |
|
37 | 37 | pycompat, |
|
38 | 38 | revlogutils, |
|
39 | 39 | util, |
|
40 | 40 | ) |
|
41 | 41 | from ..utils import ( |
|
42 | 42 | storageutil, |
|
43 | 43 | ) |
|
44 | 44 | from . import ( |
|
45 | 45 | constants, |
|
46 | 46 | deltas, |
|
47 | 47 | ) |
|
48 | 48 | |
|
49 | 49 | |
|
50 | 50 | def v1_censor(rl, tr, censornode, tombstone=b''): |
|
51 | 51 | """censors a revision in a "version 1" revlog""" |
|
52 | 52 | assert rl._format_version == constants.REVLOGV1, rl._format_version |
|
53 | 53 | |
|
54 | 54 | # avoid cycle |
|
55 | 55 | from .. import revlog |
|
56 | 56 | |
|
57 | 57 | censorrev = rl.rev(censornode) |
|
58 | 58 | tombstone = storageutil.packmeta({b'censored': tombstone}, b'') |
|
59 | 59 | |
|
60 | 60 | # Rewriting the revlog in place is hard. Our strategy for censoring is |
|
61 | 61 | # to create a new revlog, copy all revisions to it, then replace the |
|
62 | 62 | # revlogs on transaction close. |
|
63 | 63 | # |
|
64 | 64 | # This is a bit dangerous. We could easily have a mismatch of state. |
|
65 | 65 | newrl = revlog.revlog( |
|
66 | 66 | rl.opener, |
|
67 | 67 | target=rl.target, |
|
68 | 68 | radix=rl.radix, |
|
69 | 69 | postfix=b'tmpcensored', |
|
70 | 70 | censorable=True, |
|
71 | 71 | ) |
|
72 | 72 | newrl._format_version = rl._format_version |
|
73 | 73 | newrl._format_flags = rl._format_flags |
|
74 | 74 | newrl._generaldelta = rl._generaldelta |
|
75 | 75 | newrl._parse_index = rl._parse_index |
|
76 | 76 | |
|
77 | 77 | for rev in rl.revs(): |
|
78 | 78 | node = rl.node(rev) |
|
79 | 79 | p1, p2 = rl.parents(node) |
|
80 | 80 | |
|
81 | 81 | if rev == censorrev: |
|
82 | 82 | newrl.addrawrevision( |
|
83 | 83 | tombstone, |
|
84 | 84 | tr, |
|
85 | 85 | rl.linkrev(censorrev), |
|
86 | 86 | p1, |
|
87 | 87 | p2, |
|
88 | 88 | censornode, |
|
89 | 89 | constants.REVIDX_ISCENSORED, |
|
90 | 90 | ) |
|
91 | 91 | |
|
92 | 92 | if newrl.deltaparent(rev) != nullrev: |
|
93 | 93 | m = _(b'censored revision stored as delta; cannot censor') |
|
94 | 94 | h = _( |
|
95 | 95 | b'censoring of revlogs is not fully implemented;' |
|
96 | 96 | b' please report this bug' |
|
97 | 97 | ) |
|
98 | 98 | raise error.Abort(m, hint=h) |
|
99 | 99 | continue |
|
100 | 100 | |
|
101 | 101 | if rl.iscensored(rev): |
|
102 | 102 | if rl.deltaparent(rev) != nullrev: |
|
103 | 103 | m = _( |
|
104 | 104 | b'cannot censor due to censored ' |
|
105 | 105 | b'revision having delta stored' |
|
106 | 106 | ) |
|
107 | 107 | raise error.Abort(m) |
|
108 | 108 | rawtext = rl._chunk(rev) |
|
109 | 109 | else: |
|
110 | 110 | rawtext = rl.rawdata(rev) |
|
111 | 111 | |
|
112 | 112 | newrl.addrawrevision( |
|
113 | 113 | rawtext, tr, rl.linkrev(rev), p1, p2, node, rl.flags(rev) |
|
114 | 114 | ) |
|
115 | 115 | |
|
116 | 116 | tr.addbackup(rl._indexfile, location=b'store') |
|
117 | 117 | if not rl._inline: |
|
118 | 118 | tr.addbackup(rl._datafile, location=b'store') |
|
119 | 119 | |
|
120 | 120 | rl.opener.rename(newrl._indexfile, rl._indexfile) |
|
121 | 121 | if not rl._inline: |
|
122 | 122 | rl.opener.rename(newrl._datafile, rl._datafile) |
|
123 | 123 | |
|
124 | 124 | rl.clearcaches() |
|
125 | 125 | rl._loadindex() |
|
126 | 126 | |
|
127 | 127 | |
|
128 | 128 | def v2_censor(rl, tr, censornode, tombstone=b''): |
|
129 | 129 | """censors a revision in a "version 2" revlog""" |
|
130 | 130 | # General principle |
|
131 | 131 | # |
|
132 | 132 | # We create new revlog files (index/data/sidedata) to copy the content of |
|
133 | 133 | # the existing data without the censored data. |
|
134 | 134 | # |
|
135 | 135 | # We need to recompute new delta for any revision that used the censored |
|
136 | 136 | # revision as delta base. As the cumulative size of the new delta may be |
|
137 | 137 | # large, we store them in a temporary file until they are stored in their |
|
138 | 138 | # final destination. |
|
139 | 139 | # |
|
140 | 140 | # All data before the censored data can be blindly copied. The rest needs |
|
141 | 141 | # to be copied as we go and the associated index entry needs adjustement. |
|
142 | 142 | |
|
143 | 143 | assert rl._format_version != REVLOGV0, rl._format_version |
|
144 | 144 | assert rl._format_version != REVLOGV1, rl._format_version |
|
145 | 145 | |
|
146 | 146 | old_index = rl.index |
|
147 | 147 | docket = rl._docket |
|
148 | 148 | |
|
149 | 149 | censor_rev = rl.rev(censornode) |
|
150 | 150 | tombstone = storageutil.packmeta({b'censored': tombstone}, b'') |
|
151 | 151 | |
|
152 | 152 | censored_entry = rl.index[censor_rev] |
|
153 | 153 | index_cutoff = rl.index.entry_size * censor_rev |
|
154 | 154 | data_cutoff = censored_entry[ENTRY_DATA_OFFSET] >> 16 |
|
155 | 155 | sidedata_cutoff = rl.sidedata_cut_off(censor_rev) |
|
156 | 156 | |
|
157 | # rev β (new_base, data_start, data_end) | |
|
158 | rewritten_entries = {} | |
|
159 | ||
|
160 | dc = deltas.deltacomputer(rl) | |
|
161 | excl = [censor_rev] | |
|
162 | ||
|
163 | 157 | with pycompat.unnamedtempfile(mode=b"w+b") as tmp_storage: |
|
164 | with rl._segmentfile._open_read() as dfh: | |
|
165 | for rev in range(censor_rev + 1, len(old_index)): | |
|
166 | entry = old_index[rev] | |
|
167 | if censor_rev != entry[ENTRY_DELTA_BASE]: | |
|
168 | continue | |
|
169 | # This is a revision that use the censored revision as the base | |
|
170 | # for its delta. We need a need new deltas | |
|
171 | if entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] == 0: | |
|
172 | # this revision is empty, we can delta against nullrev | |
|
173 | rewritten_entries[rev] = (nullrev, 0, 0) | |
|
174 | else: | |
|
175 | ||
|
176 | text = rl.rawdata(rev, _df=dfh) | |
|
177 | info = revlogutils.revisioninfo( | |
|
178 | node=entry[ENTRY_NODE_ID], | |
|
179 | p1=rl.node(entry[ENTRY_PARENT_1]), | |
|
180 | p2=rl.node(entry[ENTRY_PARENT_2]), | |
|
181 | btext=[text], | |
|
182 | textlen=len(text), | |
|
183 | cachedelta=None, | |
|
184 | flags=entry[ENTRY_DATA_OFFSET] & 0xFFFF, | |
|
185 | ) | |
|
186 | d = dc.finddeltainfo( | |
|
187 | info, dfh, excluded_bases=excl, target_rev=rev | |
|
188 | ) | |
|
189 | default_comp = rl._docket.default_compression_header | |
|
190 | comp_mode, d = deltas.delta_compression(default_comp, d) | |
|
191 | # using `tell` is a bit lazy, but we are not here for speed | |
|
192 | start = tmp_storage.tell() | |
|
193 | tmp_storage.write(d.data[1]) | |
|
194 | end = tmp_storage.tell() | |
|
195 | rewritten_entries[rev] = (d.base, start, end, comp_mode) | |
|
158 | # rev β (new_base, data_start, data_end, compression_mode) | |
|
159 | rewritten_entries = _precompute_rewritten_delta( | |
|
160 | rl, | |
|
161 | old_index, | |
|
162 | {censor_rev}, | |
|
163 | tmp_storage, | |
|
164 | ) | |
|
196 | 165 | |
|
197 | 166 | old_index_filepath = rl.opener.join(docket.index_filepath()) |
|
198 | 167 | old_data_filepath = rl.opener.join(docket.data_filepath()) |
|
199 | 168 | old_sidedata_filepath = rl.opener.join(docket.sidedata_filepath()) |
|
200 | 169 | |
|
201 | 170 | new_index_filepath = rl.opener.join(docket.new_index_file()) |
|
202 | 171 | new_data_filepath = rl.opener.join(docket.new_data_file()) |
|
203 | 172 | new_sidedata_filepath = rl.opener.join(docket.new_sidedata_file()) |
|
204 | 173 | |
|
205 | 174 | util.copyfile( |
|
206 | 175 | old_index_filepath, new_index_filepath, nb_bytes=index_cutoff |
|
207 | 176 | ) |
|
208 | 177 | util.copyfile( |
|
209 | 178 | old_data_filepath, new_data_filepath, nb_bytes=data_cutoff |
|
210 | 179 | ) |
|
211 | 180 | util.copyfile( |
|
212 | 181 | old_sidedata_filepath, |
|
213 | 182 | new_sidedata_filepath, |
|
214 | 183 | nb_bytes=sidedata_cutoff, |
|
215 | 184 | ) |
|
216 | 185 | rl.opener.register_file(docket.index_filepath()) |
|
217 | 186 | rl.opener.register_file(docket.data_filepath()) |
|
218 | 187 | rl.opener.register_file(docket.sidedata_filepath()) |
|
219 | 188 | |
|
220 | 189 | docket.index_end = index_cutoff |
|
221 | 190 | docket.data_end = data_cutoff |
|
222 | 191 | docket.sidedata_end = sidedata_cutoff |
|
223 | 192 | |
|
224 | 193 | # reload the revlog internal information |
|
225 | 194 | rl.clearcaches() |
|
226 | 195 | rl._loadindex(docket=docket) |
|
227 | 196 | |
|
228 | 197 | @contextlib.contextmanager |
|
229 | 198 | def all_files(): |
|
230 | 199 | # hide opening in an helper function to please check-code, black |
|
231 | 200 | # and various python ersion at the same time |
|
232 | 201 | with open(old_data_filepath, 'rb') as old_data_file: |
|
233 | 202 | with open(old_sidedata_filepath, 'rb') as old_sidedata_file: |
|
234 | 203 | with open(new_index_filepath, 'r+b') as new_index_file: |
|
235 | 204 | with open(new_data_filepath, 'r+b') as new_data_file: |
|
236 | 205 | with open( |
|
237 | 206 | new_sidedata_filepath, 'r+b' |
|
238 | 207 | ) as new_sidedata_file: |
|
239 | 208 | yield ( |
|
240 | 209 | old_data_file, |
|
241 | 210 | old_sidedata_file, |
|
242 | 211 | new_index_file, |
|
243 | 212 | new_data_file, |
|
244 | 213 | new_sidedata_file, |
|
245 | 214 | ) |
|
246 | 215 | |
|
247 | 216 | # we dont need to open the old index file since its content already |
|
248 | 217 | # exist in a usable form in `old_index`. |
|
249 | 218 | with all_files() as open_files: |
|
250 | 219 | ( |
|
251 | 220 | old_data_file, |
|
252 | 221 | old_sidedata_file, |
|
253 | 222 | new_index_file, |
|
254 | 223 | new_data_file, |
|
255 | 224 | new_sidedata_file, |
|
256 | 225 | ) = open_files |
|
257 | 226 | new_index_file.seek(0, os.SEEK_END) |
|
258 | 227 | assert new_index_file.tell() == index_cutoff |
|
259 | 228 | new_data_file.seek(0, os.SEEK_END) |
|
260 | 229 | assert new_data_file.tell() == data_cutoff |
|
261 | 230 | new_sidedata_file.seek(0, os.SEEK_END) |
|
262 | 231 | assert new_sidedata_file.tell() == sidedata_cutoff |
|
263 | 232 | |
|
264 | 233 | # writing the censored revision |
|
265 | 234 | _rewrite_censor( |
|
266 | 235 | rl, |
|
267 | 236 | old_index, |
|
268 | 237 | open_files, |
|
269 | 238 | censor_rev, |
|
270 | 239 | tombstone, |
|
271 | 240 | ) |
|
272 | 241 | |
|
273 | 242 | # Writing all subsequent revisions |
|
274 | 243 | for rev in range(censor_rev + 1, len(old_index)): |
|
275 | 244 | _rewrite_simple( |
|
276 | 245 | rl, |
|
277 | 246 | old_index, |
|
278 | 247 | open_files, |
|
279 | 248 | rev, |
|
280 | 249 | rewritten_entries, |
|
281 | 250 | tmp_storage, |
|
282 | 251 | ) |
|
283 | 252 | docket.write(transaction=None, stripping=True) |
|
284 | 253 | |
|
285 | 254 | |
|
255 | def _precompute_rewritten_delta( | |
|
256 | revlog, | |
|
257 | old_index, | |
|
258 | excluded_revs, | |
|
259 | tmp_storage, | |
|
260 | ): | |
|
261 | """Compute new delta for revisions whose delta is based on revision that | |
|
262 | will not survive as is. | |
|
263 | ||
|
264 | Return a mapping: {rev β (new_base, data_start, data_end, compression_mode)} | |
|
265 | """ | |
|
266 | dc = deltas.deltacomputer(revlog) | |
|
267 | rewritten_entries = {} | |
|
268 | first_excl_rev = min(excluded_revs) | |
|
269 | with revlog._segmentfile._open_read() as dfh: | |
|
270 | for rev in range(first_excl_rev, len(old_index)): | |
|
271 | if rev in excluded_revs: | |
|
272 | # this revision will be preserved as is, so we don't need to | |
|
273 | # consider recomputing a delta. | |
|
274 | continue | |
|
275 | entry = old_index[rev] | |
|
276 | if entry[ENTRY_DELTA_BASE] not in excluded_revs: | |
|
277 | continue | |
|
278 | # This is a revision that use the censored revision as the base | |
|
279 | # for its delta. We need a need new deltas | |
|
280 | if entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] == 0: | |
|
281 | # this revision is empty, we can delta against nullrev | |
|
282 | rewritten_entries[rev] = (nullrev, 0, 0, COMP_MODE_PLAIN) | |
|
283 | else: | |
|
284 | ||
|
285 | text = revlog.rawdata(rev, _df=dfh) | |
|
286 | info = revlogutils.revisioninfo( | |
|
287 | node=entry[ENTRY_NODE_ID], | |
|
288 | p1=revlog.node(entry[ENTRY_PARENT_1]), | |
|
289 | p2=revlog.node(entry[ENTRY_PARENT_2]), | |
|
290 | btext=[text], | |
|
291 | textlen=len(text), | |
|
292 | cachedelta=None, | |
|
293 | flags=entry[ENTRY_DATA_OFFSET] & 0xFFFF, | |
|
294 | ) | |
|
295 | d = dc.finddeltainfo( | |
|
296 | info, dfh, excluded_bases=excluded_revs, target_rev=rev | |
|
297 | ) | |
|
298 | default_comp = revlog._docket.default_compression_header | |
|
299 | comp_mode, d = deltas.delta_compression(default_comp, d) | |
|
300 | # using `tell` is a bit lazy, but we are not here for speed | |
|
301 | start = tmp_storage.tell() | |
|
302 | tmp_storage.write(d.data[1]) | |
|
303 | end = tmp_storage.tell() | |
|
304 | rewritten_entries[rev] = (d.base, start, end, comp_mode) | |
|
305 | return rewritten_entries | |
|
306 | ||
|
307 | ||
|
286 | 308 | def _rewrite_simple( |
|
287 | 309 | revlog, |
|
288 | 310 | old_index, |
|
289 | 311 | all_files, |
|
290 | 312 | rev, |
|
291 | 313 | rewritten_entries, |
|
292 | 314 | tmp_storage, |
|
293 | 315 | ): |
|
294 | 316 | """append a normal revision to the index after the rewritten one(s)""" |
|
295 | 317 | ( |
|
296 | 318 | old_data_file, |
|
297 | 319 | old_sidedata_file, |
|
298 | 320 | new_index_file, |
|
299 | 321 | new_data_file, |
|
300 | 322 | new_sidedata_file, |
|
301 | 323 | ) = all_files |
|
302 | 324 | entry = old_index[rev] |
|
303 | 325 | flags = entry[ENTRY_DATA_OFFSET] & 0xFFFF |
|
304 | 326 | old_data_offset = entry[ENTRY_DATA_OFFSET] >> 16 |
|
305 | 327 | |
|
306 | 328 | if rev not in rewritten_entries: |
|
307 | 329 | old_data_file.seek(old_data_offset) |
|
308 | 330 | new_data_size = entry[ENTRY_DATA_COMPRESSED_LENGTH] |
|
309 | 331 | new_data = old_data_file.read(new_data_size) |
|
310 | 332 | data_delta_base = entry[ENTRY_DELTA_BASE] |
|
311 | 333 | d_comp_mode = entry[ENTRY_DATA_COMPRESSION_MODE] |
|
312 | 334 | else: |
|
313 | 335 | ( |
|
314 | 336 | data_delta_base, |
|
315 | 337 | start, |
|
316 | 338 | end, |
|
317 | 339 | d_comp_mode, |
|
318 | 340 | ) = rewritten_entries[rev] |
|
319 | 341 | new_data_size = end - start |
|
320 | 342 | tmp_storage.seek(start) |
|
321 | 343 | new_data = tmp_storage.read(new_data_size) |
|
322 | 344 | |
|
323 | 345 | # It might be faster to group continuous read/write operation, |
|
324 | 346 | # however, this is censor, an operation that is not focussed |
|
325 | 347 | # around stellar performance. So I have not written this |
|
326 | 348 | # optimisation yet. |
|
327 | 349 | new_data_offset = new_data_file.tell() |
|
328 | 350 | new_data_file.write(new_data) |
|
329 | 351 | |
|
330 | 352 | sidedata_size = entry[ENTRY_SIDEDATA_COMPRESSED_LENGTH] |
|
331 | 353 | new_sidedata_offset = new_sidedata_file.tell() |
|
332 | 354 | if 0 < sidedata_size: |
|
333 | 355 | old_sidedata_offset = entry[ENTRY_SIDEDATA_OFFSET] |
|
334 | 356 | old_sidedata_file.seek(old_sidedata_offset) |
|
335 | 357 | new_sidedata = old_sidedata_file.read(sidedata_size) |
|
336 | 358 | new_sidedata_file.write(new_sidedata) |
|
337 | 359 | |
|
338 | 360 | data_uncompressed_length = entry[ENTRY_DATA_UNCOMPRESSED_LENGTH] |
|
339 | 361 | sd_com_mode = entry[ENTRY_SIDEDATA_COMPRESSION_MODE] |
|
340 | 362 | assert data_delta_base <= rev, (data_delta_base, rev) |
|
341 | 363 | |
|
342 | 364 | new_entry = revlogutils.entry( |
|
343 | 365 | flags=flags, |
|
344 | 366 | data_offset=new_data_offset, |
|
345 | 367 | data_compressed_length=new_data_size, |
|
346 | 368 | data_uncompressed_length=data_uncompressed_length, |
|
347 | 369 | data_delta_base=data_delta_base, |
|
348 | 370 | link_rev=entry[ENTRY_LINK_REV], |
|
349 | 371 | parent_rev_1=entry[ENTRY_PARENT_1], |
|
350 | 372 | parent_rev_2=entry[ENTRY_PARENT_2], |
|
351 | 373 | node_id=entry[ENTRY_NODE_ID], |
|
352 | 374 | sidedata_offset=new_sidedata_offset, |
|
353 | 375 | sidedata_compressed_length=sidedata_size, |
|
354 | 376 | data_compression_mode=d_comp_mode, |
|
355 | 377 | sidedata_compression_mode=sd_com_mode, |
|
356 | 378 | ) |
|
357 | 379 | revlog.index.append(new_entry) |
|
358 | 380 | entry_bin = revlog.index.entry_binary(rev) |
|
359 | 381 | new_index_file.write(entry_bin) |
|
360 | 382 | |
|
361 | 383 | revlog._docket.index_end = new_index_file.tell() |
|
362 | 384 | revlog._docket.data_end = new_data_file.tell() |
|
363 | 385 | revlog._docket.sidedata_end = new_sidedata_file.tell() |
|
364 | 386 | |
|
365 | 387 | |
|
366 | 388 | def _rewrite_censor( |
|
367 | 389 | revlog, |
|
368 | 390 | old_index, |
|
369 | 391 | all_files, |
|
370 | 392 | rev, |
|
371 | 393 | tombstone, |
|
372 | 394 | ): |
|
373 | 395 | """rewrite and append a censored revision""" |
|
374 | 396 | ( |
|
375 | 397 | old_data_file, |
|
376 | 398 | old_sidedata_file, |
|
377 | 399 | new_index_file, |
|
378 | 400 | new_data_file, |
|
379 | 401 | new_sidedata_file, |
|
380 | 402 | ) = all_files |
|
381 | 403 | entry = old_index[rev] |
|
382 | 404 | |
|
383 | 405 | # XXX consider trying the default compression too |
|
384 | 406 | new_data_size = len(tombstone) |
|
385 | 407 | new_data_offset = new_data_file.tell() |
|
386 | 408 | new_data_file.write(tombstone) |
|
387 | 409 | |
|
388 | 410 | # we are not adding any sidedata as they might leak info about the censored version |
|
389 | 411 | |
|
390 | 412 | link_rev = entry[ENTRY_LINK_REV] |
|
391 | 413 | |
|
392 | 414 | p1 = entry[ENTRY_PARENT_1] |
|
393 | 415 | p2 = entry[ENTRY_PARENT_2] |
|
394 | 416 | |
|
395 | 417 | new_entry = revlogutils.entry( |
|
396 | 418 | flags=constants.REVIDX_ISCENSORED, |
|
397 | 419 | data_offset=new_data_offset, |
|
398 | 420 | data_compressed_length=new_data_size, |
|
399 | 421 | data_uncompressed_length=new_data_size, |
|
400 | 422 | data_delta_base=rev, |
|
401 | 423 | link_rev=link_rev, |
|
402 | 424 | parent_rev_1=p1, |
|
403 | 425 | parent_rev_2=p2, |
|
404 | 426 | node_id=entry[ENTRY_NODE_ID], |
|
405 | 427 | sidedata_offset=0, |
|
406 | 428 | sidedata_compressed_length=0, |
|
407 | 429 | data_compression_mode=COMP_MODE_PLAIN, |
|
408 | 430 | sidedata_compression_mode=COMP_MODE_PLAIN, |
|
409 | 431 | ) |
|
410 | 432 | revlog.index.append(new_entry) |
|
411 | 433 | entry_bin = revlog.index.entry_binary(rev) |
|
412 | 434 | new_index_file.write(entry_bin) |
|
413 | 435 | revlog._docket.index_end = new_index_file.tell() |
|
414 | 436 | revlog._docket.data_end = new_data_file.tell() |
General Comments 0
You need to be logged in to leave comments.
Login now