git-fetch: Reset shallow_depth before auto-following tags.
[git] / builtin-prune.c
1 #include "cache.h"
2 #include "refs.h"
3 #include "tag.h"
4 #include "commit.h"
5 #include "tree.h"
6 #include "blob.h"
7 #include "tree-walk.h"
8 #include "diff.h"
9 #include "revision.h"
10 #include "builtin.h"
11 #include "cache-tree.h"
12
13 static const char prune_usage[] = "git-prune [-n]";
14 static int show_only;
15 static struct rev_info revs;
16
17 static int prune_object(char *path, const char *filename, const unsigned char *sha1)
18 {
19         char buf[20];
20         const char *type;
21
22         if (show_only) {
23                 if (sha1_object_info(sha1, buf, NULL))
24                         type = "unknown";
25                 else
26                         type = buf;
27                 printf("%s %s\n", sha1_to_hex(sha1), type);
28                 return 0;
29         }
30         unlink(mkpath("%s/%s", path, filename));
31         rmdir(path);
32         return 0;
33 }
34
35 static int prune_dir(int i, char *path)
36 {
37         DIR *dir = opendir(path);
38         struct dirent *de;
39
40         if (!dir)
41                 return 0;
42
43         while ((de = readdir(dir)) != NULL) {
44                 char name[100];
45                 unsigned char sha1[20];
46                 int len = strlen(de->d_name);
47
48                 switch (len) {
49                 case 2:
50                         if (de->d_name[1] != '.')
51                                 break;
52                 case 1:
53                         if (de->d_name[0] != '.')
54                                 break;
55                         continue;
56                 case 38:
57                         sprintf(name, "%02x", i);
58                         memcpy(name+2, de->d_name, len+1);
59                         if (get_sha1_hex(name, sha1) < 0)
60                                 break;
61
62                         /*
63                          * Do we know about this object?
64                          * It must have been reachable
65                          */
66                         if (lookup_object(sha1))
67                                 continue;
68
69                         prune_object(path, de->d_name, sha1);
70                         continue;
71                 }
72                 fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name);
73         }
74         closedir(dir);
75         return 0;
76 }
77
78 static void prune_object_dir(const char *path)
79 {
80         int i;
81         for (i = 0; i < 256; i++) {
82                 static char dir[4096];
83                 sprintf(dir, "%s/%02x", path, i);
84                 prune_dir(i, dir);
85         }
86 }
87
88 static void process_blob(struct blob *blob,
89                          struct object_array *p,
90                          struct name_path *path,
91                          const char *name)
92 {
93         struct object *obj = &blob->object;
94
95         if (obj->flags & SEEN)
96                 return;
97         obj->flags |= SEEN;
98         /* Nothing to do, really .. The blob lookup was the important part */
99 }
100
101 static void process_tree(struct tree *tree,
102                          struct object_array *p,
103                          struct name_path *path,
104                          const char *name)
105 {
106         struct object *obj = &tree->object;
107         struct tree_desc desc;
108         struct name_entry entry;
109         struct name_path me;
110
111         if (obj->flags & SEEN)
112                 return;
113         obj->flags |= SEEN;
114         if (parse_tree(tree) < 0)
115                 die("bad tree object %s", sha1_to_hex(obj->sha1));
116         name = xstrdup(name);
117         add_object(obj, p, path, name);
118         me.up = path;
119         me.elem = name;
120         me.elem_len = strlen(name);
121
122         desc.buf = tree->buffer;
123         desc.size = tree->size;
124
125         while (tree_entry(&desc, &entry)) {
126                 if (S_ISDIR(entry.mode))
127                         process_tree(lookup_tree(entry.sha1), p, &me, entry.path);
128                 else
129                         process_blob(lookup_blob(entry.sha1), p, &me, entry.path);
130         }
131         free(tree->buffer);
132         tree->buffer = NULL;
133 }
134
135 static void process_tag(struct tag *tag, struct object_array *p, const char *name)
136 {
137         struct object *obj = &tag->object;
138         struct name_path me;
139
140         if (obj->flags & SEEN)
141                 return;
142         obj->flags |= SEEN;
143
144         me.up = NULL;
145         me.elem = "tag:/";
146         me.elem_len = 5;
147
148         if (parse_tag(tag) < 0)
149                 die("bad tag object %s", sha1_to_hex(obj->sha1));
150         add_object(tag->tagged, p, NULL, name);
151 }
152
153 static void walk_commit_list(struct rev_info *revs)
154 {
155         int i;
156         struct commit *commit;
157         struct object_array objects = { 0, 0, NULL };
158
159         /* Walk all commits, process their trees */
160         while ((commit = get_revision(revs)) != NULL)
161                 process_tree(commit->tree, &objects, NULL, "");
162
163         /* Then walk all the pending objects, recursively processing them too */
164         for (i = 0; i < revs->pending.nr; i++) {
165                 struct object_array_entry *pending = revs->pending.objects + i;
166                 struct object *obj = pending->item;
167                 const char *name = pending->name;
168                 if (obj->type == OBJ_TAG) {
169                         process_tag((struct tag *) obj, &objects, name);
170                         continue;
171                 }
172                 if (obj->type == OBJ_TREE) {
173                         process_tree((struct tree *)obj, &objects, NULL, name);
174                         continue;
175                 }
176                 if (obj->type == OBJ_BLOB) {
177                         process_blob((struct blob *)obj, &objects, NULL, name);
178                         continue;
179                 }
180                 die("unknown pending object %s (%s)", sha1_to_hex(obj->sha1), name);
181         }
182 }
183
184 static int add_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data)
185 {
186         struct object *object = parse_object(sha1);
187         if (!object)
188                 die("bad object ref: %s:%s", path, sha1_to_hex(sha1));
189         add_pending_object(&revs, object, "");
190         return 0;
191 }
192
193 static void add_one_tree(const unsigned char *sha1)
194 {
195         struct tree *tree = lookup_tree(sha1);
196         add_pending_object(&revs, &tree->object, "");
197 }
198
199 static void add_cache_tree(struct cache_tree *it)
200 {
201         int i;
202
203         if (it->entry_count >= 0)
204                 add_one_tree(it->sha1);
205         for (i = 0; i < it->subtree_nr; i++)
206                 add_cache_tree(it->down[i]->cache_tree);
207 }
208
209 static void add_cache_refs(void)
210 {
211         int i;
212
213         read_cache();
214         for (i = 0; i < active_nr; i++) {
215                 lookup_blob(active_cache[i]->sha1);
216                 /*
217                  * We could add the blobs to the pending list, but quite
218                  * frankly, we don't care. Once we've looked them up, and
219                  * added them as objects, we've really done everything
220                  * there is to do for a blob
221                  */
222         }
223         if (active_cache_tree)
224                 add_cache_tree(active_cache_tree);
225 }
226
227 int cmd_prune(int argc, const char **argv, const char *prefix)
228 {
229         int i;
230
231         for (i = 1; i < argc; i++) {
232                 const char *arg = argv[i];
233                 if (!strcmp(arg, "-n")) {
234                         show_only = 1;
235                         continue;
236                 }
237                 usage(prune_usage);
238         }
239
240         /*
241          * Set up revision parsing, and mark us as being interested
242          * in all object types, not just commits.
243          */
244         init_revisions(&revs, prefix);
245         revs.tag_objects = 1;
246         revs.blob_objects = 1;
247         revs.tree_objects = 1;
248
249         /* Add all external refs */
250         for_each_ref(add_one_ref, NULL);
251
252         /* Add all refs from the index file */
253         add_cache_refs();
254
255         /*
256          * Set up the revision walk - this will move all commits
257          * from the pending list to the commit walking list.
258          */
259         prepare_revision_walk(&revs);
260
261         walk_commit_list(&revs);
262
263         prune_object_dir(get_object_directory());
264
265         sync();
266         prune_packed_objects(show_only);
267         return 0;
268 }