[fio.git] / steadystate.c

#include <stdlib.h>

#include "fio.h"
#include "steadystate.h"

bool steadystate_enabled = false;

void steadystate_free(struct thread_data *td)
{
	free(td->ss.iops_data);
	free(td->ss.bw_data);
	td->ss.iops_data = NULL;
	td->ss.bw_data = NULL;
}

static void steadystate_alloc(struct thread_data *td)
{
	td->ss.bw_data = calloc(td->ss.dur, sizeof(uint64_t));
	td->ss.iops_data = calloc(td->ss.dur, sizeof(uint64_t));

	td->ss.state |= FIO_SS_DATA;
}

void steadystate_setup(void)
{
	struct thread_data *prev_td;
	int prev_groupid;

	if (!steadystate_enabled)
		return;

	/*
	 * if group reporting is enabled, identify the last td
	 * for each group and use it for storing steady state
	 * data
	 */
	prev_groupid = -1;
	prev_td = NULL;
	for_each_td(td) {
		if (!td->ss.dur)
			continue;

		if (!td->o.group_reporting) {
			steadystate_alloc(td);
			continue;
		}

		if (prev_groupid != td->groupid) {
			if (prev_td)
				steadystate_alloc(prev_td);
			prev_groupid = td->groupid;
		}
		prev_td = td;
	} end_for_each();

	if (prev_td && prev_td->o.group_reporting)
		steadystate_alloc(prev_td);
}

static bool steadystate_slope(uint64_t iops, uint64_t bw,
			      struct thread_data *td)
{
	int i, j;
	double result;
	struct steadystate_data *ss = &td->ss;
	uint64_t new_val;

	ss->bw_data[ss->tail] = bw;
	ss->iops_data[ss->tail] = iops;

	if (ss->state & FIO_SS_IOPS)
		new_val = iops;
	else
		new_val = bw;

	if (ss->state & FIO_SS_BUFFER_FULL || ss->tail - ss->head == ss->dur - 1) {
		if (!(ss->state & FIO_SS_BUFFER_FULL)) {
			/* first time through */
			for(i = 0, ss->sum_y = 0; i < ss->dur; i++) {
				if (ss->state & FIO_SS_IOPS)
					ss->sum_y += ss->iops_data[i];
				else
					ss->sum_y += ss->bw_data[i];
				j = (ss->head + i) % ss->dur;
				if (ss->state & FIO_SS_IOPS)
					ss->sum_xy += i * ss->iops_data[j];
				else
					ss->sum_xy += i * ss->bw_data[j];
			}
			ss->state |= FIO_SS_BUFFER_FULL;
		} else {		/* easy to update the sums */
			ss->sum_y -= ss->oldest_y;
			ss->sum_y += new_val;
			ss->sum_xy = ss->sum_xy - ss->sum_y + ss->dur * new_val;
		}

		if (ss->state & FIO_SS_IOPS)
			ss->oldest_y = ss->iops_data[ss->head];
		else
			ss->oldest_y = ss->bw_data[ss->head];

		/*
		 * calculate slope as (sum_xy - sum_x * sum_y / n) / (sum_(x^2)
		 * - (sum_x)^2 / n) This code assumes that all x values are
		 * equally spaced when they are often off by a few milliseconds.
		 * This assumption greatly simplifies the calculations.
		 */
		ss->slope = (ss->sum_xy - (double) ss->sum_x * ss->sum_y / ss->dur) /
				(ss->sum_x_sq - (double) ss->sum_x * ss->sum_x / ss->dur);
		if (ss->state & FIO_SS_PCT)
			ss->criterion = 100.0 * ss->slope / (ss->sum_y / ss->dur);
		else
			ss->criterion = ss->slope;

		dprint(FD_STEADYSTATE, "sum_y: %llu, sum_xy: %llu, slope: %f, "
					"criterion: %f, limit: %f\n",
					(unsigned long long) ss->sum_y,
					(unsigned long long) ss->sum_xy,
					ss->slope, ss->criterion, ss->limit);

		result = ss->criterion * (ss->criterion < 0.0 ? -1.0 : 1.0);
		if (result < ss->limit)
			return true;
	}

	ss->tail = (ss->tail + 1) % ss->dur;
	if (ss->tail <= ss->head)
		ss->head = (ss->head + 1) % ss->dur;

	return false;
}

static bool steadystate_deviation(uint64_t iops, uint64_t bw,
				  struct thread_data *td)
{
	int i;
	double diff;
	double mean;

	struct steadystate_data *ss = &td->ss;

	ss->bw_data[ss->tail] = bw;
	ss->iops_data[ss->tail] = iops;

	if (ss->state & FIO_SS_BUFFER_FULL || ss->tail - ss->head == ss->dur - 1) {
		if (!(ss->state & FIO_SS_BUFFER_FULL)) {
			/* first time through */
			for(i = 0, ss->sum_y = 0; i < ss->dur; i++)
				if (ss->state & FIO_SS_IOPS)
					ss->sum_y += ss->iops_data[i];
				else
					ss->sum_y += ss->bw_data[i];
			ss->state |= FIO_SS_BUFFER_FULL;
		} else {		/* easy to update the sum */
			ss->sum_y -= ss->oldest_y;
			if (ss->state & FIO_SS_IOPS)
				ss->sum_y += ss->iops_data[ss->tail];
			else
				ss->sum_y += ss->bw_data[ss->tail];
		}

		if (ss->state & FIO_SS_IOPS)
			ss->oldest_y = ss->iops_data[ss->head];
		else
			ss->oldest_y = ss->bw_data[ss->head];

		mean = (double) ss->sum_y / ss->dur;
		ss->deviation = 0.0;

		for (i = 0; i < ss->dur; i++) {
			if (ss->state & FIO_SS_IOPS)
				diff = ss->iops_data[i] - mean;
			else
				diff = ss->bw_data[i] - mean;
			ss->deviation = max(ss->deviation, diff * (diff < 0.0 ? -1.0 : 1.0));
		}

		if (ss->state & FIO_SS_PCT)
			ss->criterion = 100.0 * ss->deviation / mean;
		else
			ss->criterion = ss->deviation;

		dprint(FD_STEADYSTATE, "sum_y: %llu, mean: %f, max diff: %f, "
					"objective: %f, limit: %f\n",
					(unsigned long long) ss->sum_y, mean,
					ss->deviation, ss->criterion, ss->limit);

		if (ss->criterion < ss->limit)
			return true;
	}

	ss->tail = (ss->tail + 1) % ss->dur;
	if (ss->tail <= ss->head)
		ss->head = (ss->head + 1) % ss->dur;

	return false;
}

int steadystate_check(void)
{
	int  ddir, prev_groupid, group_ramp_time_over = 0;
	unsigned long rate_time;
	struct timespec now;
	uint64_t group_bw = 0, group_iops = 0;
	uint64_t td_iops, td_bytes;
	bool ret;

	prev_groupid = -1;
	for_each_td(td) {
		const bool needs_lock = td_async_processing(td);
		struct steadystate_data *ss = &td->ss;

		if (!ss->dur || td->runstate <= TD_SETTING_UP ||
		    td->runstate >= TD_EXITED || !ss->state ||
		    ss->state & FIO_SS_ATTAINED)
			continue;

		td_iops = 0;
		td_bytes = 0;
		if (!td->o.group_reporting ||
		    (td->o.group_reporting && td->groupid != prev_groupid)) {
			group_bw = 0;
			group_iops = 0;
			group_ramp_time_over = 0;
		}
		prev_groupid = td->groupid;

		fio_gettime(&now, NULL);
		if (ss->ramp_time && !(ss->state & FIO_SS_RAMP_OVER)) {
			/*
			 * Begin recording data one second after ss->ramp_time
			 * has elapsed
			 */
			if (utime_since(&td->epoch, &now) >= (ss->ramp_time + 1000000L))
				ss->state |= FIO_SS_RAMP_OVER;
		}

		if (needs_lock)
			__td_io_u_lock(td);

		for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++) {
			td_iops += td->io_blocks[ddir];
			td_bytes += td->io_bytes[ddir];
		}

		if (needs_lock)
			__td_io_u_unlock(td);

		rate_time = mtime_since(&ss->prev_time, &now);
		memcpy(&ss->prev_time, &now, sizeof(now));

		if (ss->state & FIO_SS_RAMP_OVER) {
			group_bw += 1000 * (td_bytes - ss->prev_bytes) / rate_time;
			group_iops += 1000 * (td_iops - ss->prev_iops) / rate_time;
			++group_ramp_time_over;
		}
		ss->prev_iops = td_iops;
		ss->prev_bytes = td_bytes;

		if (td->o.group_reporting && !(ss->state & FIO_SS_DATA))
			continue;

		/*
		 * Don't begin checking criterion until ss->ramp_time is over
		 * for at least one thread in group
		 */
		if (!group_ramp_time_over)
			continue;

		dprint(FD_STEADYSTATE, "steadystate_check() thread: %d, "
					"groupid: %u, rate_msec: %ld, "
					"iops: %llu, bw: %llu, head: %d, tail: %d\n",
					__td_index, td->groupid, rate_time,
					(unsigned long long) group_iops,
					(unsigned long long) group_bw,
					ss->head, ss->tail);

		if (ss->state & FIO_SS_SLOPE)
			ret = steadystate_slope(group_iops, group_bw, td);
		else
			ret = steadystate_deviation(group_iops, group_bw, td);

		if (ret) {
			if (td->o.group_reporting) {
				for_each_td(td2) {
					if (td2->groupid == td->groupid) {
						td2->ss.state |= FIO_SS_ATTAINED;
						fio_mark_td_terminate(td2);
					}
				} end_for_each();
			} else {
				ss->state |= FIO_SS_ATTAINED;
				fio_mark_td_terminate(td);
			}
		}
	} end_for_each();
	return 0;
}

