[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];

/*
 * Worst level condensing would be 1:5, so allow enough room for that
 */
static char run_str[__THREAD_RUNSTR_SZ(REAL_MAX_JOBS)];

static void update_condensed_str(char *run_str, char *run_str_condensed)
{
	int i, ci, last, nr;
	size_t len;

	len = strlen(run_str);
	if (!len)
		return;

	last = 0;
	nr = 0;
	ci = 0;
	for (i = 0; i < len; i++) {
		if (!last) {
new:
			run_str_condensed[ci] = run_str[i];
			last = run_str[i];
			nr = 1;
			ci++;
		} else if (last == run_str[i]) {
			nr++;
		} else {
			ci += sprintf(&run_str_condensed[ci], "(%u),", nr);
			goto new;
		}
	}

	if (nr)
		ci += sprintf(&run_str_condensed[ci], "(%u)", nr);

	run_str_condensed[ci + 1] = '\0';
}

/*
 * 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_FINISHING:
		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;
	update_condensed_str(__run_str, run_str);
}

/*
 * Convert seconds to a printable string.
 */
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;
	uint64_t timeout;

	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
	timeout = td->o.timeout / 1000000UL;

	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 (td->o.zone_size && td->o.zone_skip && bytes_total) {
		unsigned int nr_zones;
		uint64_t zone_bytes;

		zone_bytes = bytes_total + td->o.zone_size + td->o.zone_skip;
		nr_zones = (zone_bytes - 1) / (td->o.zone_size + td->o.zone_skip);
		bytes_total -= nr_zones * td->o.zone_skip;
	}

	/*
	 * 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->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) {
		double perc, perc_t;

		bytes_done = ddir_rw_sum(td->io_bytes);

		if (bytes_total) {
			perc = (double) bytes_done / (double) bytes_total;
			if (perc > 1.0)
				perc = 1.0;
		} else
			perc = 0.0;

		if (td->o.time_based) {
			if (timeout) {
				perc_t = (double) elapsed / (double) timeout;
				if (perc_t < perc)
					perc = perc_t;
			} else {
				/*
				 * Will never hit, we can't have time_based
				 * without a timeout set.
				 */
				perc = 0.0;
			}
		}

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

		if (td->o.timeout &&
		    eta_sec > (timeout + done_secs - elapsed))
			eta_sec = timeout + done_secs - elapsed;
	} else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED
			|| td->runstate == TD_INITIALIZED
			|| td->runstate == TD_SETTING_UP
			|| 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) {
			uint64_t timeout = td->o.timeout;
			uint64_t start_delay = td->o.start_delay;
			uint64_t ramp_time = td->o.ramp_time;

			t_eta = timeout + start_delay + ramp_time;
			t_eta /= 1000000ULL;

			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 / 1000000ULL);
		}

		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;
		je->unit_base = td->o.unit_base;
		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
		    || td->runstate == TD_FINISHING) {
			je->nr_running++;
			if (td_read(td)) {
				je->t_rate[0] += td->o.rate[DDIR_READ];
				je->t_iops[0] += td->o.rate_iops[DDIR_READ];
				je->m_rate[0] += td->o.ratemin[DDIR_READ];
				je->m_iops[0] += td->o.rate_iops_min[DDIR_READ];
			}
			if (td_write(td)) {
				je->t_rate[1] += td->o.rate[DDIR_WRITE];
				je->t_iops[1] += td->o.rate_iops[DDIR_WRITE];
				je->m_rate[1] += td->o.ratemin[DDIR_WRITE];
				je->m_iops[1] += td->o.rate_iops_min[DDIR_WRITE];
			}
			if (td_trim(td)) {
				je->t_rate[2] += td->o.rate[DDIR_TRIM];
				je->t_iops[2] += td->o.rate_iops[DDIR_TRIM];
				je->m_rate[2] += td->o.ratemin[DDIR_TRIM];
				je->m_iops[2] += 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++;
			je->nr_setting_up++;
		} 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_SETTING_UP) {
			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;
	update_condensed_str(__run_str, run_str);
	memcpy(je->run_str, run_str, strlen(run_str));
	return 1;
}

