[git/git.git] / builtin / merge-tree.c

#include "builtin.h"
#include "tree-walk.h"
#include "xdiff-interface.h"
#include "blob.h"
#include "exec_cmd.h"
#include "merge-blobs.h"

static const char merge_tree_usage[] = "git merge-tree <base-tree> <branch1> <branch2>";

struct merge_list {
	struct merge_list *next;
	struct merge_list *link;	/* other stages for this object */

	unsigned int stage : 2;
	unsigned int mode;
	const char *path;
	struct blob *blob;
};

static struct merge_list *merge_result, **merge_result_end = &merge_result;

static void add_merge_entry(struct merge_list *entry)
{
	*merge_result_end = entry;
	merge_result_end = &entry->next;
}

static void merge_trees_recursive(struct tree_desc t[3], const char *base, int df_conflict);

static const char *explanation(struct merge_list *entry)
{
	switch (entry->stage) {
	case 0:
		return "merged";
	case 3:
		return "added in remote";
	case 2:
		if (entry->link)
			return "added in both";
		return "added in local";
	}

	/* Existed in base */
	entry = entry->link;
	if (!entry)
		return "removed in both";

	if (entry->link)
		return "changed in both";

	if (entry->stage == 3)
		return "removed in local";
	return "removed in remote";
}

static void *result(struct merge_list *entry, unsigned long *size)
{
	enum object_type type;
	struct blob *base, *our, *their;
	const char *path = entry->path;

	if (!entry->stage)
		return read_sha1_file(entry->blob->object.sha1, &type, size);
	base = NULL;
	if (entry->stage == 1) {
		base = entry->blob;
		entry = entry->link;
	}
	our = NULL;
	if (entry && entry->stage == 2) {
		our = entry->blob;
		entry = entry->link;
	}
	their = NULL;
	if (entry)
		their = entry->blob;
	return merge_blobs(path, base, our, their, size);
}

static void *origin(struct merge_list *entry, unsigned long *size)
{
	enum object_type type;
	while (entry) {
		if (entry->stage == 2)
			return read_sha1_file(entry->blob->object.sha1, &type, size);
		entry = entry->link;
	}
	return NULL;
}

static int show_outf(void *priv_, mmbuffer_t *mb, int nbuf)
{
	int i;
	for (i = 0; i < nbuf; i++)
		printf("%.*s", (int) mb[i].size, mb[i].ptr);
	return 0;
}

static void show_diff(struct merge_list *entry)
{
	unsigned long size;
	mmfile_t src, dst;
	xpparam_t xpp;
	xdemitconf_t xecfg;
	xdemitcb_t ecb;

	xpp.flags = 0;
	memset(&xecfg, 0, sizeof(xecfg));
	xecfg.ctxlen = 3;
	ecb.outf = show_outf;
	ecb.priv = NULL;

	src.ptr = origin(entry, &size);
	if (!src.ptr)
		size = 0;
	src.size = size;
	dst.ptr = result(entry, &size);
	if (!dst.ptr)
		size = 0;
	dst.size = size;
	xdi_diff(&src, &dst, &xpp, &xecfg, &ecb);
	free(src.ptr);
	free(dst.ptr);
}

static void show_result_list(struct merge_list *entry)
{
	printf("%s\n", explanation(entry));
	do {
		struct merge_list *link = entry->link;
		static const char *desc[4] = { "result", "base", "our", "their" };
		printf("  %-6s %o %s %s\n", desc[entry->stage], entry->mode, sha1_to_hex(entry->blob->object.sha1), entry->path);
		entry = link;
	} while (entry);
}

static void show_result(void)
{
	struct merge_list *walk;

	walk = merge_result;
	while (walk) {
		show_result_list(walk);
		show_diff(walk);
		walk = walk->next;
	}
}

/* An empty entry never compares same, not even to another empty entry */
static int same_entry(struct name_entry *a, struct name_entry *b)
{
	return	a->sha1 &&
		b->sha1 &&
		!hashcmp(a->sha1, b->sha1) &&
		a->mode == b->mode;
}

static struct merge_list *create_entry(unsigned stage, unsigned mode, const unsigned char *sha1, const char *path)
{
	struct merge_list *res = xcalloc(1, sizeof(*res));