int td_steadystate_init(struct thread_data *td)
{
	struct steadystate_data *ss = &td->ss;
	struct thread_options *o = &td->o;

	memset(ss, 0, sizeof(*ss));

	if (o->ss_dur) {
		steadystate_enabled = true;
		o->ss_dur /= 1000000L;

		/* put all steady state info in one place */
		ss->dur = o->ss_dur;
		ss->limit = o->ss_limit.u.f;
		ss->ramp_time = o->ss_ramp_time;

		ss->state = o->ss_state;
		if (!td->ss.ramp_time)
			ss->state |= FIO_SS_RAMP_OVER;

		ss->sum_x = o->ss_dur * (o->ss_dur - 1) / 2;
		ss->sum_x_sq = (o->ss_dur - 1) * (o->ss_dur) * (2*o->ss_dur - 1) / 6;
	}

	/* make sure that ss options are consistent within reporting group */
	for_each_td(td2) {
		if (td2->groupid == td->groupid) {
			struct steadystate_data *ss2 = &td2->ss;

			if (ss2->dur != ss->dur ||
			    ss2->limit != ss->limit ||
			    ss2->ramp_time != ss->ramp_time ||
			    ss2->state != ss->state ||
			    ss2->sum_x != ss->sum_x ||
			    ss2->sum_x_sq != ss->sum_x_sq) {
				td_verror(td, EINVAL, "job rejected: steadystate options must be consistent within reporting groups");
				return 1;
			}
		}
	} end_for_each();

	return 0;
}

uint64_t steadystate_bw_mean(struct thread_stat *ts)
{
	int i;
	uint64_t sum;

	if (!ts->ss_dur)
		return 0;

	for (i = 0, sum = 0; i < ts->ss_dur; i++)
		sum += ts->ss_bw_data[i];

	return sum / ts->ss_dur;
}

uint64_t steadystate_iops_mean(struct thread_stat *ts)
{
	int i;
	uint64_t sum;

	if (!ts->ss_dur)
		return 0;

	for (i = 0, sum = 0; i < ts->ss_dur; i++)
		sum += ts->ss_iops_data[i];

	return sum / ts->ss_dur;
}
Commit	Line	Data
ba8fb6f6 VF	1	#include <stdlib.h>
ba8fb6f6 VF	2
16e56d25 VF	3	#include "fio.h"
16e56d25 VF	4	#include "steadystate.h"
16e56d25	5
84784e07	6	bool steadystate_enabled = false;
4cd5b75b	7
c27cc65f JA	8	void steadystate_free(struct thread_data *td)
	9	{
	10	free(td->ss.iops_data);
	11	free(td->ss.bw_data);
	12	td->ss.iops_data = NULL;
	13	td->ss.bw_data = NULL;
	14	}
	15
