1. 15 Mar, 2013 1 commit
  2. 14 Mar, 2013 5 commits
    • Merge pull request #1414 from arrbee/more-build-warning-fixes · e953c160
      Fix various build warnings
      Vicent Martí committed
    • Fix various build warnings · 55e0f53d
      This fixes various build warnings on Mac and Windows (64-bit).
      Russell Belfer committed
    • Added pool freelist struct for readability · 14bedad9
      This adds a git_pool_freelist_item struct that makes it a little
      easier to follow what's going on with the pool free list block
      management code.  It is functionally neutral.
      Russell Belfer committed
    • Fix valgrind issues (and mmap fallback for diff) · d85296ab
      This fixes a number of issues identified by valgrind - mostly
      missed free calls.  Inside valgrind, mmap() may fail which causes
      some of the diff tests to fail.  This adds a fallback code path
      to diff_output.c:get_workdir_content() where is the mmap() fails
      the code will now try to read the file data directly into allocated
      memory (which is what it would do if the data needed to be filtered
      anyhow).
      Russell Belfer committed
    • Improved tree iterator internals · 0c468633
      This updates the tree iterator internals to be more efficient.
      
      The tree_iterator_entry objects are now kept as pointers that are
      allocated from a git_pool, so that we may use git__tsort_r for
      sorting (which is better than qsort, given that the tree is
      likely mostly ordered already).
      
      Those tree_iterator_entry objects now keep direct pointers to the
      data they refer to instead of keeping indirect index values.  This
      simplifies a lot of the data structure traversal code.
      
      This also adds bsearch to find the start item position for range-
      limited tree iterators, and is more explicit about using
      git_path_cmp instead of reimplementing it.  The git_path_cmp
      changed a bit to make it easier for tree_iterators to use it (but
      it was barely being used previously, so not a big deal).
      
      This adds a git_pool_free_array function that efficiently frees a
      list of pool allocated pointers (which the tree_iterator keeps).
      Also, added new tests for the git_pool free list functionality
      that was not previously being tested (or used).
      Russell Belfer committed
  3. 13 Mar, 2013 2 commits
    • Merge pull request #1411 from arrbee/workdir-iterator-depth-limit-bug · 6950dca4
      Fix workdir iterator bugs
      Vicent Martí committed
    • Fix workdir iterator bugs · bbb13646
      This fixes two bugs with the workdir iterator depth check: first
      that the depth was not being decremented and second that empty
      directories were counting against the depth even though a frame
      was not being created for them.
      
      This also fixes a bug with the ENOTFOUND return code for workdir
      iterators when you attempt to advance_into an empty directory.
      Actually, that works correctly, but it was incorrectly being
      propogated into regular advance() calls in some circumstances.
      
      Added new tests for the above that create a huge hierarchy on
      the fly and try using the workdir iterator to traverse it.
      Russell Belfer committed
  4. 12 Mar, 2013 5 commits
  5. 11 Mar, 2013 10 commits
  6. 10 Mar, 2013 1 commit
  7. 09 Mar, 2013 3 commits
    • Merge pull request #1175 from carlosmn/diff-0-ctx · 57e765b2
      Can't perform diff with no context lines
      Russell Belfer committed
    • diff: allow asking for diffs with no context · 1aa5318a
      Previously, 0 meant default. This is problematic, as asking for 0
      context lines is a valid thing to do.
      
      Change GIT_DIFF_OPTIONS_INIT to default to three and stop treating 0
      as a magic value. In case no options are provided, make sure the
      options in the diff object default to 3.
      Carlos Martín Nieto committed
    • Make tree iterator handle icase equivalence · e40f1c2d
      There is a serious bug in the previous tree iterator implementation.
      If case insensitivity resulted in member elements being equivalent
      to one another, and those member elements were trees, then the
      children of the colliding elements would be processed in sequence
      instead of in a single flattened list.  This meant that the tree
      iterator was not truly acting like a case-insensitive list.
      
      This completely reworks the tree iterator to manage lists with
      case insensitive equivalence classes and advance through the items
      in a unified manner in a single sorted frame.
      
      It is possible that at a future date we might want to update this
      to separate the case insensitive and case sensitive tree iterators
      so that the case sensitive one could be a minimal amount of code
      and the insensitive one would always know what it needed to do
      without checking flags.
      
      But there would be so much shared code between the two, that I'm
      not sure it that's a win.  For now, this gets what we need.
      
      More tests are needed, though.
      Russell Belfer committed
  8. 08 Mar, 2013 1 commit
  9. 07 Mar, 2013 12 commits