	res->stage = stage;
	res->path = path;
	res->mode = mode;
	res->blob = lookup_blob(sha1);
	return res;
}

static char *traverse_path(const struct traverse_info *info, const struct name_entry *n)
{
	char *path = xmalloc(traverse_path_len(info, n) + 1);
	return make_traverse_path(path, info, n);
}

static void resolve(const struct traverse_info *info, struct name_entry *ours, struct name_entry *result)
{
	struct merge_list *orig, *final;
	const char *path;

	/* If it's already ours, don't bother showing it */
	if (!ours)
		return;

	path = traverse_path(info, result);
	orig = create_entry(2, ours->mode, ours->sha1, path);
	final = create_entry(0, result->mode, result->sha1, path);

	final->link = orig;

	add_merge_entry(final);
}

static void unresolved_directory(const struct traverse_info *info, struct name_entry n[3],
				 int df_conflict)
{
	char *newbase;
	struct name_entry *p;
	struct tree_desc t[3];
	void *buf0, *buf1, *buf2;

	for (p = n; p < n + 3; p++) {
		if (p->mode && S_ISDIR(p->mode))
			break;
	}
	if (n + 3 <= p)
		return; /* there is no tree here */

	newbase = traverse_path(info, p);

#define ENTRY_SHA1(e) (((e)->mode && S_ISDIR((e)->mode)) ? (e)->sha1 : NULL)
	buf0 = fill_tree_descriptor(t+0, ENTRY_SHA1(n + 0));
	buf1 = fill_tree_descriptor(t+1, ENTRY_SHA1(n + 1));
	buf2 = fill_tree_descriptor(t+2, ENTRY_SHA1(n + 2));
#undef ENTRY_SHA1

	merge_trees_recursive(t, newbase, df_conflict);

	free(buf0);
	free(buf1);
	free(buf2);
	free(newbase);
}


static struct merge_list *link_entry(unsigned stage, const struct traverse_info *info, struct name_entry *n, struct merge_list *entry)
{
	const char *path;
	struct merge_list *link;

	if (!n->mode)
		return entry;
	if (entry)
		path = entry->path;
	else
		path = traverse_path(info, n);
	link = create_entry(stage, n->mode, n->sha1, path);
	link->link = entry;
	return link;
}

static void unresolved(const struct traverse_info *info, struct name_entry n[3])
{
	struct merge_list *entry = NULL;
	int i;
	unsigned dirmask = 0, mask = 0;

	for (i = 0; i < 3; i++) {
		mask |= (1 << i);
		if (n[i].mode && S_ISDIR(n[i].mode))
			dirmask |= (1 << i);
	}

	unresolved_directory(info, n, dirmask && (dirmask != mask));

	if (dirmask == mask)
		return;

	if (n[2].mode && !S_ISDIR(n[2].mode))
		entry = link_entry(3, info, n + 2, entry);
	if (n[1].mode && !S_ISDIR(n[1].mode))
		entry = link_entry(2, info, n + 1, entry);
	if (n[0].mode && !S_ISDIR(n[0].mode))
		entry = link_entry(1, info, n + 0, entry);

	add_merge_entry(entry);
}

/*
 * Merge two trees together (t[1] and t[2]), using a common base (t[0])
 * as the origin.
 *
 * This walks the (sorted) trees in lock-step, checking every possible
 * name. Note that directories automatically sort differently from other
 * files (see "base_name_compare"), so you'll never see file/directory
 * conflicts, because they won't ever compare the same.
 *
 * IOW, if a directory changes to a filename, it will automatically be
 * seen as the directory going away, and the filename being created.
 *
 * Think of this as a three-way diff.
 *
 * The output will be either:
 *  - successful merge
 *	 "0 mode sha1 filename"
 *    NOTE NOTE NOTE! FIXME! We really really need to walk the index
 *    in parallel with this too!
 *
 *  - conflict:
 *	"1 mode sha1 filename"
 *	"2 mode sha1 filename"
 *	"3 mode sha1 filename"
 *    where not all of the 1/2/3 lines may exist, of course.
 *
 * The successful merge rules are the same as for the three-way merge
 * in git-read-tree.
 */
