Coverage Report

Created: 2026-01-09 07:14

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/curl/lib/progress.c
Line
Count
Source
1
/***************************************************************************
2
 *                                  _   _ ____  _
3
 *  Project                     ___| | | |  _ \| |
4
 *                             / __| | | | |_) | |
5
 *                            | (__| |_| |  _ <| |___
6
 *                             \___|\___/|_| \_\_____|
7
 *
8
 * Copyright (C) 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 "curl_setup.h"
25
26
#include "urldata.h"
27
#include "curl_trc.h"
28
#include "multiif.h"
29
#include "progress.h"
30
#include "transfer.h"
31
#include "curlx/strcopy.h"
32
33
/* check rate limits within this many recent milliseconds, at minimum. */
34
#define MIN_RATE_LIMIT_PERIOD 3000
35
36
#ifndef CURL_DISABLE_PROGRESS_METER
37
/* Provide a string that is 7 letters long (plus the zero byte).
38
39
   Unit test 1636.
40
*/
41
UNITTEST void time2str(char *r, size_t rsize, curl_off_t seconds);
42
UNITTEST void time2str(char *r, size_t rsize, curl_off_t seconds)
43
0
{
44
0
  curl_off_t h;
45
0
  if(seconds <= 0) {
46
0
    curlx_strcopy(r, rsize, "       ", 7);
47
0
    return;
48
0
  }
49
0
  h = seconds / 3600;
50
0
  if(h <= 99) {
51
0
    curl_off_t m = (seconds - (h * 3600)) / 60;
52
0
    if(h <= 9) {
53
0
      curl_off_t s = (seconds - (h * 3600)) - (m * 60);
54
0
      if(h)
55
0
        curl_msnprintf(r, rsize, "%" FMT_OFF_T ":%02" FMT_OFF_T ":"
56
0
                       "%02" FMT_OFF_T, h, m, s);
57
0
      else
58
0
        curl_msnprintf(r, rsize, "  %02" FMT_OFF_T ":%02" FMT_OFF_T, m, s);
59
0
    }
60
0
    else
61
0
      curl_msnprintf(r, rsize, "%" FMT_OFF_T "h %02" FMT_OFF_T "m", h, m);
62
0
  }
63
0
  else {
64
0
    curl_off_t d = seconds / 86400;
65
0
    h = (seconds - (d * 86400)) / 3600;
66
0
    if(d <= 99)
67
0
      curl_msnprintf(r, rsize, "%2" FMT_OFF_T "d %02" FMT_OFF_T "h", d, h);
68
0
    else if(d <= 999)
69
0
      curl_msnprintf(r, rsize, "%6" FMT_OFF_T "d", d);
70
0
    else { /* more than 999 days */
71
0
      curl_off_t m = d / 30;
72
0
      if(m <= 999)
73
0
        curl_msnprintf(r, rsize, "%6" FMT_OFF_T "m", m);
74
0
      else { /* more than 999 months */
75
0
        curl_off_t y = d / 365;
76
0
        if(y <= 99999)
77
0
          curl_msnprintf(r, rsize, "%6" FMT_OFF_T "y", y);
78
0
        else
79
0
          curlx_strcopy(r, rsize, ">99999y", 7);
80
0
      }
81
0
    }
82
0
  }
83
0
}
84
85
/* The point of this function would be to return a string of the input data,
86
   but never longer than 6 columns (+ one zero byte).
87
   Add suffix k, M, G when suitable...
88
89
   Unit test 1636
90
*/
91
UNITTEST char *max6out(curl_off_t bytes, char *max6, size_t mlen);
92
UNITTEST char *max6out(curl_off_t bytes, char *max6, size_t mlen)
93
0
{
94
  /* a signed 64-bit value is 8192 petabytes maximum, shown as
95
     8.0E (exabytes)*/
96
0
  if(bytes < 100000)
97
0
    curl_msnprintf(max6, mlen, "%6" CURL_FORMAT_CURL_OFF_T, bytes);
98
0
  else {
99
0
    const char unit[] = { 'k', 'M', 'G', 'T', 'P', 'E', 0 };
100
0
    int k = 0;
101
0
    curl_off_t nbytes;
102
0
    curl_off_t rest;
103
0
    do {
104
0
      nbytes = bytes / 1024;
105
0
      if(nbytes < 1000)
106
0
        break;
107
0
      bytes = nbytes;
108
0
      k++;
109
0
      DEBUGASSERT(unit[k]);
110
0
    } while(unit[k]);
111
0
    rest = bytes % 1024;
112
0
    if(nbytes <= 99)
113
      /* xx.yyU */
114
0
      curl_msnprintf(max6, mlen, "%2" CURL_FORMAT_CURL_OFF_T
115
0
                     ".%02" CURL_FORMAT_CURL_OFF_T "%c", nbytes,
116
0
                     rest * 100 / 1024, unit[k]);
117
0
    else
118
      /* xxx.yU */
119
0
      curl_msnprintf(max6, mlen, "%3" CURL_FORMAT_CURL_OFF_T
120
0
                     ".%" CURL_FORMAT_CURL_OFF_T "%c", nbytes,
121
0
                     rest * 10 / 1024, unit[k]);
122
0
  }
123
0
  return max6;
124
0
}
125
#endif
126
127
static void pgrs_speedinit(struct Curl_easy *data)
128
0
{
129
0
  memset(&data->state.keeps_speed, 0, sizeof(struct curltime));
130
0
}
131
132
/*
133
 * @unittest: 1606
134
 */
