blob: 767486c770afd385d118ee5f9a6f9cd3ad0a2d73 [file] [log] [blame]
Junio C Hamano1a4e8412005-12-27 08:17:231git-merge-base(1)
2=================
3
4NAME
5----
Junio C Hamano7c73c662007-01-19 00:37:506git-merge-base - Find as good common ancestors as possible for a merge
Junio C Hamano1a4e8412005-12-27 08:17:237
8
9SYNOPSIS
10--------
Junio C Hamano3f2f6e52008-08-21 10:34:2211'git merge-base' [--all] <commit> <commit>...
Junio C Hamano1a4e8412005-12-27 08:17:2312
13DESCRIPTION
14-----------
Junio C Hamano6959c6c2006-05-17 10:34:1115
Junio C Hamano3f2f6e52008-08-21 10:34:2216'git-merge-base' finds best common ancestor(s) between two commits to use
17in a three-way merge. One common ancestor is 'better' than another common
18ancestor if the latter is an ancestor of the former. A common ancestor
Junio C Hamanoec87f522008-12-10 08:35:2519that does not have any better common ancestor is a 'best common
Junio C Hamano3f2f6e52008-08-21 10:34:2220ancestor', i.e. a 'merge base'. Note that there can be more than one
Junio C Hamanoec87f522008-12-10 08:35:2521merge base for a pair of commits.
Junio C Hamano6959c6c2006-05-17 10:34:1122
Junio C Hamanoec87f522008-12-10 08:35:2523Among the two commits to compute the merge base from, one is specified by
Junio C Hamano3f2f6e52008-08-21 10:34:2224the first commit argument on the command line; the other commit is a
25(possibly hypothetical) commit that is a merge across all the remaining
Junio C Hamanoec87f522008-12-10 08:35:2526commits on the command line. As the most common special case, specifying only
27two commits on the command line means computing the merge base between
Junio C Hamano3f2f6e52008-08-21 10:34:2228the given two commits.
Junio C Hamano1a4e8412005-12-27 08:17:2329
Junio C Hamano6959c6c2006-05-17 10:34:1130OPTIONS
31-------
32--all::
Junio C Hamano3f2f6e52008-08-21 10:34:2233Output all merge bases for the commits, instead of just one.
34
35DISCUSSION
36----------
37
38Given two commits 'A' and 'B', `git merge-base A B` will output a commit
39which is reachable from both 'A' and 'B' through the parent relationship.
40
41For example, with this topology:
42
43 o---o---o---B
44/
45---o---1---o---o---o---A
46
47the merge base between 'A' and 'B' is '1'.
48
49Given three commits 'A', 'B' and 'C', `git merge-base A B C` will compute the
Junio C Hamanoec87f522008-12-10 08:35:2550merge base between 'A' and a hypothetical commit 'M', which is a merge
Junio C Hamano3f2f6e52008-08-21 10:34:2251between 'B' and 'C'. For example, with this topology:
52
53 o---o---o---o---C
54 /
55 / o---o---o---B
56 / /
57---2---1---o---o---o---A
58
59the result of `git merge-base A B C` is '1'. This is because the
60equivalent topology with a merge commit 'M' between 'B' and 'C' is:
61
62
63 o---o---o---o---o
64 / \
65 / o---o---o---o---M
66 / /
67---2---1---o---o---o---A
68
69and the result of `git merge-base A M` is '1'. Commit '2' is also a
70common ancestor between 'A' and 'M', but '1' is a better common ancestor,
71because '2' is an ancestor of '1'. Hence, '2' is not a merge base.
72
73When the history involves criss-cross merges, there can be more than one
Junio C Hamanoec87f522008-12-10 08:35:2574'best' common ancestor for two commits. For example, with this topology:
Junio C Hamano3f2f6e52008-08-21 10:34:2275
76 ---1---o---A
77 \ /
78 X
79 / \
80 ---2---o---o---B
81
Junio C Hamanoec87f522008-12-10 08:35:2582both '1' and '2' are merge-bases of A and B. Neither one is better than
83the other (both are 'best' merge bases). When the `--all` option is not given,
Junio C Hamano3f2f6e52008-08-21 10:34:2284it is unspecified which best one is output.
Junio C Hamano1a4e8412005-12-27 08:17:2385
86Author
87------
88Written by Linus Torvalds <torvalds@osdl.org>
89
90Documentation
91--------------
92Documentation by David Greaves, Junio C Hamano and the git-list <git@vger.kernel.org>.
93
94GIT
95---
Junio C Hamanof7c042d2008-06-06 22:50:5396Part of the linkgit:git[1] suite