clock.c 13.4 KB
Newer Older
1 2 3
/*
 * arch/sh/kernel/cpu/clock.c - SuperH clock framework
 *
4
 *  Copyright (C) 2005 - 2009  Paul Mundt
5 6 7
 *
 * This clock framework is derived from the OMAP version by:
 *
8
 *	Copyright (C) 2004 - 2008 Nokia Corporation
9 10
 *	Written by Tuukka Tikkanen <tuukka.tikkanen@elektrobit.com>
 *
P
Paul Mundt 已提交
11 12
 *  Modified for omap shared clock framework by Tony Lindgren <tony@atomide.com>
 *
13 14 15 16
 *  With clkdev bits:
 *
 *	Copyright (C) 2008 Russell King.
 *
17 18 19 20 21 22 23
 * This file is subject to the terms and conditions of the GNU General Public
 * License.  See the file "COPYING" in the main directory of this archive
 * for more details.
 */
#include <linux/kernel.h>
#include <linux/init.h>
#include <linux/module.h>
24
#include <linux/mutex.h>
25
#include <linux/list.h>
26 27
#include <linux/kobject.h>
#include <linux/sysdev.h>
28 29
#include <linux/seq_file.h>
#include <linux/err.h>
P
Paul Mundt 已提交
30
#include <linux/platform_device.h>
31
#include <linux/debugfs.h>
32
#include <linux/cpufreq.h>
33
#include <asm/clock.h>
34
#include <asm/machvec.h>
35 36 37

static LIST_HEAD(clock_list);
static DEFINE_SPINLOCK(clock_lock);
38
static DEFINE_MUTEX(clock_list_sem);
39

40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
void clk_rate_table_build(struct clk *clk,
			  struct cpufreq_frequency_table *freq_table,
			  int nr_freqs,
			  struct clk_div_mult_table *src_table,
			  unsigned long *bitmap)
{
	unsigned long mult, div;
	unsigned long freq;
	int i;

	for (i = 0; i < nr_freqs; i++) {
		div = 1;
		mult = 1;

		if (src_table->divisors && i < src_table->nr_divisors)
			div = src_table->divisors[i];

		if (src_table->multipliers && i < src_table->nr_multipliers)
			mult = src_table->multipliers[i];

		if (!div || !mult || (bitmap && !test_bit(i, bitmap)))
			freq = CPUFREQ_ENTRY_INVALID;
		else
			freq = clk->parent->rate * mult / div;

		freq_table[i].index = i;
		freq_table[i].frequency = freq;
	}

	/* Termination entry */
	freq_table[i].index = i;
	freq_table[i].frequency = CPUFREQ_TABLE_END;
}

long clk_rate_table_round(struct clk *clk,
			  struct cpufreq_frequency_table *freq_table,
			  unsigned long rate)
{
	unsigned long rate_error, rate_error_prev = ~0UL;
	unsigned long rate_best_fit = rate;
	unsigned long highest, lowest;
	int i;

	highest = lowest = 0;

	for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
		unsigned long freq = freq_table[i].frequency;

		if (freq == CPUFREQ_ENTRY_INVALID)
			continue;

		if (freq > highest)
			highest = freq;
		if (freq < lowest)
			lowest = freq;

		rate_error = abs(freq - rate);
		if (rate_error < rate_error_prev) {
			rate_best_fit = freq;
			rate_error_prev = rate_error;
		}

		if (rate_error == 0)
			break;
	}

	if (rate >= highest)
		rate_best_fit = highest;
	if (rate <= lowest)
		rate_best_fit = lowest;

	return rate_best_fit;
}

114 115 116
/* Used for clocks that always have same value as the parent clock */
unsigned long followparent_recalc(struct clk *clk)
{
117
	return clk->parent ? clk->parent->rate : 0;
118 119
}

120 121 122 123 124 125 126 127 128 129 130 131 132
int clk_reparent(struct clk *child, struct clk *parent)
{
	list_del_init(&child->sibling);
	if (parent)
		list_add(&child->sibling, &parent->children);
	child->parent = parent;

	/* now do the debugfs renaming to reattach the child
	   to the proper parent */

	return 0;
}

