74   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
75     if (div[j] == 0) {  in TEST_F()
76       div[j] = 1280;  in TEST_F()
78     num[j] &= 0xffff;  // Clamp to avoid divide overflow.  in TEST_F()
81     for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
82       result_opt[j] = libyuv::FixedDiv(num[j], div[j]);  in TEST_F()
85   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
86     result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);  in TEST_F()
87     EXPECT_NEAR(result_c[j], result_opt[j], 1);  in TEST_F()
99   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
100     num[j] &= 4095;  // Make numerator smaller.  in TEST_F()
101     div[j] &= 4095;  // Make divisor smaller.  in TEST_F()
102     if (div[j] == 0) {  in TEST_F()
103       div[j] = 1280;  in TEST_F()
110       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
111         result_opt[j] = libyuv::FixedDiv(num[j], div[j]);  in TEST_F()
114       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
115         result_opt[j] = libyuv::FixedDiv_C(num[j], div[j]);  in TEST_F()
119   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
120     result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);  in TEST_F()
121     EXPECT_NEAR(result_c[j], result_opt[j], 1);  in TEST_F()
133   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
134     num[j] &= 4095;  // Make numerator smaller.  in TEST_F()
135     div[j] &= 4095;  // Make divisor smaller.  in TEST_F()
136     if (div[j] <= 1) {  in TEST_F()
137       div[j] = 1280;  in TEST_F()
144       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
145         result_opt[j] = libyuv::FixedDiv1(num[j], div[j]);  in TEST_F()
148       for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
149         result_opt[j] = libyuv::FixedDiv1_C(num[j], div[j]);  in TEST_F()
153   for (int j = 0; j < 1280; ++j) {  in TEST_F()  local
154     result_c[j] = libyuv::FixedDiv1_C(num[j], div[j]);  in TEST_F()
155     EXPECT_NEAR(result_c[j], result_opt[j], 1);  in TEST_F()