1. 14 Nov, 2016 3 commits
  2. 07 Oct, 2016 1 commit
  3. 24 May, 2016 1 commit
  4. 19 May, 2016 2 commits
  5. 18 May, 2016 1 commit
  6. 17 May, 2016 1 commit
    • Introduce a function to create a tree based on a different one · 9464f9eb
      Instead of going through the usual steps of reading a tree recursively
      into an index, modifying it and writing it back out as a tree, introduce
      a function to perform simple updates more efficiently.
      
      `git_tree_create_updated` avoids reading trees which are not modified
      and supports upsert and delete operations. It is not as versatile as
      modifying the index, but it makes some common operations much more
      efficient.
      Carlos Martín Nieto committed
  7. 31 Mar, 2016 1 commit
  8. 22 Mar, 2016 1 commit
  9. 20 Mar, 2016 2 commits
  10. 04 Mar, 2016 1 commit
  11. 28 Feb, 2016 1 commit
  12. 16 Feb, 2016 1 commit
  13. 06 Dec, 2015 1 commit
  14. 02 Dec, 2015 1 commit
  15. 01 Dec, 2015 1 commit
    • tree: mark cloned tree entries as un-pooled · 9487585d
      When duplicating a `struct git_tree_entry` with
      `git_tree_entry_dup` the resulting structure is not allocated
      inside a memory pool. As we do a 1:1 copy of the original struct,
      though, we also copy the `pooled` field, which is set to `true`
      for pooled entries. This results in a huge memory leak as we
      never free tree entries that were duplicated from a pooled
      tree entry.
      
      Fix this by marking the newly duplicated entry as un-pooled.
      Patrick Steinhardt committed
  16. 30 Nov, 2015 1 commit
  17. 28 Nov, 2015 4 commits
  18. 17 Mar, 2015 1 commit
  19. 15 Feb, 2015 1 commit
  20. 13 Feb, 2015 3 commits
  21. 27 Dec, 2014 1 commit
  22. 17 Dec, 2014 1 commit
  23. 16 Dec, 2014 1 commit
  24. 10 Oct, 2014 2 commits
    • index: fill the tree cache on write-tree · 7465e873
      An obvious place to fill the tree cache is on write-tree, as we're
      guaranteed to be able to fill in the whole tree cache.
      
      The way this commit does this is not the most efficient, as we read the
      root tree from the odb instead of filling in the cache as we go along,
      but it fills the cache such that successive operations (and persisting
      the index to disk) will be able to take advantage of the cache, and it
      reuses the code we already have for filling the cache.
      
      Filling in the cache as we create the trees would require some
      reallocation of the children vector, which is currently not possible
      with out pool implementation. A different data structure would likely
      allow us to perform this operation at a later date.
      Carlos Martín Nieto committed
    • index: write out the tree cache extension · c2f8b215
      Keeping the cache around after read-tree is only one part of the
      optimisation opportunities. In order to share the cache between program
      instances, we need to write the TREE extension to the index.
      
      Do so, taking the opportunity to rename 'entries' to 'entry_count' to
      match the name given in the format description. The included test is
      rather trivial, but works as a sanity check.
      Carlos Martín Nieto committed
  25. 25 Jun, 2014 1 commit
  26. 10 Jun, 2014 3 commits
  27. 09 Jun, 2014 1 commit
  28. 04 Feb, 2014 1 commit
    • Convert pqueue to just be a git_vector · 882c7742
      This updates the git_pqueue to simply be a set of specialized
      init/insert/pop functions on a git_vector.
      
      To preserve the pqueue feature of having a fixed size heap, I
      converted the "sorted" field in git_vectors to a more general
      "flags" field so that pqueue could mix in it's own flag.  This
      had a bunch of ramifications because a number of places were
      directly looking at the vector "sorted" field - I added a couple
      new git_vector helpers (is_sorted, set_sorted) so the specific
      representation of this information could be abstracted.
      Russell Belfer committed