[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 (td->o.fill_device && td->o.size  == -1ULL) {
		if (!td->fill_device_size || td->fill_device_size == -1ULL)
			return 0;

		bytes_total = td->fill_device_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->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
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)
2dc1bbeb JA	132	bytes_total /= (td->o.zone_skip / td->o.zone_size);
263e529f JA	133
263e529f JA	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
b0f65863 JA	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) {
d3eeeabc	164	t_eta = td->o.timeout + td->o.start_delay;
b29ee5b3 JA	165
	166	if (in_ramp_time(td)) {
	167	unsigned long ramp_left;
	168
	169	ramp_left = mtime_since_now(&td->start);
	170	ramp_left = (ramp_left + 999) / 1000;
	171	if (ramp_left <= t_eta)
	172	t_eta -= ramp_left;
	173	}
	174	}
581e7141	175	if (td->o.rate[0] \|\| td->o.rate[1]) {
0b9d69ec JA	176	r_eta = (bytes_total / 1024) /
0b9d69ec JA	177	(td->o.rate[0] + td->o.rate[1]);
d3eeeabc	178	r_eta += td->o.start_delay;
263e529f JA	179	}
	180
	181	if (r_eta && t_eta)
	182	eta_sec = min(r_eta, t_eta);
	183	else if (r_eta)
	184	eta_sec = r_eta;
	185	else if (t_eta)
	186	eta_sec = t_eta;
	187	else
	188	eta_sec = 0;
	189	} else {
	190	/*
	191	* thread is already done or waiting for fsync
	192	*/
	193	eta_sec = 0;
	194	}
	195
	196	return eta_sec;
	197	}
	198
46fda8d0 JA	199	static void calc_rate(unsigned long mtime, unsigned long long *io_bytes,
	200	unsigned long long prev_io_bytes, unsigned int rate)
	201	{
	202	rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime;
	203	rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime;
	204	prev_io_bytes[0] = io_bytes[0];
	205	prev_io_bytes[1] = io_bytes[1];
	206	}
5ec10eaa	207
adb02ba8 JA	208	static void calc_iops(unsigned long mtime, unsigned long long *io_iops,
	209	unsigned long long prev_io_iops, unsigned int iops)
	210	{
	211	iops[0] = ((io_iops[0] - prev_io_iops[0]) * 1000) / mtime;
	212	iops[1] = ((io_iops[1] - prev_io_iops[1]) * 1000) / mtime;
	213	prev_io_iops[0] = io_iops[0];
	214	prev_io_iops[1] = io_iops[1];
	215	}
	216
263e529f JA	217	/*
	218	* Print status of the jobs we know about. This includes rate estimates,
	219	* ETA, thread state, etc.
	220	*/
	221	void print_thread_status(void)
	222	{
b29ee5b3 JA	223	unsigned long elapsed = (mtime_since_genesis() + 999) / 1000;
b29ee5b3 JA	224	int i, nr_ramp, nr_running, nr_pending, t_rate, m_rate;
e6e41602	225	int t_iops, m_iops, files_open;
34572e28	226	struct thread_data *td;
2eaa41ce	227	char eta_str[128];
263e529f	228	double perc = 0.0;
adb02ba8	229	unsigned long long io_bytes[2], io_iops[2];
d3eeeabc	230	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs, eta_sec;
46fda8d0 JA	231	struct timeval now;
	232
	233	static unsigned long long rate_io_bytes[2];
	234	static unsigned long long disp_io_bytes[2];
adb02ba8	235	static unsigned long long disp_io_iops[2];
46fda8d0	236	static struct timeval rate_prev_time, disp_prev_time;
adb02ba8	237	static unsigned int rate[2], iops[2];
43819609	238	static int linelen_last;
cac58fd5	239	static int eta_good;
d6978a32	240	int i2p = 0;
6043c579	241
e592a06b AC	242	if (temp_stall_ts \|\| terse_output \|\| eta_print == FIO_ETA_NEVER)
	243	return;
	244
	245	if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
263e529f JA	246	return;
263e529f JA	247
46fda8d0 JA	248	if (!rate_io_bytes[0] && !rate_io_bytes[1])
	249	fill_start_time(&rate_prev_time);
	250	if (!disp_io_bytes[0] && !disp_io_bytes[1])
	251	fill_start_time(&disp_prev_time);
6043c579	252
d3eeeabc JA	253	eta_secs = malloc(thread_number * sizeof(unsigned long));
d3eeeabc JA	254	memset(eta_secs, 0, thread_number * sizeof(unsigned long));
263e529f	255
6043c579	256	io_bytes[0] = io_bytes[1] = 0;
adb02ba8	257	io_iops[0] = io_iops[1] = 0;
ac71feb1	258	nr_pending = nr_running = t_rate = m_rate = t_iops = m_iops = 0;
b29ee5b3	259	nr_ramp = 0;
bb3884d8	260	bw_avg_time = ULONG_MAX;
e6e41602	261	files_open = 0;
34572e28	262	for_each_td(td, i) {
2dc1bbeb JA	263	if (td->o.bw_avg_time < bw_avg_time)
2dc1bbeb JA	264	bw_avg_time = td->o.bw_avg_time;
46fda8d0	265	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING
b0f65863 JA	266	\|\| td->runstate == TD_FSYNCING
b0f65863 JA	267	\|\| td->runstate == TD_PRE_READING) {
263e529f	268	nr_running++;
581e7141 JA	269	t_rate += td->o.rate[0] + td->o.rate[1];
	270	m_rate += td->o.ratemin[0] + td->o.ratemin[1];
	271	t_iops += td->o.rate_iops[0] + td->o.rate_iops[1];
0b9d69ec JA	272	m_iops += td->o.rate_iops_min[0] +
0b9d69ec JA	273	td->o.rate_iops_min[1];
e6e41602	274	files_open += td->nr_open_files;
b29ee5b3 JA	275	} else if (td->runstate == TD_RAMP) {
	276	nr_running++;
	277	nr_ramp++;
263e529f JA	278	} else if (td->runstate < TD_RUNNING)
	279	nr_pending++;
	280
	281	if (elapsed >= 3)
b29ee5b3	282	eta_secs[i] = thread_eta(td);
263e529f JA	283	else
	284	eta_secs[i] = INT_MAX;
	285
	286	check_str_update(td);
b29ee5b3 JA	287
	288	if (td->runstate > TD_RAMP) {
	289	io_bytes[0] += td->io_bytes[0];
	290	io_bytes[1] += td->io_bytes[1];
adb02ba8 JA	291	io_iops[0] += td->io_blocks[0];
adb02ba8 JA	292	io_iops[1] += td->io_blocks[1];
b29ee5b3	293	}
263e529f JA	294	}
	295
	296	if (exitall_on_terminate)
	297	eta_sec = INT_MAX;
	298	else
	299	eta_sec = 0;
	300
