[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:
		if (td->error)
			c = 'X';
		else if (td->sig)
			c = 'K';
		else
			c = '_';
		break;
	case TD_EXITED:
		c = 'E';
		break;
	case TD_RAMP:
		c = '/';
		break;
	case TD_RUNNING:
		if (td_rw(td)) {
			if (td_random(td)) {
				if (td->o.rwmix[DDIR_READ] == 100)
					c = 'r';
				else if (td->o.rwmix[DDIR_WRITE] == 100)
					c = 'w';
				else
					c = 'm';
			} else {
				if (td->o.rwmix[DDIR_READ] == 100)
					c = 'R';
				else if (td->o.rwmix[DDIR_WRITE] == 100)
					c = 'W';
				else
					c = 'M';
			}
		} else if (td_read(td)) {
			if (td_random(td))
				c = 'r';
			else
				c = 'R';
		} else if (td_write(td)) {
			if (td_random(td))
				c = 'w';
			else
				c = 'W';
		} else {
			if (td_random(td))
				c = 'd';
			else
				c = 'D';
		}
		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:
	case TD_SETTING_UP:
		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 and verifying afterwards, bytes_total will be twice the
	 * size. In a mixed workload, verify phase will be the size of the
	 * first stage writes.
	 */
	if (td->o.do_verify && td->o.verify && td_write(td)) {
		if (td_rw(td)) {
			unsigned int perc = 50;

			if (td->o.rwmix[DDIR_WRITE])
				perc = td->o.rwmix[DDIR_WRITE];

			bytes_total += (bytes_total * perc) / 100;
		} 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 = ddir_rw_sum(td->io_bytes);
		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;
		unsigned long long rate_bytes;

		/*
		 * 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;
			}
		}
		rate_bytes = ddir_rw_sum(td->o.rate);
		if (rate_bytes) {
			r_eta = (bytes_total / 1024) / rate_bytes;
			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(int unified_rw_rep, unsigned long mtime,
		      unsigned long long *io_bytes,
		      unsigned long long *prev_io_bytes, unsigned int *rate)
{
	int i;

	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
		unsigned long long diff;

		diff = io_bytes[i] - prev_io_bytes[i];
		if (unified_rw_rep) {
			rate[i] = 0;
			rate[0] += ((1000 * diff) / mtime) / 1024;
		} else
			rate[i] = ((1000 * diff) / mtime) / 1024;

		prev_io_bytes[i] = io_bytes[i];
	}
}

static void calc_iops(int unified_rw_rep, unsigned long mtime,
		      unsigned long long *io_iops,
		      unsigned long long *prev_io_iops, unsigned int *iops)
{
	int i;

	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
		unsigned long long diff;

		diff = io_iops[i] - prev_io_iops[i];
		if (unified_rw_rep) {
			iops[i] = 0;
			iops[0] += (diff * 1000) / mtime;
		} else
			iops[i] = (diff * 1000) / mtime;

		prev_io_iops[i] = io_iops[i];
	}
}

/*
 * Print status of the jobs we know about. This includes rate estimates,
 * ETA, thread state, etc.
 */
int calc_thread_status(struct jobs_eta *je, int force)
{
	struct thread_data *td;
	int i, unified_rw_rep;
	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs;
	unsigned long long io_bytes[DDIR_RWDIR_CNT];
	unsigned long long io_iops[DDIR_RWDIR_CNT];
	struct timeval now;

	static unsigned long long rate_io_bytes[DDIR_RWDIR_CNT];
	static unsigned long long disp_io_bytes[DDIR_RWDIR_CNT];
	static unsigned long long disp_io_iops[DDIR_RWDIR_CNT];
	static struct timeval rate_prev_time, disp_prev_time;

	if (!force) {
		if (output_format != FIO_OUTPUT_NORMAL &&
		    f_out == stdout)
			return 0;
		if (temp_stall_ts || eta_print == FIO_ETA_NEVER)
			return 0;

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

	if (!ddir_rw_sum(rate_io_bytes))
		fill_start_time(&rate_prev_time);
	if (!ddir_rw_sum(disp_io_bytes))
		fill_start_time(&disp_prev_time);

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

	je->elapsed_sec = (mtime_since_genesis() + 999) / 1000;

	io_bytes[DDIR_READ] = io_bytes[DDIR_WRITE] = io_bytes[DDIR_TRIM] = 0;
	io_iops[DDIR_READ] = io_iops[DDIR_WRITE] = io_iops[DDIR_TRIM] = 0;
	bw_avg_time = ULONG_MAX;
	unified_rw_rep = 0;
	for_each_td(td, i) {
		unified_rw_rep += td->o.unified_rw_rep;
		if (is_power_of_2(td->o.kb_base))
			je->is_pow2 = 1;
		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) {
			je->nr_running++;
			if (td_read(td)) {
				je->t_rate += td->o.rate[DDIR_READ];
				je->t_iops += td->o.rate_iops[DDIR_READ];
				je->m_rate += td->o.ratemin[DDIR_READ];
				je->m_iops += td->o.rate_iops_min[DDIR_READ];
			}
			if (td_write(td)) {
				je->t_rate += td->o.rate[DDIR_WRITE];
				je->t_iops += td->o.rate_iops[DDIR_WRITE];
				je->m_rate += td->o.ratemin[DDIR_WRITE];
				je->m_iops += td->o.rate_iops_min[DDIR_WRITE];
			}
			if (td_trim(td)) {
				je->t_rate += td->o.rate[DDIR_TRIM];
				je->t_iops += td->o.rate_iops[DDIR_TRIM];
				je->m_rate += td->o.ratemin[DDIR_TRIM];
				je->m_iops += td->o.rate_iops_min[DDIR_TRIM];
			}

			je->files_open += td->nr_open_files;
		} else if (td->runstate == TD_RAMP) {
			je->nr_running++;
			je->nr_ramp++;
		} else if (td->runstate == TD_SETTING_UP)
			je->nr_running++;
		else if (td->runstate < TD_RUNNING)
			je->nr_pending++;

		if (je->elapsed_sec >= 3)
			eta_secs[i] = thread_eta(td);
		else
			eta_secs[i] = INT_MAX;

		check_str_update(td);

		if (td->runstate > TD_RAMP) {
			int ddir;

			for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
				if (unified_rw_rep) {
					io_bytes[0] += td->io_bytes[ddir];
					io_iops[0] += td->io_blocks[ddir];
				} else {
					io_bytes[ddir] += td->io_bytes[ddir];
					io_iops[ddir] += td->io_blocks[ddir];
				}
			}
		}
	}

	if (exitall_on_terminate)
		je->eta_sec = INT_MAX;
	else
		je->eta_sec = 0;

	for_each_td(td, i) {
		if (exitall_on_terminate) {
			if (eta_secs[i] < je->eta_sec)
				je->eta_sec = eta_secs[i];
		} else {
			if (eta_secs[i] > je->eta_sec)
				je->eta_sec = eta_secs[i];
		}
	}

	free(eta_secs);

	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(unified_rw_rep, rate_time, io_bytes, rate_io_bytes,
				je->rate);
		memcpy(&rate_prev_time, &now, sizeof(now));
		add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0);
		add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0);
		add_agg_sample(je->rate[DDIR_TRIM], DDIR_TRIM, 0);
	}

	disp_time = mtime_since(&disp_prev_time, &now);

	/*
	 * Allow a little slack, the target is to print it every 1000 msecs
	 */
	if (!force && disp_time < 900)
		return 0;

	calc_rate(unified_rw_rep, disp_time, io_bytes, disp_io_bytes, je->rate);
	calc_iops(unified_rw_rep, disp_time, io_iops, disp_io_iops, je->iops);

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

	if (!force && !je->nr_running && !je->nr_pending)
		return 0;

	je->nr_threads = thread_number;
	memcpy(je->run_str, run_str, thread_number * sizeof(char));

	return 1;
}

