mirror of
https://github.com/git/git
synced 2024-08-27 19:49:21 +00:00
Add case insensitivity support for directories when using git status
When using a case preserving but case insensitive file system, directory case can differ but still refer to the same physical directory. git status reports the directory with the alternate case as an Untracked file. (That is, when mydir/filea.txt is added to the repository and then the directory on disk is renamed from mydir/ to MyDir/, git status shows MyDir/ as being untracked.) Support has been added in name-hash.c for hashing directories with a terminating slash into the name hash. When index_name_exists() is called with a directory (a name with a terminating slash), the name is not found via the normal cache_name_compare() call, but it is found in the slow_same_name() function. Additionally, in dir.c, directory_exists_in_index_icase() allows newly added directories deeper in the directory chain to be identified. Ultimately, it would be better if the file list was read in case insensitive alphabetical order from disk, but this change seems to suffice for now. The end result is the directory is looked up in a case insensitive manner and does not show in the Untracked files list. Signed-off-by: Joshua Jensen <jjensen@workspacewhiz.com> Signed-off-by: Johannes Sixt <j6t@kdbg.org> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
parent
10d4b02b99
commit
5102c6173c
40
dir.c
40
dir.c
|
@ -484,6 +484,39 @@ enum exist_status {
|
||||||
index_gitdir
|
index_gitdir
|
||||||
};
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Do not use the alphabetically stored index to look up
|
||||||
|
* the directory name; instead, use the case insensitive
|
||||||
|
* name hash.
|
||||||
|
*/
|
||||||
|
static enum exist_status directory_exists_in_index_icase(const char *dirname, int len)
|
||||||
|
{
|
||||||
|
struct cache_entry *ce = index_name_exists(&the_index, dirname, len + 1, ignore_case);
|
||||||
|
unsigned char endchar;
|
||||||
|
|
||||||
|
if (!ce)
|
||||||
|
return index_nonexistent;
|
||||||
|
endchar = ce->name[len];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The cache_entry structure returned will contain this dirname
|
||||||
|
* and possibly additional path components.
|
||||||
|
*/
|
||||||
|
if (endchar == '/')
|
||||||
|
return index_directory;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If there are no additional path components, then this cache_entry
|
||||||
|
* represents a submodule. Submodules, despite being directories,
|
||||||
|
* are stored in the cache without a closing slash.
|
||||||
|
*/
|
||||||
|
if (!endchar && S_ISGITLINK(ce->ce_mode))
|
||||||
|
return index_gitdir;
|
||||||
|
|
||||||
|
/* This should never be hit, but it exists just in case. */
|
||||||
|
return index_nonexistent;
|
||||||
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* The index sorts alphabetically by entry name, which
|
* The index sorts alphabetically by entry name, which
|
||||||
* means that a gitlink sorts as '\0' at the end, while
|
* means that a gitlink sorts as '\0' at the end, while
|
||||||
|
@ -493,7 +526,12 @@ enum exist_status {
|
||||||
*/
|
*/
|
||||||
static enum exist_status directory_exists_in_index(const char *dirname, int len)
|
static enum exist_status directory_exists_in_index(const char *dirname, int len)
|
||||||
{
|
{
|
||||||
int pos = cache_name_pos(dirname, len);
|
int pos;
|
||||||
|
|
||||||
|
if (ignore_case)
|
||||||
|
return directory_exists_in_index_icase(dirname, len);
|
||||||
|
|
||||||
|
pos = cache_name_pos(dirname, len);
|
||||||
if (pos < 0)
|
if (pos < 0)
|
||||||
pos = -pos-1;
|
pos = -pos-1;
|
||||||
while (pos < active_nr) {
|
while (pos < active_nr) {
|
||||||
|
|
72
name-hash.c
72
name-hash.c
|
@ -32,6 +32,42 @@ static unsigned int hash_name(const char *name, int namelen)
|
||||||
return hash;
|
return hash;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void hash_index_entry_directories(struct index_state *istate, struct cache_entry *ce)
|
||||||
|
{
|
||||||
|
/*
|
||||||
|
* Throw each directory component in the hash for quick lookup
|
||||||
|
* during a git status. Directory components are stored with their
|
||||||
|
* closing slash. Despite submodules being a directory, they never
|
||||||
|
* reach this point, because they are stored without a closing slash
|
||||||
|
* in the cache.
|
||||||
|
*
|
||||||
|
* Note that the cache_entry stored with the directory does not
|
||||||
|
* represent the directory itself. It is a pointer to an existing
|
||||||
|
* filename, and its only purpose is to represent existence of the
|
||||||
|
* directory in the cache. It is very possible multiple directory
|
||||||
|
* hash entries may point to the same cache_entry.
|
||||||
|
*/
|
||||||
|
unsigned int hash;
|
||||||
|
void **pos;
|
||||||
|
|
||||||
|
const char *ptr = ce->name;
|
||||||
|
while (*ptr) {
|
||||||
|
while (*ptr && *ptr != '/')
|
||||||
|
++ptr;
|
||||||
|
if (*ptr == '/') {
|
||||||
|
++ptr;
|
||||||
|
hash = hash_name(ce->name, ptr - ce->name);
|
||||||
|
if (!lookup_hash(hash, &istate->name_hash)) {
|
||||||
|
pos = insert_hash(hash, ce, &istate->name_hash);
|
||||||
|
if (pos) {
|
||||||
|
ce->next = *pos;
|
||||||
|
*pos = ce;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
static void hash_index_entry(struct index_state *istate, struct cache_entry *ce)
|
static void hash_index_entry(struct index_state *istate, struct cache_entry *ce)
|
||||||
{
|
{
|
||||||
void **pos;
|
void **pos;
|
||||||
|
@ -47,6 +83,9 @@ static void hash_index_entry(struct index_state *istate, struct cache_entry *ce)
|
||||||
ce->next = *pos;
|
ce->next = *pos;
|
||||||
*pos = ce;
|
*pos = ce;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (ignore_case)
|
||||||
|
hash_index_entry_directories(istate, ce);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void lazy_init_name_hash(struct index_state *istate)
|
static void lazy_init_name_hash(struct index_state *istate)
|
||||||
|
@ -97,7 +136,21 @@ static int same_name(const struct cache_entry *ce, const char *name, int namelen
|
||||||
if (len == namelen && !cache_name_compare(name, namelen, ce->name, len))
|
if (len == namelen && !cache_name_compare(name, namelen, ce->name, len))
|
||||||
return 1;
|
return 1;
|
||||||
|
|
||||||
return icase && slow_same_name(name, namelen, ce->name, len);
|
if (!icase)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If the entry we're comparing is a filename (no trailing slash), then compare
|
||||||
|
* the lengths exactly.
|
||||||
|
*/
|
||||||
|
if (name[namelen - 1] != '/')
|
||||||
|
return slow_same_name(name, namelen, ce->name, len);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* For a directory, we point to an arbitrary cache_entry filename. Just
|
||||||
|
* make sure the directory portion matches.
|
||||||
|
*/
|
||||||
|
return slow_same_name(name, namelen, ce->name, namelen < len ? namelen : len);
|
||||||
}
|
}
|
||||||
|
|
||||||
struct cache_entry *index_name_exists(struct index_state *istate, const char *name, int namelen, int icase)
|
struct cache_entry *index_name_exists(struct index_state *istate, const char *name, int namelen, int icase)
|
||||||
|
@ -115,5 +168,22 @@ struct cache_entry *index_name_exists(struct index_state *istate, const char *na
|
||||||
}
|
}
|
||||||
ce = ce->next;
|
ce = ce->next;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Might be a submodule. Despite submodules being directories,
|
||||||
|
* they are stored in the name hash without a closing slash.
|
||||||
|
* When ignore_case is 1, directories are stored in the name hash
|
||||||
|
* with their closing slash.
|
||||||
|
*
|
||||||
|
* The side effect of this storage technique is we have need to
|
||||||
|
* remove the slash from name and perform the lookup again without
|
||||||
|
* the slash. If a match is made, S_ISGITLINK(ce->mode) will be
|
||||||
|
* true.
|
||||||
|
*/
|
||||||
|
if (icase && name[namelen - 1] == '/') {
|
||||||
|
ce = index_name_exists(istate, name, namelen - 1, icase);
|
||||||
|
if (ce && S_ISGITLINK(ce->ce_mode))
|
||||||
|
return ce;
|
||||||
|
}
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue