Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2010-2011 Canonical Ltd <jeremy.kerr@canonical.com> |
| 3 | * Copyright (C) 2011-2012 Linaro Ltd <mturquette@linaro.org> |
| 4 | * |
| 5 | * This program is free software; you can redistribute it and/or modify |
| 6 | * it under the terms of the GNU General Public License version 2 as |
| 7 | * published by the Free Software Foundation. |
| 8 | * |
| 9 | * Standard functionality for the common clock API. See Documentation/clk.txt |
| 10 | */ |
| 11 | |
| 12 | #include <linux/clk-private.h> |
| 13 | #include <linux/module.h> |
| 14 | #include <linux/mutex.h> |
| 15 | #include <linux/spinlock.h> |
| 16 | #include <linux/err.h> |
| 17 | #include <linux/list.h> |
| 18 | #include <linux/slab.h> |
Grant Likely | 766e6a4 | 2012-04-09 14:50:06 -0500 | [diff] [blame] | 19 | #include <linux/of.h> |
Stephen Boyd | 46c8773 | 2012-09-24 13:38:04 -0700 | [diff] [blame] | 20 | #include <linux/device.h> |
Prashant Gaikwad | f2f6c25 | 2013-01-04 12:30:52 +0530 | [diff] [blame] | 21 | #include <linux/init.h> |
Mike Turquette | 533ddeb | 2013-03-28 13:59:02 -0700 | [diff] [blame] | 22 | #include <linux/sched.h> |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 23 | |
| 24 | static DEFINE_SPINLOCK(enable_lock); |
| 25 | static DEFINE_MUTEX(prepare_lock); |
| 26 | |
Mike Turquette | 533ddeb | 2013-03-28 13:59:02 -0700 | [diff] [blame] | 27 | static struct task_struct *prepare_owner; |
| 28 | static struct task_struct *enable_owner; |
| 29 | |
| 30 | static int prepare_refcnt; |
| 31 | static int enable_refcnt; |
| 32 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 33 | static HLIST_HEAD(clk_root_list); |
| 34 | static HLIST_HEAD(clk_orphan_list); |
| 35 | static LIST_HEAD(clk_notifier_list); |
| 36 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 37 | /*** locking ***/ |
| 38 | static void clk_prepare_lock(void) |
| 39 | { |
Mike Turquette | 533ddeb | 2013-03-28 13:59:02 -0700 | [diff] [blame] | 40 | if (!mutex_trylock(&prepare_lock)) { |
| 41 | if (prepare_owner == current) { |
| 42 | prepare_refcnt++; |
| 43 | return; |
| 44 | } |
| 45 | mutex_lock(&prepare_lock); |
| 46 | } |
| 47 | WARN_ON_ONCE(prepare_owner != NULL); |
| 48 | WARN_ON_ONCE(prepare_refcnt != 0); |
| 49 | prepare_owner = current; |
| 50 | prepare_refcnt = 1; |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 51 | } |
| 52 | |
| 53 | static void clk_prepare_unlock(void) |
| 54 | { |
Mike Turquette | 533ddeb | 2013-03-28 13:59:02 -0700 | [diff] [blame] | 55 | WARN_ON_ONCE(prepare_owner != current); |
| 56 | WARN_ON_ONCE(prepare_refcnt == 0); |
| 57 | |
| 58 | if (--prepare_refcnt) |
| 59 | return; |
| 60 | prepare_owner = NULL; |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 61 | mutex_unlock(&prepare_lock); |
| 62 | } |
| 63 | |
| 64 | static unsigned long clk_enable_lock(void) |
| 65 | { |
| 66 | unsigned long flags; |
Mike Turquette | 533ddeb | 2013-03-28 13:59:02 -0700 | [diff] [blame] | 67 | |
| 68 | if (!spin_trylock_irqsave(&enable_lock, flags)) { |
| 69 | if (enable_owner == current) { |
| 70 | enable_refcnt++; |
| 71 | return flags; |
| 72 | } |
| 73 | spin_lock_irqsave(&enable_lock, flags); |
| 74 | } |
| 75 | WARN_ON_ONCE(enable_owner != NULL); |
| 76 | WARN_ON_ONCE(enable_refcnt != 0); |
| 77 | enable_owner = current; |
| 78 | enable_refcnt = 1; |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 79 | return flags; |
| 80 | } |
| 81 | |
| 82 | static void clk_enable_unlock(unsigned long flags) |
| 83 | { |
Mike Turquette | 533ddeb | 2013-03-28 13:59:02 -0700 | [diff] [blame] | 84 | WARN_ON_ONCE(enable_owner != current); |
| 85 | WARN_ON_ONCE(enable_refcnt == 0); |
| 86 | |
| 87 | if (--enable_refcnt) |
| 88 | return; |
| 89 | enable_owner = NULL; |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 90 | spin_unlock_irqrestore(&enable_lock, flags); |
| 91 | } |
| 92 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 93 | /*** debugfs support ***/ |
| 94 | |
| 95 | #ifdef CONFIG_COMMON_CLK_DEBUG |
| 96 | #include <linux/debugfs.h> |
| 97 | |
| 98 | static struct dentry *rootdir; |
| 99 | static struct dentry *orphandir; |
| 100 | static int inited = 0; |
| 101 | |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 102 | static void clk_summary_show_one(struct seq_file *s, struct clk *c, int level) |
| 103 | { |
| 104 | if (!c) |
| 105 | return; |
| 106 | |
| 107 | seq_printf(s, "%*s%-*s %-11d %-12d %-10lu", |
| 108 | level * 3 + 1, "", |
| 109 | 30 - level * 3, c->name, |
Peter De Schrijver | 670decd | 2013-06-05 18:06:35 +0300 | [diff] [blame] | 110 | c->enable_count, c->prepare_count, clk_get_rate(c)); |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 111 | seq_printf(s, "\n"); |
| 112 | } |
| 113 | |
| 114 | static void clk_summary_show_subtree(struct seq_file *s, struct clk *c, |
| 115 | int level) |
| 116 | { |
| 117 | struct clk *child; |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 118 | |
| 119 | if (!c) |
| 120 | return; |
| 121 | |
| 122 | clk_summary_show_one(s, c, level); |
| 123 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 124 | hlist_for_each_entry(child, &c->children, child_node) |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 125 | clk_summary_show_subtree(s, child, level + 1); |
| 126 | } |
| 127 | |
| 128 | static int clk_summary_show(struct seq_file *s, void *data) |
| 129 | { |
| 130 | struct clk *c; |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 131 | |
| 132 | seq_printf(s, " clock enable_cnt prepare_cnt rate\n"); |
| 133 | seq_printf(s, "---------------------------------------------------------------------\n"); |
| 134 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 135 | clk_prepare_lock(); |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 136 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 137 | hlist_for_each_entry(c, &clk_root_list, child_node) |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 138 | clk_summary_show_subtree(s, c, 0); |
| 139 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 140 | hlist_for_each_entry(c, &clk_orphan_list, child_node) |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 141 | clk_summary_show_subtree(s, c, 0); |
| 142 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 143 | clk_prepare_unlock(); |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 144 | |
| 145 | return 0; |
| 146 | } |
| 147 | |
| 148 | |
| 149 | static int clk_summary_open(struct inode *inode, struct file *file) |
| 150 | { |
| 151 | return single_open(file, clk_summary_show, inode->i_private); |
| 152 | } |
| 153 | |
| 154 | static const struct file_operations clk_summary_fops = { |
| 155 | .open = clk_summary_open, |
| 156 | .read = seq_read, |
| 157 | .llseek = seq_lseek, |
| 158 | .release = single_release, |
| 159 | }; |
| 160 | |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 161 | static void clk_dump_one(struct seq_file *s, struct clk *c, int level) |
| 162 | { |
| 163 | if (!c) |
| 164 | return; |
| 165 | |
| 166 | seq_printf(s, "\"%s\": { ", c->name); |
| 167 | seq_printf(s, "\"enable_count\": %d,", c->enable_count); |
| 168 | seq_printf(s, "\"prepare_count\": %d,", c->prepare_count); |
Peter De Schrijver | 670decd | 2013-06-05 18:06:35 +0300 | [diff] [blame] | 169 | seq_printf(s, "\"rate\": %lu", clk_get_rate(c)); |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 170 | } |
| 171 | |
| 172 | static void clk_dump_subtree(struct seq_file *s, struct clk *c, int level) |
| 173 | { |
| 174 | struct clk *child; |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 175 | |
| 176 | if (!c) |
| 177 | return; |
| 178 | |
| 179 | clk_dump_one(s, c, level); |
| 180 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 181 | hlist_for_each_entry(child, &c->children, child_node) { |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 182 | seq_printf(s, ","); |
| 183 | clk_dump_subtree(s, child, level + 1); |
| 184 | } |
| 185 | |
| 186 | seq_printf(s, "}"); |
| 187 | } |
| 188 | |
| 189 | static int clk_dump(struct seq_file *s, void *data) |
| 190 | { |
| 191 | struct clk *c; |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 192 | bool first_node = true; |
| 193 | |
| 194 | seq_printf(s, "{"); |
| 195 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 196 | clk_prepare_lock(); |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 197 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 198 | hlist_for_each_entry(c, &clk_root_list, child_node) { |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 199 | if (!first_node) |
| 200 | seq_printf(s, ","); |
| 201 | first_node = false; |
| 202 | clk_dump_subtree(s, c, 0); |
| 203 | } |
| 204 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 205 | hlist_for_each_entry(c, &clk_orphan_list, child_node) { |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 206 | seq_printf(s, ","); |
| 207 | clk_dump_subtree(s, c, 0); |
| 208 | } |
| 209 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 210 | clk_prepare_unlock(); |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 211 | |
| 212 | seq_printf(s, "}"); |
| 213 | return 0; |
| 214 | } |
| 215 | |
| 216 | |
| 217 | static int clk_dump_open(struct inode *inode, struct file *file) |
| 218 | { |
| 219 | return single_open(file, clk_dump, inode->i_private); |
| 220 | } |
| 221 | |
| 222 | static const struct file_operations clk_dump_fops = { |
| 223 | .open = clk_dump_open, |
| 224 | .read = seq_read, |
| 225 | .llseek = seq_lseek, |
| 226 | .release = single_release, |
| 227 | }; |
| 228 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 229 | /* caller must hold prepare_lock */ |
| 230 | static int clk_debug_create_one(struct clk *clk, struct dentry *pdentry) |
| 231 | { |
| 232 | struct dentry *d; |
| 233 | int ret = -ENOMEM; |
| 234 | |
| 235 | if (!clk || !pdentry) { |
| 236 | ret = -EINVAL; |
| 237 | goto out; |
| 238 | } |
| 239 | |
| 240 | d = debugfs_create_dir(clk->name, pdentry); |
| 241 | if (!d) |
| 242 | goto out; |
| 243 | |
| 244 | clk->dentry = d; |
| 245 | |
| 246 | d = debugfs_create_u32("clk_rate", S_IRUGO, clk->dentry, |
| 247 | (u32 *)&clk->rate); |
| 248 | if (!d) |
| 249 | goto err_out; |
| 250 | |
| 251 | d = debugfs_create_x32("clk_flags", S_IRUGO, clk->dentry, |
| 252 | (u32 *)&clk->flags); |
| 253 | if (!d) |
| 254 | goto err_out; |
| 255 | |
| 256 | d = debugfs_create_u32("clk_prepare_count", S_IRUGO, clk->dentry, |
| 257 | (u32 *)&clk->prepare_count); |
| 258 | if (!d) |
| 259 | goto err_out; |
| 260 | |
| 261 | d = debugfs_create_u32("clk_enable_count", S_IRUGO, clk->dentry, |
| 262 | (u32 *)&clk->enable_count); |
| 263 | if (!d) |
| 264 | goto err_out; |
| 265 | |
| 266 | d = debugfs_create_u32("clk_notifier_count", S_IRUGO, clk->dentry, |
| 267 | (u32 *)&clk->notifier_count); |
| 268 | if (!d) |
| 269 | goto err_out; |
| 270 | |
| 271 | ret = 0; |
| 272 | goto out; |
| 273 | |
| 274 | err_out: |
| 275 | debugfs_remove(clk->dentry); |
| 276 | out: |
| 277 | return ret; |
| 278 | } |
| 279 | |
| 280 | /* caller must hold prepare_lock */ |
| 281 | static int clk_debug_create_subtree(struct clk *clk, struct dentry *pdentry) |
| 282 | { |
| 283 | struct clk *child; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 284 | int ret = -EINVAL;; |
| 285 | |
| 286 | if (!clk || !pdentry) |
| 287 | goto out; |
| 288 | |
| 289 | ret = clk_debug_create_one(clk, pdentry); |
| 290 | |
| 291 | if (ret) |
| 292 | goto out; |
| 293 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 294 | hlist_for_each_entry(child, &clk->children, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 295 | clk_debug_create_subtree(child, clk->dentry); |
| 296 | |
| 297 | ret = 0; |
| 298 | out: |
| 299 | return ret; |
| 300 | } |
| 301 | |
| 302 | /** |
| 303 | * clk_debug_register - add a clk node to the debugfs clk tree |
| 304 | * @clk: the clk being added to the debugfs clk tree |
| 305 | * |
| 306 | * Dynamically adds a clk to the debugfs clk tree if debugfs has been |
| 307 | * initialized. Otherwise it bails out early since the debugfs clk tree |
| 308 | * will be created lazily by clk_debug_init as part of a late_initcall. |
| 309 | * |
| 310 | * Caller must hold prepare_lock. Only clk_init calls this function (so |
| 311 | * far) so this is taken care. |
| 312 | */ |
| 313 | static int clk_debug_register(struct clk *clk) |
| 314 | { |
| 315 | struct clk *parent; |
| 316 | struct dentry *pdentry; |
| 317 | int ret = 0; |
| 318 | |
| 319 | if (!inited) |
| 320 | goto out; |
| 321 | |
| 322 | parent = clk->parent; |
| 323 | |
| 324 | /* |
| 325 | * Check to see if a clk is a root clk. Also check that it is |
| 326 | * safe to add this clk to debugfs |
| 327 | */ |
| 328 | if (!parent) |
| 329 | if (clk->flags & CLK_IS_ROOT) |
| 330 | pdentry = rootdir; |
| 331 | else |
| 332 | pdentry = orphandir; |
| 333 | else |
| 334 | if (parent->dentry) |
| 335 | pdentry = parent->dentry; |
| 336 | else |
| 337 | goto out; |
| 338 | |
| 339 | ret = clk_debug_create_subtree(clk, pdentry); |
| 340 | |
| 341 | out: |
| 342 | return ret; |
| 343 | } |
| 344 | |
| 345 | /** |
Ulf Hansson | b33d212 | 2013-04-02 23:09:37 +0200 | [diff] [blame] | 346 | * clk_debug_reparent - reparent clk node in the debugfs clk tree |
| 347 | * @clk: the clk being reparented |
| 348 | * @new_parent: the new clk parent, may be NULL |
| 349 | * |
| 350 | * Rename clk entry in the debugfs clk tree if debugfs has been |
| 351 | * initialized. Otherwise it bails out early since the debugfs clk tree |
| 352 | * will be created lazily by clk_debug_init as part of a late_initcall. |
| 353 | * |
| 354 | * Caller must hold prepare_lock. |
| 355 | */ |
| 356 | static void clk_debug_reparent(struct clk *clk, struct clk *new_parent) |
| 357 | { |
| 358 | struct dentry *d; |
| 359 | struct dentry *new_parent_d; |
| 360 | |
| 361 | if (!inited) |
| 362 | return; |
| 363 | |
| 364 | if (new_parent) |
| 365 | new_parent_d = new_parent->dentry; |
| 366 | else |
| 367 | new_parent_d = orphandir; |
| 368 | |
| 369 | d = debugfs_rename(clk->dentry->d_parent, clk->dentry, |
| 370 | new_parent_d, clk->name); |
| 371 | if (d) |
| 372 | clk->dentry = d; |
| 373 | else |
| 374 | pr_debug("%s: failed to rename debugfs entry for %s\n", |
| 375 | __func__, clk->name); |
| 376 | } |
| 377 | |
| 378 | /** |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 379 | * clk_debug_init - lazily create the debugfs clk tree visualization |
| 380 | * |
| 381 | * clks are often initialized very early during boot before memory can |
| 382 | * be dynamically allocated and well before debugfs is setup. |
| 383 | * clk_debug_init walks the clk tree hierarchy while holding |
| 384 | * prepare_lock and creates the topology as part of a late_initcall, |
| 385 | * thus insuring that clks initialized very early will still be |
| 386 | * represented in the debugfs clk tree. This function should only be |
| 387 | * called once at boot-time, and all other clks added dynamically will |
| 388 | * be done so with clk_debug_register. |
| 389 | */ |
| 390 | static int __init clk_debug_init(void) |
| 391 | { |
| 392 | struct clk *clk; |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 393 | struct dentry *d; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 394 | |
| 395 | rootdir = debugfs_create_dir("clk", NULL); |
| 396 | |
| 397 | if (!rootdir) |
| 398 | return -ENOMEM; |
| 399 | |
Prashant Gaikwad | 1af599d | 2012-12-26 19:16:22 +0530 | [diff] [blame] | 400 | d = debugfs_create_file("clk_summary", S_IRUGO, rootdir, NULL, |
| 401 | &clk_summary_fops); |
| 402 | if (!d) |
| 403 | return -ENOMEM; |
| 404 | |
Prashant Gaikwad | bddca89 | 2012-12-26 19:16:23 +0530 | [diff] [blame] | 405 | d = debugfs_create_file("clk_dump", S_IRUGO, rootdir, NULL, |
| 406 | &clk_dump_fops); |
| 407 | if (!d) |
| 408 | return -ENOMEM; |
| 409 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 410 | orphandir = debugfs_create_dir("orphans", rootdir); |
| 411 | |
| 412 | if (!orphandir) |
| 413 | return -ENOMEM; |
| 414 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 415 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 416 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 417 | hlist_for_each_entry(clk, &clk_root_list, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 418 | clk_debug_create_subtree(clk, rootdir); |
| 419 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 420 | hlist_for_each_entry(clk, &clk_orphan_list, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 421 | clk_debug_create_subtree(clk, orphandir); |
| 422 | |
| 423 | inited = 1; |
| 424 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 425 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 426 | |
| 427 | return 0; |
| 428 | } |
| 429 | late_initcall(clk_debug_init); |
| 430 | #else |
| 431 | static inline int clk_debug_register(struct clk *clk) { return 0; } |
Ulf Hansson | b33d212 | 2013-04-02 23:09:37 +0200 | [diff] [blame] | 432 | static inline void clk_debug_reparent(struct clk *clk, struct clk *new_parent) |
| 433 | { |
| 434 | } |
Mike Turquette | 70d347e | 2012-03-26 11:53:47 -0700 | [diff] [blame] | 435 | #endif |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 436 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 437 | /* caller must hold prepare_lock */ |
Ulf Hansson | 1c155b3 | 2013-03-12 20:26:03 +0100 | [diff] [blame] | 438 | static void clk_unprepare_unused_subtree(struct clk *clk) |
| 439 | { |
| 440 | struct clk *child; |
| 441 | |
| 442 | if (!clk) |
| 443 | return; |
| 444 | |
| 445 | hlist_for_each_entry(child, &clk->children, child_node) |
| 446 | clk_unprepare_unused_subtree(child); |
| 447 | |
| 448 | if (clk->prepare_count) |
| 449 | return; |
| 450 | |
| 451 | if (clk->flags & CLK_IGNORE_UNUSED) |
| 452 | return; |
| 453 | |
Ulf Hansson | 3cc8247 | 2013-03-12 20:26:04 +0100 | [diff] [blame] | 454 | if (__clk_is_prepared(clk)) { |
| 455 | if (clk->ops->unprepare_unused) |
| 456 | clk->ops->unprepare_unused(clk->hw); |
| 457 | else if (clk->ops->unprepare) |
Ulf Hansson | 1c155b3 | 2013-03-12 20:26:03 +0100 | [diff] [blame] | 458 | clk->ops->unprepare(clk->hw); |
Ulf Hansson | 3cc8247 | 2013-03-12 20:26:04 +0100 | [diff] [blame] | 459 | } |
Ulf Hansson | 1c155b3 | 2013-03-12 20:26:03 +0100 | [diff] [blame] | 460 | } |
| 461 | |
| 462 | /* caller must hold prepare_lock */ |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 463 | static void clk_disable_unused_subtree(struct clk *clk) |
| 464 | { |
| 465 | struct clk *child; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 466 | unsigned long flags; |
| 467 | |
| 468 | if (!clk) |
| 469 | goto out; |
| 470 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 471 | hlist_for_each_entry(child, &clk->children, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 472 | clk_disable_unused_subtree(child); |
| 473 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 474 | flags = clk_enable_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 475 | |
| 476 | if (clk->enable_count) |
| 477 | goto unlock_out; |
| 478 | |
| 479 | if (clk->flags & CLK_IGNORE_UNUSED) |
| 480 | goto unlock_out; |
| 481 | |
Mike Turquette | 7c045a5 | 2012-12-04 11:00:35 -0800 | [diff] [blame] | 482 | /* |
| 483 | * some gate clocks have special needs during the disable-unused |
| 484 | * sequence. call .disable_unused if available, otherwise fall |
| 485 | * back to .disable |
| 486 | */ |
| 487 | if (__clk_is_enabled(clk)) { |
| 488 | if (clk->ops->disable_unused) |
| 489 | clk->ops->disable_unused(clk->hw); |
| 490 | else if (clk->ops->disable) |
| 491 | clk->ops->disable(clk->hw); |
| 492 | } |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 493 | |
| 494 | unlock_out: |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 495 | clk_enable_unlock(flags); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 496 | |
| 497 | out: |
| 498 | return; |
| 499 | } |
| 500 | |
Olof Johansson | 1e43525 | 2013-04-27 14:10:18 -0700 | [diff] [blame] | 501 | static bool clk_ignore_unused; |
| 502 | static int __init clk_ignore_unused_setup(char *__unused) |
| 503 | { |
| 504 | clk_ignore_unused = true; |
| 505 | return 1; |
| 506 | } |
| 507 | __setup("clk_ignore_unused", clk_ignore_unused_setup); |
| 508 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 509 | static int clk_disable_unused(void) |
| 510 | { |
| 511 | struct clk *clk; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 512 | |
Olof Johansson | 1e43525 | 2013-04-27 14:10:18 -0700 | [diff] [blame] | 513 | if (clk_ignore_unused) { |
| 514 | pr_warn("clk: Not disabling unused clocks\n"); |
| 515 | return 0; |
| 516 | } |
| 517 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 518 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 519 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 520 | hlist_for_each_entry(clk, &clk_root_list, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 521 | clk_disable_unused_subtree(clk); |
| 522 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 523 | hlist_for_each_entry(clk, &clk_orphan_list, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 524 | clk_disable_unused_subtree(clk); |
| 525 | |
Ulf Hansson | 1c155b3 | 2013-03-12 20:26:03 +0100 | [diff] [blame] | 526 | hlist_for_each_entry(clk, &clk_root_list, child_node) |
| 527 | clk_unprepare_unused_subtree(clk); |
| 528 | |
| 529 | hlist_for_each_entry(clk, &clk_orphan_list, child_node) |
| 530 | clk_unprepare_unused_subtree(clk); |
| 531 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 532 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 533 | |
| 534 | return 0; |
| 535 | } |
Saravana Kannan | d41d580 | 2013-05-09 11:35:01 -0700 | [diff] [blame] | 536 | late_initcall_sync(clk_disable_unused); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 537 | |
| 538 | /*** helper functions ***/ |
| 539 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 540 | const char *__clk_get_name(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 541 | { |
| 542 | return !clk ? NULL : clk->name; |
| 543 | } |
Niels de Vos | 4895084 | 2012-12-13 13:12:25 +0100 | [diff] [blame] | 544 | EXPORT_SYMBOL_GPL(__clk_get_name); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 545 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 546 | struct clk_hw *__clk_get_hw(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 547 | { |
| 548 | return !clk ? NULL : clk->hw; |
| 549 | } |
| 550 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 551 | u8 __clk_get_num_parents(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 552 | { |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 553 | return !clk ? 0 : clk->num_parents; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 554 | } |
| 555 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 556 | struct clk *__clk_get_parent(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 557 | { |
| 558 | return !clk ? NULL : clk->parent; |
| 559 | } |
| 560 | |
James Hogan | 7ef3dcc | 2013-07-29 12:24:58 +0100 | [diff] [blame] | 561 | struct clk *clk_get_parent_by_index(struct clk *clk, u8 index) |
| 562 | { |
| 563 | if (!clk || index >= clk->num_parents) |
| 564 | return NULL; |
| 565 | else if (!clk->parents) |
| 566 | return __clk_lookup(clk->parent_names[index]); |
| 567 | else if (!clk->parents[index]) |
| 568 | return clk->parents[index] = |
| 569 | __clk_lookup(clk->parent_names[index]); |
| 570 | else |
| 571 | return clk->parents[index]; |
| 572 | } |
| 573 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 574 | unsigned int __clk_get_enable_count(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 575 | { |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 576 | return !clk ? 0 : clk->enable_count; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 577 | } |
| 578 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 579 | unsigned int __clk_get_prepare_count(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 580 | { |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 581 | return !clk ? 0 : clk->prepare_count; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 582 | } |
| 583 | |
| 584 | unsigned long __clk_get_rate(struct clk *clk) |
| 585 | { |
| 586 | unsigned long ret; |
| 587 | |
| 588 | if (!clk) { |
Rajendra Nayak | 34e44fe | 2012-03-26 19:01:48 +0530 | [diff] [blame] | 589 | ret = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 590 | goto out; |
| 591 | } |
| 592 | |
| 593 | ret = clk->rate; |
| 594 | |
| 595 | if (clk->flags & CLK_IS_ROOT) |
| 596 | goto out; |
| 597 | |
| 598 | if (!clk->parent) |
Rajendra Nayak | 34e44fe | 2012-03-26 19:01:48 +0530 | [diff] [blame] | 599 | ret = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 600 | |
| 601 | out: |
| 602 | return ret; |
| 603 | } |
| 604 | |
Russ Dill | 65800b2 | 2012-11-26 11:20:09 -0800 | [diff] [blame] | 605 | unsigned long __clk_get_flags(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 606 | { |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 607 | return !clk ? 0 : clk->flags; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 608 | } |
Thierry Reding | b05c683 | 2013-09-03 09:43:51 +0200 | [diff] [blame] | 609 | EXPORT_SYMBOL_GPL(__clk_get_flags); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 610 | |
Ulf Hansson | 3d6ee28 | 2013-03-12 20:26:02 +0100 | [diff] [blame] | 611 | bool __clk_is_prepared(struct clk *clk) |
| 612 | { |
| 613 | int ret; |
| 614 | |
| 615 | if (!clk) |
| 616 | return false; |
| 617 | |
| 618 | /* |
| 619 | * .is_prepared is optional for clocks that can prepare |
| 620 | * fall back to software usage counter if it is missing |
| 621 | */ |
| 622 | if (!clk->ops->is_prepared) { |
| 623 | ret = clk->prepare_count ? 1 : 0; |
| 624 | goto out; |
| 625 | } |
| 626 | |
| 627 | ret = clk->ops->is_prepared(clk->hw); |
| 628 | out: |
| 629 | return !!ret; |
| 630 | } |
| 631 | |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 632 | bool __clk_is_enabled(struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 633 | { |
| 634 | int ret; |
| 635 | |
| 636 | if (!clk) |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 637 | return false; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 638 | |
| 639 | /* |
| 640 | * .is_enabled is only mandatory for clocks that gate |
| 641 | * fall back to software usage counter if .is_enabled is missing |
| 642 | */ |
| 643 | if (!clk->ops->is_enabled) { |
| 644 | ret = clk->enable_count ? 1 : 0; |
| 645 | goto out; |
| 646 | } |
| 647 | |
| 648 | ret = clk->ops->is_enabled(clk->hw); |
| 649 | out: |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 650 | return !!ret; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 651 | } |
| 652 | |
| 653 | static struct clk *__clk_lookup_subtree(const char *name, struct clk *clk) |
| 654 | { |
| 655 | struct clk *child; |
| 656 | struct clk *ret; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 657 | |
| 658 | if (!strcmp(clk->name, name)) |
| 659 | return clk; |
| 660 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 661 | hlist_for_each_entry(child, &clk->children, child_node) { |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 662 | ret = __clk_lookup_subtree(name, child); |
| 663 | if (ret) |
| 664 | return ret; |
| 665 | } |
| 666 | |
| 667 | return NULL; |
| 668 | } |
| 669 | |
| 670 | struct clk *__clk_lookup(const char *name) |
| 671 | { |
| 672 | struct clk *root_clk; |
| 673 | struct clk *ret; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 674 | |
| 675 | if (!name) |
| 676 | return NULL; |
| 677 | |
| 678 | /* search the 'proper' clk tree first */ |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 679 | hlist_for_each_entry(root_clk, &clk_root_list, child_node) { |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 680 | ret = __clk_lookup_subtree(name, root_clk); |
| 681 | if (ret) |
| 682 | return ret; |
| 683 | } |
| 684 | |
| 685 | /* if not found, then search the orphan tree */ |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 686 | hlist_for_each_entry(root_clk, &clk_orphan_list, child_node) { |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 687 | ret = __clk_lookup_subtree(name, root_clk); |
| 688 | if (ret) |
| 689 | return ret; |
| 690 | } |
| 691 | |
| 692 | return NULL; |
| 693 | } |
| 694 | |
James Hogan | e366fdd | 2013-07-29 12:25:02 +0100 | [diff] [blame] | 695 | /* |
| 696 | * Helper for finding best parent to provide a given frequency. This can be used |
| 697 | * directly as a determine_rate callback (e.g. for a mux), or from a more |
| 698 | * complex clock that may combine a mux with other operations. |
| 699 | */ |
| 700 | long __clk_mux_determine_rate(struct clk_hw *hw, unsigned long rate, |
| 701 | unsigned long *best_parent_rate, |
| 702 | struct clk **best_parent_p) |
| 703 | { |
| 704 | struct clk *clk = hw->clk, *parent, *best_parent = NULL; |
| 705 | int i, num_parents; |
| 706 | unsigned long parent_rate, best = 0; |
| 707 | |
| 708 | /* if NO_REPARENT flag set, pass through to current parent */ |
| 709 | if (clk->flags & CLK_SET_RATE_NO_REPARENT) { |
| 710 | parent = clk->parent; |
| 711 | if (clk->flags & CLK_SET_RATE_PARENT) |
| 712 | best = __clk_round_rate(parent, rate); |
| 713 | else if (parent) |
| 714 | best = __clk_get_rate(parent); |
| 715 | else |
| 716 | best = __clk_get_rate(clk); |
| 717 | goto out; |
| 718 | } |
| 719 | |
| 720 | /* find the parent that can provide the fastest rate <= rate */ |
| 721 | num_parents = clk->num_parents; |
| 722 | for (i = 0; i < num_parents; i++) { |
| 723 | parent = clk_get_parent_by_index(clk, i); |
| 724 | if (!parent) |
| 725 | continue; |
| 726 | if (clk->flags & CLK_SET_RATE_PARENT) |
| 727 | parent_rate = __clk_round_rate(parent, rate); |
| 728 | else |
| 729 | parent_rate = __clk_get_rate(parent); |
| 730 | if (parent_rate <= rate && parent_rate > best) { |
| 731 | best_parent = parent; |
| 732 | best = parent_rate; |
| 733 | } |
| 734 | } |
| 735 | |
| 736 | out: |
| 737 | if (best_parent) |
| 738 | *best_parent_p = best_parent; |
| 739 | *best_parent_rate = best; |
| 740 | |
| 741 | return best; |
| 742 | } |
| 743 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 744 | /*** clk api ***/ |
| 745 | |
| 746 | void __clk_unprepare(struct clk *clk) |
| 747 | { |
| 748 | if (!clk) |
| 749 | return; |
| 750 | |
| 751 | if (WARN_ON(clk->prepare_count == 0)) |
| 752 | return; |
| 753 | |
| 754 | if (--clk->prepare_count > 0) |
| 755 | return; |
| 756 | |
| 757 | WARN_ON(clk->enable_count > 0); |
| 758 | |
| 759 | if (clk->ops->unprepare) |
| 760 | clk->ops->unprepare(clk->hw); |
| 761 | |
| 762 | __clk_unprepare(clk->parent); |
| 763 | } |
| 764 | |
| 765 | /** |
| 766 | * clk_unprepare - undo preparation of a clock source |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 767 | * @clk: the clk being unprepared |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 768 | * |
| 769 | * clk_unprepare may sleep, which differentiates it from clk_disable. In a |
| 770 | * simple case, clk_unprepare can be used instead of clk_disable to gate a clk |
| 771 | * if the operation may sleep. One example is a clk which is accessed over |
| 772 | * I2c. In the complex case a clk gate operation may require a fast and a slow |
| 773 | * part. It is this reason that clk_unprepare and clk_disable are not mutually |
| 774 | * exclusive. In fact clk_disable must be called before clk_unprepare. |
| 775 | */ |
| 776 | void clk_unprepare(struct clk *clk) |
| 777 | { |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 778 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 779 | __clk_unprepare(clk); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 780 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 781 | } |
| 782 | EXPORT_SYMBOL_GPL(clk_unprepare); |
| 783 | |
| 784 | int __clk_prepare(struct clk *clk) |
| 785 | { |
| 786 | int ret = 0; |
| 787 | |
| 788 | if (!clk) |
| 789 | return 0; |
| 790 | |
| 791 | if (clk->prepare_count == 0) { |
| 792 | ret = __clk_prepare(clk->parent); |
| 793 | if (ret) |
| 794 | return ret; |
| 795 | |
| 796 | if (clk->ops->prepare) { |
| 797 | ret = clk->ops->prepare(clk->hw); |
| 798 | if (ret) { |
| 799 | __clk_unprepare(clk->parent); |
| 800 | return ret; |
| 801 | } |
| 802 | } |
| 803 | } |
| 804 | |
| 805 | clk->prepare_count++; |
| 806 | |
| 807 | return 0; |
| 808 | } |
| 809 | |
| 810 | /** |
| 811 | * clk_prepare - prepare a clock source |
| 812 | * @clk: the clk being prepared |
| 813 | * |
| 814 | * clk_prepare may sleep, which differentiates it from clk_enable. In a simple |
| 815 | * case, clk_prepare can be used instead of clk_enable to ungate a clk if the |
| 816 | * operation may sleep. One example is a clk which is accessed over I2c. In |
| 817 | * the complex case a clk ungate operation may require a fast and a slow part. |
| 818 | * It is this reason that clk_prepare and clk_enable are not mutually |
| 819 | * exclusive. In fact clk_prepare must be called before clk_enable. |
| 820 | * Returns 0 on success, -EERROR otherwise. |
| 821 | */ |
| 822 | int clk_prepare(struct clk *clk) |
| 823 | { |
| 824 | int ret; |
| 825 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 826 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 827 | ret = __clk_prepare(clk); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 828 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 829 | |
| 830 | return ret; |
| 831 | } |
| 832 | EXPORT_SYMBOL_GPL(clk_prepare); |
| 833 | |
| 834 | static void __clk_disable(struct clk *clk) |
| 835 | { |
| 836 | if (!clk) |
| 837 | return; |
| 838 | |
Fengguang Wu | e47c6a3 | 2012-07-30 14:39:54 -0700 | [diff] [blame] | 839 | if (WARN_ON(IS_ERR(clk))) |
| 840 | return; |
| 841 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 842 | if (WARN_ON(clk->enable_count == 0)) |
| 843 | return; |
| 844 | |
| 845 | if (--clk->enable_count > 0) |
| 846 | return; |
| 847 | |
| 848 | if (clk->ops->disable) |
| 849 | clk->ops->disable(clk->hw); |
| 850 | |
| 851 | __clk_disable(clk->parent); |
| 852 | } |
| 853 | |
| 854 | /** |
| 855 | * clk_disable - gate a clock |
| 856 | * @clk: the clk being gated |
| 857 | * |
| 858 | * clk_disable must not sleep, which differentiates it from clk_unprepare. In |
| 859 | * a simple case, clk_disable can be used instead of clk_unprepare to gate a |
| 860 | * clk if the operation is fast and will never sleep. One example is a |
| 861 | * SoC-internal clk which is controlled via simple register writes. In the |
| 862 | * complex case a clk gate operation may require a fast and a slow part. It is |
| 863 | * this reason that clk_unprepare and clk_disable are not mutually exclusive. |
| 864 | * In fact clk_disable must be called before clk_unprepare. |
| 865 | */ |
| 866 | void clk_disable(struct clk *clk) |
| 867 | { |
| 868 | unsigned long flags; |
| 869 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 870 | flags = clk_enable_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 871 | __clk_disable(clk); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 872 | clk_enable_unlock(flags); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 873 | } |
| 874 | EXPORT_SYMBOL_GPL(clk_disable); |
| 875 | |
| 876 | static int __clk_enable(struct clk *clk) |
| 877 | { |
| 878 | int ret = 0; |
| 879 | |
| 880 | if (!clk) |
| 881 | return 0; |
| 882 | |
| 883 | if (WARN_ON(clk->prepare_count == 0)) |
| 884 | return -ESHUTDOWN; |
| 885 | |
| 886 | if (clk->enable_count == 0) { |
| 887 | ret = __clk_enable(clk->parent); |
| 888 | |
| 889 | if (ret) |
| 890 | return ret; |
| 891 | |
| 892 | if (clk->ops->enable) { |
| 893 | ret = clk->ops->enable(clk->hw); |
| 894 | if (ret) { |
| 895 | __clk_disable(clk->parent); |
| 896 | return ret; |
| 897 | } |
| 898 | } |
| 899 | } |
| 900 | |
| 901 | clk->enable_count++; |
| 902 | return 0; |
| 903 | } |
| 904 | |
| 905 | /** |
| 906 | * clk_enable - ungate a clock |
| 907 | * @clk: the clk being ungated |
| 908 | * |
| 909 | * clk_enable must not sleep, which differentiates it from clk_prepare. In a |
| 910 | * simple case, clk_enable can be used instead of clk_prepare to ungate a clk |
| 911 | * if the operation will never sleep. One example is a SoC-internal clk which |
| 912 | * is controlled via simple register writes. In the complex case a clk ungate |
| 913 | * operation may require a fast and a slow part. It is this reason that |
| 914 | * clk_enable and clk_prepare are not mutually exclusive. In fact clk_prepare |
| 915 | * must be called before clk_enable. Returns 0 on success, -EERROR |
| 916 | * otherwise. |
| 917 | */ |
| 918 | int clk_enable(struct clk *clk) |
| 919 | { |
| 920 | unsigned long flags; |
| 921 | int ret; |
| 922 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 923 | flags = clk_enable_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 924 | ret = __clk_enable(clk); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 925 | clk_enable_unlock(flags); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 926 | |
| 927 | return ret; |
| 928 | } |
| 929 | EXPORT_SYMBOL_GPL(clk_enable); |
| 930 | |
| 931 | /** |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 932 | * __clk_round_rate - round the given rate for a clk |
| 933 | * @clk: round the rate of this clock |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 934 | * @rate: the rate which is to be rounded |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 935 | * |
| 936 | * Caller must hold prepare_lock. Useful for clk_ops such as .set_rate |
| 937 | */ |
| 938 | unsigned long __clk_round_rate(struct clk *clk, unsigned long rate) |
| 939 | { |
Shawn Guo | 81536e0 | 2012-04-12 20:50:17 +0800 | [diff] [blame] | 940 | unsigned long parent_rate = 0; |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 941 | struct clk *parent; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 942 | |
| 943 | if (!clk) |
Stephen Boyd | 2ac6b1f | 2012-10-03 23:38:55 -0700 | [diff] [blame] | 944 | return 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 945 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 946 | parent = clk->parent; |
| 947 | if (parent) |
| 948 | parent_rate = parent->rate; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 949 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 950 | if (clk->ops->determine_rate) |
| 951 | return clk->ops->determine_rate(clk->hw, rate, &parent_rate, |
| 952 | &parent); |
| 953 | else if (clk->ops->round_rate) |
| 954 | return clk->ops->round_rate(clk->hw, rate, &parent_rate); |
| 955 | else if (clk->flags & CLK_SET_RATE_PARENT) |
| 956 | return __clk_round_rate(clk->parent, rate); |
| 957 | else |
| 958 | return clk->rate; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 959 | } |
| 960 | |
| 961 | /** |
| 962 | * clk_round_rate - round the given rate for a clk |
| 963 | * @clk: the clk for which we are rounding a rate |
| 964 | * @rate: the rate which is to be rounded |
| 965 | * |
| 966 | * Takes in a rate as input and rounds it to a rate that the clk can actually |
| 967 | * use which is then returned. If clk doesn't support round_rate operation |
| 968 | * then the parent rate is returned. |
| 969 | */ |
| 970 | long clk_round_rate(struct clk *clk, unsigned long rate) |
| 971 | { |
| 972 | unsigned long ret; |
| 973 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 974 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 975 | ret = __clk_round_rate(clk, rate); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 976 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 977 | |
| 978 | return ret; |
| 979 | } |
| 980 | EXPORT_SYMBOL_GPL(clk_round_rate); |
| 981 | |
| 982 | /** |
| 983 | * __clk_notify - call clk notifier chain |
| 984 | * @clk: struct clk * that is changing rate |
| 985 | * @msg: clk notifier type (see include/linux/clk.h) |
| 986 | * @old_rate: old clk rate |
| 987 | * @new_rate: new clk rate |
| 988 | * |
| 989 | * Triggers a notifier call chain on the clk rate-change notification |
| 990 | * for 'clk'. Passes a pointer to the struct clk and the previous |
| 991 | * and current rates to the notifier callback. Intended to be called by |
| 992 | * internal clock code only. Returns NOTIFY_DONE from the last driver |
| 993 | * called if all went well, or NOTIFY_STOP or NOTIFY_BAD immediately if |
| 994 | * a driver returns that. |
| 995 | */ |
| 996 | static int __clk_notify(struct clk *clk, unsigned long msg, |
| 997 | unsigned long old_rate, unsigned long new_rate) |
| 998 | { |
| 999 | struct clk_notifier *cn; |
| 1000 | struct clk_notifier_data cnd; |
| 1001 | int ret = NOTIFY_DONE; |
| 1002 | |
| 1003 | cnd.clk = clk; |
| 1004 | cnd.old_rate = old_rate; |
| 1005 | cnd.new_rate = new_rate; |
| 1006 | |
| 1007 | list_for_each_entry(cn, &clk_notifier_list, node) { |
| 1008 | if (cn->clk == clk) { |
| 1009 | ret = srcu_notifier_call_chain(&cn->notifier_head, msg, |
| 1010 | &cnd); |
| 1011 | break; |
| 1012 | } |
| 1013 | } |
| 1014 | |
| 1015 | return ret; |
| 1016 | } |
| 1017 | |
| 1018 | /** |
| 1019 | * __clk_recalc_rates |
| 1020 | * @clk: first clk in the subtree |
| 1021 | * @msg: notification type (see include/linux/clk.h) |
| 1022 | * |
| 1023 | * Walks the subtree of clks starting with clk and recalculates rates as it |
| 1024 | * goes. Note that if a clk does not implement the .recalc_rate callback then |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 1025 | * it is assumed that the clock will take on the rate of its parent. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1026 | * |
| 1027 | * clk_recalc_rates also propagates the POST_RATE_CHANGE notification, |
| 1028 | * if necessary. |
| 1029 | * |
| 1030 | * Caller must hold prepare_lock. |
| 1031 | */ |
| 1032 | static void __clk_recalc_rates(struct clk *clk, unsigned long msg) |
| 1033 | { |
| 1034 | unsigned long old_rate; |
| 1035 | unsigned long parent_rate = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1036 | struct clk *child; |
| 1037 | |
| 1038 | old_rate = clk->rate; |
| 1039 | |
| 1040 | if (clk->parent) |
| 1041 | parent_rate = clk->parent->rate; |
| 1042 | |
| 1043 | if (clk->ops->recalc_rate) |
| 1044 | clk->rate = clk->ops->recalc_rate(clk->hw, parent_rate); |
| 1045 | else |
| 1046 | clk->rate = parent_rate; |
| 1047 | |
| 1048 | /* |
| 1049 | * ignore NOTIFY_STOP and NOTIFY_BAD return values for POST_RATE_CHANGE |
| 1050 | * & ABORT_RATE_CHANGE notifiers |
| 1051 | */ |
| 1052 | if (clk->notifier_count && msg) |
| 1053 | __clk_notify(clk, msg, old_rate, clk->rate); |
| 1054 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1055 | hlist_for_each_entry(child, &clk->children, child_node) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1056 | __clk_recalc_rates(child, msg); |
| 1057 | } |
| 1058 | |
| 1059 | /** |
Ulf Hansson | a093bde | 2012-08-31 14:21:28 +0200 | [diff] [blame] | 1060 | * clk_get_rate - return the rate of clk |
| 1061 | * @clk: the clk whose rate is being returned |
| 1062 | * |
| 1063 | * Simply returns the cached rate of the clk, unless CLK_GET_RATE_NOCACHE flag |
| 1064 | * is set, which means a recalc_rate will be issued. |
| 1065 | * If clk is NULL then returns 0. |
| 1066 | */ |
| 1067 | unsigned long clk_get_rate(struct clk *clk) |
| 1068 | { |
| 1069 | unsigned long rate; |
| 1070 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1071 | clk_prepare_lock(); |
Ulf Hansson | a093bde | 2012-08-31 14:21:28 +0200 | [diff] [blame] | 1072 | |
| 1073 | if (clk && (clk->flags & CLK_GET_RATE_NOCACHE)) |
| 1074 | __clk_recalc_rates(clk, 0); |
| 1075 | |
| 1076 | rate = __clk_get_rate(clk); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1077 | clk_prepare_unlock(); |
Ulf Hansson | a093bde | 2012-08-31 14:21:28 +0200 | [diff] [blame] | 1078 | |
| 1079 | return rate; |
| 1080 | } |
| 1081 | EXPORT_SYMBOL_GPL(clk_get_rate); |
| 1082 | |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1083 | static int clk_fetch_parent_index(struct clk *clk, struct clk *parent) |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1084 | { |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1085 | int i; |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1086 | |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1087 | if (!clk->parents) { |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1088 | clk->parents = kzalloc((sizeof(struct clk*) * clk->num_parents), |
| 1089 | GFP_KERNEL); |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1090 | if (!clk->parents) |
| 1091 | return -ENOMEM; |
| 1092 | } |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1093 | |
| 1094 | /* |
| 1095 | * find index of new parent clock using cached parent ptrs, |
| 1096 | * or if not yet cached, use string name comparison and cache |
| 1097 | * them now to avoid future calls to __clk_lookup. |
| 1098 | */ |
| 1099 | for (i = 0; i < clk->num_parents; i++) { |
| 1100 | if (clk->parents && clk->parents[i] == parent) |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1101 | return i; |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1102 | else if (!strcmp(clk->parent_names[i], parent->name)) { |
| 1103 | if (clk->parents) |
| 1104 | clk->parents[i] = __clk_lookup(parent->name); |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1105 | return i; |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1106 | } |
| 1107 | } |
| 1108 | |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1109 | return -EINVAL; |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1110 | } |
| 1111 | |
| 1112 | static void clk_reparent(struct clk *clk, struct clk *new_parent) |
| 1113 | { |
| 1114 | hlist_del(&clk->child_node); |
| 1115 | |
James Hogan | 903efc5 | 2013-08-29 12:10:51 +0100 | [diff] [blame] | 1116 | if (new_parent) { |
| 1117 | /* avoid duplicate POST_RATE_CHANGE notifications */ |
| 1118 | if (new_parent->new_child == clk) |
| 1119 | new_parent->new_child = NULL; |
| 1120 | |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1121 | hlist_add_head(&clk->child_node, &new_parent->children); |
James Hogan | 903efc5 | 2013-08-29 12:10:51 +0100 | [diff] [blame] | 1122 | } else { |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1123 | hlist_add_head(&clk->child_node, &clk_orphan_list); |
James Hogan | 903efc5 | 2013-08-29 12:10:51 +0100 | [diff] [blame] | 1124 | } |
James Hogan | 4935b22 | 2013-07-29 12:24:59 +0100 | [diff] [blame] | 1125 | |
| 1126 | clk->parent = new_parent; |
| 1127 | } |
| 1128 | |
| 1129 | static int __clk_set_parent(struct clk *clk, struct clk *parent, u8 p_index) |
| 1130 | { |
| 1131 | unsigned long flags; |
| 1132 | int ret = 0; |
| 1133 | struct clk *old_parent = clk->parent; |
| 1134 | |
| 1135 | /* |
| 1136 | * Migrate prepare state between parents and prevent race with |
| 1137 | * clk_enable(). |
| 1138 | * |
| 1139 | * If the clock is not prepared, then a race with |
| 1140 | * clk_enable/disable() is impossible since we already have the |
| 1141 | * prepare lock (future calls to clk_enable() need to be preceded by |
| 1142 | * a clk_prepare()). |
| 1143 | * |
| 1144 | * If the clock is prepared, migrate the prepared state to the new |
| 1145 | * parent and also protect against a race with clk_enable() by |
| 1146 | * forcing the clock and the new parent on. This ensures that all |
| 1147 | * future calls to clk_enable() are practically NOPs with respect to |
| 1148 | * hardware and software states. |
| 1149 | * |
| 1150 | * See also: Comment for clk_set_parent() below. |
| 1151 | */ |
| 1152 | if (clk->prepare_count) { |
| 1153 | __clk_prepare(parent); |
| 1154 | clk_enable(parent); |
| 1155 | clk_enable(clk); |
| 1156 | } |
| 1157 | |
| 1158 | /* update the clk tree topology */ |
| 1159 | flags = clk_enable_lock(); |
| 1160 | clk_reparent(clk, parent); |
| 1161 | clk_enable_unlock(flags); |
| 1162 | |
| 1163 | /* change clock input source */ |
| 1164 | if (parent && clk->ops->set_parent) |
| 1165 | ret = clk->ops->set_parent(clk->hw, p_index); |
| 1166 | |
| 1167 | if (ret) { |
| 1168 | flags = clk_enable_lock(); |
| 1169 | clk_reparent(clk, old_parent); |
| 1170 | clk_enable_unlock(flags); |
| 1171 | |
| 1172 | if (clk->prepare_count) { |
| 1173 | clk_disable(clk); |
| 1174 | clk_disable(parent); |
| 1175 | __clk_unprepare(parent); |
| 1176 | } |
| 1177 | return ret; |
| 1178 | } |
| 1179 | |
| 1180 | /* |
| 1181 | * Finish the migration of prepare state and undo the changes done |
| 1182 | * for preventing a race with clk_enable(). |
| 1183 | */ |
| 1184 | if (clk->prepare_count) { |
| 1185 | clk_disable(clk); |
| 1186 | clk_disable(old_parent); |
| 1187 | __clk_unprepare(old_parent); |
| 1188 | } |
| 1189 | |
| 1190 | /* update debugfs with new clk tree topology */ |
| 1191 | clk_debug_reparent(clk, parent); |
| 1192 | return 0; |
| 1193 | } |
| 1194 | |
Ulf Hansson | a093bde | 2012-08-31 14:21:28 +0200 | [diff] [blame] | 1195 | /** |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1196 | * __clk_speculate_rates |
| 1197 | * @clk: first clk in the subtree |
| 1198 | * @parent_rate: the "future" rate of clk's parent |
| 1199 | * |
| 1200 | * Walks the subtree of clks starting with clk, speculating rates as it |
| 1201 | * goes and firing off PRE_RATE_CHANGE notifications as necessary. |
| 1202 | * |
| 1203 | * Unlike clk_recalc_rates, clk_speculate_rates exists only for sending |
| 1204 | * pre-rate change notifications and returns early if no clks in the |
| 1205 | * subtree have subscribed to the notifications. Note that if a clk does not |
| 1206 | * implement the .recalc_rate callback then it is assumed that the clock will |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 1207 | * take on the rate of its parent. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1208 | * |
| 1209 | * Caller must hold prepare_lock. |
| 1210 | */ |
| 1211 | static int __clk_speculate_rates(struct clk *clk, unsigned long parent_rate) |
| 1212 | { |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1213 | struct clk *child; |
| 1214 | unsigned long new_rate; |
| 1215 | int ret = NOTIFY_DONE; |
| 1216 | |
| 1217 | if (clk->ops->recalc_rate) |
| 1218 | new_rate = clk->ops->recalc_rate(clk->hw, parent_rate); |
| 1219 | else |
| 1220 | new_rate = parent_rate; |
| 1221 | |
Soren Brinkmann | fb72a05 | 2013-04-03 12:17:12 -0700 | [diff] [blame] | 1222 | /* abort rate change if a driver returns NOTIFY_BAD or NOTIFY_STOP */ |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1223 | if (clk->notifier_count) |
| 1224 | ret = __clk_notify(clk, PRE_RATE_CHANGE, clk->rate, new_rate); |
| 1225 | |
Soren Brinkmann | fb72a05 | 2013-04-03 12:17:12 -0700 | [diff] [blame] | 1226 | if (ret & NOTIFY_STOP_MASK) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1227 | goto out; |
| 1228 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1229 | hlist_for_each_entry(child, &clk->children, child_node) { |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1230 | ret = __clk_speculate_rates(child, new_rate); |
Soren Brinkmann | fb72a05 | 2013-04-03 12:17:12 -0700 | [diff] [blame] | 1231 | if (ret & NOTIFY_STOP_MASK) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1232 | break; |
| 1233 | } |
| 1234 | |
| 1235 | out: |
| 1236 | return ret; |
| 1237 | } |
| 1238 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1239 | static void clk_calc_subtree(struct clk *clk, unsigned long new_rate, |
| 1240 | struct clk *new_parent, u8 p_index) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1241 | { |
| 1242 | struct clk *child; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1243 | |
| 1244 | clk->new_rate = new_rate; |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1245 | clk->new_parent = new_parent; |
| 1246 | clk->new_parent_index = p_index; |
| 1247 | /* include clk in new parent's PRE_RATE_CHANGE notifications */ |
| 1248 | clk->new_child = NULL; |
| 1249 | if (new_parent && new_parent != clk->parent) |
| 1250 | new_parent->new_child = clk; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1251 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1252 | hlist_for_each_entry(child, &clk->children, child_node) { |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1253 | if (child->ops->recalc_rate) |
| 1254 | child->new_rate = child->ops->recalc_rate(child->hw, new_rate); |
| 1255 | else |
| 1256 | child->new_rate = new_rate; |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1257 | clk_calc_subtree(child, child->new_rate, NULL, 0); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1258 | } |
| 1259 | } |
| 1260 | |
| 1261 | /* |
| 1262 | * calculate the new rates returning the topmost clock that has to be |
| 1263 | * changed. |
| 1264 | */ |
| 1265 | static struct clk *clk_calc_new_rates(struct clk *clk, unsigned long rate) |
| 1266 | { |
| 1267 | struct clk *top = clk; |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1268 | struct clk *old_parent, *parent; |
Shawn Guo | 81536e0 | 2012-04-12 20:50:17 +0800 | [diff] [blame] | 1269 | unsigned long best_parent_rate = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1270 | unsigned long new_rate; |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1271 | int p_index = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1272 | |
Mike Turquette | 7452b21 | 2012-03-26 14:45:36 -0700 | [diff] [blame] | 1273 | /* sanity */ |
| 1274 | if (IS_ERR_OR_NULL(clk)) |
| 1275 | return NULL; |
| 1276 | |
Mike Turquette | 63f5c3b | 2012-05-02 16:23:43 -0700 | [diff] [blame] | 1277 | /* save parent rate, if it exists */ |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1278 | parent = old_parent = clk->parent; |
| 1279 | if (parent) |
| 1280 | best_parent_rate = parent->rate; |
Mike Turquette | 63f5c3b | 2012-05-02 16:23:43 -0700 | [diff] [blame] | 1281 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1282 | /* find the closest rate and parent clk/rate */ |
| 1283 | if (clk->ops->determine_rate) { |
| 1284 | new_rate = clk->ops->determine_rate(clk->hw, rate, |
| 1285 | &best_parent_rate, |
| 1286 | &parent); |
| 1287 | } else if (clk->ops->round_rate) { |
| 1288 | new_rate = clk->ops->round_rate(clk->hw, rate, |
| 1289 | &best_parent_rate); |
| 1290 | } else if (!parent || !(clk->flags & CLK_SET_RATE_PARENT)) { |
| 1291 | /* pass-through clock without adjustable parent */ |
| 1292 | clk->new_rate = clk->rate; |
| 1293 | return NULL; |
| 1294 | } else { |
| 1295 | /* pass-through clock with adjustable parent */ |
| 1296 | top = clk_calc_new_rates(parent, rate); |
| 1297 | new_rate = parent->new_rate; |
Mike Turquette | 63f5c3b | 2012-05-02 16:23:43 -0700 | [diff] [blame] | 1298 | goto out; |
Mike Turquette | 7452b21 | 2012-03-26 14:45:36 -0700 | [diff] [blame] | 1299 | } |
| 1300 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1301 | /* some clocks must be gated to change parent */ |
| 1302 | if (parent != old_parent && |
| 1303 | (clk->flags & CLK_SET_PARENT_GATE) && clk->prepare_count) { |
| 1304 | pr_debug("%s: %s not gated but wants to reparent\n", |
| 1305 | __func__, clk->name); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1306 | return NULL; |
| 1307 | } |
| 1308 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1309 | /* try finding the new parent index */ |
| 1310 | if (parent) { |
| 1311 | p_index = clk_fetch_parent_index(clk, parent); |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1312 | if (p_index < 0) { |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1313 | pr_debug("%s: clk %s can not be parent of clk %s\n", |
| 1314 | __func__, parent->name, clk->name); |
| 1315 | return NULL; |
| 1316 | } |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1317 | } |
| 1318 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1319 | if ((clk->flags & CLK_SET_RATE_PARENT) && parent && |
| 1320 | best_parent_rate != parent->rate) |
| 1321 | top = clk_calc_new_rates(parent, best_parent_rate); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1322 | |
| 1323 | out: |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1324 | clk_calc_subtree(clk, new_rate, parent, p_index); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1325 | |
| 1326 | return top; |
| 1327 | } |
| 1328 | |
| 1329 | /* |
| 1330 | * Notify about rate changes in a subtree. Always walk down the whole tree |
| 1331 | * so that in case of an error we can walk down the whole tree again and |
| 1332 | * abort the change. |
| 1333 | */ |
| 1334 | static struct clk *clk_propagate_rate_change(struct clk *clk, unsigned long event) |
| 1335 | { |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1336 | struct clk *child, *tmp_clk, *fail_clk = NULL; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1337 | int ret = NOTIFY_DONE; |
| 1338 | |
| 1339 | if (clk->rate == clk->new_rate) |
Sachin Kamat | 5fda685 | 2013-03-13 15:17:49 +0530 | [diff] [blame] | 1340 | return NULL; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1341 | |
| 1342 | if (clk->notifier_count) { |
| 1343 | ret = __clk_notify(clk, event, clk->rate, clk->new_rate); |
Soren Brinkmann | fb72a05 | 2013-04-03 12:17:12 -0700 | [diff] [blame] | 1344 | if (ret & NOTIFY_STOP_MASK) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1345 | fail_clk = clk; |
| 1346 | } |
| 1347 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1348 | hlist_for_each_entry(child, &clk->children, child_node) { |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1349 | /* Skip children who will be reparented to another clock */ |
| 1350 | if (child->new_parent && child->new_parent != clk) |
| 1351 | continue; |
| 1352 | tmp_clk = clk_propagate_rate_change(child, event); |
| 1353 | if (tmp_clk) |
| 1354 | fail_clk = tmp_clk; |
| 1355 | } |
| 1356 | |
| 1357 | /* handle the new child who might not be in clk->children yet */ |
| 1358 | if (clk->new_child) { |
| 1359 | tmp_clk = clk_propagate_rate_change(clk->new_child, event); |
| 1360 | if (tmp_clk) |
| 1361 | fail_clk = tmp_clk; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1362 | } |
| 1363 | |
| 1364 | return fail_clk; |
| 1365 | } |
| 1366 | |
| 1367 | /* |
| 1368 | * walk down a subtree and set the new rates notifying the rate |
| 1369 | * change on the way |
| 1370 | */ |
| 1371 | static void clk_change_rate(struct clk *clk) |
| 1372 | { |
| 1373 | struct clk *child; |
| 1374 | unsigned long old_rate; |
Pawel Moll | bf47b4f | 2012-06-08 14:04:06 +0100 | [diff] [blame] | 1375 | unsigned long best_parent_rate = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1376 | |
| 1377 | old_rate = clk->rate; |
| 1378 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1379 | /* set parent */ |
| 1380 | if (clk->new_parent && clk->new_parent != clk->parent) |
| 1381 | __clk_set_parent(clk, clk->new_parent, clk->new_parent_index); |
| 1382 | |
Pawel Moll | bf47b4f | 2012-06-08 14:04:06 +0100 | [diff] [blame] | 1383 | if (clk->parent) |
| 1384 | best_parent_rate = clk->parent->rate; |
| 1385 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1386 | if (clk->ops->set_rate) |
Pawel Moll | bf47b4f | 2012-06-08 14:04:06 +0100 | [diff] [blame] | 1387 | clk->ops->set_rate(clk->hw, clk->new_rate, best_parent_rate); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1388 | |
| 1389 | if (clk->ops->recalc_rate) |
Pawel Moll | bf47b4f | 2012-06-08 14:04:06 +0100 | [diff] [blame] | 1390 | clk->rate = clk->ops->recalc_rate(clk->hw, best_parent_rate); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1391 | else |
Pawel Moll | bf47b4f | 2012-06-08 14:04:06 +0100 | [diff] [blame] | 1392 | clk->rate = best_parent_rate; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1393 | |
| 1394 | if (clk->notifier_count && old_rate != clk->rate) |
| 1395 | __clk_notify(clk, POST_RATE_CHANGE, old_rate, clk->rate); |
| 1396 | |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1397 | hlist_for_each_entry(child, &clk->children, child_node) { |
| 1398 | /* Skip children who will be reparented to another clock */ |
| 1399 | if (child->new_parent && child->new_parent != clk) |
| 1400 | continue; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1401 | clk_change_rate(child); |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1402 | } |
| 1403 | |
| 1404 | /* handle the new child who might not be in clk->children yet */ |
| 1405 | if (clk->new_child) |
| 1406 | clk_change_rate(clk->new_child); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1407 | } |
| 1408 | |
| 1409 | /** |
| 1410 | * clk_set_rate - specify a new rate for clk |
| 1411 | * @clk: the clk whose rate is being changed |
| 1412 | * @rate: the new rate for clk |
| 1413 | * |
Mike Turquette | 5654dc9 | 2012-03-26 11:51:34 -0700 | [diff] [blame] | 1414 | * In the simplest case clk_set_rate will only adjust the rate of clk. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1415 | * |
Mike Turquette | 5654dc9 | 2012-03-26 11:51:34 -0700 | [diff] [blame] | 1416 | * Setting the CLK_SET_RATE_PARENT flag allows the rate change operation to |
| 1417 | * propagate up to clk's parent; whether or not this happens depends on the |
| 1418 | * outcome of clk's .round_rate implementation. If *parent_rate is unchanged |
| 1419 | * after calling .round_rate then upstream parent propagation is ignored. If |
| 1420 | * *parent_rate comes back with a new rate for clk's parent then we propagate |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 1421 | * up to clk's parent and set its rate. Upward propagation will continue |
Mike Turquette | 5654dc9 | 2012-03-26 11:51:34 -0700 | [diff] [blame] | 1422 | * until either a clk does not support the CLK_SET_RATE_PARENT flag or |
| 1423 | * .round_rate stops requesting changes to clk's parent_rate. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1424 | * |
Mike Turquette | 5654dc9 | 2012-03-26 11:51:34 -0700 | [diff] [blame] | 1425 | * Rate changes are accomplished via tree traversal that also recalculates the |
| 1426 | * rates for the clocks and fires off POST_RATE_CHANGE notifiers. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1427 | * |
| 1428 | * Returns 0 on success, -EERROR otherwise. |
| 1429 | */ |
| 1430 | int clk_set_rate(struct clk *clk, unsigned long rate) |
| 1431 | { |
| 1432 | struct clk *top, *fail_clk; |
| 1433 | int ret = 0; |
| 1434 | |
Mike Turquette | 89ac8d7 | 2013-08-21 23:58:09 -0700 | [diff] [blame] | 1435 | if (!clk) |
| 1436 | return 0; |
| 1437 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1438 | /* prevent racing with updates to the clock topology */ |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1439 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1440 | |
| 1441 | /* bail early if nothing to do */ |
Peter De Schrijver | 34e452a | 2013-06-05 18:06:36 +0300 | [diff] [blame] | 1442 | if (rate == clk_get_rate(clk)) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1443 | goto out; |
| 1444 | |
Saravana Kannan | 7e0fa1b | 2012-05-15 13:43:42 -0700 | [diff] [blame] | 1445 | if ((clk->flags & CLK_SET_RATE_GATE) && clk->prepare_count) { |
Viresh Kumar | 0e1c030 | 2012-04-11 16:03:42 +0530 | [diff] [blame] | 1446 | ret = -EBUSY; |
| 1447 | goto out; |
| 1448 | } |
| 1449 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1450 | /* calculate new rates and get the topmost changed clock */ |
| 1451 | top = clk_calc_new_rates(clk, rate); |
| 1452 | if (!top) { |
| 1453 | ret = -EINVAL; |
| 1454 | goto out; |
| 1455 | } |
| 1456 | |
| 1457 | /* notify that we are about to change rates */ |
| 1458 | fail_clk = clk_propagate_rate_change(top, PRE_RATE_CHANGE); |
| 1459 | if (fail_clk) { |
| 1460 | pr_warn("%s: failed to set %s rate\n", __func__, |
| 1461 | fail_clk->name); |
| 1462 | clk_propagate_rate_change(top, ABORT_RATE_CHANGE); |
| 1463 | ret = -EBUSY; |
| 1464 | goto out; |
| 1465 | } |
| 1466 | |
| 1467 | /* change the rates */ |
| 1468 | clk_change_rate(top); |
| 1469 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1470 | out: |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1471 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1472 | |
| 1473 | return ret; |
| 1474 | } |
| 1475 | EXPORT_SYMBOL_GPL(clk_set_rate); |
| 1476 | |
| 1477 | /** |
| 1478 | * clk_get_parent - return the parent of a clk |
| 1479 | * @clk: the clk whose parent gets returned |
| 1480 | * |
| 1481 | * Simply returns clk->parent. Returns NULL if clk is NULL. |
| 1482 | */ |
| 1483 | struct clk *clk_get_parent(struct clk *clk) |
| 1484 | { |
| 1485 | struct clk *parent; |
| 1486 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1487 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1488 | parent = __clk_get_parent(clk); |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1489 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1490 | |
| 1491 | return parent; |
| 1492 | } |
| 1493 | EXPORT_SYMBOL_GPL(clk_get_parent); |
| 1494 | |
| 1495 | /* |
| 1496 | * .get_parent is mandatory for clocks with multiple possible parents. It is |
| 1497 | * optional for single-parent clocks. Always call .get_parent if it is |
| 1498 | * available and WARN if it is missing for multi-parent clocks. |
| 1499 | * |
| 1500 | * For single-parent clocks without .get_parent, first check to see if the |
| 1501 | * .parents array exists, and if so use it to avoid an expensive tree |
| 1502 | * traversal. If .parents does not exist then walk the tree with __clk_lookup. |
| 1503 | */ |
| 1504 | static struct clk *__clk_init_parent(struct clk *clk) |
| 1505 | { |
| 1506 | struct clk *ret = NULL; |
| 1507 | u8 index; |
| 1508 | |
| 1509 | /* handle the trivial cases */ |
| 1510 | |
| 1511 | if (!clk->num_parents) |
| 1512 | goto out; |
| 1513 | |
| 1514 | if (clk->num_parents == 1) { |
| 1515 | if (IS_ERR_OR_NULL(clk->parent)) |
| 1516 | ret = clk->parent = __clk_lookup(clk->parent_names[0]); |
| 1517 | ret = clk->parent; |
| 1518 | goto out; |
| 1519 | } |
| 1520 | |
| 1521 | if (!clk->ops->get_parent) { |
| 1522 | WARN(!clk->ops->get_parent, |
| 1523 | "%s: multi-parent clocks must implement .get_parent\n", |
| 1524 | __func__); |
| 1525 | goto out; |
| 1526 | }; |
| 1527 | |
| 1528 | /* |
| 1529 | * Do our best to cache parent clocks in clk->parents. This prevents |
| 1530 | * unnecessary and expensive calls to __clk_lookup. We don't set |
| 1531 | * clk->parent here; that is done by the calling function |
| 1532 | */ |
| 1533 | |
| 1534 | index = clk->ops->get_parent(clk->hw); |
| 1535 | |
| 1536 | if (!clk->parents) |
| 1537 | clk->parents = |
Rajendra Nayak | 7975059 | 2012-06-06 14:41:31 +0530 | [diff] [blame] | 1538 | kzalloc((sizeof(struct clk*) * clk->num_parents), |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1539 | GFP_KERNEL); |
| 1540 | |
James Hogan | 7ef3dcc | 2013-07-29 12:24:58 +0100 | [diff] [blame] | 1541 | ret = clk_get_parent_by_index(clk, index); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1542 | |
| 1543 | out: |
| 1544 | return ret; |
| 1545 | } |
| 1546 | |
Ulf Hansson | b33d212 | 2013-04-02 23:09:37 +0200 | [diff] [blame] | 1547 | void __clk_reparent(struct clk *clk, struct clk *new_parent) |
| 1548 | { |
| 1549 | clk_reparent(clk, new_parent); |
| 1550 | clk_debug_reparent(clk, new_parent); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1551 | __clk_recalc_rates(clk, POST_RATE_CHANGE); |
| 1552 | } |
| 1553 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1554 | /** |
| 1555 | * clk_set_parent - switch the parent of a mux clk |
| 1556 | * @clk: the mux clk whose input we are switching |
| 1557 | * @parent: the new input to clk |
| 1558 | * |
Saravana Kannan | f8aa0bd | 2013-05-15 21:07:24 -0700 | [diff] [blame] | 1559 | * Re-parent clk to use parent as its new input source. If clk is in |
| 1560 | * prepared state, the clk will get enabled for the duration of this call. If |
| 1561 | * that's not acceptable for a specific clk (Eg: the consumer can't handle |
| 1562 | * that, the reparenting is glitchy in hardware, etc), use the |
| 1563 | * CLK_SET_PARENT_GATE flag to allow reparenting only when clk is unprepared. |
| 1564 | * |
| 1565 | * After successfully changing clk's parent clk_set_parent will update the |
| 1566 | * clk topology, sysfs topology and propagate rate recalculation via |
| 1567 | * __clk_recalc_rates. |
| 1568 | * |
| 1569 | * Returns 0 on success, -EERROR otherwise. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1570 | */ |
| 1571 | int clk_set_parent(struct clk *clk, struct clk *parent) |
| 1572 | { |
| 1573 | int ret = 0; |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1574 | int p_index = 0; |
Ulf Hansson | 031dcc9 | 2013-04-02 23:09:38 +0200 | [diff] [blame] | 1575 | unsigned long p_rate = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1576 | |
Mike Turquette | 89ac8d7 | 2013-08-21 23:58:09 -0700 | [diff] [blame] | 1577 | if (!clk) |
| 1578 | return 0; |
| 1579 | |
| 1580 | if (!clk->ops) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1581 | return -EINVAL; |
| 1582 | |
Ulf Hansson | 031dcc9 | 2013-04-02 23:09:38 +0200 | [diff] [blame] | 1583 | /* verify ops for for multi-parent clks */ |
| 1584 | if ((clk->num_parents > 1) && (!clk->ops->set_parent)) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1585 | return -ENOSYS; |
| 1586 | |
| 1587 | /* prevent racing with updates to the clock topology */ |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1588 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1589 | |
| 1590 | if (clk->parent == parent) |
| 1591 | goto out; |
| 1592 | |
Ulf Hansson | 031dcc9 | 2013-04-02 23:09:38 +0200 | [diff] [blame] | 1593 | /* check that we are allowed to re-parent if the clock is in use */ |
| 1594 | if ((clk->flags & CLK_SET_PARENT_GATE) && clk->prepare_count) { |
| 1595 | ret = -EBUSY; |
| 1596 | goto out; |
| 1597 | } |
| 1598 | |
| 1599 | /* try finding the new parent index */ |
| 1600 | if (parent) { |
| 1601 | p_index = clk_fetch_parent_index(clk, parent); |
| 1602 | p_rate = parent->rate; |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1603 | if (p_index < 0) { |
Ulf Hansson | 031dcc9 | 2013-04-02 23:09:38 +0200 | [diff] [blame] | 1604 | pr_debug("%s: clk %s can not be parent of clk %s\n", |
| 1605 | __func__, parent->name, clk->name); |
Tomasz Figa | f1c8b2e | 2013-09-29 02:37:14 +0200 | [diff] [blame^] | 1606 | ret = p_index; |
Ulf Hansson | 031dcc9 | 2013-04-02 23:09:38 +0200 | [diff] [blame] | 1607 | goto out; |
| 1608 | } |
| 1609 | } |
| 1610 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1611 | /* propagate PRE_RATE_CHANGE notifications */ |
Soren Brinkmann | f3aab5d | 2013-04-16 10:06:50 -0700 | [diff] [blame] | 1612 | ret = __clk_speculate_rates(clk, p_rate); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1613 | |
| 1614 | /* abort if a driver objects */ |
Soren Brinkmann | fb72a05 | 2013-04-03 12:17:12 -0700 | [diff] [blame] | 1615 | if (ret & NOTIFY_STOP_MASK) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1616 | goto out; |
| 1617 | |
Ulf Hansson | 031dcc9 | 2013-04-02 23:09:38 +0200 | [diff] [blame] | 1618 | /* do the re-parent */ |
| 1619 | ret = __clk_set_parent(clk, parent, p_index); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1620 | |
Ulf Hansson | a68de8e | 2013-04-02 23:09:39 +0200 | [diff] [blame] | 1621 | /* propagate rate recalculation accordingly */ |
| 1622 | if (ret) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1623 | __clk_recalc_rates(clk, ABORT_RATE_CHANGE); |
Ulf Hansson | a68de8e | 2013-04-02 23:09:39 +0200 | [diff] [blame] | 1624 | else |
| 1625 | __clk_recalc_rates(clk, POST_RATE_CHANGE); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1626 | |
| 1627 | out: |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1628 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1629 | |
| 1630 | return ret; |
| 1631 | } |
| 1632 | EXPORT_SYMBOL_GPL(clk_set_parent); |
| 1633 | |
| 1634 | /** |
| 1635 | * __clk_init - initialize the data structures in a struct clk |
| 1636 | * @dev: device initializing this clk, placeholder for now |
| 1637 | * @clk: clk being initialized |
| 1638 | * |
| 1639 | * Initializes the lists in struct clk, queries the hardware for the |
| 1640 | * parent and rate and sets them both. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1641 | */ |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1642 | int __clk_init(struct device *dev, struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1643 | { |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1644 | int i, ret = 0; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1645 | struct clk *orphan; |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1646 | struct hlist_node *tmp2; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1647 | |
| 1648 | if (!clk) |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1649 | return -EINVAL; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1650 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1651 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1652 | |
| 1653 | /* check to see if a clock with this name is already registered */ |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1654 | if (__clk_lookup(clk->name)) { |
| 1655 | pr_debug("%s: clk %s already initialized\n", |
| 1656 | __func__, clk->name); |
| 1657 | ret = -EEXIST; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1658 | goto out; |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1659 | } |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1660 | |
Mike Turquette | d4d7e3d | 2012-03-26 16:15:52 -0700 | [diff] [blame] | 1661 | /* check that clk_ops are sane. See Documentation/clk.txt */ |
| 1662 | if (clk->ops->set_rate && |
James Hogan | 71472c0 | 2013-07-29 12:25:00 +0100 | [diff] [blame] | 1663 | !((clk->ops->round_rate || clk->ops->determine_rate) && |
| 1664 | clk->ops->recalc_rate)) { |
| 1665 | pr_warning("%s: %s must implement .round_rate or .determine_rate in addition to .recalc_rate\n", |
Mike Turquette | d4d7e3d | 2012-03-26 16:15:52 -0700 | [diff] [blame] | 1666 | __func__, clk->name); |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1667 | ret = -EINVAL; |
Mike Turquette | d4d7e3d | 2012-03-26 16:15:52 -0700 | [diff] [blame] | 1668 | goto out; |
| 1669 | } |
| 1670 | |
| 1671 | if (clk->ops->set_parent && !clk->ops->get_parent) { |
| 1672 | pr_warning("%s: %s must implement .get_parent & .set_parent\n", |
| 1673 | __func__, clk->name); |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1674 | ret = -EINVAL; |
Mike Turquette | d4d7e3d | 2012-03-26 16:15:52 -0700 | [diff] [blame] | 1675 | goto out; |
| 1676 | } |
| 1677 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1678 | /* throw a WARN if any entries in parent_names are NULL */ |
| 1679 | for (i = 0; i < clk->num_parents; i++) |
| 1680 | WARN(!clk->parent_names[i], |
| 1681 | "%s: invalid NULL in %s's .parent_names\n", |
| 1682 | __func__, clk->name); |
| 1683 | |
| 1684 | /* |
| 1685 | * Allocate an array of struct clk *'s to avoid unnecessary string |
| 1686 | * look-ups of clk's possible parents. This can fail for clocks passed |
| 1687 | * in to clk_init during early boot; thus any access to clk->parents[] |
| 1688 | * must always check for a NULL pointer and try to populate it if |
| 1689 | * necessary. |
| 1690 | * |
| 1691 | * If clk->parents is not NULL we skip this entire block. This allows |
| 1692 | * for clock drivers to statically initialize clk->parents. |
| 1693 | */ |
Rajendra Nayak | 9ca1c5a | 2012-06-06 14:41:30 +0530 | [diff] [blame] | 1694 | if (clk->num_parents > 1 && !clk->parents) { |
| 1695 | clk->parents = kzalloc((sizeof(struct clk*) * clk->num_parents), |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1696 | GFP_KERNEL); |
| 1697 | /* |
| 1698 | * __clk_lookup returns NULL for parents that have not been |
| 1699 | * clk_init'd; thus any access to clk->parents[] must check |
| 1700 | * for a NULL pointer. We can always perform lazy lookups for |
| 1701 | * missing parents later on. |
| 1702 | */ |
| 1703 | if (clk->parents) |
| 1704 | for (i = 0; i < clk->num_parents; i++) |
| 1705 | clk->parents[i] = |
| 1706 | __clk_lookup(clk->parent_names[i]); |
| 1707 | } |
| 1708 | |
| 1709 | clk->parent = __clk_init_parent(clk); |
| 1710 | |
| 1711 | /* |
| 1712 | * Populate clk->parent if parent has already been __clk_init'd. If |
| 1713 | * parent has not yet been __clk_init'd then place clk in the orphan |
| 1714 | * list. If clk has set the CLK_IS_ROOT flag then place it in the root |
| 1715 | * clk list. |
| 1716 | * |
| 1717 | * Every time a new clk is clk_init'd then we walk the list of orphan |
| 1718 | * clocks and re-parent any that are children of the clock currently |
| 1719 | * being clk_init'd. |
| 1720 | */ |
| 1721 | if (clk->parent) |
| 1722 | hlist_add_head(&clk->child_node, |
| 1723 | &clk->parent->children); |
| 1724 | else if (clk->flags & CLK_IS_ROOT) |
| 1725 | hlist_add_head(&clk->child_node, &clk_root_list); |
| 1726 | else |
| 1727 | hlist_add_head(&clk->child_node, &clk_orphan_list); |
| 1728 | |
| 1729 | /* |
| 1730 | * Set clk's rate. The preferred method is to use .recalc_rate. For |
| 1731 | * simple clocks and lazy developers the default fallback is to use the |
| 1732 | * parent's rate. If a clock doesn't have a parent (or is orphaned) |
| 1733 | * then rate is set to zero. |
| 1734 | */ |
| 1735 | if (clk->ops->recalc_rate) |
| 1736 | clk->rate = clk->ops->recalc_rate(clk->hw, |
| 1737 | __clk_get_rate(clk->parent)); |
| 1738 | else if (clk->parent) |
| 1739 | clk->rate = clk->parent->rate; |
| 1740 | else |
| 1741 | clk->rate = 0; |
| 1742 | |
| 1743 | /* |
| 1744 | * walk the list of orphan clocks and reparent any that are children of |
| 1745 | * this clock |
| 1746 | */ |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1747 | hlist_for_each_entry_safe(orphan, tmp2, &clk_orphan_list, child_node) { |
Alex Elder | 12d29886 | 2013-09-05 08:33:24 -0500 | [diff] [blame] | 1748 | if (orphan->num_parents && orphan->ops->get_parent) { |
Martin Fuzzey | 1f61e5f | 2012-11-22 20:15:05 +0100 | [diff] [blame] | 1749 | i = orphan->ops->get_parent(orphan->hw); |
| 1750 | if (!strcmp(clk->name, orphan->parent_names[i])) |
| 1751 | __clk_reparent(orphan, clk); |
| 1752 | continue; |
| 1753 | } |
| 1754 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1755 | for (i = 0; i < orphan->num_parents; i++) |
| 1756 | if (!strcmp(clk->name, orphan->parent_names[i])) { |
| 1757 | __clk_reparent(orphan, clk); |
| 1758 | break; |
| 1759 | } |
Martin Fuzzey | 1f61e5f | 2012-11-22 20:15:05 +0100 | [diff] [blame] | 1760 | } |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1761 | |
| 1762 | /* |
| 1763 | * optional platform-specific magic |
| 1764 | * |
| 1765 | * The .init callback is not used by any of the basic clock types, but |
| 1766 | * exists for weird hardware that must perform initialization magic. |
| 1767 | * Please consider other ways of solving initialization problems before |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 1768 | * using this callback, as its use is discouraged. |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1769 | */ |
| 1770 | if (clk->ops->init) |
| 1771 | clk->ops->init(clk->hw); |
| 1772 | |
| 1773 | clk_debug_register(clk); |
| 1774 | |
| 1775 | out: |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 1776 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1777 | |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1778 | return ret; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1779 | } |
| 1780 | |
| 1781 | /** |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1782 | * __clk_register - register a clock and return a cookie. |
| 1783 | * |
| 1784 | * Same as clk_register, except that the .clk field inside hw shall point to a |
| 1785 | * preallocated (generally statically allocated) struct clk. None of the fields |
| 1786 | * of the struct clk need to be initialized. |
| 1787 | * |
| 1788 | * The data pointed to by .init and .clk field shall NOT be marked as init |
| 1789 | * data. |
| 1790 | * |
| 1791 | * __clk_register is only exposed via clk-private.h and is intended for use with |
| 1792 | * very large numbers of clocks that need to be statically initialized. It is |
| 1793 | * a layering violation to include clk-private.h from any code which implements |
| 1794 | * a clock's .ops; as such any statically initialized clock data MUST be in a |
Peter Meerwald | 24ee1a0 | 2013-06-29 15:14:19 +0200 | [diff] [blame] | 1795 | * separate C file from the logic that implements its operations. Returns 0 |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1796 | * on success, otherwise an error code. |
| 1797 | */ |
| 1798 | struct clk *__clk_register(struct device *dev, struct clk_hw *hw) |
| 1799 | { |
| 1800 | int ret; |
| 1801 | struct clk *clk; |
| 1802 | |
| 1803 | clk = hw->clk; |
| 1804 | clk->name = hw->init->name; |
| 1805 | clk->ops = hw->init->ops; |
| 1806 | clk->hw = hw; |
| 1807 | clk->flags = hw->init->flags; |
| 1808 | clk->parent_names = hw->init->parent_names; |
| 1809 | clk->num_parents = hw->init->num_parents; |
| 1810 | |
| 1811 | ret = __clk_init(dev, clk); |
| 1812 | if (ret) |
| 1813 | return ERR_PTR(ret); |
| 1814 | |
| 1815 | return clk; |
| 1816 | } |
| 1817 | EXPORT_SYMBOL_GPL(__clk_register); |
| 1818 | |
Stephen Boyd | 46c8773 | 2012-09-24 13:38:04 -0700 | [diff] [blame] | 1819 | static int _clk_register(struct device *dev, struct clk_hw *hw, struct clk *clk) |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1820 | { |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1821 | int i, ret; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1822 | |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1823 | clk->name = kstrdup(hw->init->name, GFP_KERNEL); |
| 1824 | if (!clk->name) { |
| 1825 | pr_err("%s: could not allocate clk->name\n", __func__); |
| 1826 | ret = -ENOMEM; |
| 1827 | goto fail_name; |
| 1828 | } |
| 1829 | clk->ops = hw->init->ops; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1830 | clk->hw = hw; |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1831 | clk->flags = hw->init->flags; |
| 1832 | clk->num_parents = hw->init->num_parents; |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1833 | hw->clk = clk; |
| 1834 | |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1835 | /* allocate local copy in case parent_names is __initdata */ |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1836 | clk->parent_names = kzalloc((sizeof(char*) * clk->num_parents), |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1837 | GFP_KERNEL); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1838 | |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1839 | if (!clk->parent_names) { |
| 1840 | pr_err("%s: could not allocate clk->parent_names\n", __func__); |
| 1841 | ret = -ENOMEM; |
| 1842 | goto fail_parent_names; |
| 1843 | } |
| 1844 | |
| 1845 | |
| 1846 | /* copy each string name in case parent_names is __initdata */ |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1847 | for (i = 0; i < clk->num_parents; i++) { |
| 1848 | clk->parent_names[i] = kstrdup(hw->init->parent_names[i], |
| 1849 | GFP_KERNEL); |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1850 | if (!clk->parent_names[i]) { |
| 1851 | pr_err("%s: could not copy parent_names\n", __func__); |
| 1852 | ret = -ENOMEM; |
| 1853 | goto fail_parent_names_copy; |
| 1854 | } |
| 1855 | } |
| 1856 | |
| 1857 | ret = __clk_init(dev, clk); |
| 1858 | if (!ret) |
Stephen Boyd | 46c8773 | 2012-09-24 13:38:04 -0700 | [diff] [blame] | 1859 | return 0; |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1860 | |
| 1861 | fail_parent_names_copy: |
| 1862 | while (--i >= 0) |
| 1863 | kfree(clk->parent_names[i]); |
| 1864 | kfree(clk->parent_names); |
| 1865 | fail_parent_names: |
Saravana Kannan | 0197b3e | 2012-04-25 22:58:56 -0700 | [diff] [blame] | 1866 | kfree(clk->name); |
| 1867 | fail_name: |
Stephen Boyd | 46c8773 | 2012-09-24 13:38:04 -0700 | [diff] [blame] | 1868 | return ret; |
| 1869 | } |
| 1870 | |
| 1871 | /** |
| 1872 | * clk_register - allocate a new clock, register it and return an opaque cookie |
| 1873 | * @dev: device that is registering this clock |
| 1874 | * @hw: link to hardware-specific clock data |
| 1875 | * |
| 1876 | * clk_register is the primary interface for populating the clock tree with new |
| 1877 | * clock nodes. It returns a pointer to the newly allocated struct clk which |
| 1878 | * cannot be dereferenced by driver code but may be used in conjuction with the |
| 1879 | * rest of the clock API. In the event of an error clk_register will return an |
| 1880 | * error code; drivers must test for an error code after calling clk_register. |
| 1881 | */ |
| 1882 | struct clk *clk_register(struct device *dev, struct clk_hw *hw) |
| 1883 | { |
| 1884 | int ret; |
| 1885 | struct clk *clk; |
| 1886 | |
| 1887 | clk = kzalloc(sizeof(*clk), GFP_KERNEL); |
| 1888 | if (!clk) { |
| 1889 | pr_err("%s: could not allocate clk\n", __func__); |
| 1890 | ret = -ENOMEM; |
| 1891 | goto fail_out; |
| 1892 | } |
| 1893 | |
| 1894 | ret = _clk_register(dev, hw, clk); |
| 1895 | if (!ret) |
| 1896 | return clk; |
| 1897 | |
Mike Turquette | d1302a3 | 2012-03-29 14:30:40 -0700 | [diff] [blame] | 1898 | kfree(clk); |
| 1899 | fail_out: |
| 1900 | return ERR_PTR(ret); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1901 | } |
| 1902 | EXPORT_SYMBOL_GPL(clk_register); |
| 1903 | |
Mark Brown | 1df5c93 | 2012-04-18 09:07:12 +0100 | [diff] [blame] | 1904 | /** |
| 1905 | * clk_unregister - unregister a currently registered clock |
| 1906 | * @clk: clock to unregister |
| 1907 | * |
| 1908 | * Currently unimplemented. |
| 1909 | */ |
| 1910 | void clk_unregister(struct clk *clk) {} |
| 1911 | EXPORT_SYMBOL_GPL(clk_unregister); |
| 1912 | |
Stephen Boyd | 46c8773 | 2012-09-24 13:38:04 -0700 | [diff] [blame] | 1913 | static void devm_clk_release(struct device *dev, void *res) |
| 1914 | { |
| 1915 | clk_unregister(res); |
| 1916 | } |
| 1917 | |
| 1918 | /** |
| 1919 | * devm_clk_register - resource managed clk_register() |
| 1920 | * @dev: device that is registering this clock |
| 1921 | * @hw: link to hardware-specific clock data |
| 1922 | * |
| 1923 | * Managed clk_register(). Clocks returned from this function are |
| 1924 | * automatically clk_unregister()ed on driver detach. See clk_register() for |
| 1925 | * more information. |
| 1926 | */ |
| 1927 | struct clk *devm_clk_register(struct device *dev, struct clk_hw *hw) |
| 1928 | { |
| 1929 | struct clk *clk; |
| 1930 | int ret; |
| 1931 | |
| 1932 | clk = devres_alloc(devm_clk_release, sizeof(*clk), GFP_KERNEL); |
| 1933 | if (!clk) |
| 1934 | return ERR_PTR(-ENOMEM); |
| 1935 | |
| 1936 | ret = _clk_register(dev, hw, clk); |
| 1937 | if (!ret) { |
| 1938 | devres_add(dev, clk); |
| 1939 | } else { |
| 1940 | devres_free(clk); |
| 1941 | clk = ERR_PTR(ret); |
| 1942 | } |
| 1943 | |
| 1944 | return clk; |
| 1945 | } |
| 1946 | EXPORT_SYMBOL_GPL(devm_clk_register); |
| 1947 | |
| 1948 | static int devm_clk_match(struct device *dev, void *res, void *data) |
| 1949 | { |
| 1950 | struct clk *c = res; |
| 1951 | if (WARN_ON(!c)) |
| 1952 | return 0; |
| 1953 | return c == data; |
| 1954 | } |
| 1955 | |
| 1956 | /** |
| 1957 | * devm_clk_unregister - resource managed clk_unregister() |
| 1958 | * @clk: clock to unregister |
| 1959 | * |
| 1960 | * Deallocate a clock allocated with devm_clk_register(). Normally |
| 1961 | * this function will not need to be called and the resource management |
| 1962 | * code will ensure that the resource is freed. |
| 1963 | */ |
| 1964 | void devm_clk_unregister(struct device *dev, struct clk *clk) |
| 1965 | { |
| 1966 | WARN_ON(devres_release(dev, devm_clk_release, devm_clk_match, clk)); |
| 1967 | } |
| 1968 | EXPORT_SYMBOL_GPL(devm_clk_unregister); |
| 1969 | |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 1970 | /*** clk rate change notifiers ***/ |
| 1971 | |
| 1972 | /** |
| 1973 | * clk_notifier_register - add a clk rate change notifier |
| 1974 | * @clk: struct clk * to watch |
| 1975 | * @nb: struct notifier_block * with callback info |
| 1976 | * |
| 1977 | * Request notification when clk's rate changes. This uses an SRCU |
| 1978 | * notifier because we want it to block and notifier unregistrations are |
| 1979 | * uncommon. The callbacks associated with the notifier must not |
| 1980 | * re-enter into the clk framework by calling any top-level clk APIs; |
| 1981 | * this will cause a nested prepare_lock mutex. |
| 1982 | * |
| 1983 | * Pre-change notifier callbacks will be passed the current, pre-change |
| 1984 | * rate of the clk via struct clk_notifier_data.old_rate. The new, |
| 1985 | * post-change rate of the clk is passed via struct |
| 1986 | * clk_notifier_data.new_rate. |
| 1987 | * |
| 1988 | * Post-change notifiers will pass the now-current, post-change rate of |
| 1989 | * the clk in both struct clk_notifier_data.old_rate and struct |
| 1990 | * clk_notifier_data.new_rate. |
| 1991 | * |
| 1992 | * Abort-change notifiers are effectively the opposite of pre-change |
| 1993 | * notifiers: the original pre-change clk rate is passed in via struct |
| 1994 | * clk_notifier_data.new_rate and the failed post-change rate is passed |
| 1995 | * in via struct clk_notifier_data.old_rate. |
| 1996 | * |
| 1997 | * clk_notifier_register() must be called from non-atomic context. |
| 1998 | * Returns -EINVAL if called with null arguments, -ENOMEM upon |
| 1999 | * allocation failure; otherwise, passes along the return value of |
| 2000 | * srcu_notifier_chain_register(). |
| 2001 | */ |
| 2002 | int clk_notifier_register(struct clk *clk, struct notifier_block *nb) |
| 2003 | { |
| 2004 | struct clk_notifier *cn; |
| 2005 | int ret = -ENOMEM; |
| 2006 | |
| 2007 | if (!clk || !nb) |
| 2008 | return -EINVAL; |
| 2009 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 2010 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 2011 | |
| 2012 | /* search the list of notifiers for this clk */ |
| 2013 | list_for_each_entry(cn, &clk_notifier_list, node) |
| 2014 | if (cn->clk == clk) |
| 2015 | break; |
| 2016 | |
| 2017 | /* if clk wasn't in the notifier list, allocate new clk_notifier */ |
| 2018 | if (cn->clk != clk) { |
| 2019 | cn = kzalloc(sizeof(struct clk_notifier), GFP_KERNEL); |
| 2020 | if (!cn) |
| 2021 | goto out; |
| 2022 | |
| 2023 | cn->clk = clk; |
| 2024 | srcu_init_notifier_head(&cn->notifier_head); |
| 2025 | |
| 2026 | list_add(&cn->node, &clk_notifier_list); |
| 2027 | } |
| 2028 | |
| 2029 | ret = srcu_notifier_chain_register(&cn->notifier_head, nb); |
| 2030 | |
| 2031 | clk->notifier_count++; |
| 2032 | |
| 2033 | out: |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 2034 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 2035 | |
| 2036 | return ret; |
| 2037 | } |
| 2038 | EXPORT_SYMBOL_GPL(clk_notifier_register); |
| 2039 | |
| 2040 | /** |
| 2041 | * clk_notifier_unregister - remove a clk rate change notifier |
| 2042 | * @clk: struct clk * |
| 2043 | * @nb: struct notifier_block * with callback info |
| 2044 | * |
| 2045 | * Request no further notification for changes to 'clk' and frees memory |
| 2046 | * allocated in clk_notifier_register. |
| 2047 | * |
| 2048 | * Returns -EINVAL if called with null arguments; otherwise, passes |
| 2049 | * along the return value of srcu_notifier_chain_unregister(). |
| 2050 | */ |
| 2051 | int clk_notifier_unregister(struct clk *clk, struct notifier_block *nb) |
| 2052 | { |
| 2053 | struct clk_notifier *cn = NULL; |
| 2054 | int ret = -EINVAL; |
| 2055 | |
| 2056 | if (!clk || !nb) |
| 2057 | return -EINVAL; |
| 2058 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 2059 | clk_prepare_lock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 2060 | |
| 2061 | list_for_each_entry(cn, &clk_notifier_list, node) |
| 2062 | if (cn->clk == clk) |
| 2063 | break; |
| 2064 | |
| 2065 | if (cn->clk == clk) { |
| 2066 | ret = srcu_notifier_chain_unregister(&cn->notifier_head, nb); |
| 2067 | |
| 2068 | clk->notifier_count--; |
| 2069 | |
| 2070 | /* XXX the notifier code should handle this better */ |
| 2071 | if (!cn->notifier_head.head) { |
| 2072 | srcu_cleanup_notifier_head(&cn->notifier_head); |
Lai Jiangshan | 72b5322 | 2013-06-03 17:17:15 +0800 | [diff] [blame] | 2073 | list_del(&cn->node); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 2074 | kfree(cn); |
| 2075 | } |
| 2076 | |
| 2077 | } else { |
| 2078 | ret = -ENOENT; |
| 2079 | } |
| 2080 | |
Mike Turquette | eab89f6 | 2013-03-28 13:59:01 -0700 | [diff] [blame] | 2081 | clk_prepare_unlock(); |
Mike Turquette | b2476490 | 2012-03-15 23:11:19 -0700 | [diff] [blame] | 2082 | |
| 2083 | return ret; |
| 2084 | } |
| 2085 | EXPORT_SYMBOL_GPL(clk_notifier_unregister); |
Grant Likely | 766e6a4 | 2012-04-09 14:50:06 -0500 | [diff] [blame] | 2086 | |
| 2087 | #ifdef CONFIG_OF |
| 2088 | /** |
| 2089 | * struct of_clk_provider - Clock provider registration structure |
| 2090 | * @link: Entry in global list of clock providers |
| 2091 | * @node: Pointer to device tree node of clock provider |
| 2092 | * @get: Get clock callback. Returns NULL or a struct clk for the |
| 2093 | * given clock specifier |
| 2094 | * @data: context pointer to be passed into @get callback |
| 2095 | */ |
| 2096 | struct of_clk_provider { |
| 2097 | struct list_head link; |
| 2098 | |
| 2099 | struct device_node *node; |
| 2100 | struct clk *(*get)(struct of_phandle_args *clkspec, void *data); |
| 2101 | void *data; |
| 2102 | }; |
| 2103 | |
Prashant Gaikwad | f2f6c25 | 2013-01-04 12:30:52 +0530 | [diff] [blame] | 2104 | extern struct of_device_id __clk_of_table[]; |
| 2105 | |
| 2106 | static const struct of_device_id __clk_of_table_sentinel |
| 2107 | __used __section(__clk_of_table_end); |
| 2108 | |
Grant Likely | 766e6a4 | 2012-04-09 14:50:06 -0500 | [diff] [blame] | 2109 | static LIST_HEAD(of_clk_providers); |
| 2110 | static DEFINE_MUTEX(of_clk_lock); |
| 2111 | |
| 2112 | struct clk *of_clk_src_simple_get(struct of_phandle_args *clkspec, |
| 2113 | void *data) |
| 2114 | { |
| 2115 | return data; |
| 2116 | } |
| 2117 | EXPORT_SYMBOL_GPL(of_clk_src_simple_get); |
| 2118 | |
Shawn Guo | 494bfec | 2012-08-22 21:36:27 +0800 | [diff] [blame] | 2119 | struct clk *of_clk_src_onecell_get(struct of_phandle_args *clkspec, void *data) |
| 2120 | { |
| 2121 | struct clk_onecell_data *clk_data = data; |
| 2122 | unsigned int idx = clkspec->args[0]; |
| 2123 | |
| 2124 | if (idx >= clk_data->clk_num) { |
| 2125 | pr_err("%s: invalid clock index %d\n", __func__, idx); |
| 2126 | return ERR_PTR(-EINVAL); |
| 2127 | } |
| 2128 | |
| 2129 | return clk_data->clks[idx]; |
| 2130 | } |
| 2131 | EXPORT_SYMBOL_GPL(of_clk_src_onecell_get); |
| 2132 | |
Grant Likely | 766e6a4 | 2012-04-09 14:50:06 -0500 | [diff] [blame] | 2133 | /** |
| 2134 | * of_clk_add_provider() - Register a clock provider for a node |
| 2135 | * @np: Device node pointer associated with clock provider |
| 2136 | * @clk_src_get: callback for decoding clock |
| 2137 | * @data: context pointer for @clk_src_get callback. |
| 2138 | */ |
| 2139 | int of_clk_add_provider(struct device_node *np, |
| 2140 | struct clk *(*clk_src_get)(struct of_phandle_args *clkspec, |
| 2141 | void *data), |
| 2142 | void *data) |
| 2143 | { |
| 2144 | struct of_clk_provider *cp; |
| 2145 | |
| 2146 | cp = kzalloc(sizeof(struct of_clk_provider), GFP_KERNEL); |
| 2147 | if (!cp) |
| 2148 | return -ENOMEM; |
| 2149 | |
| 2150 | cp->node = of_node_get(np); |
| 2151 | cp->data = data; |
| 2152 | cp->get = clk_src_get; |
| 2153 | |
| 2154 | mutex_lock(&of_clk_lock); |
| 2155 | list_add(&cp->link, &of_clk_providers); |
| 2156 | mutex_unlock(&of_clk_lock); |
| 2157 | pr_debug("Added clock from %s\n", np->full_name); |
| 2158 | |
| 2159 | return 0; |
| 2160 | } |
| 2161 | EXPORT_SYMBOL_GPL(of_clk_add_provider); |
| 2162 | |
| 2163 | /** |
| 2164 | * of_clk_del_provider() - Remove a previously registered clock provider |
| 2165 | * @np: Device node pointer associated with clock provider |
| 2166 | */ |
| 2167 | void of_clk_del_provider(struct device_node *np) |
| 2168 | { |
| 2169 | struct of_clk_provider *cp; |
| 2170 | |
| 2171 | mutex_lock(&of_clk_lock); |
| 2172 | list_for_each_entry(cp, &of_clk_providers, link) { |
| 2173 | if (cp->node == np) { |
| 2174 | list_del(&cp->link); |
| 2175 | of_node_put(cp->node); |
| 2176 | kfree(cp); |
| 2177 | break; |
| 2178 | } |
| 2179 | } |
| 2180 | mutex_unlock(&of_clk_lock); |
| 2181 | } |
| 2182 | EXPORT_SYMBOL_GPL(of_clk_del_provider); |
| 2183 | |
| 2184 | struct clk *of_clk_get_from_provider(struct of_phandle_args *clkspec) |
| 2185 | { |
| 2186 | struct of_clk_provider *provider; |
| 2187 | struct clk *clk = ERR_PTR(-ENOENT); |
| 2188 | |
| 2189 | /* Check if we have such a provider in our array */ |
| 2190 | mutex_lock(&of_clk_lock); |
| 2191 | list_for_each_entry(provider, &of_clk_providers, link) { |
| 2192 | if (provider->node == clkspec->np) |
| 2193 | clk = provider->get(clkspec, provider->data); |
| 2194 | if (!IS_ERR(clk)) |
| 2195 | break; |
| 2196 | } |
| 2197 | mutex_unlock(&of_clk_lock); |
| 2198 | |
| 2199 | return clk; |
| 2200 | } |
| 2201 | |
| 2202 | const char *of_clk_get_parent_name(struct device_node *np, int index) |
| 2203 | { |
| 2204 | struct of_phandle_args clkspec; |
| 2205 | const char *clk_name; |
| 2206 | int rc; |
| 2207 | |
| 2208 | if (index < 0) |
| 2209 | return NULL; |
| 2210 | |
| 2211 | rc = of_parse_phandle_with_args(np, "clocks", "#clock-cells", index, |
| 2212 | &clkspec); |
| 2213 | if (rc) |
| 2214 | return NULL; |
| 2215 | |
| 2216 | if (of_property_read_string_index(clkspec.np, "clock-output-names", |
| 2217 | clkspec.args_count ? clkspec.args[0] : 0, |
| 2218 | &clk_name) < 0) |
| 2219 | clk_name = clkspec.np->name; |
| 2220 | |
| 2221 | of_node_put(clkspec.np); |
| 2222 | return clk_name; |
| 2223 | } |
| 2224 | EXPORT_SYMBOL_GPL(of_clk_get_parent_name); |
| 2225 | |
| 2226 | /** |
| 2227 | * of_clk_init() - Scan and init clock providers from the DT |
| 2228 | * @matches: array of compatible values and init functions for providers. |
| 2229 | * |
| 2230 | * This function scans the device tree for matching clock providers and |
| 2231 | * calls their initialization functions |
| 2232 | */ |
| 2233 | void __init of_clk_init(const struct of_device_id *matches) |
| 2234 | { |
Alex Elder | 7f7ed58 | 2013-08-22 11:31:31 -0500 | [diff] [blame] | 2235 | const struct of_device_id *match; |
Grant Likely | 766e6a4 | 2012-04-09 14:50:06 -0500 | [diff] [blame] | 2236 | struct device_node *np; |
| 2237 | |
Prashant Gaikwad | f2f6c25 | 2013-01-04 12:30:52 +0530 | [diff] [blame] | 2238 | if (!matches) |
| 2239 | matches = __clk_of_table; |
| 2240 | |
Alex Elder | 7f7ed58 | 2013-08-22 11:31:31 -0500 | [diff] [blame] | 2241 | for_each_matching_node_and_match(np, matches, &match) { |
Grant Likely | 766e6a4 | 2012-04-09 14:50:06 -0500 | [diff] [blame] | 2242 | of_clk_init_cb_t clk_init_cb = match->data; |
| 2243 | clk_init_cb(np); |
| 2244 | } |
| 2245 | } |
| 2246 | #endif |