Show More
@@ -1,1730 +1,1730 b'' | |||
|
1 | 1 | # perf.py - performance test routines |
|
2 | 2 | '''helper extension to measure performance''' |
|
3 | 3 | |
|
4 | 4 | # "historical portability" policy of perf.py: |
|
5 | 5 | # |
|
6 | 6 | # We have to do: |
|
7 | 7 | # - make perf.py "loadable" with as wide Mercurial version as possible |
|
8 | 8 | # This doesn't mean that perf commands work correctly with that Mercurial. |
|
9 | 9 | # BTW, perf.py itself has been available since 1.1 (or eb240755386d). |
|
10 | 10 | # - make historical perf command work correctly with as wide Mercurial |
|
11 | 11 | # version as possible |
|
12 | 12 | # |
|
13 | 13 | # We have to do, if possible with reasonable cost: |
|
14 | 14 | # - make recent perf command for historical feature work correctly |
|
15 | 15 | # with early Mercurial |
|
16 | 16 | # |
|
17 | 17 | # We don't have to do: |
|
18 | 18 | # - make perf command for recent feature work correctly with early |
|
19 | 19 | # Mercurial |
|
20 | 20 | |
|
21 | 21 | from __future__ import absolute_import |
|
22 | 22 | import functools |
|
23 | 23 | import gc |
|
24 | 24 | import os |
|
25 | 25 | import random |
|
26 | 26 | import struct |
|
27 | 27 | import sys |
|
28 | 28 | import threading |
|
29 | 29 | import time |
|
30 | 30 | from mercurial import ( |
|
31 | 31 | changegroup, |
|
32 | 32 | cmdutil, |
|
33 | 33 | commands, |
|
34 | 34 | copies, |
|
35 | 35 | error, |
|
36 | 36 | extensions, |
|
37 | 37 | mdiff, |
|
38 | 38 | merge, |
|
39 | 39 | revlog, |
|
40 | 40 | util, |
|
41 | 41 | ) |
|
42 | 42 | |
|
43 | 43 | # for "historical portability": |
|
44 | 44 | # try to import modules separately (in dict order), and ignore |
|
45 | 45 | # failure, because these aren't available with early Mercurial |
|
46 | 46 | try: |
|
47 | 47 | from mercurial import branchmap # since 2.5 (or bcee63733aad) |
|
48 | 48 | except ImportError: |
|
49 | 49 | pass |
|
50 | 50 | try: |
|
51 | 51 | from mercurial import obsolete # since 2.3 (or ad0d6c2b3279) |
|
52 | 52 | except ImportError: |
|
53 | 53 | pass |
|
54 | 54 | try: |
|
55 | 55 | from mercurial import registrar # since 3.7 (or 37d50250b696) |
|
56 | 56 | dir(registrar) # forcibly load it |
|
57 | 57 | except ImportError: |
|
58 | 58 | registrar = None |
|
59 | 59 | try: |
|
60 | 60 | from mercurial import repoview # since 2.5 (or 3a6ddacb7198) |
|
61 | 61 | except ImportError: |
|
62 | 62 | pass |
|
63 | 63 | try: |
|
64 | 64 | from mercurial import scmutil # since 1.9 (or 8b252e826c68) |
|
65 | 65 | except ImportError: |
|
66 | 66 | pass |
|
67 | 67 | |
|
68 | 68 | # for "historical portability": |
|
69 | 69 | # define util.safehasattr forcibly, because util.safehasattr has been |
|
70 | 70 | # available since 1.9.3 (or 94b200a11cf7) |
|
71 | 71 | _undefined = object() |
|
72 | 72 | def safehasattr(thing, attr): |
|
73 | 73 | return getattr(thing, attr, _undefined) is not _undefined |
|
74 | 74 | setattr(util, 'safehasattr', safehasattr) |
|
75 | 75 | |
|
76 | 76 | # for "historical portability": |
|
77 | 77 | # define util.timer forcibly, because util.timer has been available |
|
78 | 78 | # since ae5d60bb70c9 |
|
79 | 79 | if safehasattr(time, 'perf_counter'): |
|
80 | 80 | util.timer = time.perf_counter |
|
81 | 81 | elif os.name == 'nt': |
|
82 | 82 | util.timer = time.clock |
|
83 | 83 | else: |
|
84 | 84 | util.timer = time.time |
|
85 | 85 | |
|
86 | 86 | # for "historical portability": |
|
87 | 87 | # use locally defined empty option list, if formatteropts isn't |
|
88 | 88 | # available, because commands.formatteropts has been available since |
|
89 | 89 | # 3.2 (or 7a7eed5176a4), even though formatting itself has been |
|
90 | 90 | # available since 2.2 (or ae5f92e154d3) |
|
91 | 91 | formatteropts = getattr(cmdutil, "formatteropts", |
|
92 | 92 | getattr(commands, "formatteropts", [])) |
|
93 | 93 | |
|
94 | 94 | # for "historical portability": |
|
95 | 95 | # use locally defined option list, if debugrevlogopts isn't available, |
|
96 | 96 | # because commands.debugrevlogopts has been available since 3.7 (or |
|
97 | 97 | # 5606f7d0d063), even though cmdutil.openrevlog() has been available |
|
98 | 98 | # since 1.9 (or a79fea6b3e77). |
|
99 | 99 | revlogopts = getattr(cmdutil, "debugrevlogopts", |
|
100 | 100 | getattr(commands, "debugrevlogopts", [ |
|
101 | 101 | ('c', 'changelog', False, ('open changelog')), |
|
102 | 102 | ('m', 'manifest', False, ('open manifest')), |
|
103 | 103 | ('', 'dir', False, ('open directory manifest')), |
|
104 | 104 | ])) |
|
105 | 105 | |
|
106 | 106 | cmdtable = {} |
|
107 | 107 | |
|
108 | 108 | # for "historical portability": |
|
109 | 109 | # define parsealiases locally, because cmdutil.parsealiases has been |
|
110 | 110 | # available since 1.5 (or 6252852b4332) |
|
111 | 111 | def parsealiases(cmd): |
|
112 | 112 | return cmd.lstrip("^").split("|") |
|
113 | 113 | |
|
114 | 114 | if safehasattr(registrar, 'command'): |
|
115 | 115 | command = registrar.command(cmdtable) |
|
116 | 116 | elif safehasattr(cmdutil, 'command'): |
|
117 | 117 | import inspect |
|
118 | 118 | command = cmdutil.command(cmdtable) |
|
119 | 119 | if 'norepo' not in inspect.getargspec(command)[0]: |
|
120 | 120 | # for "historical portability": |
|
121 | 121 | # wrap original cmdutil.command, because "norepo" option has |
|
122 | 122 | # been available since 3.1 (or 75a96326cecb) |
|
123 | 123 | _command = command |
|
124 | 124 | def command(name, options=(), synopsis=None, norepo=False): |
|
125 | 125 | if norepo: |
|
126 | 126 | commands.norepo += ' %s' % ' '.join(parsealiases(name)) |
|
127 | 127 | return _command(name, list(options), synopsis) |
|
128 | 128 | else: |
|
129 | 129 | # for "historical portability": |
|
130 | 130 | # define "@command" annotation locally, because cmdutil.command |
|
131 | 131 | # has been available since 1.9 (or 2daa5179e73f) |
|
132 | 132 | def command(name, options=(), synopsis=None, norepo=False): |
|
133 | 133 | def decorator(func): |
|
134 | 134 | if synopsis: |
|
135 | 135 | cmdtable[name] = func, list(options), synopsis |
|
136 | 136 | else: |
|
137 | 137 | cmdtable[name] = func, list(options) |
|
138 | 138 | if norepo: |
|
139 | 139 | commands.norepo += ' %s' % ' '.join(parsealiases(name)) |
|
140 | 140 | return func |
|
141 | 141 | return decorator |
|
142 | 142 | |
|
143 | 143 | try: |
|
144 | 144 | import mercurial.registrar |
|
145 | 145 | import mercurial.configitems |
|
146 | 146 | configtable = {} |
|
147 | 147 | configitem = mercurial.registrar.configitem(configtable) |
|
148 | 148 | configitem('perf', 'presleep', |
|
149 | 149 | default=mercurial.configitems.dynamicdefault, |
|
150 | 150 | ) |
|
151 | 151 | configitem('perf', 'stub', |
|
152 | 152 | default=mercurial.configitems.dynamicdefault, |
|
153 | 153 | ) |
|
154 | 154 | configitem('perf', 'parentscount', |
|
155 | 155 | default=mercurial.configitems.dynamicdefault, |
|
156 | 156 | ) |
|
157 | 157 | except (ImportError, AttributeError): |
|
158 | 158 | pass |
|
159 | 159 | |
|
160 | 160 | def getlen(ui): |
|
161 | 161 | if ui.configbool("perf", "stub", False): |
|
162 | 162 | return lambda x: 1 |
|
163 | 163 | return len |
|
164 | 164 | |
|
165 | 165 | def gettimer(ui, opts=None): |
|
166 | 166 | """return a timer function and formatter: (timer, formatter) |
|
167 | 167 | |
|
168 | 168 | This function exists to gather the creation of formatter in a single |
|
169 | 169 | place instead of duplicating it in all performance commands.""" |
|
170 | 170 | |
|
171 | 171 | # enforce an idle period before execution to counteract power management |
|
172 | 172 | # experimental config: perf.presleep |
|
173 | 173 | time.sleep(getint(ui, "perf", "presleep", 1)) |
|
174 | 174 | |
|
175 | 175 | if opts is None: |
|
176 | 176 | opts = {} |
|
177 | 177 | # redirect all to stderr unless buffer api is in use |
|
178 | 178 | if not ui._buffers: |
|
179 | 179 | ui = ui.copy() |
|
180 | 180 | uifout = safeattrsetter(ui, 'fout', ignoremissing=True) |
|
181 | 181 | if uifout: |
|
182 | 182 | # for "historical portability": |
|
183 | 183 | # ui.fout/ferr have been available since 1.9 (or 4e1ccd4c2b6d) |
|
184 | 184 | uifout.set(ui.ferr) |
|
185 | 185 | |
|
186 | 186 | # get a formatter |
|
187 | 187 | uiformatter = getattr(ui, 'formatter', None) |
|
188 | 188 | if uiformatter: |
|
189 | 189 | fm = uiformatter('perf', opts) |
|
190 | 190 | else: |
|
191 | 191 | # for "historical portability": |
|
192 | 192 | # define formatter locally, because ui.formatter has been |
|
193 | 193 | # available since 2.2 (or ae5f92e154d3) |
|
194 | 194 | from mercurial import node |
|
195 | 195 | class defaultformatter(object): |
|
196 | 196 | """Minimized composition of baseformatter and plainformatter |
|
197 | 197 | """ |
|
198 | 198 | def __init__(self, ui, topic, opts): |
|
199 | 199 | self._ui = ui |
|
200 | 200 | if ui.debugflag: |
|
201 | 201 | self.hexfunc = node.hex |
|
202 | 202 | else: |
|
203 | 203 | self.hexfunc = node.short |
|
204 | 204 | def __nonzero__(self): |
|
205 | 205 | return False |
|
206 | 206 | __bool__ = __nonzero__ |
|
207 | 207 | def startitem(self): |
|
208 | 208 | pass |
|
209 | 209 | def data(self, **data): |
|
210 | 210 | pass |
|
211 | 211 | def write(self, fields, deftext, *fielddata, **opts): |
|
212 | 212 | self._ui.write(deftext % fielddata, **opts) |
|
213 | 213 | def condwrite(self, cond, fields, deftext, *fielddata, **opts): |
|
214 | 214 | if cond: |
|
215 | 215 | self._ui.write(deftext % fielddata, **opts) |
|
216 | 216 | def plain(self, text, **opts): |
|
217 | 217 | self._ui.write(text, **opts) |
|
218 | 218 | def end(self): |
|
219 | 219 | pass |
|
220 | 220 | fm = defaultformatter(ui, 'perf', opts) |
|
221 | 221 | |
|
222 | 222 | # stub function, runs code only once instead of in a loop |
|
223 | 223 | # experimental config: perf.stub |
|
224 | 224 | if ui.configbool("perf", "stub", False): |
|
225 | 225 | return functools.partial(stub_timer, fm), fm |
|
226 | 226 | return functools.partial(_timer, fm), fm |
|
227 | 227 | |
|
228 | 228 | def stub_timer(fm, func, title=None): |
|
229 | 229 | func() |
|
230 | 230 | |
|
231 | 231 | def _timer(fm, func, title=None): |
|
232 | 232 | gc.collect() |
|
233 | 233 | results = [] |
|
234 | 234 | begin = util.timer() |
|
235 | 235 | count = 0 |
|
236 | 236 | while True: |
|
237 | 237 | ostart = os.times() |
|
238 | 238 | cstart = util.timer() |
|
239 | 239 | r = func() |
|
240 | 240 | cstop = util.timer() |
|
241 | 241 | ostop = os.times() |
|
242 | 242 | count += 1 |
|
243 | 243 | a, b = ostart, ostop |
|
244 | 244 | results.append((cstop - cstart, b[0] - a[0], b[1]-a[1])) |
|
245 | 245 | if cstop - begin > 3 and count >= 100: |
|
246 | 246 | break |
|
247 | 247 | if cstop - begin > 10 and count >= 3: |
|
248 | 248 | break |
|
249 | 249 | |
|
250 | 250 | fm.startitem() |
|
251 | 251 | |
|
252 | 252 | if title: |
|
253 | 253 | fm.write('title', '! %s\n', title) |
|
254 | 254 | if r: |
|
255 | 255 | fm.write('result', '! result: %s\n', r) |
|
256 | 256 | m = min(results) |
|
257 | 257 | fm.plain('!') |
|
258 | 258 | fm.write('wall', ' wall %f', m[0]) |
|
259 | 259 | fm.write('comb', ' comb %f', m[1] + m[2]) |
|
260 | 260 | fm.write('user', ' user %f', m[1]) |
|
261 | 261 | fm.write('sys', ' sys %f', m[2]) |
|
262 | 262 | fm.write('count', ' (best of %d)', count) |
|
263 | 263 | fm.plain('\n') |
|
264 | 264 | |
|
265 | 265 | # utilities for historical portability |
|
266 | 266 | |
|
267 | 267 | def getint(ui, section, name, default): |
|
268 | 268 | # for "historical portability": |
|
269 | 269 | # ui.configint has been available since 1.9 (or fa2b596db182) |
|
270 | 270 | v = ui.config(section, name, None) |
|
271 | 271 | if v is None: |
|
272 | 272 | return default |
|
273 | 273 | try: |
|
274 | 274 | return int(v) |
|
275 | 275 | except ValueError: |
|
276 | 276 | raise error.ConfigError(("%s.%s is not an integer ('%s')") |
|
277 | 277 | % (section, name, v)) |
|
278 | 278 | |
|
279 | 279 | def safeattrsetter(obj, name, ignoremissing=False): |
|
280 | 280 | """Ensure that 'obj' has 'name' attribute before subsequent setattr |
|
281 | 281 | |
|
282 | 282 | This function is aborted, if 'obj' doesn't have 'name' attribute |
|
283 | 283 | at runtime. This avoids overlooking removal of an attribute, which |
|
284 | 284 | breaks assumption of performance measurement, in the future. |
|
285 | 285 | |
|
286 | 286 | This function returns the object to (1) assign a new value, and |
|
287 | 287 | (2) restore an original value to the attribute. |
|
288 | 288 | |
|
289 | 289 | If 'ignoremissing' is true, missing 'name' attribute doesn't cause |
|
290 | 290 | abortion, and this function returns None. This is useful to |
|
291 | 291 | examine an attribute, which isn't ensured in all Mercurial |
|
292 | 292 | versions. |
|
293 | 293 | """ |
|
294 | 294 | if not util.safehasattr(obj, name): |
|
295 | 295 | if ignoremissing: |
|
296 | 296 | return None |
|
297 | 297 | raise error.Abort(("missing attribute %s of %s might break assumption" |
|
298 | 298 | " of performance measurement") % (name, obj)) |
|
299 | 299 | |
|
300 | 300 | origvalue = getattr(obj, name) |
|
301 | 301 | class attrutil(object): |
|
302 | 302 | def set(self, newvalue): |
|
303 | 303 | setattr(obj, name, newvalue) |
|
304 | 304 | def restore(self): |
|
305 | 305 | setattr(obj, name, origvalue) |
|
306 | 306 | |
|
307 | 307 | return attrutil() |
|
308 | 308 | |
|
309 | 309 | # utilities to examine each internal API changes |
|
310 | 310 | |
|
311 | 311 | def getbranchmapsubsettable(): |
|
312 | 312 | # for "historical portability": |
|
313 | 313 | # subsettable is defined in: |
|
314 | 314 | # - branchmap since 2.9 (or 175c6fd8cacc) |
|
315 | 315 | # - repoview since 2.5 (or 59a9f18d4587) |
|
316 | 316 | for mod in (branchmap, repoview): |
|
317 | 317 | subsettable = getattr(mod, 'subsettable', None) |
|
318 | 318 | if subsettable: |
|
319 | 319 | return subsettable |
|
320 | 320 | |
|
321 | 321 | # bisecting in bcee63733aad::59a9f18d4587 can reach here (both |
|
322 | 322 | # branchmap and repoview modules exist, but subsettable attribute |
|
323 | 323 | # doesn't) |
|
324 | 324 | raise error.Abort(("perfbranchmap not available with this Mercurial"), |
|
325 | 325 | hint="use 2.5 or later") |
|
326 | 326 | |
|
327 | 327 | def getsvfs(repo): |
|
328 | 328 | """Return appropriate object to access files under .hg/store |
|
329 | 329 | """ |
|
330 | 330 | # for "historical portability": |
|
331 | 331 | # repo.svfs has been available since 2.3 (or 7034365089bf) |
|
332 | 332 | svfs = getattr(repo, 'svfs', None) |
|
333 | 333 | if svfs: |
|
334 | 334 | return svfs |
|
335 | 335 | else: |
|
336 | 336 | return getattr(repo, 'sopener') |
|
337 | 337 | |
|
338 | 338 | def getvfs(repo): |
|
339 | 339 | """Return appropriate object to access files under .hg |
|
340 | 340 | """ |
|
341 | 341 | # for "historical portability": |
|
342 | 342 | # repo.vfs has been available since 2.3 (or 7034365089bf) |
|
343 | 343 | vfs = getattr(repo, 'vfs', None) |
|
344 | 344 | if vfs: |
|
345 | 345 | return vfs |
|
346 | 346 | else: |
|
347 | 347 | return getattr(repo, 'opener') |
|
348 | 348 | |
|
349 | 349 | def repocleartagscachefunc(repo): |
|
350 | 350 | """Return the function to clear tags cache according to repo internal API |
|
351 | 351 | """ |
|
352 | 352 | if util.safehasattr(repo, '_tagscache'): # since 2.0 (or 9dca7653b525) |
|
353 | 353 | # in this case, setattr(repo, '_tagscache', None) or so isn't |
|
354 | 354 | # correct way to clear tags cache, because existing code paths |
|
355 | 355 | # expect _tagscache to be a structured object. |
|
356 | 356 | def clearcache(): |
|
357 | 357 | # _tagscache has been filteredpropertycache since 2.5 (or |
|
358 | 358 | # 98c867ac1330), and delattr() can't work in such case |
|
359 | 359 | if '_tagscache' in vars(repo): |
|
360 | 360 | del repo.__dict__['_tagscache'] |
|
361 | 361 | return clearcache |
|
362 | 362 | |
|
363 | 363 | repotags = safeattrsetter(repo, '_tags', ignoremissing=True) |
|
364 | 364 | if repotags: # since 1.4 (or 5614a628d173) |
|
365 | 365 | return lambda : repotags.set(None) |
|
366 | 366 | |
|
367 | 367 | repotagscache = safeattrsetter(repo, 'tagscache', ignoremissing=True) |
|
368 | 368 | if repotagscache: # since 0.6 (or d7df759d0e97) |
|
369 | 369 | return lambda : repotagscache.set(None) |
|
370 | 370 | |
|
371 | 371 | # Mercurial earlier than 0.6 (or d7df759d0e97) logically reaches |
|
372 | 372 | # this point, but it isn't so problematic, because: |
|
373 | 373 | # - repo.tags of such Mercurial isn't "callable", and repo.tags() |
|
374 | 374 | # in perftags() causes failure soon |
|
375 | 375 | # - perf.py itself has been available since 1.1 (or eb240755386d) |
|
376 | 376 | raise error.Abort(("tags API of this hg command is unknown")) |
|
377 | 377 | |
|
378 | 378 | # utilities to clear cache |
|
379 | 379 | |
|
380 | 380 | def clearfilecache(repo, attrname): |
|
381 | 381 | unfi = repo.unfiltered() |
|
382 | 382 | if attrname in vars(unfi): |
|
383 | 383 | delattr(unfi, attrname) |
|
384 | 384 | unfi._filecache.pop(attrname, None) |
|
385 | 385 | |
|
386 | 386 | # perf commands |
|
387 | 387 | |
|
388 | 388 | @command('perfwalk', formatteropts) |
|
389 | 389 | def perfwalk(ui, repo, *pats, **opts): |
|
390 | 390 | timer, fm = gettimer(ui, opts) |
|
391 | 391 | m = scmutil.match(repo[None], pats, {}) |
|
392 | 392 | timer(lambda: len(list(repo.dirstate.walk(m, subrepos=[], unknown=True, |
|
393 | 393 | ignored=False)))) |
|
394 | 394 | fm.end() |
|
395 | 395 | |
|
396 | 396 | @command('perfannotate', formatteropts) |
|
397 | 397 | def perfannotate(ui, repo, f, **opts): |
|
398 | 398 | timer, fm = gettimer(ui, opts) |
|
399 | 399 | fc = repo['.'][f] |
|
400 | 400 | timer(lambda: len(fc.annotate(True))) |
|
401 | 401 | fm.end() |
|
402 | 402 | |
|
403 | 403 | @command('perfstatus', |
|
404 | 404 | [('u', 'unknown', False, |
|
405 | 405 | 'ask status to look for unknown files')] + formatteropts) |
|
406 | 406 | def perfstatus(ui, repo, **opts): |
|
407 | 407 | #m = match.always(repo.root, repo.getcwd()) |
|
408 | 408 | #timer(lambda: sum(map(len, repo.dirstate.status(m, [], False, False, |
|
409 | 409 | # False)))) |
|
410 | 410 | timer, fm = gettimer(ui, opts) |
|
411 | 411 | timer(lambda: sum(map(len, repo.status(unknown=opts['unknown'])))) |
|
412 | 412 | fm.end() |
|
413 | 413 | |
|
414 | 414 | @command('perfaddremove', formatteropts) |
|
415 | 415 | def perfaddremove(ui, repo, **opts): |
|
416 | 416 | timer, fm = gettimer(ui, opts) |
|
417 | 417 | try: |
|
418 | 418 | oldquiet = repo.ui.quiet |
|
419 | 419 | repo.ui.quiet = True |
|
420 | 420 | matcher = scmutil.match(repo[None]) |
|
421 | 421 | timer(lambda: scmutil.addremove(repo, matcher, "", dry_run=True)) |
|
422 | 422 | finally: |
|
423 | 423 | repo.ui.quiet = oldquiet |
|
424 | 424 | fm.end() |
|
425 | 425 | |
|
426 | 426 | def clearcaches(cl): |
|
427 | 427 | # behave somewhat consistently across internal API changes |
|
428 | 428 | if util.safehasattr(cl, 'clearcaches'): |
|
429 | 429 | cl.clearcaches() |
|
430 | 430 | elif util.safehasattr(cl, '_nodecache'): |
|
431 | 431 | from mercurial.node import nullid, nullrev |
|
432 | 432 | cl._nodecache = {nullid: nullrev} |
|
433 | 433 | cl._nodepos = None |
|
434 | 434 | |
|
435 | 435 | @command('perfheads', formatteropts) |
|
436 | 436 | def perfheads(ui, repo, **opts): |
|
437 | 437 | timer, fm = gettimer(ui, opts) |
|
438 | 438 | cl = repo.changelog |
|
439 | 439 | def d(): |
|
440 | 440 | len(cl.headrevs()) |
|
441 | 441 | clearcaches(cl) |
|
442 | 442 | timer(d) |
|
443 | 443 | fm.end() |
|
444 | 444 | |
|
445 | 445 | @command('perftags', formatteropts) |
|
446 | 446 | def perftags(ui, repo, **opts): |
|
447 | 447 | import mercurial.changelog |
|
448 | 448 | import mercurial.manifest |
|
449 | 449 | timer, fm = gettimer(ui, opts) |
|
450 | 450 | svfs = getsvfs(repo) |
|
451 | 451 | repocleartagscache = repocleartagscachefunc(repo) |
|
452 | 452 | def t(): |
|
453 | 453 | repo.changelog = mercurial.changelog.changelog(svfs) |
|
454 | 454 | repo.manifestlog = mercurial.manifest.manifestlog(svfs, repo) |
|
455 | 455 | repocleartagscache() |
|
456 | 456 | return len(repo.tags()) |
|
457 | 457 | timer(t) |
|
458 | 458 | fm.end() |
|
459 | 459 | |
|
460 | 460 | @command('perfancestors', formatteropts) |
|
461 | 461 | def perfancestors(ui, repo, **opts): |
|
462 | 462 | timer, fm = gettimer(ui, opts) |
|
463 | 463 | heads = repo.changelog.headrevs() |
|
464 | 464 | def d(): |
|
465 | 465 | for a in repo.changelog.ancestors(heads): |
|
466 | 466 | pass |
|
467 | 467 | timer(d) |
|
468 | 468 | fm.end() |
|
469 | 469 | |
|
470 | 470 | @command('perfancestorset', formatteropts) |
|
471 | 471 | def perfancestorset(ui, repo, revset, **opts): |
|
472 | 472 | timer, fm = gettimer(ui, opts) |
|
473 | 473 | revs = repo.revs(revset) |
|
474 | 474 | heads = repo.changelog.headrevs() |
|
475 | 475 | def d(): |
|
476 | 476 | s = repo.changelog.ancestors(heads) |
|
477 | 477 | for rev in revs: |
|
478 | 478 | rev in s |
|
479 | 479 | timer(d) |
|
480 | 480 | fm.end() |
|
481 | 481 | |
|
482 | 482 | @command('perfbookmarks', formatteropts) |
|
483 | 483 | def perfbookmarks(ui, repo, **opts): |
|
484 | 484 | """benchmark parsing bookmarks from disk to memory""" |
|
485 | 485 | timer, fm = gettimer(ui, opts) |
|
486 | 486 | def d(): |
|
487 | 487 | clearfilecache(repo, '_bookmarks') |
|
488 | 488 | repo._bookmarks |
|
489 | 489 | timer(d) |
|
490 | 490 | fm.end() |
|
491 | 491 | |
|
492 | 492 | @command('perfbundleread', formatteropts, 'BUNDLE') |
|
493 | 493 | def perfbundleread(ui, repo, bundlepath, **opts): |
|
494 | 494 | """Benchmark reading of bundle files. |
|
495 | 495 | |
|
496 | 496 | This command is meant to isolate the I/O part of bundle reading as |
|
497 | 497 | much as possible. |
|
498 | 498 | """ |
|
499 | 499 | from mercurial import ( |
|
500 | 500 | bundle2, |
|
501 | 501 | exchange, |
|
502 | 502 | streamclone, |
|
503 | 503 | ) |
|
504 | 504 | |
|
505 | 505 | def makebench(fn): |
|
506 | 506 | def run(): |
|
507 | 507 | with open(bundlepath, 'rb') as fh: |
|
508 | 508 | bundle = exchange.readbundle(ui, fh, bundlepath) |
|
509 | 509 | fn(bundle) |
|
510 | 510 | |
|
511 | 511 | return run |
|
512 | 512 | |
|
513 | 513 | def makereadnbytes(size): |
|
514 | 514 | def run(): |
|
515 | 515 | with open(bundlepath, 'rb') as fh: |
|
516 | 516 | bundle = exchange.readbundle(ui, fh, bundlepath) |
|
517 | 517 | while bundle.read(size): |
|
518 | 518 | pass |
|
519 | 519 | |
|
520 | 520 | return run |
|
521 | 521 | |
|
522 | 522 | def makestdioread(size): |
|
523 | 523 | def run(): |
|
524 | 524 | with open(bundlepath, 'rb') as fh: |
|
525 | 525 | while fh.read(size): |
|
526 | 526 | pass |
|
527 | 527 | |
|
528 | 528 | return run |
|
529 | 529 | |
|
530 | 530 | # bundle1 |
|
531 | 531 | |
|
532 | 532 | def deltaiter(bundle): |
|
533 | 533 | for delta in bundle.deltaiter(): |
|
534 | 534 | pass |
|
535 | 535 | |
|
536 | 536 | def iterchunks(bundle): |
|
537 | 537 | for chunk in bundle.getchunks(): |
|
538 | 538 | pass |
|
539 | 539 | |
|
540 | 540 | # bundle2 |
|
541 | 541 | |
|
542 | 542 | def forwardchunks(bundle): |
|
543 | 543 | for chunk in bundle._forwardchunks(): |
|
544 | 544 | pass |
|
545 | 545 | |
|
546 | 546 | def iterparts(bundle): |
|
547 | 547 | for part in bundle.iterparts(): |
|
548 | 548 | pass |
|
549 | 549 | |
|
550 | 550 | def iterpartsseekable(bundle): |
|
551 | 551 | for part in bundle.iterparts(seekable=True): |
|
552 | 552 | pass |
|
553 | 553 | |
|
554 | 554 | def seek(bundle): |
|
555 | 555 | for part in bundle.iterparts(seekable=True): |
|
556 | 556 | part.seek(0, os.SEEK_END) |
|
557 | 557 | |
|
558 | 558 | def makepartreadnbytes(size): |
|
559 | 559 | def run(): |
|
560 | 560 | with open(bundlepath, 'rb') as fh: |
|
561 | 561 | bundle = exchange.readbundle(ui, fh, bundlepath) |
|
562 | 562 | for part in bundle.iterparts(): |
|
563 | 563 | while part.read(size): |
|
564 | 564 | pass |
|
565 | 565 | |
|
566 | 566 | return run |
|
567 | 567 | |
|
568 | 568 | benches = [ |
|
569 | 569 | (makestdioread(8192), 'read(8k)'), |
|
570 | 570 | (makestdioread(16384), 'read(16k)'), |
|
571 | 571 | (makestdioread(32768), 'read(32k)'), |
|
572 | 572 | (makestdioread(131072), 'read(128k)'), |
|
573 | 573 | ] |
|
574 | 574 | |
|
575 | 575 | with open(bundlepath, 'rb') as fh: |
|
576 | 576 | bundle = exchange.readbundle(ui, fh, bundlepath) |
|
577 | 577 | |
|
578 | 578 | if isinstance(bundle, changegroup.cg1unpacker): |
|
579 | 579 | benches.extend([ |
|
580 | 580 | (makebench(deltaiter), 'cg1 deltaiter()'), |
|
581 | 581 | (makebench(iterchunks), 'cg1 getchunks()'), |
|
582 | 582 | (makereadnbytes(8192), 'cg1 read(8k)'), |
|
583 | 583 | (makereadnbytes(16384), 'cg1 read(16k)'), |
|
584 | 584 | (makereadnbytes(32768), 'cg1 read(32k)'), |
|
585 | 585 | (makereadnbytes(131072), 'cg1 read(128k)'), |
|
586 | 586 | ]) |
|
587 | 587 | elif isinstance(bundle, bundle2.unbundle20): |
|
588 | 588 | benches.extend([ |
|
589 | 589 | (makebench(forwardchunks), 'bundle2 forwardchunks()'), |
|
590 | 590 | (makebench(iterparts), 'bundle2 iterparts()'), |
|
591 | 591 | (makebench(iterpartsseekable), 'bundle2 iterparts() seekable'), |
|
592 | 592 | (makebench(seek), 'bundle2 part seek()'), |
|
593 | 593 | (makepartreadnbytes(8192), 'bundle2 part read(8k)'), |
|
594 | 594 | (makepartreadnbytes(16384), 'bundle2 part read(16k)'), |
|
595 | 595 | (makepartreadnbytes(32768), 'bundle2 part read(32k)'), |
|
596 | 596 | (makepartreadnbytes(131072), 'bundle2 part read(128k)'), |
|
597 | 597 | ]) |
|
598 | 598 | elif isinstance(bundle, streamclone.streamcloneapplier): |
|
599 | 599 | raise error.Abort('stream clone bundles not supported') |
|
600 | 600 | else: |
|
601 | 601 | raise error.Abort('unhandled bundle type: %s' % type(bundle)) |
|
602 | 602 | |
|
603 | 603 | for fn, title in benches: |
|
604 | 604 | timer, fm = gettimer(ui, opts) |
|
605 | 605 | timer(fn, title=title) |
|
606 | 606 | fm.end() |
|
607 | 607 | |
|
608 | 608 | @command('perfchangegroupchangelog', formatteropts + |
|
609 | 609 | [('', 'version', '02', 'changegroup version'), |
|
610 | 610 | ('r', 'rev', '', 'revisions to add to changegroup')]) |
|
611 | 611 | def perfchangegroupchangelog(ui, repo, version='02', rev=None, **opts): |
|
612 | 612 | """Benchmark producing a changelog group for a changegroup. |
|
613 | 613 | |
|
614 | 614 | This measures the time spent processing the changelog during a |
|
615 | 615 | bundle operation. This occurs during `hg bundle` and on a server |
|
616 | 616 | processing a `getbundle` wire protocol request (handles clones |
|
617 | 617 | and pull requests). |
|
618 | 618 | |
|
619 | 619 | By default, all revisions are added to the changegroup. |
|
620 | 620 | """ |
|
621 | 621 | cl = repo.changelog |
|
622 | 622 | revs = [cl.lookup(r) for r in repo.revs(rev or 'all()')] |
|
623 | 623 | bundler = changegroup.getbundler(version, repo) |
|
624 | 624 | |
|
625 | 625 | def lookup(node): |
|
626 | 626 | # The real bundler reads the revision in order to access the |
|
627 | 627 | # manifest node and files list. Do that here. |
|
628 | 628 | cl.read(node) |
|
629 | 629 | return node |
|
630 | 630 | |
|
631 | 631 | def d(): |
|
632 | 632 | for chunk in bundler.group(revs, cl, lookup): |
|
633 | 633 | pass |
|
634 | 634 | |
|
635 | 635 | timer, fm = gettimer(ui, opts) |
|
636 | 636 | timer(d) |
|
637 | 637 | fm.end() |
|
638 | 638 | |
|
639 | 639 | @command('perfdirs', formatteropts) |
|
640 | 640 | def perfdirs(ui, repo, **opts): |
|
641 | 641 | timer, fm = gettimer(ui, opts) |
|
642 | 642 | dirstate = repo.dirstate |
|
643 | 643 | 'a' in dirstate |
|
644 | 644 | def d(): |
|
645 | 645 | dirstate.hasdir('a') |
|
646 | 646 | del dirstate._map._dirs |
|
647 | 647 | timer(d) |
|
648 | 648 | fm.end() |
|
649 | 649 | |
|
650 | 650 | @command('perfdirstate', formatteropts) |
|
651 | 651 | def perfdirstate(ui, repo, **opts): |
|
652 | 652 | timer, fm = gettimer(ui, opts) |
|
653 | 653 | "a" in repo.dirstate |
|
654 | 654 | def d(): |
|
655 | 655 | repo.dirstate.invalidate() |
|
656 | 656 | "a" in repo.dirstate |
|
657 | 657 | timer(d) |
|
658 | 658 | fm.end() |
|
659 | 659 | |
|
660 | 660 | @command('perfdirstatedirs', formatteropts) |
|
661 | 661 | def perfdirstatedirs(ui, repo, **opts): |
|
662 | 662 | timer, fm = gettimer(ui, opts) |
|
663 | 663 | "a" in repo.dirstate |
|
664 | 664 | def d(): |
|
665 | 665 | repo.dirstate.hasdir("a") |
|
666 | 666 | del repo.dirstate._map._dirs |
|
667 | 667 | timer(d) |
|
668 | 668 | fm.end() |
|
669 | 669 | |
|
670 | 670 | @command('perfdirstatefoldmap', formatteropts) |
|
671 | 671 | def perfdirstatefoldmap(ui, repo, **opts): |
|
672 | 672 | timer, fm = gettimer(ui, opts) |
|
673 | 673 | dirstate = repo.dirstate |
|
674 | 674 | 'a' in dirstate |
|
675 | 675 | def d(): |
|
676 | 676 | dirstate._map.filefoldmap.get('a') |
|
677 | 677 | del dirstate._map.filefoldmap |
|
678 | 678 | timer(d) |
|
679 | 679 | fm.end() |
|
680 | 680 | |
|
681 | 681 | @command('perfdirfoldmap', formatteropts) |
|
682 | 682 | def perfdirfoldmap(ui, repo, **opts): |
|
683 | 683 | timer, fm = gettimer(ui, opts) |
|
684 | 684 | dirstate = repo.dirstate |
|
685 | 685 | 'a' in dirstate |
|
686 | 686 | def d(): |
|
687 | 687 | dirstate._map.dirfoldmap.get('a') |
|
688 | 688 | del dirstate._map.dirfoldmap |
|
689 | 689 | del dirstate._map._dirs |
|
690 | 690 | timer(d) |
|
691 | 691 | fm.end() |
|
692 | 692 | |
|
693 | 693 | @command('perfdirstatewrite', formatteropts) |
|
694 | 694 | def perfdirstatewrite(ui, repo, **opts): |
|
695 | 695 | timer, fm = gettimer(ui, opts) |
|
696 | 696 | ds = repo.dirstate |
|
697 | 697 | "a" in ds |
|
698 | 698 | def d(): |
|
699 | 699 | ds._dirty = True |
|
700 | 700 | ds.write(repo.currenttransaction()) |
|
701 | 701 | timer(d) |
|
702 | 702 | fm.end() |
|
703 | 703 | |
|
704 | 704 | @command('perfmergecalculate', |
|
705 | 705 | [('r', 'rev', '.', 'rev to merge against')] + formatteropts) |
|
706 | 706 | def perfmergecalculate(ui, repo, rev, **opts): |
|
707 | 707 | timer, fm = gettimer(ui, opts) |
|
708 | 708 | wctx = repo[None] |
|
709 | 709 | rctx = scmutil.revsingle(repo, rev, rev) |
|
710 | 710 | ancestor = wctx.ancestor(rctx) |
|
711 | 711 | # we don't want working dir files to be stat'd in the benchmark, so prime |
|
712 | 712 | # that cache |
|
713 | 713 | wctx.dirty() |
|
714 | 714 | def d(): |
|
715 | 715 | # acceptremote is True because we don't want prompts in the middle of |
|
716 | 716 | # our benchmark |
|
717 | 717 | merge.calculateupdates(repo, wctx, rctx, [ancestor], False, False, |
|
718 | 718 | acceptremote=True, followcopies=True) |
|
719 | 719 | timer(d) |
|
720 | 720 | fm.end() |
|
721 | 721 | |
|
722 | 722 | @command('perfpathcopies', [], "REV REV") |
|
723 | 723 | def perfpathcopies(ui, repo, rev1, rev2, **opts): |
|
724 | 724 | timer, fm = gettimer(ui, opts) |
|
725 | 725 | ctx1 = scmutil.revsingle(repo, rev1, rev1) |
|
726 | 726 | ctx2 = scmutil.revsingle(repo, rev2, rev2) |
|
727 | 727 | def d(): |
|
728 | 728 | copies.pathcopies(ctx1, ctx2) |
|
729 | 729 | timer(d) |
|
730 | 730 | fm.end() |
|
731 | 731 | |
|
732 | 732 | @command('perfphases', |
|
733 | 733 | [('', 'full', False, 'include file reading time too'), |
|
734 | 734 | ], "") |
|
735 | 735 | def perfphases(ui, repo, **opts): |
|
736 | 736 | """benchmark phasesets computation""" |
|
737 | 737 | timer, fm = gettimer(ui, opts) |
|
738 | 738 | _phases = repo._phasecache |
|
739 | 739 | full = opts.get('full') |
|
740 | 740 | def d(): |
|
741 | 741 | phases = _phases |
|
742 | 742 | if full: |
|
743 | 743 | clearfilecache(repo, '_phasecache') |
|
744 | 744 | phases = repo._phasecache |
|
745 | 745 | phases.invalidate() |
|
746 | 746 | phases.loadphaserevs(repo) |
|
747 | 747 | timer(d) |
|
748 | 748 | fm.end() |
|
749 | 749 | |
|
750 | 750 | @command('perfmanifest', [], 'REV') |
|
751 | 751 | def perfmanifest(ui, repo, rev, **opts): |
|
752 | 752 | timer, fm = gettimer(ui, opts) |
|
753 | 753 | ctx = scmutil.revsingle(repo, rev, rev) |
|
754 | 754 | t = ctx.manifestnode() |
|
755 | 755 | def d(): |
|
756 | 756 | repo.manifestlog.clearcaches() |
|
757 | 757 | repo.manifestlog[t].read() |
|
758 | 758 | timer(d) |
|
759 | 759 | fm.end() |
|
760 | 760 | |
|
761 | 761 | @command('perfchangeset', formatteropts) |
|
762 | 762 | def perfchangeset(ui, repo, rev, **opts): |
|
763 | 763 | timer, fm = gettimer(ui, opts) |
|
764 | 764 | n = repo[rev].node() |
|
765 | 765 | def d(): |
|
766 | 766 | repo.changelog.read(n) |
|
767 | 767 | #repo.changelog._cache = None |
|
768 | 768 | timer(d) |
|
769 | 769 | fm.end() |
|
770 | 770 | |
|
771 | 771 | @command('perfindex', formatteropts) |
|
772 | 772 | def perfindex(ui, repo, **opts): |
|
773 | 773 | import mercurial.revlog |
|
774 | 774 | timer, fm = gettimer(ui, opts) |
|
775 | 775 | mercurial.revlog._prereadsize = 2**24 # disable lazy parser in old hg |
|
776 | 776 | n = repo["tip"].node() |
|
777 | 777 | svfs = getsvfs(repo) |
|
778 | 778 | def d(): |
|
779 | 779 | cl = mercurial.revlog.revlog(svfs, "00changelog.i") |
|
780 | 780 | cl.rev(n) |
|
781 | 781 | timer(d) |
|
782 | 782 | fm.end() |
|
783 | 783 | |
|
784 | 784 | @command('perfstartup', formatteropts) |
|
785 | 785 | def perfstartup(ui, repo, **opts): |
|
786 | 786 | timer, fm = gettimer(ui, opts) |
|
787 | 787 | cmd = sys.argv[0] |
|
788 | 788 | def d(): |
|
789 | 789 | if os.name != 'nt': |
|
790 | 790 | os.system("HGRCPATH= %s version -q > /dev/null" % cmd) |
|
791 | 791 | else: |
|
792 | 792 | os.environ['HGRCPATH'] = ' ' |
|
793 | 793 | os.system("%s version -q > NUL" % cmd) |
|
794 | 794 | timer(d) |
|
795 | 795 | fm.end() |
|
796 | 796 | |
|
797 | 797 | @command('perfparents', formatteropts) |
|
798 | 798 | def perfparents(ui, repo, **opts): |
|
799 | 799 | timer, fm = gettimer(ui, opts) |
|
800 | 800 | # control the number of commits perfparents iterates over |
|
801 | 801 | # experimental config: perf.parentscount |
|
802 | 802 | count = getint(ui, "perf", "parentscount", 1000) |
|
803 | 803 | if len(repo.changelog) < count: |
|
804 | 804 | raise error.Abort("repo needs %d commits for this test" % count) |
|
805 | 805 | repo = repo.unfiltered() |
|
806 | 806 | nl = [repo.changelog.node(i) for i in xrange(count)] |
|
807 | 807 | def d(): |
|
808 | 808 | for n in nl: |
|
809 | 809 | repo.changelog.parents(n) |
|
810 | 810 | timer(d) |
|
811 | 811 | fm.end() |
|
812 | 812 | |
|
813 | 813 | @command('perfctxfiles', formatteropts) |
|
814 | 814 | def perfctxfiles(ui, repo, x, **opts): |
|
815 | 815 | x = int(x) |
|
816 | 816 | timer, fm = gettimer(ui, opts) |
|
817 | 817 | def d(): |
|
818 | 818 | len(repo[x].files()) |
|
819 | 819 | timer(d) |
|
820 | 820 | fm.end() |
|
821 | 821 | |
|
822 | 822 | @command('perfrawfiles', formatteropts) |
|
823 | 823 | def perfrawfiles(ui, repo, x, **opts): |
|
824 | 824 | x = int(x) |
|
825 | 825 | timer, fm = gettimer(ui, opts) |
|
826 | 826 | cl = repo.changelog |
|
827 | 827 | def d(): |
|
828 | 828 | len(cl.read(x)[3]) |
|
829 | 829 | timer(d) |
|
830 | 830 | fm.end() |
|
831 | 831 | |
|
832 | 832 | @command('perflookup', formatteropts) |
|
833 | 833 | def perflookup(ui, repo, rev, **opts): |
|
834 | 834 | timer, fm = gettimer(ui, opts) |
|
835 | 835 | timer(lambda: len(repo.lookup(rev))) |
|
836 | 836 | fm.end() |
|
837 | 837 | |
|
838 | 838 | @command('perfrevrange', formatteropts) |
|
839 | 839 | def perfrevrange(ui, repo, *specs, **opts): |
|
840 | 840 | timer, fm = gettimer(ui, opts) |
|
841 | 841 | revrange = scmutil.revrange |
|
842 | 842 | timer(lambda: len(revrange(repo, specs))) |
|
843 | 843 | fm.end() |
|
844 | 844 | |
|
845 | 845 | @command('perfnodelookup', formatteropts) |
|
846 | 846 | def perfnodelookup(ui, repo, rev, **opts): |
|
847 | 847 | timer, fm = gettimer(ui, opts) |
|
848 | 848 | import mercurial.revlog |
|
849 | 849 | mercurial.revlog._prereadsize = 2**24 # disable lazy parser in old hg |
|
850 | 850 | n = repo[rev].node() |
|
851 | 851 | cl = mercurial.revlog.revlog(getsvfs(repo), "00changelog.i") |
|
852 | 852 | def d(): |
|
853 | 853 | cl.rev(n) |
|
854 | 854 | clearcaches(cl) |
|
855 | 855 | timer(d) |
|
856 | 856 | fm.end() |
|
857 | 857 | |
|
858 | 858 | @command('perflog', |
|
859 | 859 | [('', 'rename', False, 'ask log to follow renames')] + formatteropts) |
|
860 | 860 | def perflog(ui, repo, rev=None, **opts): |
|
861 | 861 | if rev is None: |
|
862 | 862 | rev=[] |
|
863 | 863 | timer, fm = gettimer(ui, opts) |
|
864 | 864 | ui.pushbuffer() |
|
865 | 865 | timer(lambda: commands.log(ui, repo, rev=rev, date='', user='', |
|
866 | 866 | copies=opts.get('rename'))) |
|
867 | 867 | ui.popbuffer() |
|
868 | 868 | fm.end() |
|
869 | 869 | |
|
870 | 870 | @command('perfmoonwalk', formatteropts) |
|
871 | 871 | def perfmoonwalk(ui, repo, **opts): |
|
872 | 872 | """benchmark walking the changelog backwards |
|
873 | 873 | |
|
874 | 874 | This also loads the changelog data for each revision in the changelog. |
|
875 | 875 | """ |
|
876 | 876 | timer, fm = gettimer(ui, opts) |
|
877 | 877 | def moonwalk(): |
|
878 | 878 | for i in xrange(len(repo), -1, -1): |
|
879 | 879 | ctx = repo[i] |
|
880 | 880 | ctx.branch() # read changelog data (in addition to the index) |
|
881 | 881 | timer(moonwalk) |
|
882 | 882 | fm.end() |
|
883 | 883 | |
|
884 | 884 | @command('perftemplating', formatteropts) |
|
885 | 885 | def perftemplating(ui, repo, rev=None, **opts): |
|
886 | 886 | if rev is None: |
|
887 | 887 | rev=[] |
|
888 | 888 | timer, fm = gettimer(ui, opts) |
|
889 | 889 | ui.pushbuffer() |
|
890 | 890 | timer(lambda: commands.log(ui, repo, rev=rev, date='', user='', |
|
891 | 891 | template='{date|shortdate} [{rev}:{node|short}]' |
|
892 | 892 | ' {author|person}: {desc|firstline}\n')) |
|
893 | 893 | ui.popbuffer() |
|
894 | 894 | fm.end() |
|
895 | 895 | |
|
896 | 896 | @command('perfcca', formatteropts) |
|
897 | 897 | def perfcca(ui, repo, **opts): |
|
898 | 898 | timer, fm = gettimer(ui, opts) |
|
899 | 899 | timer(lambda: scmutil.casecollisionauditor(ui, False, repo.dirstate)) |
|
900 | 900 | fm.end() |
|
901 | 901 | |
|
902 | 902 | @command('perffncacheload', formatteropts) |
|
903 | 903 | def perffncacheload(ui, repo, **opts): |
|
904 | 904 | timer, fm = gettimer(ui, opts) |
|
905 | 905 | s = repo.store |
|
906 | 906 | def d(): |
|
907 | 907 | s.fncache._load() |
|
908 | 908 | timer(d) |
|
909 | 909 | fm.end() |
|
910 | 910 | |
|
911 | 911 | @command('perffncachewrite', formatteropts) |
|
912 | 912 | def perffncachewrite(ui, repo, **opts): |
|
913 | 913 | timer, fm = gettimer(ui, opts) |
|
914 | 914 | s = repo.store |
|
915 | 915 | s.fncache._load() |
|
916 | 916 | lock = repo.lock() |
|
917 | 917 | tr = repo.transaction('perffncachewrite') |
|
918 | 918 | def d(): |
|
919 | 919 | s.fncache._dirty = True |
|
920 | 920 | s.fncache.write(tr) |
|
921 | 921 | timer(d) |
|
922 | 922 | tr.close() |
|
923 | 923 | lock.release() |
|
924 | 924 | fm.end() |
|
925 | 925 | |
|
926 | 926 | @command('perffncacheencode', formatteropts) |
|
927 | 927 | def perffncacheencode(ui, repo, **opts): |
|
928 | 928 | timer, fm = gettimer(ui, opts) |
|
929 | 929 | s = repo.store |
|
930 | 930 | s.fncache._load() |
|
931 | 931 | def d(): |
|
932 | 932 | for p in s.fncache.entries: |
|
933 | 933 | s.encode(p) |
|
934 | 934 | timer(d) |
|
935 | 935 | fm.end() |
|
936 | 936 | |
|
937 | 937 | def _bdiffworker(q, ready, done): |
|
938 | 938 | while not done.is_set(): |
|
939 | 939 | pair = q.get() |
|
940 | 940 | while pair is not None: |
|
941 | 941 | mdiff.textdiff(*pair) |
|
942 | 942 | q.task_done() |
|
943 | 943 | pair = q.get() |
|
944 | 944 | q.task_done() # for the None one |
|
945 | 945 | with ready: |
|
946 | 946 | ready.wait() |
|
947 | 947 | |
|
948 | 948 | @command('perfbdiff', revlogopts + formatteropts + [ |
|
949 | 949 | ('', 'count', 1, 'number of revisions to test (when using --startrev)'), |
|
950 | 950 | ('', 'alldata', False, 'test bdiffs for all associated revisions'), |
|
951 | 951 | ('', 'threads', 0, 'number of thread to use (disable with 0)'), |
|
952 | 952 | ], |
|
953 | 953 | |
|
954 | 954 | '-c|-m|FILE REV') |
|
955 | 955 | def perfbdiff(ui, repo, file_, rev=None, count=None, threads=0, **opts): |
|
956 | 956 | """benchmark a bdiff between revisions |
|
957 | 957 | |
|
958 | 958 | By default, benchmark a bdiff between its delta parent and itself. |
|
959 | 959 | |
|
960 | 960 | With ``--count``, benchmark bdiffs between delta parents and self for N |
|
961 | 961 | revisions starting at the specified revision. |
|
962 | 962 | |
|
963 | 963 | With ``--alldata``, assume the requested revision is a changeset and |
|
964 | 964 | measure bdiffs for all changes related to that changeset (manifest |
|
965 | 965 | and filelogs). |
|
966 | 966 | """ |
|
967 | 967 | if opts['alldata']: |
|
968 | 968 | opts['changelog'] = True |
|
969 | 969 | |
|
970 | 970 | if opts.get('changelog') or opts.get('manifest'): |
|
971 | 971 | file_, rev = None, file_ |
|
972 | 972 | elif rev is None: |
|
973 | 973 | raise error.CommandError('perfbdiff', 'invalid arguments') |
|
974 | 974 | |
|
975 | 975 | textpairs = [] |
|
976 | 976 | |
|
977 | 977 | r = cmdutil.openrevlog(repo, 'perfbdiff', file_, opts) |
|
978 | 978 | |
|
979 | 979 | startrev = r.rev(r.lookup(rev)) |
|
980 | 980 | for rev in range(startrev, min(startrev + count, len(r) - 1)): |
|
981 | 981 | if opts['alldata']: |
|
982 | 982 | # Load revisions associated with changeset. |
|
983 | 983 | ctx = repo[rev] |
|
984 | 984 | mtext = repo.manifestlog._revlog.revision(ctx.manifestnode()) |
|
985 | 985 | for pctx in ctx.parents(): |
|
986 | 986 | pman = repo.manifestlog._revlog.revision(pctx.manifestnode()) |
|
987 | 987 | textpairs.append((pman, mtext)) |
|
988 | 988 | |
|
989 | 989 | # Load filelog revisions by iterating manifest delta. |
|
990 | 990 | man = ctx.manifest() |
|
991 | 991 | pman = ctx.p1().manifest() |
|
992 | 992 | for filename, change in pman.diff(man).items(): |
|
993 | 993 | fctx = repo.file(filename) |
|
994 | 994 | f1 = fctx.revision(change[0][0] or -1) |
|
995 | 995 | f2 = fctx.revision(change[1][0] or -1) |
|
996 | 996 | textpairs.append((f1, f2)) |
|
997 | 997 | else: |
|
998 | 998 | dp = r.deltaparent(rev) |
|
999 | 999 | textpairs.append((r.revision(dp), r.revision(rev))) |
|
1000 | 1000 | |
|
1001 | 1001 | withthreads = threads > 0 |
|
1002 | 1002 | if not withthreads: |
|
1003 | 1003 | def d(): |
|
1004 | 1004 | for pair in textpairs: |
|
1005 | 1005 | mdiff.textdiff(*pair) |
|
1006 | 1006 | else: |
|
1007 | 1007 | q = util.queue() |
|
1008 | 1008 | for i in xrange(threads): |
|
1009 | 1009 | q.put(None) |
|
1010 | 1010 | ready = threading.Condition() |
|
1011 | 1011 | done = threading.Event() |
|
1012 | 1012 | for i in xrange(threads): |
|
1013 | 1013 | threading.Thread(target=_bdiffworker, args=(q, ready, done)).start() |
|
1014 | 1014 | q.join() |
|
1015 | 1015 | def d(): |
|
1016 | 1016 | for pair in textpairs: |
|
1017 | 1017 | q.put(pair) |
|
1018 | 1018 | for i in xrange(threads): |
|
1019 | 1019 | q.put(None) |
|
1020 | 1020 | with ready: |
|
1021 | 1021 | ready.notify_all() |
|
1022 | 1022 | q.join() |
|
1023 | 1023 | timer, fm = gettimer(ui, opts) |
|
1024 | 1024 | timer(d) |
|
1025 | 1025 | fm.end() |
|
1026 | 1026 | |
|
1027 | 1027 | if withthreads: |
|
1028 | 1028 | done.set() |
|
1029 | 1029 | for i in xrange(threads): |
|
1030 | 1030 | q.put(None) |
|
1031 | 1031 | with ready: |
|
1032 | 1032 | ready.notify_all() |
|
1033 | 1033 | |
|
1034 | 1034 | @command('perfunidiff', revlogopts + formatteropts + [ |
|
1035 | 1035 | ('', 'count', 1, 'number of revisions to test (when using --startrev)'), |
|
1036 | 1036 | ('', 'alldata', False, 'test unidiffs for all associated revisions'), |
|
1037 | 1037 | ], '-c|-m|FILE REV') |
|
1038 | 1038 | def perfunidiff(ui, repo, file_, rev=None, count=None, **opts): |
|
1039 | 1039 | """benchmark a unified diff between revisions |
|
1040 | 1040 | |
|
1041 | 1041 | This doesn't include any copy tracing - it's just a unified diff |
|
1042 | 1042 | of the texts. |
|
1043 | 1043 | |
|
1044 | 1044 | By default, benchmark a diff between its delta parent and itself. |
|
1045 | 1045 | |
|
1046 | 1046 | With ``--count``, benchmark diffs between delta parents and self for N |
|
1047 | 1047 | revisions starting at the specified revision. |
|
1048 | 1048 | |
|
1049 | 1049 | With ``--alldata``, assume the requested revision is a changeset and |
|
1050 | 1050 | measure diffs for all changes related to that changeset (manifest |
|
1051 | 1051 | and filelogs). |
|
1052 | 1052 | """ |
|
1053 | 1053 | if opts['alldata']: |
|
1054 | 1054 | opts['changelog'] = True |
|
1055 | 1055 | |
|
1056 | 1056 | if opts.get('changelog') or opts.get('manifest'): |
|
1057 | 1057 | file_, rev = None, file_ |
|
1058 | 1058 | elif rev is None: |
|
1059 | 1059 | raise error.CommandError('perfunidiff', 'invalid arguments') |
|
1060 | 1060 | |
|
1061 | 1061 | textpairs = [] |
|
1062 | 1062 | |
|
1063 | 1063 | r = cmdutil.openrevlog(repo, 'perfunidiff', file_, opts) |
|
1064 | 1064 | |
|
1065 | 1065 | startrev = r.rev(r.lookup(rev)) |
|
1066 | 1066 | for rev in range(startrev, min(startrev + count, len(r) - 1)): |
|
1067 | 1067 | if opts['alldata']: |
|
1068 | 1068 | # Load revisions associated with changeset. |
|
1069 | 1069 | ctx = repo[rev] |
|
1070 | 1070 | mtext = repo.manifestlog._revlog.revision(ctx.manifestnode()) |
|
1071 | 1071 | for pctx in ctx.parents(): |
|
1072 | 1072 | pman = repo.manifestlog._revlog.revision(pctx.manifestnode()) |
|
1073 | 1073 | textpairs.append((pman, mtext)) |
|
1074 | 1074 | |
|
1075 | 1075 | # Load filelog revisions by iterating manifest delta. |
|
1076 | 1076 | man = ctx.manifest() |
|
1077 | 1077 | pman = ctx.p1().manifest() |
|
1078 | 1078 | for filename, change in pman.diff(man).items(): |
|
1079 | 1079 | fctx = repo.file(filename) |
|
1080 | 1080 | f1 = fctx.revision(change[0][0] or -1) |
|
1081 | 1081 | f2 = fctx.revision(change[1][0] or -1) |
|
1082 | 1082 | textpairs.append((f1, f2)) |
|
1083 | 1083 | else: |
|
1084 | 1084 | dp = r.deltaparent(rev) |
|
1085 | 1085 | textpairs.append((r.revision(dp), r.revision(rev))) |
|
1086 | 1086 | |
|
1087 | 1087 | def d(): |
|
1088 | 1088 | for left, right in textpairs: |
|
1089 | 1089 | # The date strings don't matter, so we pass empty strings. |
|
1090 | 1090 | headerlines, hunks = mdiff.unidiff( |
|
1091 | left, '', right, '', 'left', 'right') | |
|
1091 | left, '', right, '', 'left', 'right', binary=False) | |
|
1092 | 1092 | # consume iterators in roughly the way patch.py does |
|
1093 | 1093 | b'\n'.join(headerlines) |
|
1094 | 1094 | b''.join(sum((list(hlines) for hrange, hlines in hunks), [])) |
|
1095 | 1095 | timer, fm = gettimer(ui, opts) |
|
1096 | 1096 | timer(d) |
|
1097 | 1097 | fm.end() |
|
1098 | 1098 | |
|
1099 | 1099 | @command('perfdiffwd', formatteropts) |
|
1100 | 1100 | def perfdiffwd(ui, repo, **opts): |
|
1101 | 1101 | """Profile diff of working directory changes""" |
|
1102 | 1102 | timer, fm = gettimer(ui, opts) |
|
1103 | 1103 | options = { |
|
1104 | 1104 | 'w': 'ignore_all_space', |
|
1105 | 1105 | 'b': 'ignore_space_change', |
|
1106 | 1106 | 'B': 'ignore_blank_lines', |
|
1107 | 1107 | } |
|
1108 | 1108 | |
|
1109 | 1109 | for diffopt in ('', 'w', 'b', 'B', 'wB'): |
|
1110 | 1110 | opts = dict((options[c], '1') for c in diffopt) |
|
1111 | 1111 | def d(): |
|
1112 | 1112 | ui.pushbuffer() |
|
1113 | 1113 | commands.diff(ui, repo, **opts) |
|
1114 | 1114 | ui.popbuffer() |
|
1115 | 1115 | title = 'diffopts: %s' % (diffopt and ('-' + diffopt) or 'none') |
|
1116 | 1116 | timer(d, title) |
|
1117 | 1117 | fm.end() |
|
1118 | 1118 | |
|
1119 | 1119 | @command('perfrevlogindex', revlogopts + formatteropts, |
|
1120 | 1120 | '-c|-m|FILE') |
|
1121 | 1121 | def perfrevlogindex(ui, repo, file_=None, **opts): |
|
1122 | 1122 | """Benchmark operations against a revlog index. |
|
1123 | 1123 | |
|
1124 | 1124 | This tests constructing a revlog instance, reading index data, |
|
1125 | 1125 | parsing index data, and performing various operations related to |
|
1126 | 1126 | index data. |
|
1127 | 1127 | """ |
|
1128 | 1128 | |
|
1129 | 1129 | rl = cmdutil.openrevlog(repo, 'perfrevlogindex', file_, opts) |
|
1130 | 1130 | |
|
1131 | 1131 | opener = getattr(rl, 'opener') # trick linter |
|
1132 | 1132 | indexfile = rl.indexfile |
|
1133 | 1133 | data = opener.read(indexfile) |
|
1134 | 1134 | |
|
1135 | 1135 | header = struct.unpack('>I', data[0:4])[0] |
|
1136 | 1136 | version = header & 0xFFFF |
|
1137 | 1137 | if version == 1: |
|
1138 | 1138 | revlogio = revlog.revlogio() |
|
1139 | 1139 | inline = header & (1 << 16) |
|
1140 | 1140 | else: |
|
1141 | 1141 | raise error.Abort(('unsupported revlog version: %d') % version) |
|
1142 | 1142 | |
|
1143 | 1143 | rllen = len(rl) |
|
1144 | 1144 | |
|
1145 | 1145 | node0 = rl.node(0) |
|
1146 | 1146 | node25 = rl.node(rllen // 4) |
|
1147 | 1147 | node50 = rl.node(rllen // 2) |
|
1148 | 1148 | node75 = rl.node(rllen // 4 * 3) |
|
1149 | 1149 | node100 = rl.node(rllen - 1) |
|
1150 | 1150 | |
|
1151 | 1151 | allrevs = range(rllen) |
|
1152 | 1152 | allrevsrev = list(reversed(allrevs)) |
|
1153 | 1153 | allnodes = [rl.node(rev) for rev in range(rllen)] |
|
1154 | 1154 | allnodesrev = list(reversed(allnodes)) |
|
1155 | 1155 | |
|
1156 | 1156 | def constructor(): |
|
1157 | 1157 | revlog.revlog(opener, indexfile) |
|
1158 | 1158 | |
|
1159 | 1159 | def read(): |
|
1160 | 1160 | with opener(indexfile) as fh: |
|
1161 | 1161 | fh.read() |
|
1162 | 1162 | |
|
1163 | 1163 | def parseindex(): |
|
1164 | 1164 | revlogio.parseindex(data, inline) |
|
1165 | 1165 | |
|
1166 | 1166 | def getentry(revornode): |
|
1167 | 1167 | index = revlogio.parseindex(data, inline)[0] |
|
1168 | 1168 | index[revornode] |
|
1169 | 1169 | |
|
1170 | 1170 | def getentries(revs, count=1): |
|
1171 | 1171 | index = revlogio.parseindex(data, inline)[0] |
|
1172 | 1172 | |
|
1173 | 1173 | for i in range(count): |
|
1174 | 1174 | for rev in revs: |
|
1175 | 1175 | index[rev] |
|
1176 | 1176 | |
|
1177 | 1177 | def resolvenode(node): |
|
1178 | 1178 | nodemap = revlogio.parseindex(data, inline)[1] |
|
1179 | 1179 | # This only works for the C code. |
|
1180 | 1180 | if nodemap is None: |
|
1181 | 1181 | return |
|
1182 | 1182 | |
|
1183 | 1183 | try: |
|
1184 | 1184 | nodemap[node] |
|
1185 | 1185 | except error.RevlogError: |
|
1186 | 1186 | pass |
|
1187 | 1187 | |
|
1188 | 1188 | def resolvenodes(nodes, count=1): |
|
1189 | 1189 | nodemap = revlogio.parseindex(data, inline)[1] |
|
1190 | 1190 | if nodemap is None: |
|
1191 | 1191 | return |
|
1192 | 1192 | |
|
1193 | 1193 | for i in range(count): |
|
1194 | 1194 | for node in nodes: |
|
1195 | 1195 | try: |
|
1196 | 1196 | nodemap[node] |
|
1197 | 1197 | except error.RevlogError: |
|
1198 | 1198 | pass |
|
1199 | 1199 | |
|
1200 | 1200 | benches = [ |
|
1201 | 1201 | (constructor, 'revlog constructor'), |
|
1202 | 1202 | (read, 'read'), |
|
1203 | 1203 | (parseindex, 'create index object'), |
|
1204 | 1204 | (lambda: getentry(0), 'retrieve index entry for rev 0'), |
|
1205 | 1205 | (lambda: resolvenode('a' * 20), 'look up missing node'), |
|
1206 | 1206 | (lambda: resolvenode(node0), 'look up node at rev 0'), |
|
1207 | 1207 | (lambda: resolvenode(node25), 'look up node at 1/4 len'), |
|
1208 | 1208 | (lambda: resolvenode(node50), 'look up node at 1/2 len'), |
|
1209 | 1209 | (lambda: resolvenode(node75), 'look up node at 3/4 len'), |
|
1210 | 1210 | (lambda: resolvenode(node100), 'look up node at tip'), |
|
1211 | 1211 | # 2x variation is to measure caching impact. |
|
1212 | 1212 | (lambda: resolvenodes(allnodes), |
|
1213 | 1213 | 'look up all nodes (forward)'), |
|
1214 | 1214 | (lambda: resolvenodes(allnodes, 2), |
|
1215 | 1215 | 'look up all nodes 2x (forward)'), |
|
1216 | 1216 | (lambda: resolvenodes(allnodesrev), |
|
1217 | 1217 | 'look up all nodes (reverse)'), |
|
1218 | 1218 | (lambda: resolvenodes(allnodesrev, 2), |
|
1219 | 1219 | 'look up all nodes 2x (reverse)'), |
|
1220 | 1220 | (lambda: getentries(allrevs), |
|
1221 | 1221 | 'retrieve all index entries (forward)'), |
|
1222 | 1222 | (lambda: getentries(allrevs, 2), |
|
1223 | 1223 | 'retrieve all index entries 2x (forward)'), |
|
1224 | 1224 | (lambda: getentries(allrevsrev), |
|
1225 | 1225 | 'retrieve all index entries (reverse)'), |
|
1226 | 1226 | (lambda: getentries(allrevsrev, 2), |
|
1227 | 1227 | 'retrieve all index entries 2x (reverse)'), |
|
1228 | 1228 | ] |
|
1229 | 1229 | |
|
1230 | 1230 | for fn, title in benches: |
|
1231 | 1231 | timer, fm = gettimer(ui, opts) |
|
1232 | 1232 | timer(fn, title=title) |
|
1233 | 1233 | fm.end() |
|
1234 | 1234 | |
|
1235 | 1235 | @command('perfrevlogrevisions', revlogopts + formatteropts + |
|
1236 | 1236 | [('d', 'dist', 100, 'distance between the revisions'), |
|
1237 | 1237 | ('s', 'startrev', 0, 'revision to start reading at'), |
|
1238 | 1238 | ('', 'reverse', False, 'read in reverse')], |
|
1239 | 1239 | '-c|-m|FILE') |
|
1240 | 1240 | def perfrevlogrevisions(ui, repo, file_=None, startrev=0, reverse=False, |
|
1241 | 1241 | **opts): |
|
1242 | 1242 | """Benchmark reading a series of revisions from a revlog. |
|
1243 | 1243 | |
|
1244 | 1244 | By default, we read every ``-d/--dist`` revision from 0 to tip of |
|
1245 | 1245 | the specified revlog. |
|
1246 | 1246 | |
|
1247 | 1247 | The start revision can be defined via ``-s/--startrev``. |
|
1248 | 1248 | """ |
|
1249 | 1249 | rl = cmdutil.openrevlog(repo, 'perfrevlogrevisions', file_, opts) |
|
1250 | 1250 | rllen = getlen(ui)(rl) |
|
1251 | 1251 | |
|
1252 | 1252 | def d(): |
|
1253 | 1253 | rl.clearcaches() |
|
1254 | 1254 | |
|
1255 | 1255 | beginrev = startrev |
|
1256 | 1256 | endrev = rllen |
|
1257 | 1257 | dist = opts['dist'] |
|
1258 | 1258 | |
|
1259 | 1259 | if reverse: |
|
1260 | 1260 | beginrev, endrev = endrev, beginrev |
|
1261 | 1261 | dist = -1 * dist |
|
1262 | 1262 | |
|
1263 | 1263 | for x in xrange(beginrev, endrev, dist): |
|
1264 | 1264 | # Old revisions don't support passing int. |
|
1265 | 1265 | n = rl.node(x) |
|
1266 | 1266 | rl.revision(n) |
|
1267 | 1267 | |
|
1268 | 1268 | timer, fm = gettimer(ui, opts) |
|
1269 | 1269 | timer(d) |
|
1270 | 1270 | fm.end() |
|
1271 | 1271 | |
|
1272 | 1272 | @command('perfrevlogchunks', revlogopts + formatteropts + |
|
1273 | 1273 | [('e', 'engines', '', 'compression engines to use'), |
|
1274 | 1274 | ('s', 'startrev', 0, 'revision to start at')], |
|
1275 | 1275 | '-c|-m|FILE') |
|
1276 | 1276 | def perfrevlogchunks(ui, repo, file_=None, engines=None, startrev=0, **opts): |
|
1277 | 1277 | """Benchmark operations on revlog chunks. |
|
1278 | 1278 | |
|
1279 | 1279 | Logically, each revlog is a collection of fulltext revisions. However, |
|
1280 | 1280 | stored within each revlog are "chunks" of possibly compressed data. This |
|
1281 | 1281 | data needs to be read and decompressed or compressed and written. |
|
1282 | 1282 | |
|
1283 | 1283 | This command measures the time it takes to read+decompress and recompress |
|
1284 | 1284 | chunks in a revlog. It effectively isolates I/O and compression performance. |
|
1285 | 1285 | For measurements of higher-level operations like resolving revisions, |
|
1286 | 1286 | see ``perfrevlogrevisions`` and ``perfrevlogrevision``. |
|
1287 | 1287 | """ |
|
1288 | 1288 | rl = cmdutil.openrevlog(repo, 'perfrevlogchunks', file_, opts) |
|
1289 | 1289 | |
|
1290 | 1290 | # _chunkraw was renamed to _getsegmentforrevs. |
|
1291 | 1291 | try: |
|
1292 | 1292 | segmentforrevs = rl._getsegmentforrevs |
|
1293 | 1293 | except AttributeError: |
|
1294 | 1294 | segmentforrevs = rl._chunkraw |
|
1295 | 1295 | |
|
1296 | 1296 | # Verify engines argument. |
|
1297 | 1297 | if engines: |
|
1298 | 1298 | engines = set(e.strip() for e in engines.split(',')) |
|
1299 | 1299 | for engine in engines: |
|
1300 | 1300 | try: |
|
1301 | 1301 | util.compressionengines[engine] |
|
1302 | 1302 | except KeyError: |
|
1303 | 1303 | raise error.Abort('unknown compression engine: %s' % engine) |
|
1304 | 1304 | else: |
|
1305 | 1305 | engines = [] |
|
1306 | 1306 | for e in util.compengines: |
|
1307 | 1307 | engine = util.compengines[e] |
|
1308 | 1308 | try: |
|
1309 | 1309 | if engine.available(): |
|
1310 | 1310 | engine.revlogcompressor().compress('dummy') |
|
1311 | 1311 | engines.append(e) |
|
1312 | 1312 | except NotImplementedError: |
|
1313 | 1313 | pass |
|
1314 | 1314 | |
|
1315 | 1315 | revs = list(rl.revs(startrev, len(rl) - 1)) |
|
1316 | 1316 | |
|
1317 | 1317 | def rlfh(rl): |
|
1318 | 1318 | if rl._inline: |
|
1319 | 1319 | return getsvfs(repo)(rl.indexfile) |
|
1320 | 1320 | else: |
|
1321 | 1321 | return getsvfs(repo)(rl.datafile) |
|
1322 | 1322 | |
|
1323 | 1323 | def doread(): |
|
1324 | 1324 | rl.clearcaches() |
|
1325 | 1325 | for rev in revs: |
|
1326 | 1326 | segmentforrevs(rev, rev) |
|
1327 | 1327 | |
|
1328 | 1328 | def doreadcachedfh(): |
|
1329 | 1329 | rl.clearcaches() |
|
1330 | 1330 | fh = rlfh(rl) |
|
1331 | 1331 | for rev in revs: |
|
1332 | 1332 | segmentforrevs(rev, rev, df=fh) |
|
1333 | 1333 | |
|
1334 | 1334 | def doreadbatch(): |
|
1335 | 1335 | rl.clearcaches() |
|
1336 | 1336 | segmentforrevs(revs[0], revs[-1]) |
|
1337 | 1337 | |
|
1338 | 1338 | def doreadbatchcachedfh(): |
|
1339 | 1339 | rl.clearcaches() |
|
1340 | 1340 | fh = rlfh(rl) |
|
1341 | 1341 | segmentforrevs(revs[0], revs[-1], df=fh) |
|
1342 | 1342 | |
|
1343 | 1343 | def dochunk(): |
|
1344 | 1344 | rl.clearcaches() |
|
1345 | 1345 | fh = rlfh(rl) |
|
1346 | 1346 | for rev in revs: |
|
1347 | 1347 | rl._chunk(rev, df=fh) |
|
1348 | 1348 | |
|
1349 | 1349 | chunks = [None] |
|
1350 | 1350 | |
|
1351 | 1351 | def dochunkbatch(): |
|
1352 | 1352 | rl.clearcaches() |
|
1353 | 1353 | fh = rlfh(rl) |
|
1354 | 1354 | # Save chunks as a side-effect. |
|
1355 | 1355 | chunks[0] = rl._chunks(revs, df=fh) |
|
1356 | 1356 | |
|
1357 | 1357 | def docompress(compressor): |
|
1358 | 1358 | rl.clearcaches() |
|
1359 | 1359 | |
|
1360 | 1360 | try: |
|
1361 | 1361 | # Swap in the requested compression engine. |
|
1362 | 1362 | oldcompressor = rl._compressor |
|
1363 | 1363 | rl._compressor = compressor |
|
1364 | 1364 | for chunk in chunks[0]: |
|
1365 | 1365 | rl.compress(chunk) |
|
1366 | 1366 | finally: |
|
1367 | 1367 | rl._compressor = oldcompressor |
|
1368 | 1368 | |
|
1369 | 1369 | benches = [ |
|
1370 | 1370 | (lambda: doread(), 'read'), |
|
1371 | 1371 | (lambda: doreadcachedfh(), 'read w/ reused fd'), |
|
1372 | 1372 | (lambda: doreadbatch(), 'read batch'), |
|
1373 | 1373 | (lambda: doreadbatchcachedfh(), 'read batch w/ reused fd'), |
|
1374 | 1374 | (lambda: dochunk(), 'chunk'), |
|
1375 | 1375 | (lambda: dochunkbatch(), 'chunk batch'), |
|
1376 | 1376 | ] |
|
1377 | 1377 | |
|
1378 | 1378 | for engine in sorted(engines): |
|
1379 | 1379 | compressor = util.compengines[engine].revlogcompressor() |
|
1380 | 1380 | benches.append((functools.partial(docompress, compressor), |
|
1381 | 1381 | 'compress w/ %s' % engine)) |
|
1382 | 1382 | |
|
1383 | 1383 | for fn, title in benches: |
|
1384 | 1384 | timer, fm = gettimer(ui, opts) |
|
1385 | 1385 | timer(fn, title=title) |
|
1386 | 1386 | fm.end() |
|
1387 | 1387 | |
|
1388 | 1388 | @command('perfrevlogrevision', revlogopts + formatteropts + |
|
1389 | 1389 | [('', 'cache', False, 'use caches instead of clearing')], |
|
1390 | 1390 | '-c|-m|FILE REV') |
|
1391 | 1391 | def perfrevlogrevision(ui, repo, file_, rev=None, cache=None, **opts): |
|
1392 | 1392 | """Benchmark obtaining a revlog revision. |
|
1393 | 1393 | |
|
1394 | 1394 | Obtaining a revlog revision consists of roughly the following steps: |
|
1395 | 1395 | |
|
1396 | 1396 | 1. Compute the delta chain |
|
1397 | 1397 | 2. Obtain the raw chunks for that delta chain |
|
1398 | 1398 | 3. Decompress each raw chunk |
|
1399 | 1399 | 4. Apply binary patches to obtain fulltext |
|
1400 | 1400 | 5. Verify hash of fulltext |
|
1401 | 1401 | |
|
1402 | 1402 | This command measures the time spent in each of these phases. |
|
1403 | 1403 | """ |
|
1404 | 1404 | if opts.get('changelog') or opts.get('manifest'): |
|
1405 | 1405 | file_, rev = None, file_ |
|
1406 | 1406 | elif rev is None: |
|
1407 | 1407 | raise error.CommandError('perfrevlogrevision', 'invalid arguments') |
|
1408 | 1408 | |
|
1409 | 1409 | r = cmdutil.openrevlog(repo, 'perfrevlogrevision', file_, opts) |
|
1410 | 1410 | |
|
1411 | 1411 | # _chunkraw was renamed to _getsegmentforrevs. |
|
1412 | 1412 | try: |
|
1413 | 1413 | segmentforrevs = r._getsegmentforrevs |
|
1414 | 1414 | except AttributeError: |
|
1415 | 1415 | segmentforrevs = r._chunkraw |
|
1416 | 1416 | |
|
1417 | 1417 | node = r.lookup(rev) |
|
1418 | 1418 | rev = r.rev(node) |
|
1419 | 1419 | |
|
1420 | 1420 | def getrawchunks(data, chain): |
|
1421 | 1421 | start = r.start |
|
1422 | 1422 | length = r.length |
|
1423 | 1423 | inline = r._inline |
|
1424 | 1424 | iosize = r._io.size |
|
1425 | 1425 | buffer = util.buffer |
|
1426 | 1426 | offset = start(chain[0]) |
|
1427 | 1427 | |
|
1428 | 1428 | chunks = [] |
|
1429 | 1429 | ladd = chunks.append |
|
1430 | 1430 | |
|
1431 | 1431 | for rev in chain: |
|
1432 | 1432 | chunkstart = start(rev) |
|
1433 | 1433 | if inline: |
|
1434 | 1434 | chunkstart += (rev + 1) * iosize |
|
1435 | 1435 | chunklength = length(rev) |
|
1436 | 1436 | ladd(buffer(data, chunkstart - offset, chunklength)) |
|
1437 | 1437 | |
|
1438 | 1438 | return chunks |
|
1439 | 1439 | |
|
1440 | 1440 | def dodeltachain(rev): |
|
1441 | 1441 | if not cache: |
|
1442 | 1442 | r.clearcaches() |
|
1443 | 1443 | r._deltachain(rev) |
|
1444 | 1444 | |
|
1445 | 1445 | def doread(chain): |
|
1446 | 1446 | if not cache: |
|
1447 | 1447 | r.clearcaches() |
|
1448 | 1448 | segmentforrevs(chain[0], chain[-1]) |
|
1449 | 1449 | |
|
1450 | 1450 | def dorawchunks(data, chain): |
|
1451 | 1451 | if not cache: |
|
1452 | 1452 | r.clearcaches() |
|
1453 | 1453 | getrawchunks(data, chain) |
|
1454 | 1454 | |
|
1455 | 1455 | def dodecompress(chunks): |
|
1456 | 1456 | decomp = r.decompress |
|
1457 | 1457 | for chunk in chunks: |
|
1458 | 1458 | decomp(chunk) |
|
1459 | 1459 | |
|
1460 | 1460 | def dopatch(text, bins): |
|
1461 | 1461 | if not cache: |
|
1462 | 1462 | r.clearcaches() |
|
1463 | 1463 | mdiff.patches(text, bins) |
|
1464 | 1464 | |
|
1465 | 1465 | def dohash(text): |
|
1466 | 1466 | if not cache: |
|
1467 | 1467 | r.clearcaches() |
|
1468 | 1468 | r.checkhash(text, node, rev=rev) |
|
1469 | 1469 | |
|
1470 | 1470 | def dorevision(): |
|
1471 | 1471 | if not cache: |
|
1472 | 1472 | r.clearcaches() |
|
1473 | 1473 | r.revision(node) |
|
1474 | 1474 | |
|
1475 | 1475 | chain = r._deltachain(rev)[0] |
|
1476 | 1476 | data = segmentforrevs(chain[0], chain[-1])[1] |
|
1477 | 1477 | rawchunks = getrawchunks(data, chain) |
|
1478 | 1478 | bins = r._chunks(chain) |
|
1479 | 1479 | text = str(bins[0]) |
|
1480 | 1480 | bins = bins[1:] |
|
1481 | 1481 | text = mdiff.patches(text, bins) |
|
1482 | 1482 | |
|
1483 | 1483 | benches = [ |
|
1484 | 1484 | (lambda: dorevision(), 'full'), |
|
1485 | 1485 | (lambda: dodeltachain(rev), 'deltachain'), |
|
1486 | 1486 | (lambda: doread(chain), 'read'), |
|
1487 | 1487 | (lambda: dorawchunks(data, chain), 'rawchunks'), |
|
1488 | 1488 | (lambda: dodecompress(rawchunks), 'decompress'), |
|
1489 | 1489 | (lambda: dopatch(text, bins), 'patch'), |
|
1490 | 1490 | (lambda: dohash(text), 'hash'), |
|
1491 | 1491 | ] |
|
1492 | 1492 | |
|
1493 | 1493 | for fn, title in benches: |
|
1494 | 1494 | timer, fm = gettimer(ui, opts) |
|
1495 | 1495 | timer(fn, title=title) |
|
1496 | 1496 | fm.end() |
|
1497 | 1497 | |
|
1498 | 1498 | @command('perfrevset', |
|
1499 | 1499 | [('C', 'clear', False, 'clear volatile cache between each call.'), |
|
1500 | 1500 | ('', 'contexts', False, 'obtain changectx for each revision')] |
|
1501 | 1501 | + formatteropts, "REVSET") |
|
1502 | 1502 | def perfrevset(ui, repo, expr, clear=False, contexts=False, **opts): |
|
1503 | 1503 | """benchmark the execution time of a revset |
|
1504 | 1504 | |
|
1505 | 1505 | Use the --clean option if need to evaluate the impact of build volatile |
|
1506 | 1506 | revisions set cache on the revset execution. Volatile cache hold filtered |
|
1507 | 1507 | and obsolete related cache.""" |
|
1508 | 1508 | timer, fm = gettimer(ui, opts) |
|
1509 | 1509 | def d(): |
|
1510 | 1510 | if clear: |
|
1511 | 1511 | repo.invalidatevolatilesets() |
|
1512 | 1512 | if contexts: |
|
1513 | 1513 | for ctx in repo.set(expr): pass |
|
1514 | 1514 | else: |
|
1515 | 1515 | for r in repo.revs(expr): pass |
|
1516 | 1516 | timer(d) |
|
1517 | 1517 | fm.end() |
|
1518 | 1518 | |
|
1519 | 1519 | @command('perfvolatilesets', |
|
1520 | 1520 | [('', 'clear-obsstore', False, 'drop obsstore between each call.'), |
|
1521 | 1521 | ] + formatteropts) |
|
1522 | 1522 | def perfvolatilesets(ui, repo, *names, **opts): |
|
1523 | 1523 | """benchmark the computation of various volatile set |
|
1524 | 1524 | |
|
1525 | 1525 | Volatile set computes element related to filtering and obsolescence.""" |
|
1526 | 1526 | timer, fm = gettimer(ui, opts) |
|
1527 | 1527 | repo = repo.unfiltered() |
|
1528 | 1528 | |
|
1529 | 1529 | def getobs(name): |
|
1530 | 1530 | def d(): |
|
1531 | 1531 | repo.invalidatevolatilesets() |
|
1532 | 1532 | if opts['clear_obsstore']: |
|
1533 | 1533 | clearfilecache(repo, 'obsstore') |
|
1534 | 1534 | obsolete.getrevs(repo, name) |
|
1535 | 1535 | return d |
|
1536 | 1536 | |
|
1537 | 1537 | allobs = sorted(obsolete.cachefuncs) |
|
1538 | 1538 | if names: |
|
1539 | 1539 | allobs = [n for n in allobs if n in names] |
|
1540 | 1540 | |
|
1541 | 1541 | for name in allobs: |
|
1542 | 1542 | timer(getobs(name), title=name) |
|
1543 | 1543 | |
|
1544 | 1544 | def getfiltered(name): |
|
1545 | 1545 | def d(): |
|
1546 | 1546 | repo.invalidatevolatilesets() |
|
1547 | 1547 | if opts['clear_obsstore']: |
|
1548 | 1548 | clearfilecache(repo, 'obsstore') |
|
1549 | 1549 | repoview.filterrevs(repo, name) |
|
1550 | 1550 | return d |
|
1551 | 1551 | |
|
1552 | 1552 | allfilter = sorted(repoview.filtertable) |
|
1553 | 1553 | if names: |
|
1554 | 1554 | allfilter = [n for n in allfilter if n in names] |
|
1555 | 1555 | |
|
1556 | 1556 | for name in allfilter: |
|
1557 | 1557 | timer(getfiltered(name), title=name) |
|
1558 | 1558 | fm.end() |
|
1559 | 1559 | |
|
1560 | 1560 | @command('perfbranchmap', |
|
1561 | 1561 | [('f', 'full', False, |
|
1562 | 1562 | 'Includes build time of subset'), |
|
1563 | 1563 | ('', 'clear-revbranch', False, |
|
1564 | 1564 | 'purge the revbranch cache between computation'), |
|
1565 | 1565 | ] + formatteropts) |
|
1566 | 1566 | def perfbranchmap(ui, repo, full=False, clear_revbranch=False, **opts): |
|
1567 | 1567 | """benchmark the update of a branchmap |
|
1568 | 1568 | |
|
1569 | 1569 | This benchmarks the full repo.branchmap() call with read and write disabled |
|
1570 | 1570 | """ |
|
1571 | 1571 | timer, fm = gettimer(ui, opts) |
|
1572 | 1572 | def getbranchmap(filtername): |
|
1573 | 1573 | """generate a benchmark function for the filtername""" |
|
1574 | 1574 | if filtername is None: |
|
1575 | 1575 | view = repo |
|
1576 | 1576 | else: |
|
1577 | 1577 | view = repo.filtered(filtername) |
|
1578 | 1578 | def d(): |
|
1579 | 1579 | if clear_revbranch: |
|
1580 | 1580 | repo.revbranchcache()._clear() |
|
1581 | 1581 | if full: |
|
1582 | 1582 | view._branchcaches.clear() |
|
1583 | 1583 | else: |
|
1584 | 1584 | view._branchcaches.pop(filtername, None) |
|
1585 | 1585 | view.branchmap() |
|
1586 | 1586 | return d |
|
1587 | 1587 | # add filter in smaller subset to bigger subset |
|
1588 | 1588 | possiblefilters = set(repoview.filtertable) |
|
1589 | 1589 | subsettable = getbranchmapsubsettable() |
|
1590 | 1590 | allfilters = [] |
|
1591 | 1591 | while possiblefilters: |
|
1592 | 1592 | for name in possiblefilters: |
|
1593 | 1593 | subset = subsettable.get(name) |
|
1594 | 1594 | if subset not in possiblefilters: |
|
1595 | 1595 | break |
|
1596 | 1596 | else: |
|
1597 | 1597 | assert False, 'subset cycle %s!' % possiblefilters |
|
1598 | 1598 | allfilters.append(name) |
|
1599 | 1599 | possiblefilters.remove(name) |
|
1600 | 1600 | |
|
1601 | 1601 | # warm the cache |
|
1602 | 1602 | if not full: |
|
1603 | 1603 | for name in allfilters: |
|
1604 | 1604 | repo.filtered(name).branchmap() |
|
1605 | 1605 | # add unfiltered |
|
1606 | 1606 | allfilters.append(None) |
|
1607 | 1607 | |
|
1608 | 1608 | branchcacheread = safeattrsetter(branchmap, 'read') |
|
1609 | 1609 | branchcachewrite = safeattrsetter(branchmap.branchcache, 'write') |
|
1610 | 1610 | branchcacheread.set(lambda repo: None) |
|
1611 | 1611 | branchcachewrite.set(lambda bc, repo: None) |
|
1612 | 1612 | try: |
|
1613 | 1613 | for name in allfilters: |
|
1614 | 1614 | timer(getbranchmap(name), title=str(name)) |
|
1615 | 1615 | finally: |
|
1616 | 1616 | branchcacheread.restore() |
|
1617 | 1617 | branchcachewrite.restore() |
|
1618 | 1618 | fm.end() |
|
1619 | 1619 | |
|
1620 | 1620 | @command('perfloadmarkers') |
|
1621 | 1621 | def perfloadmarkers(ui, repo): |
|
1622 | 1622 | """benchmark the time to parse the on-disk markers for a repo |
|
1623 | 1623 | |
|
1624 | 1624 | Result is the number of markers in the repo.""" |
|
1625 | 1625 | timer, fm = gettimer(ui) |
|
1626 | 1626 | svfs = getsvfs(repo) |
|
1627 | 1627 | timer(lambda: len(obsolete.obsstore(svfs))) |
|
1628 | 1628 | fm.end() |
|
1629 | 1629 | |
|
1630 | 1630 | @command('perflrucachedict', formatteropts + |
|
1631 | 1631 | [('', 'size', 4, 'size of cache'), |
|
1632 | 1632 | ('', 'gets', 10000, 'number of key lookups'), |
|
1633 | 1633 | ('', 'sets', 10000, 'number of key sets'), |
|
1634 | 1634 | ('', 'mixed', 10000, 'number of mixed mode operations'), |
|
1635 | 1635 | ('', 'mixedgetfreq', 50, 'frequency of get vs set ops in mixed mode')], |
|
1636 | 1636 | norepo=True) |
|
1637 | 1637 | def perflrucache(ui, size=4, gets=10000, sets=10000, mixed=10000, |
|
1638 | 1638 | mixedgetfreq=50, **opts): |
|
1639 | 1639 | def doinit(): |
|
1640 | 1640 | for i in xrange(10000): |
|
1641 | 1641 | util.lrucachedict(size) |
|
1642 | 1642 | |
|
1643 | 1643 | values = [] |
|
1644 | 1644 | for i in xrange(size): |
|
1645 | 1645 | values.append(random.randint(0, sys.maxint)) |
|
1646 | 1646 | |
|
1647 | 1647 | # Get mode fills the cache and tests raw lookup performance with no |
|
1648 | 1648 | # eviction. |
|
1649 | 1649 | getseq = [] |
|
1650 | 1650 | for i in xrange(gets): |
|
1651 | 1651 | getseq.append(random.choice(values)) |
|
1652 | 1652 | |
|
1653 | 1653 | def dogets(): |
|
1654 | 1654 | d = util.lrucachedict(size) |
|
1655 | 1655 | for v in values: |
|
1656 | 1656 | d[v] = v |
|
1657 | 1657 | for key in getseq: |
|
1658 | 1658 | value = d[key] |
|
1659 | 1659 | value # silence pyflakes warning |
|
1660 | 1660 | |
|
1661 | 1661 | # Set mode tests insertion speed with cache eviction. |
|
1662 | 1662 | setseq = [] |
|
1663 | 1663 | for i in xrange(sets): |
|
1664 | 1664 | setseq.append(random.randint(0, sys.maxint)) |
|
1665 | 1665 | |
|
1666 | 1666 | def dosets(): |
|
1667 | 1667 | d = util.lrucachedict(size) |
|
1668 | 1668 | for v in setseq: |
|
1669 | 1669 | d[v] = v |
|
1670 | 1670 | |
|
1671 | 1671 | # Mixed mode randomly performs gets and sets with eviction. |
|
1672 | 1672 | mixedops = [] |
|
1673 | 1673 | for i in xrange(mixed): |
|
1674 | 1674 | r = random.randint(0, 100) |
|
1675 | 1675 | if r < mixedgetfreq: |
|
1676 | 1676 | op = 0 |
|
1677 | 1677 | else: |
|
1678 | 1678 | op = 1 |
|
1679 | 1679 | |
|
1680 | 1680 | mixedops.append((op, random.randint(0, size * 2))) |
|
1681 | 1681 | |
|
1682 | 1682 | def domixed(): |
|
1683 | 1683 | d = util.lrucachedict(size) |
|
1684 | 1684 | |
|
1685 | 1685 | for op, v in mixedops: |
|
1686 | 1686 | if op == 0: |
|
1687 | 1687 | try: |
|
1688 | 1688 | d[v] |
|
1689 | 1689 | except KeyError: |
|
1690 | 1690 | pass |
|
1691 | 1691 | else: |
|
1692 | 1692 | d[v] = v |
|
1693 | 1693 | |
|
1694 | 1694 | benches = [ |
|
1695 | 1695 | (doinit, 'init'), |
|
1696 | 1696 | (dogets, 'gets'), |
|
1697 | 1697 | (dosets, 'sets'), |
|
1698 | 1698 | (domixed, 'mixed') |
|
1699 | 1699 | ] |
|
1700 | 1700 | |
|
1701 | 1701 | for fn, title in benches: |
|
1702 | 1702 | timer, fm = gettimer(ui, opts) |
|
1703 | 1703 | timer(fn, title=title) |
|
1704 | 1704 | fm.end() |
|
1705 | 1705 | |
|
1706 | 1706 | @command('perfwrite', formatteropts) |
|
1707 | 1707 | def perfwrite(ui, repo, **opts): |
|
1708 | 1708 | """microbenchmark ui.write |
|
1709 | 1709 | """ |
|
1710 | 1710 | timer, fm = gettimer(ui, opts) |
|
1711 | 1711 | def write(): |
|
1712 | 1712 | for i in range(100000): |
|
1713 | 1713 | ui.write(('Testing write performance\n')) |
|
1714 | 1714 | timer(write) |
|
1715 | 1715 | fm.end() |
|
1716 | 1716 | |
|
1717 | 1717 | def uisetup(ui): |
|
1718 | 1718 | if (util.safehasattr(cmdutil, 'openrevlog') and |
|
1719 | 1719 | not util.safehasattr(commands, 'debugrevlogopts')): |
|
1720 | 1720 | # for "historical portability": |
|
1721 | 1721 | # In this case, Mercurial should be 1.9 (or a79fea6b3e77) - |
|
1722 | 1722 | # 3.7 (or 5606f7d0d063). Therefore, '--dir' option for |
|
1723 | 1723 | # openrevlog() should cause failure, because it has been |
|
1724 | 1724 | # available since 3.5 (or 49c583ca48c4). |
|
1725 | 1725 | def openrevlog(orig, repo, cmd, file_, opts): |
|
1726 | 1726 | if opts.get('dir') and not util.safehasattr(repo, 'dirlog'): |
|
1727 | 1727 | raise error.Abort("This version doesn't support --dir option", |
|
1728 | 1728 | hint="use 3.5 or later") |
|
1729 | 1729 | return orig(repo, cmd, file_, opts) |
|
1730 | 1730 | extensions.wrapfunction(cmdutil, 'openrevlog', openrevlog) |
@@ -1,522 +1,521 b'' | |||
|
1 | 1 | # mdiff.py - diff and patch routines for mercurial |
|
2 | 2 | # |
|
3 | 3 | # Copyright 2005, 2006 Matt Mackall <mpm@selenic.com> |
|
4 | 4 | # |
|
5 | 5 | # This software may be used and distributed according to the terms of the |
|
6 | 6 | # GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | from __future__ import absolute_import |
|
9 | 9 | |
|
10 | 10 | import re |
|
11 | 11 | import struct |
|
12 | 12 | import zlib |
|
13 | 13 | |
|
14 | 14 | from .i18n import _ |
|
15 | 15 | from . import ( |
|
16 | 16 | error, |
|
17 | 17 | policy, |
|
18 | 18 | pycompat, |
|
19 | 19 | util, |
|
20 | 20 | ) |
|
21 | 21 | |
|
22 | 22 | _missing_newline_marker = "\\ No newline at end of file\n" |
|
23 | 23 | |
|
24 | 24 | bdiff = policy.importmod(r'bdiff') |
|
25 | 25 | mpatch = policy.importmod(r'mpatch') |
|
26 | 26 | |
|
27 | 27 | blocks = bdiff.blocks |
|
28 | 28 | fixws = bdiff.fixws |
|
29 | 29 | patches = mpatch.patches |
|
30 | 30 | patchedsize = mpatch.patchedsize |
|
31 | 31 | textdiff = bdiff.bdiff |
|
32 | 32 | |
|
33 | 33 | def splitnewlines(text): |
|
34 | 34 | '''like str.splitlines, but only split on newlines.''' |
|
35 | 35 | lines = [l + '\n' for l in text.split('\n')] |
|
36 | 36 | if lines: |
|
37 | 37 | if lines[-1] == '\n': |
|
38 | 38 | lines.pop() |
|
39 | 39 | else: |
|
40 | 40 | lines[-1] = lines[-1][:-1] |
|
41 | 41 | return lines |
|
42 | 42 | |
|
43 | 43 | class diffopts(object): |
|
44 | 44 | '''context is the number of context lines |
|
45 | 45 | text treats all files as text |
|
46 | 46 | showfunc enables diff -p output |
|
47 | 47 | git enables the git extended patch format |
|
48 | 48 | nodates removes dates from diff headers |
|
49 | 49 | nobinary ignores binary files |
|
50 | 50 | noprefix disables the 'a/' and 'b/' prefixes (ignored in plain mode) |
|
51 | 51 | ignorews ignores all whitespace changes in the diff |
|
52 | 52 | ignorewsamount ignores changes in the amount of whitespace |
|
53 | 53 | ignoreblanklines ignores changes whose lines are all blank |
|
54 | 54 | upgrade generates git diffs to avoid data loss |
|
55 | 55 | ''' |
|
56 | 56 | |
|
57 | 57 | defaults = { |
|
58 | 58 | 'context': 3, |
|
59 | 59 | 'text': False, |
|
60 | 60 | 'showfunc': False, |
|
61 | 61 | 'git': False, |
|
62 | 62 | 'nodates': False, |
|
63 | 63 | 'nobinary': False, |
|
64 | 64 | 'noprefix': False, |
|
65 | 65 | 'index': 0, |
|
66 | 66 | 'ignorews': False, |
|
67 | 67 | 'ignorewsamount': False, |
|
68 | 68 | 'ignorewseol': False, |
|
69 | 69 | 'ignoreblanklines': False, |
|
70 | 70 | 'upgrade': False, |
|
71 | 71 | 'showsimilarity': False, |
|
72 | 72 | 'worddiff': False, |
|
73 | 73 | } |
|
74 | 74 | |
|
75 | 75 | def __init__(self, **opts): |
|
76 | 76 | opts = pycompat.byteskwargs(opts) |
|
77 | 77 | for k in self.defaults.keys(): |
|
78 | 78 | v = opts.get(k) |
|
79 | 79 | if v is None: |
|
80 | 80 | v = self.defaults[k] |
|
81 | 81 | setattr(self, k, v) |
|
82 | 82 | |
|
83 | 83 | try: |
|
84 | 84 | self.context = int(self.context) |
|
85 | 85 | except ValueError: |
|
86 | 86 | raise error.Abort(_('diff context lines count must be ' |
|
87 | 87 | 'an integer, not %r') % self.context) |
|
88 | 88 | |
|
89 | 89 | def copy(self, **kwargs): |
|
90 | 90 | opts = dict((k, getattr(self, k)) for k in self.defaults) |
|
91 | 91 | opts = pycompat.strkwargs(opts) |
|
92 | 92 | opts.update(kwargs) |
|
93 | 93 | return diffopts(**opts) |
|
94 | 94 | |
|
95 | 95 | defaultopts = diffopts() |
|
96 | 96 | |
|
97 | 97 | def wsclean(opts, text, blank=True): |
|
98 | 98 | if opts.ignorews: |
|
99 | 99 | text = bdiff.fixws(text, 1) |
|
100 | 100 | elif opts.ignorewsamount: |
|
101 | 101 | text = bdiff.fixws(text, 0) |
|
102 | 102 | if blank and opts.ignoreblanklines: |
|
103 | 103 | text = re.sub('\n+', '\n', text).strip('\n') |
|
104 | 104 | if opts.ignorewseol: |
|
105 | 105 | text = re.sub(br'[ \t\r\f]+\n', r'\n', text) |
|
106 | 106 | return text |
|
107 | 107 | |
|
108 | 108 | def splitblock(base1, lines1, base2, lines2, opts): |
|
109 | 109 | # The input lines matches except for interwoven blank lines. We |
|
110 | 110 | # transform it into a sequence of matching blocks and blank blocks. |
|
111 | 111 | lines1 = [(wsclean(opts, l) and 1 or 0) for l in lines1] |
|
112 | 112 | lines2 = [(wsclean(opts, l) and 1 or 0) for l in lines2] |
|
113 | 113 | s1, e1 = 0, len(lines1) |
|
114 | 114 | s2, e2 = 0, len(lines2) |
|
115 | 115 | while s1 < e1 or s2 < e2: |
|
116 | 116 | i1, i2, btype = s1, s2, '=' |
|
117 | 117 | if (i1 >= e1 or lines1[i1] == 0 |
|
118 | 118 | or i2 >= e2 or lines2[i2] == 0): |
|
119 | 119 | # Consume the block of blank lines |
|
120 | 120 | btype = '~' |
|
121 | 121 | while i1 < e1 and lines1[i1] == 0: |
|
122 | 122 | i1 += 1 |
|
123 | 123 | while i2 < e2 and lines2[i2] == 0: |
|
124 | 124 | i2 += 1 |
|
125 | 125 | else: |
|
126 | 126 | # Consume the matching lines |
|
127 | 127 | while i1 < e1 and lines1[i1] == 1 and lines2[i2] == 1: |
|
128 | 128 | i1 += 1 |
|
129 | 129 | i2 += 1 |
|
130 | 130 | yield [base1 + s1, base1 + i1, base2 + s2, base2 + i2], btype |
|
131 | 131 | s1 = i1 |
|
132 | 132 | s2 = i2 |
|
133 | 133 | |
|
134 | 134 | def hunkinrange(hunk, linerange): |
|
135 | 135 | """Return True if `hunk` defined as (start, length) is in `linerange` |
|
136 | 136 | defined as (lowerbound, upperbound). |
|
137 | 137 | |
|
138 | 138 | >>> hunkinrange((5, 10), (2, 7)) |
|
139 | 139 | True |
|
140 | 140 | >>> hunkinrange((5, 10), (6, 12)) |
|
141 | 141 | True |
|
142 | 142 | >>> hunkinrange((5, 10), (13, 17)) |
|
143 | 143 | True |
|
144 | 144 | >>> hunkinrange((5, 10), (3, 17)) |
|
145 | 145 | True |
|
146 | 146 | >>> hunkinrange((5, 10), (1, 3)) |
|
147 | 147 | False |
|
148 | 148 | >>> hunkinrange((5, 10), (18, 20)) |
|
149 | 149 | False |
|
150 | 150 | >>> hunkinrange((5, 10), (1, 5)) |
|
151 | 151 | False |
|
152 | 152 | >>> hunkinrange((5, 10), (15, 27)) |
|
153 | 153 | False |
|
154 | 154 | """ |
|
155 | 155 | start, length = hunk |
|
156 | 156 | lowerbound, upperbound = linerange |
|
157 | 157 | return lowerbound < start + length and start < upperbound |
|
158 | 158 | |
|
159 | 159 | def blocksinrange(blocks, rangeb): |
|
160 | 160 | """filter `blocks` like (a1, a2, b1, b2) from items outside line range |
|
161 | 161 | `rangeb` from ``(b1, b2)`` point of view. |
|
162 | 162 | |
|
163 | 163 | Return `filteredblocks, rangea` where: |
|
164 | 164 | |
|
165 | 165 | * `filteredblocks` is list of ``block = (a1, a2, b1, b2), stype`` items of |
|
166 | 166 | `blocks` that are inside `rangeb` from ``(b1, b2)`` point of view; a |
|
167 | 167 | block ``(b1, b2)`` being inside `rangeb` if |
|
168 | 168 | ``rangeb[0] < b2 and b1 < rangeb[1]``; |
|
169 | 169 | * `rangea` is the line range w.r.t. to ``(a1, a2)`` parts of `blocks`. |
|
170 | 170 | """ |
|
171 | 171 | lbb, ubb = rangeb |
|
172 | 172 | lba, uba = None, None |
|
173 | 173 | filteredblocks = [] |
|
174 | 174 | for block in blocks: |
|
175 | 175 | (a1, a2, b1, b2), stype = block |
|
176 | 176 | if lbb >= b1 and ubb <= b2 and stype == '=': |
|
177 | 177 | # rangeb is within a single "=" hunk, restrict back linerange1 |
|
178 | 178 | # by offsetting rangeb |
|
179 | 179 | lba = lbb - b1 + a1 |
|
180 | 180 | uba = ubb - b1 + a1 |
|
181 | 181 | else: |
|
182 | 182 | if b1 <= lbb < b2: |
|
183 | 183 | if stype == '=': |
|
184 | 184 | lba = a2 - (b2 - lbb) |
|
185 | 185 | else: |
|
186 | 186 | lba = a1 |
|
187 | 187 | if b1 < ubb <= b2: |
|
188 | 188 | if stype == '=': |
|
189 | 189 | uba = a1 + (ubb - b1) |
|
190 | 190 | else: |
|
191 | 191 | uba = a2 |
|
192 | 192 | if hunkinrange((b1, (b2 - b1)), rangeb): |
|
193 | 193 | filteredblocks.append(block) |
|
194 | 194 | if lba is None or uba is None or uba < lba: |
|
195 | 195 | raise error.Abort(_('line range exceeds file size')) |
|
196 | 196 | return filteredblocks, (lba, uba) |
|
197 | 197 | |
|
198 | 198 | def allblocks(text1, text2, opts=None, lines1=None, lines2=None): |
|
199 | 199 | """Return (block, type) tuples, where block is an mdiff.blocks |
|
200 | 200 | line entry. type is '=' for blocks matching exactly one another |
|
201 | 201 | (bdiff blocks), '!' for non-matching blocks and '~' for blocks |
|
202 | 202 | matching only after having filtered blank lines. |
|
203 | 203 | line1 and line2 are text1 and text2 split with splitnewlines() if |
|
204 | 204 | they are already available. |
|
205 | 205 | """ |
|
206 | 206 | if opts is None: |
|
207 | 207 | opts = defaultopts |
|
208 | 208 | if opts.ignorews or opts.ignorewsamount or opts.ignorewseol: |
|
209 | 209 | text1 = wsclean(opts, text1, False) |
|
210 | 210 | text2 = wsclean(opts, text2, False) |
|
211 | 211 | diff = bdiff.blocks(text1, text2) |
|
212 | 212 | for i, s1 in enumerate(diff): |
|
213 | 213 | # The first match is special. |
|
214 | 214 | # we've either found a match starting at line 0 or a match later |
|
215 | 215 | # in the file. If it starts later, old and new below will both be |
|
216 | 216 | # empty and we'll continue to the next match. |
|
217 | 217 | if i > 0: |
|
218 | 218 | s = diff[i - 1] |
|
219 | 219 | else: |
|
220 | 220 | s = [0, 0, 0, 0] |
|
221 | 221 | s = [s[1], s1[0], s[3], s1[2]] |
|
222 | 222 | |
|
223 | 223 | # bdiff sometimes gives huge matches past eof, this check eats them, |
|
224 | 224 | # and deals with the special first match case described above |
|
225 | 225 | if s[0] != s[1] or s[2] != s[3]: |
|
226 | 226 | type = '!' |
|
227 | 227 | if opts.ignoreblanklines: |
|
228 | 228 | if lines1 is None: |
|
229 | 229 | lines1 = splitnewlines(text1) |
|
230 | 230 | if lines2 is None: |
|
231 | 231 | lines2 = splitnewlines(text2) |
|
232 | 232 | old = wsclean(opts, "".join(lines1[s[0]:s[1]])) |
|
233 | 233 | new = wsclean(opts, "".join(lines2[s[2]:s[3]])) |
|
234 | 234 | if old == new: |
|
235 | 235 | type = '~' |
|
236 | 236 | yield s, type |
|
237 | 237 | yield s1, '=' |
|
238 | 238 | |
|
239 |
def unidiff(a, ad, b, bd, fn1, fn2, opts=defaultopts |
|
|
239 | def unidiff(a, ad, b, bd, fn1, fn2, binary, opts=defaultopts): | |
|
240 | 240 | """Return a unified diff as a (headers, hunks) tuple. |
|
241 | 241 | |
|
242 | 242 | If the diff is not null, `headers` is a list with unified diff header |
|
243 | 243 | lines "--- <original>" and "+++ <new>" and `hunks` is a generator yielding |
|
244 | 244 | (hunkrange, hunklines) coming from _unidiff(). |
|
245 | 245 | Otherwise, `headers` and `hunks` are empty. |
|
246 | 246 | |
|
247 | Setting `check_binary` to false will skip the binary check, i.e. when | |
|
248 | it has been done in advance. Files are expected to be text in this case. | |
|
247 | Set binary=True if either a or b should be taken as a binary file. | |
|
249 | 248 | """ |
|
250 | 249 | def datetag(date, fn=None): |
|
251 | 250 | if not opts.git and not opts.nodates: |
|
252 | 251 | return '\t%s' % date |
|
253 | 252 | if fn and ' ' in fn: |
|
254 | 253 | return '\t' |
|
255 | 254 | return '' |
|
256 | 255 | |
|
257 | 256 | sentinel = [], () |
|
258 | 257 | if not a and not b: |
|
259 | 258 | return sentinel |
|
260 | 259 | |
|
261 | 260 | if opts.noprefix: |
|
262 | 261 | aprefix = bprefix = '' |
|
263 | 262 | else: |
|
264 | 263 | aprefix = 'a/' |
|
265 | 264 | bprefix = 'b/' |
|
266 | 265 | |
|
267 | 266 | epoch = util.datestr((0, 0)) |
|
268 | 267 | |
|
269 | 268 | fn1 = util.pconvert(fn1) |
|
270 | 269 | fn2 = util.pconvert(fn2) |
|
271 | 270 | |
|
272 | if not opts.text and check_binary and (util.binary(a) or util.binary(b)): | |
|
271 | if binary: | |
|
273 | 272 | if a and b and len(a) == len(b) and a == b: |
|
274 | 273 | return sentinel |
|
275 | 274 | headerlines = [] |
|
276 | 275 | hunks = (None, ['Binary file %s has changed\n' % fn1]), |
|
277 | 276 | elif not a: |
|
278 | 277 | without_newline = b[-1:] != '\n' |
|
279 | 278 | b = splitnewlines(b) |
|
280 | 279 | if a is None: |
|
281 | 280 | l1 = '--- /dev/null%s' % datetag(epoch) |
|
282 | 281 | else: |
|
283 | 282 | l1 = "--- %s%s%s" % (aprefix, fn1, datetag(ad, fn1)) |
|
284 | 283 | l2 = "+++ %s%s" % (bprefix + fn2, datetag(bd, fn2)) |
|
285 | 284 | headerlines = [l1, l2] |
|
286 | 285 | size = len(b) |
|
287 | 286 | hunkrange = (0, 0, 1, size) |
|
288 | 287 | hunklines = ["@@ -0,0 +1,%d @@\n" % size] + ["+" + e for e in b] |
|
289 | 288 | if without_newline: |
|
290 | 289 | hunklines[-1] += '\n' |
|
291 | 290 | hunklines.append(_missing_newline_marker) |
|
292 | 291 | hunks = (hunkrange, hunklines), |
|
293 | 292 | elif not b: |
|
294 | 293 | without_newline = a[-1:] != '\n' |
|
295 | 294 | a = splitnewlines(a) |
|
296 | 295 | l1 = "--- %s%s%s" % (aprefix, fn1, datetag(ad, fn1)) |
|
297 | 296 | if b is None: |
|
298 | 297 | l2 = '+++ /dev/null%s' % datetag(epoch) |
|
299 | 298 | else: |
|
300 | 299 | l2 = "+++ %s%s%s" % (bprefix, fn2, datetag(bd, fn2)) |
|
301 | 300 | headerlines = [l1, l2] |
|
302 | 301 | size = len(a) |
|
303 | 302 | hunkrange = (1, size, 0, 0) |
|
304 | 303 | hunklines = ["@@ -1,%d +0,0 @@\n" % size] + ["-" + e for e in a] |
|
305 | 304 | if without_newline: |
|
306 | 305 | hunklines[-1] += '\n' |
|
307 | 306 | hunklines.append(_missing_newline_marker) |
|
308 | 307 | hunks = (hunkrange, hunklines), |
|
309 | 308 | else: |
|
310 | 309 | hunks = _unidiff(a, b, opts=opts) |
|
311 | 310 | if not next(hunks): |
|
312 | 311 | return sentinel |
|
313 | 312 | |
|
314 | 313 | headerlines = [ |
|
315 | 314 | "--- %s%s%s" % (aprefix, fn1, datetag(ad, fn1)), |
|
316 | 315 | "+++ %s%s%s" % (bprefix, fn2, datetag(bd, fn2)), |
|
317 | 316 | ] |
|
318 | 317 | |
|
319 | 318 | return headerlines, hunks |
|
320 | 319 | |
|
321 | 320 | def _unidiff(t1, t2, opts=defaultopts): |
|
322 | 321 | """Yield hunks of a headerless unified diff from t1 and t2 texts. |
|
323 | 322 | |
|
324 | 323 | Each hunk consists of a (hunkrange, hunklines) tuple where `hunkrange` is a |
|
325 | 324 | tuple (s1, l1, s2, l2) representing the range information of the hunk to |
|
326 | 325 | form the '@@ -s1,l1 +s2,l2 @@' header and `hunklines` is a list of lines |
|
327 | 326 | of the hunk combining said header followed by line additions and |
|
328 | 327 | deletions. |
|
329 | 328 | |
|
330 | 329 | The hunks are prefixed with a bool. |
|
331 | 330 | """ |
|
332 | 331 | l1 = splitnewlines(t1) |
|
333 | 332 | l2 = splitnewlines(t2) |
|
334 | 333 | def contextend(l, len): |
|
335 | 334 | ret = l + opts.context |
|
336 | 335 | if ret > len: |
|
337 | 336 | ret = len |
|
338 | 337 | return ret |
|
339 | 338 | |
|
340 | 339 | def contextstart(l): |
|
341 | 340 | ret = l - opts.context |
|
342 | 341 | if ret < 0: |
|
343 | 342 | return 0 |
|
344 | 343 | return ret |
|
345 | 344 | |
|
346 | 345 | lastfunc = [0, ''] |
|
347 | 346 | def yieldhunk(hunk): |
|
348 | 347 | (astart, a2, bstart, b2, delta) = hunk |
|
349 | 348 | aend = contextend(a2, len(l1)) |
|
350 | 349 | alen = aend - astart |
|
351 | 350 | blen = b2 - bstart + aend - a2 |
|
352 | 351 | |
|
353 | 352 | func = "" |
|
354 | 353 | if opts.showfunc: |
|
355 | 354 | lastpos, func = lastfunc |
|
356 | 355 | # walk backwards from the start of the context up to the start of |
|
357 | 356 | # the previous hunk context until we find a line starting with an |
|
358 | 357 | # alphanumeric char. |
|
359 | 358 | for i in xrange(astart - 1, lastpos - 1, -1): |
|
360 | 359 | if l1[i][0:1].isalnum(): |
|
361 | 360 | func = ' ' + l1[i].rstrip()[:40] |
|
362 | 361 | lastfunc[1] = func |
|
363 | 362 | break |
|
364 | 363 | # by recording this hunk's starting point as the next place to |
|
365 | 364 | # start looking for function lines, we avoid reading any line in |
|
366 | 365 | # the file more than once. |
|
367 | 366 | lastfunc[0] = astart |
|
368 | 367 | |
|
369 | 368 | # zero-length hunk ranges report their start line as one less |
|
370 | 369 | if alen: |
|
371 | 370 | astart += 1 |
|
372 | 371 | if blen: |
|
373 | 372 | bstart += 1 |
|
374 | 373 | |
|
375 | 374 | hunkrange = astart, alen, bstart, blen |
|
376 | 375 | hunklines = ( |
|
377 | 376 | ["@@ -%d,%d +%d,%d @@%s\n" % (hunkrange + (func,))] |
|
378 | 377 | + delta |
|
379 | 378 | + [' ' + l1[x] for x in xrange(a2, aend)] |
|
380 | 379 | ) |
|
381 | 380 | # If either file ends without a newline and the last line of |
|
382 | 381 | # that file is part of a hunk, a marker is printed. If the |
|
383 | 382 | # last line of both files is identical and neither ends in |
|
384 | 383 | # a newline, print only one marker. That's the only case in |
|
385 | 384 | # which the hunk can end in a shared line without a newline. |
|
386 | 385 | skip = False |
|
387 | 386 | if t1[-1:] != '\n' and astart + alen == len(l1) + 1: |
|
388 | 387 | for i in xrange(len(hunklines) - 1, -1, -1): |
|
389 | 388 | if hunklines[i][0:1] in ('-', ' '): |
|
390 | 389 | if hunklines[i][0:1] == ' ': |
|
391 | 390 | skip = True |
|
392 | 391 | hunklines[i] += '\n' |
|
393 | 392 | hunklines.insert(i + 1, _missing_newline_marker) |
|
394 | 393 | break |
|
395 | 394 | if not skip and t2[-1:] != '\n' and bstart + blen == len(l2) + 1: |
|
396 | 395 | for i in xrange(len(hunklines) - 1, -1, -1): |
|
397 | 396 | if hunklines[i][0:1] == '+': |
|
398 | 397 | hunklines[i] += '\n' |
|
399 | 398 | hunklines.insert(i + 1, _missing_newline_marker) |
|
400 | 399 | break |
|
401 | 400 | yield hunkrange, hunklines |
|
402 | 401 | |
|
403 | 402 | # bdiff.blocks gives us the matching sequences in the files. The loop |
|
404 | 403 | # below finds the spaces between those matching sequences and translates |
|
405 | 404 | # them into diff output. |
|
406 | 405 | # |
|
407 | 406 | hunk = None |
|
408 | 407 | ignoredlines = 0 |
|
409 | 408 | has_hunks = False |
|
410 | 409 | for s, stype in allblocks(t1, t2, opts, l1, l2): |
|
411 | 410 | a1, a2, b1, b2 = s |
|
412 | 411 | if stype != '!': |
|
413 | 412 | if stype == '~': |
|
414 | 413 | # The diff context lines are based on t1 content. When |
|
415 | 414 | # blank lines are ignored, the new lines offsets must |
|
416 | 415 | # be adjusted as if equivalent blocks ('~') had the |
|
417 | 416 | # same sizes on both sides. |
|
418 | 417 | ignoredlines += (b2 - b1) - (a2 - a1) |
|
419 | 418 | continue |
|
420 | 419 | delta = [] |
|
421 | 420 | old = l1[a1:a2] |
|
422 | 421 | new = l2[b1:b2] |
|
423 | 422 | |
|
424 | 423 | b1 -= ignoredlines |
|
425 | 424 | b2 -= ignoredlines |
|
426 | 425 | astart = contextstart(a1) |
|
427 | 426 | bstart = contextstart(b1) |
|
428 | 427 | prev = None |
|
429 | 428 | if hunk: |
|
430 | 429 | # join with the previous hunk if it falls inside the context |
|
431 | 430 | if astart < hunk[1] + opts.context + 1: |
|
432 | 431 | prev = hunk |
|
433 | 432 | astart = hunk[1] |
|
434 | 433 | bstart = hunk[3] |
|
435 | 434 | else: |
|
436 | 435 | if not has_hunks: |
|
437 | 436 | has_hunks = True |
|
438 | 437 | yield True |
|
439 | 438 | for x in yieldhunk(hunk): |
|
440 | 439 | yield x |
|
441 | 440 | if prev: |
|
442 | 441 | # we've joined the previous hunk, record the new ending points. |
|
443 | 442 | hunk[1] = a2 |
|
444 | 443 | hunk[3] = b2 |
|
445 | 444 | delta = hunk[4] |
|
446 | 445 | else: |
|
447 | 446 | # create a new hunk |
|
448 | 447 | hunk = [astart, a2, bstart, b2, delta] |
|
449 | 448 | |
|
450 | 449 | delta[len(delta):] = [' ' + x for x in l1[astart:a1]] |
|
451 | 450 | delta[len(delta):] = ['-' + x for x in old] |
|
452 | 451 | delta[len(delta):] = ['+' + x for x in new] |
|
453 | 452 | |
|
454 | 453 | if hunk: |
|
455 | 454 | if not has_hunks: |
|
456 | 455 | has_hunks = True |
|
457 | 456 | yield True |
|
458 | 457 | for x in yieldhunk(hunk): |
|
459 | 458 | yield x |
|
460 | 459 | elif not has_hunks: |
|
461 | 460 | yield False |
|
462 | 461 | |
|
463 | 462 | def b85diff(to, tn): |
|
464 | 463 | '''print base85-encoded binary diff''' |
|
465 | 464 | def fmtline(line): |
|
466 | 465 | l = len(line) |
|
467 | 466 | if l <= 26: |
|
468 | 467 | l = pycompat.bytechr(ord('A') + l - 1) |
|
469 | 468 | else: |
|
470 | 469 | l = pycompat.bytechr(l - 26 + ord('a') - 1) |
|
471 | 470 | return '%c%s\n' % (l, util.b85encode(line, True)) |
|
472 | 471 | |
|
473 | 472 | def chunk(text, csize=52): |
|
474 | 473 | l = len(text) |
|
475 | 474 | i = 0 |
|
476 | 475 | while i < l: |
|
477 | 476 | yield text[i:i + csize] |
|
478 | 477 | i += csize |
|
479 | 478 | |
|
480 | 479 | if to is None: |
|
481 | 480 | to = '' |
|
482 | 481 | if tn is None: |
|
483 | 482 | tn = '' |
|
484 | 483 | |
|
485 | 484 | if to == tn: |
|
486 | 485 | return '' |
|
487 | 486 | |
|
488 | 487 | # TODO: deltas |
|
489 | 488 | ret = [] |
|
490 | 489 | ret.append('GIT binary patch\n') |
|
491 | 490 | ret.append('literal %d\n' % len(tn)) |
|
492 | 491 | for l in chunk(zlib.compress(tn)): |
|
493 | 492 | ret.append(fmtline(l)) |
|
494 | 493 | ret.append('\n') |
|
495 | 494 | |
|
496 | 495 | return ''.join(ret) |
|
497 | 496 | |
|
498 | 497 | def patchtext(bin): |
|
499 | 498 | pos = 0 |
|
500 | 499 | t = [] |
|
501 | 500 | while pos < len(bin): |
|
502 | 501 | p1, p2, l = struct.unpack(">lll", bin[pos:pos + 12]) |
|
503 | 502 | pos += 12 |
|
504 | 503 | t.append(bin[pos:pos + l]) |
|
505 | 504 | pos += l |
|
506 | 505 | return "".join(t) |
|
507 | 506 | |
|
508 | 507 | def patch(a, bin): |
|
509 | 508 | if len(a) == 0: |
|
510 | 509 | # skip over trivial delta header |
|
511 | 510 | return util.buffer(bin, 12) |
|
512 | 511 | return mpatch.patches(a, [bin]) |
|
513 | 512 | |
|
514 | 513 | # similar to difflib.SequenceMatcher.get_matching_blocks |
|
515 | 514 | def get_matching_blocks(a, b): |
|
516 | 515 | return [(d[0], d[2], d[1] - d[0]) for d in bdiff.blocks(a, b)] |
|
517 | 516 | |
|
518 | 517 | def trivialdiffheader(length): |
|
519 | 518 | return struct.pack(">lll", 0, 0, length) if length else '' |
|
520 | 519 | |
|
521 | 520 | def replacediffheader(oldlen, newlen): |
|
522 | 521 | return struct.pack(">lll", 0, oldlen, newlen) |
@@ -1,2907 +1,2904 b'' | |||
|
1 | 1 | # patch.py - patch file parsing routines |
|
2 | 2 | # |
|
3 | 3 | # Copyright 2006 Brendan Cully <brendan@kublai.com> |
|
4 | 4 | # Copyright 2007 Chris Mason <chris.mason@oracle.com> |
|
5 | 5 | # |
|
6 | 6 | # This software may be used and distributed according to the terms of the |
|
7 | 7 | # GNU General Public License version 2 or any later version. |
|
8 | 8 | |
|
9 | 9 | from __future__ import absolute_import, print_function |
|
10 | 10 | |
|
11 | 11 | import collections |
|
12 | 12 | import copy |
|
13 | 13 | import difflib |
|
14 | 14 | import email |
|
15 | 15 | import email.parser as emailparser |
|
16 | 16 | import errno |
|
17 | 17 | import hashlib |
|
18 | 18 | import os |
|
19 | 19 | import posixpath |
|
20 | 20 | import re |
|
21 | 21 | import shutil |
|
22 | 22 | import tempfile |
|
23 | 23 | import zlib |
|
24 | 24 | |
|
25 | 25 | from .i18n import _ |
|
26 | 26 | from .node import ( |
|
27 | 27 | hex, |
|
28 | 28 | short, |
|
29 | 29 | ) |
|
30 | 30 | from . import ( |
|
31 | 31 | copies, |
|
32 | 32 | encoding, |
|
33 | 33 | error, |
|
34 | 34 | mail, |
|
35 | 35 | mdiff, |
|
36 | 36 | pathutil, |
|
37 | 37 | policy, |
|
38 | 38 | pycompat, |
|
39 | 39 | scmutil, |
|
40 | 40 | similar, |
|
41 | 41 | util, |
|
42 | 42 | vfs as vfsmod, |
|
43 | 43 | ) |
|
44 | 44 | |
|
45 | 45 | diffhelpers = policy.importmod(r'diffhelpers') |
|
46 | 46 | stringio = util.stringio |
|
47 | 47 | |
|
48 | 48 | gitre = re.compile(br'diff --git a/(.*) b/(.*)') |
|
49 | 49 | tabsplitter = re.compile(br'(\t+|[^\t]+)') |
|
50 | 50 | _nonwordre = re.compile(br'([^a-zA-Z0-9_\x80-\xff])') |
|
51 | 51 | |
|
52 | 52 | PatchError = error.PatchError |
|
53 | 53 | |
|
54 | 54 | # public functions |
|
55 | 55 | |
|
56 | 56 | def split(stream): |
|
57 | 57 | '''return an iterator of individual patches from a stream''' |
|
58 | 58 | def isheader(line, inheader): |
|
59 | 59 | if inheader and line[0] in (' ', '\t'): |
|
60 | 60 | # continuation |
|
61 | 61 | return True |
|
62 | 62 | if line[0] in (' ', '-', '+'): |
|
63 | 63 | # diff line - don't check for header pattern in there |
|
64 | 64 | return False |
|
65 | 65 | l = line.split(': ', 1) |
|
66 | 66 | return len(l) == 2 and ' ' not in l[0] |
|
67 | 67 | |
|
68 | 68 | def chunk(lines): |
|
69 | 69 | return stringio(''.join(lines)) |
|
70 | 70 | |
|
71 | 71 | def hgsplit(stream, cur): |
|
72 | 72 | inheader = True |
|
73 | 73 | |
|
74 | 74 | for line in stream: |
|
75 | 75 | if not line.strip(): |
|
76 | 76 | inheader = False |
|
77 | 77 | if not inheader and line.startswith('# HG changeset patch'): |
|
78 | 78 | yield chunk(cur) |
|
79 | 79 | cur = [] |
|
80 | 80 | inheader = True |
|
81 | 81 | |
|
82 | 82 | cur.append(line) |
|
83 | 83 | |
|
84 | 84 | if cur: |
|
85 | 85 | yield chunk(cur) |
|
86 | 86 | |
|
87 | 87 | def mboxsplit(stream, cur): |
|
88 | 88 | for line in stream: |
|
89 | 89 | if line.startswith('From '): |
|
90 | 90 | for c in split(chunk(cur[1:])): |
|
91 | 91 | yield c |
|
92 | 92 | cur = [] |
|
93 | 93 | |
|
94 | 94 | cur.append(line) |
|
95 | 95 | |
|
96 | 96 | if cur: |
|
97 | 97 | for c in split(chunk(cur[1:])): |
|
98 | 98 | yield c |
|
99 | 99 | |
|
100 | 100 | def mimesplit(stream, cur): |
|
101 | 101 | def msgfp(m): |
|
102 | 102 | fp = stringio() |
|
103 | 103 | g = email.Generator.Generator(fp, mangle_from_=False) |
|
104 | 104 | g.flatten(m) |
|
105 | 105 | fp.seek(0) |
|
106 | 106 | return fp |
|
107 | 107 | |
|
108 | 108 | for line in stream: |
|
109 | 109 | cur.append(line) |
|
110 | 110 | c = chunk(cur) |
|
111 | 111 | |
|
112 | 112 | m = emailparser.Parser().parse(c) |
|
113 | 113 | if not m.is_multipart(): |
|
114 | 114 | yield msgfp(m) |
|
115 | 115 | else: |
|
116 | 116 | ok_types = ('text/plain', 'text/x-diff', 'text/x-patch') |
|
117 | 117 | for part in m.walk(): |
|
118 | 118 | ct = part.get_content_type() |
|
119 | 119 | if ct not in ok_types: |
|
120 | 120 | continue |
|
121 | 121 | yield msgfp(part) |
|
122 | 122 | |
|
123 | 123 | def headersplit(stream, cur): |
|
124 | 124 | inheader = False |
|
125 | 125 | |
|
126 | 126 | for line in stream: |
|
127 | 127 | if not inheader and isheader(line, inheader): |
|
128 | 128 | yield chunk(cur) |
|
129 | 129 | cur = [] |
|
130 | 130 | inheader = True |
|
131 | 131 | if inheader and not isheader(line, inheader): |
|
132 | 132 | inheader = False |
|
133 | 133 | |
|
134 | 134 | cur.append(line) |
|
135 | 135 | |
|
136 | 136 | if cur: |
|
137 | 137 | yield chunk(cur) |
|
138 | 138 | |
|
139 | 139 | def remainder(cur): |
|
140 | 140 | yield chunk(cur) |
|
141 | 141 | |
|
142 | 142 | class fiter(object): |
|
143 | 143 | def __init__(self, fp): |
|
144 | 144 | self.fp = fp |
|
145 | 145 | |
|
146 | 146 | def __iter__(self): |
|
147 | 147 | return self |
|
148 | 148 | |
|
149 | 149 | def next(self): |
|
150 | 150 | l = self.fp.readline() |
|
151 | 151 | if not l: |
|
152 | 152 | raise StopIteration |
|
153 | 153 | return l |
|
154 | 154 | |
|
155 | 155 | __next__ = next |
|
156 | 156 | |
|
157 | 157 | inheader = False |
|
158 | 158 | cur = [] |
|
159 | 159 | |
|
160 | 160 | mimeheaders = ['content-type'] |
|
161 | 161 | |
|
162 | 162 | if not util.safehasattr(stream, 'next'): |
|
163 | 163 | # http responses, for example, have readline but not next |
|
164 | 164 | stream = fiter(stream) |
|
165 | 165 | |
|
166 | 166 | for line in stream: |
|
167 | 167 | cur.append(line) |
|
168 | 168 | if line.startswith('# HG changeset patch'): |
|
169 | 169 | return hgsplit(stream, cur) |
|
170 | 170 | elif line.startswith('From '): |
|
171 | 171 | return mboxsplit(stream, cur) |
|
172 | 172 | elif isheader(line, inheader): |
|
173 | 173 | inheader = True |
|
174 | 174 | if line.split(':', 1)[0].lower() in mimeheaders: |
|
175 | 175 | # let email parser handle this |
|
176 | 176 | return mimesplit(stream, cur) |
|
177 | 177 | elif line.startswith('--- ') and inheader: |
|
178 | 178 | # No evil headers seen by diff start, split by hand |
|
179 | 179 | return headersplit(stream, cur) |
|
180 | 180 | # Not enough info, keep reading |
|
181 | 181 | |
|
182 | 182 | # if we are here, we have a very plain patch |
|
183 | 183 | return remainder(cur) |
|
184 | 184 | |
|
185 | 185 | ## Some facility for extensible patch parsing: |
|
186 | 186 | # list of pairs ("header to match", "data key") |
|
187 | 187 | patchheadermap = [('Date', 'date'), |
|
188 | 188 | ('Branch', 'branch'), |
|
189 | 189 | ('Node ID', 'nodeid'), |
|
190 | 190 | ] |
|
191 | 191 | |
|
192 | 192 | def extract(ui, fileobj): |
|
193 | 193 | '''extract patch from data read from fileobj. |
|
194 | 194 | |
|
195 | 195 | patch can be a normal patch or contained in an email message. |
|
196 | 196 | |
|
197 | 197 | return a dictionary. Standard keys are: |
|
198 | 198 | - filename, |
|
199 | 199 | - message, |
|
200 | 200 | - user, |
|
201 | 201 | - date, |
|
202 | 202 | - branch, |
|
203 | 203 | - node, |
|
204 | 204 | - p1, |
|
205 | 205 | - p2. |
|
206 | 206 | Any item can be missing from the dictionary. If filename is missing, |
|
207 | 207 | fileobj did not contain a patch. Caller must unlink filename when done.''' |
|
208 | 208 | |
|
209 | 209 | # attempt to detect the start of a patch |
|
210 | 210 | # (this heuristic is borrowed from quilt) |
|
211 | 211 | diffre = re.compile(br'^(?:Index:[ \t]|diff[ \t]-|RCS file: |' |
|
212 | 212 | br'retrieving revision [0-9]+(\.[0-9]+)*$|' |
|
213 | 213 | br'---[ \t].*?^\+\+\+[ \t]|' |
|
214 | 214 | br'\*\*\*[ \t].*?^---[ \t])', |
|
215 | 215 | re.MULTILINE | re.DOTALL) |
|
216 | 216 | |
|
217 | 217 | data = {} |
|
218 | 218 | fd, tmpname = tempfile.mkstemp(prefix='hg-patch-') |
|
219 | 219 | tmpfp = os.fdopen(fd, pycompat.sysstr('w')) |
|
220 | 220 | try: |
|
221 | 221 | msg = emailparser.Parser().parse(fileobj) |
|
222 | 222 | |
|
223 | 223 | subject = msg['Subject'] and mail.headdecode(msg['Subject']) |
|
224 | 224 | data['user'] = msg['From'] and mail.headdecode(msg['From']) |
|
225 | 225 | if not subject and not data['user']: |
|
226 | 226 | # Not an email, restore parsed headers if any |
|
227 | 227 | subject = '\n'.join(': '.join(h) for h in msg.items()) + '\n' |
|
228 | 228 | |
|
229 | 229 | # should try to parse msg['Date'] |
|
230 | 230 | parents = [] |
|
231 | 231 | |
|
232 | 232 | if subject: |
|
233 | 233 | if subject.startswith('[PATCH'): |
|
234 | 234 | pend = subject.find(']') |
|
235 | 235 | if pend >= 0: |
|
236 | 236 | subject = subject[pend + 1:].lstrip() |
|
237 | 237 | subject = re.sub(br'\n[ \t]+', ' ', subject) |
|
238 | 238 | ui.debug('Subject: %s\n' % subject) |
|
239 | 239 | if data['user']: |
|
240 | 240 | ui.debug('From: %s\n' % data['user']) |
|
241 | 241 | diffs_seen = 0 |
|
242 | 242 | ok_types = ('text/plain', 'text/x-diff', 'text/x-patch') |
|
243 | 243 | message = '' |
|
244 | 244 | for part in msg.walk(): |
|
245 | 245 | content_type = part.get_content_type() |
|
246 | 246 | ui.debug('Content-Type: %s\n' % content_type) |
|
247 | 247 | if content_type not in ok_types: |
|
248 | 248 | continue |
|
249 | 249 | payload = part.get_payload(decode=True) |
|
250 | 250 | m = diffre.search(payload) |
|
251 | 251 | if m: |
|
252 | 252 | hgpatch = False |
|
253 | 253 | hgpatchheader = False |
|
254 | 254 | ignoretext = False |
|
255 | 255 | |
|
256 | 256 | ui.debug('found patch at byte %d\n' % m.start(0)) |
|
257 | 257 | diffs_seen += 1 |
|
258 | 258 | cfp = stringio() |
|
259 | 259 | for line in payload[:m.start(0)].splitlines(): |
|
260 | 260 | if line.startswith('# HG changeset patch') and not hgpatch: |
|
261 | 261 | ui.debug('patch generated by hg export\n') |
|
262 | 262 | hgpatch = True |
|
263 | 263 | hgpatchheader = True |
|
264 | 264 | # drop earlier commit message content |
|
265 | 265 | cfp.seek(0) |
|
266 | 266 | cfp.truncate() |
|
267 | 267 | subject = None |
|
268 | 268 | elif hgpatchheader: |
|
269 | 269 | if line.startswith('# User '): |
|
270 | 270 | data['user'] = line[7:] |
|
271 | 271 | ui.debug('From: %s\n' % data['user']) |
|
272 | 272 | elif line.startswith("# Parent "): |
|
273 | 273 | parents.append(line[9:].lstrip()) |
|
274 | 274 | elif line.startswith("# "): |
|
275 | 275 | for header, key in patchheadermap: |
|
276 | 276 | prefix = '# %s ' % header |
|
277 | 277 | if line.startswith(prefix): |
|
278 | 278 | data[key] = line[len(prefix):] |
|
279 | 279 | else: |
|
280 | 280 | hgpatchheader = False |
|
281 | 281 | elif line == '---': |
|
282 | 282 | ignoretext = True |
|
283 | 283 | if not hgpatchheader and not ignoretext: |
|
284 | 284 | cfp.write(line) |
|
285 | 285 | cfp.write('\n') |
|
286 | 286 | message = cfp.getvalue() |
|
287 | 287 | if tmpfp: |
|
288 | 288 | tmpfp.write(payload) |
|
289 | 289 | if not payload.endswith('\n'): |
|
290 | 290 | tmpfp.write('\n') |
|
291 | 291 | elif not diffs_seen and message and content_type == 'text/plain': |
|
292 | 292 | message += '\n' + payload |
|
293 | 293 | except: # re-raises |
|
294 | 294 | tmpfp.close() |
|
295 | 295 | os.unlink(tmpname) |
|
296 | 296 | raise |
|
297 | 297 | |
|
298 | 298 | if subject and not message.startswith(subject): |
|
299 | 299 | message = '%s\n%s' % (subject, message) |
|
300 | 300 | data['message'] = message |
|
301 | 301 | tmpfp.close() |
|
302 | 302 | if parents: |
|
303 | 303 | data['p1'] = parents.pop(0) |
|
304 | 304 | if parents: |
|
305 | 305 | data['p2'] = parents.pop(0) |
|
306 | 306 | |
|
307 | 307 | if diffs_seen: |
|
308 | 308 | data['filename'] = tmpname |
|
309 | 309 | else: |
|
310 | 310 | os.unlink(tmpname) |
|
311 | 311 | return data |
|
312 | 312 | |
|
313 | 313 | class patchmeta(object): |
|
314 | 314 | """Patched file metadata |
|
315 | 315 | |
|
316 | 316 | 'op' is the performed operation within ADD, DELETE, RENAME, MODIFY |
|
317 | 317 | or COPY. 'path' is patched file path. 'oldpath' is set to the |
|
318 | 318 | origin file when 'op' is either COPY or RENAME, None otherwise. If |
|
319 | 319 | file mode is changed, 'mode' is a tuple (islink, isexec) where |
|
320 | 320 | 'islink' is True if the file is a symlink and 'isexec' is True if |
|
321 | 321 | the file is executable. Otherwise, 'mode' is None. |
|
322 | 322 | """ |
|
323 | 323 | def __init__(self, path): |
|
324 | 324 | self.path = path |
|
325 | 325 | self.oldpath = None |
|
326 | 326 | self.mode = None |
|
327 | 327 | self.op = 'MODIFY' |
|
328 | 328 | self.binary = False |
|
329 | 329 | |
|
330 | 330 | def setmode(self, mode): |
|
331 | 331 | islink = mode & 0o20000 |
|
332 | 332 | isexec = mode & 0o100 |
|
333 | 333 | self.mode = (islink, isexec) |
|
334 | 334 | |
|
335 | 335 | def copy(self): |
|
336 | 336 | other = patchmeta(self.path) |
|
337 | 337 | other.oldpath = self.oldpath |
|
338 | 338 | other.mode = self.mode |
|
339 | 339 | other.op = self.op |
|
340 | 340 | other.binary = self.binary |
|
341 | 341 | return other |
|
342 | 342 | |
|
343 | 343 | def _ispatchinga(self, afile): |
|
344 | 344 | if afile == '/dev/null': |
|
345 | 345 | return self.op == 'ADD' |
|
346 | 346 | return afile == 'a/' + (self.oldpath or self.path) |
|
347 | 347 | |
|
348 | 348 | def _ispatchingb(self, bfile): |
|
349 | 349 | if bfile == '/dev/null': |
|
350 | 350 | return self.op == 'DELETE' |
|
351 | 351 | return bfile == 'b/' + self.path |
|
352 | 352 | |
|
353 | 353 | def ispatching(self, afile, bfile): |
|
354 | 354 | return self._ispatchinga(afile) and self._ispatchingb(bfile) |
|
355 | 355 | |
|
356 | 356 | def __repr__(self): |
|
357 | 357 | return "<patchmeta %s %r>" % (self.op, self.path) |
|
358 | 358 | |
|
359 | 359 | def readgitpatch(lr): |
|
360 | 360 | """extract git-style metadata about patches from <patchname>""" |
|
361 | 361 | |
|
362 | 362 | # Filter patch for git information |
|
363 | 363 | gp = None |
|
364 | 364 | gitpatches = [] |
|
365 | 365 | for line in lr: |
|
366 | 366 | line = line.rstrip(' \r\n') |
|
367 | 367 | if line.startswith('diff --git a/'): |
|
368 | 368 | m = gitre.match(line) |
|
369 | 369 | if m: |
|
370 | 370 | if gp: |
|
371 | 371 | gitpatches.append(gp) |
|
372 | 372 | dst = m.group(2) |
|
373 | 373 | gp = patchmeta(dst) |
|
374 | 374 | elif gp: |
|
375 | 375 | if line.startswith('--- '): |
|
376 | 376 | gitpatches.append(gp) |
|
377 | 377 | gp = None |
|
378 | 378 | continue |
|
379 | 379 | if line.startswith('rename from '): |
|
380 | 380 | gp.op = 'RENAME' |
|
381 | 381 | gp.oldpath = line[12:] |
|
382 | 382 | elif line.startswith('rename to '): |
|
383 | 383 | gp.path = line[10:] |
|
384 | 384 | elif line.startswith('copy from '): |
|
385 | 385 | gp.op = 'COPY' |
|
386 | 386 | gp.oldpath = line[10:] |
|
387 | 387 | elif line.startswith('copy to '): |
|
388 | 388 | gp.path = line[8:] |
|
389 | 389 | elif line.startswith('deleted file'): |
|
390 | 390 | gp.op = 'DELETE' |
|
391 | 391 | elif line.startswith('new file mode '): |
|
392 | 392 | gp.op = 'ADD' |
|
393 | 393 | gp.setmode(int(line[-6:], 8)) |
|
394 | 394 | elif line.startswith('new mode '): |
|
395 | 395 | gp.setmode(int(line[-6:], 8)) |
|
396 | 396 | elif line.startswith('GIT binary patch'): |
|
397 | 397 | gp.binary = True |
|
398 | 398 | if gp: |
|
399 | 399 | gitpatches.append(gp) |
|
400 | 400 | |
|
401 | 401 | return gitpatches |
|
402 | 402 | |
|
403 | 403 | class linereader(object): |
|
404 | 404 | # simple class to allow pushing lines back into the input stream |
|
405 | 405 | def __init__(self, fp): |
|
406 | 406 | self.fp = fp |
|
407 | 407 | self.buf = [] |
|
408 | 408 | |
|
409 | 409 | def push(self, line): |
|
410 | 410 | if line is not None: |
|
411 | 411 | self.buf.append(line) |
|
412 | 412 | |
|
413 | 413 | def readline(self): |
|
414 | 414 | if self.buf: |
|
415 | 415 | l = self.buf[0] |
|
416 | 416 | del self.buf[0] |
|
417 | 417 | return l |
|
418 | 418 | return self.fp.readline() |
|
419 | 419 | |
|
420 | 420 | def __iter__(self): |
|
421 | 421 | return iter(self.readline, '') |
|
422 | 422 | |
|
423 | 423 | class abstractbackend(object): |
|
424 | 424 | def __init__(self, ui): |
|
425 | 425 | self.ui = ui |
|
426 | 426 | |
|
427 | 427 | def getfile(self, fname): |
|
428 | 428 | """Return target file data and flags as a (data, (islink, |
|
429 | 429 | isexec)) tuple. Data is None if file is missing/deleted. |
|
430 | 430 | """ |
|
431 | 431 | raise NotImplementedError |
|
432 | 432 | |
|
433 | 433 | def setfile(self, fname, data, mode, copysource): |
|
434 | 434 | """Write data to target file fname and set its mode. mode is a |
|
435 | 435 | (islink, isexec) tuple. If data is None, the file content should |
|
436 | 436 | be left unchanged. If the file is modified after being copied, |
|
437 | 437 | copysource is set to the original file name. |
|
438 | 438 | """ |
|
439 | 439 | raise NotImplementedError |
|
440 | 440 | |
|
441 | 441 | def unlink(self, fname): |
|
442 | 442 | """Unlink target file.""" |
|
443 | 443 | raise NotImplementedError |
|
444 | 444 | |
|
445 | 445 | def writerej(self, fname, failed, total, lines): |
|
446 | 446 | """Write rejected lines for fname. total is the number of hunks |
|
447 | 447 | which failed to apply and total the total number of hunks for this |
|
448 | 448 | files. |
|
449 | 449 | """ |
|
450 | 450 | |
|
451 | 451 | def exists(self, fname): |
|
452 | 452 | raise NotImplementedError |
|
453 | 453 | |
|
454 | 454 | def close(self): |
|
455 | 455 | raise NotImplementedError |
|
456 | 456 | |
|
457 | 457 | class fsbackend(abstractbackend): |
|
458 | 458 | def __init__(self, ui, basedir): |
|
459 | 459 | super(fsbackend, self).__init__(ui) |
|
460 | 460 | self.opener = vfsmod.vfs(basedir) |
|
461 | 461 | |
|
462 | 462 | def getfile(self, fname): |
|
463 | 463 | if self.opener.islink(fname): |
|
464 | 464 | return (self.opener.readlink(fname), (True, False)) |
|
465 | 465 | |
|
466 | 466 | isexec = False |
|
467 | 467 | try: |
|
468 | 468 | isexec = self.opener.lstat(fname).st_mode & 0o100 != 0 |
|
469 | 469 | except OSError as e: |
|
470 | 470 | if e.errno != errno.ENOENT: |
|
471 | 471 | raise |
|
472 | 472 | try: |
|
473 | 473 | return (self.opener.read(fname), (False, isexec)) |
|
474 | 474 | except IOError as e: |
|
475 | 475 | if e.errno != errno.ENOENT: |
|
476 | 476 | raise |
|
477 | 477 | return None, None |
|
478 | 478 | |
|
479 | 479 | def setfile(self, fname, data, mode, copysource): |
|
480 | 480 | islink, isexec = mode |
|
481 | 481 | if data is None: |
|
482 | 482 | self.opener.setflags(fname, islink, isexec) |
|
483 | 483 | return |
|
484 | 484 | if islink: |
|
485 | 485 | self.opener.symlink(data, fname) |
|
486 | 486 | else: |
|
487 | 487 | self.opener.write(fname, data) |
|
488 | 488 | if isexec: |
|
489 | 489 | self.opener.setflags(fname, False, True) |
|
490 | 490 | |
|
491 | 491 | def unlink(self, fname): |
|
492 | 492 | self.opener.unlinkpath(fname, ignoremissing=True) |
|
493 | 493 | |
|
494 | 494 | def writerej(self, fname, failed, total, lines): |
|
495 | 495 | fname = fname + ".rej" |
|
496 | 496 | self.ui.warn( |
|
497 | 497 | _("%d out of %d hunks FAILED -- saving rejects to file %s\n") % |
|
498 | 498 | (failed, total, fname)) |
|
499 | 499 | fp = self.opener(fname, 'w') |
|
500 | 500 | fp.writelines(lines) |
|
501 | 501 | fp.close() |
|
502 | 502 | |
|
503 | 503 | def exists(self, fname): |
|
504 | 504 | return self.opener.lexists(fname) |
|
505 | 505 | |
|
506 | 506 | class workingbackend(fsbackend): |
|
507 | 507 | def __init__(self, ui, repo, similarity): |
|
508 | 508 | super(workingbackend, self).__init__(ui, repo.root) |
|
509 | 509 | self.repo = repo |
|
510 | 510 | self.similarity = similarity |
|
511 | 511 | self.removed = set() |
|
512 | 512 | self.changed = set() |
|
513 | 513 | self.copied = [] |
|
514 | 514 | |
|
515 | 515 | def _checkknown(self, fname): |
|
516 | 516 | if self.repo.dirstate[fname] == '?' and self.exists(fname): |
|
517 | 517 | raise PatchError(_('cannot patch %s: file is not tracked') % fname) |
|
518 | 518 | |
|
519 | 519 | def setfile(self, fname, data, mode, copysource): |
|
520 | 520 | self._checkknown(fname) |
|
521 | 521 | super(workingbackend, self).setfile(fname, data, mode, copysource) |
|
522 | 522 | if copysource is not None: |
|
523 | 523 | self.copied.append((copysource, fname)) |
|
524 | 524 | self.changed.add(fname) |
|
525 | 525 | |
|
526 | 526 | def unlink(self, fname): |
|
527 | 527 | self._checkknown(fname) |
|
528 | 528 | super(workingbackend, self).unlink(fname) |
|
529 | 529 | self.removed.add(fname) |
|
530 | 530 | self.changed.add(fname) |
|
531 | 531 | |
|
532 | 532 | def close(self): |
|
533 | 533 | wctx = self.repo[None] |
|
534 | 534 | changed = set(self.changed) |
|
535 | 535 | for src, dst in self.copied: |
|
536 | 536 | scmutil.dirstatecopy(self.ui, self.repo, wctx, src, dst) |
|
537 | 537 | if self.removed: |
|
538 | 538 | wctx.forget(sorted(self.removed)) |
|
539 | 539 | for f in self.removed: |
|
540 | 540 | if f not in self.repo.dirstate: |
|
541 | 541 | # File was deleted and no longer belongs to the |
|
542 | 542 | # dirstate, it was probably marked added then |
|
543 | 543 | # deleted, and should not be considered by |
|
544 | 544 | # marktouched(). |
|
545 | 545 | changed.discard(f) |
|
546 | 546 | if changed: |
|
547 | 547 | scmutil.marktouched(self.repo, changed, self.similarity) |
|
548 | 548 | return sorted(self.changed) |
|
549 | 549 | |
|
550 | 550 | class filestore(object): |
|
551 | 551 | def __init__(self, maxsize=None): |
|
552 | 552 | self.opener = None |
|
553 | 553 | self.files = {} |
|
554 | 554 | self.created = 0 |
|
555 | 555 | self.maxsize = maxsize |
|
556 | 556 | if self.maxsize is None: |
|
557 | 557 | self.maxsize = 4*(2**20) |
|
558 | 558 | self.size = 0 |
|
559 | 559 | self.data = {} |
|
560 | 560 | |
|
561 | 561 | def setfile(self, fname, data, mode, copied=None): |
|
562 | 562 | if self.maxsize < 0 or (len(data) + self.size) <= self.maxsize: |
|
563 | 563 | self.data[fname] = (data, mode, copied) |
|
564 | 564 | self.size += len(data) |
|
565 | 565 | else: |
|
566 | 566 | if self.opener is None: |
|
567 | 567 | root = tempfile.mkdtemp(prefix='hg-patch-') |
|
568 | 568 | self.opener = vfsmod.vfs(root) |
|
569 | 569 | # Avoid filename issues with these simple names |
|
570 | 570 | fn = str(self.created) |
|
571 | 571 | self.opener.write(fn, data) |
|
572 | 572 | self.created += 1 |
|
573 | 573 | self.files[fname] = (fn, mode, copied) |
|
574 | 574 | |
|
575 | 575 | def getfile(self, fname): |
|
576 | 576 | if fname in self.data: |
|
577 | 577 | return self.data[fname] |
|
578 | 578 | if not self.opener or fname not in self.files: |
|
579 | 579 | return None, None, None |
|
580 | 580 | fn, mode, copied = self.files[fname] |
|
581 | 581 | return self.opener.read(fn), mode, copied |
|
582 | 582 | |
|
583 | 583 | def close(self): |
|
584 | 584 | if self.opener: |
|
585 | 585 | shutil.rmtree(self.opener.base) |
|
586 | 586 | |
|
587 | 587 | class repobackend(abstractbackend): |
|
588 | 588 | def __init__(self, ui, repo, ctx, store): |
|
589 | 589 | super(repobackend, self).__init__(ui) |
|
590 | 590 | self.repo = repo |
|
591 | 591 | self.ctx = ctx |
|
592 | 592 | self.store = store |
|
593 | 593 | self.changed = set() |
|
594 | 594 | self.removed = set() |
|
595 | 595 | self.copied = {} |
|
596 | 596 | |
|
597 | 597 | def _checkknown(self, fname): |
|
598 | 598 | if fname not in self.ctx: |
|
599 | 599 | raise PatchError(_('cannot patch %s: file is not tracked') % fname) |
|
600 | 600 | |
|
601 | 601 | def getfile(self, fname): |
|
602 | 602 | try: |
|
603 | 603 | fctx = self.ctx[fname] |
|
604 | 604 | except error.LookupError: |
|
605 | 605 | return None, None |
|
606 | 606 | flags = fctx.flags() |
|
607 | 607 | return fctx.data(), ('l' in flags, 'x' in flags) |
|
608 | 608 | |
|
609 | 609 | def setfile(self, fname, data, mode, copysource): |
|
610 | 610 | if copysource: |
|
611 | 611 | self._checkknown(copysource) |
|
612 | 612 | if data is None: |
|
613 | 613 | data = self.ctx[fname].data() |
|
614 | 614 | self.store.setfile(fname, data, mode, copysource) |
|
615 | 615 | self.changed.add(fname) |
|
616 | 616 | if copysource: |
|
617 | 617 | self.copied[fname] = copysource |
|
618 | 618 | |
|
619 | 619 | def unlink(self, fname): |
|
620 | 620 | self._checkknown(fname) |
|
621 | 621 | self.removed.add(fname) |
|
622 | 622 | |
|
623 | 623 | def exists(self, fname): |
|
624 | 624 | return fname in self.ctx |
|
625 | 625 | |
|
626 | 626 | def close(self): |
|
627 | 627 | return self.changed | self.removed |
|
628 | 628 | |
|
629 | 629 | # @@ -start,len +start,len @@ or @@ -start +start @@ if len is 1 |
|
630 | 630 | unidesc = re.compile('@@ -(\d+)(?:,(\d+))? \+(\d+)(?:,(\d+))? @@') |
|
631 | 631 | contextdesc = re.compile('(?:---|\*\*\*) (\d+)(?:,(\d+))? (?:---|\*\*\*)') |
|
632 | 632 | eolmodes = ['strict', 'crlf', 'lf', 'auto'] |
|
633 | 633 | |
|
634 | 634 | class patchfile(object): |
|
635 | 635 | def __init__(self, ui, gp, backend, store, eolmode='strict'): |
|
636 | 636 | self.fname = gp.path |
|
637 | 637 | self.eolmode = eolmode |
|
638 | 638 | self.eol = None |
|
639 | 639 | self.backend = backend |
|
640 | 640 | self.ui = ui |
|
641 | 641 | self.lines = [] |
|
642 | 642 | self.exists = False |
|
643 | 643 | self.missing = True |
|
644 | 644 | self.mode = gp.mode |
|
645 | 645 | self.copysource = gp.oldpath |
|
646 | 646 | self.create = gp.op in ('ADD', 'COPY', 'RENAME') |
|
647 | 647 | self.remove = gp.op == 'DELETE' |
|
648 | 648 | if self.copysource is None: |
|
649 | 649 | data, mode = backend.getfile(self.fname) |
|
650 | 650 | else: |
|
651 | 651 | data, mode = store.getfile(self.copysource)[:2] |
|
652 | 652 | if data is not None: |
|
653 | 653 | self.exists = self.copysource is None or backend.exists(self.fname) |
|
654 | 654 | self.missing = False |
|
655 | 655 | if data: |
|
656 | 656 | self.lines = mdiff.splitnewlines(data) |
|
657 | 657 | if self.mode is None: |
|
658 | 658 | self.mode = mode |
|
659 | 659 | if self.lines: |
|
660 | 660 | # Normalize line endings |
|
661 | 661 | if self.lines[0].endswith('\r\n'): |
|
662 | 662 | self.eol = '\r\n' |
|
663 | 663 | elif self.lines[0].endswith('\n'): |
|
664 | 664 | self.eol = '\n' |
|
665 | 665 | if eolmode != 'strict': |
|
666 | 666 | nlines = [] |
|
667 | 667 | for l in self.lines: |
|
668 | 668 | if l.endswith('\r\n'): |
|
669 | 669 | l = l[:-2] + '\n' |
|
670 | 670 | nlines.append(l) |
|
671 | 671 | self.lines = nlines |
|
672 | 672 | else: |
|
673 | 673 | if self.create: |
|
674 | 674 | self.missing = False |
|
675 | 675 | if self.mode is None: |
|
676 | 676 | self.mode = (False, False) |
|
677 | 677 | if self.missing: |
|
678 | 678 | self.ui.warn(_("unable to find '%s' for patching\n") % self.fname) |
|
679 | 679 | self.ui.warn(_("(use '--prefix' to apply patch relative to the " |
|
680 | 680 | "current directory)\n")) |
|
681 | 681 | |
|
682 | 682 | self.hash = {} |
|
683 | 683 | self.dirty = 0 |
|
684 | 684 | self.offset = 0 |
|
685 | 685 | self.skew = 0 |
|
686 | 686 | self.rej = [] |
|
687 | 687 | self.fileprinted = False |
|
688 | 688 | self.printfile(False) |
|
689 | 689 | self.hunks = 0 |
|
690 | 690 | |
|
691 | 691 | def writelines(self, fname, lines, mode): |
|
692 | 692 | if self.eolmode == 'auto': |
|
693 | 693 | eol = self.eol |
|
694 | 694 | elif self.eolmode == 'crlf': |
|
695 | 695 | eol = '\r\n' |
|
696 | 696 | else: |
|
697 | 697 | eol = '\n' |
|
698 | 698 | |
|
699 | 699 | if self.eolmode != 'strict' and eol and eol != '\n': |
|
700 | 700 | rawlines = [] |
|
701 | 701 | for l in lines: |
|
702 | 702 | if l and l[-1] == '\n': |
|
703 | 703 | l = l[:-1] + eol |
|
704 | 704 | rawlines.append(l) |
|
705 | 705 | lines = rawlines |
|
706 | 706 | |
|
707 | 707 | self.backend.setfile(fname, ''.join(lines), mode, self.copysource) |
|
708 | 708 | |
|
709 | 709 | def printfile(self, warn): |
|
710 | 710 | if self.fileprinted: |
|
711 | 711 | return |
|
712 | 712 | if warn or self.ui.verbose: |
|
713 | 713 | self.fileprinted = True |
|
714 | 714 | s = _("patching file %s\n") % self.fname |
|
715 | 715 | if warn: |
|
716 | 716 | self.ui.warn(s) |
|
717 | 717 | else: |
|
718 | 718 | self.ui.note(s) |
|
719 | 719 | |
|
720 | 720 | |
|
721 | 721 | def findlines(self, l, linenum): |
|
722 | 722 | # looks through the hash and finds candidate lines. The |
|
723 | 723 | # result is a list of line numbers sorted based on distance |
|
724 | 724 | # from linenum |
|
725 | 725 | |
|
726 | 726 | cand = self.hash.get(l, []) |
|
727 | 727 | if len(cand) > 1: |
|
728 | 728 | # resort our list of potentials forward then back. |
|
729 | 729 | cand.sort(key=lambda x: abs(x - linenum)) |
|
730 | 730 | return cand |
|
731 | 731 | |
|
732 | 732 | def write_rej(self): |
|
733 | 733 | # our rejects are a little different from patch(1). This always |
|
734 | 734 | # creates rejects in the same form as the original patch. A file |
|
735 | 735 | # header is inserted so that you can run the reject through patch again |
|
736 | 736 | # without having to type the filename. |
|
737 | 737 | if not self.rej: |
|
738 | 738 | return |
|
739 | 739 | base = os.path.basename(self.fname) |
|
740 | 740 | lines = ["--- %s\n+++ %s\n" % (base, base)] |
|
741 | 741 | for x in self.rej: |
|
742 | 742 | for l in x.hunk: |
|
743 | 743 | lines.append(l) |
|
744 | 744 | if l[-1:] != '\n': |
|
745 | 745 | lines.append("\n\ No newline at end of file\n") |
|
746 | 746 | self.backend.writerej(self.fname, len(self.rej), self.hunks, lines) |
|
747 | 747 | |
|
748 | 748 | def apply(self, h): |
|
749 | 749 | if not h.complete(): |
|
750 | 750 | raise PatchError(_("bad hunk #%d %s (%d %d %d %d)") % |
|
751 | 751 | (h.number, h.desc, len(h.a), h.lena, len(h.b), |
|
752 | 752 | h.lenb)) |
|
753 | 753 | |
|
754 | 754 | self.hunks += 1 |
|
755 | 755 | |
|
756 | 756 | if self.missing: |
|
757 | 757 | self.rej.append(h) |
|
758 | 758 | return -1 |
|
759 | 759 | |
|
760 | 760 | if self.exists and self.create: |
|
761 | 761 | if self.copysource: |
|
762 | 762 | self.ui.warn(_("cannot create %s: destination already " |
|
763 | 763 | "exists\n") % self.fname) |
|
764 | 764 | else: |
|
765 | 765 | self.ui.warn(_("file %s already exists\n") % self.fname) |
|
766 | 766 | self.rej.append(h) |
|
767 | 767 | return -1 |
|
768 | 768 | |
|
769 | 769 | if isinstance(h, binhunk): |
|
770 | 770 | if self.remove: |
|
771 | 771 | self.backend.unlink(self.fname) |
|
772 | 772 | else: |
|
773 | 773 | l = h.new(self.lines) |
|
774 | 774 | self.lines[:] = l |
|
775 | 775 | self.offset += len(l) |
|
776 | 776 | self.dirty = True |
|
777 | 777 | return 0 |
|
778 | 778 | |
|
779 | 779 | horig = h |
|
780 | 780 | if (self.eolmode in ('crlf', 'lf') |
|
781 | 781 | or self.eolmode == 'auto' and self.eol): |
|
782 | 782 | # If new eols are going to be normalized, then normalize |
|
783 | 783 | # hunk data before patching. Otherwise, preserve input |
|
784 | 784 | # line-endings. |
|
785 | 785 | h = h.getnormalized() |
|
786 | 786 | |
|
787 | 787 | # fast case first, no offsets, no fuzz |
|
788 | 788 | old, oldstart, new, newstart = h.fuzzit(0, False) |
|
789 | 789 | oldstart += self.offset |
|
790 | 790 | orig_start = oldstart |
|
791 | 791 | # if there's skew we want to emit the "(offset %d lines)" even |
|
792 | 792 | # when the hunk cleanly applies at start + skew, so skip the |
|
793 | 793 | # fast case code |
|
794 | 794 | if (self.skew == 0 and |
|
795 | 795 | diffhelpers.testhunk(old, self.lines, oldstart) == 0): |
|
796 | 796 | if self.remove: |
|
797 | 797 | self.backend.unlink(self.fname) |
|
798 | 798 | else: |
|
799 | 799 | self.lines[oldstart:oldstart + len(old)] = new |
|
800 | 800 | self.offset += len(new) - len(old) |
|
801 | 801 | self.dirty = True |
|
802 | 802 | return 0 |
|
803 | 803 | |
|
804 | 804 | # ok, we couldn't match the hunk. Lets look for offsets and fuzz it |
|
805 | 805 | self.hash = {} |
|
806 | 806 | for x, s in enumerate(self.lines): |
|
807 | 807 | self.hash.setdefault(s, []).append(x) |
|
808 | 808 | |
|
809 | 809 | for fuzzlen in xrange(self.ui.configint("patch", "fuzz") + 1): |
|
810 | 810 | for toponly in [True, False]: |
|
811 | 811 | old, oldstart, new, newstart = h.fuzzit(fuzzlen, toponly) |
|
812 | 812 | oldstart = oldstart + self.offset + self.skew |
|
813 | 813 | oldstart = min(oldstart, len(self.lines)) |
|
814 | 814 | if old: |
|
815 | 815 | cand = self.findlines(old[0][1:], oldstart) |
|
816 | 816 | else: |
|
817 | 817 | # Only adding lines with no or fuzzed context, just |
|
818 | 818 | # take the skew in account |
|
819 | 819 | cand = [oldstart] |
|
820 | 820 | |
|
821 | 821 | for l in cand: |
|
822 | 822 | if not old or diffhelpers.testhunk(old, self.lines, l) == 0: |
|
823 | 823 | self.lines[l : l + len(old)] = new |
|
824 | 824 | self.offset += len(new) - len(old) |
|
825 | 825 | self.skew = l - orig_start |
|
826 | 826 | self.dirty = True |
|
827 | 827 | offset = l - orig_start - fuzzlen |
|
828 | 828 | if fuzzlen: |
|
829 | 829 | msg = _("Hunk #%d succeeded at %d " |
|
830 | 830 | "with fuzz %d " |
|
831 | 831 | "(offset %d lines).\n") |
|
832 | 832 | self.printfile(True) |
|
833 | 833 | self.ui.warn(msg % |
|
834 | 834 | (h.number, l + 1, fuzzlen, offset)) |
|
835 | 835 | else: |
|
836 | 836 | msg = _("Hunk #%d succeeded at %d " |
|
837 | 837 | "(offset %d lines).\n") |
|
838 | 838 | self.ui.note(msg % (h.number, l + 1, offset)) |
|
839 | 839 | return fuzzlen |
|
840 | 840 | self.printfile(True) |
|
841 | 841 | self.ui.warn(_("Hunk #%d FAILED at %d\n") % (h.number, orig_start)) |
|
842 | 842 | self.rej.append(horig) |
|
843 | 843 | return -1 |
|
844 | 844 | |
|
845 | 845 | def close(self): |
|
846 | 846 | if self.dirty: |
|
847 | 847 | self.writelines(self.fname, self.lines, self.mode) |
|
848 | 848 | self.write_rej() |
|
849 | 849 | return len(self.rej) |
|
850 | 850 | |
|
851 | 851 | class header(object): |
|
852 | 852 | """patch header |
|
853 | 853 | """ |
|
854 | 854 | diffgit_re = re.compile('diff --git a/(.*) b/(.*)$') |
|
855 | 855 | diff_re = re.compile('diff -r .* (.*)$') |
|
856 | 856 | allhunks_re = re.compile('(?:index|deleted file) ') |
|
857 | 857 | pretty_re = re.compile('(?:new file|deleted file) ') |
|
858 | 858 | special_re = re.compile('(?:index|deleted|copy|rename) ') |
|
859 | 859 | newfile_re = re.compile('(?:new file)') |
|
860 | 860 | |
|
861 | 861 | def __init__(self, header): |
|
862 | 862 | self.header = header |
|
863 | 863 | self.hunks = [] |
|
864 | 864 | |
|
865 | 865 | def binary(self): |
|
866 | 866 | return any(h.startswith('index ') for h in self.header) |
|
867 | 867 | |
|
868 | 868 | def pretty(self, fp): |
|
869 | 869 | for h in self.header: |
|
870 | 870 | if h.startswith('index '): |
|
871 | 871 | fp.write(_('this modifies a binary file (all or nothing)\n')) |
|
872 | 872 | break |
|
873 | 873 | if self.pretty_re.match(h): |
|
874 | 874 | fp.write(h) |
|
875 | 875 | if self.binary(): |
|
876 | 876 | fp.write(_('this is a binary file\n')) |
|
877 | 877 | break |
|
878 | 878 | if h.startswith('---'): |
|
879 | 879 | fp.write(_('%d hunks, %d lines changed\n') % |
|
880 | 880 | (len(self.hunks), |
|
881 | 881 | sum([max(h.added, h.removed) for h in self.hunks]))) |
|
882 | 882 | break |
|
883 | 883 | fp.write(h) |
|
884 | 884 | |
|
885 | 885 | def write(self, fp): |
|
886 | 886 | fp.write(''.join(self.header)) |
|
887 | 887 | |
|
888 | 888 | def allhunks(self): |
|
889 | 889 | return any(self.allhunks_re.match(h) for h in self.header) |
|
890 | 890 | |
|
891 | 891 | def files(self): |
|
892 | 892 | match = self.diffgit_re.match(self.header[0]) |
|
893 | 893 | if match: |
|
894 | 894 | fromfile, tofile = match.groups() |
|
895 | 895 | if fromfile == tofile: |
|
896 | 896 | return [fromfile] |
|
897 | 897 | return [fromfile, tofile] |
|
898 | 898 | else: |
|
899 | 899 | return self.diff_re.match(self.header[0]).groups() |
|
900 | 900 | |
|
901 | 901 | def filename(self): |
|
902 | 902 | return self.files()[-1] |
|
903 | 903 | |
|
904 | 904 | def __repr__(self): |
|
905 | 905 | return '<header %s>' % (' '.join(map(repr, self.files()))) |
|
906 | 906 | |
|
907 | 907 | def isnewfile(self): |
|
908 | 908 | return any(self.newfile_re.match(h) for h in self.header) |
|
909 | 909 | |
|
910 | 910 | def special(self): |
|
911 | 911 | # Special files are shown only at the header level and not at the hunk |
|
912 | 912 | # level for example a file that has been deleted is a special file. |
|
913 | 913 | # The user cannot change the content of the operation, in the case of |
|
914 | 914 | # the deleted file he has to take the deletion or not take it, he |
|
915 | 915 | # cannot take some of it. |
|
916 | 916 | # Newly added files are special if they are empty, they are not special |
|
917 | 917 | # if they have some content as we want to be able to change it |
|
918 | 918 | nocontent = len(self.header) == 2 |
|
919 | 919 | emptynewfile = self.isnewfile() and nocontent |
|
920 | 920 | return emptynewfile or \ |
|
921 | 921 | any(self.special_re.match(h) for h in self.header) |
|
922 | 922 | |
|
923 | 923 | class recordhunk(object): |
|
924 | 924 | """patch hunk |
|
925 | 925 | |
|
926 | 926 | XXX shouldn't we merge this with the other hunk class? |
|
927 | 927 | """ |
|
928 | 928 | |
|
929 | 929 | def __init__(self, header, fromline, toline, proc, before, hunk, after, |
|
930 | 930 | maxcontext=None): |
|
931 | 931 | def trimcontext(lines, reverse=False): |
|
932 | 932 | if maxcontext is not None: |
|
933 | 933 | delta = len(lines) - maxcontext |
|
934 | 934 | if delta > 0: |
|
935 | 935 | if reverse: |
|
936 | 936 | return delta, lines[delta:] |
|
937 | 937 | else: |
|
938 | 938 | return delta, lines[:maxcontext] |
|
939 | 939 | return 0, lines |
|
940 | 940 | |
|
941 | 941 | self.header = header |
|
942 | 942 | trimedbefore, self.before = trimcontext(before, True) |
|
943 | 943 | self.fromline = fromline + trimedbefore |
|
944 | 944 | self.toline = toline + trimedbefore |
|
945 | 945 | _trimedafter, self.after = trimcontext(after, False) |
|
946 | 946 | self.proc = proc |
|
947 | 947 | self.hunk = hunk |
|
948 | 948 | self.added, self.removed = self.countchanges(self.hunk) |
|
949 | 949 | |
|
950 | 950 | def __eq__(self, v): |
|
951 | 951 | if not isinstance(v, recordhunk): |
|
952 | 952 | return False |
|
953 | 953 | |
|
954 | 954 | return ((v.hunk == self.hunk) and |
|
955 | 955 | (v.proc == self.proc) and |
|
956 | 956 | (self.fromline == v.fromline) and |
|
957 | 957 | (self.header.files() == v.header.files())) |
|
958 | 958 | |
|
959 | 959 | def __hash__(self): |
|
960 | 960 | return hash((tuple(self.hunk), |
|
961 | 961 | tuple(self.header.files()), |
|
962 | 962 | self.fromline, |
|
963 | 963 | self.proc)) |
|
964 | 964 | |
|
965 | 965 | def countchanges(self, hunk): |
|
966 | 966 | """hunk -> (n+,n-)""" |
|
967 | 967 | add = len([h for h in hunk if h.startswith('+')]) |
|
968 | 968 | rem = len([h for h in hunk if h.startswith('-')]) |
|
969 | 969 | return add, rem |
|
970 | 970 | |
|
971 | 971 | def reversehunk(self): |
|
972 | 972 | """return another recordhunk which is the reverse of the hunk |
|
973 | 973 | |
|
974 | 974 | If this hunk is diff(A, B), the returned hunk is diff(B, A). To do |
|
975 | 975 | that, swap fromline/toline and +/- signs while keep other things |
|
976 | 976 | unchanged. |
|
977 | 977 | """ |
|
978 | 978 | m = {'+': '-', '-': '+', '\\': '\\'} |
|
979 | 979 | hunk = ['%s%s' % (m[l[0:1]], l[1:]) for l in self.hunk] |
|
980 | 980 | return recordhunk(self.header, self.toline, self.fromline, self.proc, |
|
981 | 981 | self.before, hunk, self.after) |
|
982 | 982 | |
|
983 | 983 | def write(self, fp): |
|
984 | 984 | delta = len(self.before) + len(self.after) |
|
985 | 985 | if self.after and self.after[-1] == '\\ No newline at end of file\n': |
|
986 | 986 | delta -= 1 |
|
987 | 987 | fromlen = delta + self.removed |
|
988 | 988 | tolen = delta + self.added |
|
989 | 989 | fp.write('@@ -%d,%d +%d,%d @@%s\n' % |
|
990 | 990 | (self.fromline, fromlen, self.toline, tolen, |
|
991 | 991 | self.proc and (' ' + self.proc))) |
|
992 | 992 | fp.write(''.join(self.before + self.hunk + self.after)) |
|
993 | 993 | |
|
994 | 994 | pretty = write |
|
995 | 995 | |
|
996 | 996 | def filename(self): |
|
997 | 997 | return self.header.filename() |
|
998 | 998 | |
|
999 | 999 | def __repr__(self): |
|
1000 | 1000 | return '<hunk %r@%d>' % (self.filename(), self.fromline) |
|
1001 | 1001 | |
|
1002 | 1002 | def getmessages(): |
|
1003 | 1003 | return { |
|
1004 | 1004 | 'multiple': { |
|
1005 | 1005 | 'apply': _("apply change %d/%d to '%s'?"), |
|
1006 | 1006 | 'discard': _("discard change %d/%d to '%s'?"), |
|
1007 | 1007 | 'record': _("record change %d/%d to '%s'?"), |
|
1008 | 1008 | }, |
|
1009 | 1009 | 'single': { |
|
1010 | 1010 | 'apply': _("apply this change to '%s'?"), |
|
1011 | 1011 | 'discard': _("discard this change to '%s'?"), |
|
1012 | 1012 | 'record': _("record this change to '%s'?"), |
|
1013 | 1013 | }, |
|
1014 | 1014 | 'help': { |
|
1015 | 1015 | 'apply': _('[Ynesfdaq?]' |
|
1016 | 1016 | '$$ &Yes, apply this change' |
|
1017 | 1017 | '$$ &No, skip this change' |
|
1018 | 1018 | '$$ &Edit this change manually' |
|
1019 | 1019 | '$$ &Skip remaining changes to this file' |
|
1020 | 1020 | '$$ Apply remaining changes to this &file' |
|
1021 | 1021 | '$$ &Done, skip remaining changes and files' |
|
1022 | 1022 | '$$ Apply &all changes to all remaining files' |
|
1023 | 1023 | '$$ &Quit, applying no changes' |
|
1024 | 1024 | '$$ &? (display help)'), |
|
1025 | 1025 | 'discard': _('[Ynesfdaq?]' |
|
1026 | 1026 | '$$ &Yes, discard this change' |
|
1027 | 1027 | '$$ &No, skip this change' |
|
1028 | 1028 | '$$ &Edit this change manually' |
|
1029 | 1029 | '$$ &Skip remaining changes to this file' |
|
1030 | 1030 | '$$ Discard remaining changes to this &file' |
|
1031 | 1031 | '$$ &Done, skip remaining changes and files' |
|
1032 | 1032 | '$$ Discard &all changes to all remaining files' |
|
1033 | 1033 | '$$ &Quit, discarding no changes' |
|
1034 | 1034 | '$$ &? (display help)'), |
|
1035 | 1035 | 'record': _('[Ynesfdaq?]' |
|
1036 | 1036 | '$$ &Yes, record this change' |
|
1037 | 1037 | '$$ &No, skip this change' |
|
1038 | 1038 | '$$ &Edit this change manually' |
|
1039 | 1039 | '$$ &Skip remaining changes to this file' |
|
1040 | 1040 | '$$ Record remaining changes to this &file' |
|
1041 | 1041 | '$$ &Done, skip remaining changes and files' |
|
1042 | 1042 | '$$ Record &all changes to all remaining files' |
|
1043 | 1043 | '$$ &Quit, recording no changes' |
|
1044 | 1044 | '$$ &? (display help)'), |
|
1045 | 1045 | } |
|
1046 | 1046 | } |
|
1047 | 1047 | |
|
1048 | 1048 | def filterpatch(ui, headers, operation=None): |
|
1049 | 1049 | """Interactively filter patch chunks into applied-only chunks""" |
|
1050 | 1050 | messages = getmessages() |
|
1051 | 1051 | |
|
1052 | 1052 | if operation is None: |
|
1053 | 1053 | operation = 'record' |
|
1054 | 1054 | |
|
1055 | 1055 | def prompt(skipfile, skipall, query, chunk): |
|
1056 | 1056 | """prompt query, and process base inputs |
|
1057 | 1057 | |
|
1058 | 1058 | - y/n for the rest of file |
|
1059 | 1059 | - y/n for the rest |
|
1060 | 1060 | - ? (help) |
|
1061 | 1061 | - q (quit) |
|
1062 | 1062 | |
|
1063 | 1063 | Return True/False and possibly updated skipfile and skipall. |
|
1064 | 1064 | """ |
|
1065 | 1065 | newpatches = None |
|
1066 | 1066 | if skipall is not None: |
|
1067 | 1067 | return skipall, skipfile, skipall, newpatches |
|
1068 | 1068 | if skipfile is not None: |
|
1069 | 1069 | return skipfile, skipfile, skipall, newpatches |
|
1070 | 1070 | while True: |
|
1071 | 1071 | resps = messages['help'][operation] |
|
1072 | 1072 | r = ui.promptchoice("%s %s" % (query, resps)) |
|
1073 | 1073 | ui.write("\n") |
|
1074 | 1074 | if r == 8: # ? |
|
1075 | 1075 | for c, t in ui.extractchoices(resps)[1]: |
|
1076 | 1076 | ui.write('%s - %s\n' % (c, encoding.lower(t))) |
|
1077 | 1077 | continue |
|
1078 | 1078 | elif r == 0: # yes |
|
1079 | 1079 | ret = True |
|
1080 | 1080 | elif r == 1: # no |
|
1081 | 1081 | ret = False |
|
1082 | 1082 | elif r == 2: # Edit patch |
|
1083 | 1083 | if chunk is None: |
|
1084 | 1084 | ui.write(_('cannot edit patch for whole file')) |
|
1085 | 1085 | ui.write("\n") |
|
1086 | 1086 | continue |
|
1087 | 1087 | if chunk.header.binary(): |
|
1088 | 1088 | ui.write(_('cannot edit patch for binary file')) |
|
1089 | 1089 | ui.write("\n") |
|
1090 | 1090 | continue |
|
1091 | 1091 | # Patch comment based on the Git one (based on comment at end of |
|
1092 | 1092 | # https://mercurial-scm.org/wiki/RecordExtension) |
|
1093 | 1093 | phelp = '---' + _(""" |
|
1094 | 1094 | To remove '-' lines, make them ' ' lines (context). |
|
1095 | 1095 | To remove '+' lines, delete them. |
|
1096 | 1096 | Lines starting with # will be removed from the patch. |
|
1097 | 1097 | |
|
1098 | 1098 | If the patch applies cleanly, the edited hunk will immediately be |
|
1099 | 1099 | added to the record list. If it does not apply cleanly, a rejects |
|
1100 | 1100 | file will be generated: you can use that when you try again. If |
|
1101 | 1101 | all lines of the hunk are removed, then the edit is aborted and |
|
1102 | 1102 | the hunk is left unchanged. |
|
1103 | 1103 | """) |
|
1104 | 1104 | (patchfd, patchfn) = tempfile.mkstemp(prefix="hg-editor-", |
|
1105 | 1105 | suffix=".diff", text=True) |
|
1106 | 1106 | ncpatchfp = None |
|
1107 | 1107 | try: |
|
1108 | 1108 | # Write the initial patch |
|
1109 | 1109 | f = os.fdopen(patchfd, pycompat.sysstr("w")) |
|
1110 | 1110 | chunk.header.write(f) |
|
1111 | 1111 | chunk.write(f) |
|
1112 | 1112 | f.write('\n'.join(['# ' + i for i in phelp.splitlines()])) |
|
1113 | 1113 | f.close() |
|
1114 | 1114 | # Start the editor and wait for it to complete |
|
1115 | 1115 | editor = ui.geteditor() |
|
1116 | 1116 | ret = ui.system("%s \"%s\"" % (editor, patchfn), |
|
1117 | 1117 | environ={'HGUSER': ui.username()}, |
|
1118 | 1118 | blockedtag='filterpatch') |
|
1119 | 1119 | if ret != 0: |
|
1120 | 1120 | ui.warn(_("editor exited with exit code %d\n") % ret) |
|
1121 | 1121 | continue |
|
1122 | 1122 | # Remove comment lines |
|
1123 | 1123 | patchfp = open(patchfn) |
|
1124 | 1124 | ncpatchfp = stringio() |
|
1125 | 1125 | for line in util.iterfile(patchfp): |
|
1126 | 1126 | if not line.startswith('#'): |
|
1127 | 1127 | ncpatchfp.write(line) |
|
1128 | 1128 | patchfp.close() |
|
1129 | 1129 | ncpatchfp.seek(0) |
|
1130 | 1130 | newpatches = parsepatch(ncpatchfp) |
|
1131 | 1131 | finally: |
|
1132 | 1132 | os.unlink(patchfn) |
|
1133 | 1133 | del ncpatchfp |
|
1134 | 1134 | # Signal that the chunk shouldn't be applied as-is, but |
|
1135 | 1135 | # provide the new patch to be used instead. |
|
1136 | 1136 | ret = False |
|
1137 | 1137 | elif r == 3: # Skip |
|
1138 | 1138 | ret = skipfile = False |
|
1139 | 1139 | elif r == 4: # file (Record remaining) |
|
1140 | 1140 | ret = skipfile = True |
|
1141 | 1141 | elif r == 5: # done, skip remaining |
|
1142 | 1142 | ret = skipall = False |
|
1143 | 1143 | elif r == 6: # all |
|
1144 | 1144 | ret = skipall = True |
|
1145 | 1145 | elif r == 7: # quit |
|
1146 | 1146 | raise error.Abort(_('user quit')) |
|
1147 | 1147 | return ret, skipfile, skipall, newpatches |
|
1148 | 1148 | |
|
1149 | 1149 | seen = set() |
|
1150 | 1150 | applied = {} # 'filename' -> [] of chunks |
|
1151 | 1151 | skipfile, skipall = None, None |
|
1152 | 1152 | pos, total = 1, sum(len(h.hunks) for h in headers) |
|
1153 | 1153 | for h in headers: |
|
1154 | 1154 | pos += len(h.hunks) |
|
1155 | 1155 | skipfile = None |
|
1156 | 1156 | fixoffset = 0 |
|
1157 | 1157 | hdr = ''.join(h.header) |
|
1158 | 1158 | if hdr in seen: |
|
1159 | 1159 | continue |
|
1160 | 1160 | seen.add(hdr) |
|
1161 | 1161 | if skipall is None: |
|
1162 | 1162 | h.pretty(ui) |
|
1163 | 1163 | msg = (_('examine changes to %s?') % |
|
1164 | 1164 | _(' and ').join("'%s'" % f for f in h.files())) |
|
1165 | 1165 | r, skipfile, skipall, np = prompt(skipfile, skipall, msg, None) |
|
1166 | 1166 | if not r: |
|
1167 | 1167 | continue |
|
1168 | 1168 | applied[h.filename()] = [h] |
|
1169 | 1169 | if h.allhunks(): |
|
1170 | 1170 | applied[h.filename()] += h.hunks |
|
1171 | 1171 | continue |
|
1172 | 1172 | for i, chunk in enumerate(h.hunks): |
|
1173 | 1173 | if skipfile is None and skipall is None: |
|
1174 | 1174 | chunk.pretty(ui) |
|
1175 | 1175 | if total == 1: |
|
1176 | 1176 | msg = messages['single'][operation] % chunk.filename() |
|
1177 | 1177 | else: |
|
1178 | 1178 | idx = pos - len(h.hunks) + i |
|
1179 | 1179 | msg = messages['multiple'][operation] % (idx, total, |
|
1180 | 1180 | chunk.filename()) |
|
1181 | 1181 | r, skipfile, skipall, newpatches = prompt(skipfile, |
|
1182 | 1182 | skipall, msg, chunk) |
|
1183 | 1183 | if r: |
|
1184 | 1184 | if fixoffset: |
|
1185 | 1185 | chunk = copy.copy(chunk) |
|
1186 | 1186 | chunk.toline += fixoffset |
|
1187 | 1187 | applied[chunk.filename()].append(chunk) |
|
1188 | 1188 | elif newpatches is not None: |
|
1189 | 1189 | for newpatch in newpatches: |
|
1190 | 1190 | for newhunk in newpatch.hunks: |
|
1191 | 1191 | if fixoffset: |
|
1192 | 1192 | newhunk.toline += fixoffset |
|
1193 | 1193 | applied[newhunk.filename()].append(newhunk) |
|
1194 | 1194 | else: |
|
1195 | 1195 | fixoffset += chunk.removed - chunk.added |
|
1196 | 1196 | return (sum([h for h in applied.itervalues() |
|
1197 | 1197 | if h[0].special() or len(h) > 1], []), {}) |
|
1198 | 1198 | class hunk(object): |
|
1199 | 1199 | def __init__(self, desc, num, lr, context): |
|
1200 | 1200 | self.number = num |
|
1201 | 1201 | self.desc = desc |
|
1202 | 1202 | self.hunk = [desc] |
|
1203 | 1203 | self.a = [] |
|
1204 | 1204 | self.b = [] |
|
1205 | 1205 | self.starta = self.lena = None |
|
1206 | 1206 | self.startb = self.lenb = None |
|
1207 | 1207 | if lr is not None: |
|
1208 | 1208 | if context: |
|
1209 | 1209 | self.read_context_hunk(lr) |
|
1210 | 1210 | else: |
|
1211 | 1211 | self.read_unified_hunk(lr) |
|
1212 | 1212 | |
|
1213 | 1213 | def getnormalized(self): |
|
1214 | 1214 | """Return a copy with line endings normalized to LF.""" |
|
1215 | 1215 | |
|
1216 | 1216 | def normalize(lines): |
|
1217 | 1217 | nlines = [] |
|
1218 | 1218 | for line in lines: |
|
1219 | 1219 | if line.endswith('\r\n'): |
|
1220 | 1220 | line = line[:-2] + '\n' |
|
1221 | 1221 | nlines.append(line) |
|
1222 | 1222 | return nlines |
|
1223 | 1223 | |
|
1224 | 1224 | # Dummy object, it is rebuilt manually |
|
1225 | 1225 | nh = hunk(self.desc, self.number, None, None) |
|
1226 | 1226 | nh.number = self.number |
|
1227 | 1227 | nh.desc = self.desc |
|
1228 | 1228 | nh.hunk = self.hunk |
|
1229 | 1229 | nh.a = normalize(self.a) |
|
1230 | 1230 | nh.b = normalize(self.b) |
|
1231 | 1231 | nh.starta = self.starta |
|
1232 | 1232 | nh.startb = self.startb |
|
1233 | 1233 | nh.lena = self.lena |
|
1234 | 1234 | nh.lenb = self.lenb |
|
1235 | 1235 | return nh |
|
1236 | 1236 | |
|
1237 | 1237 | def read_unified_hunk(self, lr): |
|
1238 | 1238 | m = unidesc.match(self.desc) |
|
1239 | 1239 | if not m: |
|
1240 | 1240 | raise PatchError(_("bad hunk #%d") % self.number) |
|
1241 | 1241 | self.starta, self.lena, self.startb, self.lenb = m.groups() |
|
1242 | 1242 | if self.lena is None: |
|
1243 | 1243 | self.lena = 1 |
|
1244 | 1244 | else: |
|
1245 | 1245 | self.lena = int(self.lena) |
|
1246 | 1246 | if self.lenb is None: |
|
1247 | 1247 | self.lenb = 1 |
|
1248 | 1248 | else: |
|
1249 | 1249 | self.lenb = int(self.lenb) |
|
1250 | 1250 | self.starta = int(self.starta) |
|
1251 | 1251 | self.startb = int(self.startb) |
|
1252 | 1252 | diffhelpers.addlines(lr, self.hunk, self.lena, self.lenb, self.a, |
|
1253 | 1253 | self.b) |
|
1254 | 1254 | # if we hit eof before finishing out the hunk, the last line will |
|
1255 | 1255 | # be zero length. Lets try to fix it up. |
|
1256 | 1256 | while len(self.hunk[-1]) == 0: |
|
1257 | 1257 | del self.hunk[-1] |
|
1258 | 1258 | del self.a[-1] |
|
1259 | 1259 | del self.b[-1] |
|
1260 | 1260 | self.lena -= 1 |
|
1261 | 1261 | self.lenb -= 1 |
|
1262 | 1262 | self._fixnewline(lr) |
|
1263 | 1263 | |
|
1264 | 1264 | def read_context_hunk(self, lr): |
|
1265 | 1265 | self.desc = lr.readline() |
|
1266 | 1266 | m = contextdesc.match(self.desc) |
|
1267 | 1267 | if not m: |
|
1268 | 1268 | raise PatchError(_("bad hunk #%d") % self.number) |
|
1269 | 1269 | self.starta, aend = m.groups() |
|
1270 | 1270 | self.starta = int(self.starta) |
|
1271 | 1271 | if aend is None: |
|
1272 | 1272 | aend = self.starta |
|
1273 | 1273 | self.lena = int(aend) - self.starta |
|
1274 | 1274 | if self.starta: |
|
1275 | 1275 | self.lena += 1 |
|
1276 | 1276 | for x in xrange(self.lena): |
|
1277 | 1277 | l = lr.readline() |
|
1278 | 1278 | if l.startswith('---'): |
|
1279 | 1279 | # lines addition, old block is empty |
|
1280 | 1280 | lr.push(l) |
|
1281 | 1281 | break |
|
1282 | 1282 | s = l[2:] |
|
1283 | 1283 | if l.startswith('- ') or l.startswith('! '): |
|
1284 | 1284 | u = '-' + s |
|
1285 | 1285 | elif l.startswith(' '): |
|
1286 | 1286 | u = ' ' + s |
|
1287 | 1287 | else: |
|
1288 | 1288 | raise PatchError(_("bad hunk #%d old text line %d") % |
|
1289 | 1289 | (self.number, x)) |
|
1290 | 1290 | self.a.append(u) |
|
1291 | 1291 | self.hunk.append(u) |
|
1292 | 1292 | |
|
1293 | 1293 | l = lr.readline() |
|
1294 | 1294 | if l.startswith('\ '): |
|
1295 | 1295 | s = self.a[-1][:-1] |
|
1296 | 1296 | self.a[-1] = s |
|
1297 | 1297 | self.hunk[-1] = s |
|
1298 | 1298 | l = lr.readline() |
|
1299 | 1299 | m = contextdesc.match(l) |
|
1300 | 1300 | if not m: |
|
1301 | 1301 | raise PatchError(_("bad hunk #%d") % self.number) |
|
1302 | 1302 | self.startb, bend = m.groups() |
|
1303 | 1303 | self.startb = int(self.startb) |
|
1304 | 1304 | if bend is None: |
|
1305 | 1305 | bend = self.startb |
|
1306 | 1306 | self.lenb = int(bend) - self.startb |
|
1307 | 1307 | if self.startb: |
|
1308 | 1308 | self.lenb += 1 |
|
1309 | 1309 | hunki = 1 |
|
1310 | 1310 | for x in xrange(self.lenb): |
|
1311 | 1311 | l = lr.readline() |
|
1312 | 1312 | if l.startswith('\ '): |
|
1313 | 1313 | # XXX: the only way to hit this is with an invalid line range. |
|
1314 | 1314 | # The no-eol marker is not counted in the line range, but I |
|
1315 | 1315 | # guess there are diff(1) out there which behave differently. |
|
1316 | 1316 | s = self.b[-1][:-1] |
|
1317 | 1317 | self.b[-1] = s |
|
1318 | 1318 | self.hunk[hunki - 1] = s |
|
1319 | 1319 | continue |
|
1320 | 1320 | if not l: |
|
1321 | 1321 | # line deletions, new block is empty and we hit EOF |
|
1322 | 1322 | lr.push(l) |
|
1323 | 1323 | break |
|
1324 | 1324 | s = l[2:] |
|
1325 | 1325 | if l.startswith('+ ') or l.startswith('! '): |
|
1326 | 1326 | u = '+' + s |
|
1327 | 1327 | elif l.startswith(' '): |
|
1328 | 1328 | u = ' ' + s |
|
1329 | 1329 | elif len(self.b) == 0: |
|
1330 | 1330 | # line deletions, new block is empty |
|
1331 | 1331 | lr.push(l) |
|
1332 | 1332 | break |
|
1333 | 1333 | else: |
|
1334 | 1334 | raise PatchError(_("bad hunk #%d old text line %d") % |
|
1335 | 1335 | (self.number, x)) |
|
1336 | 1336 | self.b.append(s) |
|
1337 | 1337 | while True: |
|
1338 | 1338 | if hunki >= len(self.hunk): |
|
1339 | 1339 | h = "" |
|
1340 | 1340 | else: |
|
1341 | 1341 | h = self.hunk[hunki] |
|
1342 | 1342 | hunki += 1 |
|
1343 | 1343 | if h == u: |
|
1344 | 1344 | break |
|
1345 | 1345 | elif h.startswith('-'): |
|
1346 | 1346 | continue |
|
1347 | 1347 | else: |
|
1348 | 1348 | self.hunk.insert(hunki - 1, u) |
|
1349 | 1349 | break |
|
1350 | 1350 | |
|
1351 | 1351 | if not self.a: |
|
1352 | 1352 | # this happens when lines were only added to the hunk |
|
1353 | 1353 | for x in self.hunk: |
|
1354 | 1354 | if x.startswith('-') or x.startswith(' '): |
|
1355 | 1355 | self.a.append(x) |
|
1356 | 1356 | if not self.b: |
|
1357 | 1357 | # this happens when lines were only deleted from the hunk |
|
1358 | 1358 | for x in self.hunk: |
|
1359 | 1359 | if x.startswith('+') or x.startswith(' '): |
|
1360 | 1360 | self.b.append(x[1:]) |
|
1361 | 1361 | # @@ -start,len +start,len @@ |
|
1362 | 1362 | self.desc = "@@ -%d,%d +%d,%d @@\n" % (self.starta, self.lena, |
|
1363 | 1363 | self.startb, self.lenb) |
|
1364 | 1364 | self.hunk[0] = self.desc |
|
1365 | 1365 | self._fixnewline(lr) |
|
1366 | 1366 | |
|
1367 | 1367 | def _fixnewline(self, lr): |
|
1368 | 1368 | l = lr.readline() |
|
1369 | 1369 | if l.startswith('\ '): |
|
1370 | 1370 | diffhelpers.fix_newline(self.hunk, self.a, self.b) |
|
1371 | 1371 | else: |
|
1372 | 1372 | lr.push(l) |
|
1373 | 1373 | |
|
1374 | 1374 | def complete(self): |
|
1375 | 1375 | return len(self.a) == self.lena and len(self.b) == self.lenb |
|
1376 | 1376 | |
|
1377 | 1377 | def _fuzzit(self, old, new, fuzz, toponly): |
|
1378 | 1378 | # this removes context lines from the top and bottom of list 'l'. It |
|
1379 | 1379 | # checks the hunk to make sure only context lines are removed, and then |
|
1380 | 1380 | # returns a new shortened list of lines. |
|
1381 | 1381 | fuzz = min(fuzz, len(old)) |
|
1382 | 1382 | if fuzz: |
|
1383 | 1383 | top = 0 |
|
1384 | 1384 | bot = 0 |
|
1385 | 1385 | hlen = len(self.hunk) |
|
1386 | 1386 | for x in xrange(hlen - 1): |
|
1387 | 1387 | # the hunk starts with the @@ line, so use x+1 |
|
1388 | 1388 | if self.hunk[x + 1][0] == ' ': |
|
1389 | 1389 | top += 1 |
|
1390 | 1390 | else: |
|
1391 | 1391 | break |
|
1392 | 1392 | if not toponly: |
|
1393 | 1393 | for x in xrange(hlen - 1): |
|
1394 | 1394 | if self.hunk[hlen - bot - 1][0] == ' ': |
|
1395 | 1395 | bot += 1 |
|
1396 | 1396 | else: |
|
1397 | 1397 | break |
|
1398 | 1398 | |
|
1399 | 1399 | bot = min(fuzz, bot) |
|
1400 | 1400 | top = min(fuzz, top) |
|
1401 | 1401 | return old[top:len(old) - bot], new[top:len(new) - bot], top |
|
1402 | 1402 | return old, new, 0 |
|
1403 | 1403 | |
|
1404 | 1404 | def fuzzit(self, fuzz, toponly): |
|
1405 | 1405 | old, new, top = self._fuzzit(self.a, self.b, fuzz, toponly) |
|
1406 | 1406 | oldstart = self.starta + top |
|
1407 | 1407 | newstart = self.startb + top |
|
1408 | 1408 | # zero length hunk ranges already have their start decremented |
|
1409 | 1409 | if self.lena and oldstart > 0: |
|
1410 | 1410 | oldstart -= 1 |
|
1411 | 1411 | if self.lenb and newstart > 0: |
|
1412 | 1412 | newstart -= 1 |
|
1413 | 1413 | return old, oldstart, new, newstart |
|
1414 | 1414 | |
|
1415 | 1415 | class binhunk(object): |
|
1416 | 1416 | 'A binary patch file.' |
|
1417 | 1417 | def __init__(self, lr, fname): |
|
1418 | 1418 | self.text = None |
|
1419 | 1419 | self.delta = False |
|
1420 | 1420 | self.hunk = ['GIT binary patch\n'] |
|
1421 | 1421 | self._fname = fname |
|
1422 | 1422 | self._read(lr) |
|
1423 | 1423 | |
|
1424 | 1424 | def complete(self): |
|
1425 | 1425 | return self.text is not None |
|
1426 | 1426 | |
|
1427 | 1427 | def new(self, lines): |
|
1428 | 1428 | if self.delta: |
|
1429 | 1429 | return [applybindelta(self.text, ''.join(lines))] |
|
1430 | 1430 | return [self.text] |
|
1431 | 1431 | |
|
1432 | 1432 | def _read(self, lr): |
|
1433 | 1433 | def getline(lr, hunk): |
|
1434 | 1434 | l = lr.readline() |
|
1435 | 1435 | hunk.append(l) |
|
1436 | 1436 | return l.rstrip('\r\n') |
|
1437 | 1437 | |
|
1438 | 1438 | size = 0 |
|
1439 | 1439 | while True: |
|
1440 | 1440 | line = getline(lr, self.hunk) |
|
1441 | 1441 | if not line: |
|
1442 | 1442 | raise PatchError(_('could not extract "%s" binary data') |
|
1443 | 1443 | % self._fname) |
|
1444 | 1444 | if line.startswith('literal '): |
|
1445 | 1445 | size = int(line[8:].rstrip()) |
|
1446 | 1446 | break |
|
1447 | 1447 | if line.startswith('delta '): |
|
1448 | 1448 | size = int(line[6:].rstrip()) |
|
1449 | 1449 | self.delta = True |
|
1450 | 1450 | break |
|
1451 | 1451 | dec = [] |
|
1452 | 1452 | line = getline(lr, self.hunk) |
|
1453 | 1453 | while len(line) > 1: |
|
1454 | 1454 | l = line[0] |
|
1455 | 1455 | if l <= 'Z' and l >= 'A': |
|
1456 | 1456 | l = ord(l) - ord('A') + 1 |
|
1457 | 1457 | else: |
|
1458 | 1458 | l = ord(l) - ord('a') + 27 |
|
1459 | 1459 | try: |
|
1460 | 1460 | dec.append(util.b85decode(line[1:])[:l]) |
|
1461 | 1461 | except ValueError as e: |
|
1462 | 1462 | raise PatchError(_('could not decode "%s" binary patch: %s') |
|
1463 | 1463 | % (self._fname, str(e))) |
|
1464 | 1464 | line = getline(lr, self.hunk) |
|
1465 | 1465 | text = zlib.decompress(''.join(dec)) |
|
1466 | 1466 | if len(text) != size: |
|
1467 | 1467 | raise PatchError(_('"%s" length is %d bytes, should be %d') |
|
1468 | 1468 | % (self._fname, len(text), size)) |
|
1469 | 1469 | self.text = text |
|
1470 | 1470 | |
|
1471 | 1471 | def parsefilename(str): |
|
1472 | 1472 | # --- filename \t|space stuff |
|
1473 | 1473 | s = str[4:].rstrip('\r\n') |
|
1474 | 1474 | i = s.find('\t') |
|
1475 | 1475 | if i < 0: |
|
1476 | 1476 | i = s.find(' ') |
|
1477 | 1477 | if i < 0: |
|
1478 | 1478 | return s |
|
1479 | 1479 | return s[:i] |
|
1480 | 1480 | |
|
1481 | 1481 | def reversehunks(hunks): |
|
1482 | 1482 | '''reverse the signs in the hunks given as argument |
|
1483 | 1483 | |
|
1484 | 1484 | This function operates on hunks coming out of patch.filterpatch, that is |
|
1485 | 1485 | a list of the form: [header1, hunk1, hunk2, header2...]. Example usage: |
|
1486 | 1486 | |
|
1487 | 1487 | >>> rawpatch = b"""diff --git a/folder1/g b/folder1/g |
|
1488 | 1488 | ... --- a/folder1/g |
|
1489 | 1489 | ... +++ b/folder1/g |
|
1490 | 1490 | ... @@ -1,7 +1,7 @@ |
|
1491 | 1491 | ... +firstline |
|
1492 | 1492 | ... c |
|
1493 | 1493 | ... 1 |
|
1494 | 1494 | ... 2 |
|
1495 | 1495 | ... + 3 |
|
1496 | 1496 | ... -4 |
|
1497 | 1497 | ... 5 |
|
1498 | 1498 | ... d |
|
1499 | 1499 | ... +lastline""" |
|
1500 | 1500 | >>> hunks = parsepatch([rawpatch]) |
|
1501 | 1501 | >>> hunkscomingfromfilterpatch = [] |
|
1502 | 1502 | >>> for h in hunks: |
|
1503 | 1503 | ... hunkscomingfromfilterpatch.append(h) |
|
1504 | 1504 | ... hunkscomingfromfilterpatch.extend(h.hunks) |
|
1505 | 1505 | |
|
1506 | 1506 | >>> reversedhunks = reversehunks(hunkscomingfromfilterpatch) |
|
1507 | 1507 | >>> from . import util |
|
1508 | 1508 | >>> fp = util.stringio() |
|
1509 | 1509 | >>> for c in reversedhunks: |
|
1510 | 1510 | ... c.write(fp) |
|
1511 | 1511 | >>> fp.seek(0) or None |
|
1512 | 1512 | >>> reversedpatch = fp.read() |
|
1513 | 1513 | >>> print(pycompat.sysstr(reversedpatch)) |
|
1514 | 1514 | diff --git a/folder1/g b/folder1/g |
|
1515 | 1515 | --- a/folder1/g |
|
1516 | 1516 | +++ b/folder1/g |
|
1517 | 1517 | @@ -1,4 +1,3 @@ |
|
1518 | 1518 | -firstline |
|
1519 | 1519 | c |
|
1520 | 1520 | 1 |
|
1521 | 1521 | 2 |
|
1522 | 1522 | @@ -2,6 +1,6 @@ |
|
1523 | 1523 | c |
|
1524 | 1524 | 1 |
|
1525 | 1525 | 2 |
|
1526 | 1526 | - 3 |
|
1527 | 1527 | +4 |
|
1528 | 1528 | 5 |
|
1529 | 1529 | d |
|
1530 | 1530 | @@ -6,3 +5,2 @@ |
|
1531 | 1531 | 5 |
|
1532 | 1532 | d |
|
1533 | 1533 | -lastline |
|
1534 | 1534 | |
|
1535 | 1535 | ''' |
|
1536 | 1536 | |
|
1537 | 1537 | newhunks = [] |
|
1538 | 1538 | for c in hunks: |
|
1539 | 1539 | if util.safehasattr(c, 'reversehunk'): |
|
1540 | 1540 | c = c.reversehunk() |
|
1541 | 1541 | newhunks.append(c) |
|
1542 | 1542 | return newhunks |
|
1543 | 1543 | |
|
1544 | 1544 | def parsepatch(originalchunks, maxcontext=None): |
|
1545 | 1545 | """patch -> [] of headers -> [] of hunks |
|
1546 | 1546 | |
|
1547 | 1547 | If maxcontext is not None, trim context lines if necessary. |
|
1548 | 1548 | |
|
1549 | 1549 | >>> rawpatch = b'''diff --git a/folder1/g b/folder1/g |
|
1550 | 1550 | ... --- a/folder1/g |
|
1551 | 1551 | ... +++ b/folder1/g |
|
1552 | 1552 | ... @@ -1,8 +1,10 @@ |
|
1553 | 1553 | ... 1 |
|
1554 | 1554 | ... 2 |
|
1555 | 1555 | ... -3 |
|
1556 | 1556 | ... 4 |
|
1557 | 1557 | ... 5 |
|
1558 | 1558 | ... 6 |
|
1559 | 1559 | ... +6.1 |
|
1560 | 1560 | ... +6.2 |
|
1561 | 1561 | ... 7 |
|
1562 | 1562 | ... 8 |
|
1563 | 1563 | ... +9''' |
|
1564 | 1564 | >>> out = util.stringio() |
|
1565 | 1565 | >>> headers = parsepatch([rawpatch], maxcontext=1) |
|
1566 | 1566 | >>> for header in headers: |
|
1567 | 1567 | ... header.write(out) |
|
1568 | 1568 | ... for hunk in header.hunks: |
|
1569 | 1569 | ... hunk.write(out) |
|
1570 | 1570 | >>> print(pycompat.sysstr(out.getvalue())) |
|
1571 | 1571 | diff --git a/folder1/g b/folder1/g |
|
1572 | 1572 | --- a/folder1/g |
|
1573 | 1573 | +++ b/folder1/g |
|
1574 | 1574 | @@ -2,3 +2,2 @@ |
|
1575 | 1575 | 2 |
|
1576 | 1576 | -3 |
|
1577 | 1577 | 4 |
|
1578 | 1578 | @@ -6,2 +5,4 @@ |
|
1579 | 1579 | 6 |
|
1580 | 1580 | +6.1 |
|
1581 | 1581 | +6.2 |
|
1582 | 1582 | 7 |
|
1583 | 1583 | @@ -8,1 +9,2 @@ |
|
1584 | 1584 | 8 |
|
1585 | 1585 | +9 |
|
1586 | 1586 | """ |
|
1587 | 1587 | class parser(object): |
|
1588 | 1588 | """patch parsing state machine""" |
|
1589 | 1589 | def __init__(self): |
|
1590 | 1590 | self.fromline = 0 |
|
1591 | 1591 | self.toline = 0 |
|
1592 | 1592 | self.proc = '' |
|
1593 | 1593 | self.header = None |
|
1594 | 1594 | self.context = [] |
|
1595 | 1595 | self.before = [] |
|
1596 | 1596 | self.hunk = [] |
|
1597 | 1597 | self.headers = [] |
|
1598 | 1598 | |
|
1599 | 1599 | def addrange(self, limits): |
|
1600 | 1600 | fromstart, fromend, tostart, toend, proc = limits |
|
1601 | 1601 | self.fromline = int(fromstart) |
|
1602 | 1602 | self.toline = int(tostart) |
|
1603 | 1603 | self.proc = proc |
|
1604 | 1604 | |
|
1605 | 1605 | def addcontext(self, context): |
|
1606 | 1606 | if self.hunk: |
|
1607 | 1607 | h = recordhunk(self.header, self.fromline, self.toline, |
|
1608 | 1608 | self.proc, self.before, self.hunk, context, maxcontext) |
|
1609 | 1609 | self.header.hunks.append(h) |
|
1610 | 1610 | self.fromline += len(self.before) + h.removed |
|
1611 | 1611 | self.toline += len(self.before) + h.added |
|
1612 | 1612 | self.before = [] |
|
1613 | 1613 | self.hunk = [] |
|
1614 | 1614 | self.context = context |
|
1615 | 1615 | |
|
1616 | 1616 | def addhunk(self, hunk): |
|
1617 | 1617 | if self.context: |
|
1618 | 1618 | self.before = self.context |
|
1619 | 1619 | self.context = [] |
|
1620 | 1620 | self.hunk = hunk |
|
1621 | 1621 | |
|
1622 | 1622 | def newfile(self, hdr): |
|
1623 | 1623 | self.addcontext([]) |
|
1624 | 1624 | h = header(hdr) |
|
1625 | 1625 | self.headers.append(h) |
|
1626 | 1626 | self.header = h |
|
1627 | 1627 | |
|
1628 | 1628 | def addother(self, line): |
|
1629 | 1629 | pass # 'other' lines are ignored |
|
1630 | 1630 | |
|
1631 | 1631 | def finished(self): |
|
1632 | 1632 | self.addcontext([]) |
|
1633 | 1633 | return self.headers |
|
1634 | 1634 | |
|
1635 | 1635 | transitions = { |
|
1636 | 1636 | 'file': {'context': addcontext, |
|
1637 | 1637 | 'file': newfile, |
|
1638 | 1638 | 'hunk': addhunk, |
|
1639 | 1639 | 'range': addrange}, |
|
1640 | 1640 | 'context': {'file': newfile, |
|
1641 | 1641 | 'hunk': addhunk, |
|
1642 | 1642 | 'range': addrange, |
|
1643 | 1643 | 'other': addother}, |
|
1644 | 1644 | 'hunk': {'context': addcontext, |
|
1645 | 1645 | 'file': newfile, |
|
1646 | 1646 | 'range': addrange}, |
|
1647 | 1647 | 'range': {'context': addcontext, |
|
1648 | 1648 | 'hunk': addhunk}, |
|
1649 | 1649 | 'other': {'other': addother}, |
|
1650 | 1650 | } |
|
1651 | 1651 | |
|
1652 | 1652 | p = parser() |
|
1653 | 1653 | fp = stringio() |
|
1654 | 1654 | fp.write(''.join(originalchunks)) |
|
1655 | 1655 | fp.seek(0) |
|
1656 | 1656 | |
|
1657 | 1657 | state = 'context' |
|
1658 | 1658 | for newstate, data in scanpatch(fp): |
|
1659 | 1659 | try: |
|
1660 | 1660 | p.transitions[state][newstate](p, data) |
|
1661 | 1661 | except KeyError: |
|
1662 | 1662 | raise PatchError('unhandled transition: %s -> %s' % |
|
1663 | 1663 | (state, newstate)) |
|
1664 | 1664 | state = newstate |
|
1665 | 1665 | del fp |
|
1666 | 1666 | return p.finished() |
|
1667 | 1667 | |
|
1668 | 1668 | def pathtransform(path, strip, prefix): |
|
1669 | 1669 | '''turn a path from a patch into a path suitable for the repository |
|
1670 | 1670 | |
|
1671 | 1671 | prefix, if not empty, is expected to be normalized with a / at the end. |
|
1672 | 1672 | |
|
1673 | 1673 | Returns (stripped components, path in repository). |
|
1674 | 1674 | |
|
1675 | 1675 | >>> pathtransform(b'a/b/c', 0, b'') |
|
1676 | 1676 | ('', 'a/b/c') |
|
1677 | 1677 | >>> pathtransform(b' a/b/c ', 0, b'') |
|
1678 | 1678 | ('', ' a/b/c') |
|
1679 | 1679 | >>> pathtransform(b' a/b/c ', 2, b'') |
|
1680 | 1680 | ('a/b/', 'c') |
|
1681 | 1681 | >>> pathtransform(b'a/b/c', 0, b'd/e/') |
|
1682 | 1682 | ('', 'd/e/a/b/c') |
|
1683 | 1683 | >>> pathtransform(b' a//b/c ', 2, b'd/e/') |
|
1684 | 1684 | ('a//b/', 'd/e/c') |
|
1685 | 1685 | >>> pathtransform(b'a/b/c', 3, b'') |
|
1686 | 1686 | Traceback (most recent call last): |
|
1687 | 1687 | PatchError: unable to strip away 1 of 3 dirs from a/b/c |
|
1688 | 1688 | ''' |
|
1689 | 1689 | pathlen = len(path) |
|
1690 | 1690 | i = 0 |
|
1691 | 1691 | if strip == 0: |
|
1692 | 1692 | return '', prefix + path.rstrip() |
|
1693 | 1693 | count = strip |
|
1694 | 1694 | while count > 0: |
|
1695 | 1695 | i = path.find('/', i) |
|
1696 | 1696 | if i == -1: |
|
1697 | 1697 | raise PatchError(_("unable to strip away %d of %d dirs from %s") % |
|
1698 | 1698 | (count, strip, path)) |
|
1699 | 1699 | i += 1 |
|
1700 | 1700 | # consume '//' in the path |
|
1701 | 1701 | while i < pathlen - 1 and path[i:i + 1] == '/': |
|
1702 | 1702 | i += 1 |
|
1703 | 1703 | count -= 1 |
|
1704 | 1704 | return path[:i].lstrip(), prefix + path[i:].rstrip() |
|
1705 | 1705 | |
|
1706 | 1706 | def makepatchmeta(backend, afile_orig, bfile_orig, hunk, strip, prefix): |
|
1707 | 1707 | nulla = afile_orig == "/dev/null" |
|
1708 | 1708 | nullb = bfile_orig == "/dev/null" |
|
1709 | 1709 | create = nulla and hunk.starta == 0 and hunk.lena == 0 |
|
1710 | 1710 | remove = nullb and hunk.startb == 0 and hunk.lenb == 0 |
|
1711 | 1711 | abase, afile = pathtransform(afile_orig, strip, prefix) |
|
1712 | 1712 | gooda = not nulla and backend.exists(afile) |
|
1713 | 1713 | bbase, bfile = pathtransform(bfile_orig, strip, prefix) |
|
1714 | 1714 | if afile == bfile: |
|
1715 | 1715 | goodb = gooda |
|
1716 | 1716 | else: |
|
1717 | 1717 | goodb = not nullb and backend.exists(bfile) |
|
1718 | 1718 | missing = not goodb and not gooda and not create |
|
1719 | 1719 | |
|
1720 | 1720 | # some diff programs apparently produce patches where the afile is |
|
1721 | 1721 | # not /dev/null, but afile starts with bfile |
|
1722 | 1722 | abasedir = afile[:afile.rfind('/') + 1] |
|
1723 | 1723 | bbasedir = bfile[:bfile.rfind('/') + 1] |
|
1724 | 1724 | if (missing and abasedir == bbasedir and afile.startswith(bfile) |
|
1725 | 1725 | and hunk.starta == 0 and hunk.lena == 0): |
|
1726 | 1726 | create = True |
|
1727 | 1727 | missing = False |
|
1728 | 1728 | |
|
1729 | 1729 | # If afile is "a/b/foo" and bfile is "a/b/foo.orig" we assume the |
|
1730 | 1730 | # diff is between a file and its backup. In this case, the original |
|
1731 | 1731 | # file should be patched (see original mpatch code). |
|
1732 | 1732 | isbackup = (abase == bbase and bfile.startswith(afile)) |
|
1733 | 1733 | fname = None |
|
1734 | 1734 | if not missing: |
|
1735 | 1735 | if gooda and goodb: |
|
1736 | 1736 | if isbackup: |
|
1737 | 1737 | fname = afile |
|
1738 | 1738 | else: |
|
1739 | 1739 | fname = bfile |
|
1740 | 1740 | elif gooda: |
|
1741 | 1741 | fname = afile |
|
1742 | 1742 | |
|
1743 | 1743 | if not fname: |
|
1744 | 1744 | if not nullb: |
|
1745 | 1745 | if isbackup: |
|
1746 | 1746 | fname = afile |
|
1747 | 1747 | else: |
|
1748 | 1748 | fname = bfile |
|
1749 | 1749 | elif not nulla: |
|
1750 | 1750 | fname = afile |
|
1751 | 1751 | else: |
|
1752 | 1752 | raise PatchError(_("undefined source and destination files")) |
|
1753 | 1753 | |
|
1754 | 1754 | gp = patchmeta(fname) |
|
1755 | 1755 | if create: |
|
1756 | 1756 | gp.op = 'ADD' |
|
1757 | 1757 | elif remove: |
|
1758 | 1758 | gp.op = 'DELETE' |
|
1759 | 1759 | return gp |
|
1760 | 1760 | |
|
1761 | 1761 | def scanpatch(fp): |
|
1762 | 1762 | """like patch.iterhunks, but yield different events |
|
1763 | 1763 | |
|
1764 | 1764 | - ('file', [header_lines + fromfile + tofile]) |
|
1765 | 1765 | - ('context', [context_lines]) |
|
1766 | 1766 | - ('hunk', [hunk_lines]) |
|
1767 | 1767 | - ('range', (-start,len, +start,len, proc)) |
|
1768 | 1768 | """ |
|
1769 | 1769 | lines_re = re.compile(br'@@ -(\d+),(\d+) \+(\d+),(\d+) @@\s*(.*)') |
|
1770 | 1770 | lr = linereader(fp) |
|
1771 | 1771 | |
|
1772 | 1772 | def scanwhile(first, p): |
|
1773 | 1773 | """scan lr while predicate holds""" |
|
1774 | 1774 | lines = [first] |
|
1775 | 1775 | for line in iter(lr.readline, ''): |
|
1776 | 1776 | if p(line): |
|
1777 | 1777 | lines.append(line) |
|
1778 | 1778 | else: |
|
1779 | 1779 | lr.push(line) |
|
1780 | 1780 | break |
|
1781 | 1781 | return lines |
|
1782 | 1782 | |
|
1783 | 1783 | for line in iter(lr.readline, ''): |
|
1784 | 1784 | if line.startswith('diff --git a/') or line.startswith('diff -r '): |
|
1785 | 1785 | def notheader(line): |
|
1786 | 1786 | s = line.split(None, 1) |
|
1787 | 1787 | return not s or s[0] not in ('---', 'diff') |
|
1788 | 1788 | header = scanwhile(line, notheader) |
|
1789 | 1789 | fromfile = lr.readline() |
|
1790 | 1790 | if fromfile.startswith('---'): |
|
1791 | 1791 | tofile = lr.readline() |
|
1792 | 1792 | header += [fromfile, tofile] |
|
1793 | 1793 | else: |
|
1794 | 1794 | lr.push(fromfile) |
|
1795 | 1795 | yield 'file', header |
|
1796 | 1796 | elif line[0:1] == ' ': |
|
1797 | 1797 | yield 'context', scanwhile(line, lambda l: l[0] in ' \\') |
|
1798 | 1798 | elif line[0] in '-+': |
|
1799 | 1799 | yield 'hunk', scanwhile(line, lambda l: l[0] in '-+\\') |
|
1800 | 1800 | else: |
|
1801 | 1801 | m = lines_re.match(line) |
|
1802 | 1802 | if m: |
|
1803 | 1803 | yield 'range', m.groups() |
|
1804 | 1804 | else: |
|
1805 | 1805 | yield 'other', line |
|
1806 | 1806 | |
|
1807 | 1807 | def scangitpatch(lr, firstline): |
|
1808 | 1808 | """ |
|
1809 | 1809 | Git patches can emit: |
|
1810 | 1810 | - rename a to b |
|
1811 | 1811 | - change b |
|
1812 | 1812 | - copy a to c |
|
1813 | 1813 | - change c |
|
1814 | 1814 | |
|
1815 | 1815 | We cannot apply this sequence as-is, the renamed 'a' could not be |
|
1816 | 1816 | found for it would have been renamed already. And we cannot copy |
|
1817 | 1817 | from 'b' instead because 'b' would have been changed already. So |
|
1818 | 1818 | we scan the git patch for copy and rename commands so we can |
|
1819 | 1819 | perform the copies ahead of time. |
|
1820 | 1820 | """ |
|
1821 | 1821 | pos = 0 |
|
1822 | 1822 | try: |
|
1823 | 1823 | pos = lr.fp.tell() |
|
1824 | 1824 | fp = lr.fp |
|
1825 | 1825 | except IOError: |
|
1826 | 1826 | fp = stringio(lr.fp.read()) |
|
1827 | 1827 | gitlr = linereader(fp) |
|
1828 | 1828 | gitlr.push(firstline) |
|
1829 | 1829 | gitpatches = readgitpatch(gitlr) |
|
1830 | 1830 | fp.seek(pos) |
|
1831 | 1831 | return gitpatches |
|
1832 | 1832 | |
|
1833 | 1833 | def iterhunks(fp): |
|
1834 | 1834 | """Read a patch and yield the following events: |
|
1835 | 1835 | - ("file", afile, bfile, firsthunk): select a new target file. |
|
1836 | 1836 | - ("hunk", hunk): a new hunk is ready to be applied, follows a |
|
1837 | 1837 | "file" event. |
|
1838 | 1838 | - ("git", gitchanges): current diff is in git format, gitchanges |
|
1839 | 1839 | maps filenames to gitpatch records. Unique event. |
|
1840 | 1840 | """ |
|
1841 | 1841 | afile = "" |
|
1842 | 1842 | bfile = "" |
|
1843 | 1843 | state = None |
|
1844 | 1844 | hunknum = 0 |
|
1845 | 1845 | emitfile = newfile = False |
|
1846 | 1846 | gitpatches = None |
|
1847 | 1847 | |
|
1848 | 1848 | # our states |
|
1849 | 1849 | BFILE = 1 |
|
1850 | 1850 | context = None |
|
1851 | 1851 | lr = linereader(fp) |
|
1852 | 1852 | |
|
1853 | 1853 | for x in iter(lr.readline, ''): |
|
1854 | 1854 | if state == BFILE and ( |
|
1855 | 1855 | (not context and x[0] == '@') |
|
1856 | 1856 | or (context is not False and x.startswith('***************')) |
|
1857 | 1857 | or x.startswith('GIT binary patch')): |
|
1858 | 1858 | gp = None |
|
1859 | 1859 | if (gitpatches and |
|
1860 | 1860 | gitpatches[-1].ispatching(afile, bfile)): |
|
1861 | 1861 | gp = gitpatches.pop() |
|
1862 | 1862 | if x.startswith('GIT binary patch'): |
|
1863 | 1863 | h = binhunk(lr, gp.path) |
|
1864 | 1864 | else: |
|
1865 | 1865 | if context is None and x.startswith('***************'): |
|
1866 | 1866 | context = True |
|
1867 | 1867 | h = hunk(x, hunknum + 1, lr, context) |
|
1868 | 1868 | hunknum += 1 |
|
1869 | 1869 | if emitfile: |
|
1870 | 1870 | emitfile = False |
|
1871 | 1871 | yield 'file', (afile, bfile, h, gp and gp.copy() or None) |
|
1872 | 1872 | yield 'hunk', h |
|
1873 | 1873 | elif x.startswith('diff --git a/'): |
|
1874 | 1874 | m = gitre.match(x.rstrip(' \r\n')) |
|
1875 | 1875 | if not m: |
|
1876 | 1876 | continue |
|
1877 | 1877 | if gitpatches is None: |
|
1878 | 1878 | # scan whole input for git metadata |
|
1879 | 1879 | gitpatches = scangitpatch(lr, x) |
|
1880 | 1880 | yield 'git', [g.copy() for g in gitpatches |
|
1881 | 1881 | if g.op in ('COPY', 'RENAME')] |
|
1882 | 1882 | gitpatches.reverse() |
|
1883 | 1883 | afile = 'a/' + m.group(1) |
|
1884 | 1884 | bfile = 'b/' + m.group(2) |
|
1885 | 1885 | while gitpatches and not gitpatches[-1].ispatching(afile, bfile): |
|
1886 | 1886 | gp = gitpatches.pop() |
|
1887 | 1887 | yield 'file', ('a/' + gp.path, 'b/' + gp.path, None, gp.copy()) |
|
1888 | 1888 | if not gitpatches: |
|
1889 | 1889 | raise PatchError(_('failed to synchronize metadata for "%s"') |
|
1890 | 1890 | % afile[2:]) |
|
1891 | 1891 | gp = gitpatches[-1] |
|
1892 | 1892 | newfile = True |
|
1893 | 1893 | elif x.startswith('---'): |
|
1894 | 1894 | # check for a unified diff |
|
1895 | 1895 | l2 = lr.readline() |
|
1896 | 1896 | if not l2.startswith('+++'): |
|
1897 | 1897 | lr.push(l2) |
|
1898 | 1898 | continue |
|
1899 | 1899 | newfile = True |
|
1900 | 1900 | context = False |
|
1901 | 1901 | afile = parsefilename(x) |
|
1902 | 1902 | bfile = parsefilename(l2) |
|
1903 | 1903 | elif x.startswith('***'): |
|
1904 | 1904 | # check for a context diff |
|
1905 | 1905 | l2 = lr.readline() |
|
1906 | 1906 | if not l2.startswith('---'): |
|
1907 | 1907 | lr.push(l2) |
|
1908 | 1908 | continue |
|
1909 | 1909 | l3 = lr.readline() |
|
1910 | 1910 | lr.push(l3) |
|
1911 | 1911 | if not l3.startswith("***************"): |
|
1912 | 1912 | lr.push(l2) |
|
1913 | 1913 | continue |
|
1914 | 1914 | newfile = True |
|
1915 | 1915 | context = True |
|
1916 | 1916 | afile = parsefilename(x) |
|
1917 | 1917 | bfile = parsefilename(l2) |
|
1918 | 1918 | |
|
1919 | 1919 | if newfile: |
|
1920 | 1920 | newfile = False |
|
1921 | 1921 | emitfile = True |
|
1922 | 1922 | state = BFILE |
|
1923 | 1923 | hunknum = 0 |
|
1924 | 1924 | |
|
1925 | 1925 | while gitpatches: |
|
1926 | 1926 | gp = gitpatches.pop() |
|
1927 | 1927 | yield 'file', ('a/' + gp.path, 'b/' + gp.path, None, gp.copy()) |
|
1928 | 1928 | |
|
1929 | 1929 | def applybindelta(binchunk, data): |
|
1930 | 1930 | """Apply a binary delta hunk |
|
1931 | 1931 | The algorithm used is the algorithm from git's patch-delta.c |
|
1932 | 1932 | """ |
|
1933 | 1933 | def deltahead(binchunk): |
|
1934 | 1934 | i = 0 |
|
1935 | 1935 | for c in binchunk: |
|
1936 | 1936 | i += 1 |
|
1937 | 1937 | if not (ord(c) & 0x80): |
|
1938 | 1938 | return i |
|
1939 | 1939 | return i |
|
1940 | 1940 | out = "" |
|
1941 | 1941 | s = deltahead(binchunk) |
|
1942 | 1942 | binchunk = binchunk[s:] |
|
1943 | 1943 | s = deltahead(binchunk) |
|
1944 | 1944 | binchunk = binchunk[s:] |
|
1945 | 1945 | i = 0 |
|
1946 | 1946 | while i < len(binchunk): |
|
1947 | 1947 | cmd = ord(binchunk[i]) |
|
1948 | 1948 | i += 1 |
|
1949 | 1949 | if (cmd & 0x80): |
|
1950 | 1950 | offset = 0 |
|
1951 | 1951 | size = 0 |
|
1952 | 1952 | if (cmd & 0x01): |
|
1953 | 1953 | offset = ord(binchunk[i]) |
|
1954 | 1954 | i += 1 |
|
1955 | 1955 | if (cmd & 0x02): |
|
1956 | 1956 | offset |= ord(binchunk[i]) << 8 |
|
1957 | 1957 | i += 1 |
|
1958 | 1958 | if (cmd & 0x04): |
|
1959 | 1959 | offset |= ord(binchunk[i]) << 16 |
|
1960 | 1960 | i += 1 |
|
1961 | 1961 | if (cmd & 0x08): |
|
1962 | 1962 | offset |= ord(binchunk[i]) << 24 |
|
1963 | 1963 | i += 1 |
|
1964 | 1964 | if (cmd & 0x10): |
|
1965 | 1965 | size = ord(binchunk[i]) |
|
1966 | 1966 | i += 1 |
|
1967 | 1967 | if (cmd & 0x20): |
|
1968 | 1968 | size |= ord(binchunk[i]) << 8 |
|
1969 | 1969 | i += 1 |
|
1970 | 1970 | if (cmd & 0x40): |
|
1971 | 1971 | size |= ord(binchunk[i]) << 16 |
|
1972 | 1972 | i += 1 |
|
1973 | 1973 | if size == 0: |
|
1974 | 1974 | size = 0x10000 |
|
1975 | 1975 | offset_end = offset + size |
|
1976 | 1976 | out += data[offset:offset_end] |
|
1977 | 1977 | elif cmd != 0: |
|
1978 | 1978 | offset_end = i + cmd |
|
1979 | 1979 | out += binchunk[i:offset_end] |
|
1980 | 1980 | i += cmd |
|
1981 | 1981 | else: |
|
1982 | 1982 | raise PatchError(_('unexpected delta opcode 0')) |
|
1983 | 1983 | return out |
|
1984 | 1984 | |
|
1985 | 1985 | def applydiff(ui, fp, backend, store, strip=1, prefix='', eolmode='strict'): |
|
1986 | 1986 | """Reads a patch from fp and tries to apply it. |
|
1987 | 1987 | |
|
1988 | 1988 | Returns 0 for a clean patch, -1 if any rejects were found and 1 if |
|
1989 | 1989 | there was any fuzz. |
|
1990 | 1990 | |
|
1991 | 1991 | If 'eolmode' is 'strict', the patch content and patched file are |
|
1992 | 1992 | read in binary mode. Otherwise, line endings are ignored when |
|
1993 | 1993 | patching then normalized according to 'eolmode'. |
|
1994 | 1994 | """ |
|
1995 | 1995 | return _applydiff(ui, fp, patchfile, backend, store, strip=strip, |
|
1996 | 1996 | prefix=prefix, eolmode=eolmode) |
|
1997 | 1997 | |
|
1998 | 1998 | def _canonprefix(repo, prefix): |
|
1999 | 1999 | if prefix: |
|
2000 | 2000 | prefix = pathutil.canonpath(repo.root, repo.getcwd(), prefix) |
|
2001 | 2001 | if prefix != '': |
|
2002 | 2002 | prefix += '/' |
|
2003 | 2003 | return prefix |
|
2004 | 2004 | |
|
2005 | 2005 | def _applydiff(ui, fp, patcher, backend, store, strip=1, prefix='', |
|
2006 | 2006 | eolmode='strict'): |
|
2007 | 2007 | prefix = _canonprefix(backend.repo, prefix) |
|
2008 | 2008 | def pstrip(p): |
|
2009 | 2009 | return pathtransform(p, strip - 1, prefix)[1] |
|
2010 | 2010 | |
|
2011 | 2011 | rejects = 0 |
|
2012 | 2012 | err = 0 |
|
2013 | 2013 | current_file = None |
|
2014 | 2014 | |
|
2015 | 2015 | for state, values in iterhunks(fp): |
|
2016 | 2016 | if state == 'hunk': |
|
2017 | 2017 | if not current_file: |
|
2018 | 2018 | continue |
|
2019 | 2019 | ret = current_file.apply(values) |
|
2020 | 2020 | if ret > 0: |
|
2021 | 2021 | err = 1 |
|
2022 | 2022 | elif state == 'file': |
|
2023 | 2023 | if current_file: |
|
2024 | 2024 | rejects += current_file.close() |
|
2025 | 2025 | current_file = None |
|
2026 | 2026 | afile, bfile, first_hunk, gp = values |
|
2027 | 2027 | if gp: |
|
2028 | 2028 | gp.path = pstrip(gp.path) |
|
2029 | 2029 | if gp.oldpath: |
|
2030 | 2030 | gp.oldpath = pstrip(gp.oldpath) |
|
2031 | 2031 | else: |
|
2032 | 2032 | gp = makepatchmeta(backend, afile, bfile, first_hunk, strip, |
|
2033 | 2033 | prefix) |
|
2034 | 2034 | if gp.op == 'RENAME': |
|
2035 | 2035 | backend.unlink(gp.oldpath) |
|
2036 | 2036 | if not first_hunk: |
|
2037 | 2037 | if gp.op == 'DELETE': |
|
2038 | 2038 | backend.unlink(gp.path) |
|
2039 | 2039 | continue |
|
2040 | 2040 | data, mode = None, None |
|
2041 | 2041 | if gp.op in ('RENAME', 'COPY'): |
|
2042 | 2042 | data, mode = store.getfile(gp.oldpath)[:2] |
|
2043 | 2043 | if data is None: |
|
2044 | 2044 | # This means that the old path does not exist |
|
2045 | 2045 | raise PatchError(_("source file '%s' does not exist") |
|
2046 | 2046 | % gp.oldpath) |
|
2047 | 2047 | if gp.mode: |
|
2048 | 2048 | mode = gp.mode |
|
2049 | 2049 | if gp.op == 'ADD': |
|
2050 | 2050 | # Added files without content have no hunk and |
|
2051 | 2051 | # must be created |
|
2052 | 2052 | data = '' |
|
2053 | 2053 | if data or mode: |
|
2054 | 2054 | if (gp.op in ('ADD', 'RENAME', 'COPY') |
|
2055 | 2055 | and backend.exists(gp.path)): |
|
2056 | 2056 | raise PatchError(_("cannot create %s: destination " |
|
2057 | 2057 | "already exists") % gp.path) |
|
2058 | 2058 | backend.setfile(gp.path, data, mode, gp.oldpath) |
|
2059 | 2059 | continue |
|
2060 | 2060 | try: |
|
2061 | 2061 | current_file = patcher(ui, gp, backend, store, |
|
2062 | 2062 | eolmode=eolmode) |
|
2063 | 2063 | except PatchError as inst: |
|
2064 | 2064 | ui.warn(str(inst) + '\n') |
|
2065 | 2065 | current_file = None |
|
2066 | 2066 | rejects += 1 |
|
2067 | 2067 | continue |
|
2068 | 2068 | elif state == 'git': |
|
2069 | 2069 | for gp in values: |
|
2070 | 2070 | path = pstrip(gp.oldpath) |
|
2071 | 2071 | data, mode = backend.getfile(path) |
|
2072 | 2072 | if data is None: |
|
2073 | 2073 | # The error ignored here will trigger a getfile() |
|
2074 | 2074 | # error in a place more appropriate for error |
|
2075 | 2075 | # handling, and will not interrupt the patching |
|
2076 | 2076 | # process. |
|
2077 | 2077 | pass |
|
2078 | 2078 | else: |
|
2079 | 2079 | store.setfile(path, data, mode) |
|
2080 | 2080 | else: |
|
2081 | 2081 | raise error.Abort(_('unsupported parser state: %s') % state) |
|
2082 | 2082 | |
|
2083 | 2083 | if current_file: |
|
2084 | 2084 | rejects += current_file.close() |
|
2085 | 2085 | |
|
2086 | 2086 | if rejects: |
|
2087 | 2087 | return -1 |
|
2088 | 2088 | return err |
|
2089 | 2089 | |
|
2090 | 2090 | def _externalpatch(ui, repo, patcher, patchname, strip, files, |
|
2091 | 2091 | similarity): |
|
2092 | 2092 | """use <patcher> to apply <patchname> to the working directory. |
|
2093 | 2093 | returns whether patch was applied with fuzz factor.""" |
|
2094 | 2094 | |
|
2095 | 2095 | fuzz = False |
|
2096 | 2096 | args = [] |
|
2097 | 2097 | cwd = repo.root |
|
2098 | 2098 | if cwd: |
|
2099 | 2099 | args.append('-d %s' % util.shellquote(cwd)) |
|
2100 | 2100 | fp = util.popen('%s %s -p%d < %s' % (patcher, ' '.join(args), strip, |
|
2101 | 2101 | util.shellquote(patchname))) |
|
2102 | 2102 | try: |
|
2103 | 2103 | for line in util.iterfile(fp): |
|
2104 | 2104 | line = line.rstrip() |
|
2105 | 2105 | ui.note(line + '\n') |
|
2106 | 2106 | if line.startswith('patching file '): |
|
2107 | 2107 | pf = util.parsepatchoutput(line) |
|
2108 | 2108 | printed_file = False |
|
2109 | 2109 | files.add(pf) |
|
2110 | 2110 | elif line.find('with fuzz') >= 0: |
|
2111 | 2111 | fuzz = True |
|
2112 | 2112 | if not printed_file: |
|
2113 | 2113 | ui.warn(pf + '\n') |
|
2114 | 2114 | printed_file = True |
|
2115 | 2115 | ui.warn(line + '\n') |
|
2116 | 2116 | elif line.find('saving rejects to file') >= 0: |
|
2117 | 2117 | ui.warn(line + '\n') |
|
2118 | 2118 | elif line.find('FAILED') >= 0: |
|
2119 | 2119 | if not printed_file: |
|
2120 | 2120 | ui.warn(pf + '\n') |
|
2121 | 2121 | printed_file = True |
|
2122 | 2122 | ui.warn(line + '\n') |
|
2123 | 2123 | finally: |
|
2124 | 2124 | if files: |
|
2125 | 2125 | scmutil.marktouched(repo, files, similarity) |
|
2126 | 2126 | code = fp.close() |
|
2127 | 2127 | if code: |
|
2128 | 2128 | raise PatchError(_("patch command failed: %s") % |
|
2129 | 2129 | util.explainexit(code)[0]) |
|
2130 | 2130 | return fuzz |
|
2131 | 2131 | |
|
2132 | 2132 | def patchbackend(ui, backend, patchobj, strip, prefix, files=None, |
|
2133 | 2133 | eolmode='strict'): |
|
2134 | 2134 | if files is None: |
|
2135 | 2135 | files = set() |
|
2136 | 2136 | if eolmode is None: |
|
2137 | 2137 | eolmode = ui.config('patch', 'eol') |
|
2138 | 2138 | if eolmode.lower() not in eolmodes: |
|
2139 | 2139 | raise error.Abort(_('unsupported line endings type: %s') % eolmode) |
|
2140 | 2140 | eolmode = eolmode.lower() |
|
2141 | 2141 | |
|
2142 | 2142 | store = filestore() |
|
2143 | 2143 | try: |
|
2144 | 2144 | fp = open(patchobj, 'rb') |
|
2145 | 2145 | except TypeError: |
|
2146 | 2146 | fp = patchobj |
|
2147 | 2147 | try: |
|
2148 | 2148 | ret = applydiff(ui, fp, backend, store, strip=strip, prefix=prefix, |
|
2149 | 2149 | eolmode=eolmode) |
|
2150 | 2150 | finally: |
|
2151 | 2151 | if fp != patchobj: |
|
2152 | 2152 | fp.close() |
|
2153 | 2153 | files.update(backend.close()) |
|
2154 | 2154 | store.close() |
|
2155 | 2155 | if ret < 0: |
|
2156 | 2156 | raise PatchError(_('patch failed to apply')) |
|
2157 | 2157 | return ret > 0 |
|
2158 | 2158 | |
|
2159 | 2159 | def internalpatch(ui, repo, patchobj, strip, prefix='', files=None, |
|
2160 | 2160 | eolmode='strict', similarity=0): |
|
2161 | 2161 | """use builtin patch to apply <patchobj> to the working directory. |
|
2162 | 2162 | returns whether patch was applied with fuzz factor.""" |
|
2163 | 2163 | backend = workingbackend(ui, repo, similarity) |
|
2164 | 2164 | return patchbackend(ui, backend, patchobj, strip, prefix, files, eolmode) |
|
2165 | 2165 | |
|
2166 | 2166 | def patchrepo(ui, repo, ctx, store, patchobj, strip, prefix, files=None, |
|
2167 | 2167 | eolmode='strict'): |
|
2168 | 2168 | backend = repobackend(ui, repo, ctx, store) |
|
2169 | 2169 | return patchbackend(ui, backend, patchobj, strip, prefix, files, eolmode) |
|
2170 | 2170 | |
|
2171 | 2171 | def patch(ui, repo, patchname, strip=1, prefix='', files=None, eolmode='strict', |
|
2172 | 2172 | similarity=0): |
|
2173 | 2173 | """Apply <patchname> to the working directory. |
|
2174 | 2174 | |
|
2175 | 2175 | 'eolmode' specifies how end of lines should be handled. It can be: |
|
2176 | 2176 | - 'strict': inputs are read in binary mode, EOLs are preserved |
|
2177 | 2177 | - 'crlf': EOLs are ignored when patching and reset to CRLF |
|
2178 | 2178 | - 'lf': EOLs are ignored when patching and reset to LF |
|
2179 | 2179 | - None: get it from user settings, default to 'strict' |
|
2180 | 2180 | 'eolmode' is ignored when using an external patcher program. |
|
2181 | 2181 | |
|
2182 | 2182 | Returns whether patch was applied with fuzz factor. |
|
2183 | 2183 | """ |
|
2184 | 2184 | patcher = ui.config('ui', 'patch') |
|
2185 | 2185 | if files is None: |
|
2186 | 2186 | files = set() |
|
2187 | 2187 | if patcher: |
|
2188 | 2188 | return _externalpatch(ui, repo, patcher, patchname, strip, |
|
2189 | 2189 | files, similarity) |
|
2190 | 2190 | return internalpatch(ui, repo, patchname, strip, prefix, files, eolmode, |
|
2191 | 2191 | similarity) |
|
2192 | 2192 | |
|
2193 | 2193 | def changedfiles(ui, repo, patchpath, strip=1, prefix=''): |
|
2194 | 2194 | backend = fsbackend(ui, repo.root) |
|
2195 | 2195 | prefix = _canonprefix(repo, prefix) |
|
2196 | 2196 | with open(patchpath, 'rb') as fp: |
|
2197 | 2197 | changed = set() |
|
2198 | 2198 | for state, values in iterhunks(fp): |
|
2199 | 2199 | if state == 'file': |
|
2200 | 2200 | afile, bfile, first_hunk, gp = values |
|
2201 | 2201 | if gp: |
|
2202 | 2202 | gp.path = pathtransform(gp.path, strip - 1, prefix)[1] |
|
2203 | 2203 | if gp.oldpath: |
|
2204 | 2204 | gp.oldpath = pathtransform(gp.oldpath, strip - 1, |
|
2205 | 2205 | prefix)[1] |
|
2206 | 2206 | else: |
|
2207 | 2207 | gp = makepatchmeta(backend, afile, bfile, first_hunk, strip, |
|
2208 | 2208 | prefix) |
|
2209 | 2209 | changed.add(gp.path) |
|
2210 | 2210 | if gp.op == 'RENAME': |
|
2211 | 2211 | changed.add(gp.oldpath) |
|
2212 | 2212 | elif state not in ('hunk', 'git'): |
|
2213 | 2213 | raise error.Abort(_('unsupported parser state: %s') % state) |
|
2214 | 2214 | return changed |
|
2215 | 2215 | |
|
2216 | 2216 | class GitDiffRequired(Exception): |
|
2217 | 2217 | pass |
|
2218 | 2218 | |
|
2219 | 2219 | def diffallopts(ui, opts=None, untrusted=False, section='diff'): |
|
2220 | 2220 | '''return diffopts with all features supported and parsed''' |
|
2221 | 2221 | return difffeatureopts(ui, opts=opts, untrusted=untrusted, section=section, |
|
2222 | 2222 | git=True, whitespace=True, formatchanging=True) |
|
2223 | 2223 | |
|
2224 | 2224 | diffopts = diffallopts |
|
2225 | 2225 | |
|
2226 | 2226 | def difffeatureopts(ui, opts=None, untrusted=False, section='diff', git=False, |
|
2227 | 2227 | whitespace=False, formatchanging=False): |
|
2228 | 2228 | '''return diffopts with only opted-in features parsed |
|
2229 | 2229 | |
|
2230 | 2230 | Features: |
|
2231 | 2231 | - git: git-style diffs |
|
2232 | 2232 | - whitespace: whitespace options like ignoreblanklines and ignorews |
|
2233 | 2233 | - formatchanging: options that will likely break or cause correctness issues |
|
2234 | 2234 | with most diff parsers |
|
2235 | 2235 | ''' |
|
2236 | 2236 | def get(key, name=None, getter=ui.configbool, forceplain=None): |
|
2237 | 2237 | if opts: |
|
2238 | 2238 | v = opts.get(key) |
|
2239 | 2239 | # diffopts flags are either None-default (which is passed |
|
2240 | 2240 | # through unchanged, so we can identify unset values), or |
|
2241 | 2241 | # some other falsey default (eg --unified, which defaults |
|
2242 | 2242 | # to an empty string). We only want to override the config |
|
2243 | 2243 | # entries from hgrc with command line values if they |
|
2244 | 2244 | # appear to have been set, which is any truthy value, |
|
2245 | 2245 | # True, or False. |
|
2246 | 2246 | if v or isinstance(v, bool): |
|
2247 | 2247 | return v |
|
2248 | 2248 | if forceplain is not None and ui.plain(): |
|
2249 | 2249 | return forceplain |
|
2250 | 2250 | return getter(section, name or key, untrusted=untrusted) |
|
2251 | 2251 | |
|
2252 | 2252 | # core options, expected to be understood by every diff parser |
|
2253 | 2253 | buildopts = { |
|
2254 | 2254 | 'nodates': get('nodates'), |
|
2255 | 2255 | 'showfunc': get('show_function', 'showfunc'), |
|
2256 | 2256 | 'context': get('unified', getter=ui.config), |
|
2257 | 2257 | } |
|
2258 | 2258 | buildopts['worddiff'] = ui.configbool('experimental', 'worddiff') |
|
2259 | 2259 | |
|
2260 | 2260 | if git: |
|
2261 | 2261 | buildopts['git'] = get('git') |
|
2262 | 2262 | |
|
2263 | 2263 | # since this is in the experimental section, we need to call |
|
2264 | 2264 | # ui.configbool directory |
|
2265 | 2265 | buildopts['showsimilarity'] = ui.configbool('experimental', |
|
2266 | 2266 | 'extendedheader.similarity') |
|
2267 | 2267 | |
|
2268 | 2268 | # need to inspect the ui object instead of using get() since we want to |
|
2269 | 2269 | # test for an int |
|
2270 | 2270 | hconf = ui.config('experimental', 'extendedheader.index') |
|
2271 | 2271 | if hconf is not None: |
|
2272 | 2272 | hlen = None |
|
2273 | 2273 | try: |
|
2274 | 2274 | # the hash config could be an integer (for length of hash) or a |
|
2275 | 2275 | # word (e.g. short, full, none) |
|
2276 | 2276 | hlen = int(hconf) |
|
2277 | 2277 | if hlen < 0 or hlen > 40: |
|
2278 | 2278 | msg = _("invalid length for extendedheader.index: '%d'\n") |
|
2279 | 2279 | ui.warn(msg % hlen) |
|
2280 | 2280 | except ValueError: |
|
2281 | 2281 | # default value |
|
2282 | 2282 | if hconf == 'short' or hconf == '': |
|
2283 | 2283 | hlen = 12 |
|
2284 | 2284 | elif hconf == 'full': |
|
2285 | 2285 | hlen = 40 |
|
2286 | 2286 | elif hconf != 'none': |
|
2287 | 2287 | msg = _("invalid value for extendedheader.index: '%s'\n") |
|
2288 | 2288 | ui.warn(msg % hconf) |
|
2289 | 2289 | finally: |
|
2290 | 2290 | buildopts['index'] = hlen |
|
2291 | 2291 | |
|
2292 | 2292 | if whitespace: |
|
2293 | 2293 | buildopts['ignorews'] = get('ignore_all_space', 'ignorews') |
|
2294 | 2294 | buildopts['ignorewsamount'] = get('ignore_space_change', |
|
2295 | 2295 | 'ignorewsamount') |
|
2296 | 2296 | buildopts['ignoreblanklines'] = get('ignore_blank_lines', |
|
2297 | 2297 | 'ignoreblanklines') |
|
2298 | 2298 | buildopts['ignorewseol'] = get('ignore_space_at_eol', 'ignorewseol') |
|
2299 | 2299 | if formatchanging: |
|
2300 | 2300 | buildopts['text'] = opts and opts.get('text') |
|
2301 | 2301 | binary = None if opts is None else opts.get('binary') |
|
2302 | 2302 | buildopts['nobinary'] = (not binary if binary is not None |
|
2303 | 2303 | else get('nobinary', forceplain=False)) |
|
2304 | 2304 | buildopts['noprefix'] = get('noprefix', forceplain=False) |
|
2305 | 2305 | |
|
2306 | 2306 | return mdiff.diffopts(**pycompat.strkwargs(buildopts)) |
|
2307 | 2307 | |
|
2308 | 2308 | def diff(repo, node1=None, node2=None, match=None, changes=None, |
|
2309 | 2309 | opts=None, losedatafn=None, prefix='', relroot='', copy=None, |
|
2310 | 2310 | hunksfilterfn=None): |
|
2311 | 2311 | '''yields diff of changes to files between two nodes, or node and |
|
2312 | 2312 | working directory. |
|
2313 | 2313 | |
|
2314 | 2314 | if node1 is None, use first dirstate parent instead. |
|
2315 | 2315 | if node2 is None, compare node1 with working directory. |
|
2316 | 2316 | |
|
2317 | 2317 | losedatafn(**kwarg) is a callable run when opts.upgrade=True and |
|
2318 | 2318 | every time some change cannot be represented with the current |
|
2319 | 2319 | patch format. Return False to upgrade to git patch format, True to |
|
2320 | 2320 | accept the loss or raise an exception to abort the diff. It is |
|
2321 | 2321 | called with the name of current file being diffed as 'fn'. If set |
|
2322 | 2322 | to None, patches will always be upgraded to git format when |
|
2323 | 2323 | necessary. |
|
2324 | 2324 | |
|
2325 | 2325 | prefix is a filename prefix that is prepended to all filenames on |
|
2326 | 2326 | display (used for subrepos). |
|
2327 | 2327 | |
|
2328 | 2328 | relroot, if not empty, must be normalized with a trailing /. Any match |
|
2329 | 2329 | patterns that fall outside it will be ignored. |
|
2330 | 2330 | |
|
2331 | 2331 | copy, if not empty, should contain mappings {dst@y: src@x} of copy |
|
2332 | 2332 | information. |
|
2333 | 2333 | |
|
2334 | 2334 | hunksfilterfn, if not None, should be a function taking a filectx and |
|
2335 | 2335 | hunks generator that may yield filtered hunks. |
|
2336 | 2336 | ''' |
|
2337 | 2337 | for fctx1, fctx2, hdr, hunks in diffhunks( |
|
2338 | 2338 | repo, node1=node1, node2=node2, |
|
2339 | 2339 | match=match, changes=changes, opts=opts, |
|
2340 | 2340 | losedatafn=losedatafn, prefix=prefix, relroot=relroot, copy=copy, |
|
2341 | 2341 | ): |
|
2342 | 2342 | if hunksfilterfn is not None: |
|
2343 | 2343 | # If the file has been removed, fctx2 is None; but this should |
|
2344 | 2344 | # not occur here since we catch removed files early in |
|
2345 | 2345 | # logcmdutil.getlinerangerevs() for 'hg log -L'. |
|
2346 | 2346 | assert fctx2 is not None, \ |
|
2347 | 2347 | 'fctx2 unexpectly None in diff hunks filtering' |
|
2348 | 2348 | hunks = hunksfilterfn(fctx2, hunks) |
|
2349 | 2349 | text = ''.join(sum((list(hlines) for hrange, hlines in hunks), [])) |
|
2350 | 2350 | if hdr and (text or len(hdr) > 1): |
|
2351 | 2351 | yield '\n'.join(hdr) + '\n' |
|
2352 | 2352 | if text: |
|
2353 | 2353 | yield text |
|
2354 | 2354 | |
|
2355 | 2355 | def diffhunks(repo, node1=None, node2=None, match=None, changes=None, |
|
2356 | 2356 | opts=None, losedatafn=None, prefix='', relroot='', copy=None): |
|
2357 | 2357 | """Yield diff of changes to files in the form of (`header`, `hunks`) tuples |
|
2358 | 2358 | where `header` is a list of diff headers and `hunks` is an iterable of |
|
2359 | 2359 | (`hunkrange`, `hunklines`) tuples. |
|
2360 | 2360 | |
|
2361 | 2361 | See diff() for the meaning of parameters. |
|
2362 | 2362 | """ |
|
2363 | 2363 | |
|
2364 | 2364 | if opts is None: |
|
2365 | 2365 | opts = mdiff.defaultopts |
|
2366 | 2366 | |
|
2367 | 2367 | if not node1 and not node2: |
|
2368 | 2368 | node1 = repo.dirstate.p1() |
|
2369 | 2369 | |
|
2370 | 2370 | def lrugetfilectx(): |
|
2371 | 2371 | cache = {} |
|
2372 | 2372 | order = collections.deque() |
|
2373 | 2373 | def getfilectx(f, ctx): |
|
2374 | 2374 | fctx = ctx.filectx(f, filelog=cache.get(f)) |
|
2375 | 2375 | if f not in cache: |
|
2376 | 2376 | if len(cache) > 20: |
|
2377 | 2377 | del cache[order.popleft()] |
|
2378 | 2378 | cache[f] = fctx.filelog() |
|
2379 | 2379 | else: |
|
2380 | 2380 | order.remove(f) |
|
2381 | 2381 | order.append(f) |
|
2382 | 2382 | return fctx |
|
2383 | 2383 | return getfilectx |
|
2384 | 2384 | getfilectx = lrugetfilectx() |
|
2385 | 2385 | |
|
2386 | 2386 | ctx1 = repo[node1] |
|
2387 | 2387 | ctx2 = repo[node2] |
|
2388 | 2388 | |
|
2389 | 2389 | relfiltered = False |
|
2390 | 2390 | if relroot != '' and match.always(): |
|
2391 | 2391 | # as a special case, create a new matcher with just the relroot |
|
2392 | 2392 | pats = [relroot] |
|
2393 | 2393 | match = scmutil.match(ctx2, pats, default='path') |
|
2394 | 2394 | relfiltered = True |
|
2395 | 2395 | |
|
2396 | 2396 | if not changes: |
|
2397 | 2397 | changes = repo.status(ctx1, ctx2, match=match) |
|
2398 | 2398 | modified, added, removed = changes[:3] |
|
2399 | 2399 | |
|
2400 | 2400 | if not modified and not added and not removed: |
|
2401 | 2401 | return [] |
|
2402 | 2402 | |
|
2403 | 2403 | if repo.ui.debugflag: |
|
2404 | 2404 | hexfunc = hex |
|
2405 | 2405 | else: |
|
2406 | 2406 | hexfunc = short |
|
2407 | 2407 | revs = [hexfunc(node) for node in [ctx1.node(), ctx2.node()] if node] |
|
2408 | 2408 | |
|
2409 | 2409 | if copy is None: |
|
2410 | 2410 | copy = {} |
|
2411 | 2411 | if opts.git or opts.upgrade: |
|
2412 | 2412 | copy = copies.pathcopies(ctx1, ctx2, match=match) |
|
2413 | 2413 | |
|
2414 | 2414 | if relroot is not None: |
|
2415 | 2415 | if not relfiltered: |
|
2416 | 2416 | # XXX this would ideally be done in the matcher, but that is |
|
2417 | 2417 | # generally meant to 'or' patterns, not 'and' them. In this case we |
|
2418 | 2418 | # need to 'and' all the patterns from the matcher with relroot. |
|
2419 | 2419 | def filterrel(l): |
|
2420 | 2420 | return [f for f in l if f.startswith(relroot)] |
|
2421 | 2421 | modified = filterrel(modified) |
|
2422 | 2422 | added = filterrel(added) |
|
2423 | 2423 | removed = filterrel(removed) |
|
2424 | 2424 | relfiltered = True |
|
2425 | 2425 | # filter out copies where either side isn't inside the relative root |
|
2426 | 2426 | copy = dict(((dst, src) for (dst, src) in copy.iteritems() |
|
2427 | 2427 | if dst.startswith(relroot) |
|
2428 | 2428 | and src.startswith(relroot))) |
|
2429 | 2429 | |
|
2430 | 2430 | modifiedset = set(modified) |
|
2431 | 2431 | addedset = set(added) |
|
2432 | 2432 | removedset = set(removed) |
|
2433 | 2433 | for f in modified: |
|
2434 | 2434 | if f not in ctx1: |
|
2435 | 2435 | # Fix up added, since merged-in additions appear as |
|
2436 | 2436 | # modifications during merges |
|
2437 | 2437 | modifiedset.remove(f) |
|
2438 | 2438 | addedset.add(f) |
|
2439 | 2439 | for f in removed: |
|
2440 | 2440 | if f not in ctx1: |
|
2441 | 2441 | # Merged-in additions that are then removed are reported as removed. |
|
2442 | 2442 | # They are not in ctx1, so We don't want to show them in the diff. |
|
2443 | 2443 | removedset.remove(f) |
|
2444 | 2444 | modified = sorted(modifiedset) |
|
2445 | 2445 | added = sorted(addedset) |
|
2446 | 2446 | removed = sorted(removedset) |
|
2447 | 2447 | for dst, src in list(copy.items()): |
|
2448 | 2448 | if src not in ctx1: |
|
2449 | 2449 | # Files merged in during a merge and then copied/renamed are |
|
2450 | 2450 | # reported as copies. We want to show them in the diff as additions. |
|
2451 | 2451 | del copy[dst] |
|
2452 | 2452 | |
|
2453 | 2453 | def difffn(opts, losedata): |
|
2454 | 2454 | return trydiff(repo, revs, ctx1, ctx2, modified, added, removed, |
|
2455 | 2455 | copy, getfilectx, opts, losedata, prefix, relroot) |
|
2456 | 2456 | if opts.upgrade and not opts.git: |
|
2457 | 2457 | try: |
|
2458 | 2458 | def losedata(fn): |
|
2459 | 2459 | if not losedatafn or not losedatafn(fn=fn): |
|
2460 | 2460 | raise GitDiffRequired |
|
2461 | 2461 | # Buffer the whole output until we are sure it can be generated |
|
2462 | 2462 | return list(difffn(opts.copy(git=False), losedata)) |
|
2463 | 2463 | except GitDiffRequired: |
|
2464 | 2464 | return difffn(opts.copy(git=True), None) |
|
2465 | 2465 | else: |
|
2466 | 2466 | return difffn(opts, None) |
|
2467 | 2467 | |
|
2468 | 2468 | def difflabel(func, *args, **kw): |
|
2469 | 2469 | '''yields 2-tuples of (output, label) based on the output of func()''' |
|
2470 | 2470 | inlinecolor = False |
|
2471 | 2471 | if kw.get(r'opts'): |
|
2472 | 2472 | inlinecolor = kw[r'opts'].worddiff |
|
2473 | 2473 | headprefixes = [('diff', 'diff.diffline'), |
|
2474 | 2474 | ('copy', 'diff.extended'), |
|
2475 | 2475 | ('rename', 'diff.extended'), |
|
2476 | 2476 | ('old', 'diff.extended'), |
|
2477 | 2477 | ('new', 'diff.extended'), |
|
2478 | 2478 | ('deleted', 'diff.extended'), |
|
2479 | 2479 | ('index', 'diff.extended'), |
|
2480 | 2480 | ('similarity', 'diff.extended'), |
|
2481 | 2481 | ('---', 'diff.file_a'), |
|
2482 | 2482 | ('+++', 'diff.file_b')] |
|
2483 | 2483 | textprefixes = [('@', 'diff.hunk'), |
|
2484 | 2484 | ('-', 'diff.deleted'), |
|
2485 | 2485 | ('+', 'diff.inserted')] |
|
2486 | 2486 | head = False |
|
2487 | 2487 | for chunk in func(*args, **kw): |
|
2488 | 2488 | lines = chunk.split('\n') |
|
2489 | 2489 | matches = {} |
|
2490 | 2490 | if inlinecolor: |
|
2491 | 2491 | matches = _findmatches(lines) |
|
2492 | 2492 | for i, line in enumerate(lines): |
|
2493 | 2493 | if i != 0: |
|
2494 | 2494 | yield ('\n', '') |
|
2495 | 2495 | if head: |
|
2496 | 2496 | if line.startswith('@'): |
|
2497 | 2497 | head = False |
|
2498 | 2498 | else: |
|
2499 | 2499 | if line and line[0] not in ' +-@\\': |
|
2500 | 2500 | head = True |
|
2501 | 2501 | stripline = line |
|
2502 | 2502 | diffline = False |
|
2503 | 2503 | if not head and line and line[0] in '+-': |
|
2504 | 2504 | # highlight tabs and trailing whitespace, but only in |
|
2505 | 2505 | # changed lines |
|
2506 | 2506 | stripline = line.rstrip() |
|
2507 | 2507 | diffline = True |
|
2508 | 2508 | |
|
2509 | 2509 | prefixes = textprefixes |
|
2510 | 2510 | if head: |
|
2511 | 2511 | prefixes = headprefixes |
|
2512 | 2512 | for prefix, label in prefixes: |
|
2513 | 2513 | if stripline.startswith(prefix): |
|
2514 | 2514 | if diffline: |
|
2515 | 2515 | if i in matches: |
|
2516 | 2516 | for t, l in _inlinediff(lines[i].rstrip(), |
|
2517 | 2517 | lines[matches[i]].rstrip(), |
|
2518 | 2518 | label): |
|
2519 | 2519 | yield (t, l) |
|
2520 | 2520 | else: |
|
2521 | 2521 | for token in tabsplitter.findall(stripline): |
|
2522 | 2522 | if '\t' == token[0]: |
|
2523 | 2523 | yield (token, 'diff.tab') |
|
2524 | 2524 | else: |
|
2525 | 2525 | yield (token, label) |
|
2526 | 2526 | else: |
|
2527 | 2527 | yield (stripline, label) |
|
2528 | 2528 | break |
|
2529 | 2529 | else: |
|
2530 | 2530 | yield (line, '') |
|
2531 | 2531 | if line != stripline: |
|
2532 | 2532 | yield (line[len(stripline):], 'diff.trailingwhitespace') |
|
2533 | 2533 | |
|
2534 | 2534 | def _findmatches(slist): |
|
2535 | 2535 | '''Look for insertion matches to deletion and returns a dict of |
|
2536 | 2536 | correspondences. |
|
2537 | 2537 | ''' |
|
2538 | 2538 | lastmatch = 0 |
|
2539 | 2539 | matches = {} |
|
2540 | 2540 | for i, line in enumerate(slist): |
|
2541 | 2541 | if line == '': |
|
2542 | 2542 | continue |
|
2543 | 2543 | if line[0] == '-': |
|
2544 | 2544 | lastmatch = max(lastmatch, i) |
|
2545 | 2545 | newgroup = False |
|
2546 | 2546 | for j, newline in enumerate(slist[lastmatch + 1:]): |
|
2547 | 2547 | if newline == '': |
|
2548 | 2548 | continue |
|
2549 | 2549 | if newline[0] == '-' and newgroup: # too far, no match |
|
2550 | 2550 | break |
|
2551 | 2551 | if newline[0] == '+': # potential match |
|
2552 | 2552 | newgroup = True |
|
2553 | 2553 | sim = difflib.SequenceMatcher(None, line, newline).ratio() |
|
2554 | 2554 | if sim > 0.7: |
|
2555 | 2555 | lastmatch = lastmatch + 1 + j |
|
2556 | 2556 | matches[i] = lastmatch |
|
2557 | 2557 | matches[lastmatch] = i |
|
2558 | 2558 | break |
|
2559 | 2559 | return matches |
|
2560 | 2560 | |
|
2561 | 2561 | def _inlinediff(s1, s2, operation): |
|
2562 | 2562 | '''Perform string diff to highlight specific changes.''' |
|
2563 | 2563 | operation_skip = '+?' if operation == 'diff.deleted' else '-?' |
|
2564 | 2564 | if operation == 'diff.deleted': |
|
2565 | 2565 | s2, s1 = s1, s2 |
|
2566 | 2566 | |
|
2567 | 2567 | buff = [] |
|
2568 | 2568 | # we never want to higlight the leading +- |
|
2569 | 2569 | if operation == 'diff.deleted' and s2.startswith('-'): |
|
2570 | 2570 | label = operation |
|
2571 | 2571 | token = '-' |
|
2572 | 2572 | s2 = s2[1:] |
|
2573 | 2573 | s1 = s1[1:] |
|
2574 | 2574 | elif operation == 'diff.inserted' and s1.startswith('+'): |
|
2575 | 2575 | label = operation |
|
2576 | 2576 | token = '+' |
|
2577 | 2577 | s2 = s2[1:] |
|
2578 | 2578 | s1 = s1[1:] |
|
2579 | 2579 | else: |
|
2580 | 2580 | raise error.ProgrammingError("Case not expected, operation = %s" % |
|
2581 | 2581 | operation) |
|
2582 | 2582 | |
|
2583 | 2583 | s = difflib.ndiff(_nonwordre.split(s2), _nonwordre.split(s1)) |
|
2584 | 2584 | for part in s: |
|
2585 | 2585 | if part[0] in operation_skip or len(part) == 2: |
|
2586 | 2586 | continue |
|
2587 | 2587 | l = operation + '.highlight' |
|
2588 | 2588 | if part[0] in ' ': |
|
2589 | 2589 | l = operation |
|
2590 | 2590 | if part[2:] == '\t': |
|
2591 | 2591 | l = 'diff.tab' |
|
2592 | 2592 | if l == label: # contiguous token with same label |
|
2593 | 2593 | token += part[2:] |
|
2594 | 2594 | continue |
|
2595 | 2595 | else: |
|
2596 | 2596 | buff.append((token, label)) |
|
2597 | 2597 | label = l |
|
2598 | 2598 | token = part[2:] |
|
2599 | 2599 | buff.append((token, label)) |
|
2600 | 2600 | |
|
2601 | 2601 | return buff |
|
2602 | 2602 | |
|
2603 | 2603 | def diffui(*args, **kw): |
|
2604 | 2604 | '''like diff(), but yields 2-tuples of (output, label) for ui.write()''' |
|
2605 | 2605 | return difflabel(diff, *args, **kw) |
|
2606 | 2606 | |
|
2607 | 2607 | def _filepairs(modified, added, removed, copy, opts): |
|
2608 | 2608 | '''generates tuples (f1, f2, copyop), where f1 is the name of the file |
|
2609 | 2609 | before and f2 is the the name after. For added files, f1 will be None, |
|
2610 | 2610 | and for removed files, f2 will be None. copyop may be set to None, 'copy' |
|
2611 | 2611 | or 'rename' (the latter two only if opts.git is set).''' |
|
2612 | 2612 | gone = set() |
|
2613 | 2613 | |
|
2614 | 2614 | copyto = dict([(v, k) for k, v in copy.items()]) |
|
2615 | 2615 | |
|
2616 | 2616 | addedset, removedset = set(added), set(removed) |
|
2617 | 2617 | |
|
2618 | 2618 | for f in sorted(modified + added + removed): |
|
2619 | 2619 | copyop = None |
|
2620 | 2620 | f1, f2 = f, f |
|
2621 | 2621 | if f in addedset: |
|
2622 | 2622 | f1 = None |
|
2623 | 2623 | if f in copy: |
|
2624 | 2624 | if opts.git: |
|
2625 | 2625 | f1 = copy[f] |
|
2626 | 2626 | if f1 in removedset and f1 not in gone: |
|
2627 | 2627 | copyop = 'rename' |
|
2628 | 2628 | gone.add(f1) |
|
2629 | 2629 | else: |
|
2630 | 2630 | copyop = 'copy' |
|
2631 | 2631 | elif f in removedset: |
|
2632 | 2632 | f2 = None |
|
2633 | 2633 | if opts.git: |
|
2634 | 2634 | # have we already reported a copy above? |
|
2635 | 2635 | if (f in copyto and copyto[f] in addedset |
|
2636 | 2636 | and copy[copyto[f]] == f): |
|
2637 | 2637 | continue |
|
2638 | 2638 | yield f1, f2, copyop |
|
2639 | 2639 | |
|
2640 | 2640 | def trydiff(repo, revs, ctx1, ctx2, modified, added, removed, |
|
2641 | 2641 | copy, getfilectx, opts, losedatafn, prefix, relroot): |
|
2642 | 2642 | '''given input data, generate a diff and yield it in blocks |
|
2643 | 2643 | |
|
2644 | 2644 | If generating a diff would lose data like flags or binary data and |
|
2645 | 2645 | losedatafn is not None, it will be called. |
|
2646 | 2646 | |
|
2647 | 2647 | relroot is removed and prefix is added to every path in the diff output. |
|
2648 | 2648 | |
|
2649 | 2649 | If relroot is not empty, this function expects every path in modified, |
|
2650 | 2650 | added, removed and copy to start with it.''' |
|
2651 | 2651 | |
|
2652 | 2652 | def gitindex(text): |
|
2653 | 2653 | if not text: |
|
2654 | 2654 | text = "" |
|
2655 | 2655 | l = len(text) |
|
2656 | 2656 | s = hashlib.sha1('blob %d\0' % l) |
|
2657 | 2657 | s.update(text) |
|
2658 | 2658 | return hex(s.digest()) |
|
2659 | 2659 | |
|
2660 | 2660 | if opts.noprefix: |
|
2661 | 2661 | aprefix = bprefix = '' |
|
2662 | 2662 | else: |
|
2663 | 2663 | aprefix = 'a/' |
|
2664 | 2664 | bprefix = 'b/' |
|
2665 | 2665 | |
|
2666 | 2666 | def diffline(f, revs): |
|
2667 | 2667 | revinfo = ' '.join(["-r %s" % rev for rev in revs]) |
|
2668 | 2668 | return 'diff %s %s' % (revinfo, f) |
|
2669 | 2669 | |
|
2670 | 2670 | def isempty(fctx): |
|
2671 | 2671 | return fctx is None or fctx.size() == 0 |
|
2672 | 2672 | |
|
2673 | 2673 | date1 = util.datestr(ctx1.date()) |
|
2674 | 2674 | date2 = util.datestr(ctx2.date()) |
|
2675 | 2675 | |
|
2676 | 2676 | gitmode = {'l': '120000', 'x': '100755', '': '100644'} |
|
2677 | 2677 | |
|
2678 | 2678 | if relroot != '' and (repo.ui.configbool('devel', 'all-warnings') |
|
2679 | 2679 | or repo.ui.configbool('devel', 'check-relroot')): |
|
2680 | 2680 | for f in modified + added + removed + list(copy) + list(copy.values()): |
|
2681 | 2681 | if f is not None and not f.startswith(relroot): |
|
2682 | 2682 | raise AssertionError( |
|
2683 | 2683 | "file %s doesn't start with relroot %s" % (f, relroot)) |
|
2684 | 2684 | |
|
2685 | 2685 | for f1, f2, copyop in _filepairs(modified, added, removed, copy, opts): |
|
2686 | 2686 | content1 = None |
|
2687 | 2687 | content2 = None |
|
2688 | 2688 | fctx1 = None |
|
2689 | 2689 | fctx2 = None |
|
2690 | 2690 | flag1 = None |
|
2691 | 2691 | flag2 = None |
|
2692 | 2692 | if f1: |
|
2693 | 2693 | fctx1 = getfilectx(f1, ctx1) |
|
2694 | 2694 | if opts.git or losedatafn: |
|
2695 | 2695 | flag1 = ctx1.flags(f1) |
|
2696 | 2696 | if f2: |
|
2697 | 2697 | fctx2 = getfilectx(f2, ctx2) |
|
2698 | 2698 | if opts.git or losedatafn: |
|
2699 | 2699 | flag2 = ctx2.flags(f2) |
|
2700 | 2700 | # if binary is True, output "summary" or "base85", but not "text diff" |
|
2701 | 2701 | if opts.text: |
|
2702 | check_binary = True | |
|
2703 | 2702 | binary = False |
|
2704 | 2703 | else: |
|
2705 |
|
|
|
2706 | for f in [fctx1, fctx2] if f is not None) | |
|
2707 | binary = check_binary | |
|
2704 | binary = any(f.isbinary() for f in [fctx1, fctx2] if f is not None) | |
|
2708 | 2705 | |
|
2709 | 2706 | if losedatafn and not opts.git: |
|
2710 | 2707 | if (binary or |
|
2711 | 2708 | # copy/rename |
|
2712 | 2709 | f2 in copy or |
|
2713 | 2710 | # empty file creation |
|
2714 | 2711 | (not f1 and isempty(fctx2)) or |
|
2715 | 2712 | # empty file deletion |
|
2716 | 2713 | (isempty(fctx1) and not f2) or |
|
2717 | 2714 | # create with flags |
|
2718 | 2715 | (not f1 and flag2) or |
|
2719 | 2716 | # change flags |
|
2720 | 2717 | (f1 and f2 and flag1 != flag2)): |
|
2721 | 2718 | losedatafn(f2 or f1) |
|
2722 | 2719 | |
|
2723 | 2720 | path1 = f1 or f2 |
|
2724 | 2721 | path2 = f2 or f1 |
|
2725 | 2722 | path1 = posixpath.join(prefix, path1[len(relroot):]) |
|
2726 | 2723 | path2 = posixpath.join(prefix, path2[len(relroot):]) |
|
2727 | 2724 | header = [] |
|
2728 | 2725 | if opts.git: |
|
2729 | 2726 | header.append('diff --git %s%s %s%s' % |
|
2730 | 2727 | (aprefix, path1, bprefix, path2)) |
|
2731 | 2728 | if not f1: # added |
|
2732 | 2729 | header.append('new file mode %s' % gitmode[flag2]) |
|
2733 | 2730 | elif not f2: # removed |
|
2734 | 2731 | header.append('deleted file mode %s' % gitmode[flag1]) |
|
2735 | 2732 | else: # modified/copied/renamed |
|
2736 | 2733 | mode1, mode2 = gitmode[flag1], gitmode[flag2] |
|
2737 | 2734 | if mode1 != mode2: |
|
2738 | 2735 | header.append('old mode %s' % mode1) |
|
2739 | 2736 | header.append('new mode %s' % mode2) |
|
2740 | 2737 | if copyop is not None: |
|
2741 | 2738 | if opts.showsimilarity: |
|
2742 | 2739 | sim = similar.score(ctx1[path1], ctx2[path2]) * 100 |
|
2743 | 2740 | header.append('similarity index %d%%' % sim) |
|
2744 | 2741 | header.append('%s from %s' % (copyop, path1)) |
|
2745 | 2742 | header.append('%s to %s' % (copyop, path2)) |
|
2746 | 2743 | elif revs and not repo.ui.quiet: |
|
2747 | 2744 | header.append(diffline(path1, revs)) |
|
2748 | 2745 | |
|
2749 | 2746 | # fctx.is | diffopts | what to | is fctx.data() |
|
2750 | 2747 | # binary() | text nobinary git index | output? | outputted? |
|
2751 | 2748 | # ------------------------------------|---------------------------- |
|
2752 | 2749 | # yes | no no no * | summary | no |
|
2753 | 2750 | # yes | no no yes * | base85 | yes |
|
2754 | 2751 | # yes | no yes no * | summary | no |
|
2755 | 2752 | # yes | no yes yes 0 | summary | no |
|
2756 | 2753 | # yes | no yes yes >0 | summary | semi [1] |
|
2757 | 2754 | # yes | yes * * * | text diff | yes |
|
2758 | 2755 | # no | * * * * | text diff | yes |
|
2759 | 2756 | # [1]: hash(fctx.data()) is outputted. so fctx.data() cannot be faked |
|
2760 | 2757 | if binary and (not opts.git or (opts.git and opts.nobinary and not |
|
2761 | 2758 | opts.index)): |
|
2762 | 2759 | # fast path: no binary content will be displayed, content1 and |
|
2763 | 2760 | # content2 are only used for equivalent test. cmp() could have a |
|
2764 | 2761 | # fast path. |
|
2765 | 2762 | if fctx1 is not None: |
|
2766 | 2763 | content1 = b'\0' |
|
2767 | 2764 | if fctx2 is not None: |
|
2768 | 2765 | if fctx1 is not None and not fctx1.cmp(fctx2): |
|
2769 | 2766 | content2 = b'\0' # not different |
|
2770 | 2767 | else: |
|
2771 | 2768 | content2 = b'\0\0' |
|
2772 | 2769 | else: |
|
2773 | 2770 | # normal path: load contents |
|
2774 | 2771 | if fctx1 is not None: |
|
2775 | 2772 | content1 = fctx1.data() |
|
2776 | 2773 | if fctx2 is not None: |
|
2777 | 2774 | content2 = fctx2.data() |
|
2778 | 2775 | |
|
2779 | 2776 | if binary and opts.git and not opts.nobinary: |
|
2780 | 2777 | text = mdiff.b85diff(content1, content2) |
|
2781 | 2778 | if text: |
|
2782 | 2779 | header.append('index %s..%s' % |
|
2783 | 2780 | (gitindex(content1), gitindex(content2))) |
|
2784 | 2781 | hunks = (None, [text]), |
|
2785 | 2782 | else: |
|
2786 | 2783 | if opts.git and opts.index > 0: |
|
2787 | 2784 | flag = flag1 |
|
2788 | 2785 | if flag is None: |
|
2789 | 2786 | flag = flag2 |
|
2790 | 2787 | header.append('index %s..%s %s' % |
|
2791 | 2788 | (gitindex(content1)[0:opts.index], |
|
2792 | 2789 | gitindex(content2)[0:opts.index], |
|
2793 | 2790 | gitmode[flag])) |
|
2794 | 2791 | |
|
2795 | 2792 | uheaders, hunks = mdiff.unidiff(content1, date1, |
|
2796 | 2793 | content2, date2, |
|
2797 |
path1, path2, |
|
|
2798 |
|
|
|
2794 | path1, path2, | |
|
2795 | binary=binary, opts=opts) | |
|
2799 | 2796 | header.extend(uheaders) |
|
2800 | 2797 | yield fctx1, fctx2, header, hunks |
|
2801 | 2798 | |
|
2802 | 2799 | def diffstatsum(stats): |
|
2803 | 2800 | maxfile, maxtotal, addtotal, removetotal, binary = 0, 0, 0, 0, False |
|
2804 | 2801 | for f, a, r, b in stats: |
|
2805 | 2802 | maxfile = max(maxfile, encoding.colwidth(f)) |
|
2806 | 2803 | maxtotal = max(maxtotal, a + r) |
|
2807 | 2804 | addtotal += a |
|
2808 | 2805 | removetotal += r |
|
2809 | 2806 | binary = binary or b |
|
2810 | 2807 | |
|
2811 | 2808 | return maxfile, maxtotal, addtotal, removetotal, binary |
|
2812 | 2809 | |
|
2813 | 2810 | def diffstatdata(lines): |
|
2814 | 2811 | diffre = re.compile('^diff .*-r [a-z0-9]+\s(.*)$') |
|
2815 | 2812 | |
|
2816 | 2813 | results = [] |
|
2817 | 2814 | filename, adds, removes, isbinary = None, 0, 0, False |
|
2818 | 2815 | |
|
2819 | 2816 | def addresult(): |
|
2820 | 2817 | if filename: |
|
2821 | 2818 | results.append((filename, adds, removes, isbinary)) |
|
2822 | 2819 | |
|
2823 | 2820 | # inheader is used to track if a line is in the |
|
2824 | 2821 | # header portion of the diff. This helps properly account |
|
2825 | 2822 | # for lines that start with '--' or '++' |
|
2826 | 2823 | inheader = False |
|
2827 | 2824 | |
|
2828 | 2825 | for line in lines: |
|
2829 | 2826 | if line.startswith('diff'): |
|
2830 | 2827 | addresult() |
|
2831 | 2828 | # starting a new file diff |
|
2832 | 2829 | # set numbers to 0 and reset inheader |
|
2833 | 2830 | inheader = True |
|
2834 | 2831 | adds, removes, isbinary = 0, 0, False |
|
2835 | 2832 | if line.startswith('diff --git a/'): |
|
2836 | 2833 | filename = gitre.search(line).group(2) |
|
2837 | 2834 | elif line.startswith('diff -r'): |
|
2838 | 2835 | # format: "diff -r ... -r ... filename" |
|
2839 | 2836 | filename = diffre.search(line).group(1) |
|
2840 | 2837 | elif line.startswith('@@'): |
|
2841 | 2838 | inheader = False |
|
2842 | 2839 | elif line.startswith('+') and not inheader: |
|
2843 | 2840 | adds += 1 |
|
2844 | 2841 | elif line.startswith('-') and not inheader: |
|
2845 | 2842 | removes += 1 |
|
2846 | 2843 | elif (line.startswith('GIT binary patch') or |
|
2847 | 2844 | line.startswith('Binary file')): |
|
2848 | 2845 | isbinary = True |
|
2849 | 2846 | addresult() |
|
2850 | 2847 | return results |
|
2851 | 2848 | |
|
2852 | 2849 | def diffstat(lines, width=80): |
|
2853 | 2850 | output = [] |
|
2854 | 2851 | stats = diffstatdata(lines) |
|
2855 | 2852 | maxname, maxtotal, totaladds, totalremoves, hasbinary = diffstatsum(stats) |
|
2856 | 2853 | |
|
2857 | 2854 | countwidth = len(str(maxtotal)) |
|
2858 | 2855 | if hasbinary and countwidth < 3: |
|
2859 | 2856 | countwidth = 3 |
|
2860 | 2857 | graphwidth = width - countwidth - maxname - 6 |
|
2861 | 2858 | if graphwidth < 10: |
|
2862 | 2859 | graphwidth = 10 |
|
2863 | 2860 | |
|
2864 | 2861 | def scale(i): |
|
2865 | 2862 | if maxtotal <= graphwidth: |
|
2866 | 2863 | return i |
|
2867 | 2864 | # If diffstat runs out of room it doesn't print anything, |
|
2868 | 2865 | # which isn't very useful, so always print at least one + or - |
|
2869 | 2866 | # if there were at least some changes. |
|
2870 | 2867 | return max(i * graphwidth // maxtotal, int(bool(i))) |
|
2871 | 2868 | |
|
2872 | 2869 | for filename, adds, removes, isbinary in stats: |
|
2873 | 2870 | if isbinary: |
|
2874 | 2871 | count = 'Bin' |
|
2875 | 2872 | else: |
|
2876 | 2873 | count = '%d' % (adds + removes) |
|
2877 | 2874 | pluses = '+' * scale(adds) |
|
2878 | 2875 | minuses = '-' * scale(removes) |
|
2879 | 2876 | output.append(' %s%s | %*s %s%s\n' % |
|
2880 | 2877 | (filename, ' ' * (maxname - encoding.colwidth(filename)), |
|
2881 | 2878 | countwidth, count, pluses, minuses)) |
|
2882 | 2879 | |
|
2883 | 2880 | if stats: |
|
2884 | 2881 | output.append(_(' %d files changed, %d insertions(+), ' |
|
2885 | 2882 | '%d deletions(-)\n') |
|
2886 | 2883 | % (len(stats), totaladds, totalremoves)) |
|
2887 | 2884 | |
|
2888 | 2885 | return ''.join(output) |
|
2889 | 2886 | |
|
2890 | 2887 | def diffstatui(*args, **kw): |
|
2891 | 2888 | '''like diffstat(), but yields 2-tuples of (output, label) for |
|
2892 | 2889 | ui.write() |
|
2893 | 2890 | ''' |
|
2894 | 2891 | |
|
2895 | 2892 | for line in diffstat(*args, **kw).splitlines(): |
|
2896 | 2893 | if line and line[-1] in '+-': |
|
2897 | 2894 | name, graph = line.rsplit(' ', 1) |
|
2898 | 2895 | yield (name + ' ', '') |
|
2899 | 2896 | m = re.search(br'\++', graph) |
|
2900 | 2897 | if m: |
|
2901 | 2898 | yield (m.group(0), 'diffstat.inserted') |
|
2902 | 2899 | m = re.search(br'-+', graph) |
|
2903 | 2900 | if m: |
|
2904 | 2901 | yield (m.group(0), 'diffstat.deleted') |
|
2905 | 2902 | else: |
|
2906 | 2903 | yield (line, '') |
|
2907 | 2904 | yield ('\n', '') |
General Comments 0
You need to be logged in to leave comments.
Login now