void display_thread_status(struct jobs_eta *je)
{
	static struct timeval disp_eta_new_line;
	static int eta_new_line_init, eta_new_line_pending;
	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);
	}

	if (eta_new_line_pending) {
		eta_new_line_pending = 0;
		p += sprintf(p, "\n");
	}

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

		mr = num2str(je->m_rate[0] + je->m_rate[1], 4, 0, je->is_pow2, 8);
		tr = num2str(je->t_rate[0] + je->t_rate[1], 4, 0, je->is_pow2, 8);
		p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
		free(tr);
		free(mr);
	} else if (je->m_iops[0] || je->m_iops[1] || je->t_iops[0] || je->t_iops[1]) {
		p += sprintf(p, ", CR=%d/%d IOPS",
					je->t_iops[0] + je->t_iops[1],
					je->m_iops[0] + je->m_iops[1]);
	}
	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 {
			double mult = 100.0;

			if (je->nr_setting_up && je->nr_running)
				mult *= (1.0 - (double) je->nr_setting_up / (double) je->nr_running);

			eta_good = 1;
			perc *= mult;
			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, je->unit_base);
			iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0, 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);

	if (!eta_new_line_init) {
		fio_gettime(&disp_eta_new_line, NULL);
		eta_new_line_init = 1;
	} else if (eta_new_line &&
		   mtime_since_now(&disp_eta_new_line) > eta_new_line * 1000) {
		fio_gettime(&disp_eta_new_line, NULL);
		eta_new_line_pending = 1;
	}

	fflush(stdout);
}

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

	if (!thread_number)
		return;

	size = sizeof(*je) + THREAD_RUNSTR_SZ;
	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';
	update_condensed_str(__run_str, run_str);
}
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
3e2e48a7 JA	10	static char __run_str[REAL_MAX_JOBS + 1];
	11
	12	/*
11155857	13	* Worst level condensing would be 1:5, so allow enough room for that
3e2e48a7	14	*/
11155857	15	static char run_str[__THREAD_RUNSTR_SZ(REAL_MAX_JOBS)];
3e2e48a7 JA	16
	17	static void update_condensed_str(char run_str, char run_str_condensed)
	18	{
	19	int i, ci, last, nr;
	20	size_t len;
	21
	22	len = strlen(run_str);
	23	if (!len)
	24	return;
	25
	26	last = 0;
	27	nr = 0;
	28	ci = 0;
	29	for (i = 0; i < len; i++) {
	30	if (!last) {
	31	new:
	32	run_str_condensed[ci] = run_str[i];
	33	last = run_str[i];
	34	nr = 1;
	35	ci++;
	36	} else if (last == run_str[i]) {
	37	nr++;
	38	} else {
6c784104	39	ci += sprintf(&run_str_condensed[ci], "(%u),", nr);
3e2e48a7 JA	40	goto new;
	41	}
	42	}
	43
	44	if (nr)
6c784104	45	ci += sprintf(&run_str_condensed[ci], "(%u)", nr);
3e2e48a7	46
6c784104 JA	47	run_str_condensed[ci + 1] = '\0';
6c784104 JA	48	}
263e529f JA	49
	50	/*
	51	* Sets the status of the 'td' in the printed status map.
	52	*/
	53	static void check_str_update(struct thread_data *td)
	54	{
3e2e48a7	55	char c = __run_str[td->thread_number - 1];
263e529f JA	56
263e529f JA	57	switch (td->runstate) {
5ec10eaa	58	case TD_REAPED:
4f7e57a4 JA	59	if (td->error)
4f7e57a4 JA	60	c = 'X';
a5e371a6 JA	61	else if (td->sig)
a5e371a6 JA	62	c = 'K';
4f7e57a4 JA	63	else
4f7e57a4 JA	64	c = '_';
5ec10eaa JA	65	break;
	66	case TD_EXITED:
	67	c = 'E';
	68	break;
b29ee5b3 JA	69	case TD_RAMP:
	70	c = '/';
	71	break;
5ec10eaa JA	72	case TD_RUNNING:
5ec10eaa JA	73	if (td_rw(td)) {
e3b3f81e JA	74	if (td_random(td)) {
	75	if (td->o.rwmix[DDIR_READ] == 100)
	76	c = 'r';
	77	else if (td->o.rwmix[DDIR_WRITE] == 100)
	78	c = 'w';
	79	else
	80	c = 'm';
	81	} else {
	82	if (td->o.rwmix[DDIR_READ] == 100)
	83	c = 'R';
	84	else if (td->o.rwmix[DDIR_WRITE] == 100)
	85	c = 'W';
	86	else
	87	c = 'M';
	88	}
5ec10eaa JA	89	} else if (td_read(td)) {
	90	if (td_random(td))
	91	c = 'r';
	92	else
	93	c = 'R';
6eaf09d6	94	} else if (td_write(td)) {
5ec10eaa JA	95	if (td_random(td))
	96	c = 'w';
	97	else
	98	c = 'W';
6eaf09d6 SL	99	} else {
	100	if (td_random(td))
	101	c = 'd';
	102	else
	103	c = 'D';
5ec10eaa JA	104	}
5ec10eaa JA	105	break;
b0f65863 JA	106	case TD_PRE_READING:
	107	c = 'p';
	108	break;
5ec10eaa JA	109	case TD_VERIFYING:
	110	c = 'V';
	111	break;
	112	case TD_FSYNCING:
	113	c = 'F';
	114	break;
3d434057 JA	115	case TD_FINISHING:
	116	c = 'f';
	117	break;
5ec10eaa JA	118	case TD_CREATED:
	119	c = 'C';
	120	break;
	121	case TD_INITIALIZED:
9c6f6316	122	case TD_SETTING_UP:
5ec10eaa JA	123	c = 'I';
	124	break;
	125	case TD_NOT_CREATED:
	126	c = 'P';
	127	break;
	128	default:
	129	log_err("state %d\n", td->runstate);
263e529f JA	130	}
263e529f JA	131
3e2e48a7 JA	132	__run_str[td->thread_number - 1] = c;
3e2e48a7 JA	133	update_condensed_str(__run_str, run_str);
263e529f JA	134	}
	135
	136	/*
	137	* Convert seconds to a printable string.
	138	*/
