upstream/mercurial-mirror Files · mercurial/pure/base85.py

revlog: don't say "not found" on internal error...

revlog: don't say "not found" on internal error If index_node() returned NULL, then index_find_node() and and nt_partialmatch() used to return -2 to signal that the node was not found. However, we were passing in a revnum to index_node() that we knew should exist, so the only reason it could return NULL was due to some internal error or perhaps out of memory. Let's not use "not found" for these cases. I suppose we never noticed this because these error never happen in practice. I think there are more places where we should error out instead of reporting that the node was not found, but the cases mentioned above were all I cared about right now (because using the same error code for all failures simplified some future patches). Differential Revision: https://phab.mercurial-scm.org/D3457

Pulkit Goyal - - Load All Authors

File last commit:

r36209:80301c90 default


                r37878:a9d9802d

default

Download file

             base85.py
        
                    80 lines
            
             | 2.0 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / mercurial / pure / base85.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # base85.py: pure python base85 codec

      #

      # Copyright (C) 2009 Brendan Cully <brendan@kublai.com>

      #

      # This software may be used and distributed according to the terms of the

      # GNU General Public License version 2 or any later version.

      from __future__ import absolute_import

      import struct

      from .. import pycompat

      _b85chars = pycompat.bytestr("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdef"

                                   "ghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~")

      _b85chars2 = [(a + b) for a in _b85chars for b in _b85chars]

      _b85dec = {}

      def _mkb85dec():

          for i, c in enumerate(_b85chars):

              _b85dec[c] = i

      def b85encode(text, pad=False):

          """encode text in base85 format"""

          l = len(text)

          r = l % 4

          if r:

              text += '\0' * (4 - r)

          longs = len(text) >> 2

          words = struct.unpack('>%dL' % (longs), text)

          out = ''.join(_b85chars[(word // 52200625) % 85] +

                        _b85chars2[(word // 7225) % 7225] +

                        _b85chars2[word % 7225]

                        for word in words)

          if pad:

              return out

          # Trim padding

          olen = l % 4

          if olen:

              olen += 1

          olen += l // 4 * 5

          return out[:olen]

      def b85decode(text):

          """decode base85-encoded text"""

          if not _b85dec:

              _mkb85dec()

          l = len(text)

          out = []

          for i in range(0, len(text), 5):

              chunk = text[i:i + 5]

              chunk = pycompat.bytestr(chunk)

              acc = 0

              for j, c in enumerate(chunk):

                  try:

                      acc = acc * 85 + _b85dec[c]

                  except KeyError:

                      raise ValueError('bad base85 character at position %d'

                                       % (i + j))

              if acc > 4294967295:

                  raise ValueError('Base85 overflow in hunk starting at byte %d' % i)

              out.append(acc)

          # Pad final chunk if necessary

          cl = l % 5

          if cl:

              acc *= 85 ** (5 - cl)

              if cl > 1:

                  acc += 0xffffff >> (cl - 2) * 8

              out[-1] = acc

          out = struct.pack('>%dL' % (len(out)), *out)

          if cl:

              out = out[:-(5 - cl)]

          return out

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				# base85.py: pure python base85 codec
				#
				# Copyright (C) 2009 Brendan Cully <brendan@kublai.com>
				#
				# This software may be used and distributed according to the terms of the
				# GNU General Public License version 2 or any later version.

				from __future__ import absolute_import

				import struct

				from .. import pycompat

				_b85chars = pycompat.bytestr("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdef"
				"ghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{\|}~")
				_b85chars2 = [(a + b) for a in _b85chars for b in _b85chars]
				_b85dec = {}

				def _mkb85dec():
				for i, c in enumerate(_b85chars):
				_b85dec[c] = i

				def b85encode(text, pad=False):
				"""encode text in base85 format"""
				l = len(text)
				r = l % 4
				if r:
				text += '\0' * (4 - r)
				longs = len(text) >> 2
				words = struct.unpack('>%dL' % (longs), text)

				out = ''.join(_b85chars[(word // 52200625) % 85] +
				_b85chars2[(word // 7225) % 7225] +
				_b85chars2[word % 7225]
				for word in words)

				if pad:
				return out

				# Trim padding
				olen = l % 4
				if olen:
				olen += 1
				olen += l // 4 * 5
				return out[:olen]

				def b85decode(text):
				"""decode base85-encoded text"""
				if not _b85dec:
				_mkb85dec()

				l = len(text)
				out = []
				for i in range(0, len(text), 5):
				chunk = text[i:i + 5]
				chunk = pycompat.bytestr(chunk)
				acc = 0
				for j, c in enumerate(chunk):
				try:
				acc = acc * 85 + _b85dec[c]
				except KeyError:
				raise ValueError('bad base85 character at position %d'
				% (i + j))
				if acc > 4294967295:
				raise ValueError('Base85 overflow in hunk starting at byte %d' % i)
				out.append(acc)

				# Pad final chunk if necessary
				cl = l % 5
				if cl:
				acc = 85 * (5 - cl)
				if cl > 1:
				acc += 0xffffff >> (cl - 2) * 8
				out[-1] = acc

				out = struct.pack('>%dL' % (len(out)), *out)
				if cl:
				out = out[:-(5 - cl)]

				return out