Commit | Line | Data |
---|---|---|
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 | |
fca70358 | 10 | static char run_str[REAL_MAX_JOBS + 1]; |
263e529f JA |
11 | |
12 | /* | |
13 | * Sets the status of the 'td' in the printed status map. | |
14 | */ | |
15 | static void check_str_update(struct thread_data *td) | |
16 | { | |
17 | char c = run_str[td->thread_number - 1]; | |
18 | ||
19 | switch (td->runstate) { | |
5ec10eaa | 20 | case TD_REAPED: |
4f7e57a4 JA |
21 | if (td->error) |
22 | c = 'X'; | |
a5e371a6 JA |
23 | else if (td->sig) |
24 | c = 'K'; | |
4f7e57a4 JA |
25 | else |
26 | c = '_'; | |
5ec10eaa JA |
27 | break; |
28 | case TD_EXITED: | |
29 | c = 'E'; | |
30 | break; | |
b29ee5b3 JA |
31 | case TD_RAMP: |
32 | c = '/'; | |
33 | break; | |
5ec10eaa JA |
34 | case TD_RUNNING: |
35 | if (td_rw(td)) { | |
e3b3f81e JA |
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 | } | |
5ec10eaa JA |
51 | } else if (td_read(td)) { |
52 | if (td_random(td)) | |
53 | c = 'r'; | |
54 | else | |
55 | c = 'R'; | |
56 | } else { | |
57 | if (td_random(td)) | |
58 | c = 'w'; | |
59 | else | |
60 | c = 'W'; | |
61 | } | |
62 | break; | |
b0f65863 JA |
63 | case TD_PRE_READING: |
64 | c = 'p'; | |
65 | break; | |
5ec10eaa JA |
66 | case TD_VERIFYING: |
67 | c = 'V'; | |
68 | break; | |
69 | case TD_FSYNCING: | |
70 | c = 'F'; | |
71 | break; | |
72 | case TD_CREATED: | |
73 | c = 'C'; | |
74 | break; | |
75 | case TD_INITIALIZED: | |
76 | c = 'I'; | |
77 | break; | |
78 | case TD_NOT_CREATED: | |
79 | c = 'P'; | |
80 | break; | |
81 | default: | |
82 | log_err("state %d\n", td->runstate); | |
263e529f JA |
83 | } |
84 | ||
85 | run_str[td->thread_number - 1] = c; | |
86 | } | |
87 | ||
88 | /* | |
89 | * Convert seconds to a printable string. | |
90 | */ | |
3e47bd25 | 91 | void eta_to_str(char *str, unsigned long eta_sec) |
263e529f JA |
92 | { |
93 | unsigned int d, h, m, s; | |
165faf16 | 94 | int disp_hour = 0; |
263e529f | 95 | |
263e529f JA |
96 | s = eta_sec % 60; |
97 | eta_sec /= 60; | |
98 | m = eta_sec % 60; | |
99 | eta_sec /= 60; | |
100 | h = eta_sec % 24; | |
101 | eta_sec /= 24; | |
102 | d = eta_sec; | |
103 | ||
165faf16 JA |
104 | if (d) { |
105 | disp_hour = 1; | |
1e97cce9 | 106 | str += sprintf(str, "%02ud:", d); |
263e529f | 107 | } |
165faf16 JA |
108 | |
109 | if (h || disp_hour) | |
1e97cce9 | 110 | str += sprintf(str, "%02uh:", h); |
263e529f | 111 | |
1e97cce9 JA |
112 | str += sprintf(str, "%02um:", m); |
113 | str += sprintf(str, "%02us", s); | |
263e529f JA |
114 | } |
115 | ||
116 | /* | |
117 | * Best effort calculation of the estimated pending runtime of a job. | |
118 | */ | |
b29ee5b3 | 119 | static int thread_eta(struct thread_data *td) |
263e529f JA |
120 | { |
121 | unsigned long long bytes_total, bytes_done; | |
1e97cce9 | 122 | unsigned long eta_sec = 0; |
b29ee5b3 JA |
123 | unsigned long elapsed; |
124 | ||
125 | elapsed = (mtime_since_now(&td->epoch) + 999) / 1000; | |
263e529f JA |
126 | |
127 | bytes_total = td->total_io_size; | |
128 | ||
2e3bd4c2 JA |
129 | if (td->o.fill_device && td->o.size == -1ULL) { |
130 | if (!td->fill_device_size || td->fill_device_size == -1ULL) | |
131 | return 0; | |
132 | ||
133 | bytes_total = td->fill_device_size; | |
134 | } | |
135 | ||
74939e38 JA |
136 | /* |
137 | * if writing, bytes_total will be twice the size. If mixing, | |
138 | * assume a 50/50 split and thus bytes_total will be 50% larger. | |
139 | */ | |
0dd8377f | 140 | if (td->o.do_verify && td->o.verify && td_write(td)) { |
74939e38 JA |
141 | if (td_rw(td)) |
142 | bytes_total = bytes_total * 3 / 2; | |
143 | else | |
144 | bytes_total <<= 1; | |
145 | } | |
146 | ||
2dc1bbeb JA |
147 | if (td->o.zone_size && td->o.zone_skip) |
148 | bytes_total /= (td->o.zone_skip / td->o.zone_size); | |
263e529f JA |
149 | |
150 | if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) { | |
cf4464ca | 151 | double perc, perc_t; |
263e529f JA |
152 | |
153 | bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE]; | |
154 | perc = (double) bytes_done / (double) bytes_total; | |
155 | if (perc > 1.0) | |
156 | perc = 1.0; | |
157 | ||
cf4464ca JA |
158 | if (td->o.time_based) { |
159 | perc_t = (double) elapsed / (double) td->o.timeout; | |
160 | if (perc_t < perc) | |
161 | perc = perc_t; | |
162 | } | |
163 | ||
1e97cce9 | 164 | eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed; |
263e529f | 165 | |
d3eeeabc JA |
166 | if (td->o.timeout && |
167 | eta_sec > (td->o.timeout + done_secs - elapsed)) | |
168 | eta_sec = td->o.timeout + done_secs - elapsed; | |
263e529f | 169 | } else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED |
b29ee5b3 | 170 | || td->runstate == TD_INITIALIZED |
b0f65863 JA |
171 | || td->runstate == TD_RAMP |
172 | || td->runstate == TD_PRE_READING) { | |
263e529f JA |
173 | int t_eta = 0, r_eta = 0; |
174 | ||
175 | /* | |
176 | * We can only guess - assume it'll run the full timeout | |
177 | * if given, otherwise assume it'll run at the specified rate. | |
178 | */ | |
b29ee5b3 | 179 | if (td->o.timeout) { |
cda99fa0 SSP |
180 | t_eta = td->o.timeout + td->o.start_delay + |
181 | td->o.ramp_time; | |
b29ee5b3 JA |
182 | |
183 | if (in_ramp_time(td)) { | |
184 | unsigned long ramp_left; | |
185 | ||
cda99fa0 | 186 | ramp_left = mtime_since_now(&td->epoch); |
b29ee5b3 JA |
187 | ramp_left = (ramp_left + 999) / 1000; |
188 | if (ramp_left <= t_eta) | |
189 | t_eta -= ramp_left; | |
190 | } | |
191 | } | |
581e7141 | 192 | if (td->o.rate[0] || td->o.rate[1]) { |
0b9d69ec JA |
193 | r_eta = (bytes_total / 1024) / |
194 | (td->o.rate[0] + td->o.rate[1]); | |
d3eeeabc | 195 | r_eta += td->o.start_delay; |
263e529f JA |
196 | } |
197 | ||
198 | if (r_eta && t_eta) | |
199 | eta_sec = min(r_eta, t_eta); | |
200 | else if (r_eta) | |
201 | eta_sec = r_eta; | |
202 | else if (t_eta) | |
203 | eta_sec = t_eta; | |
204 | else | |
205 | eta_sec = 0; | |
206 | } else { | |
207 | /* | |
208 | * thread is already done or waiting for fsync | |
209 | */ | |
210 | eta_sec = 0; | |
211 | } | |
212 | ||
213 | return eta_sec; | |
214 | } | |
215 | ||
46fda8d0 JA |
216 | static void calc_rate(unsigned long mtime, unsigned long long *io_bytes, |
217 | unsigned long long *prev_io_bytes, unsigned int *rate) | |
218 | { | |
219 | rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime; | |
220 | rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime; | |
221 | prev_io_bytes[0] = io_bytes[0]; | |
222 | prev_io_bytes[1] = io_bytes[1]; | |
223 | } | |
5ec10eaa | 224 | |
adb02ba8 JA |
225 | static void calc_iops(unsigned long mtime, unsigned long long *io_iops, |
226 | unsigned long long *prev_io_iops, unsigned int *iops) | |
227 | { | |
228 | iops[0] = ((io_iops[0] - prev_io_iops[0]) * 1000) / mtime; | |
229 | iops[1] = ((io_iops[1] - prev_io_iops[1]) * 1000) / mtime; | |
230 | prev_io_iops[0] = io_iops[0]; | |
231 | prev_io_iops[1] = io_iops[1]; | |
232 | } | |
233 | ||
263e529f JA |
234 | /* |
235 | * Print status of the jobs we know about. This includes rate estimates, | |
236 | * ETA, thread state, etc. | |
237 | */ | |
af9c9fb3 | 238 | int calc_thread_status(struct jobs_eta *je, int force) |
263e529f | 239 | { |
34572e28 | 240 | struct thread_data *td; |
b75a394f JA |
241 | int i; |
242 | unsigned long rate_time, disp_time, bw_avg_time, *eta_secs; | |
243 | unsigned long long io_bytes[2]; | |
244 | unsigned long long io_iops[2]; | |
46fda8d0 JA |
245 | struct timeval now; |
246 | ||
247 | static unsigned long long rate_io_bytes[2]; | |
248 | static unsigned long long disp_io_bytes[2]; | |
adb02ba8 | 249 | static unsigned long long disp_io_iops[2]; |
46fda8d0 | 250 | static struct timeval rate_prev_time, disp_prev_time; |
d6978a32 | 251 | int i2p = 0; |
6043c579 | 252 | |
af9c9fb3 JA |
253 | if (!force) { |
254 | if (temp_stall_ts || terse_output || eta_print == FIO_ETA_NEVER) | |
255 | return 0; | |
e592a06b | 256 | |
af9c9fb3 JA |
257 | if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS)) |
258 | return 0; | |
259 | } | |
263e529f | 260 | |
46fda8d0 JA |
261 | if (!rate_io_bytes[0] && !rate_io_bytes[1]) |
262 | fill_start_time(&rate_prev_time); | |
263 | if (!disp_io_bytes[0] && !disp_io_bytes[1]) | |
264 | fill_start_time(&disp_prev_time); | |
6043c579 | 265 | |
d3eeeabc JA |
266 | eta_secs = malloc(thread_number * sizeof(unsigned long)); |
267 | memset(eta_secs, 0, thread_number * sizeof(unsigned long)); | |
263e529f | 268 | |
b75a394f JA |
269 | je->elapsed_sec = (mtime_since_genesis() + 999) / 1000; |
270 | ||
6043c579 | 271 | io_bytes[0] = io_bytes[1] = 0; |
adb02ba8 | 272 | io_iops[0] = io_iops[1] = 0; |
bb3884d8 | 273 | bw_avg_time = ULONG_MAX; |
34572e28 | 274 | for_each_td(td, i) { |
2dc1bbeb JA |
275 | if (td->o.bw_avg_time < bw_avg_time) |
276 | bw_avg_time = td->o.bw_avg_time; | |
46fda8d0 | 277 | if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING |
b0f65863 JA |
278 | || td->runstate == TD_FSYNCING |
279 | || td->runstate == TD_PRE_READING) { | |
b75a394f | 280 | je->nr_running++; |
3e47bd25 JA |
281 | je->t_rate[0] += td->o.rate[0]; |
282 | je->t_rate[1] += td->o.rate[1]; | |
283 | je->m_rate[0] += td->o.ratemin[0]; | |
284 | je->m_rate[1] += td->o.ratemin[1]; | |
285 | je->t_iops[0] += td->o.rate_iops[0]; | |
286 | je->t_iops[1] += td->o.rate_iops[1]; | |
287 | je->m_iops[0] += td->o.rate_iops_min[0]; | |
288 | je->m_iops[1] += td->o.rate_iops_min[1]; | |
b75a394f | 289 | je->files_open += td->nr_open_files; |
b29ee5b3 | 290 | } else if (td->runstate == TD_RAMP) { |
b75a394f JA |
291 | je->nr_running++; |
292 | je->nr_ramp++; | |
263e529f | 293 | } else if (td->runstate < TD_RUNNING) |
b75a394f | 294 | je->nr_pending++; |
263e529f | 295 | |
b75a394f | 296 | if (je->elapsed_sec >= 3) |
b29ee5b3 | 297 | eta_secs[i] = thread_eta(td); |
263e529f JA |
298 | else |
299 | eta_secs[i] = INT_MAX; | |
300 | ||
301 | check_str_update(td); | |
b29ee5b3 JA |
302 | |
303 | if (td->runstate > TD_RAMP) { | |
304 | io_bytes[0] += td->io_bytes[0]; | |
305 | io_bytes[1] += td->io_bytes[1]; | |
adb02ba8 JA |
306 | io_iops[0] += td->io_blocks[0]; |
307 | io_iops[1] += td->io_blocks[1]; | |
b29ee5b3 | 308 | } |
263e529f JA |
309 | } |
310 | ||
311 | if (exitall_on_terminate) | |
b75a394f | 312 | je->eta_sec = INT_MAX; |
263e529f | 313 | else |
b75a394f | 314 | je->eta_sec = 0; |
263e529f | 315 | |
34572e28 | 316 | for_each_td(td, i) { |
d6978a32 JA |
317 | if (!i2p && is_power_of_2(td->o.kb_base)) |
318 | i2p = 1; | |
9c5a3854 | 319 | if (exitall_on_terminate) { |
b75a394f JA |
320 | if (eta_secs[i] < je->eta_sec) |
321 | je->eta_sec = eta_secs[i]; | |
9c5a3854 | 322 | } else { |
b75a394f JA |
323 | if (eta_secs[i] > je->eta_sec) |
324 | je->eta_sec = eta_secs[i]; | |
9c5a3854 | 325 | } |
263e529f JA |
326 | } |
327 | ||
eecf272f JA |
328 | free(eta_secs); |
329 | ||
46fda8d0 JA |
330 | fio_gettime(&now, NULL); |
331 | rate_time = mtime_since(&rate_prev_time, &now); | |
332 | ||
b29ee5b3 | 333 | if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) { |
b75a394f | 334 | calc_rate(rate_time, io_bytes, rate_io_bytes, je->rate); |
46fda8d0 | 335 | memcpy(&rate_prev_time, &now, sizeof(now)); |
b75a394f JA |
336 | add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0); |
337 | add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0); | |
6043c579 JA |
338 | } |
339 | ||
46fda8d0 | 340 | disp_time = mtime_since(&disp_prev_time, &now); |
a5b01f1b JA |
341 | |
342 | /* | |
343 | * Allow a little slack, the target is to print it every 1000 msecs | |
344 | */ | |
af9c9fb3 | 345 | if (!force && disp_time < 900) |
b75a394f | 346 | return 0; |
46fda8d0 | 347 | |
b75a394f JA |
348 | calc_rate(disp_time, io_bytes, disp_io_bytes, je->rate); |
349 | calc_iops(disp_time, io_iops, disp_io_iops, je->iops); | |
adb02ba8 | 350 | |
46fda8d0 JA |
351 | memcpy(&disp_prev_time, &now, sizeof(now)); |
352 | ||
af9c9fb3 | 353 | if (!force && !je->nr_running && !je->nr_pending) |
b75a394f JA |
354 | return 0; |
355 | ||
1d1f45ae JA |
356 | je->nr_threads = thread_number; |
357 | memcpy(je->run_str, run_str, thread_number * sizeof(char)); | |
358 | ||
b75a394f JA |
359 | return 1; |
360 | } | |
361 | ||
cf451d1e | 362 | void display_thread_status(struct jobs_eta *je) |
b75a394f | 363 | { |
b75a394f JA |
364 | static int linelen_last; |
365 | static int eta_good; | |
366 | char output[512], *p = output; | |
367 | char eta_str[128]; | |
368 | double perc = 0.0; | |
369 | int i2p = 0; | |
370 | ||
cf451d1e JA |
371 | if (je->eta_sec != INT_MAX && je->elapsed_sec) { |
372 | perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec); | |
373 | eta_to_str(eta_str, je->eta_sec); | |
b75a394f JA |
374 | } |
375 | ||
cf451d1e | 376 | p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open); |
3e47bd25 | 377 | if (je->m_rate[0] || je->m_rate[1] || je->t_rate[0] || je->t_rate[1]) { |
581e7141 JA |
378 | char *tr, *mr; |
379 | ||
3e47bd25 JA |
380 | mr = num2str(je->m_rate[0] + je->m_rate[1], 4, 0, i2p); |
381 | tr = num2str(je->t_rate[0] + je->t_rate[1], 4, 0, i2p); | |
37db14fe | 382 | p += sprintf(p, ", CR=%s/%s KB/s", tr, mr); |
581e7141 JA |
383 | free(tr); |
384 | free(mr); | |
3e47bd25 JA |
385 | } else if (je->m_iops[0] || je->m_iops[1] || je->t_iops[0] || je->t_iops[1]) { |
386 | p += sprintf(p, ", CR=%d/%d IOPS", | |
387 | je->t_iops[0] + je->t_iops[1], | |
388 | je->m_iops[0] + je->t_iops[1]); | |
389 | } | |
cf451d1e | 390 | if (je->eta_sec != INT_MAX && je->nr_running) { |
0721d11e | 391 | char perc_str[32]; |
adb02ba8 | 392 | char *iops_str[2]; |
d1bd7213 | 393 | char *rate_str[2]; |
adb02ba8 | 394 | int l; |
5ec10eaa | 395 | |
cf451d1e | 396 | if ((!je->eta_sec && !eta_good) || je->nr_ramp == je->nr_running) |
cac58fd5 JA |
397 | strcpy(perc_str, "-.-% done"); |
398 | else { | |
399 | eta_good = 1; | |
400 | perc *= 100.0; | |
0721d11e | 401 | sprintf(perc_str, "%3.1f%% done", perc); |
cac58fd5 | 402 | } |
0721d11e | 403 | |
cf451d1e JA |
404 | rate_str[0] = num2str(je->rate[0], 5, 10, i2p); |
405 | rate_str[1] = num2str(je->rate[1], 5, 10, i2p); | |
d1bd7213 | 406 | |
cf451d1e JA |
407 | iops_str[0] = num2str(je->iops[0], 4, 1, 0); |
408 | iops_str[1] = num2str(je->iops[1], 4, 1, 0); | |
adb02ba8 | 409 | |
37db14fe | 410 | l = sprintf(p, ": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]", |
1d1f45ae JA |
411 | je->run_str, perc_str, rate_str[0], |
412 | rate_str[1], iops_str[0], iops_str[1], eta_str); | |
37db14fe | 413 | p += l; |
adb02ba8 | 414 | if (l >= 0 && l < linelen_last) |
37db14fe | 415 | p += sprintf(p, "%*s", linelen_last - l, ""); |
adb02ba8 | 416 | linelen_last = l; |
d1bd7213 JA |
417 | |
418 | free(rate_str[0]); | |
419 | free(rate_str[1]); | |
adb02ba8 JA |
420 | free(iops_str[0]); |
421 | free(iops_str[1]); | |
263e529f | 422 | } |
37db14fe JA |
423 | p += sprintf(p, "\r"); |
424 | ||
3e47bd25 JA |
425 | printf("%s", output); |
426 | fflush(stdout); | |
263e529f JA |
427 | } |
428 | ||
cf451d1e JA |
429 | void print_thread_status(void) |
430 | { | |
1d1f45ae | 431 | struct jobs_eta *je; |
b814fb26 | 432 | size_t size; |
1d1f45ae | 433 | |
b814fb26 JA |
434 | if (!thread_number) |
435 | return; | |
cf451d1e | 436 | |
b814fb26 JA |
437 | size = sizeof(*je) + thread_number * sizeof(char) + 1; |
438 | je = malloc(size); | |
439 | memset(je, 0, size); | |
cf451d1e | 440 | |
af9c9fb3 | 441 | if (calc_thread_status(je, 0)) |
1d1f45ae | 442 | display_thread_status(je); |
cf451d1e | 443 | |
1d1f45ae | 444 | free(je); |
cf451d1e | 445 | } |
b75a394f | 446 | |
2b13e716 | 447 | void print_status_init(int thr_number) |
263e529f | 448 | { |
2b13e716 | 449 | run_str[thr_number] = 'P'; |
263e529f | 450 | } |