Lines Matching full:best
151 int best = 0; in DEF_TEST() local
162 if (best < gMaxRecursion[2]) { in DEF_TEST()
170 best = gMaxRecursion[2]; in DEF_TEST()
179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
230 int best = 0; in DEF_TEST() local
254 if (best < gMaxRecursion[2]) { in DEF_TEST()
262 best = gMaxRecursion[2]; in DEF_TEST()
271 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
340 int best = 0; in DEF_TEST() local
358 if (best < gMaxRecursion[2]) { in DEF_TEST()
366 best = gMaxRecursion[2]; in DEF_TEST()
375 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
385 int best[2] = { 0 }; in DEF_TEST() local
397 if (best[0] < gMaxRecursion[0] || best[1] < gMaxRecursion[1]) { in DEF_TEST()
405 best[0] = SkTMax(best[0], gMaxRecursion[0]); in DEF_TEST()
406 best[1] = SkTMax(best[1], gMaxRecursion[1]); in DEF_TEST()
415 SkDebugf("\n%s max tan=%d cubic=%d\n", __FUNCTION__, best[0], best[1]); in DEF_TEST()