2011-08-04 14:39:11 +04:00
|
|
|
#include "cache.h"
|
2014-10-01 14:28:42 +04:00
|
|
|
#include "lockfile.h"
|
2011-08-04 14:39:11 +04:00
|
|
|
#include "sequencer.h"
|
|
|
|
#include "dir.h"
|
2012-01-11 22:15:57 +04:00
|
|
|
#include "object.h"
|
|
|
|
#include "commit.h"
|
|
|
|
#include "tag.h"
|
|
|
|
#include "run-command.h"
|
|
|
|
#include "exec_cmd.h"
|
|
|
|
#include "utf8.h"
|
|
|
|
#include "cache-tree.h"
|
|
|
|
#include "diff.h"
|
|
|
|
#include "revision.h"
|
|
|
|
#include "rerere.h"
|
|
|
|
#include "merge-recursive.h"
|
|
|
|
#include "refs.h"
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
#include "argv-array.h"
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
#define GIT_REFLOG_ACTION "GIT_REFLOG_ACTION"
|
2011-08-04 14:39:11 +04:00
|
|
|
|
2012-09-14 10:52:03 +04:00
|
|
|
const char sign_off_header[] = "Signed-off-by: ";
|
2013-02-12 14:17:32 +04:00
|
|
|
static const char cherry_picked_prefix[] = "(cherry picked from commit ";
|
2012-09-14 10:52:03 +04:00
|
|
|
|
2016-10-14 16:17:12 +03:00
|
|
|
GIT_PATH_FUNC(git_path_seq_dir, "sequencer")
|
|
|
|
|
|
|
|
static GIT_PATH_FUNC(git_path_todo_file, "sequencer/todo")
|
|
|
|
static GIT_PATH_FUNC(git_path_opts_file, "sequencer/opts")
|
|
|
|
static GIT_PATH_FUNC(git_path_head_file, "sequencer/head")
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
|
2016-10-21 15:25:04 +03:00
|
|
|
/*
|
|
|
|
* A script to set the GIT_AUTHOR_NAME, GIT_AUTHOR_EMAIL, and
|
|
|
|
* GIT_AUTHOR_DATE that will be used for the commit that is currently
|
|
|
|
* being rebased.
|
|
|
|
*/
|
|
|
|
static GIT_PATH_FUNC(rebase_path_author_script, "rebase-merge/author-script")
|
|
|
|
|
|
|
|
/* We will introduce the 'interactive rebase' mode later */
|
|
|
|
static inline int is_rebase_i(const struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-10-14 16:17:20 +03:00
|
|
|
static const char *get_dir(const struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
return git_path_seq_dir();
|
|
|
|
}
|
|
|
|
|
2016-10-21 15:24:32 +03:00
|
|
|
static const char *get_todo_path(const struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
return git_path_todo_file();
|
|
|
|
}
|
|
|
|
|
2013-02-12 14:17:34 +04:00
|
|
|
static int is_rfc2822_line(const char *buf, int len)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
int ch = buf[i];
|
|
|
|
if (ch == ':')
|
|
|
|
return 1;
|
|
|
|
if (!isalnum(ch) && ch != '-')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int is_cherry_picked_from_line(const char *buf, int len)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* We only care that it looks roughly like (cherry picked from ...)
|
|
|
|
*/
|
|
|
|
return len > strlen(cherry_picked_prefix) + 1 &&
|
2013-12-01 00:55:40 +04:00
|
|
|
starts_with(buf, cherry_picked_prefix) && buf[len - 1] == ')';
|
2013-02-12 14:17:34 +04:00
|
|
|
}
|
|
|
|
|
2013-02-12 14:17:35 +04:00
|
|
|
/*
|
|
|
|
* Returns 0 for non-conforming footer
|
|
|
|
* Returns 1 for conforming footer
|
|
|
|
* Returns 2 when sob exists within conforming footer
|
|
|
|
* Returns 3 when sob exists within conforming footer as last entry
|
|
|
|
*/
|
|
|
|
static int has_conforming_footer(struct strbuf *sb, struct strbuf *sob,
|
|
|
|
int ignore_footer)
|
2013-02-12 14:17:34 +04:00
|
|
|
{
|
|
|
|
char prev;
|
|
|
|
int i, k;
|
|
|
|
int len = sb->len - ignore_footer;
|
|
|
|
const char *buf = sb->buf;
|
2013-02-12 14:17:35 +04:00
|
|
|
int found_sob = 0;
|
2013-02-12 14:17:34 +04:00
|
|
|
|
|
|
|
/* footer must end with newline */
|
|
|
|
if (!len || buf[len - 1] != '\n')
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
prev = '\0';
|
|
|
|
for (i = len - 1; i > 0; i--) {
|
|
|
|
char ch = buf[i];
|
|
|
|
if (prev == '\n' && ch == '\n') /* paragraph break */
|
|
|
|
break;
|
|
|
|
prev = ch;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* require at least one blank line */
|
|
|
|
if (prev != '\n' || buf[i] != '\n')
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* advance to start of last paragraph */
|
|
|
|
while (i < len - 1 && buf[i] == '\n')
|
|
|
|
i++;
|
|
|
|
|
|
|
|
for (; i < len; i = k) {
|
2013-02-12 14:17:35 +04:00
|
|
|
int found_rfc2822;
|
|
|
|
|
2013-02-12 14:17:34 +04:00
|
|
|
for (k = i; k < len && buf[k] != '\n'; k++)
|
|
|
|
; /* do nothing */
|
|
|
|
k++;
|
|
|
|
|
2013-02-12 14:17:35 +04:00
|
|
|
found_rfc2822 = is_rfc2822_line(buf + i, k - i - 1);
|
|
|
|
if (found_rfc2822 && sob &&
|
|
|
|
!strncmp(buf + i, sob->buf, sob->len))
|
|
|
|
found_sob = k;
|
|
|
|
|
|
|
|
if (!(found_rfc2822 ||
|
|
|
|
is_cherry_picked_from_line(buf + i, k - i - 1)))
|
2013-02-12 14:17:34 +04:00
|
|
|
return 0;
|
|
|
|
}
|
2013-02-12 14:17:35 +04:00
|
|
|
if (found_sob == i)
|
|
|
|
return 3;
|
|
|
|
if (found_sob)
|
|
|
|
return 2;
|
2013-02-12 14:17:34 +04:00
|
|
|
return 1;
|
|
|
|
}
|
2012-09-14 10:52:03 +04:00
|
|
|
|
2016-10-21 15:24:55 +03:00
|
|
|
int sequencer_remove_state(struct replay_opts *opts)
|
2011-08-04 14:39:11 +04:00
|
|
|
{
|
2016-10-14 16:17:20 +03:00
|
|
|
struct strbuf dir = STRBUF_INIT;
|
2016-10-21 15:24:13 +03:00
|
|
|
int i;
|
|
|
|
|
|
|
|
free(opts->gpg_sign);
|
|
|
|
free(opts->strategy);
|
|
|
|
for (i = 0; i < opts->xopts_nr; i++)
|
|
|
|
free(opts->xopts[i]);
|
|
|
|
free(opts->xopts);
|
2011-08-04 14:39:11 +04:00
|
|
|
|
2016-10-14 16:17:20 +03:00
|
|
|
strbuf_addf(&dir, "%s", get_dir(opts));
|
|
|
|
remove_dir_recursively(&dir, 0);
|
|
|
|
strbuf_release(&dir);
|
2016-10-21 15:24:55 +03:00
|
|
|
|
|
|
|
return 0;
|
2011-08-04 14:39:11 +04:00
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
static const char *action_name(const struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
return opts->action == REPLAY_REVERT ? "revert" : "cherry-pick";
|
|
|
|
}
|
|
|
|
|
|
|
|
struct commit_message {
|
|
|
|
char *parent_label;
|
2016-02-23 01:44:57 +03:00
|
|
|
char *label;
|
|
|
|
char *subject;
|
2012-01-11 22:15:57 +04:00
|
|
|
const char *message;
|
|
|
|
};
|
|
|
|
|
2016-10-21 15:24:37 +03:00
|
|
|
static const char *short_commit_name(struct commit *commit)
|
|
|
|
{
|
|
|
|
return find_unique_abbrev(commit->object.oid.hash, DEFAULT_ABBREV);
|
|
|
|
}
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
static int get_message(struct commit *commit, struct commit_message *out)
|
|
|
|
{
|
|
|
|
const char *abbrev, *subject;
|
2016-02-23 01:44:57 +03:00
|
|
|
int subject_len;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
2016-02-23 01:44:57 +03:00
|
|
|
out->message = logmsg_reencode(commit, NULL, get_commit_output_encoding());
|
2016-10-21 15:24:37 +03:00
|
|
|
abbrev = short_commit_name(commit);
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
subject_len = find_commit_subject(out->message, &subject);
|
|
|
|
|
2016-02-23 01:44:57 +03:00
|
|
|
out->subject = xmemdupz(subject, subject_len);
|
|
|
|
out->label = xstrfmt("%s... %s", abbrev, out->subject);
|
|
|
|
out->parent_label = xstrfmt("parent of %s", out->label);
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-06-11 01:39:35 +04:00
|
|
|
static void free_message(struct commit *commit, struct commit_message *msg)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
free(msg->parent_label);
|
2016-02-23 01:44:57 +03:00
|
|
|
free(msg->label);
|
|
|
|
free(msg->subject);
|
2014-06-11 01:41:39 +04:00
|
|
|
unuse_commit_buffer(commit, msg->message);
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2012-02-22 04:44:17 +04:00
|
|
|
static void print_advice(int show_hint, struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
char *msg = getenv("GIT_CHERRY_PICK_HELP");
|
|
|
|
|
|
|
|
if (msg) {
|
|
|
|
fprintf(stderr, "%s\n", msg);
|
|
|
|
/*
|
2013-04-12 02:36:10 +04:00
|
|
|
* A conflict has occurred but the porcelain
|
2012-01-11 22:15:57 +04:00
|
|
|
* (typically rebase --interactive) wants to take care
|
|
|
|
* of the commit itself so remove CHERRY_PICK_HEAD
|
|
|
|
*/
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
unlink(git_path_cherry_pick_head());
|
2012-01-11 22:15:57 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2012-02-22 04:44:17 +04:00
|
|
|
if (show_hint) {
|
|
|
|
if (opts->no_commit)
|
|
|
|
advise(_("after resolving the conflicts, mark the corrected paths\n"
|
|
|
|
"with 'git add <paths>' or 'git rm <paths>'"));
|
|
|
|
else
|
|
|
|
advise(_("after resolving the conflicts, mark the corrected paths\n"
|
|
|
|
"with 'git add <paths>' or 'git rm <paths>'\n"
|
|
|
|
"and commit the result with 'git commit'"));
|
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2016-09-09 17:37:05 +03:00
|
|
|
static int write_message(struct strbuf *msgbuf, const char *filename)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
static struct lock_file msg_file;
|
|
|
|
|
2016-09-09 17:37:05 +03:00
|
|
|
int msg_fd = hold_lock_file_for_update(&msg_file, filename, 0);
|
|
|
|
if (msg_fd < 0)
|
|
|
|
return error_errno(_("Could not lock '%s'"), filename);
|
2012-01-11 22:15:57 +04:00
|
|
|
if (write_in_full(msg_fd, msgbuf->buf, msgbuf->len) < 0)
|
2016-09-09 17:37:05 +03:00
|
|
|
return error_errno(_("Could not write to %s"), filename);
|
2012-01-11 22:15:57 +04:00
|
|
|
strbuf_release(msgbuf);
|
|
|
|
if (commit_lock_file(&msg_file) < 0)
|
2016-09-09 17:37:05 +03:00
|
|
|
return error(_("Error wrapping up %s."), filename);
|
|
|
|
|
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct tree *empty_tree(void)
|
|
|
|
{
|
2012-03-22 22:53:24 +04:00
|
|
|
return lookup_tree(EMPTY_TREE_SHA1_BIN);
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int error_dirty_index(struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
if (read_cache_unmerged())
|
|
|
|
return error_resolve_conflict(action_name(opts));
|
|
|
|
|
2016-10-21 15:24:50 +03:00
|
|
|
error(_("Your local changes would be overwritten by %s."),
|
|
|
|
action_name(opts));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (advice_commit_before_merge)
|
|
|
|
advise(_("Commit your changes or stash them to proceed."));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2012-12-21 23:10:11 +04:00
|
|
|
static int fast_forward_to(const unsigned char *to, const unsigned char *from,
|
2013-06-19 11:37:09 +04:00
|
|
|
int unborn, struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
2014-04-17 02:37:45 +04:00
|
|
|
struct ref_transaction *transaction;
|
2013-06-19 11:37:09 +04:00
|
|
|
struct strbuf sb = STRBUF_INIT;
|
2014-04-17 02:37:45 +04:00
|
|
|
struct strbuf err = STRBUF_INIT;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
read_cache();
|
2012-10-26 19:53:49 +04:00
|
|
|
if (checkout_fast_forward(from, to, 1))
|
2016-09-09 17:37:55 +03:00
|
|
|
return -1; /* the callee should have complained already */
|
2014-04-16 22:56:52 +04:00
|
|
|
|
2016-06-17 23:20:55 +03:00
|
|
|
strbuf_addf(&sb, _("%s: fast-forward"), action_name(opts));
|
2014-04-17 02:37:45 +04:00
|
|
|
|
|
|
|
transaction = ref_transaction_begin(&err);
|
|
|
|
if (!transaction ||
|
|
|
|
ref_transaction_update(transaction, "HEAD",
|
|
|
|
to, unborn ? null_sha1 : from,
|
2015-02-17 20:00:15 +03:00
|
|
|
0, sb.buf, &err) ||
|
2014-04-30 23:22:42 +04:00
|
|
|
ref_transaction_commit(transaction, &err)) {
|
2014-04-17 02:37:45 +04:00
|
|
|
ref_transaction_free(transaction);
|
|
|
|
error("%s", err.buf);
|
|
|
|
strbuf_release(&sb);
|
|
|
|
strbuf_release(&err);
|
|
|
|
return -1;
|
|
|
|
}
|
2014-04-16 22:56:52 +04:00
|
|
|
|
2013-06-19 11:37:09 +04:00
|
|
|
strbuf_release(&sb);
|
2014-04-17 02:37:45 +04:00
|
|
|
strbuf_release(&err);
|
|
|
|
ref_transaction_free(transaction);
|
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2014-10-24 22:34:59 +04:00
|
|
|
void append_conflicts_hint(struct strbuf *msgbuf)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2014-10-28 23:04:38 +03:00
|
|
|
strbuf_addch(msgbuf, '\n');
|
|
|
|
strbuf_commented_addf(msgbuf, "Conflicts:\n");
|
2014-10-24 22:34:59 +04:00
|
|
|
for (i = 0; i < active_nr;) {
|
|
|
|
const struct cache_entry *ce = active_cache[i++];
|
|
|
|
if (ce_stage(ce)) {
|
2014-10-28 23:04:38 +03:00
|
|
|
strbuf_commented_addf(msgbuf, "\t%s\n", ce->name);
|
2014-10-24 22:34:59 +04:00
|
|
|
while (i < active_nr && !strcmp(ce->name,
|
|
|
|
active_cache[i]->name))
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
static int do_recursive_merge(struct commit *base, struct commit *next,
|
|
|
|
const char *base_label, const char *next_label,
|
|
|
|
unsigned char *head, struct strbuf *msgbuf,
|
|
|
|
struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
struct merge_options o;
|
|
|
|
struct tree *result, *next_tree, *base_tree, *head_tree;
|
2014-06-13 16:19:23 +04:00
|
|
|
int clean;
|
2016-10-21 15:24:13 +03:00
|
|
|
char **xopt;
|
2012-01-11 22:15:57 +04:00
|
|
|
static struct lock_file index_lock;
|
|
|
|
|
2014-06-13 16:19:23 +04:00
|
|
|
hold_locked_index(&index_lock, 1);
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
read_cache();
|
|
|
|
|
|
|
|
init_merge_options(&o);
|
|
|
|
o.ancestor = base ? base_label : "(empty tree)";
|
|
|
|
o.branch1 = "HEAD";
|
|
|
|
o.branch2 = next ? next_label : "(empty tree)";
|
|
|
|
|
|
|
|
head_tree = parse_tree_indirect(head);
|
|
|
|
next_tree = next ? next->tree : empty_tree();
|
|
|
|
base_tree = base ? base->tree : empty_tree();
|
|
|
|
|
|
|
|
for (xopt = opts->xopts; xopt != opts->xopts + opts->xopts_nr; xopt++)
|
|
|
|
parse_merge_opt(&o, *xopt);
|
|
|
|
|
|
|
|
clean = merge_trees(&o,
|
|
|
|
head_tree,
|
|
|
|
next_tree, base_tree, &result);
|
2016-08-01 14:44:53 +03:00
|
|
|
strbuf_release(&o.obuf);
|
prepare the builtins for a libified merge_recursive()
Previously, callers of merge_trees() or merge_recursive() expected that
code to die() with an error message. This used to be okay because we
called those commands from scripts, and had a chance to print out a
message in case the command failed fatally (read: with exit code 128).
As scripting incurs its own set of problems (portability, speed,
idiosyncrasies of different shells, limited data structures leading to
inefficient code), we are converting more and more of these scripts into
builtins, using library functions directly.
We already tried to use merge_recursive() directly in the builtin
git-am, for example. Unfortunately, we had to roll it back temporarily
because some of the code in merge-recursive.c still deemed it okay to
call die(), when the builtin am code really wanted to print out a useful
advice after the merge failed fatally. In the next commits, we want to
fix that.
The code touched by this commit expected merge_trees() to die() with
some useful message when there is an error condition, but merge_trees()
is going to be improved by converting all die() calls to return error()
instead (i.e. return value -1 after printing out the message as before),
so that the caller can react more flexibly.
This is a step to prepare for the version of merge_trees() that no
longer dies, even if we just imitate the previous behavior by calling
exit(128): this is what callers of e.g. `git merge` have come to expect.
Note that the callers of the sequencer (revert and cherry-pick) already
fail fast even for the return value -1; The only difference is that they
now get a chance to say "<command> failed".
A caller of merge_trees() might want handle error messages themselves
(or even suppress them). As this patch is already complex enough, we
leave that change for a later patch.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-07-26 19:06:02 +03:00
|
|
|
if (clean < 0)
|
|
|
|
return clean;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (active_cache_changed &&
|
2014-06-13 16:19:23 +04:00
|
|
|
write_locked_index(&the_index, &index_lock, COMMIT_LOCK))
|
2012-01-11 22:15:57 +04:00
|
|
|
/* TRANSLATORS: %s will be "revert" or "cherry-pick" */
|
2016-09-09 17:37:10 +03:00
|
|
|
return error(_("%s: Unable to write new index file"),
|
|
|
|
action_name(opts));
|
2012-01-11 22:15:57 +04:00
|
|
|
rollback_lock_file(&index_lock);
|
|
|
|
|
2012-09-14 10:52:03 +04:00
|
|
|
if (opts->signoff)
|
2013-02-12 14:17:35 +04:00
|
|
|
append_signoff(msgbuf, 0, 0);
|
2012-09-14 10:52:03 +04:00
|
|
|
|
2014-10-24 22:34:59 +04:00
|
|
|
if (!clean)
|
|
|
|
append_conflicts_hint(msgbuf);
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
return !clean;
|
|
|
|
}
|
|
|
|
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
static int is_index_unchanged(void)
|
|
|
|
{
|
|
|
|
unsigned char head_sha1[20];
|
|
|
|
struct commit *head_commit;
|
|
|
|
|
2014-07-15 23:59:36 +04:00
|
|
|
if (!resolve_ref_unsafe("HEAD", RESOLVE_REF_READING, head_sha1, NULL))
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
return error(_("Could not resolve HEAD commit\n"));
|
|
|
|
|
|
|
|
head_commit = lookup_commit(head_sha1);
|
2012-05-03 16:10:22 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If head_commit is NULL, check_commit, called from
|
|
|
|
* lookup_commit, would have indicated that head_commit is not
|
|
|
|
* a commit object already. parse_commit() will return failure
|
|
|
|
* without further complaints in such a case. Otherwise, if
|
|
|
|
* the commit is invalid, parse_commit() will complain. So
|
|
|
|
* there is nothing for us to say here. Just return failure.
|
|
|
|
*/
|
|
|
|
if (parse_commit(head_commit))
|
|
|
|
return -1;
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
|
|
|
|
if (!active_cache_tree)
|
|
|
|
active_cache_tree = cache_tree();
|
|
|
|
|
|
|
|
if (!cache_tree_fully_valid(active_cache_tree))
|
2014-06-13 16:19:32 +04:00
|
|
|
if (cache_tree_update(&the_index, 0))
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
return error(_("Unable to update cache tree\n"));
|
|
|
|
|
2015-11-10 05:22:29 +03:00
|
|
|
return !hashcmp(active_cache_tree->sha1, head_commit->tree->object.oid.hash);
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
}
|
|
|
|
|
2016-10-21 15:25:04 +03:00
|
|
|
/*
|
|
|
|
* Read the author-script file into an environment block, ready for use in
|
|
|
|
* run_command(), that can be free()d afterwards.
|
|
|
|
*/
|
|
|
|
static char **read_author_script(void)
|
|
|
|
{
|
|
|
|
struct strbuf script = STRBUF_INIT;
|
|
|
|
int i, count = 0;
|
|
|
|
char *p, *p2, **env;
|
|
|
|
size_t env_size;
|
|
|
|
|
|
|
|
if (strbuf_read_file(&script, rebase_path_author_script(), 256) <= 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
for (p = script.buf; *p; p++)
|
|
|
|
if (skip_prefix(p, "'\\\\''", (const char **)&p2))
|
|
|
|
strbuf_splice(&script, p - script.buf, p2 - p, "'", 1);
|
|
|
|
else if (*p == '\'')
|
|
|
|
strbuf_splice(&script, p-- - script.buf, 1, "", 0);
|
|
|
|
else if (*p == '\n') {
|
|
|
|
*p = '\0';
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
env_size = (count + 1) * sizeof(*env);
|
|
|
|
strbuf_grow(&script, env_size);
|
|
|
|
memmove(script.buf + env_size, script.buf, script.len);
|
|
|
|
p = script.buf + env_size;
|
|
|
|
env = (char **)strbuf_detach(&script, NULL);
|
|
|
|
|
|
|
|
for (i = 0; i < count; i++) {
|
|
|
|
env[i] = p;
|
|
|
|
p += strlen(p) + 1;
|
|
|
|
}
|
|
|
|
env[count] = NULL;
|
|
|
|
|
|
|
|
return env;
|
|
|
|
}
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
/*
|
|
|
|
* If we are cherry-pick, and if the merge did not result in
|
|
|
|
* hand-editing, we will hit this commit and inherit the original
|
|
|
|
* author date and name.
|
2016-10-21 15:25:04 +03:00
|
|
|
*
|
2012-01-11 22:15:57 +04:00
|
|
|
* If we are revert, or if our cherry-pick results in a hand merge,
|
|
|
|
* we had better say that the current user is responsible for that.
|
2016-10-21 15:25:04 +03:00
|
|
|
*
|
|
|
|
* An exception is when run_git_commit() is called during an
|
|
|
|
* interactive rebase: in that case, we will want to retain the
|
|
|
|
* author metadata.
|
2012-01-11 22:15:57 +04:00
|
|
|
*/
|
2012-05-30 04:14:41 +04:00
|
|
|
static int run_git_commit(const char *defmsg, struct replay_opts *opts,
|
|
|
|
int allow_empty)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
2016-10-21 15:25:04 +03:00
|
|
|
char **env = NULL;
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
struct argv_array array;
|
|
|
|
int rc;
|
2015-03-06 16:55:32 +03:00
|
|
|
const char *value;
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
|
2016-10-21 15:25:04 +03:00
|
|
|
if (is_rebase_i(opts)) {
|
|
|
|
env = read_author_script();
|
|
|
|
if (!env)
|
|
|
|
return error("You have staged changes in your working "
|
|
|
|
"tree. If these changes are meant to be\n"
|
|
|
|
"squashed into the previous commit, run:\n\n"
|
|
|
|
" git commit --amend $gpg_sign_opt_quoted\n\n"
|
|
|
|
"If they are meant to go into a new commit, "
|
|
|
|
"run:\n\n"
|
|
|
|
" git commit $gpg_sign_opt_quoted\n\n"
|
|
|
|
"In both cases, once you're done, continue "
|
|
|
|
"with:\n\n"
|
|
|
|
" git rebase --continue\n");
|
|
|
|
}
|
|
|
|
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
argv_array_init(&array);
|
|
|
|
argv_array_push(&array, "commit");
|
|
|
|
argv_array_push(&array, "-n");
|
2012-01-11 22:15:57 +04:00
|
|
|
|
2014-06-20 01:28:20 +04:00
|
|
|
if (opts->gpg_sign)
|
|
|
|
argv_array_pushf(&array, "-S%s", opts->gpg_sign);
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->signoff)
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
argv_array_push(&array, "-s");
|
2016-10-21 15:25:04 +03:00
|
|
|
if (defmsg)
|
|
|
|
argv_array_pushl(&array, "-F", defmsg, NULL);
|
|
|
|
if (opts->edit)
|
|
|
|
argv_array_push(&array, "-e");
|
|
|
|
else if (!opts->signoff && !opts->record_origin &&
|
|
|
|
git_config_get_value("commit.cleanup", &value))
|
|
|
|
argv_array_push(&array, "--cleanup=verbatim");
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
|
2012-05-30 04:14:41 +04:00
|
|
|
if (allow_empty)
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
argv_array_push(&array, "--allow-empty");
|
2012-04-12 00:21:53 +04:00
|
|
|
|
2012-08-02 14:38:51 +04:00
|
|
|
if (opts->allow_empty_message)
|
|
|
|
argv_array_push(&array, "--allow-empty-message");
|
|
|
|
|
2016-10-21 15:25:04 +03:00
|
|
|
rc = run_command_v_opt_cd_env(array.argv, RUN_GIT_CMD, NULL,
|
|
|
|
(const char *const *)env);
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
argv_array_clear(&array);
|
2016-10-21 15:25:04 +03:00
|
|
|
free(env);
|
|
|
|
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int is_original_commit_empty(struct commit *commit)
|
|
|
|
{
|
|
|
|
const unsigned char *ptree_sha1;
|
|
|
|
|
|
|
|
if (parse_commit(commit))
|
|
|
|
return error(_("Could not parse commit %s\n"),
|
2015-11-10 05:22:28 +03:00
|
|
|
oid_to_hex(&commit->object.oid));
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
if (commit->parents) {
|
|
|
|
struct commit *parent = commit->parents->item;
|
|
|
|
if (parse_commit(parent))
|
|
|
|
return error(_("Could not parse parent commit %s\n"),
|
2015-11-10 05:22:28 +03:00
|
|
|
oid_to_hex(&parent->object.oid));
|
2015-11-10 05:22:29 +03:00
|
|
|
ptree_sha1 = parent->tree->object.oid.hash;
|
git-cherry-pick: Add keep-redundant-commits option
The git-cherry-pick --allow-empty command by default only preserves empty
commits that were originally empty, i.e only those commits for which
<commit>^{tree} and <commit>^^{tree} are equal. By default commits which are
non-empty, but were made empty by the inclusion of a prior commit on the current
history are filtered out. This option allows us to override that behavior and
include redundant commits as empty commits in the change history.
Note that this patch changes the default behavior of git cherry-pick slightly.
Prior to this patch all commits in a cherry-pick sequence were applied and git
commit was run. The implication here was that, if a commit was redundant, and
the commit did not trigger the fast forward logic, the git commit operation, and
therefore the git cherry-pick operation would fail, displaying the cherry pick
advice (i.e. run git commit --allow-empty). With this patch however, such
redundant commits are automatically skipped without stopping, unless
--keep-redundant-commits is specified, in which case, they are automatically
applied as empty commits.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2012-04-20 18:36:15 +04:00
|
|
|
} else {
|
|
|
|
ptree_sha1 = EMPTY_TREE_SHA1_BIN; /* commit is root */
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2015-11-10 05:22:29 +03:00
|
|
|
return !hashcmp(ptree_sha1, commit->tree->object.oid.hash);
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2012-05-30 04:14:41 +04:00
|
|
|
/*
|
|
|
|
* Do we run "git commit" with "--allow-empty"?
|
|
|
|
*/
|
|
|
|
static int allow_empty(struct replay_opts *opts, struct commit *commit)
|
|
|
|
{
|
|
|
|
int index_unchanged, empty_commit;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Three cases:
|
|
|
|
*
|
|
|
|
* (1) we do not allow empty at all and error out.
|
|
|
|
*
|
|
|
|
* (2) we allow ones that were initially empty, but
|
|
|
|
* forbid the ones that become empty;
|
|
|
|
*
|
|
|
|
* (3) we allow both.
|
|
|
|
*/
|
|
|
|
if (!opts->allow_empty)
|
|
|
|
return 0; /* let "git commit" barf as necessary */
|
|
|
|
|
|
|
|
index_unchanged = is_index_unchanged();
|
|
|
|
if (index_unchanged < 0)
|
|
|
|
return index_unchanged;
|
|
|
|
if (!index_unchanged)
|
|
|
|
return 0; /* we do not have to say --allow-empty */
|
|
|
|
|
|
|
|
if (opts->keep_redundant_commits)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
empty_commit = is_original_commit_empty(commit);
|
|
|
|
if (empty_commit < 0)
|
|
|
|
return empty_commit;
|
|
|
|
if (!empty_commit)
|
|
|
|
return 0;
|
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
enum todo_command {
|
|
|
|
TODO_PICK = 0,
|
|
|
|
TODO_REVERT
|
|
|
|
};
|
|
|
|
|
|
|
|
static const char *todo_command_strings[] = {
|
|
|
|
"pick",
|
|
|
|
"revert"
|
|
|
|
};
|
|
|
|
|
|
|
|
static const char *command_to_string(const enum todo_command command)
|
|
|
|
{
|
|
|
|
if (command < ARRAY_SIZE(todo_command_strings))
|
|
|
|
return todo_command_strings[command];
|
|
|
|
die("Unknown command: %d", command);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int do_pick_commit(enum todo_command command, struct commit *commit,
|
|
|
|
struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
unsigned char head[20];
|
|
|
|
struct commit *base, *next, *parent;
|
|
|
|
const char *base_label, *next_label;
|
2014-06-11 01:39:35 +04:00
|
|
|
struct commit_message msg = { NULL, NULL, NULL, NULL };
|
2012-01-11 22:15:57 +04:00
|
|
|
struct strbuf msgbuf = STRBUF_INIT;
|
2013-05-29 07:56:21 +04:00
|
|
|
int res, unborn = 0, allow;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (opts->no_commit) {
|
|
|
|
/*
|
|
|
|
* We do not intend to commit immediately. We just want to
|
|
|
|
* merge the differences in, so let's compute the tree
|
|
|
|
* that represents the "current" state for merge-recursive
|
|
|
|
* to work on.
|
|
|
|
*/
|
|
|
|
if (write_cache_as_tree(head, 0, NULL))
|
2016-09-09 17:37:12 +03:00
|
|
|
return error(_("Your index file is unmerged."));
|
2012-01-11 22:15:57 +04:00
|
|
|
} else {
|
2012-12-21 23:10:11 +04:00
|
|
|
unborn = get_sha1("HEAD", head);
|
|
|
|
if (unborn)
|
|
|
|
hashcpy(head, EMPTY_TREE_SHA1_BIN);
|
|
|
|
if (index_differs_from(unborn ? EMPTY_TREE_SHA1_HEX : "HEAD", 0))
|
2012-01-11 22:15:57 +04:00
|
|
|
return error_dirty_index(opts);
|
|
|
|
}
|
|
|
|
discard_cache();
|
|
|
|
|
|
|
|
if (!commit->parents) {
|
|
|
|
parent = NULL;
|
|
|
|
}
|
|
|
|
else if (commit->parents->next) {
|
|
|
|
/* Reverting or cherry-picking a merge commit */
|
|
|
|
int cnt;
|
|
|
|
struct commit_list *p;
|
|
|
|
|
|
|
|
if (!opts->mainline)
|
|
|
|
return error(_("Commit %s is a merge but no -m option was given."),
|
2015-11-10 05:22:28 +03:00
|
|
|
oid_to_hex(&commit->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
for (cnt = 1, p = commit->parents;
|
|
|
|
cnt != opts->mainline && p;
|
|
|
|
cnt++)
|
|
|
|
p = p->next;
|
|
|
|
if (cnt != opts->mainline || !p)
|
|
|
|
return error(_("Commit %s does not have parent %d"),
|
2015-11-10 05:22:28 +03:00
|
|
|
oid_to_hex(&commit->object.oid), opts->mainline);
|
2012-01-11 22:15:57 +04:00
|
|
|
parent = p->item;
|
|
|
|
} else if (0 < opts->mainline)
|
|
|
|
return error(_("Mainline was specified but commit %s is not a merge."),
|
2015-11-10 05:22:28 +03:00
|
|
|
oid_to_hex(&commit->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
else
|
|
|
|
parent = commit->parents->item;
|
|
|
|
|
2012-12-21 23:10:11 +04:00
|
|
|
if (opts->allow_ff &&
|
2015-11-10 05:22:29 +03:00
|
|
|
((parent && !hashcmp(parent->object.oid.hash, head)) ||
|
2012-12-21 23:10:11 +04:00
|
|
|
(!parent && unborn)))
|
2015-11-10 05:22:29 +03:00
|
|
|
return fast_forward_to(commit->object.oid.hash, head, unborn, opts);
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (parent && parse_commit(parent) < 0)
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
/* TRANSLATORS: The first %s will be a "todo" command like
|
|
|
|
"revert" or "pick", the second %s a SHA1. */
|
2012-01-11 22:15:57 +04:00
|
|
|
return error(_("%s: cannot parse parent commit %s"),
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
command_to_string(command),
|
|
|
|
oid_to_hex(&parent->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (get_message(commit, &msg) != 0)
|
|
|
|
return error(_("Cannot get commit message for %s"),
|
2015-11-10 05:22:28 +03:00
|
|
|
oid_to_hex(&commit->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* "commit" is an existing commit. We would want to apply
|
|
|
|
* the difference it introduces since its first parent "prev"
|
|
|
|
* on top of the current HEAD if we are cherry-pick. Or the
|
|
|
|
* reverse of it if we are revert.
|
|
|
|
*/
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (command == TODO_REVERT) {
|
2012-01-11 22:15:57 +04:00
|
|
|
base = commit;
|
|
|
|
base_label = msg.label;
|
|
|
|
next = parent;
|
|
|
|
next_label = msg.parent_label;
|
|
|
|
strbuf_addstr(&msgbuf, "Revert \"");
|
|
|
|
strbuf_addstr(&msgbuf, msg.subject);
|
|
|
|
strbuf_addstr(&msgbuf, "\"\n\nThis reverts commit ");
|
2015-11-10 05:22:28 +03:00
|
|
|
strbuf_addstr(&msgbuf, oid_to_hex(&commit->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (commit->parents && commit->parents->next) {
|
|
|
|
strbuf_addstr(&msgbuf, ", reversing\nchanges made to ");
|
2015-11-10 05:22:28 +03:00
|
|
|
strbuf_addstr(&msgbuf, oid_to_hex(&parent->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
strbuf_addstr(&msgbuf, ".\n");
|
|
|
|
} else {
|
|
|
|
const char *p;
|
|
|
|
|
|
|
|
base = parent;
|
|
|
|
base_label = msg.parent_label;
|
|
|
|
next = commit;
|
|
|
|
next_label = msg.label;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Append the commit log message to msgbuf; it starts
|
|
|
|
* after the tree, parent, author, committer
|
|
|
|
* information followed by "\n\n".
|
|
|
|
*/
|
|
|
|
p = strstr(msg.message, "\n\n");
|
2016-06-29 17:14:46 +03:00
|
|
|
if (p)
|
|
|
|
strbuf_addstr(&msgbuf, skip_blank_lines(p + 2));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (opts->record_origin) {
|
2013-02-12 14:17:35 +04:00
|
|
|
if (!has_conforming_footer(&msgbuf, NULL, 0))
|
2013-02-12 14:17:34 +04:00
|
|
|
strbuf_addch(&msgbuf, '\n');
|
2013-02-12 14:17:32 +04:00
|
|
|
strbuf_addstr(&msgbuf, cherry_picked_prefix);
|
2015-11-10 05:22:28 +03:00
|
|
|
strbuf_addstr(&msgbuf, oid_to_hex(&commit->object.oid));
|
2012-01-11 22:15:57 +04:00
|
|
|
strbuf_addstr(&msgbuf, ")\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (!opts->strategy || !strcmp(opts->strategy, "recursive") || command == TODO_REVERT) {
|
2012-01-11 22:15:57 +04:00
|
|
|
res = do_recursive_merge(base, next, base_label, next_label,
|
|
|
|
head, &msgbuf, opts);
|
prepare the builtins for a libified merge_recursive()
Previously, callers of merge_trees() or merge_recursive() expected that
code to die() with an error message. This used to be okay because we
called those commands from scripts, and had a chance to print out a
message in case the command failed fatally (read: with exit code 128).
As scripting incurs its own set of problems (portability, speed,
idiosyncrasies of different shells, limited data structures leading to
inefficient code), we are converting more and more of these scripts into
builtins, using library functions directly.
We already tried to use merge_recursive() directly in the builtin
git-am, for example. Unfortunately, we had to roll it back temporarily
because some of the code in merge-recursive.c still deemed it okay to
call die(), when the builtin am code really wanted to print out a useful
advice after the merge failed fatally. In the next commits, we want to
fix that.
The code touched by this commit expected merge_trees() to die() with
some useful message when there is an error condition, but merge_trees()
is going to be improved by converting all die() calls to return error()
instead (i.e. return value -1 after printing out the message as before),
so that the caller can react more flexibly.
This is a step to prepare for the version of merge_trees() that no
longer dies, even if we just imitate the previous behavior by calling
exit(128): this is what callers of e.g. `git merge` have come to expect.
Note that the callers of the sequencer (revert and cherry-pick) already
fail fast even for the return value -1; The only difference is that they
now get a chance to say "<command> failed".
A caller of merge_trees() might want handle error messages themselves
(or even suppress them). As this patch is already complex enough, we
leave that change for a later patch.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-07-26 19:06:02 +03:00
|
|
|
if (res < 0)
|
|
|
|
return res;
|
2016-09-09 17:37:05 +03:00
|
|
|
res |= write_message(&msgbuf, git_path_merge_msg());
|
2012-01-11 22:15:57 +04:00
|
|
|
} else {
|
|
|
|
struct commit_list *common = NULL;
|
|
|
|
struct commit_list *remotes = NULL;
|
|
|
|
|
2016-09-09 17:37:05 +03:00
|
|
|
res = write_message(&msgbuf, git_path_merge_msg());
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
commit_list_insert(base, &common);
|
|
|
|
commit_list_insert(next, &remotes);
|
2016-10-21 15:24:13 +03:00
|
|
|
res |= try_merge_command(opts->strategy,
|
|
|
|
opts->xopts_nr, (const char **)opts->xopts,
|
2012-01-11 22:15:57 +04:00
|
|
|
common, sha1_to_hex(head), remotes);
|
|
|
|
free_commit_list(common);
|
|
|
|
free_commit_list(remotes);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the merge was clean or if it failed due to conflict, we write
|
|
|
|
* CHERRY_PICK_HEAD for the subsequent invocation of commit to use.
|
|
|
|
* However, if the merge did not even start, then we don't want to
|
|
|
|
* write it at all.
|
|
|
|
*/
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (command == TODO_PICK && !opts->no_commit && (res == 0 || res == 1) &&
|
2016-08-26 16:47:14 +03:00
|
|
|
update_ref(NULL, "CHERRY_PICK_HEAD", commit->object.oid.hash, NULL,
|
|
|
|
REF_NODEREF, UPDATE_REFS_MSG_ON_ERR))
|
|
|
|
res = -1;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (command == TODO_REVERT && ((opts->no_commit && res == 0) || res == 1) &&
|
2016-08-26 16:47:14 +03:00
|
|
|
update_ref(NULL, "REVERT_HEAD", commit->object.oid.hash, NULL,
|
|
|
|
REF_NODEREF, UPDATE_REFS_MSG_ON_ERR))
|
|
|
|
res = -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (res) {
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
error(command == TODO_REVERT
|
2012-01-11 22:15:57 +04:00
|
|
|
? _("could not revert %s... %s")
|
|
|
|
: _("could not apply %s... %s"),
|
2016-10-21 15:24:37 +03:00
|
|
|
short_commit_name(commit), msg.subject);
|
2012-02-22 04:44:17 +04:00
|
|
|
print_advice(res == 1, opts);
|
2012-01-11 22:15:57 +04:00
|
|
|
rerere(opts->allow_rerere_auto);
|
2013-05-29 07:56:21 +04:00
|
|
|
goto leave;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2013-05-29 07:56:21 +04:00
|
|
|
allow = allow_empty(opts, commit);
|
2013-06-06 12:58:57 +04:00
|
|
|
if (allow < 0) {
|
|
|
|
res = allow;
|
|
|
|
goto leave;
|
|
|
|
}
|
2013-05-29 07:56:21 +04:00
|
|
|
if (!opts->no_commit)
|
2016-10-21 15:25:04 +03:00
|
|
|
res = run_git_commit(opts->edit ? NULL : git_path_merge_msg(),
|
|
|
|
opts, allow);
|
2013-05-29 07:56:21 +04:00
|
|
|
|
|
|
|
leave:
|
2014-06-11 01:39:35 +04:00
|
|
|
free_message(commit, &msg);
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2016-09-09 17:37:18 +03:00
|
|
|
static int prepare_revs(struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
2012-08-29 10:15:56 +04:00
|
|
|
/*
|
|
|
|
* picking (but not reverting) ranges (but not individual revisions)
|
|
|
|
* should be done in reverse
|
|
|
|
*/
|
|
|
|
if (opts->action == REPLAY_PICK && !opts->revs->no_walk)
|
2012-01-11 22:15:57 +04:00
|
|
|
opts->revs->reverse ^= 1;
|
|
|
|
|
|
|
|
if (prepare_revision_walk(opts->revs))
|
2016-09-09 17:37:18 +03:00
|
|
|
return error(_("revision walk setup failed"));
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (!opts->revs->commits)
|
2016-09-09 17:37:18 +03:00
|
|
|
return error(_("empty commit set passed"));
|
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2016-09-09 17:37:21 +03:00
|
|
|
static int read_and_refresh_cache(struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
static struct lock_file index_lock;
|
|
|
|
int index_fd = hold_locked_index(&index_lock, 0);
|
2016-09-09 17:38:20 +03:00
|
|
|
if (read_index_preload(&the_index, NULL) < 0) {
|
|
|
|
rollback_lock_file(&index_lock);
|
2016-09-09 17:37:21 +03:00
|
|
|
return error(_("git %s: failed to read the index"),
|
|
|
|
action_name(opts));
|
2016-09-09 17:38:20 +03:00
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
refresh_index(&the_index, REFRESH_QUIET|REFRESH_UNMERGED, NULL, NULL, NULL);
|
2014-04-28 14:55:24 +04:00
|
|
|
if (the_index.cache_changed && index_fd >= 0) {
|
2016-09-09 17:38:20 +03:00
|
|
|
if (write_locked_index(&the_index, &index_lock, COMMIT_LOCK)) {
|
|
|
|
rollback_lock_file(&index_lock);
|
2016-09-09 17:37:21 +03:00
|
|
|
return error(_("git %s: failed to refresh the index"),
|
|
|
|
action_name(opts));
|
2016-09-09 17:38:20 +03:00
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
rollback_lock_file(&index_lock);
|
2016-09-09 17:37:21 +03:00
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
struct todo_item {
|
|
|
|
enum todo_command command;
|
|
|
|
struct commit *commit;
|
2016-10-21 15:25:00 +03:00
|
|
|
const char *arg;
|
|
|
|
int arg_len;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
size_t offset_in_buf;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct todo_list {
|
|
|
|
struct strbuf buf;
|
|
|
|
struct todo_item *items;
|
|
|
|
int nr, alloc, current;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define TODO_LIST_INIT { STRBUF_INIT }
|
|
|
|
|
|
|
|
static void todo_list_release(struct todo_list *todo_list)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
strbuf_release(&todo_list->buf);
|
|
|
|
free(todo_list->items);
|
|
|
|
todo_list->items = NULL;
|
|
|
|
todo_list->nr = todo_list->alloc = 0;
|
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static struct todo_item *append_new_todo(struct todo_list *todo_list)
|
|
|
|
{
|
|
|
|
ALLOC_GROW(todo_list->items, todo_list->nr + 1, todo_list->alloc);
|
|
|
|
return todo_list->items + todo_list->nr++;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static int parse_insn_line(struct todo_item *item, const char *bol, char *eol)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
unsigned char commit_sha1[20];
|
|
|
|
char *end_of_object_name;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
int i, saved, status, padding;
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(todo_command_strings); i++)
|
|
|
|
if (skip_prefix(bol, todo_command_strings[i], &bol)) {
|
|
|
|
item->command = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i >= ARRAY_SIZE(todo_command_strings))
|
|
|
|
return -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
/* Eat up extra spaces/ tabs before object name */
|
|
|
|
padding = strspn(bol, " \t");
|
|
|
|
if (!padding)
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
return -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
bol += padding;
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
end_of_object_name = (char *) bol + strcspn(bol, " \t\n");
|
2012-01-11 22:15:57 +04:00
|
|
|
saved = *end_of_object_name;
|
|
|
|
*end_of_object_name = '\0';
|
|
|
|
status = get_sha1(bol, commit_sha1);
|
|
|
|
*end_of_object_name = saved;
|
|
|
|
|
2016-10-21 15:25:00 +03:00
|
|
|
item->arg = end_of_object_name + strspn(end_of_object_name, " \t");
|
|
|
|
item->arg_len = (int)(eol - item->arg);
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
if (status < 0)
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
return -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
item->commit = lookup_commit_reference(commit_sha1);
|
|
|
|
return !item->commit;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static int parse_insn_buffer(char *buf, struct todo_list *todo_list)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
struct todo_item *item;
|
|
|
|
char *p = buf, *next_p;
|
|
|
|
int i, res = 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
for (i = 1; *p; i++, p = next_p) {
|
2012-01-11 22:15:57 +04:00
|
|
|
char *eol = strchrnul(p, '\n');
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
|
|
|
|
next_p = *eol ? eol + 1 /* skip LF */ : eol;
|
|
|
|
|
2016-10-21 15:24:46 +03:00
|
|
|
if (p != eol && eol[-1] == '\r')
|
|
|
|
eol--; /* strip Carriage Return */
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
item = append_new_todo(todo_list);
|
|
|
|
item->offset_in_buf = p - todo_list->buf.buf;
|
|
|
|
if (parse_insn_line(item, p, eol)) {
|
|
|
|
res = error(_("Invalid line %d: %.*s"),
|
|
|
|
i, (int)(eol - p), p);
|
|
|
|
item->command = -1;
|
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (!todo_list->nr)
|
2012-01-11 22:15:57 +04:00
|
|
|
return error(_("No commits parsed."));
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
return res;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static int read_populate_todo(struct todo_list *todo_list,
|
2012-01-11 22:15:57 +04:00
|
|
|
struct replay_opts *opts)
|
|
|
|
{
|
2016-10-21 15:24:32 +03:00
|
|
|
const char *todo_file = get_todo_path(opts);
|
2012-01-11 22:15:57 +04:00
|
|
|
int fd, res;
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
strbuf_reset(&todo_list->buf);
|
2016-10-21 15:24:32 +03:00
|
|
|
fd = open(todo_file, O_RDONLY);
|
2012-01-11 22:15:57 +04:00
|
|
|
if (fd < 0)
|
2016-10-21 15:24:32 +03:00
|
|
|
return error_errno(_("Could not open %s"), todo_file);
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (strbuf_read(&todo_list->buf, fd, 0) < 0) {
|
2012-01-11 22:15:57 +04:00
|
|
|
close(fd);
|
2016-10-21 15:24:32 +03:00
|
|
|
return error(_("Could not read %s."), todo_file);
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
close(fd);
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
res = parse_insn_buffer(todo_list->buf.buf, todo_list);
|
|
|
|
if (!res) {
|
|
|
|
enum todo_command valid =
|
|
|
|
opts->action == REPLAY_PICK ? TODO_PICK : TODO_REVERT;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < todo_list->nr; i++)
|
|
|
|
if (valid == todo_list->items[i].command)
|
|
|
|
continue;
|
|
|
|
else if (valid == TODO_PICK)
|
|
|
|
return error(_("Cannot cherry-pick during a revert."));
|
|
|
|
else
|
|
|
|
return error(_("Cannot revert during a cherry-pick."));
|
|
|
|
}
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
if (res)
|
2016-10-21 15:24:32 +03:00
|
|
|
return error(_("Unusable instruction sheet: %s"), todo_file);
|
2016-09-09 17:37:24 +03:00
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2016-10-21 15:24:13 +03:00
|
|
|
static int git_config_string_dup(char **dest,
|
|
|
|
const char *var, const char *value)
|
|
|
|
{
|
|
|
|
if (!value)
|
|
|
|
return config_error_nonbool(var);
|
|
|
|
free(*dest);
|
|
|
|
*dest = xstrdup(value);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
static int populate_opts_cb(const char *key, const char *value, void *data)
|
|
|
|
{
|
|
|
|
struct replay_opts *opts = data;
|
|
|
|
int error_flag = 1;
|
|
|
|
|
|
|
|
if (!value)
|
|
|
|
error_flag = 0;
|
|
|
|
else if (!strcmp(key, "options.no-commit"))
|
|
|
|
opts->no_commit = git_config_bool_or_int(key, value, &error_flag);
|
|
|
|
else if (!strcmp(key, "options.edit"))
|
|
|
|
opts->edit = git_config_bool_or_int(key, value, &error_flag);
|
|
|
|
else if (!strcmp(key, "options.signoff"))
|
|
|
|
opts->signoff = git_config_bool_or_int(key, value, &error_flag);
|
|
|
|
else if (!strcmp(key, "options.record-origin"))
|
|
|
|
opts->record_origin = git_config_bool_or_int(key, value, &error_flag);
|
|
|
|
else if (!strcmp(key, "options.allow-ff"))
|
|
|
|
opts->allow_ff = git_config_bool_or_int(key, value, &error_flag);
|
|
|
|
else if (!strcmp(key, "options.mainline"))
|
|
|
|
opts->mainline = git_config_int(key, value);
|
|
|
|
else if (!strcmp(key, "options.strategy"))
|
2016-10-21 15:24:13 +03:00
|
|
|
git_config_string_dup(&opts->strategy, key, value);
|
2014-01-24 04:50:58 +04:00
|
|
|
else if (!strcmp(key, "options.gpg-sign"))
|
2016-10-21 15:24:13 +03:00
|
|
|
git_config_string_dup(&opts->gpg_sign, key, value);
|
2012-01-11 22:15:57 +04:00
|
|
|
else if (!strcmp(key, "options.strategy-option")) {
|
|
|
|
ALLOC_GROW(opts->xopts, opts->xopts_nr + 1, opts->xopts_alloc);
|
|
|
|
opts->xopts[opts->xopts_nr++] = xstrdup(value);
|
|
|
|
} else
|
|
|
|
return error(_("Invalid key: %s"), key);
|
|
|
|
|
|
|
|
if (!error_flag)
|
|
|
|
return error(_("Invalid value for %s: %s"), key, value);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-10-14 16:17:16 +03:00
|
|
|
static int read_populate_opts(struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
2016-10-21 15:25:04 +03:00
|
|
|
if (is_rebase_i(opts))
|
|
|
|
return 0;
|
|
|
|
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
if (!file_exists(git_path_opts_file()))
|
sequencer: lib'ify read_populate_opts()
Instead of dying there, let the caller high up in the callchain notice
the error and handle it (by dying, still).
The only caller of read_populate_opts(), sequencer_continue() can
already return errors, so its caller must be already prepared to
handle error returns, and with this step, we make it notice an error
return from this function.
So this is a safe conversion to make read_populate_opts() callable
from new callers that want it not to die, without changing the
external behaviour of anything existing.
Note that the function git_config_from_file(), called from
read_populate_opts(), can currently still die() (in git_parse_source(),
because the do_config_from_file() function sets die_on_error = 1). We do
not try to fix that here, as it would have larger ramifications on the
config code, and we also assume that we write the opts file
programmatically, hence any parse errors would be bugs.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-09-09 17:37:27 +03:00
|
|
|
return 0;
|
|
|
|
/*
|
|
|
|
* The function git_parse_source(), called from git_config_from_file(),
|
|
|
|
* may die() in case of a syntactically incorrect file. We do not care
|
|
|
|
* about this case, though, because we wrote that file ourselves, so we
|
|
|
|
* are pretty certain that it is syntactically correct.
|
|
|
|
*/
|
2016-10-14 16:17:16 +03:00
|
|
|
if (git_config_from_file(populate_opts_cb, git_path_opts_file(), opts) < 0)
|
sequencer: lib'ify read_populate_opts()
Instead of dying there, let the caller high up in the callchain notice
the error and handle it (by dying, still).
The only caller of read_populate_opts(), sequencer_continue() can
already return errors, so its caller must be already prepared to
handle error returns, and with this step, we make it notice an error
return from this function.
So this is a safe conversion to make read_populate_opts() callable
from new callers that want it not to die, without changing the
external behaviour of anything existing.
Note that the function git_config_from_file(), called from
read_populate_opts(), can currently still die() (in git_parse_source(),
because the do_config_from_file() function sets die_on_error = 1). We do
not try to fix that here, as it would have larger ramifications on the
config code, and we also assume that we write the opts file
programmatically, hence any parse errors would be bugs.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-09-09 17:37:27 +03:00
|
|
|
return error(_("Malformed options sheet: %s"),
|
|
|
|
git_path_opts_file());
|
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static int walk_revs_populate_todo(struct todo_list *todo_list,
|
2012-01-11 22:15:57 +04:00
|
|
|
struct replay_opts *opts)
|
|
|
|
{
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
enum todo_command command = opts->action == REPLAY_PICK ?
|
|
|
|
TODO_PICK : TODO_REVERT;
|
|
|
|
const char *command_string = todo_command_strings[command];
|
2012-01-11 22:15:57 +04:00
|
|
|
struct commit *commit;
|
|
|
|
|
2016-09-09 17:37:15 +03:00
|
|
|
if (prepare_revs(opts))
|
|
|
|
return -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
while ((commit = get_revision(opts->revs))) {
|
|
|
|
struct todo_item *item = append_new_todo(todo_list);
|
|
|
|
const char *commit_buffer = get_commit_buffer(commit, NULL);
|
|
|
|
const char *subject;
|
|
|
|
int subject_len;
|
|
|
|
|
|
|
|
item->command = command;
|
|
|
|
item->commit = commit;
|
2016-10-21 15:25:00 +03:00
|
|
|
item->arg = NULL;
|
|
|
|
item->arg_len = 0;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
item->offset_in_buf = todo_list->buf.len;
|
|
|
|
subject_len = find_commit_subject(commit_buffer, &subject);
|
|
|
|
strbuf_addf(&todo_list->buf, "%s %s %.*s\n", command_string,
|
|
|
|
short_commit_name(commit), subject_len, subject);
|
|
|
|
unuse_commit_buffer(commit, commit_buffer);
|
|
|
|
}
|
2016-09-09 17:37:15 +03:00
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int create_seq_dir(void)
|
|
|
|
{
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
if (file_exists(git_path_seq_dir())) {
|
2012-01-11 22:15:57 +04:00
|
|
|
error(_("a cherry-pick or revert is already in progress"));
|
|
|
|
advise(_("try \"git cherry-pick (--continue | --quit | --abort)\""));
|
|
|
|
return -1;
|
|
|
|
}
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
else if (mkdir(git_path_seq_dir(), 0777) < 0)
|
2016-09-09 17:37:44 +03:00
|
|
|
return error_errno(_("Could not create sequencer directory %s"),
|
|
|
|
git_path_seq_dir());
|
2012-01-11 22:15:57 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-09-09 17:37:47 +03:00
|
|
|
static int save_head(const char *head)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
static struct lock_file head_lock;
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
|
|
|
int fd;
|
|
|
|
|
2016-09-09 17:37:47 +03:00
|
|
|
fd = hold_lock_file_for_update(&head_lock, git_path_head_file(), 0);
|
|
|
|
if (fd < 0) {
|
|
|
|
rollback_lock_file(&head_lock);
|
|
|
|
return error_errno(_("Could not lock HEAD"));
|
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
strbuf_addf(&buf, "%s\n", head);
|
2016-09-09 17:37:47 +03:00
|
|
|
if (write_in_full(fd, buf.buf, buf.len) < 0) {
|
|
|
|
rollback_lock_file(&head_lock);
|
|
|
|
return error_errno(_("Could not write to %s"),
|
|
|
|
git_path_head_file());
|
|
|
|
}
|
|
|
|
if (commit_lock_file(&head_lock) < 0) {
|
|
|
|
rollback_lock_file(&head_lock);
|
|
|
|
return error(_("Error wrapping up %s."), git_path_head_file());
|
|
|
|
}
|
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int reset_for_rollback(const unsigned char *sha1)
|
|
|
|
{
|
|
|
|
const char *argv[4]; /* reset --merge <arg> + NULL */
|
|
|
|
argv[0] = "reset";
|
|
|
|
argv[1] = "--merge";
|
|
|
|
argv[2] = sha1_to_hex(sha1);
|
|
|
|
argv[3] = NULL;
|
|
|
|
return run_command_v_opt(argv, RUN_GIT_CMD);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int rollback_single_pick(void)
|
|
|
|
{
|
|
|
|
unsigned char head_sha1[20];
|
|
|
|
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
if (!file_exists(git_path_cherry_pick_head()) &&
|
|
|
|
!file_exists(git_path_revert_head()))
|
2012-01-11 22:15:57 +04:00
|
|
|
return error(_("no cherry-pick or revert in progress"));
|
2014-07-15 23:59:36 +04:00
|
|
|
if (read_ref_full("HEAD", 0, head_sha1, NULL))
|
2012-01-11 22:15:57 +04:00
|
|
|
return error(_("cannot resolve HEAD"));
|
|
|
|
if (is_null_sha1(head_sha1))
|
|
|
|
return error(_("cannot abort from a branch yet to be born"));
|
|
|
|
return reset_for_rollback(head_sha1);
|
|
|
|
}
|
|
|
|
|
2016-10-21 15:24:55 +03:00
|
|
|
int sequencer_rollback(struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
FILE *f;
|
|
|
|
unsigned char sha1[20];
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
|
|
|
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
f = fopen(git_path_head_file(), "r");
|
2012-01-11 22:15:57 +04:00
|
|
|
if (!f && errno == ENOENT) {
|
|
|
|
/*
|
|
|
|
* There is no multiple-cherry-pick in progress.
|
|
|
|
* If CHERRY_PICK_HEAD or REVERT_HEAD indicates
|
|
|
|
* a single-cherry-pick in progress, abort that.
|
|
|
|
*/
|
|
|
|
return rollback_single_pick();
|
|
|
|
}
|
|
|
|
if (!f)
|
2016-05-08 12:47:54 +03:00
|
|
|
return error_errno(_("cannot open %s"), git_path_head_file());
|
2016-01-14 02:31:17 +03:00
|
|
|
if (strbuf_getline_lf(&buf, f)) {
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
error(_("cannot read %s: %s"), git_path_head_file(),
|
|
|
|
ferror(f) ? strerror(errno) : _("unexpected end of file"));
|
2012-01-11 22:15:57 +04:00
|
|
|
fclose(f);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
fclose(f);
|
|
|
|
if (get_sha1_hex(buf.buf, sha1) || buf.buf[40] != '\0') {
|
|
|
|
error(_("stored pre-cherry-pick HEAD file '%s' is corrupt"),
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
git_path_head_file());
|
2012-01-11 22:15:57 +04:00
|
|
|
goto fail;
|
|
|
|
}
|
2016-06-06 16:23:54 +03:00
|
|
|
if (is_null_sha1(sha1)) {
|
|
|
|
error(_("cannot abort from a branch yet to be born"));
|
|
|
|
goto fail;
|
|
|
|
}
|
2012-01-11 22:15:57 +04:00
|
|
|
if (reset_for_rollback(sha1))
|
|
|
|
goto fail;
|
|
|
|
strbuf_release(&buf);
|
2016-10-21 15:24:55 +03:00
|
|
|
return sequencer_remove_state(opts);
|
2012-01-11 22:15:57 +04:00
|
|
|
fail:
|
|
|
|
strbuf_release(&buf);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static int save_todo(struct todo_list *todo_list, struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
static struct lock_file todo_lock;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
const char *todo_path = get_todo_path(opts);
|
|
|
|
int next = todo_list->current, offset, fd;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
fd = hold_lock_file_for_update(&todo_lock, todo_path, 0);
|
2016-09-09 17:37:50 +03:00
|
|
|
if (fd < 0)
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
return error_errno(_("Could not lock '%s'"), todo_path);
|
|
|
|
offset = next < todo_list->nr ?
|
|
|
|
todo_list->items[next].offset_in_buf : todo_list->buf.len;
|
|
|
|
if (write_in_full(fd, todo_list->buf.buf + offset,
|
|
|
|
todo_list->buf.len - offset) < 0)
|
|
|
|
return error_errno(_("Could not write to '%s'"), todo_path);
|
|
|
|
if (commit_lock_file(&todo_lock) < 0)
|
|
|
|
return error(_("Error wrapping up %s."), todo_path);
|
2016-09-09 17:37:50 +03:00
|
|
|
return 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
2016-09-09 17:37:53 +03:00
|
|
|
static int save_opts(struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
const char *opts_file = git_path_opts_file();
|
2016-09-09 17:37:53 +03:00
|
|
|
int res = 0;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
if (opts->no_commit)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.no-commit", "true");
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->edit)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.edit", "true");
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->signoff)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.signoff", "true");
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->record_origin)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.record-origin", "true");
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->allow_ff)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.allow-ff", "true");
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->mainline) {
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
|
|
|
strbuf_addf(&buf, "%d", opts->mainline);
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.mainline", buf.buf);
|
2012-01-11 22:15:57 +04:00
|
|
|
strbuf_release(&buf);
|
|
|
|
}
|
|
|
|
if (opts->strategy)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.strategy", opts->strategy);
|
2014-01-24 04:50:58 +04:00
|
|
|
if (opts->gpg_sign)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_in_file_gently(opts_file, "options.gpg-sign", opts->gpg_sign);
|
2012-01-11 22:15:57 +04:00
|
|
|
if (opts->xopts) {
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < opts->xopts_nr; i++)
|
2016-09-09 17:37:53 +03:00
|
|
|
res |= git_config_set_multivar_in_file_gently(opts_file,
|
2012-01-11 22:15:57 +04:00
|
|
|
"options.strategy-option",
|
|
|
|
opts->xopts[i], "^$", 0);
|
|
|
|
}
|
2016-09-09 17:37:53 +03:00
|
|
|
return res;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
static int pick_commits(struct todo_list *todo_list, struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
|
|
|
int res;
|
|
|
|
|
|
|
|
setenv(GIT_REFLOG_ACTION, action_name(opts), 0);
|
|
|
|
if (opts->allow_ff)
|
|
|
|
assert(!(opts->signoff || opts->no_commit ||
|
|
|
|
opts->record_origin || opts->edit));
|
2016-09-09 17:37:21 +03:00
|
|
|
if (read_and_refresh_cache(opts))
|
|
|
|
return -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
while (todo_list->current < todo_list->nr) {
|
|
|
|
struct todo_item *item = todo_list->items + todo_list->current;
|
|
|
|
if (save_todo(todo_list, opts))
|
2016-09-09 17:37:50 +03:00
|
|
|
return -1;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
res = do_pick_commit(item->command, item->commit, opts);
|
|
|
|
todo_list->current++;
|
2012-01-11 22:15:57 +04:00
|
|
|
if (res)
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sequence of picks finished successfully; cleanup by
|
|
|
|
* removing the .git/sequencer directory
|
|
|
|
*/
|
2016-10-21 15:24:55 +03:00
|
|
|
return sequencer_remove_state(opts);
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int continue_single_pick(void)
|
|
|
|
{
|
|
|
|
const char *argv[] = { "commit", NULL };
|
|
|
|
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
if (!file_exists(git_path_cherry_pick_head()) &&
|
|
|
|
!file_exists(git_path_revert_head()))
|
2012-01-11 22:15:57 +04:00
|
|
|
return error(_("no cherry-pick or revert in progress"));
|
|
|
|
return run_command_v_opt(argv, RUN_GIT_CMD);
|
|
|
|
}
|
|
|
|
|
2016-10-21 15:24:55 +03:00
|
|
|
int sequencer_continue(struct replay_opts *opts)
|
2012-01-11 22:15:57 +04:00
|
|
|
{
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
struct todo_list todo_list = TODO_LIST_INIT;
|
|
|
|
int res;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
2016-10-21 15:24:55 +03:00
|
|
|
if (read_and_refresh_cache(opts))
|
|
|
|
return -1;
|
|
|
|
|
2016-10-21 15:24:32 +03:00
|
|
|
if (!file_exists(get_todo_path(opts)))
|
2012-01-11 22:15:57 +04:00
|
|
|
return continue_single_pick();
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (read_populate_opts(opts))
|
2016-09-09 17:37:24 +03:00
|
|
|
return -1;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if ((res = read_populate_todo(&todo_list, opts)))
|
|
|
|
goto release_todo_list;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
|
|
|
/* Verify that the conflict has been resolved */
|
memoize common git-path "constant" files
One of the most common uses of git_path() is to pass a
constant, like git_path("MERGE_MSG"). This has two
drawbacks:
1. The return value is a static buffer, and the lifetime
is dependent on other calls to git_path, etc.
2. There's no compile-time checking of the pathname. This
is OK for a one-off (after all, we have to spell it
correctly at least once), but many of these constant
strings appear throughout the code.
This patch introduces a series of functions to "memoize"
these strings, which are essentially globals for the
lifetime of the program. We compute the value once, take
ownership of the buffer, and return the cached value for
subsequent calls. cache.h provides a helper macro for
defining these functions as one-liners, and defines a few
common ones for global use.
Using a macro is a little bit gross, but it does nicely
document the purpose of the functions. If we need to touch
them all later (e.g., because we learned how to change the
git_dir variable at runtime, and need to invalidate all of
the stored values), it will be much easier to have the
complete list.
Note that the shared-global functions have separate, manual
declarations. We could do something clever with the macros
(e.g., expand it to a declaration in some places, and a
declaration _and_ a definition in path.c). But there aren't
that many, and it's probably better to stay away from
too-magical macros.
Likewise, if we abandon the C preprocessor in favor of
generating these with a script, we could get much fancier.
E.g., normalizing "FOO/BAR-BAZ" into "git_path_foo_bar_baz".
But the small amount of saved typing is probably not worth
the resulting confusion to readers who want to grep for the
function's definition.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-08-10 12:38:57 +03:00
|
|
|
if (file_exists(git_path_cherry_pick_head()) ||
|
|
|
|
file_exists(git_path_revert_head())) {
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
res = continue_single_pick();
|
|
|
|
if (res)
|
|
|
|
goto release_todo_list;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
if (index_differs_from("HEAD", 0)) {
|
|
|
|
res = error_dirty_index(opts);
|
|
|
|
goto release_todo_list;
|
|
|
|
}
|
|
|
|
todo_list.current++;
|
|
|
|
res = pick_commits(&todo_list, opts);
|
|
|
|
release_todo_list:
|
|
|
|
todo_list_release(&todo_list);
|
|
|
|
return res;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int single_pick(struct commit *cmit, struct replay_opts *opts)
|
|
|
|
{
|
|
|
|
setenv(GIT_REFLOG_ACTION, action_name(opts), 0);
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
return do_pick_commit(opts->action == REPLAY_PICK ?
|
|
|
|
TODO_PICK : TODO_REVERT, cmit, opts);
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
int sequencer_pick_revisions(struct replay_opts *opts)
|
|
|
|
{
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
struct todo_list todo_list = TODO_LIST_INIT;
|
2012-01-11 22:15:57 +04:00
|
|
|
unsigned char sha1[20];
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
int i, res;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
2016-10-21 15:24:55 +03:00
|
|
|
assert(opts->revs);
|
2016-09-09 17:37:21 +03:00
|
|
|
if (read_and_refresh_cache(opts))
|
|
|
|
return -1;
|
2012-01-11 22:15:57 +04:00
|
|
|
|
2013-04-11 17:06:52 +04:00
|
|
|
for (i = 0; i < opts->revs->pending.nr; i++) {
|
|
|
|
unsigned char sha1[20];
|
|
|
|
const char *name = opts->revs->pending.objects[i].name;
|
|
|
|
|
|
|
|
/* This happens when using --stdin. */
|
|
|
|
if (!strlen(name))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!get_sha1(name, sha1)) {
|
2013-05-10 00:27:49 +04:00
|
|
|
if (!lookup_commit_reference_gently(sha1, 1)) {
|
|
|
|
enum object_type type = sha1_object_info(sha1, NULL);
|
2016-08-26 16:47:10 +03:00
|
|
|
return error(_("%s: can't cherry-pick a %s"),
|
|
|
|
name, typename(type));
|
2013-05-10 00:27:49 +04:00
|
|
|
}
|
2013-04-11 17:06:52 +04:00
|
|
|
} else
|
2016-08-26 16:47:10 +03:00
|
|
|
return error(_("%s: bad revision"), name);
|
2013-04-11 17:06:52 +04:00
|
|
|
}
|
|
|
|
|
2012-01-11 22:15:57 +04:00
|
|
|
/*
|
|
|
|
* If we were called as "git cherry-pick <commit>", just
|
|
|
|
* cherry-pick/revert it, set CHERRY_PICK_HEAD /
|
|
|
|
* REVERT_HEAD, and don't touch the sequencer state.
|
|
|
|
* This means it is possible to cherry-pick in the middle
|
|
|
|
* of a cherry-pick sequence.
|
|
|
|
*/
|
|
|
|
if (opts->revs->cmdline.nr == 1 &&
|
|
|
|
opts->revs->cmdline.rev->whence == REV_CMD_REV &&
|
|
|
|
opts->revs->no_walk &&
|
|
|
|
!opts->revs->cmdline.rev->flags) {
|
|
|
|
struct commit *cmit;
|
|
|
|
if (prepare_revision_walk(opts->revs))
|
2016-08-26 16:47:10 +03:00
|
|
|
return error(_("revision walk setup failed"));
|
2012-01-11 22:15:57 +04:00
|
|
|
cmit = get_revision(opts->revs);
|
|
|
|
if (!cmit || get_revision(opts->revs))
|
2016-08-26 16:47:10 +03:00
|
|
|
return error("BUG: expected exactly one commit from walk");
|
2012-01-11 22:15:57 +04:00
|
|
|
return single_pick(cmit, opts);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Start a new cherry-pick/ revert sequence; but
|
|
|
|
* first, make sure that an existing one isn't in
|
|
|
|
* progress
|
|
|
|
*/
|
|
|
|
|
2016-09-09 17:37:15 +03:00
|
|
|
if (walk_revs_populate_todo(&todo_list, opts) ||
|
|
|
|
create_seq_dir() < 0)
|
2012-01-11 22:15:57 +04:00
|
|
|
return -1;
|
2016-06-06 16:23:54 +03:00
|
|
|
if (get_sha1("HEAD", sha1) && (opts->action == REPLAY_REVERT))
|
|
|
|
return error(_("Can't revert as initial commit"));
|
2016-09-09 17:37:47 +03:00
|
|
|
if (save_head(sha1_to_hex(sha1)))
|
|
|
|
return -1;
|
2016-09-09 17:37:53 +03:00
|
|
|
if (save_opts(opts))
|
|
|
|
return -1;
|
sequencer: completely revamp the "todo" script parsing
When we came up with the "sequencer" idea, we really wanted to have
kind of a plumbing equivalent of the interactive rebase. Hence the
choice of words: the "todo" script, a "pick", etc.
However, when it came time to implement the entire shebang, somehow this
idea got lost and the sequencer was used as working horse for
cherry-pick and revert instead. So as not to interfere with the
interactive rebase, it even uses a separate directory to store its
state.
Furthermore, it also is stupidly strict about the "todo" script it
accepts: while it parses commands in a way that was *designed* to be
similar to the interactive rebase, it then goes on to *error out* if the
commands disagree with the overall action (cherry-pick or revert).
Finally, the sequencer code chose to deviate from the interactive rebase
code insofar that when it comes to writing the file with the remaining
commands, it *reformats* the "todo" script instead of just writing the
part of the parsed script that were not yet processed. This is not only
unnecessary churn, but might well lose information that is valuable to
the user (i.e. comments after the commands).
Let's just bite the bullet and rewrite the entire parser; the code now
becomes not only more elegant: it allows us to go on and teach the
sequencer how to parse *true* "todo" scripts as used by the interactive
rebase itself. In a way, the sequencer is about to grow up to do its
older brother's job. Better.
In particular, we choose to maintain the list of commands in an array
instead of a linked list: this is flexible enough to allow us later on to
even implement rebase -i's reordering of fixup!/squash! commits very
easily (and with a very nice speed bonus, at least on Windows).
While at it, do not stop at the first problem, but list *all* of the
problems. This will help the user when the sequencer will do `rebase
-i`'s work by allowing to address all issues in one go rather than going
back and forth until the todo list is valid.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-10-21 15:24:41 +03:00
|
|
|
res = pick_commits(&todo_list, opts);
|
|
|
|
todo_list_release(&todo_list);
|
|
|
|
return res;
|
2012-01-11 22:15:57 +04:00
|
|
|
}
|
2012-09-14 10:52:03 +04:00
|
|
|
|
2013-02-12 14:17:35 +04:00
|
|
|
void append_signoff(struct strbuf *msgbuf, int ignore_footer, unsigned flag)
|
2012-09-14 10:52:03 +04:00
|
|
|
{
|
2013-02-12 14:17:35 +04:00
|
|
|
unsigned no_dup_sob = flag & APPEND_SIGNOFF_DEDUP;
|
2012-09-14 10:52:03 +04:00
|
|
|
struct strbuf sob = STRBUF_INIT;
|
2013-02-12 14:17:35 +04:00
|
|
|
int has_footer;
|
2012-09-14 10:52:03 +04:00
|
|
|
|
|
|
|
strbuf_addstr(&sob, sign_off_header);
|
|
|
|
strbuf_addstr(&sob, fmt_name(getenv("GIT_COMMITTER_NAME"),
|
|
|
|
getenv("GIT_COMMITTER_EMAIL")));
|
|
|
|
strbuf_addch(&sob, '\n');
|
2013-02-12 14:17:35 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If the whole message buffer is equal to the sob, pretend that we
|
|
|
|
* found a conforming footer with a matching sob
|
|
|
|
*/
|
|
|
|
if (msgbuf->len - ignore_footer == sob.len &&
|
|
|
|
!strncmp(msgbuf->buf, sob.buf, sob.len))
|
|
|
|
has_footer = 3;
|
|
|
|
else
|
|
|
|
has_footer = has_conforming_footer(msgbuf, &sob, ignore_footer);
|
|
|
|
|
2013-02-12 14:33:42 +04:00
|
|
|
if (!has_footer) {
|
|
|
|
const char *append_newlines = NULL;
|
|
|
|
size_t len = msgbuf->len - ignore_footer;
|
|
|
|
|
2013-02-23 02:05:27 +04:00
|
|
|
if (!len) {
|
|
|
|
/*
|
|
|
|
* The buffer is completely empty. Leave foom for
|
|
|
|
* the title and body to be filled in by the user.
|
|
|
|
*/
|
2013-02-12 14:33:42 +04:00
|
|
|
append_newlines = "\n\n";
|
2013-02-23 02:05:27 +04:00
|
|
|
} else if (msgbuf->buf[len - 1] != '\n') {
|
|
|
|
/*
|
|
|
|
* Incomplete line. Complete the line and add a
|
|
|
|
* blank one so that there is an empty line between
|
|
|
|
* the message body and the sob.
|
|
|
|
*/
|
|
|
|
append_newlines = "\n\n";
|
|
|
|
} else if (len == 1) {
|
|
|
|
/*
|
|
|
|
* Buffer contains a single newline. Add another
|
|
|
|
* so that we leave room for the title and body.
|
|
|
|
*/
|
|
|
|
append_newlines = "\n";
|
|
|
|
} else if (msgbuf->buf[len - 2] != '\n') {
|
|
|
|
/*
|
|
|
|
* Buffer ends with a single newline. Add another
|
|
|
|
* so that there is an empty line between the message
|
|
|
|
* body and the sob.
|
|
|
|
*/
|
2013-02-12 14:33:42 +04:00
|
|
|
append_newlines = "\n";
|
2013-02-23 02:05:27 +04:00
|
|
|
} /* else, the buffer already ends with two newlines. */
|
2013-02-12 14:33:42 +04:00
|
|
|
|
|
|
|
if (append_newlines)
|
|
|
|
strbuf_splice(msgbuf, msgbuf->len - ignore_footer, 0,
|
|
|
|
append_newlines, strlen(append_newlines));
|
2012-09-14 10:52:03 +04:00
|
|
|
}
|
2013-02-12 14:17:35 +04:00
|
|
|
|
|
|
|
if (has_footer != 3 && (!no_dup_sob || has_footer != 2))
|
|
|
|
strbuf_splice(msgbuf, msgbuf->len - ignore_footer, 0,
|
|
|
|
sob.buf, sob.len);
|
|
|
|
|
2012-09-14 10:52:03 +04:00
|
|
|
strbuf_release(&sob);
|
|
|
|
}
|