cpufreq_conservative.c 10.5 KB
Newer Older
1 2 3 4 5 6
/*
 *  drivers/cpufreq/cpufreq_conservative.c
 *
 *  Copyright (C)  2001 Russell King
 *            (C)  2003 Venkatesh Pallipadi <venkatesh.pallipadi@intel.com>.
 *                      Jun Nakajima <jun.nakajima@intel.com>
7
 *            (C)  2009 Alexander Clouter <alex@digriz.org.uk>
8 9 10 11 12 13 14
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */

#include <linux/cpufreq.h>
15 16
#include <linux/init.h>
#include <linux/kernel.h>
17
#include <linux/kernel_stat.h>
18 19
#include <linux/kobject.h>
#include <linux/module.h>
20
#include <linux/mutex.h>
21 22 23 24
#include <linux/notifier.h>
#include <linux/percpu-defs.h>
#include <linux/sysfs.h>
#include <linux/types.h>
25

26
#include "cpufreq_governor.h"
27

28
/* Conservative governor macors */
29 30
#define DEF_FREQUENCY_UP_THRESHOLD		(80)
#define DEF_FREQUENCY_DOWN_THRESHOLD		(20)
31 32
#define DEF_SAMPLING_DOWN_FACTOR		(1)
#define MAX_SAMPLING_DOWN_FACTOR		(10)
33

34 35
static struct dbs_data cs_dbs_data;
static DEFINE_PER_CPU(struct cs_cpu_dbs_info_s, cs_cpu_dbs_info);
36

37
static struct cs_dbs_tuners cs_tuners = {
38 39 40 41 42
	.up_threshold = DEF_FREQUENCY_UP_THRESHOLD,
	.down_threshold = DEF_FREQUENCY_DOWN_THRESHOLD,
	.sampling_down_factor = DEF_SAMPLING_DOWN_FACTOR,
	.ignore_nice = 0,
	.freq_step = 5,
43 44
};

45 46 47 48 49 50 51 52 53 54
/*
 * Every sampling_rate, we check, if current idle time is less than 20%
 * (default), then we try to increase frequency Every sampling_rate *
 * sampling_down_factor, we check, if current idle time is more than 80%, then
 * we try to decrease frequency
 *
 * Any frequency increase takes it to the maximum frequency. Frequency reduction
 * happens at minimum steps of 5% (default) of maximum frequency
 */
static void cs_check_cpu(int cpu, unsigned int load)
55
{
56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
	struct cs_cpu_dbs_info_s *dbs_info = &per_cpu(cs_cpu_dbs_info, cpu);
	struct cpufreq_policy *policy = dbs_info->cdbs.cur_policy;
	unsigned int freq_target;

	/*
	 * break out if we 'cannot' reduce the speed as the user might
	 * want freq_step to be zero
	 */
	if (cs_tuners.freq_step == 0)
		return;

	/* Check for frequency increase */
	if (load > cs_tuners.up_threshold) {
		dbs_info->down_skip = 0;

		/* if we are already at full speed then break out early */
		if (dbs_info->requested_freq == policy->max)
			return;

		freq_target = (cs_tuners.freq_step * policy->max) / 100;

		/* max freq cannot be less than 100. But who knows.... */
		if (unlikely(freq_target == 0))
			freq_target = 5;

		dbs_info->requested_freq += freq_target;
		if (dbs_info->requested_freq > policy->max)
			dbs_info->requested_freq = policy->max;
84

85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
		__cpufreq_driver_target(policy, dbs_info->requested_freq,
			CPUFREQ_RELATION_H);
		return;
	}

	/*
	 * The optimal frequency is the frequency that is the lowest that can
	 * support the current CPU usage without triggering the up policy. To be
	 * safe, we focus 10 points under the threshold.
	 */
	if (load < (cs_tuners.down_threshold - 10)) {
		freq_target = (cs_tuners.freq_step * policy->max) / 100;

		dbs_info->requested_freq -= freq_target;
		if (dbs_info->requested_freq < policy->min)
			dbs_info->requested_freq = policy->min;

		/*
		 * if we cannot reduce the frequency anymore, break out early
		 */
		if (policy->cur == policy->min)
			return;

		__cpufreq_driver_target(policy, dbs_info->requested_freq,
				CPUFREQ_RELATION_H);
		return;
	}
}

114 115
static void cs_timer_update(struct cs_cpu_dbs_info_s *dbs_info, bool sample,
			    struct delayed_work *dw)
116 117 118 119
{
	unsigned int cpu = dbs_info->cdbs.cpu;
	int delay = delay_for_sampling_rate(cs_tuners.sampling_rate);

120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
	if (sample)
		dbs_check_cpu(&cs_dbs_data, cpu);

	schedule_delayed_work_on(smp_processor_id(), dw, delay);
}

static void cs_timer_coordinated(struct cs_cpu_dbs_info_s *dbs_info_local,
				 struct delayed_work *dw)
{
	struct cs_cpu_dbs_info_s *dbs_info;
	ktime_t time_now;
	s64 delta_us;
	bool sample = true;

