summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 28258af)
raw | patch | inline | side by side (parent: 28258af)
author | Linus Torvalds <torvalds@ppc970.osdl.org> | |
Tue, 12 Apr 2005 00:40:58 +0000 (17:40 -0700) | ||
committer | Linus Torvalds <torvalds@ppc970.osdl.org> | |
Tue, 12 Apr 2005 00:40:58 +0000 (17:40 -0700) |
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).
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).
rev-tree.c | patch | blob | history |
diff --git a/rev-tree.c b/rev-tree.c
index c10f4ee295f5e082e112152e7cd815d10878f689..7669c5ed18239d9306a77dac3ecebc36f4e1adcd 100644 (file)
--- a/rev-tree.c
+++ b/rev-tree.c
if (!interesting(rev))
continue;
- printf("%x %s", marked(rev), sha1_to_hex(rev->sha1));
+ printf("%s:%d", sha1_to_hex(rev->sha1), marked(rev));
p = rev->parent;
while (p) {
- printf(" %s", sha1_to_hex(p->parent->sha1));
+ printf(" %s:%d", sha1_to_hex(p->parent->sha1), marked(p->parent));
p = p->next;
}
printf("\n");