dulwich/dulwich/pack.py

# pack.py -- For dealing wih packed git objects.
# Copyright (C) 2007 James Westby <jw+debian@jameswestby.net>
# Copryight (C) 2008 Jelmer Vernooij <jelmer@samba.org>
# The code is loosely based on that in the sha1_file.c file from git itself,
# which is Copyright (C) Linus Torvalds, 2005 and distributed under the
# GPL version 2.
# 
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; version 2
# of the License.
# 
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
# 
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
# MA  02110-1301, USA.

"""Classes for dealing with packed git objects.

A pack is a compact representation of a bunch of objects, stored
using deltas where possible.

They have two parts, the pack file, which stores the data, and an index
that tells you where the data is.

To find an object you look in all of the index files 'til you find a
match for the object name. You then use the pointer got from this as
a pointer in to the corresponding packfile.
"""

from collections import defaultdict
import hashlib
import mmap
import os
import struct
import sys

supports_mmap_offset = (sys.version_info[0] >= 3 or 
        (sys.version_info[0] == 2 and sys.version_info[1] >= 6))

from objects import (ShaFile,
                     _decompress,
                     )

def hex_to_sha(hex):
  ret = ""
  for i in range(0, len(hex), 2):
    ret += chr(int(hex[i:i+2], 16))
  return ret

def sha_to_hex(sha):
  ret = ""
  for i in sha:
      ret += "%02x" % ord(i)
  return ret

MAX_MMAP_SIZE = 256 * 1024 * 1024

def simple_mmap(f, offset, size, access=mmap.ACCESS_READ):
    if offset+size > MAX_MMAP_SIZE and not supports_mmap_offset:
        raise AssertionError("%s is larger than 256 meg, and this version "
            "of Python does not support the offset argument to mmap().")
    if supports_mmap_offset:
        return mmap.mmap(f.fileno(), size, access=access, offset=offset)
    else:
        class ArraySkipper(object):

            def __init__(self, array, offset):
                self.array = array
                self.offset = offset

            def __getslice__(self, i, j):
                return self.array[i+self.offset:j+self.offset]

            def __getitem__(self, i):
                return self.array[i+self.offset]

            def __len__(self):
                return len(self.array) - self.offset

            def __str__(self):
                return str(self.array[self.offset:])

        mem = mmap.mmap(f.fileno(), size+offset, access=access)
        if offset == 0:
            return mem
        return ArraySkipper(mem, offset)


def multi_ord(map, start, count):
    value = 0
    for i in range(count):
        value = value * 0x100 + ord(map[start+i])
    return value


class PackIndex(object):
  """An index in to a packfile.

  Given a sha id of an object a pack index can tell you the location in the
  packfile of that object if it has it.

  To do the loop it opens the file, and indexes first 256 4 byte groups
  with the first byte of the sha id. The value in the four byte group indexed
  is the end of the group that shares the same starting byte. Subtract one
  from the starting byte and index again to find the start of the group.
  The values are sorted by sha id within the group, so do the math to find
  the start and end offset and then bisect in to find if the value is present.
  """

  PACK_INDEX_HEADER_SIZE = 0x100 * 4
  sha_bytes = 20
  record_size = sha_bytes + 4

  def __init__(self, filename):
    """Create a pack index object.

    Provide it with the name of the index file to consider, and it will map
    it whenever required.
    """
    self._filename = filename
    assert os.path.exists(filename), "%s is not a pack index" % filename
    # Take the size now, so it can be checked each time we map the file to
    # ensure that it hasn't changed.
    self._size = os.path.getsize(filename)
    self._file = open(filename, 'r')
    self._contents = simple_mmap(self._file, 0, self._size)
    if self._contents[:4] != '\377tOc':
        self.version = 1
        self._fan_out_table = self._read_fan_out_table(0)
    else:
        (self.version, ) = struct.unpack_from(">L", self._contents, 4)
        assert self.version in (2,), "Version was %d" % self.version
        self._fan_out_table = self._read_fan_out_table(8)
        self._name_table_offset = 8 + 0x100 * 4
        self._crc32_table_offset = self._name_table_offset + 20 * len(self)
        self._pack_offset_table_offset = self._crc32_table_offset + 4 * len(self)

  def close(self):
    self._file.close()

  def __len__(self):
    """Return the number of entries in this pack index."""
    return self._fan_out_table[-1]

  def _unpack_entry(self, i):
    """Unpack the i-th entry in the index file.

    :return: Tuple with object name (SHA), offset in pack file and 
          CRC32 checksum (if known)."""
    if self.version == 1:
        (offset, name) = struct.unpack_from(">L20s", self._contents, 
            self.PACK_INDEX_HEADER_SIZE + (i * self.record_size))
        return (name, offset, None)
    else:
        return (self._unpack_name(i), self._unpack_offset(i), 
                self._unpack_crc32_checksum(i))

  def _unpack_name(self, i):
    if self.version == 1:
        return self._unpack_entry(i)[0]
    else:
        return struct.unpack_from("20s", self._contents, 
                                  self._name_table_offset + i * 20)[0]

  def _unpack_offset(self, i):
    if self.version == 1:
        return self._unpack_entry(i)[1]
    else:
        return struct.unpack_from(">L", self._contents, 
                                  self._pack_offset_table_offset + i * 4)[0]

  def _unpack_crc32_checksum(self, i):
    if self.version == 1:
        return None
    else:
        return struct.unpack_from(">L", self._contents, 
                                  self._crc32_table_offset + i * 4)[0]

  def __iter__(self):
    for i in range(len(self)):
        yield sha_to_hex(self._unpack_name(i))

  def iterentries(self):
    """Iterate over the entries in this pack index.
   
    Will yield tuples with object name, offset in packfile and crc32 checksum.
    """
    for i in range(len(self)):
        yield self._unpack_entry(i)

  def _read_fan_out_table(self, start_offset):
    ret = []
    for i in range(0x100):
        ret.append(struct.unpack(">L", self._contents[start_offset+i*4:start_offset+(i+1)*4])[0])
    return ret

  def check(self):
    """Check that the stored checksum matches the actual checksum."""
    return self.calculate_checksum() == self.get_stored_checksums()[1]

  def calculate_checksum(self):
    f = open(self._filename, 'r')
    try:
        return hashlib.sha1(self._contents[:-20]).digest()
    finally:
        f.close()

  def get_stored_checksums(self):
    """Return the SHA1 checksums stored for the corresponding packfile and 
    this header file itself."""
    return str(self._contents[-40:-20]), str(self._contents[-20:])

  def object_index(self, sha):
    """Return the index in to the corresponding packfile for the object.

    Given the name of an object it will return the offset that object lives
    at within the corresponding pack file. If the pack file doesn't have the
    object then None will be returned.
    """
    size = os.path.getsize(self._filename)
    assert size == self._size, "Pack index %s has changed size, I don't " \
         "like that" % self._filename
    return self._object_index(hex_to_sha(sha))

  def _object_index(self, sha):
      """See object_index"""
      start = self._fan_out_table[ord(sha[0])-1]
      end = self._fan_out_table[ord(sha[0])]
      while start < end:
        i = (start + end)/2
        file_sha = self._unpack_name(i)
        if file_sha == sha:
          return self._unpack_offset(i)
        elif file_sha < sha:
          start = i + 1
        else:
          end = i - 1
      return None


