[fio.git] / eta.c

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

#include "fio.h"

static char run_str[REAL_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 +
					td->o.ramp_time;

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

				ramp_left = mtime_since_now(&td->epoch);
				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);

	/*
	 * Allow a little slack, the target is to print it every 1000 msecs
	 */
	if (disp_time < 900)
		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 thr_number)
{
	run_str[thr_number] = 'P';
}
Commit	Line	Data
	1	/*
	2	* Status and ETA code
	3	*/
	4	#include <unistd.h>
	5	#include <fcntl.h>
	6	#include <string.h>
	7
	8	#include "fio.h"
	9
	10	static char run_str[REAL_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) {
	20	case TD_REAPED:
	21	c = '_';
	22	break;
	23	case TD_EXITED:
	24	c = 'E';
	25	break;
	26	case TD_RAMP:
	27	c = '/';
	28	break;
	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;
	47	case TD_PRE_READING:
	48	c = 'p';
	49	break;
	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);
	67	}
	68
	69	run_str[td->thread_number - 1] = c;
	70	}
	71
	72	/*
	73	* Convert seconds to a printable string.
	74	*/
	75	static void eta_to_str(char *str, unsigned long eta_sec)
	76	{
	77	unsigned int d, h, m, s;
	78	int disp_hour = 0;
	79
	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
	88	if (d) {
	89	disp_hour = 1;
	90	str += sprintf(str, "%02ud:", d);
	91	}
	92
	93	if (h \|\| disp_hour)
	94	str += sprintf(str, "%02uh:", h);
	95
	96	str += sprintf(str, "%02um:", m);
	97	str += sprintf(str, "%02us", s);
	98	}
	99
	100	/*
	101	* Best effort calculation of the estimated pending runtime of a job.
	102	*/
	103	static int thread_eta(struct thread_data *td)
	104	{
	105	unsigned long long bytes_total, bytes_done;
	106	unsigned long eta_sec = 0;
	107	unsigned long elapsed;
	108
	109	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
	110
	111	bytes_total = td->total_io_size;
	112
	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
	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	*/
	124	if (td->o.do_verify && td->o.verify && td_write(td)) {
	125	if (td_rw(td))
	126	bytes_total = bytes_total * 3 / 2;
	127	else
	128	bytes_total <<= 1;
	129	}
	130
	131	if (td->o.zone_size && td->o.zone_skip)
	132	bytes_total /= (td->o.zone_skip / td->o.zone_size);
	133
	134	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING) {
	135	double perc, perc_t;
	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
	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
	148	eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;
	149
	150	if (td->o.timeout &&
	151	eta_sec > (td->o.timeout + done_secs - elapsed))
	152	eta_sec = td->o.timeout + done_secs - elapsed;
	153	} else if (td->runstate == TD_NOT_CREATED \|\| td->runstate == TD_CREATED
	154	\|\| td->runstate == TD_INITIALIZED
	155	\|\| td->runstate == TD_RAMP
	156	\|\| td->runstate == TD_PRE_READING) {
	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	*/
	163	if (td->o.timeout) {
	164	t_eta = td->o.timeout + td->o.start_delay +
	165	td->o.ramp_time;
	166
	167	if (in_ramp_time(td)) {
	168	unsigned long ramp_left;
	169
	170	ramp_left = mtime_since_now(&td->epoch);
	171	ramp_left = (ramp_left + 999) / 1000;
	172	if (ramp_left <= t_eta)
	173	t_eta -= ramp_left;
	174	}
	175	}
	176	if (td->o.rate[0] \|\| td->o.rate[1]) {
	177	r_eta = (bytes_total / 1024) /
	178	(td->o.rate[0] + td->o.rate[1]);
	179	r_eta += td->o.start_delay;
	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
	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	}
	208
	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
	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	{
	224	unsigned long elapsed = (mtime_since_genesis() + 999) / 1000;
	225	int i, nr_ramp, nr_running, nr_pending, t_rate, m_rate;
	226	int t_iops, m_iops, files_open;
	227	struct thread_data *td;
	228	char eta_str[128];
	229	double perc = 0.0;
	230	unsigned long long io_bytes[2], io_iops[2];
	231	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs, eta_sec;
	232	struct timeval now;
	233
	234	static unsigned long long rate_io_bytes[2];
	235	static unsigned long long disp_io_bytes[2];
	236	static unsigned long long disp_io_iops[2];
	237	static struct timeval rate_prev_time, disp_prev_time;
	238	static unsigned int rate[2], iops[2];
	239	static int linelen_last;
	240	static int eta_good;
	241	int i2p = 0;
	242
	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))
	247	return;
	248
	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);
	253
	254	eta_secs = malloc(thread_number * sizeof(unsigned long));
	255	memset(eta_secs, 0, thread_number * sizeof(unsigned long));
	256
	257	io_bytes[0] = io_bytes[1] = 0;
	258	io_iops[0] = io_iops[1] = 0;
	259	nr_pending = nr_running = t_rate = m_rate = t_iops = m_iops = 0;
	260	nr_ramp = 0;
	261	bw_avg_time = ULONG_MAX;
	262	files_open = 0;
	263	for_each_td(td, i) {
	264	if (td->o.bw_avg_time < bw_avg_time)
	265	bw_avg_time = td->o.bw_avg_time;
	266	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING
	267	\|\| td->runstate == TD_FSYNCING
	268	\|\| td->runstate == TD_PRE_READING) {
	269	nr_running++;
	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];
	273	m_iops += td->o.rate_iops_min[0] +
	274	td->o.rate_iops_min[1];
	275	files_open += td->nr_open_files;
	276	} else if (td->runstate == TD_RAMP) {
	277	nr_running++;
	278	nr_ramp++;
	279	} else if (td->runstate < TD_RUNNING)
	280	nr_pending++;
	281
	282	if (elapsed >= 3)
	283	eta_secs[i] = thread_eta(td);
	284	else
	285	eta_secs[i] = INT_MAX;
	286
	287	check_str_update(td);
	288
	289	if (td->runstate > TD_RAMP) {
	290	io_bytes[0] += td->io_bytes[0];
	291	io_bytes[1] += td->io_bytes[1];
	292	io_iops[0] += td->io_blocks[0];
	293	io_iops[1] += td->io_blocks[1];
	294	}
	295	}
	296
	297	if (exitall_on_terminate)
	298	eta_sec = INT_MAX;
	299	else
	300	eta_sec = 0;
	301
	302	for_each_td(td, i) {
	303	if (!i2p && is_power_of_2(td->o.kb_base))
	304	i2p = 1;
	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	}
	312	}
	313
	314	free(eta_secs);
	315
	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
	321	fio_gettime(&now, NULL);
	322	rate_time = mtime_since(&rate_prev_time, &now);
	323
	324	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
	325	calc_rate(rate_time, io_bytes, rate_io_bytes, rate);
	326	memcpy(&rate_prev_time, &now, sizeof(now));
	327	add_agg_sample(rate[DDIR_READ], DDIR_READ, 0);
	328	add_agg_sample(rate[DDIR_WRITE], DDIR_WRITE, 0);
	329	}
	330
	331	disp_time = mtime_since(&disp_prev_time, &now);
	332
	333	/*
	334	* Allow a little slack, the target is to print it every 1000 msecs
	335	*/
	336	if (disp_time < 900)
	337	return;
	338
	339	calc_rate(disp_time, io_bytes, disp_io_bytes, rate);
	340	calc_iops(disp_time, io_iops, disp_io_iops, iops);
	341
	342	memcpy(&disp_prev_time, &now, sizeof(now));
	343
	344	if (!nr_running && !nr_pending)
	345	return;
	346
	347	printf("Jobs: %d (f=%d)", nr_running, files_open);
	348	if (m_rate \|\| t_rate) {
	349	char tr, mr;
	350
	351	mr = num2str(m_rate, 4, 0, i2p);
	352	tr = num2str(t_rate, 4, 0, i2p);
	353	printf(", CR=%s/%s KB/s", tr, mr);
	354	free(tr);
	355	free(mr);
	356	} else if (m_iops \|\| t_iops)
	357	printf(", CR=%d/%d IOPS", t_iops, m_iops);
	358	if (eta_sec != INT_MAX && nr_running) {
	359	char perc_str[32];
	360	char *iops_str[2];
	361	char *rate_str[2];
	362	int l;
	363
	364	if ((!eta_sec && !eta_good) \|\| nr_ramp == nr_running)
	365	strcpy(perc_str, "-.-% done");
	366	else {
	367	eta_good = 1;
	368	perc *= 100.0;
	369	sprintf(perc_str, "%3.1f%% done", perc);
	370	}
	371
	372	rate_str[0] = num2str(rate[0], 5, 10, i2p);
	373	rate_str[1] = num2str(rate[1], 5, 10, i2p);
	374
	375	iops_str[0] = num2str(iops[0], 4, 1, 0);
	376	iops_str[1] = num2str(iops[1], 4, 1, 0);
	377
	378	l = printf(": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]",
	379	run_str, perc_str, rate_str[0], rate_str[1],
	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;
	384
	385	free(rate_str[0]);
	386	free(rate_str[1]);
	387	free(iops_str[0]);
	388	free(iops_str[1]);
	389	}
	390	printf("\r");
	391	fflush(stdout);
	392	}
	393
	394	void print_status_init(int thr_number)
	395	{
	396	run_str[thr_number] = 'P';
	397	}