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