133
/* Propagate rate to children */
134
void propagate_rate(struct clk *tclk)
135 136 137
{
	struct clk *clkp;

138
	list_for_each_entry(clkp, &tclk->children, sibling) {
139
		if (clkp->ops && clkp->ops->recalc)
140
			clkp->rate = clkp->ops->recalc(clkp);
141

142
		propagate_rate(clkp);
143 144 145
	}
}

146
static void __clk_disable(struct clk *clk)
147
{
148 149 150 151 152
	if (clk->usecount == 0) {
		printk(KERN_ERR "Trying disable clock %s with 0 usecount\n",
		       clk->name);
		WARN_ON(1);
		return;
153
	}
154

155 156 157 158 159 160
	if (!(--clk->usecount)) {
		if (likely(clk->ops && clk->ops->disable))
			clk->ops->disable(clk);
		if (likely(clk->parent))
			__clk_disable(clk->parent);
	}
161 162
}

163
void clk_disable(struct clk *clk)
164 165 166
{
	unsigned long flags;

167
	if (!clk)
168
		return;
169

170
	spin_lock_irqsave(&clock_lock, flags);
171
	__clk_disable(clk);
172 173
	spin_unlock_irqrestore(&clock_lock, flags);
}
174
EXPORT_SYMBOL_GPL(clk_disable);
175

176
static int __clk_enable(struct clk *clk)
177
{
178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194
	int ret = 0;

	if (clk->usecount++ == 0) {
		if (clk->parent) {
			ret = __clk_enable(clk->parent);
			if (unlikely(ret))
				goto err;
		}

		if (clk->ops && clk->ops->enable) {
			ret = clk->ops->enable(clk);
			if (ret) {
				if (clk->parent)
					__clk_disable(clk->parent);
				goto err;
			}
		}
195
	}
196 197 198 199 200

	return ret;
err:
	clk->usecount--;
	return ret;
201 202
}

203
int clk_enable(struct clk *clk)
204 205
{
	unsigned long flags;
206
	int ret;
207

208
	if (!clk)
209
		return -EINVAL;
210

211
	spin_lock_irqsave(&clock_lock, flags);
212
	ret = __clk_enable(clk);
213
	spin_unlock_irqrestore(&clock_lock, flags);
214 215

	return ret;
216
}
217
EXPORT_SYMBOL_GPL(clk_enable);
218

219 220 221 222 223 224 225 226 227 228 229 230 231 232
static LIST_HEAD(root_clks);

/**
 * recalculate_root_clocks - recalculate and propagate all root clocks
 *
 * Recalculates all root clocks (clocks with no parent), which if the
 * clock's .recalc is set correctly, should also propagate their rates.
 * Called at init.
 */
void recalculate_root_clocks(void)
{
	struct clk *clkp;

	list_for_each_entry(clkp, &root_clks, sibling) {
233
		if (clkp->ops && clkp->ops->recalc)
234 235 236 237 238
			clkp->rate = clkp->ops->recalc(clkp);
		propagate_rate(clkp);
	}
}

239 240
int clk_register(struct clk *clk)
{
241 242 243 244 245 246 247 248 249
	if (clk == NULL || IS_ERR(clk))
		return -EINVAL;

	/*
	 * trap out already registered clocks
	 */
	if (clk->node.next || clk->node.prev)
		return 0;

250
	mutex_lock(&clock_list_sem);
251

252
	INIT_LIST_HEAD(&clk->children);
253
	clk->usecount = 0;
254 255 256 257 258 259

	if (clk->parent)
		list_add(&clk->sibling, &clk->parent->children);
	else
		list_add(&clk->sibling, &root_clks);

260
	list_add(&clk->node, &clock_list);
261
	if (clk->ops && clk->ops->init)
262
		clk->ops->init(clk);
263
	mutex_unlock(&clock_list_sem);
264 265 266

	return 0;
}
267
EXPORT_SYMBOL_GPL(clk_register);
268 269 270

