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