	/* use leader CPU's dbs_info */
	dbs_info = &per_cpu(cs_cpu_dbs_info, dbs_info_local->cdbs.cpu);
136 137
	mutex_lock(&dbs_info->cdbs.timer_mutex);

138 139
	time_now = ktime_get();
	delta_us = ktime_us_delta(time_now, dbs_info->cdbs.time_stamp);
140

141 142 143 144 145 146 147
	/* Do nothing if we recently have sampled */
	if (delta_us < (s64)(cs_tuners.sampling_rate / 2))
		sample = false;
	else
		dbs_info->cdbs.time_stamp = time_now;

	cs_timer_update(dbs_info, sample, dw);
148 149 150
	mutex_unlock(&dbs_info->cdbs.timer_mutex);
}

151 152 153 154 155 156
static void cs_dbs_timer(struct work_struct *work)
{
	struct delayed_work *dw = to_delayed_work(work);
	struct cs_cpu_dbs_info_s *dbs_info = container_of(work,
			struct cs_cpu_dbs_info_s, cdbs.work.work);

157
	if (policy_is_shared(dbs_info->cdbs.cur_policy)) {
158 159 160 161 162 163 164
		cs_timer_coordinated(dbs_info, dw);
	} else {
		mutex_lock(&dbs_info->cdbs.timer_mutex);
		cs_timer_update(dbs_info, true, dw);
		mutex_unlock(&dbs_info->cdbs.timer_mutex);
	}
}
165 166 167 168 169 170
static int dbs_cpufreq_notifier(struct notifier_block *nb, unsigned long val,
		void *data)
{
	struct cpufreq_freqs *freq = data;
	struct cs_cpu_dbs_info_s *dbs_info =
					&per_cpu(cs_cpu_dbs_info, freq->cpu);
171 172
	struct cpufreq_policy *policy;

173
	if (!dbs_info->enable)
174 175
		return 0;

176
	policy = dbs_info->cdbs.cur_policy;
177 178

	/*
179 180
	 * we only care if our internally tracked freq moves outside the 'valid'
	 * ranges of freqency available to us otherwise we do not change it
181
	*/
182 183 184
	if (dbs_info->requested_freq > policy->max
			|| dbs_info->requested_freq < policy->min)
		dbs_info->requested_freq = freq->new;
185 186 187 188

	return 0;
}

189
/************************** sysfs interface ************************/
190 191
static ssize_t show_sampling_rate_min(struct kobject *kobj,
				      struct attribute *attr, char *buf)
192
{
193
	return sprintf(buf, "%u\n", cs_dbs_data.min_sampling_rate);
194 195
}

196 197 198
static ssize_t store_sampling_down_factor(struct kobject *a,
					  struct attribute *b,
					  const char *buf, size_t count)
199 200 201
{
	unsigned int input;
	int ret;
202
	ret = sscanf(buf, "%u", &input);
203

204
	if (ret != 1 || input > MAX_SAMPLING_DOWN_FACTOR || input < 1)
205 206
		return -EINVAL;

207
	cs_tuners.sampling_down_factor = input;
208 209 210
	return count;
}

211 212
static ssize_t store_sampling_rate(struct kobject *a, struct attribute *b,
				   const char *buf, size_t count)
213 214 215
{
	unsigned int input;
	int ret;
216
	ret = sscanf(buf, "%u", &input);
217

218
	if (ret != 1)
219
		return -EINVAL;
220

221
	cs_tuners.sampling_rate = max(input, cs_dbs_data.min_sampling_rate);
222 223 224
	return count;
}

225 226
static ssize_t store_up_threshold(struct kobject *a, struct attribute *b,
				  const char *buf, size_t count)
227 228 229
{
	unsigned int input;
	int ret;
230
	ret = sscanf(buf, "%u", &input);
231

232
	if (ret != 1 || input > 100 || input <= cs_tuners.down_threshold)
233 234
		return -EINVAL;

235
	cs_tuners.up_threshold = input;
236 237 238
	return count;
}

239 240
static ssize_t store_down_threshold(struct kobject *a, struct attribute *b,
				    const char *buf, size_t count)
241 242 243
{
	unsigned int input;
	int ret;
244
	ret = sscanf(buf, "%u", &input);
245

246 247
	/* cannot be lower than 11 otherwise freq will not fall */
	if (ret != 1 || input < 11 || input > 100 ||
248
			input >= cs_tuners.up_threshold)
249 250
		return -EINVAL;

251
	cs_tuners.down_threshold = input;
252 253 254
	return count;
}

255 256
static ssize_t store_ignore_nice_load(struct kobject *a, struct attribute *b,
				      const char *buf, size_t count)
