X-Git-Url: https://git.verplant.org/?a=blobdiff_plain;f=rev-tree.c;h=bc190ebc71bbd923f2b728e505408f5e54bd073a;hb=d6db01075b65da2b8584a0450619390893aae103;hp=c2909da1722b48be394311d9cc70cf78ec81e411;hpb=06cd3b94b27c285fc9877e7c6d9e1f35fbc0a7a4;p=git.git

diff --git a/rev-tree.c b/rev-tree.c
index c2909da1..bc190ebc 100644
--- a/rev-tree.c
+++ b/rev-tree.c
@@ -46,7 +46,7 @@ static int interesting(struct commit *rev)
 	return 1;
 }
 
-void process_commit(unsigned char *sha1)
+static void process_commit(unsigned char *sha1)
 {
 	struct commit_list *parents;
 	struct commit *obj = lookup_commit(sha1);
@@ -64,7 +64,7 @@ void process_commit(unsigned char *sha1)
 }
 
 /*
- * Usage: rev-tree [--edges] [--cache <cache-file>] <commit-id> [<commit-id2>]
+ * Usage: git-rev-tree [--edges] [--cache <cache-file>] <commit-id> [<commit-id2>]
  *
  * The cache-file can be quite important for big trees. This is an
  * expensive operation if you have to walk the whole chain of
@@ -98,7 +98,7 @@ int main(int argc, char **argv)
 			basemask |= 1<<nr;
 		}
 		if (nr >= MAX_COMMITS || get_sha1(arg, sha1[nr]))
-			usage("rev-tree [--edges] [--cache <cache-file>] <commit-id> [<commit-id>]");
+			usage("git-rev-tree [--edges] [--cache <cache-file>] <commit-id> [<commit-id>]");
 		process_commit(sha1[nr]);
 		nr++;
 	}