Commit | Line | Data |
---|---|---|
2aacdfff | 1 | /* |
2 | * drivers/cpufreq/cpufreq_governor.c | |
3 | * | |
4 | * CPUFREQ governors common code | |
5 | * | |
4471a34f VK |
6 | * Copyright (C) 2001 Russell King |
7 | * (C) 2003 Venkatesh Pallipadi <venkatesh.pallipadi@intel.com>. | |
8 | * (C) 2003 Jun Nakajima <jun.nakajima@intel.com> | |
9 | * (C) 2009 Alexander Clouter <alex@digriz.org.uk> | |
10 | * (c) 2012 Viresh Kumar <viresh.kumar@linaro.org> | |
11 | * | |
2aacdfff | 12 | * This program is free software; you can redistribute it and/or modify |
13 | * it under the terms of the GNU General Public License version 2 as | |
14 | * published by the Free Software Foundation. | |
15 | */ | |
16 | ||
4471a34f VK |
17 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
18 | ||
2aacdfff | 19 | #include <linux/export.h> |
20 | #include <linux/kernel_stat.h> | |
4d5dcc42 | 21 | #include <linux/slab.h> |
4471a34f VK |
22 | |
23 | #include "cpufreq_governor.h" | |
24 | ||
8c8f77fd RW |
25 | static DEFINE_PER_CPU(struct cpu_dbs_info, cpu_dbs); |
26 | ||
1112e9d8 | 27 | static DEFINE_MUTEX(gov_dbs_data_mutex); |
2bb8d94f | 28 | |
aded387b VK |
29 | /* Common sysfs tunables */ |
30 | /** | |
31 | * store_sampling_rate - update sampling rate effective immediately if needed. | |
32 | * | |
33 | * If new rate is smaller than the old, simply updating | |
34 | * dbs.sampling_rate might not be appropriate. For example, if the | |
35 | * original sampling_rate was 1 second and the requested new sampling rate is 10 | |
36 | * ms because the user needs immediate reaction from ondemand governor, but not | |
37 | * sure if higher frequency will be required or not, then, the governor may | |
38 | * change the sampling rate too late; up to 1 second later. Thus, if we are | |
39 | * reducing the sampling rate, we need to make the new value effective | |
40 | * immediately. | |
41 | * | |
aded387b VK |
42 | * This must be called with dbs_data->mutex held, otherwise traversing |
43 | * policy_dbs_list isn't safe. | |
44 | */ | |
0dd3c1d6 | 45 | ssize_t store_sampling_rate(struct gov_attr_set *attr_set, const char *buf, |
aded387b VK |
46 | size_t count) |
47 | { | |
0dd3c1d6 | 48 | struct dbs_data *dbs_data = to_dbs_data(attr_set); |
aded387b VK |
49 | struct policy_dbs_info *policy_dbs; |
50 | unsigned int rate; | |
51 | int ret; | |
52 | ret = sscanf(buf, "%u", &rate); | |
53 | if (ret != 1) | |
54 | return -EINVAL; | |
55 | ||
56 | dbs_data->sampling_rate = max(rate, dbs_data->min_sampling_rate); | |
57 | ||
58 | /* | |
59 | * We are operating under dbs_data->mutex and so the list and its | |
60 | * entries can't be freed concurrently. | |
61 | */ | |
0dd3c1d6 | 62 | list_for_each_entry(policy_dbs, &attr_set->policy_list, list) { |
26f0dbc9 | 63 | mutex_lock(&policy_dbs->update_mutex); |
aded387b VK |
64 | /* |
65 | * On 32-bit architectures this may race with the | |
66 | * sample_delay_ns read in dbs_update_util_handler(), but that | |
67 | * really doesn't matter. If the read returns a value that's | |
68 | * too big, the sample will be skipped, but the next invocation | |
69 | * of dbs_update_util_handler() (when the update has been | |
78347cdb | 70 | * completed) will take a sample. |
aded387b VK |
71 | * |
72 | * If this runs in parallel with dbs_work_handler(), we may end | |
73 | * up overwriting the sample_delay_ns value that it has just | |
78347cdb RW |
74 | * written, but it will be corrected next time a sample is |
75 | * taken, so it shouldn't be significant. | |
aded387b | 76 | */ |
78347cdb | 77 | gov_update_sample_delay(policy_dbs, 0); |
26f0dbc9 | 78 | mutex_unlock(&policy_dbs->update_mutex); |
aded387b VK |
79 | } |
80 | ||
81 | return count; | |
82 | } | |
83 | EXPORT_SYMBOL_GPL(store_sampling_rate); | |
84 | ||
a33cce1c RW |
85 | /** |
86 | * gov_update_cpu_data - Update CPU load data. | |
a33cce1c RW |
87 | * @dbs_data: Top-level governor data pointer. |
88 | * | |
89 | * Update CPU load data for all CPUs in the domain governed by @dbs_data | |
90 | * (that may be a single policy or a bunch of them if governor tunables are | |
91 | * system-wide). | |
92 | * | |
93 | * Call under the @dbs_data mutex. | |
94 | */ | |
8c8f77fd | 95 | void gov_update_cpu_data(struct dbs_data *dbs_data) |
a33cce1c RW |
96 | { |
97 | struct policy_dbs_info *policy_dbs; | |
98 | ||
0dd3c1d6 | 99 | list_for_each_entry(policy_dbs, &dbs_data->attr_set.policy_list, list) { |
a33cce1c RW |
100 | unsigned int j; |
101 | ||
102 | for_each_cpu(j, policy_dbs->policy->cpus) { | |
8c8f77fd | 103 | struct cpu_dbs_info *j_cdbs = &per_cpu(cpu_dbs, j); |
a33cce1c | 104 | |
b4f4b4b3 | 105 | j_cdbs->prev_cpu_idle = get_cpu_idle_time(j, &j_cdbs->prev_update_time, |
a33cce1c RW |
106 | dbs_data->io_is_busy); |
107 | if (dbs_data->ignore_nice_load) | |
108 | j_cdbs->prev_cpu_nice = kcpustat_cpu(j).cpustat[CPUTIME_NICE]; | |
109 | } | |
110 | } | |
111 | } | |
112 | EXPORT_SYMBOL_GPL(gov_update_cpu_data); | |
113 | ||
4cccf755 | 114 | unsigned int dbs_update(struct cpufreq_policy *policy) |
4471a34f | 115 | { |
bc505475 RW |
116 | struct policy_dbs_info *policy_dbs = policy->governor_data; |
117 | struct dbs_data *dbs_data = policy_dbs->dbs_data; | |
ff4b1789 | 118 | unsigned int ignore_nice = dbs_data->ignore_nice_load; |
00bfe058 | 119 | unsigned int max_load = 0, idle_periods = UINT_MAX; |
8847e038 | 120 | unsigned int sampling_rate, io_busy, j; |
4471a34f | 121 | |
57dc3bcd RW |
122 | /* |
123 | * Sometimes governors may use an additional multiplier to increase | |
124 | * sample delays temporarily. Apply that multiplier to sampling_rate | |
125 | * so as to keep the wake-up-from-idle detection logic a bit | |
126 | * conservative. | |
127 | */ | |
128 | sampling_rate = dbs_data->sampling_rate * policy_dbs->rate_mult; | |
8847e038 RW |
129 | /* |
130 | * For the purpose of ondemand, waiting for disk IO is an indication | |
131 | * that you're performance critical, and not that the system is actually | |
132 | * idle, so do not add the iowait time to the CPU idle time then. | |
133 | */ | |
134 | io_busy = dbs_data->io_is_busy; | |
4471a34f | 135 | |
dfa5bb62 | 136 | /* Get Absolute Load */ |
4471a34f | 137 | for_each_cpu(j, policy->cpus) { |
8c8f77fd | 138 | struct cpu_dbs_info *j_cdbs = &per_cpu(cpu_dbs, j); |
b4f4b4b3 RW |
139 | u64 update_time, cur_idle_time; |
140 | unsigned int idle_time, time_elapsed; | |
4471a34f VK |
141 | unsigned int load; |
142 | ||
b4f4b4b3 | 143 | cur_idle_time = get_cpu_idle_time(j, &update_time, io_busy); |
4471a34f | 144 | |
b4f4b4b3 RW |
145 | time_elapsed = update_time - j_cdbs->prev_update_time; |
146 | j_cdbs->prev_update_time = update_time; | |
4471a34f | 147 | |
94862a62 RW |
148 | idle_time = cur_idle_time - j_cdbs->prev_cpu_idle; |
149 | j_cdbs->prev_cpu_idle = cur_idle_time; | |
4471a34f VK |
150 | |
151 | if (ignore_nice) { | |
679b8fe4 RW |
152 | u64 cur_nice = kcpustat_cpu(j).cpustat[CPUTIME_NICE]; |
153 | ||
7fb1327e | 154 | idle_time += div_u64(cur_nice - j_cdbs->prev_cpu_nice, NSEC_PER_USEC); |
679b8fe4 | 155 | j_cdbs->prev_cpu_nice = cur_nice; |
4471a34f VK |
156 | } |
157 | ||
9485e4ca RW |
158 | if (unlikely(!time_elapsed)) { |
159 | /* | |
160 | * That can only happen when this function is called | |
161 | * twice in a row with a very short interval between the | |
162 | * calls, so the previous load value can be used then. | |
163 | */ | |
18b46abd | 164 | load = j_cdbs->prev_load; |
9485e4ca RW |
165 | } else if (unlikely(time_elapsed > 2 * sampling_rate && |
166 | j_cdbs->prev_load)) { | |
c8ae481b | 167 | /* |
9485e4ca RW |
168 | * If the CPU had gone completely idle and a task has |
169 | * just woken up on this CPU now, it would be unfair to | |
170 | * calculate 'load' the usual way for this elapsed | |
171 | * time-window, because it would show near-zero load, | |
172 | * irrespective of how CPU intensive that task actually | |
173 | * was. This is undesirable for latency-sensitive bursty | |
174 | * workloads. | |
175 | * | |
176 | * To avoid this, reuse the 'load' from the previous | |
177 | * time-window and give this task a chance to start with | |
178 | * a reasonably high CPU frequency. However, that | |
179 | * shouldn't be over-done, lest we get stuck at a high | |
180 | * load (high frequency) for too long, even when the | |
181 | * current system load has actually dropped down, so | |
182 | * clear prev_load to guarantee that the load will be | |
183 | * computed again next time. | |
184 | * | |
185 | * Detecting this situation is easy: the governor's | |
186 | * utilization update handler would not have run during | |
187 | * CPU-idle periods. Hence, an unusually large | |
188 | * 'time_elapsed' (as compared to the sampling rate) | |
189 | * indicates this scenario. | |
c8ae481b | 190 | */ |
9485e4ca | 191 | load = j_cdbs->prev_load; |
c8ae481b | 192 | j_cdbs->prev_load = 0; |
18b46abd | 193 | } else { |
9485e4ca RW |
194 | if (time_elapsed >= idle_time) { |
195 | load = 100 * (time_elapsed - idle_time) / time_elapsed; | |
196 | } else { | |
197 | /* | |
198 | * That can happen if idle_time is returned by | |
199 | * get_cpu_idle_time_jiffy(). In that case | |
200 | * idle_time is roughly equal to the difference | |
201 | * between time_elapsed and "busy time" obtained | |
202 | * from CPU statistics. Then, the "busy time" | |
203 | * can end up being greater than time_elapsed | |
204 | * (for example, if jiffies_64 and the CPU | |
205 | * statistics are updated by different CPUs), | |
206 | * so idle_time may in fact be negative. That | |
207 | * means, though, that the CPU was busy all | |
208 | * the time (on the rough average) during the | |
209 | * last sampling interval and 100 can be | |
210 | * returned as the load. | |
211 | */ | |
212 | load = (int)idle_time < 0 ? 100 : 0; | |
213 | } | |
18b46abd | 214 | j_cdbs->prev_load = load; |
18b46abd | 215 | } |
4471a34f | 216 | |
00bfe058 SK |
217 | if (time_elapsed > 2 * sampling_rate) { |
218 | unsigned int periods = time_elapsed / sampling_rate; | |
219 | ||
220 | if (periods < idle_periods) | |
221 | idle_periods = periods; | |
222 | } | |
223 | ||
4471a34f VK |
224 | if (load > max_load) |
225 | max_load = load; | |
226 | } | |
00bfe058 SK |
227 | |
228 | policy_dbs->idle_periods = idle_periods; | |
229 | ||
4cccf755 | 230 | return max_load; |
4471a34f | 231 | } |
4cccf755 | 232 | EXPORT_SYMBOL_GPL(dbs_update); |
4471a34f | 233 | |
70f43e5e | 234 | static void dbs_work_handler(struct work_struct *work) |
43e0ee36 | 235 | { |
e40e7b25 | 236 | struct policy_dbs_info *policy_dbs; |
3a91b069 | 237 | struct cpufreq_policy *policy; |
ea59ee0d | 238 | struct dbs_governor *gov; |
43e0ee36 | 239 | |
e40e7b25 RW |
240 | policy_dbs = container_of(work, struct policy_dbs_info, work); |
241 | policy = policy_dbs->policy; | |
ea59ee0d | 242 | gov = dbs_governor_of(policy); |
3a91b069 | 243 | |
70f43e5e | 244 | /* |
9be4fd2c RW |
245 | * Make sure cpufreq_governor_limits() isn't evaluating load or the |
246 | * ondemand governor isn't updating the sampling rate in parallel. | |
70f43e5e | 247 | */ |
26f0dbc9 VK |
248 | mutex_lock(&policy_dbs->update_mutex); |
249 | gov_update_sample_delay(policy_dbs, gov->gov_dbs_update(policy)); | |
250 | mutex_unlock(&policy_dbs->update_mutex); | |
70f43e5e | 251 | |
e4db2813 RW |
252 | /* Allow the utilization update handler to queue up more work. */ |
253 | atomic_set(&policy_dbs->work_count, 0); | |
9be4fd2c | 254 | /* |
e4db2813 RW |
255 | * If the update below is reordered with respect to the sample delay |
256 | * modification, the utilization update handler may end up using a stale | |
257 | * sample delay value. | |
9be4fd2c | 258 | */ |
e4db2813 RW |
259 | smp_wmb(); |
260 | policy_dbs->work_in_progress = false; | |
9be4fd2c RW |
261 | } |
262 | ||
263 | static void dbs_irq_work(struct irq_work *irq_work) | |
264 | { | |
e40e7b25 | 265 | struct policy_dbs_info *policy_dbs; |
70f43e5e | 266 | |
e40e7b25 | 267 | policy_dbs = container_of(irq_work, struct policy_dbs_info, irq_work); |
539a4c42 | 268 | schedule_work_on(smp_processor_id(), &policy_dbs->work); |
70f43e5e VK |
269 | } |
270 | ||
9be4fd2c | 271 | static void dbs_update_util_handler(struct update_util_data *data, u64 time, |
58919e83 | 272 | unsigned int flags) |
9be4fd2c RW |
273 | { |
274 | struct cpu_dbs_info *cdbs = container_of(data, struct cpu_dbs_info, update_util); | |
e40e7b25 | 275 | struct policy_dbs_info *policy_dbs = cdbs->policy_dbs; |
27de3482 | 276 | u64 delta_ns, lst; |
70f43e5e VK |
277 | |
278 | /* | |
9be4fd2c RW |
279 | * The work may not be allowed to be queued up right now. |
280 | * Possible reasons: | |
281 | * - Work has already been queued up or is in progress. | |
9be4fd2c | 282 | * - It is too early (too little time from the previous sample). |
70f43e5e | 283 | */ |
e4db2813 RW |
284 | if (policy_dbs->work_in_progress) |
285 | return; | |
286 | ||
287 | /* | |
288 | * If the reads below are reordered before the check above, the value | |
289 | * of sample_delay_ns used in the computation may be stale. | |
290 | */ | |
291 | smp_rmb(); | |
27de3482 RW |
292 | lst = READ_ONCE(policy_dbs->last_sample_time); |
293 | delta_ns = time - lst; | |
e4db2813 RW |
294 | if ((s64)delta_ns < policy_dbs->sample_delay_ns) |
295 | return; | |
296 | ||
297 | /* | |
298 | * If the policy is not shared, the irq_work may be queued up right away | |
299 | * at this point. Otherwise, we need to ensure that only one of the | |
300 | * CPUs sharing the policy will do that. | |
301 | */ | |
27de3482 RW |
302 | if (policy_dbs->is_shared) { |
303 | if (!atomic_add_unless(&policy_dbs->work_count, 1, 1)) | |
304 | return; | |
305 | ||
306 | /* | |
307 | * If another CPU updated last_sample_time in the meantime, we | |
308 | * shouldn't be here, so clear the work counter and bail out. | |
309 | */ | |
310 | if (unlikely(lst != READ_ONCE(policy_dbs->last_sample_time))) { | |
311 | atomic_set(&policy_dbs->work_count, 0); | |
312 | return; | |
313 | } | |
314 | } | |
e4db2813 RW |
315 | |
316 | policy_dbs->last_sample_time = time; | |
317 | policy_dbs->work_in_progress = true; | |
318 | irq_work_queue(&policy_dbs->irq_work); | |
43e0ee36 | 319 | } |
4447266b | 320 | |
0bed612b RW |
321 | static void gov_set_update_util(struct policy_dbs_info *policy_dbs, |
322 | unsigned int delay_us) | |
323 | { | |
324 | struct cpufreq_policy *policy = policy_dbs->policy; | |
325 | int cpu; | |
326 | ||
327 | gov_update_sample_delay(policy_dbs, delay_us); | |
328 | policy_dbs->last_sample_time = 0; | |
329 | ||
330 | for_each_cpu(cpu, policy->cpus) { | |
331 | struct cpu_dbs_info *cdbs = &per_cpu(cpu_dbs, cpu); | |
332 | ||
333 | cpufreq_add_update_util_hook(cpu, &cdbs->update_util, | |
334 | dbs_update_util_handler); | |
335 | } | |
336 | } | |
337 | ||
338 | static inline void gov_clear_update_util(struct cpufreq_policy *policy) | |
339 | { | |
340 | int i; | |
341 | ||
342 | for_each_cpu(i, policy->cpus) | |
343 | cpufreq_remove_update_util_hook(i); | |
344 | ||
345 | synchronize_sched(); | |
346 | } | |
347 | ||
bc505475 RW |
348 | static struct policy_dbs_info *alloc_policy_dbs_info(struct cpufreq_policy *policy, |
349 | struct dbs_governor *gov) | |
44152cb8 | 350 | { |
e40e7b25 | 351 | struct policy_dbs_info *policy_dbs; |
44152cb8 VK |
352 | int j; |
353 | ||
7d5a9956 RW |
354 | /* Allocate memory for per-policy governor data. */ |
355 | policy_dbs = gov->alloc(); | |
e40e7b25 | 356 | if (!policy_dbs) |
bc505475 | 357 | return NULL; |
44152cb8 | 358 | |
581c214b | 359 | policy_dbs->policy = policy; |
26f0dbc9 | 360 | mutex_init(&policy_dbs->update_mutex); |
686cc637 | 361 | atomic_set(&policy_dbs->work_count, 0); |
e40e7b25 RW |
362 | init_irq_work(&policy_dbs->irq_work, dbs_irq_work); |
363 | INIT_WORK(&policy_dbs->work, dbs_work_handler); | |
cea6a9e7 RW |
364 | |
365 | /* Set policy_dbs for all CPUs, online+offline */ | |
366 | for_each_cpu(j, policy->related_cpus) { | |
8c8f77fd | 367 | struct cpu_dbs_info *j_cdbs = &per_cpu(cpu_dbs, j); |
cea6a9e7 RW |
368 | |
369 | j_cdbs->policy_dbs = policy_dbs; | |
cea6a9e7 | 370 | } |
bc505475 | 371 | return policy_dbs; |
44152cb8 VK |
372 | } |
373 | ||
8c8f77fd | 374 | static void free_policy_dbs_info(struct policy_dbs_info *policy_dbs, |
7bdad34d | 375 | struct dbs_governor *gov) |
44152cb8 | 376 | { |
44152cb8 VK |
377 | int j; |
378 | ||
26f0dbc9 | 379 | mutex_destroy(&policy_dbs->update_mutex); |
5e4500d8 | 380 | |
8c8f77fd RW |
381 | for_each_cpu(j, policy_dbs->policy->related_cpus) { |
382 | struct cpu_dbs_info *j_cdbs = &per_cpu(cpu_dbs, j); | |
44152cb8 | 383 | |
cea6a9e7 RW |
384 | j_cdbs->policy_dbs = NULL; |
385 | j_cdbs->update_util.func = NULL; | |
386 | } | |
7d5a9956 | 387 | gov->free(policy_dbs); |
44152cb8 VK |
388 | } |
389 | ||
e788892b | 390 | int cpufreq_dbs_governor_init(struct cpufreq_policy *policy) |
4471a34f | 391 | { |
ea59ee0d | 392 | struct dbs_governor *gov = dbs_governor_of(policy); |
1112e9d8 | 393 | struct dbs_data *dbs_data; |
bc505475 | 394 | struct policy_dbs_info *policy_dbs; |
714a2d9c | 395 | unsigned int latency; |
1112e9d8 | 396 | int ret = 0; |
4471a34f | 397 | |
a72c4959 VK |
398 | /* State should be equivalent to EXIT */ |
399 | if (policy->governor_data) | |
400 | return -EBUSY; | |
401 | ||
bc505475 RW |
402 | policy_dbs = alloc_policy_dbs_info(policy, gov); |
403 | if (!policy_dbs) | |
404 | return -ENOMEM; | |
44152cb8 | 405 | |
1112e9d8 RW |
406 | /* Protect gov->gdbs_data against concurrent updates. */ |
407 | mutex_lock(&gov_dbs_data_mutex); | |
408 | ||
409 | dbs_data = gov->gdbs_data; | |
bc505475 RW |
410 | if (dbs_data) { |
411 | if (WARN_ON(have_governor_per_policy())) { | |
412 | ret = -EINVAL; | |
413 | goto free_policy_dbs_info; | |
414 | } | |
bc505475 RW |
415 | policy_dbs->dbs_data = dbs_data; |
416 | policy->governor_data = policy_dbs; | |
c54df071 | 417 | |
0dd3c1d6 | 418 | gov_attr_set_get(&dbs_data->attr_set, &policy_dbs->list); |
1112e9d8 | 419 | goto out; |
714a2d9c | 420 | } |
4d5dcc42 | 421 | |
714a2d9c | 422 | dbs_data = kzalloc(sizeof(*dbs_data), GFP_KERNEL); |
bc505475 RW |
423 | if (!dbs_data) { |
424 | ret = -ENOMEM; | |
425 | goto free_policy_dbs_info; | |
426 | } | |
44152cb8 | 427 | |
0dd3c1d6 | 428 | gov_attr_set_init(&dbs_data->attr_set, &policy_dbs->list); |
4d5dcc42 | 429 | |
9a15fb2c | 430 | ret = gov->init(dbs_data); |
714a2d9c | 431 | if (ret) |
e40e7b25 | 432 | goto free_policy_dbs_info; |
4d5dcc42 | 433 | |
714a2d9c VK |
434 | /* policy latency is in ns. Convert it to us first */ |
435 | latency = policy->cpuinfo.transition_latency / 1000; | |
436 | if (latency == 0) | |
437 | latency = 1; | |
4d5dcc42 | 438 | |
714a2d9c VK |
439 | /* Bring kernel and HW constraints together */ |
440 | dbs_data->min_sampling_rate = max(dbs_data->min_sampling_rate, | |
441 | MIN_LATENCY_MULTIPLIER * latency); | |
ff4b1789 VK |
442 | dbs_data->sampling_rate = max(dbs_data->min_sampling_rate, |
443 | LATENCY_MULTIPLIER * latency); | |
2361be23 | 444 | |
8eec1020 | 445 | if (!have_governor_per_policy()) |
7bdad34d | 446 | gov->gdbs_data = dbs_data; |
4d5dcc42 | 447 | |
c54df071 | 448 | policy_dbs->dbs_data = dbs_data; |
0dd3c1d6 | 449 | policy->governor_data = policy_dbs; |
c54df071 | 450 | |
c4435630 | 451 | gov->kobj_type.sysfs_ops = &governor_sysfs_ops; |
0dd3c1d6 | 452 | ret = kobject_init_and_add(&dbs_data->attr_set.kobj, &gov->kobj_type, |
c4435630 VK |
453 | get_governor_parent_kobj(policy), |
454 | "%s", gov->gov.name); | |
fafd5e8a | 455 | if (!ret) |
1112e9d8 | 456 | goto out; |
4d5dcc42 | 457 | |
fafd5e8a | 458 | /* Failure, so roll back. */ |
666f4ccc | 459 | pr_err("initialization failed (dbs_data kobject init error %d)\n", ret); |
4d5dcc42 | 460 | |
e4b133cc VK |
461 | policy->governor_data = NULL; |
462 | ||
8eec1020 | 463 | if (!have_governor_per_policy()) |
7bdad34d | 464 | gov->gdbs_data = NULL; |
9a15fb2c | 465 | gov->exit(dbs_data); |
bc505475 RW |
466 | kfree(dbs_data); |
467 | ||
e40e7b25 | 468 | free_policy_dbs_info: |
8c8f77fd | 469 | free_policy_dbs_info(policy_dbs, gov); |
1112e9d8 RW |
470 | |
471 | out: | |
472 | mutex_unlock(&gov_dbs_data_mutex); | |
714a2d9c VK |
473 | return ret; |
474 | } | |
e788892b | 475 | EXPORT_SYMBOL_GPL(cpufreq_dbs_governor_init); |
4d5dcc42 | 476 | |
e788892b | 477 | void cpufreq_dbs_governor_exit(struct cpufreq_policy *policy) |
714a2d9c | 478 | { |
ea59ee0d | 479 | struct dbs_governor *gov = dbs_governor_of(policy); |
bc505475 RW |
480 | struct policy_dbs_info *policy_dbs = policy->governor_data; |
481 | struct dbs_data *dbs_data = policy_dbs->dbs_data; | |
0dd3c1d6 | 482 | unsigned int count; |
a72c4959 | 483 | |
1112e9d8 RW |
484 | /* Protect gov->gdbs_data against concurrent updates. */ |
485 | mutex_lock(&gov_dbs_data_mutex); | |
486 | ||
0dd3c1d6 | 487 | count = gov_attr_set_put(&dbs_data->attr_set, &policy_dbs->list); |
2361be23 | 488 | |
0dd3c1d6 | 489 | policy->governor_data = NULL; |
e4b133cc | 490 | |
0dd3c1d6 | 491 | if (!count) { |
8eec1020 | 492 | if (!have_governor_per_policy()) |
7bdad34d | 493 | gov->gdbs_data = NULL; |
4471a34f | 494 | |
9a15fb2c | 495 | gov->exit(dbs_data); |
714a2d9c | 496 | kfree(dbs_data); |
4d5dcc42 | 497 | } |
44152cb8 | 498 | |
8c8f77fd | 499 | free_policy_dbs_info(policy_dbs, gov); |
1112e9d8 RW |
500 | |
501 | mutex_unlock(&gov_dbs_data_mutex); | |
714a2d9c | 502 | } |
e788892b | 503 | EXPORT_SYMBOL_GPL(cpufreq_dbs_governor_exit); |
4d5dcc42 | 504 | |
e788892b | 505 | int cpufreq_dbs_governor_start(struct cpufreq_policy *policy) |
714a2d9c | 506 | { |
ea59ee0d | 507 | struct dbs_governor *gov = dbs_governor_of(policy); |
bc505475 RW |
508 | struct policy_dbs_info *policy_dbs = policy->governor_data; |
509 | struct dbs_data *dbs_data = policy_dbs->dbs_data; | |
702c9e54 | 510 | unsigned int sampling_rate, ignore_nice, j; |
8847e038 | 511 | unsigned int io_busy; |
714a2d9c VK |
512 | |
513 | if (!policy->cur) | |
514 | return -EINVAL; | |
515 | ||
e4db2813 | 516 | policy_dbs->is_shared = policy_is_shared(policy); |
57dc3bcd | 517 | policy_dbs->rate_mult = 1; |
e4db2813 | 518 | |
ff4b1789 VK |
519 | sampling_rate = dbs_data->sampling_rate; |
520 | ignore_nice = dbs_data->ignore_nice_load; | |
8847e038 | 521 | io_busy = dbs_data->io_is_busy; |
4471a34f | 522 | |
714a2d9c | 523 | for_each_cpu(j, policy->cpus) { |
8c8f77fd | 524 | struct cpu_dbs_info *j_cdbs = &per_cpu(cpu_dbs, j); |
4471a34f | 525 | |
b4f4b4b3 | 526 | j_cdbs->prev_cpu_idle = get_cpu_idle_time(j, &j_cdbs->prev_update_time, io_busy); |
ba1ca654 RW |
527 | /* |
528 | * Make the first invocation of dbs_update() compute the load. | |
529 | */ | |
530 | j_cdbs->prev_load = 0; | |
18b46abd | 531 | |
714a2d9c VK |
532 | if (ignore_nice) |
533 | j_cdbs->prev_cpu_nice = kcpustat_cpu(j).cpustat[CPUTIME_NICE]; | |
714a2d9c | 534 | } |
2abfa876 | 535 | |
702c9e54 | 536 | gov->start(policy); |
4471a34f | 537 | |
e40e7b25 | 538 | gov_set_update_util(policy_dbs, sampling_rate); |
714a2d9c VK |
539 | return 0; |
540 | } | |
e788892b | 541 | EXPORT_SYMBOL_GPL(cpufreq_dbs_governor_start); |
714a2d9c | 542 | |
e788892b | 543 | void cpufreq_dbs_governor_stop(struct cpufreq_policy *policy) |
714a2d9c | 544 | { |
f6709b8a RW |
545 | struct policy_dbs_info *policy_dbs = policy->governor_data; |
546 | ||
547 | gov_clear_update_util(policy_dbs->policy); | |
548 | irq_work_sync(&policy_dbs->irq_work); | |
549 | cancel_work_sync(&policy_dbs->work); | |
550 | atomic_set(&policy_dbs->work_count, 0); | |
551 | policy_dbs->work_in_progress = false; | |
714a2d9c | 552 | } |
e788892b | 553 | EXPORT_SYMBOL_GPL(cpufreq_dbs_governor_stop); |
4471a34f | 554 | |
e788892b | 555 | void cpufreq_dbs_governor_limits(struct cpufreq_policy *policy) |
714a2d9c | 556 | { |
bc505475 | 557 | struct policy_dbs_info *policy_dbs = policy->governor_data; |
8eeed095 | 558 | |
26f0dbc9 | 559 | mutex_lock(&policy_dbs->update_mutex); |
bf2be2de | 560 | cpufreq_policy_apply_limits(policy); |
4cccf755 RW |
561 | gov_update_sample_delay(policy_dbs, 0); |
562 | ||
26f0dbc9 | 563 | mutex_unlock(&policy_dbs->update_mutex); |
4471a34f | 564 | } |
e788892b | 565 | EXPORT_SYMBOL_GPL(cpufreq_dbs_governor_limits); |