зеркало из https://github.com/microsoft/git.git
git-rm: update to saner semantics
This updates the "git rm" command with saner semantics suggested on the list earlier with: Message-ID: <Pine.LNX.4.64.0612020919400.3476@woody.osdl.org> Message-ID: <Pine.LNX.4.64.0612040737120.3476@woody.osdl.org> The command still validates that the given paths all talk about sensible paths to avoid mistakes (e.g. "git rm fiel" when file "fiel" does not exist would error out -- user meant to remove "file"), and it has further safety checks described next. The biggest difference is that the paths are removed from both index and from the working tree (if you have an exotic need to remove paths only from the index, you can use the --cached option). The command refuses to remove if the copy on the working tree does not match the index, or if the index and the HEAD does not match. You can defeat this check with -f option. This safety check has two exceptions: if the working tree file does not exist to begin with, that technically does not match the index but it is allowed. This is to allow this CVS style command sequence: rm <path> && git rm <path> Also if the index is unmerged at the <path>, you can use "git rm <path>" to declare that the result of the merge loses that path, and the above safety check does not trigger; requiring the file to match the index in this case forces the user to do "git update-index file && git rm file", which is just crazy. To recursively remove all contents from a directory, you need to pass -r option, not just the directory name as the <path>. Signed-off-by: Junio C Hamano <junkio@cox.net>
This commit is contained in:
Junio C Hamano
Родитель
e813d50e35
Коммит
9f95069beb
123
builtin-rm.c
123
builtin-rm.c
|
|
@ -7,9 +7,10 @@
|
|||
#include "builtin.h"
|
||||
#include "dir.h"
|
||||
#include "cache-tree.h"
|
||||
#include "tree-walk.h"
|
||||
|
||||
static const char builtin_rm_usage[] =
|
||||
"git-rm [-n] [-v] [-f] <filepattern>...";
|
||||
"git-rm [-n] [-f] [--cached] <filepattern>...";
|
||||
|
||||
static struct {
|
||||
int nr, alloc;
|
||||
|
|
@ -41,12 +42,75 @@ static int remove_file(const char *name)
|
|||
return ret;
|
||||
}
|
||||
|
||||
static int check_local_mod(unsigned char *head)
|
||||
{
|
||||
/* items in list are already sorted in the cache order,
|
||||
* so we could do this a lot more efficiently by using
|
||||
* tree_desc based traversal if we wanted to, but I am
|
||||
* lazy, and who cares if removal of files is a tad
|
||||
* slower than the theoretical maximum speed?
|
||||
*/
|
||||
int i, no_head;
|
||||
int errs = 0;
|
||||
|
||||
no_head = is_null_sha1(head);
|
||||
for (i = 0; i < list.nr; i++) {
|
||||
struct stat st;
|
||||
int pos;
|
||||
struct cache_entry *ce;
|
||||
const char *name = list.name[i];
|
||||
unsigned char sha1[20];
|
||||
unsigned mode;
|
||||
|
||||
pos = cache_name_pos(name, strlen(name));
|
||||
if (pos < 0)
|
||||
continue; /* removing unmerged entry */
|
||||
ce = active_cache[pos];
|
||||
|
||||
if (lstat(ce->name, &st) < 0) {
|
||||
if (errno != ENOENT)
|
||||
fprintf(stderr, "warning: '%s': %s",
|
||||
ce->name, strerror(errno));
|
||||
/* It already vanished from the working tree */
|
||||
continue;
|
||||
}
|
||||
else if (S_ISDIR(st.st_mode)) {
|
||||
/* if a file was removed and it is now a
|
||||
* directory, that is the same as ENOENT as
|
||||
* far as git is concerned; we do not track
|
||||
* directories.
|
||||
*/
|
||||
continue;
|
||||
}
|
||||
if (ce_match_stat(ce, &st, 0))
|
||||
errs = error("'%s' has local modifications "
|
||||
"(hint: try -f)", ce->name);
|
||||
if (no_head)
|
||||
continue;
|
||||
/*
|
||||
* It is Ok to remove a newly added path, as long as
|
||||
* it is cache-clean.
|
||||
*/
|
||||
if (get_tree_entry(head, name, sha1, &mode))
|
||||
continue;
|
||||
/*
|
||||
* Otherwise make sure the version from the HEAD
|
||||
* matches the index.
|
||||
*/
|
||||
if (ce->ce_mode != create_ce_mode(mode) ||
|
||||
hashcmp(ce->sha1, sha1))
|
||||
errs = error("'%s' has changes staged in the index "
|
||||
"(hint: try -f)", name);
|
||||
}
|
||||
return errs;
|
||||
}
|
||||
|
||||
static struct lock_file lock_file;
|
||||
|
||||
int cmd_rm(int argc, const char **argv, const char *prefix)
|
||||
{
|
||||
int i, newfd;
|
||||
int verbose = 0, show_only = 0, force = 0;
|
||||
int show_only = 0, force = 0, index_only = 0, recursive = 0;
|
||||
const char **pathspec;
|
||||
char *seen;
|
||||
|
||||
|
|
@ -62,23 +126,20 @@ int cmd_rm(int argc, const char **argv, const char *prefix)
|
|||
|
||||
if (*arg != '-')
|
||||
break;
|
||||
if (!strcmp(arg, "--")) {
|
||||
else if (!strcmp(arg, "--")) {
|
||||
i++;
|
||||
break;
|
||||
}
|
||||
if (!strcmp(arg, "-n")) {
|
||||
else if (!strcmp(arg, "-n"))
|
||||
show_only = 1;
|
||||
continue;
|
||||
}
|
||||
if (!strcmp(arg, "-v")) {
|
||||
verbose = 1;
|
||||
continue;
|
||||
}
|
||||
if (!strcmp(arg, "-f")) {
|
||||
else if (!strcmp(arg, "--cached"))
|
||||
index_only = 1;
|
||||
else if (!strcmp(arg, "-f"))
|
||||
force = 1;
|
||||
continue;
|
||||
}
|
||||
usage(builtin_rm_usage);
|
||||
else if (!strcmp(arg, "-r"))
|
||||
recursive = 1;
|
||||
else
|
||||
usage(builtin_rm_usage);
|
||||
}
|
||||
if (argc <= i)
|
||||
usage(builtin_rm_usage);
|
||||
|
|
@ -99,14 +160,36 @@ int cmd_rm(int argc, const char **argv, const char *prefix)
|
|||
if (pathspec) {
|
||||
const char *match;
|
||||
for (i = 0; (match = pathspec[i]) != NULL ; i++) {
|
||||
if (*match && !seen[i])
|
||||
die("pathspec '%s' did not match any files", match);
|
||||
if (!seen[i])
|
||||
die("pathspec '%s' did not match any files",
|
||||
match);
|
||||
if (!recursive && seen[i] == MATCHED_RECURSIVELY)
|
||||
die("not removing '%s' recursively without -r",
|
||||
*match ? match : ".");
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* If not forced, the file, the index and the HEAD (if exists)
|
||||
* must match; but the file can already been removed, since
|
||||
* this sequence is a natural "novice" way:
|
||||
*
|
||||
* rm F; git fm F
|
||||
*
|
||||
* Further, if HEAD commit exists, "diff-index --cached" must
|
||||
* report no changes unless forced.
|
||||
*/
|
||||
if (!force) {
|
||||
unsigned char sha1[20];
|
||||
if (get_sha1("HEAD", sha1))
|
||||
hashclr(sha1);
|
||||
if (check_local_mod(sha1))
|
||||
exit(1);
|
||||
}
|
||||
|
||||
/*
|
||||
* First remove the names from the index: we won't commit
|
||||
* the index unless all of them succeed
|
||||
* the index unless all of them succeed.
|
||||
*/
|
||||
for (i = 0; i < list.nr; i++) {
|
||||
const char *path = list.name[i];
|
||||
|
|
@ -121,14 +204,14 @@ int cmd_rm(int argc, const char **argv, const char *prefix)
|
|||
return 0;
|
||||
|
||||
/*
|
||||
* Then, if we used "-f", remove the filenames from the
|
||||
* workspace. If we fail to remove the first one, we
|
||||
* Then, unless we used "--cache", remove the filenames from
|
||||
* the workspace. If we fail to remove the first one, we
|
||||
* abort the "git rm" (but once we've successfully removed
|
||||
* any file at all, we'll go ahead and commit to it all:
|
||||
* by then we've already committed ourselves and can't fail
|
||||
* in the middle)
|
||||
*/
|
||||
if (force) {
|
||||
if (!index_only) {
|
||||
int removed = 0;
|
||||
for (i = 0; i < list.nr; i++) {
|
||||
const char *path = list.name[i];
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче