[fio.git] / eta.c

/*
 * Status and ETA code
 */
#include <unistd.h>
#include <fcntl.h>
#include <string.h>

#include "fio.h"

static char run_str[MAX_JOBS + 1];

/*
 * Sets the status of the 'td' in the printed status map.
 */
static void check_str_update(struct thread_data *td)
{
	char c = run_str[td->thread_number - 1];

	switch (td->runstate) {
	case TD_REAPED:
		c = '_';
		break;
	case TD_EXITED:
		c = 'E';
		break;
	case TD_RAMP:
		c = '/';
		break;
	case TD_RUNNING:
		if (td_rw(td)) {
			if (td_random(td))
				c = 'm';
			else
				c = 'M';
		} else if (td_read(td)) {
			if (td_random(td))
				c = 'r';
			else
				c = 'R';
		} else {
			if (td_random(td))
				c = 'w';
			else
				c = 'W';
		}
		break;
	case TD_PRE_READING:
		c = 'p';
		break;
	case TD_VERIFYING:
		c = 'V';
		break;
	case TD_FSYNCING:
		c = 'F';
		break;
	case TD_CREATED:
		c = 'C';
		break;
	case TD_INITIALIZED:
		c = 'I';
		break;
	case TD_NOT_CREATED:
		c = 'P';
		break;
	default:
		log_err("state %d\n", td->runstate);
	}

	run_str[td->thread_number - 1] = c;
}

/*
 * Convert seconds to a printable string.
 */
static void eta_to_str(char *str, unsigned long eta_sec)
{
	unsigned int d, h, m, s;
	int disp_hour = 0;

	s = eta_sec % 60;
	eta_sec /= 60;
	m = eta_sec % 60;
	eta_sec /= 60;
	h = eta_sec % 24;
	eta_sec /= 24;
	d = eta_sec;

	if (d) {
		disp_hour = 1;
		str += sprintf(str, "%02ud:", d);
	}

	if (h || disp_hour)
		str += sprintf(str, "%02uh:", h);

	str += sprintf(str, "%02um:", m);
	str += sprintf(str, "%02us", s);
}

/*
 * Best effort calculation of the estimated pending runtime of a job.
 */
static int thread_eta(struct thread_data *td)
{
	unsigned long long bytes_total, bytes_done;
	unsigned long eta_sec = 0;
	unsigned long elapsed;

	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;

	bytes_total = td->total_io_size;

	/*
	 * if writing, bytes_total will be twice the size. If mixing,
	 * assume a 50/50 split and thus bytes_total will be 50% larger.
	 */
	if (td->o.do_verify && td->o.verify && td_write(td)) {
		if (td_rw(td))
			bytes_total = bytes_total * 3 / 2;
		else
			bytes_total <<= 1;
	}

	if (td->o.zone_size && td->o.zone_skip)
		bytes_total /= (td->o.zone_skip / td->o.zone_size);

	if (td->o.fill_device && td->o.size  == -1ULL)
		return 0;

	if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) {
		double perc, perc_t;

		bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE];
		perc = (double) bytes_done / (double) bytes_total;
		if (perc > 1.0)
			perc = 1.0;

		if (td->o.time_based) {
			perc_t = (double) elapsed / (double) td->o.timeout;
			if (perc_t < perc)
				perc = perc_t;
		}

		eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;

		if (td->o.timeout &&
		    eta_sec > (td->o.timeout + done_secs - elapsed))
			eta_sec = td->o.timeout + done_secs - elapsed;
	} else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED
			|| td->runstate == TD_INITIALIZED
			|| td->runstate == TD_RAMP
			|| td->runstate == TD_PRE_READING) {
		int t_eta = 0, r_eta = 0;

		/*
		 * We can only guess - assume it'll run the full timeout
		 * if given, otherwise assume it'll run at the specified rate.
		 */
		if (td->o.timeout) {
			t_eta = td->o.timeout + td->o.start_delay;

			if (in_ramp_time(td)) {
				unsigned long ramp_left;

				ramp_left = mtime_since_now(&td->start);
				ramp_left = (ramp_left + 999) / 1000;
				if (ramp_left <= t_eta)
					t_eta -= ramp_left;
			}
		}
		if (td->o.rate[0] || td->o.rate[1]) {
			r_eta = (bytes_total / 1024) /
					(td->o.rate[0] + td->o.rate[1]);
			r_eta += td->o.start_delay;
		}

		if (r_eta && t_eta)
			eta_sec = min(r_eta, t_eta);
		else if (r_eta)
			eta_sec = r_eta;
		else if (t_eta)
			eta_sec = t_eta;
		else
			eta_sec = 0;
	} else {
		/*
		 * thread is already done or waiting for fsync
		 */
		eta_sec = 0;
	}

	return eta_sec;
}