3e47bd25	139	void eta_to_str(char *str, unsigned long eta_sec)
263e529f JA	140	{
263e529f JA	141	unsigned int d, h, m, s;
165faf16	142	int disp_hour = 0;
263e529f	143
263e529f JA	144	s = eta_sec % 60;
	145	eta_sec /= 60;
	146	m = eta_sec % 60;
	147	eta_sec /= 60;
	148	h = eta_sec % 24;
	149	eta_sec /= 24;
	150	d = eta_sec;
	151
165faf16 JA	152	if (d) {
165faf16 JA	153	disp_hour = 1;
1e97cce9	154	str += sprintf(str, "%02ud:", d);
263e529f	155	}
165faf16 JA	156
165faf16 JA	157	if (h \|\| disp_hour)
1e97cce9	158	str += sprintf(str, "%02uh:", h);
263e529f	159
1e97cce9 JA	160	str += sprintf(str, "%02um:", m);
1e97cce9 JA	161	str += sprintf(str, "%02us", s);
263e529f JA	162	}
	163
	164	/*
	165	* Best effort calculation of the estimated pending runtime of a job.
	166	*/
b29ee5b3	167	static int thread_eta(struct thread_data *td)
263e529f JA	168	{
263e529f JA	169	unsigned long long bytes_total, bytes_done;
1e97cce9	170	unsigned long eta_sec = 0;
b29ee5b3	171	unsigned long elapsed;
0de5b26f	172	uint64_t timeout;
b29ee5b3 JA	173
b29ee5b3 JA	174	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
0de5b26f	175	timeout = td->o.timeout / 1000000UL;
263e529f JA	176
	177	bytes_total = td->total_io_size;
	178
2e3bd4c2 JA	179	if (td->o.fill_device && td->o.size == -1ULL) {
	180	if (!td->fill_device_size \|\| td->fill_device_size == -1ULL)
	181	return 0;
	182
	183	bytes_total = td->fill_device_size;
	184	}
	185
0d73a2f9 JA	186	if (td->o.zone_size && td->o.zone_skip && bytes_total) {
	187	unsigned int nr_zones;
	188	uint64_t zone_bytes;
	189
	190	zone_bytes = bytes_total + td->o.zone_size + td->o.zone_skip;
	191	nr_zones = (zone_bytes - 1) / (td->o.zone_size + td->o.zone_skip);
	192	bytes_total -= nr_zones * td->o.zone_skip;
	193	}
	194
74939e38	195	/*
165eb050 JA	196	* if writing and verifying afterwards, bytes_total will be twice the
	197	* size. In a mixed workload, verify phase will be the size of the
	198	* first stage writes.
74939e38	199	*/
0dd8377f	200	if (td->o.do_verify && td->o.verify && td_write(td)) {
165eb050 JA	201	if (td_rw(td)) {
	202	unsigned int perc = 50;
	203
	204	if (td->o.rwmix[DDIR_WRITE])
	205	perc = td->o.rwmix[DDIR_WRITE];
	206
	207	bytes_total += (bytes_total * perc) / 100;
	208	} else
74939e38 JA	209	bytes_total <<= 1;
	210	}
	211
263e529f	212	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING) {
cf4464ca	213	double perc, perc_t;
263e529f	214
342f4be4	215	bytes_done = ddir_rw_sum(td->io_bytes);
476882d7 JA	216
	217	if (bytes_total) {
	218	perc = (double) bytes_done / (double) bytes_total;
	219	if (perc > 1.0)
	220	perc = 1.0;
	221	} else
	222	perc = 0.0;
263e529f	223
cf4464ca	224	if (td->o.time_based) {
476882d7 JA	225	if (timeout) {
	226	perc_t = (double) elapsed / (double) timeout;
	227	if (perc_t < perc)
	228	perc = perc_t;
	229	} else {
	230	/*
	231	* Will never hit, we can't have time_based
	232	* without a timeout set.
	233	*/
	234	perc = 0.0;
	235	}
cf4464ca JA	236	}
cf4464ca JA	237
1e97cce9	238	eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;
263e529f	239
d3eeeabc	240	if (td->o.timeout &&
0de5b26f JA	241	eta_sec > (timeout + done_secs - elapsed))
0de5b26f JA	242	eta_sec = timeout + done_secs - elapsed;
263e529f	243	} else if (td->runstate == TD_NOT_CREATED \|\| td->runstate == TD_CREATED
b29ee5b3	244	\|\| td->runstate == TD_INITIALIZED
714e85f3	245	\|\| td->runstate == TD_SETTING_UP
b0f65863 JA	246	\|\| td->runstate == TD_RAMP
b0f65863 JA	247	\|\| td->runstate == TD_PRE_READING) {
263e529f	248	int t_eta = 0, r_eta = 0;
342f4be4	249	unsigned long long rate_bytes;
263e529f JA	250
	251	/*
	252	* We can only guess - assume it'll run the full timeout
	253	* if given, otherwise assume it'll run at the specified rate.
	254	*/
b29ee5b3	255	if (td->o.timeout) {
0de5b26f JA	256	uint64_t timeout = td->o.timeout;
	257	uint64_t start_delay = td->o.start_delay;
	258	uint64_t ramp_time = td->o.ramp_time;
	259
	260	t_eta = timeout + start_delay + ramp_time;
	261	t_eta /= 1000000ULL;
b29ee5b3 JA	262
	263	if (in_ramp_time(td)) {
	264	unsigned long ramp_left;
	265
cda99fa0	266	ramp_left = mtime_since_now(&td->epoch);
b29ee5b3 JA	267	ramp_left = (ramp_left + 999) / 1000;
	268	if (ramp_left <= t_eta)
	269	t_eta -= ramp_left;
	270	}
	271	}
342f4be4 JA	272	rate_bytes = ddir_rw_sum(td->o.rate);
	273	if (rate_bytes) {
	274	r_eta = (bytes_total / 1024) / rate_bytes;
0de5b26f	275	r_eta += (td->o.start_delay / 1000000ULL);
263e529f JA	276	}
	277
	278	if (r_eta && t_eta)
	279	eta_sec = min(r_eta, t_eta);
	280	else if (r_eta)
	281	eta_sec = r_eta;
	282	else if (t_eta)
	283	eta_sec = t_eta;
	284	else
	285	eta_sec = 0;
	286	} else {
	287	/*
	288	* thread is already done or waiting for fsync
	289	*/
	290	eta_sec = 0;
	291	}
	292
	293	return eta_sec;
	294	}
	295
