1 /***************************************************************************
2 * _ _ ____ _
3 * Project ___| | | | _ \| |
4 * / __| | | | |_) | |
5 * | (__| |_| | _ <| |___
6 * \___|\___/|_| \_\_____|
7 *
8 * Copyright (C) 1998 - 2020, 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.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
23 #include "curl_setup.h"
24
25 #include "urldata.h"
26 #include "sendf.h"
27 #include "multiif.h"
28 #include "progress.h"
29 #include "timeval.h"
30 #include "curl_printf.h"
31
32 /* check rate limits within this many recent milliseconds, at minimum. */
33 #define MIN_RATE_LIMIT_PERIOD 3000
34
35 #ifndef CURL_DISABLE_PROGRESS_METER
36 /* Provide a string that is 2 + 1 + 2 + 1 + 2 = 8 letters long (plus the zero
37 byte) */
time2str(char * r,curl_off_t seconds)38 static void time2str(char *r, curl_off_t seconds)
39 {
40 curl_off_t h;
41 if(seconds <= 0) {
42 strcpy(r, "--:--:--");
43 return;
44 }
45 h = seconds / CURL_OFF_T_C(3600);
46 if(h <= CURL_OFF_T_C(99)) {
47 curl_off_t m = (seconds - (h*CURL_OFF_T_C(3600))) / CURL_OFF_T_C(60);
48 curl_off_t s = (seconds - (h*CURL_OFF_T_C(3600))) - (m*CURL_OFF_T_C(60));
49 msnprintf(r, 9, "%2" CURL_FORMAT_CURL_OFF_T ":%02" CURL_FORMAT_CURL_OFF_T
50 ":%02" CURL_FORMAT_CURL_OFF_T, h, m, s);
51 }
52 else {
53 /* this equals to more than 99 hours, switch to a more suitable output
54 format to fit within the limits. */
55 curl_off_t d = seconds / CURL_OFF_T_C(86400);
56 h = (seconds - (d*CURL_OFF_T_C(86400))) / CURL_OFF_T_C(3600);
57 if(d <= CURL_OFF_T_C(999))
58 msnprintf(r, 9, "%3" CURL_FORMAT_CURL_OFF_T
59 "d %02" CURL_FORMAT_CURL_OFF_T "h", d, h);
60 else
61 msnprintf(r, 9, "%7" CURL_FORMAT_CURL_OFF_T "d", d);
62 }
63 }
64
65 /* The point of this function would be to return a string of the input data,
66 but never longer than 5 columns (+ one zero byte).
67 Add suffix k, M, G when suitable... */
max5data(curl_off_t bytes,char * max5)68 static char *max5data(curl_off_t bytes, char *max5)
69 {
70 #define ONE_KILOBYTE CURL_OFF_T_C(1024)
71 #define ONE_MEGABYTE (CURL_OFF_T_C(1024) * ONE_KILOBYTE)
72 #define ONE_GIGABYTE (CURL_OFF_T_C(1024) * ONE_MEGABYTE)
73 #define ONE_TERABYTE (CURL_OFF_T_C(1024) * ONE_GIGABYTE)
74 #define ONE_PETABYTE (CURL_OFF_T_C(1024) * ONE_TERABYTE)
75
76 if(bytes < CURL_OFF_T_C(100000))
77 msnprintf(max5, 6, "%5" CURL_FORMAT_CURL_OFF_T, bytes);
78
79 else if(bytes < CURL_OFF_T_C(10000) * ONE_KILOBYTE)
80 msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "k", bytes/ONE_KILOBYTE);
81
82 else if(bytes < CURL_OFF_T_C(100) * ONE_MEGABYTE)
83 /* 'XX.XM' is good as long as we're less than 100 megs */
84 msnprintf(max5, 6, "%2" CURL_FORMAT_CURL_OFF_T ".%0"
85 CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE,
86 (bytes%ONE_MEGABYTE) / (ONE_MEGABYTE/CURL_OFF_T_C(10)) );
87
88 #if (CURL_SIZEOF_CURL_OFF_T > 4)
89
90 else if(bytes < CURL_OFF_T_C(10000) * ONE_MEGABYTE)
91 /* 'XXXXM' is good until we're at 10000MB or above */
92 msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE);
93
94 else if(bytes < CURL_OFF_T_C(100) * ONE_GIGABYTE)
95 /* 10000 MB - 100 GB, we show it as XX.XG */
96 msnprintf(max5, 6, "%2" CURL_FORMAT_CURL_OFF_T ".%0"
97 CURL_FORMAT_CURL_OFF_T "G", bytes/ONE_GIGABYTE,
98 (bytes%ONE_GIGABYTE) / (ONE_GIGABYTE/CURL_OFF_T_C(10)) );
99
100 else if(bytes < CURL_OFF_T_C(10000) * ONE_GIGABYTE)
101 /* up to 10000GB, display without decimal: XXXXG */
102 msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "G", bytes/ONE_GIGABYTE);
103
104 else if(bytes < CURL_OFF_T_C(10000) * ONE_TERABYTE)
105 /* up to 10000TB, display without decimal: XXXXT */
106 msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "T", bytes/ONE_TERABYTE);
107
108 else
109 /* up to 10000PB, display without decimal: XXXXP */
110 msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "P", bytes/ONE_PETABYTE);
111
112 /* 16384 petabytes (16 exabytes) is the maximum a 64 bit unsigned number
113 can hold, but our data type is signed so 8192PB will be the maximum. */
114
115 #else
116
117 else
118 msnprintf(max5, 6, "%4" CURL_FORMAT_CURL_OFF_T "M", bytes/ONE_MEGABYTE);
119
120 #endif
121
122 return max5;
123 }
124 #endif
125
126 /*
127
128 New proposed interface, 9th of February 2000:
129
130 pgrsStartNow() - sets start time
131 pgrsSetDownloadSize(x) - known expected download size
132 pgrsSetUploadSize(x) - known expected upload size
133 pgrsSetDownloadCounter() - amount of data currently downloaded
134 pgrsSetUploadCounter() - amount of data currently uploaded
135 pgrsUpdate() - show progress
136 pgrsDone() - transfer complete
137
138 */
139
Curl_pgrsDone(struct connectdata * conn)140 int Curl_pgrsDone(struct connectdata *conn)
141 {
142 int rc;
143 struct Curl_easy *data = conn->data;
144 data->progress.lastshow = 0;
145 rc = Curl_pgrsUpdate(conn); /* the final (forced) update */
146 if(rc)
147 return rc;
148
149 if(!(data->progress.flags & PGRS_HIDE) &&
150 !data->progress.callback)
151 /* only output if we don't use a progress callback and we're not
152 * hidden */
153 fprintf(data->set.err, "\n");
154
155 data->progress.speeder_c = 0; /* reset the progress meter display */
156 return 0;
157 }
158
159 /* reset the known transfer sizes */
Curl_pgrsResetTransferSizes(struct Curl_easy * data)160 void Curl_pgrsResetTransferSizes(struct Curl_easy *data)
161 {
162 Curl_pgrsSetDownloadSize(data, -1);
163 Curl_pgrsSetUploadSize(data, -1);
164 }
165
166 /*
167 *
168 * Curl_pgrsTime(). Store the current time at the given label. This fetches a
169 * fresh "now" and returns it.
170 *
171 * @unittest: 1399
172 */
Curl_pgrsTime(struct Curl_easy * data,timerid timer)173 struct curltime Curl_pgrsTime(struct Curl_easy *data, timerid timer)
174 {
175 struct curltime now = Curl_now();
176 timediff_t *delta = NULL;
177
178 switch(timer) {
179 default:
180 case TIMER_NONE:
181 /* mistake filter */
182 break;
183 case TIMER_STARTOP:
184 /* This is set at the start of a transfer */
185 data->progress.t_startop = now;
186 break;
187 case TIMER_STARTSINGLE:
188 /* This is set at the start of each single fetch */
189 data->progress.t_startsingle = now;
190 data->progress.is_t_startransfer_set = false;
191 break;
192 case TIMER_STARTACCEPT:
193 data->progress.t_acceptdata = now;
194 break;
195 case TIMER_NAMELOOKUP:
196 delta = &data->progress.t_nslookup;
197 break;
198 case TIMER_CONNECT:
199 delta = &data->progress.t_connect;
200 break;
201 case TIMER_APPCONNECT:
202 delta = &data->progress.t_appconnect;
203 break;
204 case TIMER_PRETRANSFER:
205 delta = &data->progress.t_pretransfer;
206 break;
207 case TIMER_STARTTRANSFER:
208 delta = &data->progress.t_starttransfer;
209 /* prevent updating t_starttransfer unless:
210 * 1) this is the first time we're setting t_starttransfer
211 * 2) a redirect has occurred since the last time t_starttransfer was set
212 * This prevents repeated invocations of the function from incorrectly
213 * changing the t_starttransfer time.
214 */
215 if(data->progress.is_t_startransfer_set) {
216 return now;
217 }
218 else {
219 data->progress.is_t_startransfer_set = true;
220 break;
221 }
222 case TIMER_POSTRANSFER:
223 /* this is the normal end-of-transfer thing */
224 break;
225 case TIMER_REDIRECT:
226 data->progress.t_redirect = Curl_timediff_us(now, data->progress.start);
227 break;
228 }
229 if(delta) {
230 timediff_t us = Curl_timediff_us(now, data->progress.t_startsingle);
231 if(us < 1)
232 us = 1; /* make sure at least one microsecond passed */
233 *delta += us;
234 }
235 return now;
236 }
237
Curl_pgrsStartNow(struct Curl_easy * data)238 void Curl_pgrsStartNow(struct Curl_easy *data)
239 {
240 data->progress.speeder_c = 0; /* reset the progress meter display */
241 data->progress.start = Curl_now();
242 data->progress.is_t_startransfer_set = false;
243 data->progress.ul_limit_start.tv_sec = 0;
244 data->progress.ul_limit_start.tv_usec = 0;
245 data->progress.dl_limit_start.tv_sec = 0;
246 data->progress.dl_limit_start.tv_usec = 0;
247 data->progress.downloaded = 0;
248 data->progress.uploaded = 0;
249 /* clear all bits except HIDE and HEADERS_OUT */
250 data->progress.flags &= PGRS_HIDE|PGRS_HEADERS_OUT;
251 Curl_ratelimit(data, data->progress.start);
252 }
253
254 /*
255 * This is used to handle speed limits, calculating how many milliseconds to
256 * wait until we're back under the speed limit, if needed.
257 *
258 * The way it works is by having a "starting point" (time & amount of data
259 * transferred by then) used in the speed computation, to be used instead of
260 * the start of the transfer. This starting point is regularly moved as
261 * transfer goes on, to keep getting accurate values (instead of average over
262 * the entire transfer).
263 *
264 * This function takes the current amount of data transferred, the amount at
265 * the starting point, the limit (in bytes/s), the time of the starting point
266 * and the current time.
267 *
268 * Returns 0 if no waiting is needed or when no waiting is needed but the
269 * starting point should be reset (to current); or the number of milliseconds
270 * to wait to get back under the speed limit.
271 */
Curl_pgrsLimitWaitTime(curl_off_t cursize,curl_off_t startsize,curl_off_t limit,struct curltime start,struct curltime now)272 timediff_t Curl_pgrsLimitWaitTime(curl_off_t cursize,
273 curl_off_t startsize,
274 curl_off_t limit,
275 struct curltime start,
276 struct curltime now)
277 {
278 curl_off_t size = cursize - startsize;
279 timediff_t minimum;
280 timediff_t actual;
281
282 if(!limit || !size)
283 return 0;
284
285 /*
286 * 'minimum' is the number of milliseconds 'size' should take to download to
287 * stay below 'limit'.
288 */
289 if(size < CURL_OFF_T_MAX/1000)
290 minimum = (timediff_t) (CURL_OFF_T_C(1000) * size / limit);
291 else {
292 minimum = (timediff_t) (size / limit);
293 if(minimum < TIMEDIFF_T_MAX/1000)
294 minimum *= 1000;
295 else
296 minimum = TIMEDIFF_T_MAX;
297 }
298
299 /*
300 * 'actual' is the time in milliseconds it took to actually download the
301 * last 'size' bytes.
302 */
303 actual = Curl_timediff(now, start);
304 if(actual < minimum) {
305 /* if it downloaded the data faster than the limit, make it wait the
306 difference */
307 return (minimum - actual);
308 }
309
310 return 0;
311 }
312
313 /*
314 * Set the number of downloaded bytes so far.
315 */
Curl_pgrsSetDownloadCounter(struct Curl_easy * data,curl_off_t size)316 void Curl_pgrsSetDownloadCounter(struct Curl_easy *data, curl_off_t size)
317 {
318 data->progress.downloaded = size;
319 }
320
321 /*
322 * Update the timestamp and sizestamp to use for rate limit calculations.
323 */
Curl_ratelimit(struct Curl_easy * data,struct curltime now)324 void Curl_ratelimit(struct Curl_easy *data, struct curltime now)
325 {
326 /* don't set a new stamp unless the time since last update is long enough */
327 if(data->set.max_recv_speed > 0) {
328 if(Curl_timediff(now, data->progress.dl_limit_start) >=
329 MIN_RATE_LIMIT_PERIOD) {
330 data->progress.dl_limit_start = now;
331 data->progress.dl_limit_size = data->progress.downloaded;
332 }
333 }
334 if(data->set.max_send_speed > 0) {
335 if(Curl_timediff(now, data->progress.ul_limit_start) >=
336 MIN_RATE_LIMIT_PERIOD) {
337 data->progress.ul_limit_start = now;
338 data->progress.ul_limit_size = data->progress.uploaded;
339 }
340 }
341 }
342
343 /*
344 * Set the number of uploaded bytes so far.
345 */
Curl_pgrsSetUploadCounter(struct Curl_easy * data,curl_off_t size)346 void Curl_pgrsSetUploadCounter(struct Curl_easy *data, curl_off_t size)
347 {
348 data->progress.uploaded = size;
349 }
350
Curl_pgrsSetDownloadSize(struct Curl_easy * data,curl_off_t size)351 void Curl_pgrsSetDownloadSize(struct Curl_easy *data, curl_off_t size)
352 {
353 if(size >= 0) {
354 data->progress.size_dl = size;
355 data->progress.flags |= PGRS_DL_SIZE_KNOWN;
356 }
357 else {
358 data->progress.size_dl = 0;
359 data->progress.flags &= ~PGRS_DL_SIZE_KNOWN;
360 }
361 }
362
Curl_pgrsSetUploadSize(struct Curl_easy * data,curl_off_t size)363 void Curl_pgrsSetUploadSize(struct Curl_easy *data, curl_off_t size)
364 {
365 if(size >= 0) {
366 data->progress.size_ul = size;
367 data->progress.flags |= PGRS_UL_SIZE_KNOWN;
368 }
369 else {
370 data->progress.size_ul = 0;
371 data->progress.flags &= ~PGRS_UL_SIZE_KNOWN;
372 }
373 }
374
375 /* returns TRUE if it's time to show the progress meter */
progress_calc(struct connectdata * conn,struct curltime now)376 static bool progress_calc(struct connectdata *conn, struct curltime now)
377 {
378 curl_off_t timespent;
379 curl_off_t timespent_ms; /* milliseconds */
380 struct Curl_easy *data = conn->data;
381 curl_off_t dl = data->progress.downloaded;
382 curl_off_t ul = data->progress.uploaded;
383 bool timetoshow = FALSE;
384
385 /* The time spent so far (from the start) */
386 data->progress.timespent = Curl_timediff_us(now, data->progress.start);
387 timespent = (curl_off_t)data->progress.timespent/1000000; /* seconds */
388 timespent_ms = (curl_off_t)data->progress.timespent/1000; /* ms */
389
390 /* The average download speed this far */
391 if(dl < CURL_OFF_T_MAX/1000)
392 data->progress.dlspeed = (dl * 1000 / (timespent_ms>0?timespent_ms:1));
393 else
394 data->progress.dlspeed = (dl / (timespent>0?timespent:1));
395
396 /* The average upload speed this far */
397 if(ul < CURL_OFF_T_MAX/1000)
398 data->progress.ulspeed = (ul * 1000 / (timespent_ms>0?timespent_ms:1));
399 else
400 data->progress.ulspeed = (ul / (timespent>0?timespent:1));
401
402 /* Calculations done at most once a second, unless end is reached */
403 if(data->progress.lastshow != now.tv_sec) {
404 int countindex; /* amount of seconds stored in the speeder array */
405 int nowindex = data->progress.speeder_c% CURR_TIME;
406 data->progress.lastshow = now.tv_sec;
407 timetoshow = TRUE;
408
409 /* Let's do the "current speed" thing, with the dl + ul speeds
410 combined. Store the speed at entry 'nowindex'. */
411 data->progress.speeder[ nowindex ] =
412 data->progress.downloaded + data->progress.uploaded;
413
414 /* remember the exact time for this moment */
415 data->progress.speeder_time [ nowindex ] = now;
416
417 /* advance our speeder_c counter, which is increased every time we get
418 here and we expect it to never wrap as 2^32 is a lot of seconds! */
419 data->progress.speeder_c++;
420
421 /* figure out how many index entries of data we have stored in our speeder
422 array. With N_ENTRIES filled in, we have about N_ENTRIES-1 seconds of
423 transfer. Imagine, after one second we have filled in two entries,
424 after two seconds we've filled in three entries etc. */
425 countindex = ((data->progress.speeder_c >= CURR_TIME)?
426 CURR_TIME:data->progress.speeder_c) - 1;
427
428 /* first of all, we don't do this if there's no counted seconds yet */
429 if(countindex) {
430 int checkindex;
431 timediff_t span_ms;
432
433 /* Get the index position to compare with the 'nowindex' position.
434 Get the oldest entry possible. While we have less than CURR_TIME
435 entries, the first entry will remain the oldest. */
436 checkindex = (data->progress.speeder_c >= CURR_TIME)?
437 data->progress.speeder_c%CURR_TIME:0;
438
439 /* Figure out the exact time for the time span */
440 span_ms = Curl_timediff(now, data->progress.speeder_time[checkindex]);
441 if(0 == span_ms)
442 span_ms = 1; /* at least one millisecond MUST have passed */
443
444 /* Calculate the average speed the last 'span_ms' milliseconds */
445 {
446 curl_off_t amount = data->progress.speeder[nowindex]-
447 data->progress.speeder[checkindex];
448
449 if(amount > CURL_OFF_T_C(4294967) /* 0xffffffff/1000 */)
450 /* the 'amount' value is bigger than would fit in 32 bits if
451 multiplied with 1000, so we use the double math for this */
452 data->progress.current_speed = (curl_off_t)
453 ((double)amount/((double)span_ms/1000.0));
454 else
455 /* the 'amount' value is small enough to fit within 32 bits even
456 when multiplied with 1000 */
457 data->progress.current_speed = amount*CURL_OFF_T_C(1000)/span_ms;
458 }
459 }
460 else
461 /* the first second we use the average */
462 data->progress.current_speed =
463 data->progress.ulspeed + data->progress.dlspeed;
464
465 } /* Calculations end */
466 return timetoshow;
467 }
468
469 #ifndef CURL_DISABLE_PROGRESS_METER
progress_meter(struct connectdata * conn)470 static void progress_meter(struct connectdata *conn)
471 {
472 struct Curl_easy *data = conn->data;
473 char max5[6][10];
474 curl_off_t dlpercen = 0;
475 curl_off_t ulpercen = 0;
476 curl_off_t total_percen = 0;
477 curl_off_t total_transfer;
478 curl_off_t total_expected_transfer;
479 char time_left[10];
480 char time_total[10];
481 char time_spent[10];
482 curl_off_t ulestimate = 0;
483 curl_off_t dlestimate = 0;
484 curl_off_t total_estimate;
485 curl_off_t timespent =
486 (curl_off_t)data->progress.timespent/1000000; /* seconds */
487
488 if(!(data->progress.flags & PGRS_HEADERS_OUT)) {
489 if(data->state.resume_from) {
490 fprintf(data->set.err,
491 "** Resuming transfer from byte position %"
492 CURL_FORMAT_CURL_OFF_T "\n", data->state.resume_from);
493 }
494 fprintf(data->set.err,
495 " %% Total %% Received %% Xferd Average Speed "
496 "Time Time Time Current\n"
497 " Dload Upload "
498 "Total Spent Left Speed\n");
499 data->progress.flags |= PGRS_HEADERS_OUT; /* headers are shown */
500 }
501
502 /* Figure out the estimated time of arrival for the upload */
503 if((data->progress.flags & PGRS_UL_SIZE_KNOWN) &&
504 (data->progress.ulspeed > CURL_OFF_T_C(0))) {
505 ulestimate = data->progress.size_ul / data->progress.ulspeed;
506
507 if(data->progress.size_ul > CURL_OFF_T_C(10000))
508 ulpercen = data->progress.uploaded /
509 (data->progress.size_ul/CURL_OFF_T_C(100));
510 else if(data->progress.size_ul > CURL_OFF_T_C(0))
511 ulpercen = (data->progress.uploaded*100) /
512 data->progress.size_ul;
513 }
514
515 /* ... and the download */
516 if((data->progress.flags & PGRS_DL_SIZE_KNOWN) &&
517 (data->progress.dlspeed > CURL_OFF_T_C(0))) {
518 dlestimate = data->progress.size_dl / data->progress.dlspeed;
519
520 if(data->progress.size_dl > CURL_OFF_T_C(10000))
521 dlpercen = data->progress.downloaded /
522 (data->progress.size_dl/CURL_OFF_T_C(100));
523 else if(data->progress.size_dl > CURL_OFF_T_C(0))
524 dlpercen = (data->progress.downloaded*100) /
525 data->progress.size_dl;
526 }
527
528 /* Now figure out which of them is slower and use that one for the
529 total estimate! */
530 total_estimate = ulestimate>dlestimate?ulestimate:dlestimate;
531
532 /* create the three time strings */
533 time2str(time_left, total_estimate > 0?(total_estimate - timespent):0);
534 time2str(time_total, total_estimate);
535 time2str(time_spent, timespent);
536
537 /* Get the total amount of data expected to get transferred */
538 total_expected_transfer =
539 ((data->progress.flags & PGRS_UL_SIZE_KNOWN)?
540 data->progress.size_ul:data->progress.uploaded)+
541 ((data->progress.flags & PGRS_DL_SIZE_KNOWN)?
542 data->progress.size_dl:data->progress.downloaded);
543
544 /* We have transferred this much so far */
545 total_transfer = data->progress.downloaded + data->progress.uploaded;
546
547 /* Get the percentage of data transferred so far */
548 if(total_expected_transfer > CURL_OFF_T_C(10000))
549 total_percen = total_transfer /
550 (total_expected_transfer/CURL_OFF_T_C(100));
551 else if(total_expected_transfer > CURL_OFF_T_C(0))
552 total_percen = (total_transfer*100) / total_expected_transfer;
553
554 fprintf(data->set.err,
555 "\r"
556 "%3" CURL_FORMAT_CURL_OFF_T " %s "
557 "%3" CURL_FORMAT_CURL_OFF_T " %s "
558 "%3" CURL_FORMAT_CURL_OFF_T " %s %s %s %s %s %s %s",
559 total_percen, /* 3 letters */ /* total % */
560 max5data(total_expected_transfer, max5[2]), /* total size */
561 dlpercen, /* 3 letters */ /* rcvd % */
562 max5data(data->progress.downloaded, max5[0]), /* rcvd size */
563 ulpercen, /* 3 letters */ /* xfer % */
564 max5data(data->progress.uploaded, max5[1]), /* xfer size */
565 max5data(data->progress.dlspeed, max5[3]), /* avrg dl speed */
566 max5data(data->progress.ulspeed, max5[4]), /* avrg ul speed */
567 time_total, /* 8 letters */ /* total time */
568 time_spent, /* 8 letters */ /* time spent */
569 time_left, /* 8 letters */ /* time left */
570 max5data(data->progress.current_speed, max5[5])
571 );
572
573 /* we flush the output stream to make it appear as soon as possible */
574 fflush(data->set.err);
575 }
576 #else
577 /* progress bar disabled */
578 #define progress_meter(x) Curl_nop_stmt
579 #endif
580
581
582 /*
583 * Curl_pgrsUpdate() returns 0 for success or the value returned by the
584 * progress callback!
585 */
Curl_pgrsUpdate(struct connectdata * conn)586 int Curl_pgrsUpdate(struct connectdata *conn)
587 {
588 struct Curl_easy *data = conn->data;
589 struct curltime now = Curl_now(); /* what time is it */
590 bool showprogress = progress_calc(conn, now);
591 if(!(data->progress.flags & PGRS_HIDE)) {
592 if(data->set.fxferinfo) {
593 int result;
594 /* There's a callback set, call that */
595 Curl_set_in_callback(data, true);
596 result = data->set.fxferinfo(data->set.progress_client,
597 data->progress.size_dl,
598 data->progress.downloaded,
599 data->progress.size_ul,
600 data->progress.uploaded);
601 Curl_set_in_callback(data, false);
602 if(result != CURL_PROGRESSFUNC_CONTINUE) {
603 if(result)
604 failf(data, "Callback aborted");
605 return result;
606 }
607 }
608 else if(data->set.fprogress) {
609 int result;
610 /* The older deprecated callback is set, call that */
611 Curl_set_in_callback(data, true);
612 result = data->set.fprogress(data->set.progress_client,
613 (double)data->progress.size_dl,
614 (double)data->progress.downloaded,
615 (double)data->progress.size_ul,
616 (double)data->progress.uploaded);
617 Curl_set_in_callback(data, false);
618 if(result != CURL_PROGRESSFUNC_CONTINUE) {
619 if(result)
620 failf(data, "Callback aborted");
621 return result;
622 }
623 }
624
625 if(showprogress)
626 progress_meter(conn);
627 }
628
629 return 0;
630 }
631