tool_progress.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331
  1. /***************************************************************************
  2. * _ _ ____ _
  3. * Project ___| | | | _ \| |
  4. * / __| | | | |_) | |
  5. * | (__| |_| | _ <| |___
  6. * \___|\___/|_| \_\_____|
  7. *
  8. * Copyright (C) 1998 - 2022, Daniel Stenberg, <daniel@haxx.se>, et al.
  9. *
  10. * This software is licensed as described in the file COPYING, which
  11. * you should have received as part of this distribution. The terms
  12. * are also available at https://curl.se/docs/copyright.html.
  13. *
  14. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  15. * copies of the Software, and permit persons to whom the Software is
  16. * furnished to do so, under the terms of the COPYING file.
  17. *
  18. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  19. * KIND, either express or implied.
  20. *
  21. * SPDX-License-Identifier: curl
  22. *
  23. ***************************************************************************/
  24. #include "tool_setup.h"
  25. #include "tool_operate.h"
  26. #include "tool_progress.h"
  27. #include "tool_util.h"
  28. #define ENABLE_CURLX_PRINTF
  29. /* use our own printf() functions */
  30. #include "curlx.h"
  31. /* The point of this function would be to return a string of the input data,
  32. but never longer than 5 columns (+ one zero byte).
  33. Add suffix k, M, G when suitable... */
  34. static char *max5data(curl_off_t bytes, char *max5)
  35. {
  36. #define ONE_KILOBYTE CURL_OFF_T_C(1024)
  37. #define ONE_MEGABYTE (CURL_OFF_T_C(1024) * ONE_KILOBYTE)
  38. #define ONE_GIGABYTE (CURL_OFF_T_C(1024) * ONE_MEGABYTE)
  39. #define ONE_TERABYTE (CURL_OFF_T_C(1024) * ONE_GIGABYTE)
  40. #define ONE_PETABYTE (CURL_OFF_T_C(1024) * ONE_TERABYTE)
  41. if(bytes < CURL_OFF_T_C(100000))
  42. msnprintf(max5, 6, "%5" CURL_FORMAT_CURL_OFF_T, bytes);
  43. else if(bytes < CURL_OFF_T_C(10000) * ONE_KILOBYTE)
  44. msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "k", bytes/ONE_KILOBYTE);
  45. else if(bytes < CURL_OFF_T_C(100) * ONE_MEGABYTE)
  46. /* 'XX.XM' is good as long as we're less than 100 megs */
  47. msnprintf(max5, 6, "%2" CURL_FORMAT_CURL_OFF_T ".%0"
  48. CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE,
  49. (bytes%ONE_MEGABYTE) / (ONE_MEGABYTE/CURL_OFF_T_C(10)) );
  50. #if (SIZEOF_CURL_OFF_T > 4)
  51. else if(bytes < CURL_OFF_T_C(10000) * ONE_MEGABYTE)
  52. /* 'XXXXM' is good until we're at 10000MB or above */
  53. msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE);
  54. else if(bytes < CURL_OFF_T_C(100) * ONE_GIGABYTE)
  55. /* 10000 MB - 100 GB, we show it as XX.XG */
  56. msnprintf(max5, 6, "%2" CURL_FORMAT_CURL_OFF_T ".%0"
  57. CURL_FORMAT_CURL_OFF_T "G", bytes/ONE_GIGABYTE,
  58. (bytes%ONE_GIGABYTE) / (ONE_GIGABYTE/CURL_OFF_T_C(10)) );
  59. else if(bytes < CURL_OFF_T_C(10000) * ONE_GIGABYTE)
  60. /* up to 10000GB, display without decimal: XXXXG */
  61. msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "G", bytes/ONE_GIGABYTE);
  62. else if(bytes < CURL_OFF_T_C(10000) * ONE_TERABYTE)
  63. /* up to 10000TB, display without decimal: XXXXT */
  64. msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "T", bytes/ONE_TERABYTE);
  65. else
  66. /* up to 10000PB, display without decimal: XXXXP */
  67. msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "P", bytes/ONE_PETABYTE);
  68. /* 16384 petabytes (16 exabytes) is the maximum a 64 bit unsigned number
  69. can hold, but our data type is signed so 8192PB will be the maximum. */
  70. #else
  71. else
  72. msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE);
  73. #endif
  74. return max5;
  75. }
  76. int xferinfo_cb(void *clientp,
  77. curl_off_t dltotal,
  78. curl_off_t dlnow,
  79. curl_off_t ultotal,
  80. curl_off_t ulnow)
  81. {
  82. struct per_transfer *per = clientp;
  83. struct OperationConfig *config = per->config;
  84. per->dltotal = dltotal;
  85. per->dlnow = dlnow;
  86. per->ultotal = ultotal;
  87. per->ulnow = ulnow;
  88. if(per->abort)
  89. return 1;
  90. if(config->readbusy) {
  91. config->readbusy = FALSE;
  92. curl_easy_pause(per->curl, CURLPAUSE_CONT);
  93. }
  94. return 0;
  95. }
  96. /* Provide a string that is 2 + 1 + 2 + 1 + 2 = 8 letters long (plus the zero
  97. byte) */
  98. static void time2str(char *r, curl_off_t seconds)
  99. {
  100. curl_off_t h;
  101. if(seconds <= 0) {
  102. strcpy(r, "--:--:--");
  103. return;
  104. }
  105. h = seconds / CURL_OFF_T_C(3600);
  106. if(h <= CURL_OFF_T_C(99)) {
  107. curl_off_t m = (seconds - (h*CURL_OFF_T_C(3600))) / CURL_OFF_T_C(60);
  108. curl_off_t s = (seconds - (h*CURL_OFF_T_C(3600))) - (m*CURL_OFF_T_C(60));
  109. msnprintf(r, 9, "%2" CURL_FORMAT_CURL_OFF_T ":%02" CURL_FORMAT_CURL_OFF_T
  110. ":%02" CURL_FORMAT_CURL_OFF_T, h, m, s);
  111. }
  112. else {
  113. /* this equals to more than 99 hours, switch to a more suitable output
  114. format to fit within the limits. */
  115. curl_off_t d = seconds / CURL_OFF_T_C(86400);
  116. h = (seconds - (d*CURL_OFF_T_C(86400))) / CURL_OFF_T_C(3600);
  117. if(d <= CURL_OFF_T_C(999))
  118. msnprintf(r, 9, "%3" CURL_FORMAT_CURL_OFF_T
  119. "d %02" CURL_FORMAT_CURL_OFF_T "h", d, h);
  120. else
  121. msnprintf(r, 9, "%7" CURL_FORMAT_CURL_OFF_T "d", d);
  122. }
  123. }
  124. static curl_off_t all_dltotal = 0;
  125. static curl_off_t all_ultotal = 0;
  126. static curl_off_t all_dlalready = 0;
  127. static curl_off_t all_ulalready = 0;
  128. curl_off_t all_xfers = 0; /* current total */
  129. struct speedcount {
  130. curl_off_t dl;
  131. curl_off_t ul;
  132. struct timeval stamp;
  133. };
  134. #define SPEEDCNT 10
  135. static unsigned int speedindex;
  136. static bool indexwrapped;
  137. static struct speedcount speedstore[SPEEDCNT];
  138. /*
  139. |DL% UL% Dled Uled Xfers Live Total Current Left Speed
  140. | 6 -- 9.9G 0 2 2 0:00:40 0:00:02 0:00:37 4087M
  141. */
  142. bool progress_meter(struct GlobalConfig *global,
  143. struct timeval *start,
  144. bool final)
  145. {
  146. static struct timeval stamp;
  147. static bool header = FALSE;
  148. struct timeval now;
  149. long diff;
  150. if(global->noprogress)
  151. return FALSE;
  152. now = tvnow();
  153. diff = tvdiff(now, stamp);
  154. if(!header) {
  155. header = TRUE;
  156. fputs("DL% UL% Dled Uled Xfers Live "
  157. "Total Current Left Speed\n",
  158. global->errors);
  159. }
  160. if(final || (diff > 500)) {
  161. char time_left[10];
  162. char time_total[10];
  163. char time_spent[10];
  164. char buffer[3][6];
  165. curl_off_t spent = tvdiff(now, *start)/1000;
  166. char dlpercen[4]="--";
  167. char ulpercen[4]="--";
  168. struct per_transfer *per;
  169. curl_off_t all_dlnow = 0;
  170. curl_off_t all_ulnow = 0;
  171. bool dlknown = TRUE;
  172. bool ulknown = TRUE;
  173. curl_off_t all_running = 0; /* in progress */
  174. curl_off_t speed = 0;
  175. unsigned int i;
  176. stamp = now;
  177. /* first add the amounts of the already completed transfers */
  178. all_dlnow += all_dlalready;
  179. all_ulnow += all_ulalready;
  180. for(per = transfers; per; per = per->next) {
  181. all_dlnow += per->dlnow;
  182. all_ulnow += per->ulnow;
  183. if(!per->dltotal)
  184. dlknown = FALSE;
  185. else if(!per->dltotal_added) {
  186. /* only add this amount once */
  187. all_dltotal += per->dltotal;
  188. per->dltotal_added = TRUE;
  189. }
  190. if(!per->ultotal)
  191. ulknown = FALSE;
  192. else if(!per->ultotal_added) {
  193. /* only add this amount once */
  194. all_ultotal += per->ultotal;
  195. per->ultotal_added = TRUE;
  196. }
  197. if(per->added)
  198. all_running++;
  199. }
  200. if(dlknown && all_dltotal)
  201. /* TODO: handle integer overflow */
  202. msnprintf(dlpercen, sizeof(dlpercen), "%3" CURL_FORMAT_CURL_OFF_T,
  203. all_dlnow * 100 / all_dltotal);
  204. if(ulknown && all_ultotal)
  205. /* TODO: handle integer overflow */
  206. msnprintf(ulpercen, sizeof(ulpercen), "%3" CURL_FORMAT_CURL_OFF_T,
  207. all_ulnow * 100 / all_ultotal);
  208. /* get the transfer speed, the higher of the two */
  209. i = speedindex;
  210. speedstore[i].dl = all_dlnow;
  211. speedstore[i].ul = all_ulnow;
  212. speedstore[i].stamp = now;
  213. if(++speedindex >= SPEEDCNT) {
  214. indexwrapped = TRUE;
  215. speedindex = 0;
  216. }
  217. {
  218. long deltams;
  219. curl_off_t dl;
  220. curl_off_t ul;
  221. curl_off_t dls;
  222. curl_off_t uls;
  223. if(indexwrapped) {
  224. /* 'speedindex' is the oldest stored data */
  225. deltams = tvdiff(now, speedstore[speedindex].stamp);
  226. dl = all_dlnow - speedstore[speedindex].dl;
  227. ul = all_ulnow - speedstore[speedindex].ul;
  228. }
  229. else {
  230. /* since the beginning */
  231. deltams = tvdiff(now, *start);
  232. dl = all_dlnow;
  233. ul = all_ulnow;
  234. }
  235. if(!deltams) /* no division by zero please */
  236. deltams++;
  237. dls = (curl_off_t)((double)dl / ((double)deltams/1000.0));
  238. uls = (curl_off_t)((double)ul / ((double)deltams/1000.0));
  239. speed = dls > uls ? dls : uls;
  240. }
  241. if(dlknown && speed) {
  242. curl_off_t est = all_dltotal / speed;
  243. curl_off_t left = (all_dltotal - all_dlnow) / speed;
  244. time2str(time_left, left);
  245. time2str(time_total, est);
  246. }
  247. else {
  248. time2str(time_left, 0);
  249. time2str(time_total, 0);
  250. }
  251. time2str(time_spent, spent);
  252. fprintf(global->errors,
  253. "\r"
  254. "%-3s " /* percent downloaded */
  255. "%-3s " /* percent uploaded */
  256. "%s " /* Dled */
  257. "%s " /* Uled */
  258. "%5" CURL_FORMAT_CURL_OFF_T " " /* Xfers */
  259. "%5" CURL_FORMAT_CURL_OFF_T " " /* Live */
  260. " %s " /* Total time */
  261. "%s " /* Current time */
  262. "%s " /* Time left */
  263. "%s " /* Speed */
  264. "%5s" /* final newline */,
  265. dlpercen, /* 3 letters */
  266. ulpercen, /* 3 letters */
  267. max5data(all_dlnow, buffer[0]),
  268. max5data(all_ulnow, buffer[1]),
  269. all_xfers,
  270. all_running,
  271. time_total,
  272. time_spent,
  273. time_left,
  274. max5data(speed, buffer[2]), /* speed */
  275. final ? "\n" :"");
  276. return TRUE;
  277. }
  278. return FALSE;
  279. }
  280. void progress_finalize(struct per_transfer *per)
  281. {
  282. /* get the numbers before this transfer goes away */
  283. all_dlalready += per->dlnow;
  284. all_ulalready += per->ulnow;
  285. if(!per->dltotal_added) {
  286. all_dltotal += per->dltotal;
  287. per->dltotal_added = TRUE;
  288. }
  289. if(!per->ultotal_added) {
  290. all_ultotal += per->ultotal;
  291. per->ultotal_added = TRUE;
  292. }
  293. }