void display_thread_status(struct jobs_eta *je)
{
	static int linelen_last;
	static int eta_good;
	char output[REAL_MAX_JOBS + 512], *p = output;
	char eta_str[128];
	double perc = 0.0;

	if (je->eta_sec != INT_MAX && je->elapsed_sec) {
		perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec);
		eta_to_str(eta_str, je->eta_sec);
	}

	p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open);
	if (je->m_rate || je->t_rate) {
		char *tr, *mr;

		mr = num2str(je->m_rate, 4, 0, je->is_pow2);
		tr = num2str(je->t_rate, 4, 0, je->is_pow2);
		p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
		free(tr);
		free(mr);
	} else if (je->m_iops || je->t_iops)
		p += sprintf(p, ", CR=%d/%d IOPS", je->t_iops, je->m_iops);
	if (je->eta_sec != INT_MAX && je->nr_running) {
		char perc_str[32];
		char *iops_str[DDIR_RWDIR_CNT];
		char *rate_str[DDIR_RWDIR_CNT];
		size_t left;
		int l;
		int ddir;

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

		for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
			rate_str[ddir] = num2str(je->rate[ddir], 5,
						1024, je->is_pow2);
			iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0);
		}

		left = sizeof(output) - (p - output) - 1;

		l = snprintf(p, left, ": [%s] [%s] [%s/%s/%s /s] [%s/%s/%s iops] [eta %s]",
				je->run_str, perc_str, rate_str[DDIR_READ],
				rate_str[DDIR_WRITE], rate_str[DDIR_TRIM],
				iops_str[DDIR_READ], iops_str[DDIR_WRITE],
				iops_str[DDIR_TRIM], eta_str);
		p += l;
		if (l >= 0 && l < linelen_last)
			p += sprintf(p, "%*s", linelen_last - l, "");
		linelen_last = l;

		for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
			free(rate_str[ddir]);
			free(iops_str[ddir]);
		}
	}
	p += sprintf(p, "\r");

	printf("%s", output);
	fflush(stdout);
}

void print_thread_status(void)
{
	struct jobs_eta *je;
	size_t size;

	if (!thread_number)
		return;

	size = sizeof(*je) + thread_number * sizeof(char) + 1;
	je = malloc(size);
	memset(je, 0, size);

	if (calc_thread_status(je, 0))
		display_thread_status(je);

	free(je);
}

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