class PackData(object):
  """The data contained in a packfile.

  Pack files can be accessed both sequentially for exploding a pack, and
  directly with the help of an index to retrieve a specific object.

  The objects within are either complete or a delta aginst another.

  The header is variable length. If the MSB of each byte is set then it
  indicates that the subsequent byte is still part of the header.
  For the first byte the next MS bits are the type, which tells you the type
  of object, and whether it is a delta. The LS byte is the lowest bits of the
  size. For each subsequent byte the LS 7 bits are the next MS bits of the
  size, i.e. the last byte of the header contains the MS bits of the size.

  For the complete objects the data is stored as zlib deflated data.
  The size in the header is the uncompressed object size, so to uncompress
  you need to just keep feeding data to zlib until you get an object back,
  or it errors on bad data. This is done here by just giving the complete
  buffer from the start of the deflated object on. This is bad, but until I
  get mmap sorted out it will have to do.

  Currently there are no integrity checks done. Also no attempt is made to try
  and detect the delta case, or a request for an object at the wrong position.
  It will all just throw a zlib or KeyError.
  """

  def __init__(self, filename):
    """Create a PackData object that represents the pack in the given filename.

    The file must exist and stay readable until the object is disposed of. It
    must also stay the same size. It will be mapped whenever needed.

    Currently there is a restriction on the size of the pack as the python
    mmap implementation is flawed.
    """
    self._filename = filename
    assert os.path.exists(filename), "%s is not a packfile" % filename
    self._size = os.path.getsize(filename)
    self._read_header()

  def _read_header(self):
    f = open(self._filename, 'rb')
    try:
        header = f.read(12)
        f.seek(self._size-20)
        self._stored_checksum = f.read(20)
    finally:
        f.close()
    assert header[:4] == "PACK"
    (version,) = struct.unpack_from(">L", header, 4)
    assert version in (2, 3), "Version was %d" % version
    (self._num_objects,) = struct.unpack_from(">L", header, 8)

  def __len__(self):
      """Returns the number of objects in this pack."""
      return self._num_objects

  def calculate_checksum(self):
    f = open(self._filename, 'rb')
    try:
        map = simple_mmap(f, 0, self._size)
        return hashlib.sha1(map[:-20]).digest()
    finally:
        f.close()

  def check(self):
    return (self.calculate_checksum() == self._stored_checksum)

  def get_object_at(self, offset):
    """Given an offset in to the packfile return the object that is there.

    Using the associated index the location of an object can be looked up, and
    then the packfile can be asked directly for that object using this
    function.

    Currently only non-delta objects are supported.
    """
    assert isinstance(offset, long) or isinstance(offset, int)
    size = os.path.getsize(self._filename)
    assert size == self._size, "Pack data %s has changed size, I don't " \
         "like that" % self._filename
    f = open(self._filename, 'rb')
    try:
      map = simple_mmap(f, offset, size-offset)
      return self._get_object_at(map)
    finally:
      f.close()

  def _get_object_at(self, map):
    first_byte = ord(map[0])
    sign_extend = first_byte & 0x80
    type = (first_byte >> 4) & 0x07
    size = first_byte & 0x0f
    cur_offset = 0
    while sign_extend > 0:
      byte = ord(map[cur_offset+1])
      sign_extend = byte & 0x80
      size_part = byte & 0x7f
      size += size_part << ((cur_offset * 7) + 4)
      cur_offset += 1
    raw_base = cur_offset+1
    # The size is the inflated size, so we have no idea what the deflated size
    # is, so for now give it as much as we have. It should really iterate
    # feeding it more data if it doesn't decompress, but as we have the whole
    # thing then just use it.
    raw = map[raw_base:]
    uncomp = _decompress(raw)
    obj = ShaFile.from_raw_string(type, uncomp)
    return obj