void clk_unregister(struct clk *clk)
{
271
	mutex_lock(&clock_list_sem);
272
	list_del(&clk->sibling);
273
	list_del(&clk->node);
274
	mutex_unlock(&clock_list_sem);
275
}
276
EXPORT_SYMBOL_GPL(clk_unregister);
277

278 279 280 281 282 283 284 285 286
static void clk_enable_init_clocks(void)
{
	struct clk *clkp;

	list_for_each_entry(clkp, &clock_list, node)
		if (clkp->flags & CLK_ENABLE_ON_INIT)
			clk_enable(clkp);
}

287
unsigned long clk_get_rate(struct clk *clk)
288 289 290
{
	return clk->rate;
}
291
EXPORT_SYMBOL_GPL(clk_get_rate);
292 293

int clk_set_rate(struct clk *clk, unsigned long rate)
294 295 296
{
	return clk_set_rate_ex(clk, rate, 0);
}
297
EXPORT_SYMBOL_GPL(clk_set_rate);
298 299

int clk_set_rate_ex(struct clk *clk, unsigned long rate, int algo_id)
300 301
{
	int ret = -EOPNOTSUPP;
302
	unsigned long flags;
303

304
	spin_lock_irqsave(&clock_lock, flags);
305

306
	if (likely(clk->ops && clk->ops->set_rate)) {
307
		ret = clk->ops->set_rate(clk, rate, algo_id);
308 309 310 311 312
		if (ret != 0)
			goto out_unlock;
	} else {
		clk->rate = rate;
		ret = 0;
313 314
	}

315 316 317 318 319 320 321 322
	if (clk->ops && clk->ops->recalc)
		clk->rate = clk->ops->recalc(clk);

	propagate_rate(clk);

out_unlock:
	spin_unlock_irqrestore(&clock_lock, flags);

323 324
	return ret;
}
325
EXPORT_SYMBOL_GPL(clk_set_rate_ex);
326

327 328
int clk_set_parent(struct clk *clk, struct clk *parent)
{
329
	unsigned long flags;
330 331 332 333
	int ret = -EINVAL;

	if (!parent || !clk)
		return ret;
334 335
	if (clk->parent == parent)
		return 0;
336

337 338 339 340
	spin_lock_irqsave(&clock_lock, flags);
	if (clk->usecount == 0) {
		if (clk->ops->set_parent)
			ret = clk->ops->set_parent(clk, parent);
341 342 343
		else
			ret = clk_reparent(clk, parent);

344
		if (ret == 0) {
345 346
			pr_debug("clock: set parent of %s to %s (new rate %ld)\n",
				 clk->name, clk->parent->name, clk->rate);
347 348 349 350 351 352 353
			if (clk->ops->recalc)
				clk->rate = clk->ops->recalc(clk);
			propagate_rate(clk);
		}
	} else
		ret = -EBUSY;
	spin_unlock_irqrestore(&clock_lock, flags);
354 355 356 357 358 359 360 361 362 363 364

	return ret;
}
EXPORT_SYMBOL_GPL(clk_set_parent);

struct clk *clk_get_parent(struct clk *clk)
{
	return clk->parent;
}
EXPORT_SYMBOL_GPL(clk_get_parent);

365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
long clk_round_rate(struct clk *clk, unsigned long rate)
{
	if (likely(clk->ops && clk->ops->round_rate)) {
		unsigned long flags, rounded;

		spin_lock_irqsave(&clock_lock, flags);
		rounded = clk->ops->round_rate(clk, rate);
		spin_unlock_irqrestore(&clock_lock, flags);

		return rounded;
	}

	return clk_get_rate(clk);
}
EXPORT_SYMBOL_GPL(clk_round_rate);

381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430
/*
 * Find the correct struct clk for the device and connection ID.
 * We do slightly fuzzy matching here:
 *  An entry with a NULL ID is assumed to be a wildcard.
 *  If an entry has a device ID, it must match
 *  If an entry has a connection ID, it must match
 * Then we take the most specific entry - with the following
 * order of precidence: dev+con > dev only > con only.
 */