static void calc_rate(unsigned long mtime, unsigned long long *io_bytes,
		      unsigned long long *prev_io_bytes, unsigned int *rate)
{
	rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime;
	rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime;
	prev_io_bytes[0] = io_bytes[0];
	prev_io_bytes[1] = io_bytes[1];
}

static void calc_iops(unsigned long mtime, unsigned long long *io_iops,
		      unsigned long long *prev_io_iops, unsigned int *iops)
{
	iops[0] = ((io_iops[0] - prev_io_iops[0]) * 1000) / mtime;
	iops[1] = ((io_iops[1] - prev_io_iops[1]) * 1000) / mtime;
	prev_io_iops[0] = io_iops[0];
	prev_io_iops[1] = io_iops[1];
}

/*
 * Print status of the jobs we know about. This includes rate estimates,
 * ETA, thread state, etc.
 */
void print_thread_status(void)
{
	unsigned long elapsed = (mtime_since_genesis() + 999) / 1000;
	int i, nr_ramp, nr_running, nr_pending, t_rate, m_rate;
	int t_iops, m_iops, files_open;
	struct thread_data *td;
	char eta_str[128];
	double perc = 0.0;
	unsigned long long io_bytes[2], io_iops[2];
	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs, eta_sec;
	struct timeval now;

	static unsigned long long rate_io_bytes[2];
	static unsigned long long disp_io_bytes[2];
	static unsigned long long disp_io_iops[2];
	static struct timeval rate_prev_time, disp_prev_time;
	static unsigned int rate[2], iops[2];
	static int linelen_last;
	static int eta_good;
	int i2p = 0;

	if (temp_stall_ts || terse_output || eta_print == FIO_ETA_NEVER)
		return;

	if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
		return;

	if (!rate_io_bytes[0] && !rate_io_bytes[1])
		fill_start_time(&rate_prev_time);
	if (!disp_io_bytes[0] && !disp_io_bytes[1])
		fill_start_time(&disp_prev_time);

	eta_secs = malloc(thread_number * sizeof(unsigned long));
	memset(eta_secs, 0, thread_number * sizeof(unsigned long));

	io_bytes[0] = io_bytes[1] = 0;
	io_iops[0] = io_iops[1] = 0;
	nr_pending = nr_running = t_rate = m_rate = t_iops = m_iops = 0;
	nr_ramp = 0;
	bw_avg_time = ULONG_MAX;
	files_open = 0;
	for_each_td(td, i) {
		if (td->o.bw_avg_time < bw_avg_time)
			bw_avg_time = td->o.bw_avg_time;
		if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING
		    || td->runstate == TD_FSYNCING
		    || td->runstate == TD_PRE_READING) {
			nr_running++;
			t_rate += td->o.rate[0] + td->o.rate[1];
			m_rate += td->o.ratemin[0] + td->o.ratemin[1];
			t_iops += td->o.rate_iops[0] + td->o.rate_iops[1];
			m_iops += td->o.rate_iops_min[0] +
					td->o.rate_iops_min[1];
			files_open += td->nr_open_files;
		} else if (td->runstate == TD_RAMP) {
			nr_running++;
			nr_ramp++;
		} else if (td->runstate < TD_RUNNING)
			nr_pending++;

		if (elapsed >= 3)
			eta_secs[i] = thread_eta(td);
		else
			eta_secs[i] = INT_MAX;

		check_str_update(td);

		if (td->runstate > TD_RAMP) {
			io_bytes[0] += td->io_bytes[0];
			io_bytes[1] += td->io_bytes[1];
			io_iops[0] += td->io_blocks[0];
			io_iops[1] += td->io_blocks[1];
		}
	}

	if (exitall_on_terminate)
		eta_sec = INT_MAX;
	else
		eta_sec = 0;

	for_each_td(td, i) {
		if (!i2p && is_power_of_2(td->o.kb_base))
			i2p = 1;
		if (exitall_on_terminate) {
			if (eta_secs[i] < eta_sec)
				eta_sec = eta_secs[i];
		} else {
			if (eta_secs[i] > eta_sec)
				eta_sec = eta_secs[i];
		}
	}

	free(eta_secs);

	if (eta_sec != INT_MAX && elapsed) {
		perc = (double) elapsed / (double) (elapsed + eta_sec);
		eta_to_str(eta_str, eta_sec);
	}

	fio_gettime(&now, NULL);
	rate_time = mtime_since(&rate_prev_time, &now);

	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
		calc_rate(rate_time, io_bytes, rate_io_bytes, rate);
		memcpy(&rate_prev_time, &now, sizeof(now));
		add_agg_sample(rate[DDIR_READ], DDIR_READ, 0);
		add_agg_sample(rate[DDIR_WRITE], DDIR_WRITE, 0);
	}

	disp_time = mtime_since(&disp_prev_time, &now);
	if (disp_time < 1000)
		return;

	calc_rate(disp_time, io_bytes, disp_io_bytes, rate);
	calc_iops(disp_time, io_iops, disp_io_iops, iops);

	memcpy(&disp_prev_time, &now, sizeof(now));

	if (!nr_running && !nr_pending)
		return;

	printf("Jobs: %d (f=%d)", nr_running, files_open);
	if (m_rate || t_rate) {
		char *tr, *mr;

		mr = num2str(m_rate, 4, 0, i2p);
		tr = num2str(t_rate, 4, 0, i2p);
		printf(", CR=%s/%s KB/s", tr, mr);
		free(tr);
		free(mr);
	} else if (m_iops || t_iops)
		printf(", CR=%d/%d IOPS", t_iops, m_iops);
	if (eta_sec != INT_MAX && nr_running) {
		char perc_str[32];
		char *iops_str[2];
		char *rate_str[2];
		int l;

		if ((!eta_sec && !eta_good) || nr_ramp == nr_running)
			strcpy(perc_str, "-.-% done");
		else {
			eta_good = 1;
			perc *= 100.0;
			sprintf(perc_str, "%3.1f%% done", perc);
		}

		rate_str[0] = num2str(rate[0], 5, 10, i2p);
		rate_str[1] = num2str(rate[1], 5, 10, i2p);

		iops_str[0] = num2str(iops[0], 4, 1, 0);
		iops_str[1] = num2str(iops[1], 4, 1, 0);

		l = printf(": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]",
				 run_str, perc_str, rate_str[0], rate_str[1],
				 iops_str[0], iops_str[1], eta_str);
		if (l >= 0 && l < linelen_last)
			printf("%*s", linelen_last - l, "");
		linelen_last = l;

		free(rate_str[0]);
		free(rate_str[1]);
		free(iops_str[0]);
		free(iops_str[1]);
	}
	printf("\r");
	fflush(stdout);
}

