70   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
71     if (div[j] == 0) {  in TEST_F()
72       div[j] = 1280;  in TEST_F()
74     num[j] &= 0xffff;  // Clamp to avoid divide overflow.  in TEST_F()
77     for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
78       result_opt[j] = libyuv::FixedDiv(num[j], div[j]);  in TEST_F()
81   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
82     result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);  in TEST_F()
83     EXPECT_NEAR(result_c[j], result_opt[j], 1);  in TEST_F()
95   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
96     num[j] &= 4095;  // Make numerator smaller.  in TEST_F()
97     div[j] &= 4095;  // Make divisor smaller.  in TEST_F()
98     if (div[j] == 0) {  in TEST_F()
99       div[j] = 1280;  in TEST_F()
106       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
107         result_opt[j] = libyuv::FixedDiv(num[j], div[j]);  in TEST_F()
110       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
111         result_opt[j] = libyuv::FixedDiv_C(num[j], div[j]);  in TEST_F()
115   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
116     result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);  in TEST_F()
117     EXPECT_NEAR(result_c[j], result_opt[j], 1);  in TEST_F()
129   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
130     num[j] &= 4095;  // Make numerator smaller.  in TEST_F()
131     div[j] &= 4095;  // Make divisor smaller.  in TEST_F()
132     if (div[j] <= 1) {  in TEST_F()
133       div[j] = 1280;  in TEST_F()
140       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
141         result_opt[j] = libyuv::FixedDiv1(num[j], div[j]);  in TEST_F()
144       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
145         result_opt[j] = libyuv::FixedDiv1_C(num[j], div[j]);  in TEST_F()
149   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
150     result_c[j] = libyuv::FixedDiv1_C(num[j], div[j]);  in TEST_F()
151     EXPECT_NEAR(result_c[j], result_opt[j], 1);  in TEST_F()