static int threeway_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *info)
{
	/* Same in both? */
	if (same_entry(entry+1, entry+2)) {
		if (entry[0].sha1) {
			/* Modified identically */
			resolve(info, NULL, entry+1);
			return mask;
		}
		/* "Both added the same" is left unresolved */
	}

	if (same_entry(entry+0, entry+1)) {
		if (entry[2].sha1 && !S_ISDIR(entry[2].mode)) {
			/* We did not touch, they modified -- take theirs */
			resolve(info, entry+1, entry+2);
			return mask;
		}
		/*
		 * If we did not touch a directory but they made it
		 * into a file, we fall through and unresolved()
		 * recurses down.  Likewise for the opposite case.
		 */
	}

	if (same_entry(entry+0, entry+2)) {
		if (entry[1].sha1 && !S_ISDIR(entry[1].mode)) {
			/* We modified, they did not touch -- take ours */
			resolve(info, NULL, entry+1);
			return mask;
		}
	}

	unresolved(info, entry);
	return mask;
}

static void merge_trees_recursive(struct tree_desc t[3], const char *base, int df_conflict)
{
	struct traverse_info info;

	setup_traverse_info(&info, base);
	info.data = &df_conflict;
	info.fn = threeway_callback;
	traverse_trees(3, t, &info);
}

static void merge_trees(struct tree_desc t[3], const char *base)
{
	merge_trees_recursive(t, base, 0);
}

static void *get_tree_descriptor(struct tree_desc *desc, const char *rev)
{
	unsigned char sha1[20];
	void *buf;

	if (get_sha1(rev, sha1))
		die("unknown rev %s", rev);
	buf = fill_tree_descriptor(desc, sha1);
	if (!buf)
		die("%s is not a tree", rev);
	return buf;
}

int cmd_merge_tree(int argc, const char **argv, const char *prefix)
{
	struct tree_desc t[3];
	void *buf1, *buf2, *buf3;

	if (argc != 4)
		usage(merge_tree_usage);

	buf1 = get_tree_descriptor(t+0, argv[1]);
	buf2 = get_tree_descriptor(t+1, argv[2]);
	buf3 = get_tree_descriptor(t+2, argv[3]);
	merge_trees(t, "");
	free(buf1);
	free(buf2);
	free(buf3);

	show_result();
	return 0;
}
Commit	Line	Data
c2e86add	1	#include "builtin.h"
1b0c7174	2	#include "tree-walk.h"
0c799383	3	#include "xdiff-interface.h"
83788070	4	#include "blob.h"
2fb3f6db	5	#include "exec_cmd.h"
fa2364ec	6	#include "merge-blobs.h"
492e0759	7
34263de0	8	static const char merge_tree_usage[] = "git merge-tree <base-tree> <branch1> <branch2>";
492e0759	9
83788070 LT	10	struct merge_list {
	11	struct merge_list *next;
	12	struct merge_list link; / other stages for this object */
	13
b13112fa	14	unsigned int stage : 2;
83788070 LT	15	unsigned int mode;
	16	const char *path;
	17	struct blob *blob;
	18	};
	19
	20	static struct merge_list merge_result, *merge_result_end = &merge_result;
	21
	22	static void add_merge_entry(struct merge_list *entry)
	23	{
	24	*merge_result_end = entry;
	25	merge_result_end = &entry->next;
	26	}
	27
35ffe758	28	static void merge_trees_recursive(struct tree_desc t[3], const char *base, int df_conflict);
492e0759	29
83788070 LT	30	static const char explanation(struct merge_list entry)
	31	{
	32	switch (entry->stage) {
	33	case 0:
	34	return "merged";
	35	case 3:
	36	return "added in remote";
	37	case 2:
	38	if (entry->link)
	39	return "added in both";
	40	return "added in local";
	41	}
	42
	43	/* Existed in base */
	44	entry = entry->link;
	45	if (!entry)
	46	return "removed in both";
	47
	48	if (entry->link)
	49	return "changed in both";
	50
	51	if (entry->stage == 3)
	52	return "removed in local";
	53	return "removed in remote";
	54	}
	55