static struct clk *clk_find(const char *dev_id, const char *con_id)
{
	struct clk_lookup *p;
	struct clk *clk = NULL;
	int match, best = 0;

	list_for_each_entry(p, &clock_list, node) {
		match = 0;
		if (p->dev_id) {
			if (!dev_id || strcmp(p->dev_id, dev_id))
				continue;
			match += 2;
		}
		if (p->con_id) {
			if (!con_id || strcmp(p->con_id, con_id))
				continue;
			match += 1;
		}
		if (match == 0)
			continue;

		if (match > best) {
			clk = p->clk;
			best = match;
		}
	}
	return clk;
}

struct clk *clk_get_sys(const char *dev_id, const char *con_id)
{
	struct clk *clk;

	mutex_lock(&clock_list_sem);
	clk = clk_find(dev_id, con_id);
	mutex_unlock(&clock_list_sem);

	return clk ? clk : ERR_PTR(-ENOENT);
}
EXPORT_SYMBOL_GPL(clk_get_sys);

P
Paul Mundt 已提交
431 432 433 434 435
/*
 * Returns a clock. Note that we first try to use device id on the bus
 * and clock name. If this fails, we try to use clock name only.
 */
struct clk *clk_get(struct device *dev, const char *id)
436
{
437
	const char *dev_id = dev ? dev_name(dev) : NULL;
438
	struct clk *p, *clk = ERR_PTR(-ENOENT);
P
Paul Mundt 已提交
439 440
	int idno;

441
	clk = clk_get_sys(dev_id, id);
442
	if (clk && !IS_ERR(clk))
443 444
		return clk;

P
Paul Mundt 已提交
445 446 447 448
	if (dev == NULL || dev->bus != &platform_bus_type)
		idno = -1;
	else
		idno = to_platform_device(dev)->id;
449

450
	mutex_lock(&clock_list_sem);
P
Paul Mundt 已提交
451 452 453 454 455 456 457 458
	list_for_each_entry(p, &clock_list, node) {
		if (p->id == idno &&
		    strcmp(id, p->name) == 0 && try_module_get(p->owner)) {
			clk = p;
			goto found;
		}
	}

459 460 461 462 463 464
	list_for_each_entry(p, &clock_list, node) {
		if (strcmp(id, p->name) == 0 && try_module_get(p->owner)) {
			clk = p;
			break;
		}
	}
P
Paul Mundt 已提交
465 466

found:
467
	mutex_unlock(&clock_list_sem);
468 469 470

	return clk;
}
471
EXPORT_SYMBOL_GPL(clk_get);
472 473 474 475 476 477

void clk_put(struct clk *clk)
{
	if (clk && !IS_ERR(clk))
		module_put(clk->owner);
}
478
EXPORT_SYMBOL_GPL(clk_put);
479

480 481 482 483 484 485 486 487 488
#ifdef CONFIG_PM
static int clks_sysdev_suspend(struct sys_device *dev, pm_message_t state)
{
	static pm_message_t prev_state;
	struct clk *clkp;

	switch (state.event) {
	case PM_EVENT_ON:
		/* Resumeing from hibernation */
489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504
		if (prev_state.event != PM_EVENT_FREEZE)
			break;

		list_for_each_entry(clkp, &clock_list, node) {
			if (likely(clkp->ops)) {
				unsigned long rate = clkp->rate;

				if (likely(clkp->ops->set_parent))
					clkp->ops->set_parent(clkp,
						clkp->parent);
				if (likely(clkp->ops->set_rate))
					clkp->ops->set_rate(clkp,
						rate, NO_CHANGE);
				else if (likely(clkp->ops->recalc))
					clkp->rate = clkp->ops->recalc(clkp);
			}
505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545
		}
		break;
	case PM_EVENT_FREEZE:
		break;
	case PM_EVENT_SUSPEND:
		break;
	}

	prev_state = state;
	return 0;
}

