@ -940,7 +940,7 @@ int bisect_next_all(const char *prefix, int no_checkout)
struct commit_list *tried;
struct commit_list *tried;
int reaches = 0, all = 0, nr, steps;
int reaches = 0, all = 0, nr, steps;
const unsigned char *bisect_rev;
const unsigned char *bisect_rev;
char steps_msg[32];
char *steps_msg;
read_bisect_terms(&term_bad, &term_good);
read_bisect_terms(&term_bad, &term_good);
if (read_bisect_refs())
if (read_bisect_refs())
@ -990,14 +990,15 @@ int bisect_next_all(const char *prefix, int no_checkout)
nr = all - reaches - 1;
nr = all - reaches - 1;
steps = estimate_bisect_steps(all);
steps = estimate_bisect_steps(all);
xsnprintf(steps_msg, sizeof(steps_msg),
Q_("(roughly %d step)", "(roughly %d steps)", steps),
steps_msg = xstrfmt(Q_("(roughly %d step)", "(roughly %d steps)",
steps);
steps), steps);
/* TRANSLATORS: the last %s will be replaced with
/* TRANSLATORS: the last %s will be replaced with
"(roughly %d steps)" translation */
"(roughly %d steps)" translation */
printf(Q_("Bisecting: %d revision left to test after this %s\n",
printf(Q_("Bisecting: %d revision left to test after this %s\n",
"Bisecting: %d revisions left to test after this %s\n",
"Bisecting: %d revisions left to test after this %s\n",
nr), nr, steps_msg);
nr), nr, steps_msg);
free(steps_msg);
return bisect_checkout(bisect_rev, no_checkout);
return bisect_checkout(bisect_rev, no_checkout);
}
}