135
UNITTEST CURLcode pgrs_speedcheck(struct Curl_easy *data,
136
                                  const struct curltime *pnow)
137
0
{
138
0
  if(!data->set.low_speed_time || !data->set.low_speed_limit ||
139
0
     Curl_xfer_recv_is_paused(data) || Curl_xfer_send_is_paused(data))
140
    /* A paused transfer is not qualified for speed checks */
141
0
    return CURLE_OK;
142
143
0
  if(data->progress.current_speed >= 0) {
144
0
    if(data->progress.current_speed < data->set.low_speed_limit) {
145
0
      if(!data->state.keeps_speed.tv_sec)
146
        /* under the limit at this moment */
147
0
        data->state.keeps_speed = *pnow;
148
0
      else {
149
        /* how long has it been under the limit */
150
0
        timediff_t howlong =
151
0
          curlx_ptimediff_ms(pnow, &data->state.keeps_speed);
152
153
0
        if(howlong >= data->set.low_speed_time * 1000) {
154
          /* too long */
155
0
          failf(data,
156
0
                "Operation too slow. "
157
0
                "Less than %ld bytes/sec transferred the last %ld seconds",
158
0
                data->set.low_speed_limit,
159
0
                data->set.low_speed_time);
160
0
          return CURLE_OPERATION_TIMEDOUT;
161
0
        }
162
0
      }
163
0
    }
164
0
    else
165
      /* faster right now */
166
0
      data->state.keeps_speed.tv_sec = 0;
167
0
  }
168
169
  /* since low speed limit is enabled, set the expire timer to make this
170
     connection's speed get checked again in a second */
171
0
  Curl_expire(data, 1000, EXPIRE_SPEEDCHECK);
172
173
0
  return CURLE_OK;
174
0
}
175
176
const struct curltime *Curl_pgrs_now(struct Curl_easy *data)
177
0
{
178
0
  struct curltime *pnow = data->multi ?
179
0
                          &data->multi->now : &data->progress.now;
180
0
  curlx_pnow(pnow);
181
0
  return pnow;
182
0
}
183
184
/*
185
186
   New proposed interface, 9th of February 2000:
187
188
   pgrsStartNow() - sets start time
189
   pgrsSetDownloadSize(x) - known expected download size
190
   pgrsSetUploadSize(x) - known expected upload size
191
   pgrsSetDownloadCounter() - amount of data currently downloaded
192
   pgrsSetUploadCounter() - amount of data currently uploaded
193
   pgrsUpdate() - show progress
194
   pgrsDone() - transfer complete
195
196
*/
197
198
int Curl_pgrsDone(struct Curl_easy *data)
199
0
{
200
0
  int rc;
201
0
  data->progress.lastshow = 0;
202
0
  rc = Curl_pgrsUpdate(data); /* the final (forced) update */
203
0
  if(rc)
204
0
    return rc;
205
206
0
  if(!data->progress.hide && !data->progress.callback)
207
    /* only output if we do not use a progress callback and we are not
208
     * hidden */
209
0
    curl_mfprintf(data->set.err, "\n");
210
211
0
  return 0;
212
0
}
213
214
void Curl_pgrsReset(struct Curl_easy *data)
215
0
{
216
0
  Curl_pgrsSetUploadCounter(data, 0);
217
0
  data->progress.dl.cur_size = 0;
218
0
  Curl_pgrsSetUploadSize(data, -1);
219
0
  Curl_pgrsSetDownloadSize(data, -1);
220
0
  data->progress.speeder_c = 0; /* reset speed records */
221
0
  pgrs_speedinit(data);
222
0
}
223
224
/* reset the known transfer sizes */
225
void Curl_pgrsResetTransferSizes(struct Curl_easy *data)
226
0
{
227
0
  Curl_pgrsSetDownloadSize(data, -1);
228
0
  Curl_pgrsSetUploadSize(data, -1);
229
0
}
230
231
void Curl_pgrsRecvPause(struct Curl_easy *data, bool enable)
232
0
{
233
0
  if(!enable) {
234
0
    data->progress.speeder_c = 0; /* reset speed records */
235
0
    pgrs_speedinit(data); /* reset low speed measurements */
236
0
  }
237
0
}
238
239
void Curl_pgrsSendPause(struct Curl_easy *data, bool enable)
240
0
{
241
0
  if(!enable) {
242
0
    data->progress.speeder_c = 0; /* reset speed records */
243
0
    pgrs_speedinit(data); /* reset low speed measurements */
244
0
  }
245
0
}
246
247
/*
248
 *
249
 * Curl_pgrsTimeWas(). Store the timestamp time at the given label.
250
 */
