X-Git-Url: https://git.verplant.org/?a=blobdiff_plain;f=rev-tree.c;h=bc190ebc71bbd923f2b728e505408f5e54bd073a;hb=d6db01075b65da2b8584a0450619390893aae103;hp=33caac3d0325351f74c624a497e06e35bb0252e0;hpb=27de946d0ee70fad497253bbaab76d2fa7b1c77c;p=git.git diff --git a/rev-tree.c b/rev-tree.c index 33caac3d..bc190ebc 100644 --- a/rev-tree.c +++ b/rev-tree.c @@ -1,10 +1,5 @@ -#define _XOPEN_SOURCE /* glibc2 needs this */ -#define _BSD_SOURCE /* for tm.tm_gmtoff */ -#include -#include - #include "cache.h" -#include "revision.h" +#include "commit.h" /* * revision.h leaves the low 16 bits of the "flags" field of the @@ -16,134 +11,9 @@ static int show_edges = 0; static int basemask = 0; -static unsigned long parse_time(const char *buf) -{ - char c, *p; - char buffer[100]; - struct tm tm; - const char *formats[] = { - "%s", - "%c", - "%a %b %d %T %y", - NULL - }; - const char **fmt = formats; - - p = buffer; - while (isspace(c = *buf)) - buf++; - while ((c = *buf++) != '\n' && c) - *p++ = c; - *p++ = 0; - buf = buffer; - memset(&tm, 0, sizeof(tm)); - do { - const char *next = strptime(buf, *fmt, &tm); - fmt++; - if (next) { - if (!*next) - return mktime(&tm); - buf = next; - } - } while (*buf && *fmt); - return mktime(&tm); -} - - -static unsigned long parse_commit_date(const char *buf) -{ - unsigned long time; - - if (memcmp(buf, "author", 6)) - return 0; - while (*buf++ != '\n') - /* nada */; - if (memcmp(buf, "committer", 9)) - return 0; - while (*buf++ != '>') - /* nada */; - - time = strtoul(buf, NULL, 10); - if (!time) - time = parse_time(buf); - return time; -} - -static int parse_commit(unsigned char *sha1) -{ - struct revision *rev = lookup_rev(sha1); - - if (!(rev->flags & SEEN)) { - void *buffer, *bufptr; - unsigned long size; - char type[20]; - unsigned char parent[20]; - - rev->flags |= SEEN; - buffer = bufptr = read_sha1_file(sha1, type, &size); - if (!buffer || strcmp(type, "commit")) - return -1; - bufptr += 46; /* "tree " + "hex sha1" + "\n" */ - while (!memcmp(bufptr, "parent ", 7) && !get_sha1_hex(bufptr+7, parent)) { - add_relationship(rev, parent); - parse_commit(parent); - bufptr += 48; /* "parent " + "hex sha1" + "\n" */ - } - rev->date = parse_commit_date(bufptr); - free(buffer); - } - return 0; -} - static void read_cache_file(const char *path) { - FILE *file = fopen(path, "r"); - char line[500]; - - if (!file) - die("bad revtree cache file (%s)", path); - - while (fgets(line, sizeof(line), file)) { - unsigned long date; - unsigned char sha1[20]; - struct revision *rev; - const char *buf; - - if (sscanf(line, "%lu", &date) != 1) - break; - buf = strchr(line, ' '); - if (!buf) - break; - if (get_sha1_hex(buf+1, sha1)) - break; - rev = lookup_rev(sha1); - rev->flags |= SEEN; - rev->date = date; - - /* parents? */ - while ((buf = strchr(buf+1, ' ')) != NULL) { - unsigned char parent[20]; - if (get_sha1_hex(buf + 1, parent)) - break; - add_relationship(rev, parent); - } - } - fclose(file); -} - -static void mark_sha1_path(struct revision *rev, unsigned int mask) -{ - struct parent *p; - - if (rev->flags & mask) - return; - - rev->flags |= mask; - p = rev->parent; - while (p) { - mark_sha1_path(p->parent, mask); - p = p->next; - } + die("no revtree cache file yet"); } /* @@ -155,16 +25,16 @@ static void mark_sha1_path(struct revision *rev, unsigned int mask) * And sometimes we're only interested in "edge" commits, ie * places where the marking changes between parent and child. */ -static int interesting(struct revision *rev) +static int interesting(struct commit *rev) { - unsigned mask = marked(rev); + unsigned mask = rev->object.flags; if (!mask) return 0; if (show_edges) { - struct parent *p = rev->parent; + struct commit_list *p = rev->parents; while (p) { - if (mask != marked(p->parent)) + if (mask != p->item->object.flags) return 1; p = p->next; } @@ -176,8 +46,25 @@ static int interesting(struct revision *rev) return 1; } +static void process_commit(unsigned char *sha1) +{ + struct commit_list *parents; + struct commit *obj = lookup_commit(sha1); + + if (obj && obj->object.parsed) + return; + if (!obj || parse_commit(obj)) + die("unable to parse commit (%s)", sha1_to_hex(sha1)); + + parents = obj->parents; + while (parents) { + process_commit(parents->item->object.sha1); + parents = parents->next; + } +} + /* - * 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 @@ -197,8 +84,7 @@ int main(int argc, char **argv) char *arg = argv[i]; if (!strcmp(arg, "--cache")) { - read_cache_file(argv[2]); - i++; + read_cache_file(argv[++i]); continue; } @@ -211,9 +97,9 @@ int main(int argc, char **argv) arg++; basemask |= 1<= MAX_COMMITS || get_sha1_hex(arg, sha1[nr])) - usage("rev-tree [--edges] [--cache ] []"); - parse_commit(sha1[nr]); + if (nr >= MAX_COMMITS || get_sha1(arg, sha1[nr])) + usage("git-rev-tree [--edges] [--cache ] []"); + process_commit(sha1[nr]); nr++; } @@ -221,22 +107,30 @@ int main(int argc, char **argv) * Now we have the maximal tree. Walk the different sha files back to the root. */ for (i = 0; i < nr; i++) - mark_sha1_path(lookup_rev(sha1[i]), 1 << i); + mark_reachable(&lookup_commit(sha1[i])->object, 1 << i); /* * Now print out the results.. */ - for (i = 0; i < nr_revs; i++) { - struct revision *rev = revs[i]; - struct parent *p; + for (i = 0; i < nr_objs; i++) { + struct object *obj = objs[i]; + struct commit *commit; + struct commit_list *p; + + if (obj->type != commit_type) + continue; + + commit = (struct commit *) obj; - if (!interesting(rev)) + if (!interesting(commit)) continue; - printf("%lu %s:%d", rev->date, sha1_to_hex(rev->sha1), marked(rev)); - p = rev->parent; + printf("%lu %s:%d", commit->date, sha1_to_hex(obj->sha1), + obj->flags); + p = commit->parents; while (p) { - printf(" %s:%d", sha1_to_hex(p->parent->sha1), marked(p->parent)); + printf(" %s:%d", sha1_to_hex(p->item->object.sha1), + p->item->object.flags); p = p->next; } printf("\n");