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