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