1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402
|
/* libguestfs - mini library for progress bars.
* Copyright (C) 2010-2012 Red Hat Inc.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/**
* This file implements the progress bar in L<guestfish(1)>,
* L<virt-resize(1)> and L<virt-sparsify(1)>.
*/
#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <inttypes.h>
#include <math.h>
#include <sys/time.h>
#include <langinfo.h>
#include "guestfs.h"
#include "guestfs-utils.h"
#include "progress.h"
/* Include these last since they redefine symbols such as 'lines'
* which seriously breaks other headers.
*/
#include <term.h>
#include <curses.h>
/* Provided by termcap or terminfo emulation, but not defined
* in any header file.
*/
extern const char *UP;
/* Compute the running mean and standard deviation from the
* series of estimated values.
*
* Method:
* http://en.wikipedia.org/wiki/Standard_deviation#Rapid_calculation_methods
* Checked in a test program against answers given by Wolfram Alpha.
*/
struct rmsd {
double a; /* mean */
double i; /* number of samples */
double q;
};
static void
rmsd_init (struct rmsd *r)
{
r->a = 0;
r->i = 1;
r->q = 0;
}
static void
rmsd_add_sample (struct rmsd *r, double x)
{
double a_next, q_next;
a_next = r->a + (x - r->a) / r->i;
q_next = r->q + (x - r->a) * (x - a_next);
r->a = a_next;
r->q = q_next;
r->i += 1.0;
}
static double
rmsd_get_mean (const struct rmsd *r)
{
return r->a;
}
static double
rmsd_get_standard_deviation (const struct rmsd *r)
{
return sqrt (r->q / (r->i - 1.0));
}
struct progress_bar {
double start; /* start time of command */
size_t count; /* number of progress notifications per cmd */
struct rmsd rmsd; /* running mean and standard deviation */
int have_terminfo;
int utf8_mode;
int machine_readable;
FILE *fp; /* output device, only used when !dumb mode */
};
/**
* Initialize a progress bar struct.
*
* It is intended that you can reuse the same struct for multiple
* commands (but only in a single thread). Call C<progress_bar_reset>
* before each new command.
*/
struct progress_bar *
progress_bar_init (unsigned flags)
{
struct progress_bar *bar;
char *term;
bar = malloc (sizeof *bar);
if (bar == NULL)
return NULL;
if (flags & PROGRESS_BAR_MACHINE_READABLE) {
bar->machine_readable = 1;
bar->utf8_mode = 0;
bar->have_terminfo = 0;
} else {
bar->machine_readable = 0;
bar->utf8_mode = STREQ (nl_langinfo (CODESET), "UTF-8");
bar->have_terminfo = 0;
term = getenv ("TERM");
if (term) {
if (tgetent (NULL, term) == 1)
bar->have_terminfo = 1;
}
bar->fp = fopen ("/dev/tty", "w"); /* deliberately ignore errors */
}
/* Call this to ensure the other fields are in a reasonable state.
* It is still the caller's responsibility to reset the progress bar
* before each command.
*/
progress_bar_reset (bar);
return bar;
}
/**
* Free a progress bar struct.
*/
void
progress_bar_free (struct progress_bar *bar)
{
if (bar->fp)
fclose (bar->fp);
free (bar);
}
/**
* This function should be called just before you issue any command.
*/
void
progress_bar_reset (struct progress_bar *bar)
{
/* The time at which this command was issued. */
struct timeval start_t;
gettimeofday (&start_t, NULL);
bar->start = start_t.tv_sec + start_t.tv_usec / 1000000.;
bar->count = 0;
rmsd_init (&bar->rmsd);
}
static const char *
spinner (struct progress_bar *bar, size_t count)
{
/* Choice of unicode spinners.
*
* For basic dingbats, see:
* http://www.fileformat.info/info/unicode/block/geometric_shapes/utf8test.htm
* http://www.fileformat.info/info/unicode/block/dingbats/utf8test.htm
*
* Arrows are a mess in unicode. This page helps a lot:
* http://xahlee.org/comp/unicode_arrows.html
*
* I prefer something which doesn't point, just spins.
*/
/* Black pointing triangle. */
//static const char *us[] = { "\u25b2", "\u25b6", "\u25bc", "\u25c0" };
/* White pointing triangle. */
//static const char *us[] = { "\u25b3", "\u25b7", "\u25bd", "\u25c1" };
/* Circle with half black. */
static const char *us[] = { "\u25d0", "\u25d3", "\u25d1", "\u25d2" };
/* White square white quadrant. */
//static const char *us[] = { "\u25f0", "\u25f3", "\u25f2", "\u25f1" };
/* White circle white quadrant. */
//static const char *us[] = { "\u25f4", "\u25f7", "\u25f6", "\u25f5" };
/* Black triangle. */
//static const char *us[] = { "\u25e2", "\u25e3", "\u25e4", "\u25e5" };
/* Spinning arrow in 8 directions. */
//static const char *us[] = { "\u2190", "\u2196", "\u2191", "\u2197",
// "\u2192", "\u2198", "\u2193", "\u2199" };
/* ASCII spinner. */
static const char *as[] = { "/", "-", "\\", "|" };
const char **s;
size_t n;
if (bar->utf8_mode) {
s = us;
n = sizeof us / sizeof us[0];
}
else {
s = as;
n = sizeof as / sizeof as[0];
}
return s[count % n];
}
/**
* Return remaining time estimate (in seconds) for current call.
*
* This returns the running mean estimate of remaining time, but if
* the latest estimate of total time is greater than two s.d.'s from
* the running mean then we don't print anything because we're not
* confident that the estimate is meaningful. (Returned value is
* E<lt>0.0 when nothing should be printed).
*/
static double
estimate_remaining_time (struct progress_bar *bar, double ratio)
{
if (ratio <= 0.)
return -1.0;
struct timeval now_t;
gettimeofday (&now_t, NULL);
double now = now_t.tv_sec + now_t.tv_usec / 1000000.;
/* We've done 'ratio' of the work in 'now - start' seconds. */
double time_passed = now - bar->start;
double total_time = time_passed / ratio;
/* Add total_time to running mean and s.d. and then see if our
* estimate of total time is meaningful.
*/
rmsd_add_sample (&bar->rmsd, total_time);
double mean = rmsd_get_mean (&bar->rmsd);
double sd = rmsd_get_standard_deviation (&bar->rmsd);
if (fabs (total_time - mean) >= 2.0*sd)
return -1.0;
/* Don't return early estimates. */
if (time_passed < 3.0)
return -1.0;
return total_time - time_passed;
}
/* The overhead is how much we subtract before we get to the progress
* bar itself.
*
* / 100% [########---------------] xx:xx
* | | | | |
* | | | | time (5 cols)
* | | | |
* | | open paren + close paren + space (3 cols)
* | |
* | percentage and space (5 cols)
* |
* spinner and space (2 cols)
*
* Total = 2 + 5 + 3 + 5 = 15
*/
#define COLS_OVERHEAD 15
/**
* Set the position of the progress bar.
*
* This should be called from a C<GUESTFS_EVENT_PROGRESS> event
* callback.
*/
void
progress_bar_set (struct progress_bar *bar,
uint64_t position, uint64_t total)
{
size_t i, cols;
int pulse_mode;
double ratio;
const char *s_open, *s_dot, *s_dash, *s_close;
FILE *fp;
if (bar->machine_readable || bar->have_terminfo == 0) {
dumb:
printf ("%" PRIu64 "/%" PRIu64 "\n", position, total);
fflush (stdout);
} else {
cols = tgetnum ((char *) "co");
if (cols < 32) goto dumb;
/* Send progress bar output to /dev/tty if we could open it, else stdout. */
fp = bar->fp;
if (!fp)
fp = stdout;
/* Update an existing progress bar just printed? */
if (bar->count > 0) {
/* XXX We should call tputs here, but (a) it's unlikely that any
* modern terminal is so slow that it requires padding, and
* (b) it's just not possible to use tputs in a sane way here.
*/
/*tputs (UP, 2, putchar);*/
fprintf (fp, "%s", UP);
}
bar->count++;
/* Find out if we're in "pulse mode". */
pulse_mode = position == 0 && total == 1;
ratio = (double) position / total;
if (ratio < 0) ratio = 0; else if (ratio > 1) ratio = 1;
if (pulse_mode) {
fprintf (fp, "%s --- ", spinner (bar, bar->count));
}
else if (ratio < 1) {
const int percent = 100.0 * ratio;
fprintf (fp, "%s%3d%% ", spinner (bar, bar->count), percent);
}
else {
fputs (" 100% ", fp);
}
if (bar->utf8_mode) {
s_open = "\u27e6";
s_dot = "\u2592";
s_dash = "\u2550";
s_close = "\u27e7";
} else {
s_open = "["; s_dot = "#"; s_dash = "-"; s_close = "]";
}
fputs (s_open, fp);
if (!pulse_mode) {
const size_t dots = ratio * (double) (cols - COLS_OVERHEAD);
for (i = 0; i < dots; ++i)
fputs (s_dot, fp);
for (i = dots; i < cols - COLS_OVERHEAD; ++i)
fputs (s_dash, fp);
}
else { /* "Pulse mode": the progress bar just pulses. */
for (i = 0; i < cols - COLS_OVERHEAD; ++i) {
const int cc = (bar->count * 3 - i) % (cols - COLS_OVERHEAD);
if (cc >= 0 && cc <= 3)
fputs (s_dot, fp);
else
fputs (s_dash, fp);
}
}
fputs (s_close, fp);
fputc (' ', fp);
/* Time estimate. */
double estimate = estimate_remaining_time (bar, ratio);
if (estimate >= 100.0 * 60.0 * 60.0 /* >= 100 hours */) {
/* Display hours<h> */
estimate /= 60. * 60.;
const int hh = floor (estimate);
fprintf (fp, ">%dh", hh);
} else if (estimate >= 100.0 * 60.0 /* >= 100 minutes */) {
/* Display hours<h>minutes */
estimate /= 60. * 60.;
const int hh = floor (estimate);
double ignore;
const int mm = floor (modf (estimate, &ignore) * 60.);
fprintf (fp, "%02dh%02d", hh, mm);
} else if (estimate >= 0.0) {
/* Display minutes:seconds */
estimate /= 60.;
const int mm = floor (estimate);
double ignore;
const int ss = floor (modf (estimate, &ignore) * 60.);
fprintf (fp, "%02d:%02d", mm, ss);
}
else /* < 0 means estimate was not meaningful */
fputs ("--:--", fp);
fputc ('\n', fp);
fflush (fp);
}
}
|