Revision 3ba2e8653c88d220b0b22f35260477bb0afa7d7b authored by Johannes Sixt on 16 March 2011, 08:18:49 UTC, committed by Junio C Hamano on 17 March 2011, 21:54:11 UTC
'git stash create' must operate with a temporary index. For this purpose,
it used 'cp -p' to create a copy. -p is needed to preserve the timestamp
of the index file. Now Jakob Pfender reported a certain combination of
a Linux NFS client, OpenBSD NFS server, and cp implementation where this
operation failed.

Luckily, the first operation in git-stash after copying the index is to
call 'git read-tree'. Therefore, use --index-output instead of 'cp -p'
to write the copy of the index.

--index-output requires that the specified file is on the same volume as
the source index, so that the lock file can be rename()d. For this reason,
the name of the temporary index is constructed in a way different from the
other temporary files. The code path of 'stash -p' also needs a temporary
index, but we do not use the new name because it does not depend on the
same precondition as --index-output.

Signed-off-by: Johannes Sixt <j6t@kdbg.org>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
1 parent 23a32ff
Raw File
test-treap.c
/*
 * test-treap.c: code to exercise the svn importer's treap structure
 */

#include "cache.h"
#include "vcs-svn/obj_pool.h"
#include "vcs-svn/trp.h"

struct int_node {
	uintmax_t n;
	struct trp_node children;
};

obj_pool_gen(node, struct int_node, 3)

static int node_cmp(struct int_node *a, struct int_node *b)
{
	return (a->n > b->n) - (a->n < b->n);
}

trp_gen(static, treap_, struct int_node, children, node, node_cmp)

static void strtonode(struct int_node *item, const char *s)
{
	char *end;
	item->n = strtoumax(s, &end, 10);
	if (*s == '\0' || (*end != '\n' && *end != '\0'))
		die("invalid integer: %s", s);
}

int main(int argc, char *argv[])
{
	struct strbuf sb = STRBUF_INIT;
	struct trp_root root = { ~0 };
	uint32_t item;

	if (argc != 1)
		usage("test-treap < ints");

	while (strbuf_getline(&sb, stdin, '\n') != EOF) {
		struct int_node *node = node_pointer(node_alloc(1));

		item = node_offset(node);
		strtonode(node, sb.buf);
		node = treap_insert(&root, node_pointer(item));
		if (node_offset(node) != item)
			die("inserted %"PRIu32" in place of %"PRIu32"",
				node_offset(node), item);
	}

	item = node_offset(treap_first(&root));
	while (~item) {
		uint32_t next;
		struct int_node *tmp = node_pointer(node_alloc(1));

		tmp->n = node_pointer(item)->n;
		next = node_offset(treap_next(&root, node_pointer(item)));

		treap_remove(&root, node_pointer(item));
		item = node_offset(treap_nsearch(&root, tmp));

		if (item != next && (!~item || node_pointer(item)->n != tmp->n))
			die("found %"PRIuMAX" in place of %"PRIuMAX"",
				~item ? node_pointer(item)->n : ~(uintmax_t) 0,
				~next ? node_pointer(next)->n : ~(uintmax_t) 0);
		printf("%"PRIuMAX"\n", tmp->n);
	}
	node_reset();
	return 0;
}
back to top