X-Git-Url: https://git.verplant.org/?a=blobdiff_plain;f=rev-tree.c;h=bc190ebc71bbd923f2b728e505408f5e54bd073a;hb=d6db01075b65da2b8584a0450619390893aae103;hp=bfc8b125794d5c7104ed955eb3021c5958fc11b5;hpb=3c249c950649a37f2871a8b193f01a0640a20aef;p=git.git diff --git a/rev-tree.c b/rev-tree.c index bfc8b125..bc190ebc 100644 --- a/rev-tree.c +++ b/rev-tree.c @@ -46,16 +46,16 @@ 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); - if (obj->object.parsed) + if (obj && obj->object.parsed) return; + if (!obj || parse_commit(obj)) + die("unable to parse commit (%s)", sha1_to_hex(sha1)); - parse_commit(obj); - parents = obj->parents; while (parents) { process_commit(parents->item->object.sha1); @@ -64,7 +64,7 @@ void process_commit(unsigned char *sha1) } /* - * Usage: rev-tree [--edges] [--cache ] [] + * Usage: git-rev-tree [--edges] [--cache ] [] * * 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<= MAX_COMMITS || get_sha1(arg, sha1[nr])) - usage("rev-tree [--edges] [--cache ] []"); + usage("git-rev-tree [--edges] [--cache ] []"); process_commit(sha1[nr]); nr++; }