f0c50c66 JA	16	static void steadystate_alloc(struct thread_data *td)
f0c50c66 JA	17	{
4c14c109 TK	18	td->ss.bw_data = calloc(td->ss.dur, sizeof(uint64_t));
4c14c109 TK	19	td->ss.iops_data = calloc(td->ss.dur, sizeof(uint64_t));
bb49c8bd	20
c8caba48	21	td->ss.state \|= FIO_SS_DATA;
f0c50c66 JA	22	}
f0c50c66 JA	23
4cd5b75b	24	void steadystate_setup(void)
16e56d25	25	{
da8f124f H	26	struct thread_data *prev_td;
da8f124f H	27	int prev_groupid;
16e56d25	28
84784e07	29	if (!steadystate_enabled)
16e56d25 VF	30	return;
	31
	32	/*
	33	* if group reporting is enabled, identify the last td
	34	* for each group and use it for storing steady state
	35	* data
	36	*/
	37	prev_groupid = -1;
	38	prev_td = NULL;
da8f124f	39	for_each_td(td) {
bb49c8bd	40	if (!td->ss.dur)
ba8fb6f6 VF	41	continue;
	42
	43	if (!td->o.group_reporting) {
	44	steadystate_alloc(td);
16e56d25	45	continue;
ba8fb6f6	46	}
16e56d25 VF	47
16e56d25 VF	48	if (prev_groupid != td->groupid) {
af7fb4aa	49	if (prev_td)
ba8fb6f6	50	steadystate_alloc(prev_td);
16e56d25 VF	51	prev_groupid = td->groupid;
	52	}
	53	prev_td = td;
da8f124f	54	} end_for_each();
16e56d25	55
af7fb4aa	56	if (prev_td && prev_td->o.group_reporting)
ba8fb6f6	57	steadystate_alloc(prev_td);
ba8fb6f6 VF	58	}
ba8fb6f6 VF	59
9d193019	60	static bool steadystate_slope(uint64_t iops, uint64_t bw,
4cd5b75b	61	struct thread_data *td)
16e56d25	62	{
ba8fb6f6	63	int i, j;
16e56d25	64	double result;
16e56d25	65	struct steadystate_data *ss = &td->ss;
9d193019	66	uint64_t new_val;
16e56d25	67
ba8fb6f6 VF	68	ss->bw_data[ss->tail] = bw;
ba8fb6f6 VF	69	ss->iops_data[ss->tail] = iops;
16e56d25	70
c8caba48	71	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	72	new_val = iops;
	73	else
	74	new_val = bw;
	75
c8caba48 JA	76	if (ss->state & FIO_SS_BUFFER_FULL \|\| ss->tail - ss->head == ss->dur - 1) {
c8caba48 JA	77	if (!(ss->state & FIO_SS_BUFFER_FULL)) {
17df7023 VF	78	/* first time through */
17df7023 VF	79	for(i = 0, ss->sum_y = 0; i < ss->dur; i++) {
c8caba48	80	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	81	ss->sum_y += ss->iops_data[i];
	82	else
	83	ss->sum_y += ss->bw_data[i];
17df7023	84	j = (ss->head + i) % ss->dur;
c8caba48	85	if (ss->state & FIO_SS_IOPS)
94f218f6	86	ss->sum_xy += i * ss->iops_data[j];
7be78a8a	87	else
94f218f6	88	ss->sum_xy += i * ss->bw_data[j];
16e56d25	89	}
c8caba48	90	ss->state \|= FIO_SS_BUFFER_FULL;
16e56d25 VF	91	} else { /* easy to update the sums */
16e56d25 VF	92	ss->sum_y -= ss->oldest_y;
ba8fb6f6 VF	93	ss->sum_y += new_val;
ba8fb6f6 VF	94	ss->sum_xy = ss->sum_xy - ss->sum_y + ss->dur * new_val;
16e56d25 VF	95	}
16e56d25 VF	96
c8caba48	97	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	98	ss->oldest_y = ss->iops_data[ss->head];
	99	else
	100	ss->oldest_y = ss->bw_data[ss->head];
16e56d25 VF	101
16e56d25 VF	102	/*
7be78a8a JA	103	* calculate slope as (sum_xy - sum_x * sum_y / n) / (sum_(x^2)
	104	* - (sum_x)^2 / n) This code assumes that all x values are
	105	* equally spaced when they are often off by a few milliseconds.
	106	* This assumption greatly simplifies the calculations.
16e56d25	107	*/
7be78a8a JA	108	ss->slope = (ss->sum_xy - (double) ss->sum_x * ss->sum_y / ss->dur) /
7be78a8a JA	109	(ss->sum_x_sq - (double) ss->sum_x * ss->sum_x / ss->dur);
c8caba48	110	if (ss->state & FIO_SS_PCT)
7be78a8a JA	111	ss->criterion = 100.0 * ss->slope / (ss->sum_y / ss->dur);
	112	else
	113	ss->criterion = ss->slope;
16e56d25	114
7be78a8a JA	115	dprint(FD_STEADYSTATE, "sum_y: %llu, sum_xy: %llu, slope: %f, "
7be78a8a JA	116	"criterion: %f, limit: %f\n",
9d193019 VF	117	(unsigned long long) ss->sum_y,
	118	(unsigned long long) ss->sum_xy,
	119	ss->slope, ss->criterion, ss->limit);
16e56d25	120
6da94b07	121	result = ss->criterion * (ss->criterion < 0.0 ? -1.0 : 1.0);
16e56d25 VF	122	if (result < ss->limit)
	123	return true;
	124	}
	125
	126	ss->tail = (ss->tail + 1) % ss->dur;
	127	if (ss->tail <= ss->head)
	128	ss->head = (ss->head + 1) % ss->dur;
4cd5b75b	129
16e56d25 VF	130	return false;
	131	}
	132