void print_status_init(int thread_number)
{
	run_str[thread_number] = 'P';
}
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 JA	9
	10	static char run_str[MAX_JOBS + 1];
	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	{
263e529f JA	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) {
165faf16 JA	89	disp_hour = 1;
1e97cce9	90	str += sprintf(str, "%02ud:", d);
263e529f	91	}
165faf16 JA	92
165faf16 JA	93	if (h \|\| disp_hour)
1e97cce9	94	str += sprintf(str, "%02uh:", h);
263e529f	95
1e97cce9 JA	96	str += sprintf(str, "%02um:", m);
1e97cce9 JA	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	{
263e529f JA	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
74939e38 JA	113	/*
	114	* if writing, bytes_total will be twice the size. If mixing,
	115	* assume a 50/50 split and thus bytes_total will be 50% larger.
	116	*/
0dd8377f	117	if (td->o.do_verify && td->o.verify && td_write(td)) {
74939e38 JA	118	if (td_rw(td))
	119	bytes_total = bytes_total * 3 / 2;
	120	else
	121	bytes_total <<= 1;
	122	}
	123
2dc1bbeb JA	124	if (td->o.zone_size && td->o.zone_skip)
2dc1bbeb JA	125	bytes_total /= (td->o.zone_skip / td->o.zone_size);
263e529f	126
9c5a3854 SSY	127	if (td->o.fill_device && td->o.size == -1ULL)
	128	return 0;
	129
263e529f	130	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING) {
cf4464ca	131	double perc, perc_t;
263e529f JA	132
	133	bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE];
	134	perc = (double) bytes_done / (double) bytes_total;
	135	if (perc > 1.0)
	136	perc = 1.0;
	137
cf4464ca JA	138	if (td->o.time_based) {
	139	perc_t = (double) elapsed / (double) td->o.timeout;
	140	if (perc_t < perc)
	141	perc = perc_t;
	142	}
	143
1e97cce9	144	eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;
263e529f	145
d3eeeabc JA	146	if (td->o.timeout &&
	147	eta_sec > (td->o.timeout + done_secs - elapsed))
	148	eta_sec = td->o.timeout + done_secs - elapsed;
263e529f	149	} else if (td->runstate == TD_NOT_CREATED \|\| td->runstate == TD_CREATED
b29ee5b3	150	\|\| td->runstate == TD_INITIALIZED
b0f65863 JA	151	\|\| td->runstate == TD_RAMP
b0f65863 JA	152	\|\| td->runstate == TD_PRE_READING) {
263e529f JA	153	int t_eta = 0, r_eta = 0;
	154
	155	/*
	156	* We can only guess - assume it'll run the full timeout
	157	* if given, otherwise assume it'll run at the specified rate.
	158	*/
b29ee5b3	159	if (td->o.timeout) {
d3eeeabc	160	t_eta = td->o.timeout + td->o.start_delay;
b29ee5b3 JA	161
	162	if (in_ramp_time(td)) {
	163	unsigned long ramp_left;
	164
	165	ramp_left = mtime_since_now(&td->start);
	166	ramp_left = (ramp_left + 999) / 1000;
	167	if (ramp_left <= t_eta)
	168	t_eta -= ramp_left;
	169	}
	170	}
581e7141	171	if (td->o.rate[0] \|\| td->o.rate[1]) {
0b9d69ec JA	172	r_eta = (bytes_total / 1024) /
0b9d69ec JA	173	(td->o.rate[0] + td->o.rate[1]);
d3eeeabc	174	r_eta += td->o.start_delay;
263e529f JA	175	}
	176
	177	if (r_eta && t_eta)
	178	eta_sec = min(r_eta, t_eta);
	179	else if (r_eta)
	180	eta_sec = r_eta;
	181	else if (t_eta)
	182	eta_sec = t_eta;
	183	else
	184	eta_sec = 0;
	185	} else {
	186	/*
	187	* thread is already done or waiting for fsync
	188	*/
	189	eta_sec = 0;
	190	}
	191
	192	return eta_sec;
	193	}
	194
46fda8d0 JA	195	static void calc_rate(unsigned long mtime, unsigned long long *io_bytes,
	196	unsigned long long prev_io_bytes, unsigned int rate)
	197	{
	198	rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime;
	199	rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime;
	200	prev_io_bytes[0] = io_bytes[0];
	201	prev_io_bytes[1] = io_bytes[1];
	202	}
5ec10eaa	203
adb02ba8 JA	204	static void calc_iops(unsigned long mtime, unsigned long long *io_iops,
	205	unsigned long long prev_io_iops, unsigned int iops)
	206	{
	207	iops[0] = ((io_iops[0] - prev_io_iops[0]) * 1000) / mtime;
	208	iops[1] = ((io_iops[1] - prev_io_iops[1]) * 1000) / mtime;
	209	prev_io_iops[0] = io_iops[0];
	210	prev_io_iops[1] = io_iops[1];
	211	}
	212