0c799383 LT	56	static void result(struct merge_list entry, unsigned long *size)
0c799383 LT	57	{
21666f1a	58	enum object_type type;
0c799383	59	struct blob base, our, *their;
21baa6e0	60	const char *path = entry->path;
0c799383 LT	61
0c799383 LT	62	if (!entry->stage)
21666f1a	63	return read_sha1_file(entry->blob->object.sha1, &type, size);
0c799383 LT	64	base = NULL;
	65	if (entry->stage == 1) {
	66	base = entry->blob;
	67	entry = entry->link;
	68	}
	69	our = NULL;
	70	if (entry && entry->stage == 2) {
	71	our = entry->blob;
	72	entry = entry->link;
	73	}
	74	their = NULL;
	75	if (entry)
	76	their = entry->blob;
fa2364ec	77	return merge_blobs(path, base, our, their, size);
0c799383 LT	78	}
	79
	80	static void origin(struct merge_list entry, unsigned long *size)
	81	{
21666f1a	82	enum object_type type;
0c799383 LT	83	while (entry) {
0c799383 LT	84	if (entry->stage == 2)
21666f1a	85	return read_sha1_file(entry->blob->object.sha1, &type, size);
0c799383 LT	86	entry = entry->link;
	87	}
	88	return NULL;
	89	}
	90
	91	static int show_outf(void priv_, mmbuffer_t mb, int nbuf)
	92	{
	93	int i;
	94	for (i = 0; i < nbuf; i++)
	95	printf("%.*s", (int) mb[i].size, mb[i].ptr);
	96	return 0;
	97	}
	98
	99	static void show_diff(struct merge_list *entry)
	100	{
	101	unsigned long size;
	102	mmfile_t src, dst;
	103	xpparam_t xpp;
	104	xdemitconf_t xecfg;
	105	xdemitcb_t ecb;
	106
582aa00b	107	xpp.flags = 0;
30b25010	108	memset(&xecfg, 0, sizeof(xecfg));
0c799383	109	xecfg.ctxlen = 3;
0c799383 LT	110	ecb.outf = show_outf;
	111	ecb.priv = NULL;
	112
	113	src.ptr = origin(entry, &size);
	114	if (!src.ptr)
	115	size = 0;
	116	src.size = size;
	117	dst.ptr = result(entry, &size);
	118	if (!dst.ptr)
	119	size = 0;
	120	dst.size = size;
c279d7e9	121	xdi_diff(&src, &dst, &xpp, &xecfg, &ecb);
0c799383 LT	122	free(src.ptr);
	123	free(dst.ptr);
	124	}
	125
83788070 LT	126	static void show_result_list(struct merge_list *entry)
	127	{
	128	printf("%s\n", explanation(entry));
	129	do {
	130	struct merge_list *link = entry->link;
	131	static const char *desc[4] = { "result", "base", "our", "their" };
	132	printf(" %-6s %o %s %s\n", desc[entry->stage], entry->mode, sha1_to_hex(entry->blob->object.sha1), entry->path);
	133	entry = link;
	134	} while (entry);
	135	}
	136
	137	static void show_result(void)
	138	{
	139	struct merge_list *walk;
	140
	141	walk = merge_result;
	142	while (walk) {
	143	show_result_list(walk);
0c799383	144	show_diff(walk);
83788070 LT	145	walk = walk->next;
	146	}
	147	}
	148
492e0759 LT	149	/* An empty entry never compares same, not even to another empty entry */
	150	static int same_entry(struct name_entry a, struct name_entry b)
	151	{
	152	return a->sha1 &&
	153	b->sha1 &&
a89fccd2	154	!hashcmp(a->sha1, b->sha1) &&
492e0759 LT	155	a->mode == b->mode;
	156	}
	157
83788070	158	static struct merge_list create_entry(unsigned stage, unsigned mode, const unsigned char sha1, const char *path)
492e0759	159	{
19d4b416	160	struct merge_list res = xcalloc(1, sizeof(res));
83788070	161
83788070 LT	162	res->stage = stage;
	163	res->path = path;
	164	res->mode = mode;
	165	res->blob = lookup_blob(sha1);
	166	return res;
01df5297 LT	167	}
01df5297 LT	168
40d934df LT	169	static char traverse_path(const struct traverse_info info, const struct name_entry *n)
	170	{
	171	char *path = xmalloc(traverse_path_len(info, n) + 1);
	172	return make_traverse_path(path, info, n);
	173	}
	174