251
void Curl_pgrsTimeWas(struct Curl_easy *data, timerid timer,
252
                      struct curltime timestamp)
253
0
{
254
0
  timediff_t *delta = NULL;
255
256
0
  switch(timer) {
257
0
  default:
258
0
  case TIMER_NONE:
259
    /* mistake filter */
260
0
    break;
261
0
  case TIMER_STARTOP:
262
    /* This is set at the start of a transfer */
263
0
    data->progress.t_startop = timestamp;
264
0
    data->progress.t_startqueue = timestamp;
265
0
    data->progress.t_postqueue = 0;
266
0
    break;
267
0
  case TIMER_STARTSINGLE:
268
    /* This is set at the start of each single transfer */
269
0
    data->progress.t_startsingle = timestamp;
270
0
    data->progress.is_t_startransfer_set = FALSE;
271
0
    break;
272
0
  case TIMER_POSTQUEUE:
273
    /* Queue time is accumulative from all involved redirects */
274
0
    data->progress.t_postqueue +=
275
0
      curlx_ptimediff_us(&timestamp, &data->progress.t_startqueue);
276
0
    break;
277
0
  case TIMER_STARTACCEPT:
278
0
    data->progress.t_acceptdata = timestamp;
279
0
    break;
280
0
  case TIMER_NAMELOOKUP:
281
0
    delta = &data->progress.t_nslookup;
282
0
    break;
283
0
  case TIMER_CONNECT:
284
0
    delta = &data->progress.t_connect;
285
0
    break;
286
0
  case TIMER_APPCONNECT:
287
0
    delta = &data->progress.t_appconnect;
288
0
    break;
289
0
  case TIMER_PRETRANSFER:
290
0
    delta = &data->progress.t_pretransfer;
291
0
    break;
292
0
  case TIMER_STARTTRANSFER:
293
0
    delta = &data->progress.t_starttransfer;
294
    /* prevent updating t_starttransfer unless:
295
     *   1) this is the first time we are setting t_starttransfer
296
     *   2) a redirect has occurred since the last time t_starttransfer was set
297
     * This prevents repeated invocations of the function from incorrectly
298
     * changing the t_starttransfer time.
299
     */
300
0
    if(data->progress.is_t_startransfer_set) {
301
0
      return;
302
0
    }
303
0
    else {
304
0
      data->progress.is_t_startransfer_set = TRUE;
305
0
      break;
306
0
    }
307
0
  case TIMER_POSTRANSFER:
308
0
    delta = &data->progress.t_posttransfer;
309
0
    break;
310
0
  case TIMER_REDIRECT:
311
0
    data->progress.t_redirect = curlx_ptimediff_us(&timestamp,
312
0
                                                   &data->progress.start);
313
0
    data->progress.t_startqueue = timestamp;
314
0
    break;
315
0
  }
316
0
  if(delta) {
317
0
    timediff_t us = curlx_ptimediff_us(&timestamp,
318
0
                                       &data->progress.t_startsingle);
319
0
    if(us < 1)
320
0
      us = 1; /* make sure at least one microsecond passed */
321
0
    *delta += us;
322
0
  }
323
0
}
324
325
/*
326
 *
327
 * Curl_pgrsTime(). Store the current time at the given label. This fetches a
328
 * fresh "now" and returns it.
329
 *
330
 * @unittest: 1399
331
 */