9d193019	133	static bool steadystate_deviation(uint64_t iops, uint64_t bw,
4cd5b75b	134	struct thread_data *td)
16e56d25 VF	135	{
	136	int i;
	137	double diff;
	138	double mean;
16e56d25 VF	139
	140	struct steadystate_data *ss = &td->ss;
	141
ba8fb6f6 VF	142	ss->bw_data[ss->tail] = bw;
ba8fb6f6 VF	143	ss->iops_data[ss->tail] = iops;
16e56d25	144
c8caba48 JA	145	if (ss->state & FIO_SS_BUFFER_FULL \|\| ss->tail - ss->head == ss->dur - 1) {
c8caba48 JA	146	if (!(ss->state & FIO_SS_BUFFER_FULL)) {
17df7023 VF	147	/* first time through */
17df7023 VF	148	for(i = 0, ss->sum_y = 0; i < ss->dur; i++)
c8caba48	149	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	150	ss->sum_y += ss->iops_data[i];
	151	else
	152	ss->sum_y += ss->bw_data[i];
c8caba48	153	ss->state \|= FIO_SS_BUFFER_FULL;
16e56d25 VF	154	} else { /* easy to update the sum */
16e56d25 VF	155	ss->sum_y -= ss->oldest_y;
c8caba48	156	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	157	ss->sum_y += ss->iops_data[ss->tail];
	158	else
	159	ss->sum_y += ss->bw_data[ss->tail];
16e56d25 VF	160	}
16e56d25 VF	161
c8caba48	162	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	163	ss->oldest_y = ss->iops_data[ss->head];
	164	else
	165	ss->oldest_y = ss->bw_data[ss->head];
	166
16e56d25	167	mean = (double) ss->sum_y / ss->dur;
ba8fb6f6	168	ss->deviation = 0.0;
16e56d25	169
4cd5b75b	170	for (i = 0; i < ss->dur; i++) {
c8caba48	171	if (ss->state & FIO_SS_IOPS)
7be78a8a JA	172	diff = ss->iops_data[i] - mean;
	173	else
	174	diff = ss->bw_data[i] - mean;
6da94b07	175	ss->deviation = max(ss->deviation, diff * (diff < 0.0 ? -1.0 : 1.0));
16e56d25 VF	176	}
16e56d25 VF	177
c8caba48	178	if (ss->state & FIO_SS_PCT)
7be78a8a JA	179	ss->criterion = 100.0 * ss->deviation / mean;
	180	else
	181	ss->criterion = ss->deviation;
16e56d25	182
7be78a8a JA	183	dprint(FD_STEADYSTATE, "sum_y: %llu, mean: %f, max diff: %f, "
7be78a8a JA	184	"objective: %f, limit: %f\n",
9d193019 VF	185	(unsigned long long) ss->sum_y, mean,
9d193019 VF	186	ss->deviation, ss->criterion, ss->limit);
16e56d25 VF	187
	188	if (ss->criterion < ss->limit)
	189	return true;
	190	}
	191
	192	ss->tail = (ss->tail + 1) % ss->dur;
	193	if (ss->tail <= ss->head)
	194	ss->head = (ss->head + 1) % ss->dur;
4cd5b75b	195
16e56d25 VF	196	return false;
16e56d25 VF	197	}
4cd5b75b	198
966f8ef9	199	int steadystate_check(void)
4cd5b75b	200	{
da8f124f	201	int ddir, prev_groupid, group_ramp_time_over = 0;
4cd5b75b	202	unsigned long rate_time;
8b6a404c	203	struct timespec now;
9d193019 VF	204	uint64_t group_bw = 0, group_iops = 0;
9d193019 VF	205	uint64_t td_iops, td_bytes;
4cd5b75b JA	206	bool ret;
	207
	208	prev_groupid = -1;
da8f124f	209	for_each_td(td) {
26b3a188	210	const bool needs_lock = td_async_processing(td);
4cd5b75b JA	211	struct steadystate_data *ss = &td->ss;
4cd5b75b JA	212
7be78a8a	213	if (!ss->dur \|\| td->runstate <= TD_SETTING_UP \|\|
0c13c969	214	td->runstate >= TD_EXITED \|\| !ss->state \|\|
c8caba48	215	ss->state & FIO_SS_ATTAINED)
4cd5b75b JA	216	continue;
	217
	218	td_iops = 0;
	219	td_bytes = 0;
	220	if (!td->o.group_reporting \|\|
	221	(td->o.group_reporting && td->groupid != prev_groupid)) {
	222	group_bw = 0;
	223	group_iops = 0;
	224	group_ramp_time_over = 0;
	225	}
	226	prev_groupid = td->groupid;
	227
	228	fio_gettime(&now, NULL);
c8caba48	229	if (ss->ramp_time && !(ss->state & FIO_SS_RAMP_OVER)) {
4cd5b75b JA	230	/*
	231	* Begin recording data one second after ss->ramp_time
	232	* has elapsed
	233	*/
	234	if (utime_since(&td->epoch, &now) >= (ss->ramp_time + 1000000L))
c8caba48	235	ss->state \|= FIO_SS_RAMP_OVER;
5b4b6586	236	}
4cd5b75b	237
26b3a188 JA	238	if (needs_lock)
	239	__td_io_u_lock(td);
	240
c1f50f76	241	for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++) {
4cd5b75b JA	242	td_iops += td->io_blocks[ddir];
	243	td_bytes += td->io_bytes[ddir];
	244	}
26b3a188 JA	245
	246	if (needs_lock)
	247	__td_io_u_unlock(td);
4cd5b75b JA	248
	249	rate_time = mtime_since(&ss->prev_time, &now);
	250	memcpy(&ss->prev_time, &now, sizeof(now));
	251
c8caba48	252	if (ss->state & FIO_SS_RAMP_OVER) {
4cd5b75b JA	253	group_bw += 1000 * (td_bytes - ss->prev_bytes) / rate_time;
	254	group_iops += 1000 * (td_iops - ss->prev_iops) / rate_time;
	255	++group_ramp_time_over;
	256	}
	257	ss->prev_iops = td_iops;
	258	ss->prev_bytes = td_bytes;
	259
c8caba48	260	if (td->o.group_reporting && !(ss->state & FIO_SS_DATA))
4cd5b75b JA	261	continue;
4cd5b75b JA	262
7be78a8a JA	263	/*
	264	* Don't begin checking criterion until ss->ramp_time is over
	265	* for at least one thread in group
	266	*/
4cd5b75b JA	267	if (!group_ramp_time_over)
	268	continue;
	269
7be78a8a JA	270	dprint(FD_STEADYSTATE, "steadystate_check() thread: %d, "
7be78a8a JA	271	"groupid: %u, rate_msec: %ld, "
9d193019	272	"iops: %llu, bw: %llu, head: %d, tail: %d\n",
da8f124f	273	__td_index, td->groupid, rate_time,
9d193019 VF	274	(unsigned long long) group_iops,
	275	(unsigned long long) group_bw,
	276	ss->head, ss->tail);
4cd5b75b	277
c8caba48	278	if (ss->state & FIO_SS_SLOPE)
4cd5b75b JA	279	ret = steadystate_slope(group_iops, group_bw, td);
	280	else
	281	ret = steadystate_deviation(group_iops, group_bw, td);
	282
	283	if (ret) {
	284	if (td->o.group_reporting) {
da8f124f	285	for_each_td(td2) {
4cd5b75b	286	if (td2->groupid == td->groupid) {
c8caba48	287	td2->ss.state \|= FIO_SS_ATTAINED;
4cd5b75b JA	288	fio_mark_td_terminate(td2);
4cd5b75b JA	289	}
da8f124f	290	} end_for_each();
4cd5b75b	291	} else {
c8caba48	292	ss->state \|= FIO_SS_ATTAINED;
4cd5b75b JA	293	fio_mark_td_terminate(td);
	294	}
	295	}
da8f124f	296	} end_for_each();
966f8ef9	297	return 0;
4cd5b75b JA	298	}
4cd5b75b JA	299
56a90eba	300	int td_steadystate_init(struct thread_data *td)
f0c50c66 JA	301	{
	302	struct steadystate_data *ss = &td->ss;
	303	struct thread_options *o = &td->o;
	304
	305	memset(ss, 0, sizeof(*ss));
	306
56a90eba VF	307	if (o->ss_dur) {
	308	steadystate_enabled = true;
	309	o->ss_dur /= 1000000L;
	310
	311	/* put all steady state info in one place */
	312	ss->dur = o->ss_dur;
	313	ss->limit = o->ss_limit.u.f;
	314	ss->ramp_time = o->ss_ramp_time;
f0c50c66	315
2c5d94bc	316	ss->state = o->ss_state;
56a90eba	317	if (!td->ss.ramp_time)
c8caba48	318	ss->state \|= FIO_SS_RAMP_OVER;
4cd5b75b	319
56a90eba VF	320	ss->sum_x = o->ss_dur * (o->ss_dur - 1) / 2;
56a90eba VF	321	ss->sum_x_sq = (o->ss_dur - 1) * (o->ss_dur) * (2*o->ss_dur - 1) / 6;
56a90eba	322	}
5b4b6586	323
56a90eba	324	/* make sure that ss options are consistent within reporting group */
da8f124f	325	for_each_td(td2) {
56a90eba VF	326	if (td2->groupid == td->groupid) {
	327	struct steadystate_data *ss2 = &td2->ss;
	328
	329	if (ss2->dur != ss->dur \|\|
	330	ss2->limit != ss->limit \|\|
	331	ss2->ramp_time != ss->ramp_time \|\|
56a90eba VF	332	ss2->state != ss->state \|\|
	333	ss2->sum_x != ss->sum_x \|\|
	334	ss2->sum_x_sq != ss->sum_x_sq) {
	335	td_verror(td, EINVAL, "job rejected: steadystate options must be consistent within reporting groups");
	336	return 1;
	337	}
	338	}
da8f124f	339	} end_for_each();
f0c50c66	340
56a90eba	341	return 0;
f0c50c66	342	}
d685adfb	343
9d193019	344	uint64_t steadystate_bw_mean(struct thread_stat *ts)
d685adfb VF	345	{
d685adfb VF	346	int i;
9d193019	347	uint64_t sum;
d685adfb	348
9fac0db7 JA	349	if (!ts->ss_dur)
	350	return 0;
	351
bb49c8bd VF	352	for (i = 0, sum = 0; i < ts->ss_dur; i++)
bb49c8bd VF	353	sum += ts->ss_bw_data[i];
d685adfb	354
bb49c8bd	355	return sum / ts->ss_dur;
d685adfb VF	356	}
d685adfb VF	357
9d193019	358	uint64_t steadystate_iops_mean(struct thread_stat *ts)
d685adfb VF	359	{
d685adfb VF	360	int i;
9d193019	361	uint64_t sum;
d685adfb	362
9fac0db7 JA	363	if (!ts->ss_dur)
	364	return 0;
	365
bb49c8bd VF	366	for (i = 0, sum = 0; i < ts->ss_dur; i++)
bb49c8bd VF	367	sum += ts->ss_iops_data[i];
d685adfb	368
bb49c8bd	369	return sum / ts->ss_dur;
d685adfb	370	}