771e58be JA	296	static void calc_rate(int unified_rw_rep, unsigned long mtime,
771e58be JA	297	unsigned long long *io_bytes,
46fda8d0 JA	298	unsigned long long prev_io_bytes, unsigned int rate)
46fda8d0 JA	299	{
b7f05eb0 JA	300	int i;
b7f05eb0 JA	301
6eaf09d6	302	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
b7f05eb0 JA	303	unsigned long long diff;
	304
	305	diff = io_bytes[i] - prev_io_bytes[i];
771e58be JA	306	if (unified_rw_rep) {
	307	rate[i] = 0;
	308	rate[0] += ((1000 * diff) / mtime) / 1024;
	309	} else
	310	rate[i] = ((1000 * diff) / mtime) / 1024;
6eaf09d6 SL	311
6eaf09d6 SL	312	prev_io_bytes[i] = io_bytes[i];
b7f05eb0	313	}
46fda8d0	314	}
5ec10eaa	315
771e58be JA	316	static void calc_iops(int unified_rw_rep, unsigned long mtime,
771e58be JA	317	unsigned long long *io_iops,
adb02ba8 JA	318	unsigned long long prev_io_iops, unsigned int iops)
adb02ba8 JA	319	{
6eaf09d6 SL	320	int i;
	321
	322	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
771e58be JA	323	unsigned long long diff;
	324
	325	diff = io_iops[i] - prev_io_iops[i];
	326	if (unified_rw_rep) {
	327	iops[i] = 0;
	328	iops[0] += (diff * 1000) / mtime;
	329	} else
	330	iops[i] = (diff * 1000) / mtime;
	331
6eaf09d6 SL	332	prev_io_iops[i] = io_iops[i];
6eaf09d6 SL	333	}
adb02ba8 JA	334	}
adb02ba8 JA	335
263e529f JA	336	/*
	337	* Print status of the jobs we know about. This includes rate estimates,
	338	* ETA, thread state, etc.
	339	*/