332
void Curl_pgrsTime(struct Curl_easy *data, timerid timer)
333
0
{
334
0
  Curl_pgrsTimeWas(data, timer, *Curl_pgrs_now(data));
335
0
}
336
337
void Curl_pgrsStartNow(struct Curl_easy *data)
338
0
{
339
0
  struct Progress *p = &data->progress;
340
341
0
  p->speeder_c = 0; /* reset the progress meter display */
342
0
  p->start = *Curl_pgrs_now(data);
343
0
  p->is_t_startransfer_set = FALSE;
344
0
  p->dl.cur_size = 0;
345
0
  p->ul.cur_size = 0;
346
  /* the sizes are unknown at start */
347
0
  p->dl_size_known = FALSE;
348
0
  p->ul_size_known = FALSE;
349
0
}
350
351
void Curl_pgrs_download_inc(struct Curl_easy *data, size_t delta)
352
0
{
353
0
  if(delta) {
354
0
    data->progress.dl.cur_size += delta;
355
0
    Curl_rlimit_drain(&data->progress.dl.rlimit, delta, Curl_pgrs_now(data));
356
0
  }
357
0
}
358
359
void Curl_pgrs_upload_inc(struct Curl_easy *data, size_t delta)
360
0
{
361
0
  if(delta) {
362
0
    data->progress.ul.cur_size += delta;
363
0
    Curl_rlimit_drain(&data->progress.ul.rlimit, delta, Curl_pgrs_now(data));
364
0
  }
365
0
}
366
367
/*
368
 * Set the number of uploaded bytes so far.
369
 */
370
void Curl_pgrsSetUploadCounter(struct Curl_easy *data, curl_off_t size)
371
0
{
372
0
  data->progress.ul.cur_size = size;
373
0
}
374
375
void Curl_pgrsSetDownloadSize(struct Curl_easy *data, curl_off_t size)
376
0
{
377
0
  if(size >= 0) {
378
0
    data->progress.dl.total_size = size;
379
0
    data->progress.dl_size_known = TRUE;
380
0
  }
381
0
  else {
382
0
    data->progress.dl.total_size = 0;
383
0
    data->progress.dl_size_known = FALSE;
384
0
  }
385
0
}
386
387
void Curl_pgrsSetUploadSize(struct Curl_easy *data, curl_off_t size)
388
0
{
389
0
  if(size >= 0) {
390
0
    data->progress.ul.total_size = size;
391
0
    data->progress.ul_size_known = TRUE;
392
0
  }
393
0
  else {
394
0
    data->progress.ul.total_size = 0;
395
0
    data->progress.ul_size_known = FALSE;
396
0
  }
397
0
}
398
399
void Curl_pgrsEarlyData(struct Curl_easy *data, curl_off_t sent)
400
0
{
401
0
  data->progress.earlydata_sent = sent;
402
0
}
403
404
/* returns the average speed in bytes / second */
405
static curl_off_t trspeed(curl_off_t size, /* number of bytes */
406
                          curl_off_t us)   /* microseconds */
407
0
{
408
0
  if(us < 1)
409
0
    return size * 1000000;
410
0
  else if(size < CURL_OFF_T_MAX / 1000000)
411
0
    return (size * 1000000) / us;
412
0
  else if(us >= 1000000)
413
0
    return size / (us / 1000000);
414
0
  else
415
0
    return CURL_OFF_T_MAX;
416
0
}
417
418
/* returns TRUE if it is time to show the progress meter */
419
static bool progress_calc(struct Curl_easy *data,
420
                          const struct curltime *pnow)
