717 		      const struct gma_limit_t *limit,  in gma_pll_is_valid()  argument
720 	if (clock->p1 < limit->p1.min || limit->p1.max < clock->p1)  in gma_pll_is_valid()
722 	if (clock->p < limit->p.min || limit->p.max < clock->p)  in gma_pll_is_valid()
724 	if (clock->m2 < limit->m2.min || limit->m2.max < clock->m2)  in gma_pll_is_valid()
726 	if (clock->m1 < limit->m1.min || limit->m1.max < clock->m1)  in gma_pll_is_valid()
731 	if (clock->m < limit->m.min || limit->m.max < clock->m)  in gma_pll_is_valid()
733 	if (clock->n < limit->n.min || limit->n.max < clock->n)  in gma_pll_is_valid()
735 	if (clock->vco < limit->vco.min || limit->vco.max < clock->vco)  in gma_pll_is_valid()
741 	if (clock->dot < limit->dot.min || limit->dot.max < clock->dot)  in gma_pll_is_valid()
747 bool gma_find_best_pll(const struct gma_limit_t *limit,  in gma_find_best_pll()  argument
767 			clock.p2 = limit->p2.p2_fast;  in gma_find_best_pll()
769 			clock.p2 = limit->p2.p2_slow;  in gma_find_best_pll()
771 		if (target < limit->p2.dot_limit)  in gma_find_best_pll()
772 			clock.p2 = limit->p2.p2_slow;  in gma_find_best_pll()
774 			clock.p2 = limit->p2.p2_fast;  in gma_find_best_pll()
780 	for (clock.m1 = limit->m1.min; clock.m1 <= limit->m1.max; clock.m1++) {  in gma_find_best_pll()
781 		for (clock.m2 = limit->m2.min;  in gma_find_best_pll()
783 		      clock.m2 <= limit->m2.max; clock.m2++) {  in gma_find_best_pll()
784 			for (clock.n = limit->n.min;  in gma_find_best_pll()
785 			     clock.n <= limit->n.max; clock.n++) {  in gma_find_best_pll()
786 				for (clock.p1 = limit->p1.min;  in gma_find_best_pll()
787 				     clock.p1 <= limit->p1.max;  in gma_find_best_pll()
794 								limit, &clock))  in gma_find_best_pll()