2008-02-08 00:40:05 +08:00
|
|
|
#ifndef MERGE_RECURSIVE_H
|
|
|
|
#define MERGE_RECURSIVE_H
|
|
|
|
|
2019-08-18 02:41:41 +08:00
|
|
|
#include "strbuf.h"
|
2018-08-16 01:54:05 +08:00
|
|
|
|
|
|
|
struct commit;
|
2019-08-18 02:41:41 +08:00
|
|
|
struct commit_list;
|
|
|
|
struct object_id;
|
2019-01-12 10:13:29 +08:00
|
|
|
struct repository;
|
2019-08-18 02:41:41 +08:00
|
|
|
struct tree;
|
2019-01-12 10:13:29 +08:00
|
|
|
|
2019-08-18 02:41:41 +08:00
|
|
|
struct merge_options_internal;
|
2008-08-25 22:25:57 +08:00
|
|
|
struct merge_options {
|
2019-08-18 02:41:39 +08:00
|
|
|
struct repository *repo;
|
|
|
|
|
|
|
|
/* ref names used in console messages and conflict markers */
|
2010-03-21 08:41:38 +08:00
|
|
|
const char *ancestor;
|
2008-08-25 22:25:57 +08:00
|
|
|
const char *branch1;
|
|
|
|
const char *branch2;
|
2019-08-18 02:41:39 +08:00
|
|
|
|
|
|
|
/* rename related options */
|
|
|
|
int detect_renames;
|
2019-08-18 02:41:25 +08:00
|
|
|
enum {
|
|
|
|
MERGE_DIRECTORY_RENAMES_NONE = 0,
|
|
|
|
MERGE_DIRECTORY_RENAMES_CONFLICT = 1,
|
|
|
|
MERGE_DIRECTORY_RENAMES_TRUE = 2
|
|
|
|
} detect_directory_renames;
|
2019-08-18 02:41:38 +08:00
|
|
|
int rename_limit;
|
2010-09-28 07:58:25 +08:00
|
|
|
int rename_score;
|
2011-02-20 17:53:21 +08:00
|
|
|
int show_rename_progress;
|
2019-08-18 02:41:39 +08:00
|
|
|
|
|
|
|
/* xdiff-related options (patience, ignore whitespace, ours/theirs) */
|
|
|
|
long xdl_opts;
|
|
|
|
enum {
|
2019-08-18 02:41:42 +08:00
|
|
|
MERGE_VARIANT_NORMAL = 0,
|
|
|
|
MERGE_VARIANT_OURS,
|
|
|
|
MERGE_VARIANT_THEIRS
|
2019-08-18 02:41:39 +08:00
|
|
|
} recursive_variant;
|
|
|
|
|
|
|
|
/* console output related options */
|
|
|
|
int verbosity;
|
|
|
|
unsigned buffer_output; /* 1: output at end, 2: keep buffered */
|
merge-recursive: avoid losing output and leaking memory holding that output
If opt->buffer_output is less than 2, then merge_trees(),
merge_recursive(), and merge_recursive_generic() are all supposed to
flush the opt->obuf output buffer to stdout and release any memory it
holds. merge_trees() did not do this. Move the logic that handles this
for merge_recursive_internal() to merge_finalize() so that all three
methods handle this requirement.
Note that this bug didn't cause any problems currently, because there
are only two callers of merge_trees() right now (a git grep for
'merge_trees(' is misleading because builtin/merge-tree.c also defines a
'merge_tree' function that is unrelated), and only one of those is
called with buffer_output less than 2 (builtin/checkout.c), but it set
opt->verbosity to 0, for which there is only currently one non-error
message that would be shown: "Already up to date!". However, that one
message can only occur when the merge is utterly trivial (the merge base
tree exactly matches the merge tree), and builtin/checkout.c already
attempts a trivial merge via unpack_trees() before falling back to
merge_trees().
Also, if opt->buffer_output is 2, then the caller is responsible to
handle showing any output in opt->obuf and for free'ing it. This
requirement might be easy to overlook, so add a comment to
merge-recursive.h pointing it out. (There are currently two callers
that set buffer_output to 2, both in sequencer.c, and both of which
handle this correctly.)
Signed-off-by: Elijah Newren <newren@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2019-08-18 02:41:40 +08:00
|
|
|
struct strbuf obuf; /* output buffer; if buffer_output == 2, caller
|
|
|
|
* must handle and call strbuf_release */
|
2019-08-18 02:41:39 +08:00
|
|
|
|
|
|
|
/* miscellaneous control options */
|
|
|
|
const char *subtree_shift;
|
|
|
|
unsigned renormalize : 1;
|
|
|
|
|
2019-08-18 02:41:41 +08:00
|
|
|
/* internal fields used by the implementation */
|
|
|
|
struct merge_options_internal *priv;
|
2018-02-15 02:51:57 +08:00
|
|
|
};
|
|
|
|
|
2019-08-18 02:41:37 +08:00
|
|
|
void init_merge_options(struct merge_options *opt, struct repository *repo);
|
|
|
|
|
|
|
|
/* parse the option in s and update the relevant field of opt */
|
|
|
|
int parse_merge_opt(struct merge_options *opt, const char *s);
|
|
|
|
|
2018-04-20 01:58:05 +08:00
|
|
|
/*
|
2019-08-18 02:41:37 +08:00
|
|
|
* RETURN VALUES: All the merge_* functions below return a value as follows:
|
|
|
|
* > 0 Merge was clean
|
|
|
|
* = 0 Merge had conflicts
|
|
|
|
* < 0 Merge hit an unexpected and unrecoverable problem (e.g. disk
|
|
|
|
* full) and aborted merge part-way through.
|
2018-04-20 01:58:05 +08:00
|
|
|
*/
|
2018-04-20 01:58:07 +08:00
|
|
|
|
2019-08-18 02:41:37 +08:00
|
|
|
/*
|
|
|
|
* rename-detecting three-way merge, no recursion.
|
|
|
|
*
|
|
|
|
* Outputs:
|
|
|
|
* - See RETURN VALUES above
|
|
|
|
* - opt->repo->index has the new index
|
2020-08-02 11:14:27 +08:00
|
|
|
* - new index NOT written to disk
|
2019-08-18 02:41:37 +08:00
|
|
|
* - The working tree is updated with results of the merge
|
|
|
|
*/
|
|
|
|
int merge_trees(struct merge_options *opt,
|
|
|
|
struct tree *head,
|
|
|
|
struct tree *merge,
|
|
|
|
struct tree *merge_base);
|
2018-05-03 00:01:14 +08:00
|
|
|
|
2019-08-18 02:41:30 +08:00
|
|
|
/*
|
|
|
|
* merge_recursive is like merge_trees() but with recursive ancestor
|
2020-08-02 11:14:27 +08:00
|
|
|
* consolidation.
|
2019-08-18 02:41:30 +08:00
|
|
|
*
|
|
|
|
* NOTE: empirically, about a decade ago it was determined that with more
|
|
|
|
* than two merge bases, optimal behavior was found when the
|
2019-08-18 02:41:34 +08:00
|
|
|
* merge_bases were passed in the order of oldest commit to newest
|
|
|
|
* commit. Also, merge_bases will be consumed (emptied) so make a
|
|
|
|
* copy if you need it.
|
2019-08-18 02:41:37 +08:00
|
|
|
*
|
|
|
|
* Outputs:
|
|
|
|
* - See RETURN VALUES above
|
2020-08-02 11:14:27 +08:00
|
|
|
* - *result is treated as scratch space for temporary recursive merges
|
2019-08-18 02:41:37 +08:00
|
|
|
* - opt->repo->index has the new index
|
2020-08-02 11:14:27 +08:00
|
|
|
* - new index NOT written to disk
|
2019-08-18 02:41:37 +08:00
|
|
|
* - The working tree is updated with results of the merge
|
2019-08-18 02:41:30 +08:00
|
|
|
*/
|
2019-08-18 02:41:36 +08:00
|
|
|
int merge_recursive(struct merge_options *opt,
|
2008-08-25 22:25:57 +08:00
|
|
|
struct commit *h1,
|
2008-02-08 00:40:05 +08:00
|
|
|
struct commit *h2,
|
2019-08-18 02:41:34 +08:00
|
|
|
struct commit_list *merge_bases,
|
2008-02-08 00:40:05 +08:00
|
|
|
struct commit **result);
|
|
|
|
|
2019-08-18 02:41:30 +08:00
|
|
|
/*
|
2019-08-18 02:41:37 +08:00
|
|
|
* merge_recursive_generic can operate on trees instead of commits, by
|
|
|
|
* wrapping the trees into virtual commits, and calling merge_recursive().
|
|
|
|
* It also writes out the in-memory index to disk if the merge is successful.
|
|
|
|
*
|
|
|
|
* Outputs:
|
|
|
|
* - See RETURN VALUES above
|
2020-08-02 11:14:27 +08:00
|
|
|
* - *result is treated as scratch space for temporary recursive merges
|
2019-08-18 02:41:37 +08:00
|
|
|
* - opt->repo->index has the new index
|
2020-08-02 11:14:27 +08:00
|
|
|
* - new index also written to $GIT_INDEX_FILE on disk
|
2019-08-18 02:41:37 +08:00
|
|
|
* - The working tree is updated with results of the merge
|
2008-08-25 22:25:57 +08:00
|
|
|
*/
|
2019-08-18 02:41:36 +08:00
|
|
|
int merge_recursive_generic(struct merge_options *opt,
|
2016-06-25 07:09:28 +08:00
|
|
|
const struct object_id *head,
|
|
|
|
const struct object_id *merge,
|
2019-08-18 02:41:34 +08:00
|
|
|
int num_merge_bases,
|
|
|
|
const struct object_id **merge_bases,
|
2008-08-25 22:25:57 +08:00
|
|
|
struct commit **result);
|
|
|
|
|
2008-02-08 00:40:05 +08:00
|
|
|
#endif
|