break up unittests into categories

unit_test/math_test.cc

 /*
  *  Copyright 2013 The LibYuv Project Authors. All rights reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS. All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
 #include <stdlib.h>
 #include <string.h>
 #include <time.h>
 
 #include "libyuv/basic_types.h"
 #include "libyuv/cpu_id.h"
 #include "libyuv/row.h"
 #include "libyuv/scale.h"
 #include "libyuv/scale_row.h"
 #include "../unit_test/unit_test.h"
 
 namespace libyuv {
 
-TEST_F(libyuvTest, TestFixedDiv) {
+TEST_F(LibYUVBaseTest, TestFixedDiv) {
   int num[1280];
   int div[1280];
   int result_opt[1280];
   int result_c[1280];
 
   EXPECT_EQ(0x10000, libyuv::FixedDiv(1, 1));
   EXPECT_EQ(0x7fff0000, libyuv::FixedDiv(0x7fff, 1));
   // TODO(fbarchard): Avoid the following that throw exceptions.
   // EXPECT_EQ(0x100000000, libyuv::FixedDiv(0x10000, 1));
   // EXPECT_EQ(0x80000000, libyuv::FixedDiv(0x8000, 1));
@@ skipping 43 matching lines @@
     for (int j = 0; j < 1280; ++j) {
       result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
     }
   }
   for (int j = 0; j < 1280; ++j) {
     result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
     EXPECT_NEAR(result_c[j], result_opt[j], 1);
   }
 }
 
-TEST_F(libyuvTest, TestFixedDiv_Opt) {
+TEST_F(LibYUVBaseTest, TestFixedDiv_Opt) {
   int num[1280];
   int div[1280];
   int result_opt[1280];
   int result_c[1280];
 
   MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
   MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
   for (int j = 0; j < 1280; ++j) {
     num[j] &= 4095;  // Make numerator smaller.
     div[j] &= 4095;  // Make divisor smaller.
@@ skipping 13 matching lines @@
         result_opt[j] = libyuv::FixedDiv_C(num[j], div[j]);
       }
     }
   }
   for (int j = 0; j < 1280; ++j) {
     result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
     EXPECT_NEAR(result_c[j], result_opt[j], 1);
   }
 }
 
-TEST_F(libyuvTest, TestFixedDiv1_Opt) {
+TEST_F(LibYUVBaseTest, TestFixedDiv1_Opt) {
   int num[1280];
   int div[1280];
   int result_opt[1280];
   int result_c[1280];
 
   MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
   MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
   for (int j = 0; j < 1280; ++j) {
     num[j] &= 4095;  // Make numerator smaller.
     div[j] &= 4095;  // Make divisor smaller.
@@ skipping 14 matching lines @@
       }
     }
   }
   for (int j = 0; j < 1280; ++j) {
     result_c[j] = libyuv::FixedDiv1_C(num[j], div[j]);
     EXPECT_NEAR(result_c[j], result_opt[j], 1);
   }
 }
 
 }  // namespace libyuv