263e529f JA	213	/*
	214	* Print status of the jobs we know about. This includes rate estimates,
	215	* ETA, thread state, etc.
	216	*/
	217	void print_thread_status(void)
	218	{
b29ee5b3 JA	219	unsigned long elapsed = (mtime_since_genesis() + 999) / 1000;
b29ee5b3 JA	220	int i, nr_ramp, nr_running, nr_pending, t_rate, m_rate;
e6e41602	221	int t_iops, m_iops, files_open;
34572e28	222	struct thread_data *td;
2eaa41ce	223	char eta_str[128];
263e529f	224	double perc = 0.0;
adb02ba8	225	unsigned long long io_bytes[2], io_iops[2];
d3eeeabc	226	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs, eta_sec;
46fda8d0 JA	227	struct timeval now;
	228
	229	static unsigned long long rate_io_bytes[2];
	230	static unsigned long long disp_io_bytes[2];
adb02ba8	231	static unsigned long long disp_io_iops[2];
46fda8d0	232	static struct timeval rate_prev_time, disp_prev_time;
adb02ba8	233	static unsigned int rate[2], iops[2];
43819609	234	static int linelen_last;
cac58fd5	235	static int eta_good;
d6978a32	236	int i2p = 0;
6043c579	237
e592a06b AC	238	if (temp_stall_ts \|\| terse_output \|\| eta_print == FIO_ETA_NEVER)
	239	return;
	240
	241	if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
263e529f JA	242	return;
263e529f JA	243
46fda8d0 JA	244	if (!rate_io_bytes[0] && !rate_io_bytes[1])
	245	fill_start_time(&rate_prev_time);
	246	if (!disp_io_bytes[0] && !disp_io_bytes[1])
	247	fill_start_time(&disp_prev_time);
6043c579	248
d3eeeabc JA	249	eta_secs = malloc(thread_number * sizeof(unsigned long));
d3eeeabc JA	250	memset(eta_secs, 0, thread_number * sizeof(unsigned long));
263e529f	251
6043c579	252	io_bytes[0] = io_bytes[1] = 0;
adb02ba8	253	io_iops[0] = io_iops[1] = 0;
ac71feb1	254	nr_pending = nr_running = t_rate = m_rate = t_iops = m_iops = 0;
b29ee5b3	255	nr_ramp = 0;
bb3884d8	256	bw_avg_time = ULONG_MAX;
e6e41602	257	files_open = 0;
34572e28	258	for_each_td(td, i) {
2dc1bbeb JA	259	if (td->o.bw_avg_time < bw_avg_time)
2dc1bbeb JA	260	bw_avg_time = td->o.bw_avg_time;
46fda8d0	261	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING
b0f65863 JA	262	\|\| td->runstate == TD_FSYNCING
b0f65863 JA	263	\|\| td->runstate == TD_PRE_READING) {
263e529f	264	nr_running++;
581e7141 JA	265	t_rate += td->o.rate[0] + td->o.rate[1];
	266	m_rate += td->o.ratemin[0] + td->o.ratemin[1];
	267	t_iops += td->o.rate_iops[0] + td->o.rate_iops[1];
0b9d69ec JA	268	m_iops += td->o.rate_iops_min[0] +
0b9d69ec JA	269	td->o.rate_iops_min[1];
e6e41602	270	files_open += td->nr_open_files;
b29ee5b3 JA	271	} else if (td->runstate == TD_RAMP) {
	272	nr_running++;
	273	nr_ramp++;
263e529f JA	274	} else if (td->runstate < TD_RUNNING)
	275	nr_pending++;
	276
	277	if (elapsed >= 3)
b29ee5b3	278	eta_secs[i] = thread_eta(td);
263e529f JA	279	else
	280	eta_secs[i] = INT_MAX;
	281
	282	check_str_update(td);
b29ee5b3 JA	283
	284	if (td->runstate > TD_RAMP) {
	285	io_bytes[0] += td->io_bytes[0];
	286	io_bytes[1] += td->io_bytes[1];
adb02ba8 JA	287	io_iops[0] += td->io_blocks[0];
adb02ba8 JA	288	io_iops[1] += td->io_blocks[1];
b29ee5b3	289	}
263e529f JA	290	}
	291
	292	if (exitall_on_terminate)
	293	eta_sec = INT_MAX;
	294	else
	295	eta_sec = 0;
	296