8dd15c6a	175	static void resolve(const struct traverse_info info, struct name_entry ours, struct name_entry *result)
01df5297	176	{
83788070 LT	177	struct merge_list orig, final;
	178	const char *path;
	179
8dd15c6a JH	180	/* If it's already ours, don't bother showing it */
8dd15c6a JH	181	if (!ours)
01df5297	182	return;
01df5297	183
40d934df	184	path = traverse_path(info, result);
8dd15c6a	185	orig = create_entry(2, ours->mode, ours->sha1, path);
83788070 LT	186	final = create_entry(0, result->mode, result->sha1, path);
	187
	188	final->link = orig;
	189
	190	add_merge_entry(final);
492e0759 LT	191	}
492e0759 LT	192
35ffe758 JH	193	static void unresolved_directory(const struct traverse_info *info, struct name_entry n[3],
35ffe758 JH	194	int df_conflict)
492e0759	195	{
492e0759 LT	196	char *newbase;
	197	struct name_entry *p;
	198	struct tree_desc t[3];
	199	void buf0, buf1, *buf2;
	200
35ffe758 JH	201	for (p = n; p < n + 3; p++) {
	202	if (p->mode && S_ISDIR(p->mode))
	203	break;
492e0759	204	}
35ffe758 JH	205	if (n + 3 <= p)
35ffe758 JH	206	return; /* there is no tree here */
8dd15c6a	207
40d934df	208	newbase = traverse_path(info, p);
35ffe758 JH	209
	210	#define ENTRY_SHA1(e) (((e)->mode && S_ISDIR((e)->mode)) ? (e)->sha1 : NULL)
	211	buf0 = fill_tree_descriptor(t+0, ENTRY_SHA1(n + 0));
	212	buf1 = fill_tree_descriptor(t+1, ENTRY_SHA1(n + 1));
	213	buf2 = fill_tree_descriptor(t+2, ENTRY_SHA1(n + 2));
	214	#undef ENTRY_SHA1
	215
	216	merge_trees_recursive(t, newbase, df_conflict);
492e0759 LT	217
	218	free(buf0);
	219	free(buf1);
	220	free(buf2);
	221	free(newbase);
492e0759 LT	222	}
492e0759 LT	223
83788070	224
40d934df	225	static struct merge_list link_entry(unsigned stage, const struct traverse_info info, struct name_entry n, struct merge_list entry)
83788070 LT	226	{
	227	const char *path;
	228	struct merge_list *link;
	229
	230	if (!n->mode)
	231	return entry;
	232	if (entry)
	233	path = entry->path;
	234	else
40d934df	235	path = traverse_path(info, n);
83788070 LT	236	link = create_entry(stage, n->mode, n->sha1, path);
	237	link->link = entry;
	238	return link;
	239	}
	240
40d934df	241	static void unresolved(const struct traverse_info *info, struct name_entry n[3])
492e0759	242	{
83788070	243	struct merge_list *entry = NULL;
35ffe758 JH	244	int i;
	245	unsigned dirmask = 0, mask = 0;
	246
	247	for (i = 0; i < 3; i++) {
187c00c6	248	mask \|= (1 << i);
35ffe758 JH	249	if (n[i].mode && S_ISDIR(n[i].mode))
	250	dirmask \|= (1 << i);
	251	}
	252
	253	unresolved_directory(info, n, dirmask && (dirmask != mask));
83788070	254
35ffe758	255	if (dirmask == mask)
492e0759	256	return;
83788070	257
35ffe758 JH	258	if (n[2].mode && !S_ISDIR(n[2].mode))
	259	entry = link_entry(3, info, n + 2, entry);
	260	if (n[1].mode && !S_ISDIR(n[1].mode))
	261	entry = link_entry(2, info, n + 1, entry);
	262	if (n[0].mode && !S_ISDIR(n[0].mode))
	263	entry = link_entry(1, info, n + 0, entry);
83788070 LT	264
83788070 LT	265	add_merge_entry(entry);
492e0759 LT	266	}
492e0759 LT	267
164dcb97 LT	268	/*
	269	* Merge two trees together (t[1] and t[2]), using a common base (t[0])
	270	* as the origin.
	271	*
	272	* This walks the (sorted) trees in lock-step, checking every possible
	273	* name. Note that directories automatically sort differently from other
	274	* files (see "base_name_compare"), so you'll never see file/directory
	275	* conflicts, because they won't ever compare the same.
	276	*
	277	* IOW, if a directory changes to a filename, it will automatically be
	278	* seen as the directory going away, and the filename being created.
	279	*
	280	* Think of this as a three-way diff.
	281	*
	282	* The output will be either:
	283	* - successful merge
	284	* "0 mode sha1 filename"
	285	* NOTE NOTE NOTE! FIXME! We really really need to walk the index
	286	* in parallel with this too!
	287	*
	288	* - conflict:
	289	* "1 mode sha1 filename"
	290	* "2 mode sha1 filename"
	291	* "3 mode sha1 filename"
	292	* where not all of the 1/2/3 lines may exist, of course.
	293	*
	294	* The successful merge rules are the same as for the three-way merge
	295	* in git-read-tree.
	296	*/
