undef/git-commit-vandalism
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Make "rev-tree.c" use the new-and-improved "mark_reachable()"

Browse Source 
It used to have its own specialized version for marking the
sub-reachability bits.
This commit is contained in:
Linus Torvalds 2005-04-17 12:09:20 -07:00
parent 01796b0e91
commit 15000d7899
1 changed files with 1 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
rev-tree.c
View File

@ -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..