257
{
258
	unsigned int input, j;
259 260
	int ret;

261 262
	ret = sscanf(buf, "%u", &input);
	if (ret != 1)
263 264
		return -EINVAL;

265
	if (input > 1)
266
		input = 1;
267

268
	if (input == cs_tuners.ignore_nice) /* nothing to do */
269
		return count;
270

271
	cs_tuners.ignore_nice = input;
272

273
	/* we need to re-evaluate prev_cpu_idle */
274
	for_each_online_cpu(j) {
275
		struct cs_cpu_dbs_info_s *dbs_info;
276
		dbs_info = &per_cpu(cs_cpu_dbs_info, j);
277 278 279 280 281
		dbs_info->cdbs.prev_cpu_idle = get_cpu_idle_time(j,
						&dbs_info->cdbs.prev_cpu_wall);
		if (cs_tuners.ignore_nice)
			dbs_info->cdbs.prev_cpu_nice =
				kcpustat_cpu(j).cpustat[CPUTIME_NICE];
282 283 284 285
	}
	return count;
}

286 287
static ssize_t store_freq_step(struct kobject *a, struct attribute *b,
			       const char *buf, size_t count)
288 289 290
{
	unsigned int input;
	int ret;
291
	ret = sscanf(buf, "%u", &input);
292

293
	if (ret != 1)
294 295
		return -EINVAL;

296
	if (input > 100)
297
		input = 100;
298

299 300 301 302 303
	/*
	 * no need to test here if freq_step is zero as the user might actually
	 * want this, they would be crazy though :)
	 */
	cs_tuners.freq_step = input;
304 305 306
	return count;
}

307 308 309 310 311 312 313
show_one(cs, sampling_rate, sampling_rate);
show_one(cs, sampling_down_factor, sampling_down_factor);
show_one(cs, up_threshold, up_threshold);
show_one(cs, down_threshold, down_threshold);
show_one(cs, ignore_nice_load, ignore_nice);
show_one(cs, freq_step, freq_step);

314 315 316 317 318 319
define_one_global_rw(sampling_rate);
define_one_global_rw(sampling_down_factor);
define_one_global_rw(up_threshold);
define_one_global_rw(down_threshold);
define_one_global_rw(ignore_nice_load);
define_one_global_rw(freq_step);
320
define_one_global_ro(sampling_rate_min);
321

322
static struct attribute *dbs_attributes[] = {
323 324 325 326 327
	&sampling_rate_min.attr,
	&sampling_rate.attr,
	&sampling_down_factor.attr,
	&up_threshold.attr,
	&down_threshold.attr,
328
	&ignore_nice_load.attr,
329 330 331 332
	&freq_step.attr,
	NULL
};

333
static struct attribute_group cs_attr_group = {
334 335 336 337 338 339
	.attrs = dbs_attributes,
	.name = "conservative",
};

/************************** sysfs end ************************/

340
define_get_cpu_dbs_routines(cs_cpu_dbs_info);
341

342 343 344
static struct notifier_block cs_cpufreq_notifier_block = {
	.notifier_call = dbs_cpufreq_notifier,
};
345

346 347 348
static struct cs_ops cs_ops = {
	.notifier_block = &cs_cpufreq_notifier_block,
};
349

350 351 352 353 354 355 356 357 358 359
static struct dbs_data cs_dbs_data = {
	.governor = GOV_CONSERVATIVE,
	.attr_group = &cs_attr_group,
	.tuners = &cs_tuners,
	.get_cpu_cdbs = get_cpu_cdbs,
	.get_cpu_dbs_info_s = get_cpu_dbs_info_s,
	.gov_dbs_timer = cs_dbs_timer,
	.gov_check_cpu = cs_check_cpu,
	.gov_ops = &cs_ops,
};
360

361
static int cs_cpufreq_governor_dbs(struct cpufreq_policy *policy,
362 363
				   unsigned int event)
{
364
	return cpufreq_governor_dbs(&cs_dbs_data, policy, event);
365 366
}

367 368 369
#ifndef CONFIG_CPU_FREQ_DEFAULT_GOV_CONSERVATIVE
static
#endif
370 371
struct cpufreq_governor cpufreq_gov_conservative = {
	.name			= "conservative",
372
	.governor		= cs_cpufreq_governor_dbs,
373 374
	.max_transition_latency	= TRANSITION_LATENCY_LIMIT,
	.owner			= THIS_MODULE,
375 376 377 378
};

static int __init cpufreq_gov_dbs_init(void)
{
379
	mutex_init(&cs_dbs_data.mutex);
380
	return cpufreq_register_governor(&cpufreq_gov_conservative);
381 382 383 384
}

static void __exit cpufreq_gov_dbs_exit(void)
{
385
	cpufreq_unregister_governor(&cpufreq_gov_conservative);
386 387
}

388
MODULE_AUTHOR("Alexander Clouter <alex@digriz.org.uk>");
389
MODULE_DESCRIPTION("'cpufreq_conservative' - A dynamic cpufreq governor for "
390 391
		"Low Latency Frequency Transition capable processors "
		"optimised for use in a battery environment");
392
MODULE_LICENSE("GPL");
393

394 395 396
#ifdef CONFIG_CPU_FREQ_DEFAULT_GOV_CONSERVATIVE
fs_initcall(cpufreq_gov_dbs_init);
#else
397
module_init(cpufreq_gov_dbs_init);
398
#endif
399
module_exit(cpufreq_gov_dbs_exit);