af9c9fb3	340	int calc_thread_status(struct jobs_eta *je, int force)
263e529f	341	{
34572e28	342	struct thread_data *td;
771e58be	343	int i, unified_rw_rep;
b75a394f	344	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs;
6eaf09d6 SL	345	unsigned long long io_bytes[DDIR_RWDIR_CNT];
6eaf09d6 SL	346	unsigned long long io_iops[DDIR_RWDIR_CNT];
46fda8d0 JA	347	struct timeval now;
46fda8d0 JA	348
6eaf09d6 SL	349	static unsigned long long rate_io_bytes[DDIR_RWDIR_CNT];
	350	static unsigned long long disp_io_bytes[DDIR_RWDIR_CNT];
	351	static unsigned long long disp_io_iops[DDIR_RWDIR_CNT];
46fda8d0	352	static struct timeval rate_prev_time, disp_prev_time;
6043c579	353
af9c9fb3	354	if (!force) {
fc47559b JA	355	if (output_format != FIO_OUTPUT_NORMAL &&
fc47559b JA	356	f_out == stdout)
f3afa57e JA	357	return 0;
f3afa57e JA	358	if (temp_stall_ts \|\| eta_print == FIO_ETA_NEVER)
af9c9fb3	359	return 0;
e592a06b	360
af9c9fb3 JA	361	if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
	362	return 0;
	363	}
263e529f	364
342f4be4	365	if (!ddir_rw_sum(rate_io_bytes))
46fda8d0	366	fill_start_time(&rate_prev_time);
342f4be4	367	if (!ddir_rw_sum(disp_io_bytes))
46fda8d0	368	fill_start_time(&disp_prev_time);
6043c579	369
d3eeeabc JA	370	eta_secs = malloc(thread_number * sizeof(unsigned long));
d3eeeabc JA	371	memset(eta_secs, 0, thread_number * sizeof(unsigned long));
263e529f	372
b75a394f JA	373	je->elapsed_sec = (mtime_since_genesis() + 999) / 1000;
b75a394f JA	374
6eaf09d6 SL	375	io_bytes[DDIR_READ] = io_bytes[DDIR_WRITE] = io_bytes[DDIR_TRIM] = 0;
6eaf09d6 SL	376	io_iops[DDIR_READ] = io_iops[DDIR_WRITE] = io_iops[DDIR_TRIM] = 0;
bb3884d8	377	bw_avg_time = ULONG_MAX;
771e58be	378	unified_rw_rep = 0;
34572e28	379	for_each_td(td, i) {
771e58be	380	unified_rw_rep += td->o.unified_rw_rep;
b7f05eb0 JA	381	if (is_power_of_2(td->o.kb_base))
b7f05eb0 JA	382	je->is_pow2 = 1;
ad705bcb	383	je->unit_base = td->o.unit_base;
2dc1bbeb JA	384	if (td->o.bw_avg_time < bw_avg_time)
2dc1bbeb JA	385	bw_avg_time = td->o.bw_avg_time;
46fda8d0	386	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING
b0f65863	387	\|\| td->runstate == TD_FSYNCING
3d434057 JA	388	\|\| td->runstate == TD_PRE_READING
3d434057 JA	389	\|\| td->runstate == TD_FINISHING) {
b75a394f	390	je->nr_running++;
242c38db	391	if (td_read(td)) {
c2e9cc4d JA	392	je->t_rate[0] += td->o.rate[DDIR_READ];
	393	je->t_iops[0] += td->o.rate_iops[DDIR_READ];
	394	je->m_rate[0] += td->o.ratemin[DDIR_READ];
	395	je->m_iops[0] += td->o.rate_iops_min[DDIR_READ];
242c38db JA	396	}
242c38db JA	397	if (td_write(td)) {
c2e9cc4d JA	398	je->t_rate[1] += td->o.rate[DDIR_WRITE];
	399	je->t_iops[1] += td->o.rate_iops[DDIR_WRITE];
	400	je->m_rate[1] += td->o.ratemin[DDIR_WRITE];
	401	je->m_iops[1] += td->o.rate_iops_min[DDIR_WRITE];
242c38db	402	}
6eaf09d6	403	if (td_trim(td)) {
d79db122 JA	404	je->t_rate[2] += td->o.rate[DDIR_TRIM];
	405	je->t_iops[2] += td->o.rate_iops[DDIR_TRIM];
	406	je->m_rate[2] += td->o.ratemin[DDIR_TRIM];
	407	je->m_iops[2] += td->o.rate_iops_min[DDIR_TRIM];
6eaf09d6 SL	408	}
6eaf09d6 SL	409
b75a394f	410	je->files_open += td->nr_open_files;
b29ee5b3	411	} else if (td->runstate == TD_RAMP) {
b75a394f JA	412	je->nr_running++;
b75a394f JA	413	je->nr_ramp++;
714e85f3	414	} else if (td->runstate == TD_SETTING_UP) {
9c6f6316	415	je->nr_running++;
714e85f3 JA	416	je->nr_setting_up++;
714e85f3 JA	417	} else if (td->runstate < TD_RUNNING)
b75a394f	418	je->nr_pending++;
263e529f	419
b75a394f	420	if (je->elapsed_sec >= 3)
b29ee5b3	421	eta_secs[i] = thread_eta(td);
263e529f JA	422	else
	423	eta_secs[i] = INT_MAX;
	424
	425	check_str_update(td);
b29ee5b3	426
714e85f3	427	if (td->runstate > TD_SETTING_UP) {
6eaf09d6	428	int ddir;
771e58be	429
6eaf09d6	430	for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
771e58be JA	431	if (unified_rw_rep) {
	432	io_bytes[0] += td->io_bytes[ddir];
	433	io_iops[0] += td->io_blocks[ddir];
	434	} else {
	435	io_bytes[ddir] += td->io_bytes[ddir];
	436	io_iops[ddir] += td->io_blocks[ddir];
	437	}
6eaf09d6	438	}
b29ee5b3	439	}
263e529f JA	440	}
	441
	442	if (exitall_on_terminate)