91e4f036	297	static int threeway_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry entry, struct traverse_info info)
164dcb97 LT	298	{
	299	/* Same in both? */
	300	if (same_entry(entry+1, entry+2)) {
	301	if (entry[0].sha1) {
8dd15c6a	302	/* Modified identically */
40d934df	303	resolve(info, NULL, entry+1);
5803c6f8	304	return mask;
492e0759	305	}
8dd15c6a	306	/* "Both added the same" is left unresolved */
164dcb97	307	}
492e0759	308
164dcb97 LT	309	if (same_entry(entry+0, entry+1)) {
164dcb97 LT	310	if (entry[2].sha1 && !S_ISDIR(entry[2].mode)) {
8dd15c6a	311	/* We did not touch, they modified -- take theirs */
40d934df	312	resolve(info, entry+1, entry+2);
5803c6f8	313	return mask;
492e0759	314	}
8dd15c6a JH	315	/*
	316	* If we did not touch a directory but they made it
	317	* into a file, we fall through and unresolved()
	318	* recurses down. Likewise for the opposite case.
	319	*/
164dcb97	320	}
492e0759	321
164dcb97 LT	322	if (same_entry(entry+0, entry+2)) {
164dcb97 LT	323	if (entry[1].sha1 && !S_ISDIR(entry[1].mode)) {
8dd15c6a	324	/* We modified, they did not touch -- take ours */
40d934df	325	resolve(info, NULL, entry+1);
5803c6f8	326	return mask;
492e0759	327	}
492e0759	328	}
164dcb97	329
40d934df	330	unresolved(info, entry);
5803c6f8	331	return mask;
164dcb97 LT	332	}
164dcb97 LT	333
35ffe758	334	static void merge_trees_recursive(struct tree_desc t[3], const char *base, int df_conflict)
164dcb97	335	{
40d934df LT	336	struct traverse_info info;
	337
	338	setup_traverse_info(&info, base);
35ffe758	339	info.data = &df_conflict;
40d934df LT	340	info.fn = threeway_callback;
40d934df LT	341	traverse_trees(3, t, &info);
492e0759 LT	342	}
492e0759 LT	343
35ffe758 JH	344	static void merge_trees(struct tree_desc t[3], const char *base)
	345	{
	346	merge_trees_recursive(t, base, 0);
	347	}
	348
492e0759 LT	349	static void get_tree_descriptor(struct tree_desc desc, const char *rev)
	350	{
	351	unsigned char sha1[20];
	352	void *buf;
	353
31fff305	354	if (get_sha1(rev, sha1))
492e0759 LT	355	die("unknown rev %s", rev);
	356	buf = fill_tree_descriptor(desc, sha1);
	357	if (!buf)
	358	die("%s is not a tree", rev);
	359	return buf;
	360	}
	361
907a7cb5	362	int cmd_merge_tree(int argc, const char *argv, const char prefix)
492e0759 LT	363	{
	364	struct tree_desc t[3];
	365	void buf1, buf2, *buf3;
	366
5b6df8e4	367	if (argc != 4)
492e0759 LT	368	usage(merge_tree_usage);
	369
	370	buf1 = get_tree_descriptor(t+0, argv[1]);
	371	buf2 = get_tree_descriptor(t+1, argv[2]);
	372	buf3 = get_tree_descriptor(t+2, argv[3]);
	373	merge_trees(t, "");
	374	free(buf1);
	375	free(buf2);
	376	free(buf3);
83788070 LT	377
83788070 LT	378	show_result();
492e0759 LT	379	return 0;
492e0759 LT	380	}