Make the rev-tree output more regular. This is the last

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).

Author: Linus Torvalds

rev-tree.c

@@ -236,10 +236,10 @@ int main(int argc, char **argv)
 		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");