34572e28	297	for_each_td(td, i) {
d6978a32 JA	298	if (!i2p && is_power_of_2(td->o.kb_base))
d6978a32 JA	299	i2p = 1;
9c5a3854 SSY	300	if (exitall_on_terminate) {
	301	if (eta_secs[i] < eta_sec)
	302	eta_sec = eta_secs[i];
	303	} else {
	304	if (eta_secs[i] > eta_sec)
	305	eta_sec = eta_secs[i];
	306	}
263e529f JA	307	}
263e529f JA	308
eecf272f JA	309	free(eta_secs);
eecf272f JA	310
263e529f JA	311	if (eta_sec != INT_MAX && elapsed) {
	312	perc = (double) elapsed / (double) (elapsed + eta_sec);
	313	eta_to_str(eta_str, eta_sec);
	314	}
	315
46fda8d0 JA	316	fio_gettime(&now, NULL);
	317	rate_time = mtime_since(&rate_prev_time, &now);
	318
b29ee5b3	319	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
46fda8d0 JA	320	calc_rate(rate_time, io_bytes, rate_io_bytes, rate);
46fda8d0 JA	321	memcpy(&rate_prev_time, &now, sizeof(now));
306ddc97 JA	322	add_agg_sample(rate[DDIR_READ], DDIR_READ, 0);
306ddc97 JA	323	add_agg_sample(rate[DDIR_WRITE], DDIR_WRITE, 0);
6043c579 JA	324	}
6043c579 JA	325
46fda8d0 JA	326	disp_time = mtime_since(&disp_prev_time, &now);
	327	if (disp_time < 1000)
	328	return;
	329
	330	calc_rate(disp_time, io_bytes, disp_io_bytes, rate);
adb02ba8 JA	331	calc_iops(disp_time, io_iops, disp_io_iops, iops);
adb02ba8 JA	332
46fda8d0 JA	333	memcpy(&disp_prev_time, &now, sizeof(now));
46fda8d0 JA	334
263e529f JA	335	if (!nr_running && !nr_pending)
	336	return;
	337
e6e41602	338	printf("Jobs: %d (f=%d)", nr_running, files_open);
581e7141 JA	339	if (m_rate \|\| t_rate) {
	340	char tr, mr;
	341
d6978a32 JA	342	mr = num2str(m_rate, 4, 0, i2p);
d6978a32 JA	343	tr = num2str(t_rate, 4, 0, i2p);
b22989b9	344	printf(", CR=%s/%s KB/s", tr, mr);
581e7141 JA	345	free(tr);
	346	free(mr);
	347	} else if (m_iops \|\| t_iops)
ac71feb1	348	printf(", CR=%d/%d IOPS", t_iops, m_iops);
263e529f	349	if (eta_sec != INT_MAX && nr_running) {
0721d11e	350	char perc_str[32];
adb02ba8	351	char *iops_str[2];
d1bd7213	352	char *rate_str[2];
adb02ba8	353	int l;
5ec10eaa	354
b29ee5b3	355	if ((!eta_sec && !eta_good) \|\| nr_ramp == nr_running)
cac58fd5 JA	356	strcpy(perc_str, "-.-% done");
	357	else {
	358	eta_good = 1;
	359	perc *= 100.0;
0721d11e	360	sprintf(perc_str, "%3.1f%% done", perc);
cac58fd5	361	}
0721d11e	362
d6978a32 JA	363	rate_str[0] = num2str(rate[0], 5, 10, i2p);
d6978a32 JA	364	rate_str[1] = num2str(rate[1], 5, 10, i2p);
d1bd7213	365
adb02ba8 JA	366	iops_str[0] = num2str(iops[0], 4, 1, 0);
	367	iops_str[1] = num2str(iops[1], 4, 1, 0);
	368
d1bd7213	369	l = printf(": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]",
0b9d69ec	370	run_str, perc_str, rate_str[0], rate_str[1],
adb02ba8 JA	371	iops_str[0], iops_str[1], eta_str);
	372	if (l >= 0 && l < linelen_last)
	373	printf("%*s", linelen_last - l, "");
	374	linelen_last = l;
d1bd7213 JA	375
	376	free(rate_str[0]);
	377	free(rate_str[1]);
adb02ba8 JA	378	free(iops_str[0]);
adb02ba8 JA	379	free(iops_str[1]);
263e529f JA	380	}
	381	printf("\r");
	382	fflush(stdout);
263e529f JA	383	}
	384
	385	void print_status_init(int thread_number)
	386	{
	387	run_str[thread_number] = 'P';
	388	}