aboutsummaryrefslogtreecommitdiff
path: root/rev-tree.c
Commit message (Collapse)AuthorAge
* git-rev-tree: teach it about tag referencesLinus Torvalds2005-05-24
| | | | And various cleanups that makes it able to not care.
* sparse cleanupLinus Torvalds2005-05-20
| | | | | | | | | Fix various things that sparse complains about: - use NULL instead of 0 - make sure we declare everything properly, or mark it static - use proper function declarations ("fn(void)" instead of "fn()") Sparse is always right.
* [PATCH] cleanup of in-code namesAlexey Nezhdanov2005-05-19
| | | | | | | Fixes all in-code names that leaved during "big name change". Signed-off-by: Alexey Nezhdanov <snake@penza-gsm.ru> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
* rev-tree now handles commit problems betterPetr Baudis2005-05-11
| | | | | This fixes possible crashes in case of broken commit tree, and makes rev-tree die in case it cannot parse a given commit.
* Add "get_sha1()" helper function.Linus Torvalds2005-05-01
| | | | | | | | | | | | This allows the programs to use various simplified versions of the SHA1 names, eg just say "HEAD" for the SHA1 pointed to by the .git/HEAD file etc. For example, this commit has been done with git-commit-tree $(git-write-tree) -p HEAD instead of the traditional "$(cat .git/HEAD)" syntax.
* rev-tree.c: don't include unnecessary header filesLinus Torvalds2005-04-30
| | | | We used to have all these time-related issues, long gone now.
* Fix NSEC compile problem, and properly parse the rev-tree cmd line.Linus Torvalds2005-04-21
| | | | The rev-tree thing just happened to work. It shouldn't have.
* Don't parse commit objects more than once.Linus Torvalds2005-04-19
| | | | | | Yes, the "parse_commit()" already checks for this condition, but we need to check for it in rev-tree too, so that we don't start walking the parent chain unnecessarily.
* [PATCH] Port rev-tree to parsing functionsDaniel Barkalow2005-04-18
| | | | | | | | This ports rev-tree to use the parsing functions introduced in the previous patches. Signed-Off-By: Daniel Barkalow <barkalow@iabervon.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
* Make "rev-tree.c" use the new-and-improved "mark_reachable()"Linus Torvalds2005-04-17
| | | | | It used to have its own specialized version for marking the sub-reachability bits.
* Move "parse_commit()" into common revision.h file.Linus Torvalds2005-04-17
| | | | | | | | This also drops the old-style date parsing. We just don't care enough, since we dropped that format pretty early. Yes, this could do with some cleanup, and a common library file. Some day.
* [PATCH] Simplify date handling and make it more reliableDavid Woodhouse2005-04-15
| | | | | | | | | | | | | | | This make all dates be stores as seconds since UTC epoch, with the author's or committer's timezone as auxiliary data so that dates can be pretty-printed in the original timezone later if anyone cares. I left the date parsing in rev-tree.c for backward compatibility but it can be dropped when we change to base64 :) commit-tree now eats RFC2822 dates as AUTHOR_DATE because that's what you're going to want to feed it. Yes, glibc sucks and strptime is a pile of crap. We have to parse it ourselves.
* Use common "revision.h" header for both fsck and rev-tree.Linus Torvalds2005-04-13
| | | | | | | | It's really a very generic thing: the notion of one sha1 revision referring to another one. "fsck" uses it for all nodes, and "rev-tree" only tracks commit-node relationships, but the code was already the same - now we just make that explicit by moving it to a common header file.
* [PATCH] Consolidate the error handlingPetr Baudis2005-04-13
| | | | | | | Now there is error() for "library" errors and die() for fatal "application" errors. usage() is now used strictly only for usage errors. Signed-off-by: Petr Baudis <pasky@ucw.cz>
* [PATCH] Fix a crash when doing rev-treePetr Baudis2005-04-12
| | | | | | | In parse_commit(), free(buffer) is fed a bogus pointer. Signed-off-by: Petr Baudis <pasky@ucw.cz> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
* Make "rev-tree" able to read its own output again from the cache.Linus Torvalds2005-04-12
| | | | | | | | | | Also, add "date" information to the output so that you can do something like this: rev-tree `cat .git/HEAD` | sort -nr | cut -d' ' -f2 | while read i; do cat-file commit $i; done which basically becomes a "git log" (aka "git changes") where things are sorted by time.
* [PATCH] rev-tree support for "in X but not in Y".David Woodhouse2005-04-12
| | | | | | | | | | | | | | | | To do the automated commit-mailing I need to be able to answer the question "which commits are here today but weren't yesterday"... i.e. given two commit-ids $HEAD and $YESTERDAY I want to be able to do: rev-tree $HEAD ^$YESTERDAY to list those commits which are in the tree now but weren't ancestors of yesterday's head. Yes, I could probably do this with rev-tree $HEAD $YESTERDAY | egrep -v ^[a-z0-9]*:3 but I prefer not to.
* Make the rev-tree output more regular. This is the lastLinus Torvalds2005-04-11
| | | | | | | | | | | | change. Promise. It now always outputs all the revisions as <sha1>:<reachability>, where the reachability is the bitmask of how that revision was reachable from the commits in the argument list. Trivially, if there is only one commit, the reachability will always be (1 << 0) == 1 for all reachable revisions, and there won't be any edges (so the "--edges" flag only makes sense with multiple commit keys).
* Make "rev-tree" capable of showing the difference in reachability between twoLinus Torvalds2005-04-11
| | | | | | | or more commit points. This is important both to know what the difference between two commit points is, but also to figure out where to try to merge from.
* Make "rev-tree" more efficient and more useful.Linus Torvalds2005-04-11
| | | | | | | Slight change of output format: it now lists all parents on the same line. This allows it to work on initial commits too (which have no parents), and also makes the output format a lot more intuitive.
* Add a "rev-tree" helper, which calculates the revisionLinus Torvalds2005-04-11
tree graph. It's quite fast when the commit-objects are cached, but since it has to walk every single commit-object, it also allows you to cache an old state and just add on top of that.
generated by cgit v1.2.1 (git 2.18.0) at 2024-07-06 17:50:26 +0000