eta: only pass real size of jobs_eta
[fio.git] / eta.c
CommitLineData
263e529f
JA
1/*
2 * Status and ETA code
3 */
4#include <unistd.h>
5#include <fcntl.h>
6#include <string.h>
7
8#include "fio.h"
263e529f 9
3e2e48a7 10static char __run_str[REAL_MAX_JOBS + 1];
11155857 11static char run_str[__THREAD_RUNSTR_SZ(REAL_MAX_JOBS)];
3e2e48a7
JA
12
13static void update_condensed_str(char *run_str, char *run_str_condensed)
14{
595d9e77
AG
15 if (*run_str) {
16 while (*run_str) {
17 int nr = 1;
18
19 *run_str_condensed++ = *run_str++;
20 while (*(run_str - 1) == *run_str) {
21 run_str++;
22 nr++;
23 }
24 run_str_condensed += sprintf(run_str_condensed, "(%u),", nr);
3e2e48a7 25 }
595d9e77 26 run_str_condensed--;
3e2e48a7 27 }
595d9e77 28 *run_str_condensed = '\0';
6c784104 29}
263e529f
JA
30
31/*
32 * Sets the status of the 'td' in the printed status map.
33 */
34static void check_str_update(struct thread_data *td)
35{
3e2e48a7 36 char c = __run_str[td->thread_number - 1];
263e529f
JA
37
38 switch (td->runstate) {
5ec10eaa 39 case TD_REAPED:
4f7e57a4
JA
40 if (td->error)
41 c = 'X';
a5e371a6
JA
42 else if (td->sig)
43 c = 'K';
4f7e57a4
JA
44 else
45 c = '_';
5ec10eaa
JA
46 break;
47 case TD_EXITED:
48 c = 'E';
49 break;
b29ee5b3
JA
50 case TD_RAMP:
51 c = '/';
52 break;
5ec10eaa
JA
53 case TD_RUNNING:
54 if (td_rw(td)) {
e3b3f81e
JA
55 if (td_random(td)) {
56 if (td->o.rwmix[DDIR_READ] == 100)
57 c = 'r';
58 else if (td->o.rwmix[DDIR_WRITE] == 100)
59 c = 'w';
60 else
61 c = 'm';
62 } else {
63 if (td->o.rwmix[DDIR_READ] == 100)
64 c = 'R';
65 else if (td->o.rwmix[DDIR_WRITE] == 100)
66 c = 'W';
67 else
68 c = 'M';
69 }
5ec10eaa
JA
70 } else if (td_read(td)) {
71 if (td_random(td))
72 c = 'r';
73 else
74 c = 'R';
6eaf09d6 75 } else if (td_write(td)) {
5ec10eaa
JA
76 if (td_random(td))
77 c = 'w';
78 else
79 c = 'W';
6eaf09d6
SL
80 } else {
81 if (td_random(td))
82 c = 'd';
83 else
84 c = 'D';
5ec10eaa
JA
85 }
86 break;
b0f65863
JA
87 case TD_PRE_READING:
88 c = 'p';
89 break;
5ec10eaa
JA
90 case TD_VERIFYING:
91 c = 'V';
92 break;
93 case TD_FSYNCING:
94 c = 'F';
95 break;
3d434057
JA
96 case TD_FINISHING:
97 c = 'f';
98 break;
5ec10eaa
JA
99 case TD_CREATED:
100 c = 'C';
101 break;
102 case TD_INITIALIZED:
9c6f6316 103 case TD_SETTING_UP:
5ec10eaa
JA
104 c = 'I';
105 break;
106 case TD_NOT_CREATED:
107 c = 'P';
108 break;
109 default:
110 log_err("state %d\n", td->runstate);
263e529f
JA
111 }
112
3e2e48a7
JA
113 __run_str[td->thread_number - 1] = c;
114 update_condensed_str(__run_str, run_str);
263e529f
JA
115}
116
117/*
118 * Convert seconds to a printable string.
119 */
3e47bd25 120void eta_to_str(char *str, unsigned long eta_sec)
263e529f
JA
121{
122 unsigned int d, h, m, s;
165faf16 123 int disp_hour = 0;
263e529f 124
263e529f
JA
125 s = eta_sec % 60;
126 eta_sec /= 60;
127 m = eta_sec % 60;
128 eta_sec /= 60;
129 h = eta_sec % 24;
130 eta_sec /= 24;
131 d = eta_sec;
132
165faf16
JA
133 if (d) {
134 disp_hour = 1;
1e97cce9 135 str += sprintf(str, "%02ud:", d);
263e529f 136 }
165faf16
JA
137
138 if (h || disp_hour)
1e97cce9 139 str += sprintf(str, "%02uh:", h);
263e529f 140
1e97cce9
JA
141 str += sprintf(str, "%02um:", m);
142 str += sprintf(str, "%02us", s);
263e529f
JA
143}
144
145/*
146 * Best effort calculation of the estimated pending runtime of a job.
147 */
b29ee5b3 148static int thread_eta(struct thread_data *td)
263e529f
JA
149{
150 unsigned long long bytes_total, bytes_done;
1e97cce9 151 unsigned long eta_sec = 0;
b29ee5b3 152 unsigned long elapsed;
0de5b26f 153 uint64_t timeout;
b29ee5b3
JA
154
155 elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
0de5b26f 156 timeout = td->o.timeout / 1000000UL;
263e529f
JA
157
158 bytes_total = td->total_io_size;
159
2e3bd4c2
JA
160 if (td->o.fill_device && td->o.size == -1ULL) {
161 if (!td->fill_device_size || td->fill_device_size == -1ULL)
162 return 0;
163
164 bytes_total = td->fill_device_size;
165 }
166
0d73a2f9
JA
167 if (td->o.zone_size && td->o.zone_skip && bytes_total) {
168 unsigned int nr_zones;
169 uint64_t zone_bytes;
170
171 zone_bytes = bytes_total + td->o.zone_size + td->o.zone_skip;
172 nr_zones = (zone_bytes - 1) / (td->o.zone_size + td->o.zone_skip);
173 bytes_total -= nr_zones * td->o.zone_skip;
174 }
175
74939e38 176 /*
165eb050
JA
177 * if writing and verifying afterwards, bytes_total will be twice the
178 * size. In a mixed workload, verify phase will be the size of the
179 * first stage writes.
74939e38 180 */
0dd8377f 181 if (td->o.do_verify && td->o.verify && td_write(td)) {
165eb050
JA
182 if (td_rw(td)) {
183 unsigned int perc = 50;
184
185 if (td->o.rwmix[DDIR_WRITE])
186 perc = td->o.rwmix[DDIR_WRITE];
187
188 bytes_total += (bytes_total * perc) / 100;
189 } else
74939e38
JA
190 bytes_total <<= 1;
191 }
192
263e529f 193 if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) {
cf4464ca 194 double perc, perc_t;
263e529f 195
342f4be4 196 bytes_done = ddir_rw_sum(td->io_bytes);
476882d7
JA
197
198 if (bytes_total) {
199 perc = (double) bytes_done / (double) bytes_total;
200 if (perc > 1.0)
201 perc = 1.0;
202 } else
203 perc = 0.0;
263e529f 204
cf4464ca 205 if (td->o.time_based) {
476882d7
JA
206 if (timeout) {
207 perc_t = (double) elapsed / (double) timeout;
208 if (perc_t < perc)
209 perc = perc_t;
210 } else {
211 /*
212 * Will never hit, we can't have time_based
213 * without a timeout set.
214 */
215 perc = 0.0;
216 }
cf4464ca
JA
217 }
218
1e97cce9 219 eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;
263e529f 220
d3eeeabc 221 if (td->o.timeout &&
0de5b26f
JA
222 eta_sec > (timeout + done_secs - elapsed))
223 eta_sec = timeout + done_secs - elapsed;
263e529f 224 } else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED
b29ee5b3 225 || td->runstate == TD_INITIALIZED
714e85f3 226 || td->runstate == TD_SETTING_UP
b0f65863
JA
227 || td->runstate == TD_RAMP
228 || td->runstate == TD_PRE_READING) {
263e529f 229 int t_eta = 0, r_eta = 0;
342f4be4 230 unsigned long long rate_bytes;
263e529f
JA
231
232 /*
233 * We can only guess - assume it'll run the full timeout
234 * if given, otherwise assume it'll run at the specified rate.
235 */
b29ee5b3 236 if (td->o.timeout) {
0de5b26f
JA
237 uint64_t timeout = td->o.timeout;
238 uint64_t start_delay = td->o.start_delay;
239 uint64_t ramp_time = td->o.ramp_time;
240
241 t_eta = timeout + start_delay + ramp_time;
242 t_eta /= 1000000ULL;
b29ee5b3
JA
243
244 if (in_ramp_time(td)) {
245 unsigned long ramp_left;
246
cda99fa0 247 ramp_left = mtime_since_now(&td->epoch);
b29ee5b3
JA
248 ramp_left = (ramp_left + 999) / 1000;
249 if (ramp_left <= t_eta)
250 t_eta -= ramp_left;
251 }
252 }
342f4be4
JA
253 rate_bytes = ddir_rw_sum(td->o.rate);
254 if (rate_bytes) {
255 r_eta = (bytes_total / 1024) / rate_bytes;
0de5b26f 256 r_eta += (td->o.start_delay / 1000000ULL);
263e529f
JA
257 }
258
259 if (r_eta && t_eta)
260 eta_sec = min(r_eta, t_eta);
261 else if (r_eta)
262 eta_sec = r_eta;
263 else if (t_eta)
264 eta_sec = t_eta;
265 else
266 eta_sec = 0;
267 } else {
268 /*
269 * thread is already done or waiting for fsync
270 */
271 eta_sec = 0;
272 }
273
274 return eta_sec;
275}
276
771e58be
JA
277static void calc_rate(int unified_rw_rep, unsigned long mtime,
278 unsigned long long *io_bytes,
46fda8d0
JA
279 unsigned long long *prev_io_bytes, unsigned int *rate)
280{
b7f05eb0
JA
281 int i;
282
6eaf09d6 283 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
b7f05eb0
JA
284 unsigned long long diff;
285
286 diff = io_bytes[i] - prev_io_bytes[i];
771e58be
JA
287 if (unified_rw_rep) {
288 rate[i] = 0;
289 rate[0] += ((1000 * diff) / mtime) / 1024;
290 } else
291 rate[i] = ((1000 * diff) / mtime) / 1024;
6eaf09d6
SL
292
293 prev_io_bytes[i] = io_bytes[i];
b7f05eb0 294 }
46fda8d0 295}
5ec10eaa 296
771e58be
JA
297static void calc_iops(int unified_rw_rep, unsigned long mtime,
298 unsigned long long *io_iops,
adb02ba8
JA
299 unsigned long long *prev_io_iops, unsigned int *iops)
300{
6eaf09d6
SL
301 int i;
302
303 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
771e58be
JA
304 unsigned long long diff;
305
306 diff = io_iops[i] - prev_io_iops[i];
307 if (unified_rw_rep) {
308 iops[i] = 0;
309 iops[0] += (diff * 1000) / mtime;
310 } else
311 iops[i] = (diff * 1000) / mtime;
312
6eaf09d6
SL
313 prev_io_iops[i] = io_iops[i];
314 }
adb02ba8
JA
315}
316
263e529f
JA
317/*
318 * Print status of the jobs we know about. This includes rate estimates,
319 * ETA, thread state, etc.
320 */
af9c9fb3 321int calc_thread_status(struct jobs_eta *je, int force)
263e529f 322{
34572e28 323 struct thread_data *td;
771e58be 324 int i, unified_rw_rep;
b75a394f 325 unsigned long rate_time, disp_time, bw_avg_time, *eta_secs;
6eaf09d6
SL
326 unsigned long long io_bytes[DDIR_RWDIR_CNT];
327 unsigned long long io_iops[DDIR_RWDIR_CNT];
46fda8d0
JA
328 struct timeval now;
329
6eaf09d6
SL
330 static unsigned long long rate_io_bytes[DDIR_RWDIR_CNT];
331 static unsigned long long disp_io_bytes[DDIR_RWDIR_CNT];
332 static unsigned long long disp_io_iops[DDIR_RWDIR_CNT];
46fda8d0 333 static struct timeval rate_prev_time, disp_prev_time;
6043c579 334
af9c9fb3 335 if (!force) {
fc47559b
JA
336 if (output_format != FIO_OUTPUT_NORMAL &&
337 f_out == stdout)
f3afa57e
JA
338 return 0;
339 if (temp_stall_ts || eta_print == FIO_ETA_NEVER)
af9c9fb3 340 return 0;
e592a06b 341
af9c9fb3
JA
342 if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
343 return 0;
344 }
263e529f 345
342f4be4 346 if (!ddir_rw_sum(rate_io_bytes))
46fda8d0 347 fill_start_time(&rate_prev_time);
342f4be4 348 if (!ddir_rw_sum(disp_io_bytes))
46fda8d0 349 fill_start_time(&disp_prev_time);
6043c579 350
d3eeeabc
JA
351 eta_secs = malloc(thread_number * sizeof(unsigned long));
352 memset(eta_secs, 0, thread_number * sizeof(unsigned long));
263e529f 353
b75a394f
JA
354 je->elapsed_sec = (mtime_since_genesis() + 999) / 1000;
355
6eaf09d6
SL
356 io_bytes[DDIR_READ] = io_bytes[DDIR_WRITE] = io_bytes[DDIR_TRIM] = 0;
357 io_iops[DDIR_READ] = io_iops[DDIR_WRITE] = io_iops[DDIR_TRIM] = 0;
bb3884d8 358 bw_avg_time = ULONG_MAX;
771e58be 359 unified_rw_rep = 0;
34572e28 360 for_each_td(td, i) {
771e58be 361 unified_rw_rep += td->o.unified_rw_rep;
b7f05eb0
JA
362 if (is_power_of_2(td->o.kb_base))
363 je->is_pow2 = 1;
ad705bcb 364 je->unit_base = td->o.unit_base;
2dc1bbeb
JA
365 if (td->o.bw_avg_time < bw_avg_time)
366 bw_avg_time = td->o.bw_avg_time;
46fda8d0 367 if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING
b0f65863 368 || td->runstate == TD_FSYNCING
3d434057
JA
369 || td->runstate == TD_PRE_READING
370 || td->runstate == TD_FINISHING) {
b75a394f 371 je->nr_running++;
242c38db 372 if (td_read(td)) {
c2e9cc4d
JA
373 je->t_rate[0] += td->o.rate[DDIR_READ];
374 je->t_iops[0] += td->o.rate_iops[DDIR_READ];
375 je->m_rate[0] += td->o.ratemin[DDIR_READ];
376 je->m_iops[0] += td->o.rate_iops_min[DDIR_READ];
242c38db
JA
377 }
378 if (td_write(td)) {
c2e9cc4d
JA
379 je->t_rate[1] += td->o.rate[DDIR_WRITE];
380 je->t_iops[1] += td->o.rate_iops[DDIR_WRITE];
381 je->m_rate[1] += td->o.ratemin[DDIR_WRITE];
382 je->m_iops[1] += td->o.rate_iops_min[DDIR_WRITE];
242c38db 383 }
6eaf09d6 384 if (td_trim(td)) {
d79db122
JA
385 je->t_rate[2] += td->o.rate[DDIR_TRIM];
386 je->t_iops[2] += td->o.rate_iops[DDIR_TRIM];
387 je->m_rate[2] += td->o.ratemin[DDIR_TRIM];
388 je->m_iops[2] += td->o.rate_iops_min[DDIR_TRIM];
6eaf09d6
SL
389 }
390
b75a394f 391 je->files_open += td->nr_open_files;
b29ee5b3 392 } else if (td->runstate == TD_RAMP) {
b75a394f
JA
393 je->nr_running++;
394 je->nr_ramp++;
714e85f3 395 } else if (td->runstate == TD_SETTING_UP) {
9c6f6316 396 je->nr_running++;
714e85f3
JA
397 je->nr_setting_up++;
398 } else if (td->runstate < TD_RUNNING)
b75a394f 399 je->nr_pending++;
263e529f 400
b75a394f 401 if (je->elapsed_sec >= 3)
b29ee5b3 402 eta_secs[i] = thread_eta(td);
263e529f
JA
403 else
404 eta_secs[i] = INT_MAX;
405
406 check_str_update(td);
b29ee5b3 407
714e85f3 408 if (td->runstate > TD_SETTING_UP) {
6eaf09d6 409 int ddir;
771e58be 410
6eaf09d6 411 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
771e58be
JA
412 if (unified_rw_rep) {
413 io_bytes[0] += td->io_bytes[ddir];
414 io_iops[0] += td->io_blocks[ddir];
415 } else {
416 io_bytes[ddir] += td->io_bytes[ddir];
417 io_iops[ddir] += td->io_blocks[ddir];
418 }
6eaf09d6 419 }
b29ee5b3 420 }
263e529f
JA
421 }
422
423 if (exitall_on_terminate)
b75a394f 424 je->eta_sec = INT_MAX;
263e529f 425 else
b75a394f 426 je->eta_sec = 0;
263e529f 427
34572e28 428 for_each_td(td, i) {
9c5a3854 429 if (exitall_on_terminate) {
b75a394f
JA
430 if (eta_secs[i] < je->eta_sec)
431 je->eta_sec = eta_secs[i];
9c5a3854 432 } else {
b75a394f
JA
433 if (eta_secs[i] > je->eta_sec)
434 je->eta_sec = eta_secs[i];
9c5a3854 435 }
263e529f
JA
436 }
437
eecf272f
JA
438 free(eta_secs);
439
46fda8d0
JA
440 fio_gettime(&now, NULL);
441 rate_time = mtime_since(&rate_prev_time, &now);
442
b29ee5b3 443 if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
771e58be
JA
444 calc_rate(unified_rw_rep, rate_time, io_bytes, rate_io_bytes,
445 je->rate);
46fda8d0 446 memcpy(&rate_prev_time, &now, sizeof(now));
b75a394f
JA
447 add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0);
448 add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0);
6eaf09d6 449 add_agg_sample(je->rate[DDIR_TRIM], DDIR_TRIM, 0);
6043c579
JA
450 }
451
46fda8d0 452 disp_time = mtime_since(&disp_prev_time, &now);
a5b01f1b
JA
453
454 /*
455 * Allow a little slack, the target is to print it every 1000 msecs
456 */
af9c9fb3 457 if (!force && disp_time < 900)
b75a394f 458 return 0;
46fda8d0 459
771e58be
JA
460 calc_rate(unified_rw_rep, disp_time, io_bytes, disp_io_bytes, je->rate);
461 calc_iops(unified_rw_rep, disp_time, io_iops, disp_io_iops, je->iops);
adb02ba8 462
46fda8d0
JA
463 memcpy(&disp_prev_time, &now, sizeof(now));
464
af9c9fb3 465 if (!force && !je->nr_running && !je->nr_pending)
b75a394f
JA
466 return 0;
467
1d1f45ae 468 je->nr_threads = thread_number;
6c784104
JA
469 update_condensed_str(__run_str, run_str);
470 memcpy(je->run_str, run_str, strlen(run_str));
b75a394f
JA
471 return 1;
472}
473
cf451d1e 474void display_thread_status(struct jobs_eta *je)
b75a394f 475{
e382e661
JA
476 static struct timeval disp_eta_new_line;
477 static int eta_new_line_init, eta_new_line_pending;
b75a394f
JA
478 static int linelen_last;
479 static int eta_good;
79074e7c 480 char output[REAL_MAX_JOBS + 512], *p = output;
b75a394f
JA
481 char eta_str[128];
482 double perc = 0.0;
b75a394f 483
cf451d1e
JA
484 if (je->eta_sec != INT_MAX && je->elapsed_sec) {
485 perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec);
486 eta_to_str(eta_str, je->eta_sec);
b75a394f
JA
487 }
488
e382e661
JA
489 if (eta_new_line_pending) {
490 eta_new_line_pending = 0;
491 p += sprintf(p, "\n");
492 }
493
cf451d1e 494 p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open);
3e47bd25 495 if (je->m_rate[0] || je->m_rate[1] || je->t_rate[0] || je->t_rate[1]) {
581e7141
JA
496 char *tr, *mr;
497
22f80458
JA
498 mr = num2str(je->m_rate[0] + je->m_rate[1], 4, 0, je->is_pow2, 8);
499 tr = num2str(je->t_rate[0] + je->t_rate[1], 4, 0, je->is_pow2, 8);
37db14fe 500 p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
581e7141
JA
501 free(tr);
502 free(mr);
3e47bd25
JA
503 } else if (je->m_iops[0] || je->m_iops[1] || je->t_iops[0] || je->t_iops[1]) {
504 p += sprintf(p, ", CR=%d/%d IOPS",
505 je->t_iops[0] + je->t_iops[1],
88e4beaa 506 je->m_iops[0] + je->m_iops[1]);
3e47bd25 507 }
cf451d1e 508 if (je->eta_sec != INT_MAX && je->nr_running) {
0721d11e 509 char perc_str[32];
6eaf09d6
SL
510 char *iops_str[DDIR_RWDIR_CNT];
511 char *rate_str[DDIR_RWDIR_CNT];
79074e7c 512 size_t left;
adb02ba8 513 int l;
6eaf09d6 514 int ddir;
5ec10eaa 515
cf451d1e 516 if ((!je->eta_sec && !eta_good) || je->nr_ramp == je->nr_running)
cac58fd5
JA
517 strcpy(perc_str, "-.-% done");
518 else {
714e85f3
JA
519 double mult = 100.0;
520
521 if (je->nr_setting_up && je->nr_running)
522 mult *= (1.0 - (double) je->nr_setting_up / (double) je->nr_running);
523
cac58fd5 524 eta_good = 1;
714e85f3 525 perc *= mult;
0721d11e 526 sprintf(perc_str, "%3.1f%% done", perc);
cac58fd5 527 }
0721d11e 528
6eaf09d6
SL
529 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
530 rate_str[ddir] = num2str(je->rate[ddir], 5,
ad705bcb 531 1024, je->is_pow2, je->unit_base);
73798eb2 532 iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0, 0);
6eaf09d6 533 }
adb02ba8 534
79074e7c
JA
535 left = sizeof(output) - (p - output) - 1;
536
6eaf09d6
SL
537 l = snprintf(p, left, ": [%s] [%s] [%s/%s/%s /s] [%s/%s/%s iops] [eta %s]",
538 je->run_str, perc_str, rate_str[DDIR_READ],
539 rate_str[DDIR_WRITE], rate_str[DDIR_TRIM],
540 iops_str[DDIR_READ], iops_str[DDIR_WRITE],
541 iops_str[DDIR_TRIM], eta_str);
37db14fe 542 p += l;
adb02ba8 543 if (l >= 0 && l < linelen_last)
37db14fe 544 p += sprintf(p, "%*s", linelen_last - l, "");
adb02ba8 545 linelen_last = l;
d1bd7213 546
6eaf09d6
SL
547 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
548 free(rate_str[ddir]);
549 free(iops_str[ddir]);
550 }
263e529f 551 }
37db14fe
JA
552 p += sprintf(p, "\r");
553
3e47bd25 554 printf("%s", output);
e382e661
JA
555
556 if (!eta_new_line_init) {
557 fio_gettime(&disp_eta_new_line, NULL);
558 eta_new_line_init = 1;
559 } else if (eta_new_line &&
560 mtime_since_now(&disp_eta_new_line) > eta_new_line * 1000) {
561 fio_gettime(&disp_eta_new_line, NULL);
562 eta_new_line_pending = 1;
563 }
564
3e47bd25 565 fflush(stdout);
263e529f
JA
566}
567
723297c9 568struct jobs_eta *get_jobs_eta(int force, size_t *size)
cf451d1e 569{
1d1f45ae
JA
570 struct jobs_eta *je;
571
b814fb26 572 if (!thread_number)
723297c9 573 return NULL;
cf451d1e 574
723297c9
JA
575 *size = sizeof(*je) + THREAD_RUNSTR_SZ;
576 je = malloc(*size);
577 memset(je, 0, *size);
578
579 if (!calc_thread_status(je, 0)) {
580 free(je);
581 return NULL;
582 }
583
05bff935 584 *size = sizeof(*je) + strlen((char *) je->run_str) + 1;
723297c9
JA
585 return je;
586}
587
588void print_thread_status(void)
589{
590 struct jobs_eta *je;
591 size_t size;
cf451d1e 592
723297c9
JA
593 je = get_jobs_eta(0, &size);
594 if (je)
1d1f45ae 595 display_thread_status(je);
cf451d1e 596
1d1f45ae 597 free(je);
cf451d1e 598}
b75a394f 599
2b13e716 600void print_status_init(int thr_number)
263e529f 601{
3e2e48a7
JA
602 __run_str[thr_number] = 'P';
603 update_condensed_str(__run_str, run_str);
263e529f 604}