34572e28	301	for_each_td(td, i) {
d6978a32 JA	302	if (!i2p && is_power_of_2(td->o.kb_base))
d6978a32 JA	303	i2p = 1;
9c5a3854 SSY	304	if (exitall_on_terminate) {
	305	if (eta_secs[i] < eta_sec)
	306	eta_sec = eta_secs[i];
	307	} else {
	308	if (eta_secs[i] > eta_sec)
	309	eta_sec = eta_secs[i];
	310	}
263e529f JA	311	}
263e529f JA	312
eecf272f JA	313	free(eta_secs);
eecf272f JA	314
263e529f JA	315	if (eta_sec != INT_MAX && elapsed) {
	316	perc = (double) elapsed / (double) (elapsed + eta_sec);
	317	eta_to_str(eta_str, eta_sec);
	318	}
	319
46fda8d0 JA	320	fio_gettime(&now, NULL);
	321	rate_time = mtime_since(&rate_prev_time, &now);
	322
b29ee5b3	323	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
46fda8d0 JA	324	calc_rate(rate_time, io_bytes, rate_io_bytes, rate);
46fda8d0 JA	325	memcpy(&rate_prev_time, &now, sizeof(now));
306ddc97 JA	326	add_agg_sample(rate[DDIR_READ], DDIR_READ, 0);
306ddc97 JA	327	add_agg_sample(rate[DDIR_WRITE], DDIR_WRITE, 0);
6043c579 JA	328	}
6043c579 JA	329
46fda8d0 JA	330	disp_time = mtime_since(&disp_prev_time, &now);
	331	if (disp_time < 1000)
	332	return;
	333
	334	calc_rate(disp_time, io_bytes, disp_io_bytes, rate);
adb02ba8 JA	335	calc_iops(disp_time, io_iops, disp_io_iops, iops);
adb02ba8 JA	336
46fda8d0 JA	337	memcpy(&disp_prev_time, &now, sizeof(now));
46fda8d0 JA	338
263e529f JA	339	if (!nr_running && !nr_pending)
	340	return;
	341
e6e41602	342	printf("Jobs: %d (f=%d)", nr_running, files_open);
581e7141 JA	343	if (m_rate \|\| t_rate) {
	344	char tr, mr;
	345
d6978a32 JA	346	mr = num2str(m_rate, 4, 0, i2p);
d6978a32 JA	347	tr = num2str(t_rate, 4, 0, i2p);
b22989b9	348	printf(", CR=%s/%s KB/s", tr, mr);
581e7141 JA	349	free(tr);
	350	free(mr);
	351	} else if (m_iops \|\| t_iops)
ac71feb1	352	printf(", CR=%d/%d IOPS", t_iops, m_iops);
263e529f	353	if (eta_sec != INT_MAX && nr_running) {
0721d11e	354	char perc_str[32];
adb02ba8	355	char *iops_str[2];
d1bd7213	356	char *rate_str[2];
adb02ba8	357	int l;
5ec10eaa	358
b29ee5b3	359	if ((!eta_sec && !eta_good) \|\| nr_ramp == nr_running)
cac58fd5 JA	360	strcpy(perc_str, "-.-% done");
	361	else {
	362	eta_good = 1;
	363	perc *= 100.0;
0721d11e	364	sprintf(perc_str, "%3.1f%% done", perc);
cac58fd5	365	}
0721d11e	366
d6978a32 JA	367	rate_str[0] = num2str(rate[0], 5, 10, i2p);
d6978a32 JA	368	rate_str[1] = num2str(rate[1], 5, 10, i2p);
d1bd7213	369
adb02ba8 JA	370	iops_str[0] = num2str(iops[0], 4, 1, 0);
	371	iops_str[1] = num2str(iops[1], 4, 1, 0);
	372
d1bd7213	373	l = printf(": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]",
0b9d69ec	374	run_str, perc_str, rate_str[0], rate_str[1],
adb02ba8 JA	375	iops_str[0], iops_str[1], eta_str);
	376	if (l >= 0 && l < linelen_last)
	377	printf("%*s", linelen_last - l, "");
	378	linelen_last = l;
d1bd7213 JA	379
	380	free(rate_str[0]);
	381	free(rate_str[1]);
adb02ba8 JA	382	free(iops_str[0]);
adb02ba8 JA	383	free(iops_str[1]);
263e529f JA	384	}
	385	printf("\r");
	386	fflush(stdout);
263e529f JA	387	}
	388
	389	void print_status_init(int thread_number)
	390	{
	391	run_str[thread_number] = 'P';
	392	}