b75a394f	443	je->eta_sec = INT_MAX;
263e529f	444	else
b75a394f	445	je->eta_sec = 0;
263e529f	446
34572e28	447	for_each_td(td, i) {
9c5a3854	448	if (exitall_on_terminate) {
b75a394f JA	449	if (eta_secs[i] < je->eta_sec)
b75a394f JA	450	je->eta_sec = eta_secs[i];
9c5a3854	451	} else {
b75a394f JA	452	if (eta_secs[i] > je->eta_sec)
b75a394f JA	453	je->eta_sec = eta_secs[i];
9c5a3854	454	}
263e529f JA	455	}
263e529f JA	456
eecf272f JA	457	free(eta_secs);
eecf272f JA	458
46fda8d0 JA	459	fio_gettime(&now, NULL);
	460	rate_time = mtime_since(&rate_prev_time, &now);
	461
b29ee5b3	462	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
771e58be JA	463	calc_rate(unified_rw_rep, rate_time, io_bytes, rate_io_bytes,
771e58be JA	464	je->rate);
46fda8d0	465	memcpy(&rate_prev_time, &now, sizeof(now));
b75a394f JA	466	add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0);
b75a394f JA	467	add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0);
6eaf09d6	468	add_agg_sample(je->rate[DDIR_TRIM], DDIR_TRIM, 0);
6043c579 JA	469	}
6043c579 JA	470
46fda8d0	471	disp_time = mtime_since(&disp_prev_time, &now);
a5b01f1b JA	472
	473	/*
	474	* Allow a little slack, the target is to print it every 1000 msecs
	475	*/