421
0
{
422
0
  struct Progress * const p = &data->progress;
423
0
  int i_next, i_oldest, i_latest;
424
0
  timediff_t duration_ms;
425
0
  curl_off_t amount;
426
427
  /* The time spent so far (from the start) in microseconds */
428
0
  p->timespent = curlx_ptimediff_us(pnow, &p->start);
429
0
  p->dl.speed = trspeed(p->dl.cur_size, p->timespent);
430
0
  p->ul.speed = trspeed(p->ul.cur_size, p->timespent);
431
432
0
  if(!p->speeder_c) { /* no previous record exists */
433
0
    p->speed_amount[0] = p->dl.cur_size + p->ul.cur_size;
434
0
    p->speed_time[0] = *pnow;
435
0
    p->speeder_c++;
436
    /* use the overall average at the start */
437
0
    p->current_speed = p->ul.speed + p->dl.speed;
438
0
    p->lastshow = pnow->tv_sec;
439
0
    return TRUE;
440
0
  }
441
  /* We have at least one record now. Where to put the next and
442
   * where is the latest one? */
443
0
  i_next = p->speeder_c % CURL_SPEED_RECORDS;
444
0
  i_latest = (i_next > 0) ? (i_next - 1) : (CURL_SPEED_RECORDS - 1);
445
446
  /* Make a new record only when some time has passed.
447
   * Too frequent calls otherwise ruin the history. */
448
0
  if(curlx_ptimediff_ms(pnow, &p->speed_time[i_latest]) >= 1000) {
449
0
    p->speeder_c++;
450
0
    i_latest = i_next;
451
0
    p->speed_amount[i_latest] = p->dl.cur_size + p->ul.cur_size;
452
0
    p->speed_time[i_latest] = *pnow;
453
0
  }
454
0
  else if(data->req.done) {
455
    /* When a transfer is done, and we did not have a current speed
456
     * already, update the last record. Otherwise, stay at the speed
457
     * we have. The last chunk of data, when rate limiting, would increase
458
     * reported speed since it no longer measures a full second. */
459
0
    if(!p->current_speed) {
460
0
      p->speed_amount[i_latest] = p->dl.cur_size + p->ul.cur_size;
461
0
      p->speed_time[i_latest] = *pnow;
462
0
    }
463
0
  }
464
0
  else {
465
    /* transfer ongoing, wait for more time to pass. */
466
0
    return FALSE;
467
0
  }
468
469
0
  i_oldest = (p->speeder_c < CURL_SPEED_RECORDS) ? 0 :
470
0
             ((i_latest + 1) % CURL_SPEED_RECORDS);
471
472
  /* How much we transferred between oldest and current records */
473
0
  amount = p->speed_amount[i_latest] - p->speed_amount[i_oldest];
474
  /* How long this took */
475
0
  duration_ms = curlx_ptimediff_ms(&p->speed_time[i_latest],
476
0
                                   &p->speed_time[i_oldest]);
477
0
  if(duration_ms <= 0)
478
0
    duration_ms = 1;
479
480
0
  if(amount > (CURL_OFF_T_MAX / 1000)) {
481
    /* the 'amount' value is bigger than would fit in 64 bits if
482
       multiplied with 1000, so we use the double math for this */
483
0
    p->current_speed =
484
0
      (curl_off_t)(((double)amount * 1000.0) / (double)duration_ms);
485
0
  }
486
0
  else {
487
    /* the 'amount' value is small enough to fit within 32 bits even
488
       when multiplied with 1000 */
489
0
    p->current_speed = amount * 1000 / duration_ms;
490
0
  }
491
492
0
  if((p->lastshow == pnow->tv_sec) && !data->req.done)
493
0
    return FALSE;
494
0
  p->lastshow = pnow->tv_sec;
495
0
  return TRUE;
496
0
}
497
498
#ifndef CURL_DISABLE_PROGRESS_METER
499
500
struct pgrs_estimate {
501
  curl_off_t secs;
502
  curl_off_t percent;
503
};
504
505
static curl_off_t pgrs_est_percent(curl_off_t total, curl_off_t cur)
506
0
{
507
0
  if(total > 10000)
508
0
    return cur / (total / 100);
509
0
  else if(total > 0)
510
0
    return (cur * 100) / total;
511
0
  return 0;
512
0
}
513
514
static void pgrs_estimates(struct pgrs_dir *d,
515
                           bool total_known,
516
                           struct pgrs_estimate *est)