class SHA1Writer(object):
    
    def __init__(self, f):
        self.f = f
        self.sha1 = hashlib.sha1("")

    def write(self, data):
        self.sha1.update(data)
        self.f.write(data)

    def close(self):
        sha = self.sha1.digest()
        assert len(sha) == 20
        self.f.write(sha)
        self.f.close()
        return sha


def write_pack(filename, objects):
    """Write a new pack file.

    :param filename: The filename of the new pack file.
    :param objects: List of objects to write.
    :return: List with (name, offset, crc32 checksum) entries, pack checksum
    """
    f = open(filename, 'w')
    entries = []
    f = SHA1Writer(f)
    f.write("PACK")               # Pack header
    f.write(struct.pack(">L", 2)) # Pack version
    f.write(struct.pack(">L", len(objects))) # Number of objects in pack
    for o in objects:
        pass # FIXME: Write object
    return entries, f.close()


def write_pack_index_v1(filename, entries, pack_checksum):
    """Write a new pack index file.

    :param filename: The filename of the new pack index file.
    :param entries: List of tuples with object name (sha), offset_in_pack,  and
            crc32_checksum.
    :param pack_checksum: Checksum of the pack file.
    """
    # Sort entries first

    entries = sorted(entries)
    f = open(filename, 'w')
    f = SHA1Writer(f)
    fan_out_table = defaultdict(lambda: 0)
    for (name, offset, entry_checksum) in entries:
        fan_out_table[ord(name[0])] += 1
    # Fan-out table
    for i in range(0x100):
        f.write(struct.pack(">L", fan_out_table[i]))
        fan_out_table[i+1] += fan_out_table[i]
    for (name, offset, entry_checksum) in entries:
        f.write(struct.pack(">L20s", offset, name))
    assert len(pack_checksum) == 20
    f.write(pack_checksum)
    f.close()


def write_pack_index_v2(filename, entries, pack_checksum):
    """Write a new pack index file.

    :param filename: The filename of the new pack index file.
    :param entries: List of tuples with object name (sha), offset_in_pack,  and
            crc32_checksum.
    :param pack_checksum: Checksum of the pack file.
    """
    # Sort entries first
    entries = sorted(entries)
    f = open(filename, 'w')
    f = SHA1Writer(f)
    f.write('\377tOc')
    f.write(struct.pack(">L", 2))
    fan_out_table = defaultdict(lambda: 0)
    for (name, offset, entry_checksum) in entries:
        fan_out_table[ord(name[0])] += 1
    # Fan-out table
    for i in range(0x100):
        f.write(struct.pack(">L", fan_out_table[i]))
        fan_out_table[i+1] += fan_out_table[i]
    for (name, offset, entry_checksum) in entries:
        f.write(name)
    for (name, offset, entry_checksum) in entries:
        f.write(struct.pack(">L", entry_checksum))
    for (name, offset, entry_checksum) in entries:
        # FIXME: handle if MSBit is set in offset
        f.write(struct.pack(">L", offset))
    # FIXME: handle table for pack files > 8 Gb
    assert len(pack_checksum) == 20
    f.write(pack_checksum)
    f.close()


class Pack(object):

    def __init__(self, basename):
        self._basename = basename
        self._idx = PackIndex(basename + ".idx")
        self._pack = PackData(basename + ".pack")
        assert len(self._idx) == len(self._pack)

    def __len__(self):
        return len(self._idx)

    def __repr__(self):
        return "Pack(%r)" % self._basename

    def __iter__(self):
        return iter(self._idx)

    def check(self):
        return self._idx.check() and self._pack.check()

    def __contains__(self, sha1):
        return (self._idx.object_index(sha1) is not None)

    def __getitem__(self, sha1):
        return self._pack.get_object_at(self._idx.object_index(sha1))