1/*
2 * "git rm" builtin command
3 *
4 * Copyright (C) Linus Torvalds 2006
5 */
6#include "cache.h"
7#include "builtin.h"
8#include "dir.h"
9#include "cache-tree.h"
10#include "tree-walk.h"
11
12static const char builtin_rm_usage[] =
13"git-rm [-f] [-n] [-r] [--cached] [--quiet] [--] <file>...";
14
15static struct {
16 int nr, alloc;
17 const char **name;
18} list;
19
20static void add_list(const char *name)
21{
22 if (list.nr >= list.alloc) {
23 list.alloc = alloc_nr(list.alloc);
24 list.name = xrealloc(list.name, list.alloc * sizeof(const char *));
25 }
26 list.name[list.nr++] = name;
27}
28
29static int remove_file(const char *name)
30{
31 int ret;
32 char *slash;
33
34 ret = unlink(name);
35 if (ret && errno == ENOENT)
36 /* The user has removed it from the filesystem by hand */
37 ret = errno = 0;
38
39 if (!ret && (slash = strrchr(name, '/'))) {
40 char *n = xstrdup(name);
41 do {
42 n[slash - name] = 0;
43 name = n;
44 } while (!rmdir(name) && (slash = strrchr(name, '/')));
45 }
46 return ret;
47}
48
49static int check_local_mod(unsigned char *head)
50{
51 /* items in list are already sorted in the cache order,
52 * so we could do this a lot more efficiently by using
53 * tree_desc based traversal if we wanted to, but I am
54 * lazy, and who cares if removal of files is a tad
55 * slower than the theoretical maximum speed?
56 */
57 int i, no_head;
58 int errs = 0;
59
60 no_head = is_null_sha1(head);
61 for (i = 0; i < list.nr; i++) {
62 struct stat st;
63 int pos;
64 struct cache_entry *ce;
65 const char *name = list.name[i];
66 unsigned char sha1[20];
67 unsigned mode;
68
69 pos = cache_name_pos(name, strlen(name));
70 if (pos < 0)
71 continue; /* removing unmerged entry */
72 ce = active_cache[pos];
73
74 if (lstat(ce->name, &st) < 0) {
75 if (errno != ENOENT)
76 fprintf(stderr, "warning: '%s': %s",
77 ce->name, strerror(errno));
78 /* It already vanished from the working tree */
79 continue;
80 }
81 else if (S_ISDIR(st.st_mode)) {
82 /* if a file was removed and it is now a
83 * directory, that is the same as ENOENT as
84 * far as git is concerned; we do not track
85 * directories.
86 */
87 continue;
88 }
89 if (ce_match_stat(ce, &st, 0))
90 errs = error("'%s' has local modifications "
91 "(hint: try -f)", ce->name);
92 if (no_head
93 || get_tree_entry(head, name, sha1, &mode)
94 || ce->ce_mode != create_ce_mode(mode)
95 || hashcmp(ce->sha1, sha1))
96 errs = error("'%s' has changes staged in the index "
97 "(hint: try -f)", name);
98 }
99 return errs;
100}
101
102static struct lock_file lock_file;
103
104int cmd_rm(int argc, const char **argv, const char *prefix)
105{
106 int i, newfd;
107 int show_only = 0, force = 0, index_only = 0, recursive = 0, quiet = 0;
108 const char **pathspec;
109 char *seen;
110
111 git_config(git_default_config);
112
113 newfd = hold_locked_index(&lock_file, 1);
114
115 if (read_cache() < 0)
116 die("index file corrupt");
117
118 for (i = 1 ; i < argc ; i++) {
119 const char *arg = argv[i];
120
121 if (*arg != '-')
122 break;
123 else if (!strcmp(arg, "--")) {
124 i++;
125 break;
126 }
127 else if (!strcmp(arg, "-n"))
128 show_only = 1;
129 else if (!strcmp(arg, "--cached"))
130 index_only = 1;
131 else if (!strcmp(arg, "-f"))
132 force = 1;
133 else if (!strcmp(arg, "-r"))
134 recursive = 1;
135 else if (!strcmp(arg, "--quiet"))
136 quiet = 1;
137 else
138 usage(builtin_rm_usage);
139 }
140 if (argc <= i)
141 usage(builtin_rm_usage);
142
143 pathspec = get_pathspec(prefix, argv + i);
144 seen = NULL;
145 for (i = 0; pathspec[i] ; i++)
146 /* nothing */;
147 seen = xcalloc(i, 1);
148
149 for (i = 0; i < active_nr; i++) {
150 struct cache_entry *ce = active_cache[i];
151 if (!match_pathspec(pathspec, ce->name, ce_namelen(ce), 0, seen))
152 continue;
153 add_list(ce->name);
154 }
155
156 if (pathspec) {
157 const char *match;
158 for (i = 0; (match = pathspec[i]) != NULL ; i++) {
159 if (!seen[i])
160 die("pathspec '%s' did not match any files",
161 match);
162 if (!recursive && seen[i] == MATCHED_RECURSIVELY)
163 die("not removing '%s' recursively without -r",
164 *match ? match : ".");
165 }
166 }
167
168 /*
169 * If not forced, the file, the index and the HEAD (if exists)
170 * must match; but the file can already been removed, since
171 * this sequence is a natural "novice" way:
172 *
173 * rm F; git rm F
174 *
175 * Further, if HEAD commit exists, "diff-index --cached" must
176 * report no changes unless forced.
177 */
178 if (!force) {
179 unsigned char sha1[20];
180 if (get_sha1("HEAD", sha1))
181 hashclr(sha1);
182 if (check_local_mod(sha1))
183 exit(1);
184 }
185
186 /*
187 * First remove the names from the index: we won't commit
188 * the index unless all of them succeed.
189 */
190 for (i = 0; i < list.nr; i++) {
191 const char *path = list.name[i];
192 if (!quiet)
193 printf("rm '%s'\n", path);
194
195 if (remove_file_from_cache(path))
196 die("git-rm: unable to remove %s", path);
197 cache_tree_invalidate_path(active_cache_tree, path);
198 }
199
200 if (show_only)
201 return 0;
202
203 /*
204 * Then, unless we used "--cached", remove the filenames from
205 * the workspace. If we fail to remove the first one, we
206 * abort the "git rm" (but once we've successfully removed
207 * any file at all, we'll go ahead and commit to it all:
208 * by then we've already committed ourselves and can't fail
209 * in the middle)
210 */
211 if (!index_only) {
212 int removed = 0;
213 for (i = 0; i < list.nr; i++) {
214 const char *path = list.name[i];
215 if (!remove_file(path)) {
216 removed = 1;
217 continue;
218 }
219 if (!removed)
220 die("git-rm: %s: %s", path, strerror(errno));
221 }
222 }
223
224 if (active_cache_changed) {
225 if (write_cache(newfd, active_cache, active_nr) ||
226 close(newfd) || commit_locked_index(&lock_file))
227 die("Unable to write new index file");
228 }
229
230 return 0;
231}