517
0
{
518
0
  est->secs = 0;
519
0
  est->percent = 0;
520
0
  if(total_known && (d->speed > 0)) {
521
0
    est->secs = d->total_size / d->speed;
522
0
    est->percent = pgrs_est_percent(d->total_size, d->cur_size);
523
0
  }
524
0
}
525
526
static void progress_meter(struct Curl_easy *data)
527
0
{
528
0
  struct Progress *p = &data->progress;
529
0
  char max6[6][7];
530
0
  struct pgrs_estimate dl_estm;
531
0
  struct pgrs_estimate ul_estm;
532
0
  struct pgrs_estimate total_estm;
533
0
  curl_off_t total_cur_size;
534
0
  curl_off_t total_expected_size;
535
0
  curl_off_t dl_size;
536
0
  char time_left[8];
537
0
  char time_total[8];
538
0
  char time_spent[8];
539
0
  curl_off_t cur_secs = (curl_off_t)p->timespent / 1000000; /* seconds */
540
541
0
  if(!p->headers_out) {
542
0
    if(data->state.resume_from) {
543
0
      curl_mfprintf(data->set.err,
544
0
                    "** Resuming transfer from byte position %" FMT_OFF_T "\n",
545
0
                    data->state.resume_from);
546
0
    }
547
0
    curl_mfprintf(data->set.err,
548
0
                  "  %% Total    %% Received %% Xferd  Average Speed  "
549
0
                  "Time    Time    Time   Current\n"
550
0
                  "                                 Dload  Upload  "
551
0
                  "Total   Spent   Left   Speed\n");
552
0
    p->headers_out = TRUE; /* headers are shown */
553
0
  }
554
555
  /* Figure out the estimated time of arrival for upload and download */
556
0
  pgrs_estimates(&p->ul, (bool)p->ul_size_known, &ul_estm);
557
0
  pgrs_estimates(&p->dl, (bool)p->dl_size_known, &dl_estm);
558
559
  /* Since both happen at the same time, total expected duration is max. */
560
0
  total_estm.secs = CURLMAX(ul_estm.secs, dl_estm.secs);
561
  /* create the three time strings */
562
0
  time2str(time_left, sizeof(time_left),
563
0
           total_estm.secs > 0 ? (total_estm.secs - cur_secs) : 0);
564
0
  time2str(time_total, sizeof(time_total), total_estm.secs);
565
0
  time2str(time_spent, sizeof(time_spent), cur_secs);
566
567
  /* Get the total amount of data expected to get transferred */
568
0
  total_expected_size = p->ul_size_known ? p->ul.total_size : p->ul.cur_size;
569
570
0
  dl_size = p->dl_size_known ? p->dl.total_size : p->dl.cur_size;
571
572
  /* integer overflow check */
573
0
  if((CURL_OFF_T_MAX - total_expected_size) < dl_size)
574
0
    total_expected_size = CURL_OFF_T_MAX; /* capped */
575
0
  else
576
0
    total_expected_size += dl_size;
577
578
  /* We have transferred this much so far */
579
0
  total_cur_size = p->dl.cur_size + p->ul.cur_size;
580
581
  /* Get the percentage of data transferred so far */
582
0
  total_estm.percent = pgrs_est_percent(total_expected_size, total_cur_size);
583
584
0
  curl_mfprintf(data->set.err,
585
0
                "\r"
586
0
                "%3" FMT_OFF_T " %s "
587
0
                "%3" FMT_OFF_T " %s "
588
0
                "%3" FMT_OFF_T " %s %s %s %s %s %s %s",
589
0
                total_estm.percent, /* 3 letters */    /* total % */
590
0
                max6out(total_expected_size, max6[2],
591
0
                        sizeof(max6[2])),              /* total size */
592
0
                dl_estm.percent, /* 3 letters */       /* rcvd % */
593
0
                max6out(p->dl.cur_size, max6[0],
594
0
                        sizeof(max6[0])),              /* rcvd size */
595
0
                ul_estm.percent, /* 3 letters */       /* xfer % */
596
0
                max6out(p->ul.cur_size, max6[1],
597
0
                        sizeof(max6[1])),              /* xfer size */
598
0
                max6out(p->dl.speed, max6[3],
599
0
                        sizeof(max6[3])),              /* avrg dl speed */
600
0
                max6out(p->ul.speed, max6[4],
601
0
                        sizeof(max6[4])),              /* avrg ul speed */
602
0
                time_total,    /* 7 letters */         /* total time */
603
0
                time_spent,    /* 7 letters */         /* time spent */
604
0
                time_left,     /* 7 letters */         /* time left */
605
0
                max6out(p->current_speed, max6[5],
606
0
                        sizeof(max6[5]))               /* current speed */
607
0
    );
608
609
  /* we flush the output stream to make it appear as soon as possible */
610
0
  fflush(data->set.err);
611
0
}
612
#else
613
 /* progress bar disabled */