af9c9fb3	476	if (!force && disp_time < 900)
b75a394f	477	return 0;
46fda8d0	478
771e58be JA	479	calc_rate(unified_rw_rep, disp_time, io_bytes, disp_io_bytes, je->rate);
771e58be JA	480	calc_iops(unified_rw_rep, disp_time, io_iops, disp_io_iops, je->iops);
adb02ba8	481
46fda8d0 JA	482	memcpy(&disp_prev_time, &now, sizeof(now));
46fda8d0 JA	483
af9c9fb3	484	if (!force && !je->nr_running && !je->nr_pending)
b75a394f JA	485	return 0;
b75a394f JA	486
1d1f45ae	487	je->nr_threads = thread_number;
6c784104 JA	488	update_condensed_str(__run_str, run_str);
6c784104 JA	489	memcpy(je->run_str, run_str, strlen(run_str));
b75a394f JA	490	return 1;
	491	}
	492
cf451d1e	493	void display_thread_status(struct jobs_eta *je)
b75a394f	494	{
e382e661 JA	495	static struct timeval disp_eta_new_line;
e382e661 JA	496	static int eta_new_line_init, eta_new_line_pending;
b75a394f JA	497	static int linelen_last;
b75a394f JA	498	static int eta_good;
79074e7c	499	char output[REAL_MAX_JOBS + 512], *p = output;
b75a394f JA	500	char eta_str[128];
b75a394f JA	501	double perc = 0.0;
b75a394f	502
cf451d1e JA	503	if (je->eta_sec != INT_MAX && je->elapsed_sec) {
	504	perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec);
	505	eta_to_str(eta_str, je->eta_sec);
b75a394f JA	506	}
b75a394f JA	507
e382e661 JA	508	if (eta_new_line_pending) {
	509	eta_new_line_pending = 0;
	510	p += sprintf(p, "\n");
	511	}
	512