static int clks_sysdev_resume(struct sys_device *dev)
{
	return clks_sysdev_suspend(dev, PMSG_ON);
}

static struct sysdev_class clks_sysdev_class = {
	.name = "clks",
};

static struct sysdev_driver clks_sysdev_driver = {
	.suspend = clks_sysdev_suspend,
	.resume = clks_sysdev_resume,
};

static struct sys_device clks_sysdev_dev = {
	.cls = &clks_sysdev_class,
};

static int __init clk_sysdev_init(void)
{
	sysdev_class_register(&clks_sysdev_class);
	sysdev_driver_register(&clks_sysdev_class, &clks_sysdev_driver);
	sysdev_register(&clks_sysdev_dev);

	return 0;
}
subsys_initcall(clk_sysdev_init);
#endif

546 547
int __init clk_init(void)
{
548
	int ret;
549

550 551 552 553
	ret = arch_clk_init();
	if (unlikely(ret)) {
		pr_err("%s: CPU clock registration failed.\n", __func__);
		return ret;
554 555
	}

556 557 558 559 560 561 562 563
	if (sh_mv.mv_clk_init) {
		ret = sh_mv.mv_clk_init();
		if (unlikely(ret)) {
			pr_err("%s: machvec clock initialization failed.\n",
			       __func__);
			return ret;
		}
	}
564

565
	/* Kick the child clocks.. */
566
	recalculate_root_clocks();
567

568 569 570
	/* Enable the necessary init clocks */
	clk_enable_init_clocks();

571 572 573
	return ret;
}

574 575 576 577 578 579
/*
 *	debugfs support to trace clock tree hierarchy and attributes
 */
static struct dentry *clk_debugfs_root;

static int clk_debugfs_register_one(struct clk *c)
580
{
581 582 583 584 585 586 587
	int err;
	struct dentry *d, *child;
	struct clk *pa = c->parent;
	char s[255];
	char *p = s;

	p += sprintf(p, "%s", c->name);
588
	if (c->id >= 0)
589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629
		sprintf(p, ":%d", c->id);
	d = debugfs_create_dir(s, pa ? pa->dentry : clk_debugfs_root);
	if (!d)
		return -ENOMEM;
	c->dentry = d;

	d = debugfs_create_u8("usecount", S_IRUGO, c->dentry, (u8 *)&c->usecount);
	if (!d) {
		err = -ENOMEM;
		goto err_out;
	}
	d = debugfs_create_u32("rate", S_IRUGO, c->dentry, (u32 *)&c->rate);
	if (!d) {
		err = -ENOMEM;
		goto err_out;
	}
	d = debugfs_create_x32("flags", S_IRUGO, c->dentry, (u32 *)&c->flags);
	if (!d) {
		err = -ENOMEM;
		goto err_out;
	}
	return 0;

err_out:
	d = c->dentry;
	list_for_each_entry(child, &d->d_subdirs, d_u.d_child)
		debugfs_remove(child);
	debugfs_remove(c->dentry);
	return err;
}

static int clk_debugfs_register(struct clk *c)
{
	int err;
	struct clk *pa = c->parent;

	if (pa && !pa->dentry) {
		err = clk_debugfs_register(pa);
		if (err)
			return err;
	}
630

631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654
	if (!c->dentry) {
		err = clk_debugfs_register_one(c);
		if (err)
			return err;
	}
	return 0;
}

static int __init clk_debugfs_init(void)
{
	struct clk *c;
	struct dentry *d;
	int err;

	d = debugfs_create_dir("clock", NULL);
	if (!d)
		return -ENOMEM;
	clk_debugfs_root = d;

	list_for_each_entry(c, &clock_list, node) {
		err = clk_debugfs_register(c);
		if (err)
			goto err_out;
	}
655
	return 0;
656 657 658
err_out:
	debugfs_remove(clk_debugfs_root); /* REVISIT: Cleanup correctly */
	return err;
659
}
660
late_initcall(clk_debugfs_init);