progress.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205
  1. /* 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
  10. * The Regents of the University of California. All rights reserved.
  11. *
  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. *
  21. * 3. BSD Advertising Clause omitted per the July 22, 1999 licensing change
  22. * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
  23. *
  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. enum {
  43. /* Seconds when xfer considered "stalled" */
  44. STALLTIME = 5
  45. };
  46. void FAST_FUNC bb_progress_init(bb_progress_t *p, const char *curfile)
  47. {
  48. #if ENABLE_UNICODE_SUPPORT
  49. init_unicode();
  50. p->curfile = unicode_conv_to_printable_fixedwidth(/*NULL,*/ curfile, 20);
  51. #else
  52. p->curfile = curfile;
  53. #endif
  54. p->start_sec = monotonic_sec();
  55. p->last_update_sec = p->start_sec;
  56. p->last_change_sec = p->start_sec;
  57. p->last_size = 0;
  58. }
  59. /* File already had beg_size bytes.
  60. * Then we started downloading.
  61. * We downloaded "transferred" bytes so far.
  62. * Download is expected to stop when total size (beg_size + transferred)
  63. * will be "totalsize" bytes.
  64. * If totalsize == 0, then it is unknown.
  65. */
  66. void FAST_FUNC bb_progress_update(bb_progress_t *p,
  67. uoff_t beg_size,
  68. uoff_t transferred,
  69. uoff_t totalsize)
  70. {
  71. uoff_t beg_and_transferred;
  72. unsigned since_last_update, elapsed;
  73. int notty;
  74. int kiloscale;
  75. //transferred = 1234; /* use for stall detection testing */
  76. //totalsize = 0; /* use for unknown size download testing */
  77. elapsed = monotonic_sec();
  78. since_last_update = elapsed - p->last_update_sec;
  79. p->last_update_sec = elapsed;
  80. if (totalsize != 0 && transferred >= totalsize - beg_size) {
  81. /* Last call. Do not skip this update */
  82. transferred = totalsize - beg_size; /* sanitize just in case */
  83. }
  84. else if (since_last_update == 0) {
  85. /*
  86. * Do not update on every call
  87. * (we can be called on every network read!)
  88. */
  89. return;
  90. }
  91. kiloscale = 0;
  92. /*
  93. * Scale sizes down if they are close to overflowing.
  94. * This allows calculations like (100 * transferred / totalsize)
  95. * without risking overflow: we guarantee 10 highest bits to be 0.
  96. * Introduced error is less than 1 / 2^12 ~= 0.025%
  97. */
  98. if (ULONG_MAX > 0xffffffff || sizeof(off_t) == 4 || sizeof(off_t) != 8) {
  99. /*
  100. * 64-bit CPU || small off_t: in either case,
  101. * >> is cheap, single-word operation.
  102. * ... || strange off_t: also use this code
  103. * (it is safe, just suboptimal wrt code size),
  104. * because 32/64 optimized one works only for 64-bit off_t.
  105. */
  106. if (totalsize >= (1 << 22)) {
  107. totalsize >>= 10;
  108. beg_size >>= 10;
  109. transferred >>= 10;
  110. kiloscale = 1;
  111. }
  112. } else {
  113. /* 32-bit CPU and 64-bit off_t.
  114. * Use a 40-bit shift, it is easier to do on 32-bit CPU.
  115. */
  116. /* ONE suppresses "warning: shift count >= width of type" */
  117. #define ONE (sizeof(off_t) > 4)
  118. if (totalsize >= (uoff_t)(1ULL << 54*ONE)) {
  119. totalsize = (uint32_t)(totalsize >> 32*ONE) >> 8;
  120. beg_size = (uint32_t)(beg_size >> 32*ONE) >> 8;
  121. transferred = (uint32_t)(transferred >> 32*ONE) >> 8;
  122. kiloscale = 4;
  123. }
  124. }
  125. notty = !isatty(STDERR_FILENO);
  126. if (ENABLE_UNICODE_SUPPORT)
  127. fprintf(stderr, "\r%s" + notty, p->curfile);
  128. else
  129. fprintf(stderr, "\r%-20.20s" + notty, p->curfile);
  130. beg_and_transferred = beg_size + transferred;
  131. if (totalsize != 0) {
  132. int barlength;
  133. unsigned ratio = 100 * beg_and_transferred / totalsize;
  134. fprintf(stderr, "%4u%%", ratio);
  135. barlength = get_terminal_width(2) - 49;
  136. if (barlength > 0) {
  137. /* god bless gcc for variable arrays :) */
  138. char buf[barlength + 1];
  139. unsigned stars = (unsigned)barlength * beg_and_transferred / totalsize;
  140. memset(buf, ' ', barlength);
  141. buf[barlength] = '\0';
  142. memset(buf, '*', stars);
  143. fprintf(stderr, " |%s|", buf);
  144. }
  145. }
  146. while (beg_and_transferred >= 100000) {
  147. beg_and_transferred >>= 10;
  148. kiloscale++;
  149. }
  150. /* see http://en.wikipedia.org/wiki/Tera */
  151. fprintf(stderr, "%6u%c", (unsigned)beg_and_transferred, " kMGTPEZY"[kiloscale]);
  152. #define beg_and_transferred dont_use_beg_and_transferred_below()
  153. since_last_update = elapsed - p->last_change_sec;
  154. if ((unsigned)transferred != p->last_size) {
  155. p->last_change_sec = elapsed;
  156. p->last_size = (unsigned)transferred;
  157. if (since_last_update >= STALLTIME) {
  158. /* We "cut out" these seconds from elapsed time
  159. * by adjusting start time */
  160. p->start_sec += since_last_update;
  161. }
  162. since_last_update = 0; /* we are un-stalled now */
  163. }
  164. elapsed -= p->start_sec; /* now it's "elapsed since start" */
  165. if (since_last_update >= STALLTIME) {
  166. fprintf(stderr, " - stalled -");
  167. } else if (!totalsize || !transferred || (int)elapsed < 0) {
  168. fprintf(stderr, " --:--:-- ETA");
  169. } else {
  170. unsigned eta, secs, hours;
  171. totalsize -= beg_size; /* now it's "total to upload" */
  172. /* Estimated remaining time =
  173. * estimated_sec_to_dl_totalsize_bytes - elapsed_sec =
  174. * totalsize / average_bytes_sec_so_far - elapsed =
  175. * totalsize / (transferred/elapsed) - elapsed =
  176. * totalsize * elapsed / transferred - elapsed
  177. */
  178. eta = totalsize * elapsed / transferred - elapsed;
  179. if (eta >= 1000*60*60)
  180. eta = 1000*60*60 - 1;
  181. secs = eta % 3600;
  182. hours = eta / 3600;
  183. fprintf(stderr, "%3u:%02u:%02u ETA", hours, secs / 60, secs % 60);
  184. }
  185. if (notty)
  186. fputc('\n', stderr);
  187. }