cf451d1e	513	p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open);
3e47bd25	514	if (je->m_rate[0] \|\| je->m_rate[1] \|\| je->t_rate[0] \|\| je->t_rate[1]) {
581e7141 JA	515	char tr, mr;
581e7141 JA	516
22f80458 JA	517	mr = num2str(je->m_rate[0] + je->m_rate[1], 4, 0, je->is_pow2, 8);
22f80458 JA	518	tr = num2str(je->t_rate[0] + je->t_rate[1], 4, 0, je->is_pow2, 8);
37db14fe	519	p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
581e7141 JA	520	free(tr);
581e7141 JA	521	free(mr);
3e47bd25 JA	522	} else if (je->m_iops[0] \|\| je->m_iops[1] \|\| je->t_iops[0] \|\| je->t_iops[1]) {
	523	p += sprintf(p, ", CR=%d/%d IOPS",
	524	je->t_iops[0] + je->t_iops[1],
88e4beaa	525	je->m_iops[0] + je->m_iops[1]);
3e47bd25	526	}
cf451d1e	527	if (je->eta_sec != INT_MAX && je->nr_running) {
0721d11e	528	char perc_str[32];
6eaf09d6 SL	529	char *iops_str[DDIR_RWDIR_CNT];
6eaf09d6 SL	530	char *rate_str[DDIR_RWDIR_CNT];
79074e7c	531	size_t left;
adb02ba8	532	int l;
6eaf09d6	533	int ddir;
5ec10eaa	534
cf451d1e	535	if ((!je->eta_sec && !eta_good) \|\| je->nr_ramp == je->nr_running)
cac58fd5 JA	536	strcpy(perc_str, "-.-% done");
cac58fd5 JA	537	else {
714e85f3 JA	538	double mult = 100.0;
	539
	540	if (je->nr_setting_up && je->nr_running)
	541	mult *= (1.0 - (double) je->nr_setting_up / (double) je->nr_running);
	542
cac58fd5	543	eta_good = 1;
714e85f3	544	perc *= mult;
0721d11e	545	sprintf(perc_str, "%3.1f%% done", perc);
cac58fd5	546	}
0721d11e	547
6eaf09d6 SL	548	for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
6eaf09d6 SL	549	rate_str[ddir] = num2str(je->rate[ddir], 5,
ad705bcb	550	1024, je->is_pow2, je->unit_base);
73798eb2	551	iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0, 0);
6eaf09d6	552	}
adb02ba8	553
79074e7c JA	554	left = sizeof(output) - (p - output) - 1;
79074e7c JA	555
6eaf09d6 SL	556	l = snprintf(p, left, ": [%s] [%s] [%s/%s/%s /s] [%s/%s/%s iops] [eta %s]",
	557	je->run_str, perc_str, rate_str[DDIR_READ],
	558	rate_str[DDIR_WRITE], rate_str[DDIR_TRIM],
	559	iops_str[DDIR_READ], iops_str[DDIR_WRITE],
	560	iops_str[DDIR_TRIM], eta_str);
37db14fe	561	p += l;
adb02ba8	562	if (l >= 0 && l < linelen_last)
37db14fe	563	p += sprintf(p, "%*s", linelen_last - l, "");
adb02ba8	564	linelen_last = l;
d1bd7213	565
6eaf09d6 SL	566	for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
	567	free(rate_str[ddir]);
	568	free(iops_str[ddir]);
	569	}
263e529f	570	}
37db14fe JA	571	p += sprintf(p, "\r");
37db14fe JA	572
3e47bd25	573	printf("%s", output);
e382e661 JA	574
	575	if (!eta_new_line_init) {
	576	fio_gettime(&disp_eta_new_line, NULL);
	577	eta_new_line_init = 1;
	578	} else if (eta_new_line &&
	579	mtime_since_now(&disp_eta_new_line) > eta_new_line * 1000) {
	580	fio_gettime(&disp_eta_new_line, NULL);
	581	eta_new_line_pending = 1;
	582	}
	583
3e47bd25	584	fflush(stdout);
263e529f JA	585	}
263e529f JA	586
cf451d1e JA	587	void print_thread_status(void)
cf451d1e JA	588	{
1d1f45ae	589	struct jobs_eta *je;
b814fb26	590	size_t size;
1d1f45ae	591
b814fb26 JA	592	if (!thread_number)
b814fb26 JA	593	return;
cf451d1e	594
11155857	595	size = sizeof(*je) + THREAD_RUNSTR_SZ;
b814fb26 JA	596	je = malloc(size);
b814fb26 JA	597	memset(je, 0, size);
cf451d1e	598
af9c9fb3	599	if (calc_thread_status(je, 0))
1d1f45ae	600	display_thread_status(je);
cf451d1e	601
1d1f45ae	602	free(je);
cf451d1e	603	}
b75a394f	604
2b13e716	605	void print_status_init(int thr_number)
263e529f	606	{
3e2e48a7 JA	607	__run_str[thr_number] = 'P';
3e2e48a7 JA	608	update_condensed_str(__run_str, run_str);
263e529f	609	}