blob: 6154dca1784e84d3a8dc6c311ac216174128784c [file] [log] [blame]
Magnus Dammf5914992009-11-08 16:34:43 +01001/* vi: set sw=4 ts=4: */
2/*
3 * Progress bar code.
4 */
5/* Original copyright notice which applies to the CONFIG_FEATURE_WGET_STATUSBAR stuff,
6 * much of which was blatantly stolen from openssh.
7 */
8/*-
9 * Copyright (c) 1992, 1993
Denys Vlasenkoe4dcba12010-10-28 18:57:19 +020010 * The Regents of the University of California. All rights reserved.
Magnus Dammf5914992009-11-08 16:34:43 +010011 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 *
Denys Vlasenkoe4dcba12010-10-28 18:57:19 +020021 * 3. BSD Advertising Clause omitted per the July 22, 1999 licensing change
22 * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
Magnus Dammf5914992009-11-08 16:34:43 +010023 *
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 */
40#include "libbb.h"
41#include "unicode.h"
42
43enum {
44 /* Seconds when xfer considered "stalled" */
45 STALLTIME = 5
46};
47
Denys Vlasenkod55e1392011-02-11 18:56:13 +010048void FAST_FUNC bb_progress_init(bb_progress_t *p, const char *curfile)
Magnus Dammf5914992009-11-08 16:34:43 +010049{
Denys Vlasenkod55e1392011-02-11 18:56:13 +010050#if ENABLE_UNICODE_SUPPORT
51 init_unicode();
52 p->curfile = unicode_conv_to_printable_fixedwidth(/*NULL,*/ curfile, 20);
53#else
54 p->curfile = curfile;
55#endif
Magnus Dammf5914992009-11-08 16:34:43 +010056 p->start_sec = monotonic_sec();
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +010057 p->last_update_sec = p->start_sec;
58 p->last_change_sec = p->start_sec;
59 p->last_size = 0;
Magnus Dammf5914992009-11-08 16:34:43 +010060}
61
Denys Vlasenkof836f012011-02-10 23:02:28 +010062/* File already had beg_size bytes.
63 * Then we started downloading.
64 * We downloaded "transferred" bytes so far.
65 * Download is expected to stop when total size (beg_size + transferred)
66 * will be "totalsize" bytes.
67 * If totalsize == 0, then it is unknown.
68 */
Magnus Dammf5914992009-11-08 16:34:43 +010069void FAST_FUNC bb_progress_update(bb_progress_t *p,
Denys Vlasenkof836f012011-02-10 23:02:28 +010070 uoff_t beg_size,
Denys Vlasenko805aa9f2011-02-10 14:25:51 +010071 uoff_t transferred,
72 uoff_t totalsize)
Magnus Dammf5914992009-11-08 16:34:43 +010073{
Bradley M. Kuhnc97131c2010-08-08 02:51:20 +020074 uoff_t beg_and_transferred;
Magnus Dammf5914992009-11-08 16:34:43 +010075 unsigned since_last_update, elapsed;
Denys Vlasenko805aa9f2011-02-10 14:25:51 +010076 int barlength;
77 int kiloscale;
Magnus Dammf5914992009-11-08 16:34:43 +010078
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +010079 //transferred = 1234; /* use for stall detection testing */
80 //totalsize = 0; /* use for unknown size download testing */
81
Bradley M. Kuhnc97131c2010-08-08 02:51:20 +020082 elapsed = monotonic_sec();
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +010083 since_last_update = elapsed - p->last_update_sec;
84 p->last_update_sec = elapsed;
Denys Vlasenkoe52e67c2011-02-11 12:59:11 +010085
86 if (totalsize != 0 && transferred >= totalsize - beg_size) {
87 /* Last call. Do not skip this update */
88 transferred = totalsize - beg_size; /* sanitize just in case */
89 }
90 else if (since_last_update == 0) {
91 /*
92 * Do not update on every call
93 * (we can be called on every network read!)
94 */
Denys Vlasenko84dba9c2011-01-10 12:51:44 +010095 return;
Denys Vlasenkoe52e67c2011-02-11 12:59:11 +010096 }
Bradley M. Kuhnc97131c2010-08-08 02:51:20 +020097
Denys Vlasenko805aa9f2011-02-10 14:25:51 +010098 kiloscale = 0;
Denys Vlasenkof836f012011-02-10 23:02:28 +010099 /*
100 * Scale sizes down if they are close to overflowing.
101 * This allows calculations like (100 * transferred / totalsize)
102 * without risking overflow: we guarantee 10 highest bits to be 0.
103 * Introduced error is less than 1 / 2^12 ~= 0.025%
104 */
105 if (ULONG_MAX > 0xffffffff || sizeof(off_t) == 4 || sizeof(off_t) != 8) {
106 /*
107 * 64-bit CPU || small off_t: in either case,
108 * >> is cheap, single-word operation.
Denys Vlasenkoe52e67c2011-02-11 12:59:11 +0100109 * ... || strange off_t: also use this code
110 * (it is safe, just suboptimal wrt code size),
111 * because 32/64 optimized one works only for 64-bit off_t.
Denys Vlasenkof836f012011-02-10 23:02:28 +0100112 */
113 if (totalsize >= (1 << 22)) {
114 totalsize >>= 10;
115 beg_size >>= 10;
116 transferred >>= 10;
Denys Vlasenkof836f012011-02-10 23:02:28 +0100117 kiloscale = 1;
118 }
119 } else {
120 /* 32-bit CPU and 64-bit off_t.
Denys Vlasenkoe52e67c2011-02-11 12:59:11 +0100121 * Use a 40-bit shift, it is easier to do on 32-bit CPU.
Denys Vlasenkof836f012011-02-10 23:02:28 +0100122 */
Denys Vlasenko8345b2b2011-03-12 02:19:50 +0100123/* ONE suppresses "warning: shift count >= width of type" */
124#define ONE (sizeof(off_t) > 4)
125 if (totalsize >= (uoff_t)(1ULL << 54*ONE)) {
126 totalsize = (uint32_t)(totalsize >> 32*ONE) >> 8;
127 beg_size = (uint32_t)(beg_size >> 32*ONE) >> 8;
128 transferred = (uint32_t)(transferred >> 32*ONE) >> 8;
Denys Vlasenkof836f012011-02-10 23:02:28 +0100129 kiloscale = 4;
130 }
Magnus Dammf5914992009-11-08 16:34:43 +0100131 }
132
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +0100133 if (ENABLE_UNICODE_SUPPORT)
134 fprintf(stderr, "\r%s", p->curfile);
135 else
136 fprintf(stderr, "\r%-20.20s", p->curfile);
137
Denys Vlasenkoe52e67c2011-02-11 12:59:11 +0100138 beg_and_transferred = beg_size + transferred;
Denys Vlasenko805aa9f2011-02-10 14:25:51 +0100139
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +0100140 if (totalsize != 0) {
141 unsigned ratio = 100 * beg_and_transferred / totalsize;
142 fprintf(stderr, "%4u%%", ratio);
Magnus Dammf5914992009-11-08 16:34:43 +0100143
Denys Vlasenko641caae2015-10-23 01:44:22 +0200144 barlength = get_terminal_width(2) - 49;
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +0100145 if (barlength > 0) {
146 /* god bless gcc for variable arrays :) */
147 char buf[barlength + 1];
148 unsigned stars = (unsigned)barlength * beg_and_transferred / totalsize;
149 memset(buf, ' ', barlength);
150 buf[barlength] = '\0';
151 memset(buf, '*', stars);
152 fprintf(stderr, " |%s|", buf);
153 }
Magnus Dammf5914992009-11-08 16:34:43 +0100154 }
Denys Vlasenkoda0df472010-08-08 04:21:50 +0200155
Bradley M. Kuhnc97131c2010-08-08 02:51:20 +0200156 while (beg_and_transferred >= 100000) {
Bradley M. Kuhnc97131c2010-08-08 02:51:20 +0200157 beg_and_transferred >>= 10;
Denys Vlasenkof836f012011-02-10 23:02:28 +0100158 kiloscale++;
Magnus Dammf5914992009-11-08 16:34:43 +0100159 }
160 /* see http://en.wikipedia.org/wiki/Tera */
Denys Vlasenko838d4bb2011-02-10 23:35:52 +0100161 fprintf(stderr, "%6u%c", (unsigned)beg_and_transferred, " kMGTPEZY"[kiloscale]);
Denys Vlasenko805aa9f2011-02-10 14:25:51 +0100162#define beg_and_transferred dont_use_beg_and_transferred_below()
Magnus Dammf5914992009-11-08 16:34:43 +0100163
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +0100164 since_last_update = elapsed - p->last_change_sec;
165 if ((unsigned)transferred != p->last_size) {
166 p->last_change_sec = elapsed;
167 p->last_size = (unsigned)transferred;
Magnus Dammf5914992009-11-08 16:34:43 +0100168 if (since_last_update >= STALLTIME) {
Denys Vlasenkoe52e67c2011-02-11 12:59:11 +0100169 /* We "cut out" these seconds from elapsed time
Magnus Dammf5914992009-11-08 16:34:43 +0100170 * by adjusting start time */
171 p->start_sec += since_last_update;
172 }
173 since_last_update = 0; /* we are un-stalled now */
174 }
Denys Vlasenkof836f012011-02-10 23:02:28 +0100175
Magnus Dammf5914992009-11-08 16:34:43 +0100176 elapsed -= p->start_sec; /* now it's "elapsed since start" */
177
178 if (since_last_update >= STALLTIME) {
Denys Vlasenko838d4bb2011-02-10 23:35:52 +0100179 fprintf(stderr, " - stalled -");
Denys Vlasenkoab8d00d2011-02-11 19:09:30 +0100180 } else if (!totalsize || !transferred || (int)elapsed < 0) {
Denys Vlasenko838d4bb2011-02-10 23:35:52 +0100181 fprintf(stderr, " --:--:-- ETA");
Magnus Dammf5914992009-11-08 16:34:43 +0100182 } else {
Denys Vlasenkof836f012011-02-10 23:02:28 +0100183 unsigned eta, secs, hours;
184
185 totalsize -= beg_size; /* now it's "total to upload" */
186
187 /* Estimated remaining time =
188 * estimated_sec_to_dl_totalsize_bytes - elapsed_sec =
189 * totalsize / average_bytes_sec_so_far - elapsed =
190 * totalsize / (transferred/elapsed) - elapsed =
191 * totalsize * elapsed / transferred - elapsed
192 */
193 eta = totalsize * elapsed / transferred - elapsed;
Denys Vlasenko838d4bb2011-02-10 23:35:52 +0100194 if (eta >= 1000*60*60)
195 eta = 1000*60*60 - 1;
Denys Vlasenkof836f012011-02-10 23:02:28 +0100196 secs = eta % 3600;
197 hours = eta / 3600;
Denys Vlasenko838d4bb2011-02-10 23:35:52 +0100198 fprintf(stderr, "%3u:%02u:%02u ETA", hours, secs / 60, secs % 60);
Magnus Dammf5914992009-11-08 16:34:43 +0100199 }
200}