aboutsummaryrefslogtreecommitdiff
path: root/rev-tree.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-17 12:09:20 -0700
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-17 12:09:20 -0700
commit15000d78996db926d18dd68e6f5f5770de09cad3 (patch)
tree3a95e7a220f82712cdc75073285bf5d93ba55f75 /rev-tree.c
parent01796b0e9180f92ed23aa8dc2261857b9dec7d13 (diff)
downloadgit-15000d78996db926d18dd68e6f5f5770de09cad3.tar.gz
git-15000d78996db926d18dd68e6f5f5770de09cad3.tar.xz
Make "rev-tree.c" use the new-and-improved "mark_reachable()"
It used to have its own specialized version for marking the sub-reachability bits.
Diffstat (limited to 'rev-tree.c')
-rw-r--r--rev-tree.c17
1 files changed, 1 insertions, 16 deletions
diff --git a/rev-tree.c b/rev-tree.c
index 57fb47edc..fe114ab36 100644
--- a/rev-tree.c
+++ b/rev-tree.c
@@ -52,21 +52,6 @@ static void read_cache_file(const char *path)
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;
- }
-}
-
/*
* Some revisions are less interesting than others.
*
@@ -142,7 +127,7 @@ 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_rev(sha1[i]), 1 << i);
/*
* Now print out the results..