614
#define progress_meter(x) Curl_nop_stmt
615
#endif
616
617
/*
618
 * Curl_pgrsUpdate() returns 0 for success or the value returned by the
619
 * progress callback!
620
 */
621
static CURLcode pgrsupdate(struct Curl_easy *data, bool showprogress)
622
0
{
623
0
  if(!data->progress.hide) {
624
0
    if(data->set.fxferinfo) {
625
0
      int result;
626
      /* There is a callback set, call that */
627
0
      Curl_set_in_callback(data, TRUE);
628
0
      result = data->set.fxferinfo(data->set.progress_client,
629
0
                                   data->progress.dl.total_size,
630
0
                                   data->progress.dl.cur_size,
631
0
                                   data->progress.ul.total_size,
632
0
                                   data->progress.ul.cur_size);
633
0
      Curl_set_in_callback(data, FALSE);
634
0
      if(result != CURL_PROGRESSFUNC_CONTINUE) {
635
0
        if(result) {
636
0
          failf(data, "Callback aborted");
637
0
          return CURLE_ABORTED_BY_CALLBACK;
638
0
        }
639
0
        return CURLE_OK;
640
0
      }
641
0
    }
642
0
    else if(data->set.fprogress) {
643
0
      int result;
644
      /* The older deprecated callback is set, call that */
645
0
      Curl_set_in_callback(data, TRUE);
646
0
      result = data->set.fprogress(data->set.progress_client,
647
0
                                   (double)data->progress.dl.total_size,
648
0
                                   (double)data->progress.dl.cur_size,
649
0
                                   (double)data->progress.ul.total_size,
650
0
                                   (double)data->progress.ul.cur_size);
651
0
      Curl_set_in_callback(data, FALSE);
652
0
      if(result != CURL_PROGRESSFUNC_CONTINUE) {
653
0
        if(result) {
654
0
          failf(data, "Callback aborted");
655
0
          return CURLE_ABORTED_BY_CALLBACK;
656
0
        }
657
0
        return CURLE_OK;
658
0
      }
659
0
    }
660
661
0
    if(showprogress)
662
0
      progress_meter(data);
663
0
  }
664
665
0
  return CURLE_OK;
666
0
}
667
668
static CURLcode pgrs_update(struct Curl_easy *data,
669
                            const struct curltime *pnow)
670
0
{
671
0
  bool showprogress = progress_calc(data, pnow);
672
0
  return pgrsupdate(data, showprogress);
673
0
}
674
675
CURLcode Curl_pgrsUpdate(struct Curl_easy *data)
676
0
{
677
0
  return pgrs_update(data, Curl_pgrs_now(data));
678
0
}
679
680
CURLcode Curl_pgrsCheck(struct Curl_easy *data)
681
0
{
682
0
  CURLcode result;
683
684
0
  result = pgrs_update(data, Curl_pgrs_now(data));
685
0
  if(!result && !data->req.done)
686
0
    result = pgrs_speedcheck(data, Curl_pgrs_now(data));
687
0
  return result;
688
0
}
689
690
/*
691
 * Update all progress, do not do progress meter/callbacks.
692
 */
693
void Curl_pgrsUpdate_nometer(struct Curl_easy *data)
694
0
{
695
0
  (void)progress_calc(data, Curl_pgrs_now(data));
696
0
}