progress.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567
  1. /***************************************************************************
  2. * _ _ ____ _
  3. * Project ___| | | | _ \| |
  4. * / __| | | | |_) | |
  5. * | (__| |_| | _ <| |___
  6. * \___|\___/|_| \_\_____|
  7. *
  8. * Copyright (C) 1998 - 2016, Daniel Stenberg, <[email protected]>, 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.haxx.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. ***************************************************************************/
  22. #include "curl_setup.h"
  23. #include "urldata.h"
  24. #include "sendf.h"
  25. #include "progress.h"
  26. #include "curl_printf.h"
  27. /* Provide a string that is 2 + 1 + 2 + 1 + 2 = 8 letters long (plus the zero
  28. byte) */
  29. static void time2str(char *r, curl_off_t seconds)
  30. {
  31. curl_off_t d, h, m, s;
  32. if(seconds <= 0) {
  33. strcpy(r, "--:--:--");
  34. return;
  35. }
  36. h = seconds / CURL_OFF_T_C(3600);
  37. if(h <= CURL_OFF_T_C(99)) {
  38. m = (seconds - (h*CURL_OFF_T_C(3600))) / CURL_OFF_T_C(60);
  39. s = (seconds - (h*CURL_OFF_T_C(3600))) - (m*CURL_OFF_T_C(60));
  40. snprintf(r, 9, "%2" CURL_FORMAT_CURL_OFF_T ":%02" CURL_FORMAT_CURL_OFF_T
  41. ":%02" CURL_FORMAT_CURL_OFF_T, h, m, s);
  42. }
  43. else {
  44. /* this equals to more than 99 hours, switch to a more suitable output
  45. format to fit within the limits. */
  46. d = seconds / CURL_OFF_T_C(86400);
  47. h = (seconds - (d*CURL_OFF_T_C(86400))) / CURL_OFF_T_C(3600);
  48. if(d <= CURL_OFF_T_C(999))
  49. snprintf(r, 9, "%3" CURL_FORMAT_CURL_OFF_T
  50. "d %02" CURL_FORMAT_CURL_OFF_T "h", d, h);
  51. else
  52. snprintf(r, 9, "%7" CURL_FORMAT_CURL_OFF_T "d", d);
  53. }
  54. }
  55. /* The point of this function would be to return a string of the input data,
  56. but never longer than 5 columns (+ one zero byte).
  57. Add suffix k, M, G when suitable... */
  58. static char *max5data(curl_off_t bytes, char *max5)
  59. {
  60. #define ONE_KILOBYTE CURL_OFF_T_C(1024)
  61. #define ONE_MEGABYTE (CURL_OFF_T_C(1024) * ONE_KILOBYTE)
  62. #define ONE_GIGABYTE (CURL_OFF_T_C(1024) * ONE_MEGABYTE)
  63. #define ONE_TERABYTE (CURL_OFF_T_C(1024) * ONE_GIGABYTE)
  64. #define ONE_PETABYTE (CURL_OFF_T_C(1024) * ONE_TERABYTE)
  65. if(bytes < CURL_OFF_T_C(100000))
  66. snprintf(max5, 6, "%5" CURL_FORMAT_CURL_OFF_T, bytes);
  67. else if(bytes < CURL_OFF_T_C(10000) * ONE_KILOBYTE)
  68. snprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "k", bytes/ONE_KILOBYTE);
  69. else if(bytes < CURL_OFF_T_C(100) * ONE_MEGABYTE)
  70. /* 'XX.XM' is good as long as we're less than 100 megs */
  71. snprintf(max5, 6, "%2" CURL_FORMAT_CURL_OFF_T ".%0"
  72. CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE,
  73. (bytes%ONE_MEGABYTE) / (ONE_MEGABYTE/CURL_OFF_T_C(10)) );
  74. #if (CURL_SIZEOF_CURL_OFF_T > 4)
  75. else if(bytes < CURL_OFF_T_C(10000) * ONE_MEGABYTE)
  76. /* 'XXXXM' is good until we're at 10000MB or above */
  77. snprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE);
  78. else if(bytes < CURL_OFF_T_C(100) * ONE_GIGABYTE)
  79. /* 10000 MB - 100 GB, we show it as XX.XG */
  80. snprintf(max5, 6, "%2" CURL_FORMAT_CURL_OFF_T ".%0"
  81. CURL_FORMAT_CURL_OFF_T "G", bytes/ONE_GIGABYTE,
  82. (bytes%ONE_GIGABYTE) / (ONE_GIGABYTE/CURL_OFF_T_C(10)) );
  83. else if(bytes < CURL_OFF_T_C(10000) * ONE_GIGABYTE)
  84. /* up to 10000GB, display without decimal: XXXXG */
  85. snprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "G", bytes/ONE_GIGABYTE);
  86. else if(bytes < CURL_OFF_T_C(10000) * ONE_TERABYTE)
  87. /* up to 10000TB, display without decimal: XXXXT */
  88. snprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "T", bytes/ONE_TERABYTE);
  89. else
  90. /* up to 10000PB, display without decimal: XXXXP */
  91. snprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "P", bytes/ONE_PETABYTE);
  92. /* 16384 petabytes (16 exabytes) is the maximum a 64 bit unsigned number
  93. can hold, but our data type is signed so 8192PB will be the maximum. */
  94. #else
  95. else
  96. snprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE);
  97. #endif
  98. return max5;
  99. }
  100. /*
  101. New proposed interface, 9th of February 2000:
  102. pgrsStartNow() - sets start time
  103. pgrsSetDownloadSize(x) - known expected download size
  104. pgrsSetUploadSize(x) - known expected upload size
  105. pgrsSetDownloadCounter() - amount of data currently downloaded
  106. pgrsSetUploadCounter() - amount of data currently uploaded
  107. pgrsUpdate() - show progress
  108. pgrsDone() - transfer complete
  109. */
  110. int Curl_pgrsDone(struct connectdata *conn)
  111. {
  112. int rc;
  113. struct Curl_easy *data = conn->data;
  114. data->progress.lastshow=0;
  115. rc = Curl_pgrsUpdate(conn); /* the final (forced) update */
  116. if(rc)
  117. return rc;
  118. if(!(data->progress.flags & PGRS_HIDE) &&
  119. !data->progress.callback)
  120. /* only output if we don't use a progress callback and we're not
  121. * hidden */
  122. fprintf(data->set.err, "\n");
  123. data->progress.speeder_c = 0; /* reset the progress meter display */
  124. return 0;
  125. }
  126. /* reset all times except redirect, and reset the known transfer sizes */
  127. void Curl_pgrsResetTimesSizes(struct Curl_easy *data)
  128. {
  129. data->progress.t_nslookup = 0.0;
  130. data->progress.t_connect = 0.0;
  131. data->progress.t_pretransfer = 0.0;
  132. data->progress.t_starttransfer = 0.0;
  133. Curl_pgrsSetDownloadSize(data, -1);
  134. Curl_pgrsSetUploadSize(data, -1);
  135. }
  136. void Curl_pgrsTime(struct Curl_easy *data, timerid timer)
  137. {
  138. struct timeval now = Curl_tvnow();
  139. switch(timer) {
  140. default:
  141. case TIMER_NONE:
  142. /* mistake filter */
  143. break;
  144. case TIMER_STARTOP:
  145. /* This is set at the start of a transfer */
  146. data->progress.t_startop = now;
  147. break;
  148. case TIMER_STARTSINGLE:
  149. /* This is set at the start of each single fetch */
  150. data->progress.t_startsingle = now;
  151. break;
  152. case TIMER_STARTACCEPT:
  153. data->progress.t_acceptdata = Curl_tvnow();
  154. break;
  155. case TIMER_NAMELOOKUP:
  156. data->progress.t_nslookup =
  157. Curl_tvdiff_secs(now, data->progress.t_startsingle);
  158. break;
  159. case TIMER_CONNECT:
  160. data->progress.t_connect =
  161. Curl_tvdiff_secs(now, data->progress.t_startsingle);
  162. break;
  163. case TIMER_APPCONNECT:
  164. data->progress.t_appconnect =
  165. Curl_tvdiff_secs(now, data->progress.t_startsingle);
  166. break;
  167. case TIMER_PRETRANSFER:
  168. data->progress.t_pretransfer =
  169. Curl_tvdiff_secs(now, data->progress.t_startsingle);
  170. break;
  171. case TIMER_STARTTRANSFER:
  172. data->progress.t_starttransfer =
  173. Curl_tvdiff_secs(now, data->progress.t_startsingle);
  174. break;
  175. case TIMER_POSTRANSFER:
  176. /* this is the normal end-of-transfer thing */
  177. break;
  178. case TIMER_REDIRECT:
  179. data->progress.t_redirect = Curl_tvdiff_secs(now, data->progress.start);
  180. break;
  181. }
  182. }
  183. void Curl_pgrsStartNow(struct Curl_easy *data)
  184. {
  185. data->progress.speeder_c = 0; /* reset the progress meter display */
  186. data->progress.start = Curl_tvnow();
  187. data->progress.ul_limit_start.tv_sec = 0;
  188. data->progress.ul_limit_start.tv_usec = 0;
  189. data->progress.dl_limit_start.tv_sec = 0;
  190. data->progress.dl_limit_start.tv_usec = 0;
  191. /* clear all bits except HIDE and HEADERS_OUT */
  192. data->progress.flags &= PGRS_HIDE|PGRS_HEADERS_OUT;
  193. }
  194. /*
  195. * This is used to handle speed limits, calculating how much milliseconds we
  196. * need to wait until we're back under the speed limit, if needed.
  197. *
  198. * The way it works is by having a "starting point" (time & amount of data
  199. * transfered by then) used in the speed computation, to be used instead of the
  200. * start of the transfer.
  201. * This starting point is regularly moved as transfer goes on, to keep getting
  202. * accurate values (instead of average over the entire tranfer).
  203. *
  204. * This function takes the current amount of data transfered, the amount at the
  205. * starting point, the limit (in bytes/s), the time of the starting point and
  206. * the current time.
  207. *
  208. * Returns -1 if no waiting is needed (not enough data transfered since
  209. * starting point yet), 0 when no waiting is needed but the starting point
  210. * should be reset (to current), or the number of milliseconds to wait to get
  211. * back under the speed limit.
  212. */
  213. long Curl_pgrsLimitWaitTime(curl_off_t cursize,
  214. curl_off_t startsize,
  215. curl_off_t limit,
  216. struct timeval start,
  217. struct timeval now)
  218. {
  219. curl_off_t size = cursize - startsize;
  220. time_t minimum;
  221. time_t actual;
  222. /* we don't have a starting point yet -- return 0 so it gets (re)set */
  223. if(start.tv_sec == 0 && start.tv_usec == 0)
  224. return 0;
  225. /* not enough data yet */
  226. if(size < limit)
  227. return -1;
  228. minimum = (time_t) (CURL_OFF_T_C(1000) * size / limit);
  229. actual = Curl_tvdiff(now, start);
  230. if(actual < minimum)
  231. /* this is a conversion on some systems (64bit time_t => 32bit long) */
  232. return (long)(minimum - actual);
  233. else
  234. return 0;
  235. }
  236. void Curl_pgrsSetDownloadCounter(struct Curl_easy *data, curl_off_t size)
  237. {
  238. struct timeval now = Curl_tvnow();
  239. data->progress.downloaded = size;
  240. /* download speed limit */
  241. if((data->set.max_recv_speed > 0) &&
  242. (Curl_pgrsLimitWaitTime(data->progress.downloaded,
  243. data->progress.dl_limit_size,
  244. data->set.max_recv_speed,
  245. data->progress.dl_limit_start,
  246. now) == 0)) {
  247. data->progress.dl_limit_start = now;
  248. data->progress.dl_limit_size = size;
  249. }
  250. }
  251. void Curl_pgrsSetUploadCounter(struct Curl_easy *data, curl_off_t size)
  252. {
  253. struct timeval now = Curl_tvnow();
  254. data->progress.uploaded = size;
  255. /* upload speed limit */
  256. if((data->set.max_send_speed > 0) &&
  257. (Curl_pgrsLimitWaitTime(data->progress.uploaded,
  258. data->progress.ul_limit_size,
  259. data->set.max_send_speed,
  260. data->progress.ul_limit_start,
  261. now) == 0)) {
  262. data->progress.ul_limit_start = now;
  263. data->progress.ul_limit_size = size;
  264. }
  265. }
  266. void Curl_pgrsSetDownloadSize(struct Curl_easy *data, curl_off_t size)
  267. {
  268. if(size >= 0) {
  269. data->progress.size_dl = size;
  270. data->progress.flags |= PGRS_DL_SIZE_KNOWN;
  271. }
  272. else {
  273. data->progress.size_dl = 0;
  274. data->progress.flags &= ~PGRS_DL_SIZE_KNOWN;
  275. }
  276. }
  277. void Curl_pgrsSetUploadSize(struct Curl_easy *data, curl_off_t size)
  278. {
  279. if(size >= 0) {
  280. data->progress.size_ul = size;
  281. data->progress.flags |= PGRS_UL_SIZE_KNOWN;
  282. }
  283. else {
  284. data->progress.size_ul = 0;
  285. data->progress.flags &= ~PGRS_UL_SIZE_KNOWN;
  286. }
  287. }
  288. /*
  289. * Curl_pgrsUpdate() returns 0 for success or the value returned by the
  290. * progress callback!
  291. */
  292. int Curl_pgrsUpdate(struct connectdata *conn)
  293. {
  294. struct timeval now;
  295. int result;
  296. char max5[6][10];
  297. curl_off_t dlpercen=0;
  298. curl_off_t ulpercen=0;
  299. curl_off_t total_percen=0;
  300. curl_off_t total_transfer;
  301. curl_off_t total_expected_transfer;
  302. curl_off_t timespent;
  303. struct Curl_easy *data = conn->data;
  304. int nowindex = data->progress.speeder_c% CURR_TIME;
  305. int checkindex;
  306. int countindex; /* amount of seconds stored in the speeder array */
  307. char time_left[10];
  308. char time_total[10];
  309. char time_spent[10];
  310. curl_off_t ulestimate=0;
  311. curl_off_t dlestimate=0;
  312. curl_off_t total_estimate;
  313. bool shownow=FALSE;
  314. now = Curl_tvnow(); /* what time is it */
  315. /* The time spent so far (from the start) */
  316. data->progress.timespent = curlx_tvdiff_secs(now, data->progress.start);
  317. timespent = (curl_off_t)data->progress.timespent;
  318. /* The average download speed this far */
  319. data->progress.dlspeed = (curl_off_t)
  320. ((double)data->progress.downloaded/
  321. (data->progress.timespent>0?data->progress.timespent:1));
  322. /* The average upload speed this far */
  323. data->progress.ulspeed = (curl_off_t)
  324. ((double)data->progress.uploaded/
  325. (data->progress.timespent>0?data->progress.timespent:1));
  326. /* Calculations done at most once a second, unless end is reached */
  327. if(data->progress.lastshow != now.tv_sec) {
  328. shownow = TRUE;
  329. data->progress.lastshow = now.tv_sec;
  330. /* Let's do the "current speed" thing, which should use the fastest
  331. of the dl/ul speeds. Store the faster speed at entry 'nowindex'. */
  332. data->progress.speeder[ nowindex ] =
  333. data->progress.downloaded>data->progress.uploaded?
  334. data->progress.downloaded:data->progress.uploaded;
  335. /* remember the exact time for this moment */
  336. data->progress.speeder_time [ nowindex ] = now;
  337. /* advance our speeder_c counter, which is increased every time we get
  338. here and we expect it to never wrap as 2^32 is a lot of seconds! */
  339. data->progress.speeder_c++;
  340. /* figure out how many index entries of data we have stored in our speeder
  341. array. With N_ENTRIES filled in, we have about N_ENTRIES-1 seconds of
  342. transfer. Imagine, after one second we have filled in two entries,
  343. after two seconds we've filled in three entries etc. */
  344. countindex = ((data->progress.speeder_c>=CURR_TIME)?
  345. CURR_TIME:data->progress.speeder_c) - 1;
  346. /* first of all, we don't do this if there's no counted seconds yet */
  347. if(countindex) {
  348. time_t span_ms;
  349. /* Get the index position to compare with the 'nowindex' position.
  350. Get the oldest entry possible. While we have less than CURR_TIME
  351. entries, the first entry will remain the oldest. */
  352. checkindex = (data->progress.speeder_c>=CURR_TIME)?
  353. data->progress.speeder_c%CURR_TIME:0;
  354. /* Figure out the exact time for the time span */
  355. span_ms = Curl_tvdiff(now,
  356. data->progress.speeder_time[checkindex]);
  357. if(0 == span_ms)
  358. span_ms=1; /* at least one millisecond MUST have passed */
  359. /* Calculate the average speed the last 'span_ms' milliseconds */
  360. {
  361. curl_off_t amount = data->progress.speeder[nowindex]-
  362. data->progress.speeder[checkindex];
  363. if(amount > CURL_OFF_T_C(4294967) /* 0xffffffff/1000 */)
  364. /* the 'amount' value is bigger than would fit in 32 bits if
  365. multiplied with 1000, so we use the double math for this */
  366. data->progress.current_speed = (curl_off_t)
  367. ((double)amount/((double)span_ms/1000.0));
  368. else
  369. /* the 'amount' value is small enough to fit within 32 bits even
  370. when multiplied with 1000 */
  371. data->progress.current_speed = amount*CURL_OFF_T_C(1000)/span_ms;
  372. }
  373. }
  374. else
  375. /* the first second we use the main average */
  376. data->progress.current_speed =
  377. (data->progress.ulspeed>data->progress.dlspeed)?
  378. data->progress.ulspeed:data->progress.dlspeed;
  379. } /* Calculations end */
  380. if(!(data->progress.flags & PGRS_HIDE)) {
  381. /* progress meter has not been shut off */
  382. if(data->set.fxferinfo) {
  383. /* There's a callback set, call that */
  384. result= data->set.fxferinfo(data->set.progress_client,
  385. data->progress.size_dl,
  386. data->progress.downloaded,
  387. data->progress.size_ul,
  388. data->progress.uploaded);
  389. if(result)
  390. failf(data, "Callback aborted");
  391. return result;
  392. }
  393. else if(data->set.fprogress) {
  394. /* The older deprecated callback is set, call that */
  395. result= data->set.fprogress(data->set.progress_client,
  396. (double)data->progress.size_dl,
  397. (double)data->progress.downloaded,
  398. (double)data->progress.size_ul,
  399. (double)data->progress.uploaded);
  400. if(result)
  401. failf(data, "Callback aborted");
  402. return result;
  403. }
  404. if(!shownow)
  405. /* only show the internal progress meter once per second */
  406. return 0;
  407. /* If there's no external callback set, use internal code to show
  408. progress */
  409. if(!(data->progress.flags & PGRS_HEADERS_OUT)) {
  410. if(data->state.resume_from) {
  411. fprintf(data->set.err,
  412. "** Resuming transfer from byte position %"
  413. CURL_FORMAT_CURL_OFF_T "\n", data->state.resume_from);
  414. }
  415. fprintf(data->set.err,
  416. " %% Total %% Received %% Xferd Average Speed "
  417. "Time Time Time Current\n"
  418. " Dload Upload "
  419. "Total Spent Left Speed\n");
  420. data->progress.flags |= PGRS_HEADERS_OUT; /* headers are shown */
  421. }
  422. /* Figure out the estimated time of arrival for the upload */
  423. if((data->progress.flags & PGRS_UL_SIZE_KNOWN) &&
  424. (data->progress.ulspeed > CURL_OFF_T_C(0))) {
  425. ulestimate = data->progress.size_ul / data->progress.ulspeed;
  426. if(data->progress.size_ul > CURL_OFF_T_C(10000))
  427. ulpercen = data->progress.uploaded /
  428. (data->progress.size_ul/CURL_OFF_T_C(100));
  429. else if(data->progress.size_ul > CURL_OFF_T_C(0))
  430. ulpercen = (data->progress.uploaded*100) /
  431. data->progress.size_ul;
  432. }
  433. /* ... and the download */
  434. if((data->progress.flags & PGRS_DL_SIZE_KNOWN) &&
  435. (data->progress.dlspeed > CURL_OFF_T_C(0))) {
  436. dlestimate = data->progress.size_dl / data->progress.dlspeed;
  437. if(data->progress.size_dl > CURL_OFF_T_C(10000))
  438. dlpercen = data->progress.downloaded /
  439. (data->progress.size_dl/CURL_OFF_T_C(100));
  440. else if(data->progress.size_dl > CURL_OFF_T_C(0))
  441. dlpercen = (data->progress.downloaded*100) /
  442. data->progress.size_dl;
  443. }
  444. /* Now figure out which of them is slower and use that one for the
  445. total estimate! */
  446. total_estimate = ulestimate>dlestimate?ulestimate:dlestimate;
  447. /* create the three time strings */
  448. time2str(time_left, total_estimate > 0?(total_estimate - timespent):0);
  449. time2str(time_total, total_estimate);
  450. time2str(time_spent, timespent);
  451. /* Get the total amount of data expected to get transferred */
  452. total_expected_transfer =
  453. (data->progress.flags & PGRS_UL_SIZE_KNOWN?
  454. data->progress.size_ul:data->progress.uploaded)+
  455. (data->progress.flags & PGRS_DL_SIZE_KNOWN?
  456. data->progress.size_dl:data->progress.downloaded);
  457. /* We have transferred this much so far */
  458. total_transfer = data->progress.downloaded + data->progress.uploaded;
  459. /* Get the percentage of data transferred so far */
  460. if(total_expected_transfer > CURL_OFF_T_C(10000))
  461. total_percen = total_transfer /
  462. (total_expected_transfer/CURL_OFF_T_C(100));
  463. else if(total_expected_transfer > CURL_OFF_T_C(0))
  464. total_percen = (total_transfer*100) / total_expected_transfer;
  465. fprintf(data->set.err,
  466. "\r"
  467. "%3" CURL_FORMAT_CURL_OFF_T " %s "
  468. "%3" CURL_FORMAT_CURL_OFF_T " %s "
  469. "%3" CURL_FORMAT_CURL_OFF_T " %s %s %s %s %s %s %s",
  470. total_percen, /* 3 letters */ /* total % */
  471. max5data(total_expected_transfer, max5[2]), /* total size */
  472. dlpercen, /* 3 letters */ /* rcvd % */
  473. max5data(data->progress.downloaded, max5[0]), /* rcvd size */
  474. ulpercen, /* 3 letters */ /* xfer % */
  475. max5data(data->progress.uploaded, max5[1]), /* xfer size */
  476. max5data(data->progress.dlspeed, max5[3]), /* avrg dl speed */
  477. max5data(data->progress.ulspeed, max5[4]), /* avrg ul speed */
  478. time_total, /* 8 letters */ /* total time */
  479. time_spent, /* 8 letters */ /* time spent */
  480. time_left, /* 8 letters */ /* time left */
  481. max5data(data->progress.current_speed, max5[5]) /* current speed */
  482. );
  483. /* we flush the output stream to make it appear as soon as possible */
  484. fflush(data->set.err);
  485. } /* !(data->progress.flags & PGRS_HIDE) */
  486. return 0;
  487. }