mirror of https://github.com/F-Stack/f-stack.git
268 lines
6.1 KiB
C
268 lines
6.1 KiB
C
|
/*-
|
||
|
* SPDX-License-Identifier: BSD-2-Clause-FreeBSD
|
||
|
*
|
||
|
* Copyright (c) 2019 Emmanuel Vadot <manu@freebsd.org>
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
||
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
||
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
||
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
* SUCH DAMAGE.
|
||
|
*
|
||
|
* $FreeBSD$
|
||
|
*/
|
||
|
|
||
|
#include <sys/cdefs.h>
|
||
|
__FBSDID("$FreeBSD$");
|
||
|
|
||
|
#include <sys/param.h>
|
||
|
#include <sys/systm.h>
|
||
|
#include <sys/bus.h>
|
||
|
|
||
|
#include <dev/extres/clk/clk.h>
|
||
|
|
||
|
#include <arm/allwinner/clkng/aw_clk.h>
|
||
|
#include <arm/allwinner/clkng/aw_clk_np.h>
|
||
|
|
||
|
#include "clkdev_if.h"
|
||
|
|
||
|
/*
|
||
|
* clknode for clocks matching the formula :
|
||
|
*
|
||
|
* clk = clkin * n / p
|
||
|
*
|
||
|
*/
|
||
|
|
||
|
struct aw_clk_np_sc {
|
||
|
uint32_t offset;
|
||
|
|
||
|
struct aw_clk_factor n;
|
||
|
struct aw_clk_factor p;
|
||
|
|
||
|
uint32_t gate_shift;
|
||
|
uint32_t lock_shift;
|
||
|
uint32_t lock_retries;
|
||
|
|
||
|
uint32_t flags;
|
||
|
};
|
||
|
|
||
|
#define WRITE4(_clk, off, val) \
|
||
|
CLKDEV_WRITE_4(clknode_get_device(_clk), off, val)
|
||
|
#define READ4(_clk, off, val) \
|
||
|
CLKDEV_READ_4(clknode_get_device(_clk), off, val)
|
||
|
#define DEVICE_LOCK(_clk) \
|
||
|
CLKDEV_DEVICE_LOCK(clknode_get_device(_clk))
|
||
|
#define DEVICE_UNLOCK(_clk) \
|
||
|
CLKDEV_DEVICE_UNLOCK(clknode_get_device(_clk))
|
||
|
|
||
|
static int
|
||
|
aw_clk_np_init(struct clknode *clk, device_t dev)
|
||
|
{
|
||
|
struct aw_clk_np_sc *sc;
|
||
|
|
||
|
sc = clknode_get_softc(clk);
|
||
|
|
||
|
clknode_init_parent_idx(clk, 0);
|
||
|
return (0);
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
aw_clk_np_set_gate(struct clknode *clk, bool enable)
|
||
|
{
|
||
|
struct aw_clk_np_sc *sc;
|
||
|
uint32_t val;
|
||
|
|
||
|
sc = clknode_get_softc(clk);
|
||
|
|
||
|
if ((sc->flags & AW_CLK_HAS_GATE) == 0)
|
||
|
return (0);
|
||
|
|
||
|
DEVICE_LOCK(clk);
|
||
|
READ4(clk, sc->offset, &val);
|
||
|
if (enable)
|
||
|
val |= (1 << sc->gate_shift);
|
||
|
else
|
||
|
val &= ~(1 << sc->gate_shift);
|
||
|
WRITE4(clk, sc->offset, val);
|
||
|
DEVICE_UNLOCK(clk);
|
||
|
|
||
|
return (0);
|
||
|
}
|
||
|
|
||
|
static uint64_t
|
||
|
aw_clk_np_find_best(struct aw_clk_np_sc *sc, uint64_t fparent, uint64_t *fout,
|
||
|
uint32_t *factor_n, uint32_t *factor_p)
|
||
|
{
|
||
|
uint64_t cur, best;
|
||
|
uint32_t n, p, max_n, max_p, min_n, min_p;
|
||
|
|
||
|
*factor_n = *factor_p = 0;
|
||
|
|
||
|
max_n = aw_clk_factor_get_max(&sc->n);
|
||
|
max_p = aw_clk_factor_get_max(&sc->p);
|
||
|
min_n = aw_clk_factor_get_min(&sc->n);
|
||
|
min_p = aw_clk_factor_get_min(&sc->p);
|
||
|
|
||
|
for (p = min_p; p <= max_p; ) {
|
||
|
for (n = min_n; n <= max_n; ) {
|
||
|
cur = fparent * n / p;
|
||
|
if (abs(*fout - cur) < abs(*fout - best)) {
|
||
|
best = cur;
|
||
|
*factor_n = n;
|
||
|
*factor_p = p;
|
||
|
}
|
||
|
|
||
|
n++;
|
||
|
}
|
||
|
p++;
|
||
|
}
|
||
|
|
||
|
return (best);
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
aw_clk_np_set_freq(struct clknode *clk, uint64_t fparent, uint64_t *fout,
|
||
|
int flags, int *stop)
|
||
|
{
|
||
|
struct aw_clk_np_sc *sc;
|
||
|
uint64_t cur, best;
|
||
|
uint32_t val, n, p, best_n, best_p;
|
||
|
int retry;
|
||
|
|
||
|
sc = clknode_get_softc(clk);
|
||
|
|
||
|
best = cur = 0;
|
||
|
|
||
|
best = aw_clk_np_find_best(sc, fparent, fout,
|
||
|
&best_n, &best_p);
|
||
|
|
||
|
if ((flags & CLK_SET_DRYRUN) != 0) {
|
||
|
*fout = best;
|
||
|
*stop = 1;
|
||
|
return (0);
|
||
|
}
|
||
|
|
||
|
if ((best < *fout) &&
|
||
|
((flags & CLK_SET_ROUND_DOWN) == 0)) {
|
||
|
*stop = 1;
|
||
|
return (ERANGE);
|
||
|
}
|
||
|
if ((best > *fout) &&
|
||
|
((flags & CLK_SET_ROUND_UP) == 0)) {
|
||
|
*stop = 1;
|
||
|
return (ERANGE);
|
||
|
}
|
||
|
|
||
|
DEVICE_LOCK(clk);
|
||
|
READ4(clk, sc->offset, &val);
|
||
|
|
||
|
n = aw_clk_factor_get_value(&sc->n, best_n);
|
||
|
p = aw_clk_factor_get_value(&sc->p, best_p);
|
||
|
val &= ~sc->n.mask;
|
||
|
val &= ~sc->p.mask;
|
||
|
val |= n << sc->n.shift;
|
||
|
val |= p << sc->p.shift;
|
||
|
|
||
|
WRITE4(clk, sc->offset, val);
|
||
|
DEVICE_UNLOCK(clk);
|
||
|
|
||
|
if ((sc->flags & AW_CLK_HAS_LOCK) != 0) {
|
||
|
for (retry = 0; retry < sc->lock_retries; retry++) {
|
||
|
READ4(clk, sc->offset, &val);
|
||
|
if ((val & (1 << sc->lock_shift)) != 0)
|
||
|
break;
|
||
|
DELAY(1000);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
*fout = best;
|
||
|
*stop = 1;
|
||
|
|
||
|
return (0);
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
aw_clk_np_recalc(struct clknode *clk, uint64_t *freq)
|
||
|
{
|
||
|
struct aw_clk_np_sc *sc;
|
||
|
uint32_t val, n, p;
|
||
|
|
||
|
sc = clknode_get_softc(clk);
|
||
|
|
||
|
DEVICE_LOCK(clk);
|
||
|
READ4(clk, sc->offset, &val);
|
||
|
DEVICE_UNLOCK(clk);
|
||
|
|
||
|
n = aw_clk_get_factor(val, &sc->n);
|
||
|
p = aw_clk_get_factor(val, &sc->p);
|
||
|
|
||
|
*freq = *freq * n / p;
|
||
|
|
||
|
return (0);
|
||
|
}
|
||
|
|
||
|
static clknode_method_t aw_np_clknode_methods[] = {
|
||
|
/* Device interface */
|
||
|
CLKNODEMETHOD(clknode_init, aw_clk_np_init),
|
||
|
CLKNODEMETHOD(clknode_set_gate, aw_clk_np_set_gate),
|
||
|
CLKNODEMETHOD(clknode_recalc_freq, aw_clk_np_recalc),
|
||
|
CLKNODEMETHOD(clknode_set_freq, aw_clk_np_set_freq),
|
||
|
CLKNODEMETHOD_END
|
||
|
};
|
||
|
|
||
|
DEFINE_CLASS_1(aw_np_clknode, aw_np_clknode_class, aw_np_clknode_methods,
|
||
|
sizeof(struct aw_clk_np_sc), clknode_class);
|
||
|
|
||
|
int
|
||
|
aw_clk_np_register(struct clkdom *clkdom, struct aw_clk_np_def *clkdef)
|
||
|
{
|
||
|
struct clknode *clk;
|
||
|
struct aw_clk_np_sc *sc;
|
||
|
|
||
|
clk = clknode_create(clkdom, &aw_np_clknode_class, &clkdef->clkdef);
|
||
|
if (clk == NULL)
|
||
|
return (1);
|
||
|
|
||
|
sc = clknode_get_softc(clk);
|
||
|
|
||
|
sc->offset = clkdef->offset;
|
||
|
|
||
|
sc->n.shift = clkdef->n.shift;
|
||
|
sc->n.width = clkdef->n.width;
|
||
|
sc->n.mask = ((1 << sc->n.width) - 1) << sc->n.shift;
|
||
|
sc->n.value = clkdef->n.value;
|
||
|
sc->n.flags = clkdef->n.flags;
|
||
|
|
||
|
sc->p.shift = clkdef->p.shift;
|
||
|
sc->p.width = clkdef->p.width;
|
||
|
sc->p.mask = ((1 << sc->p.width) - 1) << sc->p.shift;
|
||
|
sc->p.value = clkdef->p.value;
|
||
|
sc->p.flags = clkdef->p.flags;
|
||
|
|
||
|
sc->gate_shift = clkdef->gate_shift;
|
||
|
|
||
|
sc->lock_shift = clkdef->lock_shift;
|
||
|
sc->lock_retries = clkdef->lock_retries;
|
||
|
|
||
|
sc->flags = clkdef->flags;
|
||
|
|
||
|
clknode_register(clkdom, clk);
|
||
|
|
||
|
return (0);
|
||
|
}
|