git/commit.h, branch v0.99

[PATCH] Add a topological sort procedure to commit.c

2005-07-06T17:19:04Z

This introduces an in-place topological sort procedure to commit.c. Given a list of commits, sort_in_topological_order() will perform an in-place topological sort of that list. The invariant that applies to the resulting list is: a reachable from b => ord(b) < ord(a) This invariant is weaker than the --merge-order invariant, but is cheaper to calculate (assuming the list has been identified) and will serve any purpose where only a minimal topological order guarantee is required. Signed-off-by: Jon Seymour Signed-off-by: Linus Torvalds

Make "insert_by_date()" match "commit_list_insert()"

2005-07-06T16:31:17Z

Same argument order, same return type. This allows us to use a function pointer to choose one over the other.

Add "--pretty=full" format that also shows committer.

2005-06-27T00:50:46Z

Also move the common implementation of parsing the --pretty argument format into commit.c rather than having duplicates in diff-tree.c and rev-list.c.

[PATCH] Anal retentive 'const unsigned char *sha1'

2005-06-08T20:04:53Z

Make 'sha1' parameters const where possible Signed-off-by: Jason McMullan Signed-off-by: Linus Torvalds

[PATCH] Modify git-rev-list to linearise the commit history in merge order.

2005-06-06T16:07:26Z

This patch linearises the GIT commit history graph into merge order which is defined by invariants specified in Documentation/git-rev-list.txt. The linearisation produced by this patch is superior in an objective sense to that produced by the existing git-rev-list implementation in that the linearisation produced is guaranteed to have the minimum number of discontinuities, where a discontinuity is defined as an adjacent pair of commits in the output list which are not related in a direct child-parent relationship. With this patch a graph like this: a4 --- | \ \ | b4 | |/ | | a3 | | | | | a2 | | | | c3 | | | | | c2 | b3 | | | /| | b2 | | | c1 | | / | b1 a1 | | | a0 | | / root Sorts like this: = a4 | c3 | c2 | c1 ^ b4 | b3 | b2 | b1 ^ a3 | a2 | a1 | a0 = root Instead of this: = a4 | c3 ^ b4 | a3 ^ c2 ^ b3 ^ a2 ^ b2 ^ c1 ^ a1 ^ b1 ^ a0 = root A test script, t/t6000-rev-list.sh, includes a test which demonstrates that the linearisation produced by --merge-order has less discontinuities than the linearisation produced by git-rev-list without the --merge-order flag specified. To see this, do the following: cd t ./t6000-rev-list.sh cd trash cat actual-default-order cat actual-merge-order The existing behaviour of git-rev-list is preserved, by default. To obtain the modified behaviour, specify --merge-order or --merge-order --show-breaks on the command line. This version of the patch has been tested on the git repository and also on the linux-2.6 repository and has reasonable performance on both - ~50-100% slower than the original algorithm. This version of the patch has incorporated a functional equivalent of the Linus' output limiting algorithm into the merge-order algorithm itself. This operates per the notes associated with Linus' commit 337cb3fb8da45f10fe9a0c3cf571600f55ead2ce. This version has incorporated Linus' feedback regarding proposed changes to rev-list.c. (see: [PATCH] Factor out filtering in rev-list.c) This version has improved the way sort_first_epoch marks commits as uninteresting. For more details about this change, refer to Documentation/git-rev-list.txt and http://blackcubes.dyndns.org/epoch/. Signed-off-by: Jon Seymour Signed-off-by: Linus Torvalds

pretty_print_commit: add different formats

2005-06-05T16:02:03Z

You can ask to print out "raw" format (full headers, full body), "medium" format (author and date, full body) or "short" format (author only, condensed body). Use "git-rev-list --pretty=short HEAD | less -S" for an example.

Add generic commit "pretty print" function.

2005-06-01T15:34:23Z

It's really just the header printign function from diff-tree.c, and it's usable for other things too.

commit_list_insert: return the new commit list entry

2005-05-31T01:44:02Z

This is useful for when we want to insert the next one after this new one, for example.

Make "parse_object()" also fill in commit message buffer data.

2005-05-26T02:26:28Z

And teach fsck to free it to save memory.

commit: save the commit buffer off when parsing a commit

2005-05-26T01:27:14Z

object. A fair number of the users potentially want to look at the commit objects more closely, and if you worry about memory leaking in certain applications, you can always do a free(commit->buffer); commit->buffer = NULL; by hand after parsing them.