- 07 Jul, 2021 1 commit
-
-
Passes w/ gcc 11 on Fedora x64. Protip: So you don;t have to suffer, ``` perl -pe 's/(-?(?:0x)?[A-Fa-f0-9]+)([Uu])?[Ll][Ll]/\U$2INT64_C(\E$1)/mg' ```
Calvin Buckley committed
-
- 10 May, 2019 1 commit
-
-
This is not implemented and should fail, but it should also not leak. To allow the memory debugger to find leaks and fix this one we test this.
Heiko Voigt committed
-
- 03 May, 2019 1 commit
-
-
If someone passes just one ref (i.e. "master") and misses passing the range we should be nice and return an error code instead of crashing.
Heiko Voigt committed
-
- 06 Jan, 2019 1 commit
-
-
This change fixes a bunch of warnings that were discovered by compiling with `clang -target=i386-pc-linux-gnu`. It turned out that the intrinsics were not necessarily being used in all platforms! Especially in GCC, since it does not support __has_builtin. Some more warnings were gleaned from the Windows build, but I stopped when I saw that some third-party dependencies (e.g. zlib) have warnings of their own, so we might never be able to enable -Werror there.
lhchavez committed
-
- 01 Dec, 2018 1 commit
-
-
Use the new object_type enumeration names within the codebase.
Edward Thomson committed
-
- 22 Jun, 2018 1 commit
-
-
Currently we fail to clear the sorting flag for revwalks when resetting. This caused a poor interaction with the limited flag during a recent patch. This patch clears the revwalk sorting flag and causes it to no longer persist over resets.
Nika Layzell committed
-
- 12 Apr, 2018 1 commit
-
-
When we want to limit our graphwalk, we use the heuristic of checking whether the newest limiting (uninteresting) revision is newer than the oldest interesting revision. We do so by inspecting whether the first item's commit time of the user-supplied list of revisions is newer than the last added interesting revision. This is wrong though, as the user supplied list is in no way guaranteed to be sorted by increasing commit dates. This could lead us to abort the revwalk early before applying all relevant limiting revisions, outputting revisions which should in fact have been hidden. Fix the heuristic by instead checking whether _any_ of the limiting commits was made earlier than the last interesting commit. Add a test.
Patrick Steinhardt committed
-
- 24 Feb, 2018 1 commit
-
-
Add a new branch to the `testrepo` repository, where the `README` file has changed to executable. This branch enables typechange tests between the new `executable` branch and `master`.
Edward Thomson committed
-
- 09 Mar, 2017 1 commit
-
-
Fixes #4099
Adam Niedzielski committed
-
- 13 Feb, 2017 1 commit
-
-
Add a new branch that causes a merge conflict to `testrepo` so that we are able to test merging in worktrees.
Patrick Steinhardt committed
-
- 02 Feb, 2017 1 commit
-
-
Adam Niedzielski committed
-
- 06 Oct, 2016 2 commits
-
-
We had some home-grown logic to figure out which objects to show during the revision walk, but it was rather inefficient, looking over the same list multiple times to figure out when we had run out of interesting commits. We now use the lists in a smarter way. We also introduce the slop mechanism to determine when to stpo looking. When we run out of interesting objects, we continue preparing the walk for another 5 rounds in order to make it less likely that we miss objects in situations with complex graphs.
Carlos Martín Nieto committed -
Introduce some tests that show some commits, while hiding some commits that have a timestamp older than the common ancestors of these two commits.
Edward Thomson committed
-
- 21 Oct, 2015 1 commit
-
-
Vicent Marti committed
-
- 14 Oct, 2015 1 commit
-
-
We moved the "main" parsing to use 64 bits for the timestamp, but the quick parsing for the revwalk did not. This means that for large timestamps we fail to parse the time and thus the walk. Move this parser to use 64 bits as well.
Carlos Martín Nieto committed
-
- 08 Apr, 2015 1 commit
-
-
When we hide a commit which we later push into the revwalk, we do not handle this well and return commits which we should not.
Carlos Martín Nieto committed
-
- 03 Feb, 2015 1 commit
-
-
Edward Thomson committed
-
- 16 Sep, 2014 1 commit
-
-
Ciro Santilli committed
-
- 31 Mar, 2014 1 commit
-
-
Anurag Gupta committed
-
- 12 Mar, 2014 1 commit
-
-
If the pqueue comparison fn returned just 0 or 1 (think "a<b") then the sort order of returned items could be wrong because there was a "< 0" that really needed to be "<= 0". Yikes!!!
Russell Belfer committed
-
- 05 Feb, 2014 3 commits
-
-
This used to be broken, let's make sure we don't break this use-case.
Carlos Martín Nieto committed -
Pushing a whole namespace can cause us to attempt to push non-committish objects. Catch this situation and special-case it for ignoring this.
Carlos Martín Nieto committed -
This shows that pusing a whole namespace can be problematic.
Carlos Martín Nieto committed
-
- 14 Nov, 2013 1 commit
-
-
Ben Straub committed
-
- 07 Aug, 2013 1 commit
-
-
Ben Straub committed
-
- 22 Jul, 2013 2 commits
-
-
The new tests don't always want to use the same fixture data as the old ones so this makes it configurable on a per-test basis.
Russell Belfer committed -
The git_reference_next API silently skips invalid references when scanning the loose refs. The git_reference_next_name API should skip the same ones even though it isn't creating the reference object. This adds a test with a an invalid loose reference and makes sure that both APIs skip the same entries and generate the same results.
Russell Belfer committed
-
- 07 Apr, 2013 1 commit
-
-
All the hard work is already in revparse. Signed-off-by: Greg Price <price@mit.edu>
Greg Price committed
-
- 31 Mar, 2013 2 commits
-
-
Signed-off-by: Greg Price <price@mit.edu>
Greg Price committed -
The purported command output was already inaccurate, as the refs aren't where it shows. In any event, the labels a reader of this file really needs are the indices used in commit_sorting_*, to make it possible to understand them by referring directly from those arrays to the diagram rather than from the index arrays, to commit_ids, to the diagram. Add those. Signed-off-by: Greg Price <price@mit.edu>
Greg Price committed
-
- 23 Nov, 2012 1 commit
-
-
Without this change, any failed assertion in the second (or a later) test inside a test suite has a chance of double deleting memory, resulting in a heap corruption. See #1096 for details. This leaves alone the test cases where we "just" use cl_git_sandbox_init() and cl_git_sandbox_cleanup(). These methods already take good care to not double delete a repository. Fixes #1096
Sascha Cunz committed
-
- 27 Aug, 2012 1 commit
-
-
Check the type of the pushed object immediately instead of starting the walk and failing in between.
Michael Schubert committed
-
- 11 Jul, 2012 1 commit
-
-
nulltoken committed
-
- 17 May, 2012 1 commit
-
-
Vicent Martí committed
-
- 12 Apr, 2012 2 commits
-
-
Nothing should be hidden and this shouldn't bother the merge base calculation.
Carlos Martín Nieto committed -
The code was already there, so factor it out and let users push an OID by giving it a reference name. Only refs to commits are supported. Annotated tags will throw an error.
Carlos Martín Nieto committed
-
- 27 Feb, 2012 4 commits
-
-
Carlos Martín Nieto committed
-
It's not unusual to want the walker to act on HEAD, so add a convencience function for the case that the user doesn't already have a resolved HEAD reference.
Carlos Martín Nieto committed -
Carlos Martín Nieto committed
-
Carlos Martín Nieto committed
-