summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 1f9b620)
raw | patch | inline | side by side (parent: 1f9b620)
author | Junio C Hamano <gitster@pobox.com> | |
Mon, 20 Apr 2009 10:58:17 +0000 (03:58 -0700) | ||
committer | Junio C Hamano <gitster@pobox.com> | |
Mon, 20 Apr 2009 11:16:40 +0000 (04:16 -0700) |
An earlier commit aab3b9a (read-tree A B C: do not create a bogus index
and do not segfault, 2009-03-12) resurrected the support for an obscure
(but useful) feature to read and overlay more than one tree into the index
without the -m (merge) option. But the fix was not enough.
Exercising this feature exposes a longstanding bug in the code that primes
the cache-tree in the index from the tree that was read. The intention
was that when we know that the index must exactly match the tree we just
read, we prime the entire cache-tree with it.
However, the logic to detect that case incorrectly triggered if you read
two trees without -m. This resulted in a corrupted cache-tree, and
write-tree would have produced an incorrect tree object out of such an
index.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
and do not segfault, 2009-03-12) resurrected the support for an obscure
(but useful) feature to read and overlay more than one tree into the index
without the -m (merge) option. But the fix was not enough.
Exercising this feature exposes a longstanding bug in the code that primes
the cache-tree in the index from the tree that was read. The intention
was that when we know that the index must exactly match the tree we just
read, we prime the entire cache-tree with it.
However, the logic to detect that case incorrectly triggered if you read
two trees without -m. This resulted in a corrupted cache-tree, and
write-tree would have produced an incorrect tree object out of such an
index.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
builtin-read-tree.c | patch | blob | history |
diff --git a/builtin-read-tree.c b/builtin-read-tree.c
index 38fef34d3fb6c24ab89043951f1ecf6c96e9bf51..e4e0e710c8e2b889189132a64515d063a8adb8b1 100644 (file)
--- a/builtin-read-tree.c
+++ b/builtin-read-tree.c
case 3:
default:
opts.fn = threeway_merge;
- cache_tree_free(&active_cache_tree);
break;
}
opts.head_idx = 1;
}
+ cache_tree_free(&active_cache_tree);
for (i = 0; i < nr_trees; i++) {
struct tree *tree = trees[i];
parse_tree(tree);
* valid cache-tree because the index must match exactly
* what came from the tree.
*/
- if (nr_trees && !opts.prefix && (!opts.merge || (stage == 2))) {
- cache_tree_free(&active_cache_tree);
+ if (nr_trees == 1 && !opts.prefix)
prime_cache_tree();
- }
if (write_cache(newfd, active_cache, active_nr) ||
commit_locked_index(&lock_file))