| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
This will allow us to have the same name in different "states" in the
index at the same time. Which in turn seems to be a very simple way to
merge.
|
|
|
|
|
|
| |
This allows scripts to manually add entries to the cache explicitly.
Need to do some way to remove them too, even if the path exists.
|
|
|
|
|
|
|
| |
This allows using a git tree over NFS with different byte order, and
makes it possible to just copy a fully populated repository and have
the end result immediately usable (needing just a refresh to update
the stat information).
|
|
|
|
|
|
|
|
| |
It seems like the nsec portability is limited; in particular, older
glibcs (<=2.2.4 at least) don't seem to like it. So access the nsec
fields in struct stat only when -DNSEC.
Signed-off-by: Petr Baudis <pasky@ucw.cz>
|
|
|
|
|
|
|
|
| |
Trivial whitespace fixes.
From: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Petr Baudis <pasky@ucw.cz>
|
|
|
|
|
|
|
| |
Now there is error() for "library" errors and die() for fatal "application"
errors. usage() is now used strictly only for usage errors.
Signed-off-by: Petr Baudis <pasky@ucw.cz>
|
|
|
|
|
|
| |
The kernel may not want it, but others probably do.
Noted (again) by Junio Hamano.
|
|
|
|
| |
I started out calling the tool "dircache". That's clearly moronic.
|
|
|
|
| |
Problem noted by Randy Dunlap.
|
|
|
|
|
| |
The size field isn't in the tree information, so we need to
update it if the sha1 matches.
|
|
|
|
|
|
|
|
|
| |
refresh the "stat" information.
We need this after having done a "read-tree", for example, when the
stat information does not match the checked-out tree, and we want to
start getting efficient cache matching against the parts of the tree
that are already up-to-date.
|
|
|
|
|
|
|
| |
It now requires the "--add" flag before you add any new files, and
a "--remove" file if you want to mark files for removal. And giving
it the "--refresh" flag makes it just update all the files that it
already knows about.
|
|
|
|
|
|
| |
This is needed for the change to make "read-tree" just read into the
cache (and then you do a "checkout-cache" to update your current dir
contents).
|
|
|
|
|
|
|
|
| |
It finds the cache entry position for a given name, and is
generally useful. Sure, everybody can just scan the active
cache array, but since it's sorted, you actually want to
search it with a binary search, so let's not duplicate that
logic all over the place.
|
|
|
|
|
|
|
| |
And fix up the warnings that it pointed out. Let's keep the tree
clean from early on.
Not that the code is very beautiful anyway ;)
|
|
|
|
|
|
| |
The tool interface sucks (especially "committing" information, which is just
me doing everything by hand from the command line), but I think this is in
theory actually a viable way of describing the world. So copyright it.
|
|
|