summaryrefslogtreecommitdiff
path: root/rev-tree.c
diff options
context:
space:
mode:
authorJunio C Hamano <junkio@cox.net>2005-09-17 05:30:55 (GMT)
committerJunio C Hamano <junkio@cox.net>2005-09-22 08:54:12 (GMT)
commit9dcc829fe13b7c843a1df6c38479d5b8b8c7d20f (patch)
tree1e4f5b99886d9661371ca29426d37bcfe641299f /rev-tree.c
parent0fe51391a80919870f94ddb442df234bb2223f3b (diff)
downloadgit-9dcc829fe13b7c843a1df6c38479d5b8b8c7d20f.zip
git-9dcc829fe13b7c843a1df6c38479d5b8b8c7d20f.tar.gz
git-9dcc829fe13b7c843a1df6c38479d5b8b8c7d20f.tar.bz2
Retire rev-tree.
Some old scripts might still use git-rev-tree, but it really is clearly inferior in every way to git-rev-list that such scripts should be fixed anyway. Fixing them should be pretty easy. Signed-off-by: Junio C Hamano <junkio@cox.net>
Diffstat (limited to 'rev-tree.c')
-rw-r--r--rev-tree.c140
1 files changed, 0 insertions, 140 deletions
diff --git a/rev-tree.c b/rev-tree.c
deleted file mode 100644
index 7f92819..0000000
--- a/rev-tree.c
+++ /dev/null
@@ -1,140 +0,0 @@
-#include "cache.h"
-#include "commit.h"
-
-/*
- * revision.h leaves the low 16 bits of the "flags" field of the
- * revision data structure unused. We use it for a "reachable from
- * this commit <N>" bitmask.
- */
-#define MAX_COMMITS 16
-#define REACHABLE (1U << 16)
-
-#define cmit_flags(cmit) ((cmit)->object.flags & ~REACHABLE)
-
-static int show_edges = 0;
-static int basemask = 0;
-
-static void read_cache_file(const char *path)
-{
- die("no revtree cache file yet");
-}
-
-/*
- * Some revisions are less interesting than others.
- *
- * For example, if we use a cache-file, that one may contain
- * revisions that were never used. They are never interesting.
- *
- * And sometimes we're only interested in "edge" commits, ie
- * places where the marking changes between parent and child.
- */
-static int interesting(struct commit *rev)
-{
- unsigned mask = cmit_flags(rev);
-
- if (!mask)
- return 0;
- if (show_edges) {
- struct commit_list *p = rev->parents;
- while (p) {
- if (mask != cmit_flags(p->item))
- return 1;
- p = p->next;
- }
- return 0;
- }
- if (mask & basemask)
- return 0;
-
- return 1;
-}
-
-/*
- * 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
- * parents in a tree with a long revision history.
- */
-int main(int argc, char **argv)
-{
- int i;
- int nr = 0;
- unsigned char sha1[MAX_COMMITS][20];
- struct commit_list *list = NULL;
-
- /*
- * First - pick up all the revisions we can (both from
- * caches and from commit file chains).
- */
- for (i = 1; i < argc ; i++) {
- char *arg = argv[i];
- struct commit *commit;
-
- if (!strcmp(arg, "--cache")) {
- read_cache_file(argv[++i]);
- continue;
- }
-
- if (!strcmp(arg, "--edges")) {
- show_edges = 1;
- continue;
- }
-
- if (arg[0] == '^') {
- arg++;
- basemask |= 1<<nr;
- }
- if (nr >= MAX_COMMITS || get_sha1(arg, sha1[nr]))
- usage("git-rev-tree [--edges] [--cache <cache-file>] <commit-id> [<commit-id>]");
-
- commit = lookup_commit_reference(sha1[nr]);
- if (!commit || parse_commit(commit) < 0)
- die("bad commit object");
- commit_list_insert(commit, &list);
- nr++;
- }
-
- /*
- * Parse all the commits in date order.
- *
- * We really should stop once we know enough, but that's a
- * decision that isn't trivial to make.
- */
- while (list)
- pop_most_recent_commit(&list, REACHABLE);
-
- /*
- * Now we have the maximal tree. Walk the different sha files back to the root.
- */
- for (i = 0; i < nr; i++)
- mark_reachable(&lookup_commit_reference(sha1[i])->object, 1 << i);
-
- /*
- * Now print out the results..
- */
- 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(commit))
- continue;
-
- printf("%lu %s:%d", commit->date, sha1_to_hex(obj->sha1),
- cmit_flags(commit));
- p = commit->parents;
- while (p) {
- printf(" %s:%d", sha1_to_hex(p->item->object.sha1),
- cmit_flags(p->item));
- p = p->next;
- }
- printf("\n");
- }
- return 0;
-}