Home
last modified time | relevance | path

Searched refs:best_n1 (Results 1 – 3 of 3) sorted by relevance

/haiku/src/add-ons/accelerants/s3/
H A Dtrio64_mode.cpp26 uint8 best_n1 = 18, best_n2 = 2, best_m = 127; in Trio64_CalcClock() local
59 best_n1 = n1; in Trio64_CalcClock()
67 *ndiv = (best_n1 - 2) | (best_n2 << 6); in Trio64_CalcClock()
69 *ndiv = (best_n1 - 2) | (best_n2 << 5); in Trio64_CalcClock()
H A Dvirge_mode.cpp193 uint8 best_n1 = 16 + 2, best_n2 = 2, best_m = 125 + 2; in Virge_CalcClock() local
228 best_n1 = n1; in Virge_CalcClock()
236 *ndiv = (best_n1 - 2) | (best_n2 << 6); in Virge_CalcClock()
238 *ndiv = (best_n1 - 2) | (best_n2 << 5); in Virge_CalcClock()
H A Dsavage_mode.cpp458 uint8 best_n1 = 16 + 2, best_n2 = 2, best_m = 125 + 2; in Savage_CalcClock() local
491 best_n1 = n1; in Savage_CalcClock()
498 *ndiv = best_n1 - 2; in Savage_CalcClock()