Home
last modified time | relevance | path

Searched refs:max_n (Results 1 – 4 of 4) sorted by relevance

/bsp/allwinner/libraries/sunxi-hal/hal/source/ccmu/sunxi-ng/
A Dccu_nk.c13 unsigned long n, min_n, max_n; member
26 for (_n = nk->min_n; _n <= nk->max_n; _n++) in ccu_nk_find_best()
115 _nk.max_n = nk->n.max ? : 1 << nk->n.width; in ccu_nk_round_rate()
144 _nk.max_n = nk->n.max ? : 1 << nk->n.width; in ccu_nk_set_rate()
A Dccu_nkm.c12 unsigned long n, min_n, max_n; member
26 for (_n = nkm->min_n; _n <= nkm->max_n; _n++) in ccu_nkm_find_best()
128 _nkm.max_n = nkm->n.max ? : 1 << nkm->n.width; in ccu_nkm_round_rate()
174 _nkm.max_n = nkm->n.max ? : 1 << nkm->n.width; in ccu_nkm_set_rate()
A Dccu_nkmp.c12 unsigned long n, min_n, max_n; member
58 for (_n = nkmp->min_n; _n <= nkmp->max_n; _n++) in ccu_nkmp_find_best()
182 _nkmp.max_n = nkmp->n.max ? : 1 << nkmp->n.width; in ccu_nkmp_round_rate()
217 _nkmp.max_n = nkmp->n.max ? : 1 << nkmp->n.width; in ccu_nkmp_set_rate()
A Dccu_nm.c13 unsigned long n, min_n, max_n; member
35 for (_n = nm->min_n; _n <= nm->max_n; _n++) in ccu_nm_find_best()
186 _nm.max_n = nm->n.max ? : 1 << nm->n.width; in ccu_nm_round_rate()
237 _nm.max_n = nm->n.max ? : 1 << nm->n.width; in ccu_nm_set_rate()

Completed in 10 milliseconds