Lines Matching full:best
150 int best = 0; in DEF_TEST() local
161 if (best < gMaxRecursion[2]) { in DEF_TEST()
169 best = gMaxRecursion[2]; in DEF_TEST()
178 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
229 int best = 0; in DEF_TEST() local
253 if (best < gMaxRecursion[2]) { in DEF_TEST()
261 best = gMaxRecursion[2]; in DEF_TEST()
270 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
339 int best = 0; in DEF_TEST() local
357 if (best < gMaxRecursion[2]) { in DEF_TEST()
365 best = gMaxRecursion[2]; in DEF_TEST()
374 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
384 int best[2] = { 0 }; in DEF_TEST() local
396 if (best[0] < gMaxRecursion[0] || best[1] < gMaxRecursion[1]) { in DEF_TEST()
404 best[0] = SkTMax(best[0], gMaxRecursion[0]); in DEF_TEST()
405 best[1] = SkTMax(best[1], gMaxRecursion[1]); in DEF_TEST()
414 SkDebugf("\n%s max tan=%d cubic=%d\n", __FUNCTION__, best[0], best[1]); in DEF_TEST()