sl@0: /* sl@0: * LIBOIL - Library of Optimized Inner Loops sl@0: * Copyright (c) 2004 David A. Schleef sl@0: * All rights reserved. sl@0: * sl@0: * Redistribution and use in source and binary forms, with or without sl@0: * modification, are permitted provided that the following conditions sl@0: * are met: sl@0: * 1. Redistributions of source code must retain the above copyright sl@0: * notice, this list of conditions and the following disclaimer. sl@0: * 2. Redistributions in binary form must reproduce the above copyright sl@0: * notice, this list of conditions and the following disclaimer in the sl@0: * documentation and/or other materials provided with the distribution. sl@0: * sl@0: * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR sl@0: * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED sl@0: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE sl@0: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, sl@0: * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES sl@0: * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR sl@0: * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) sl@0: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, sl@0: * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING sl@0: * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE sl@0: * POSSIBILITY OF SUCH DAMAGE. sl@0: */ sl@0: sl@0: sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: #include sl@0: sl@0: #include sl@0: #include sl@0: #include sl@0: #define LOG_FILE "c:\\logs\\testsuite_test1_log1.txt" sl@0: #include "std_log_result.h" sl@0: #define LOG_FILENAME_LINE __FILE__, __LINE__ sl@0: sl@0: void create_xml(int result) sl@0: { sl@0: if(result) sl@0: assert_failed = 1; sl@0: sl@0: testResultXml("testsuite_test1"); sl@0: close_log_file(); sl@0: } sl@0: sl@0: void hist(OilTest *Test); sl@0: sl@0: int main (int argc, char *argv[]) sl@0: { sl@0: OilFunctionClass *klass; sl@0: OilFunctionImpl *impl; sl@0: OilTest *test; sl@0: int i; sl@0: int n; sl@0: //int j; sl@0: int ret; sl@0: unsigned int cpu_flags; sl@0: //xmlfile = "test1"; sl@0: std_log(LOG_FILENAME_LINE, "Test Started testsuite_test1"); sl@0: sl@0: oil_init (); sl@0: sl@0: cpu_flags = oil_cpu_get_flags (); //Returns a bitmask containing the available CPU features sl@0: n = oil_class_get_n_classes (); sl@0: for (i=0;iname); sl@0: std_log(LOG_FILENAME_LINE, "class name = %s\n",klass->name); sl@0: sl@0: test = oil_test_new (klass); //Creates a new OilTest(structure describing how to test an OilFunctionImpl for an OilFunctionClass) for the OilFunctionClass represented by klass sl@0: if (test == NULL) { sl@0: std_log(LOG_FILENAME_LINE, "bad prototype"); sl@0: printf(" bad prototype\n"); sl@0: continue; sl@0: } sl@0: sl@0: for (impl = klass->first_impl; impl; impl = impl->next) sl@0: { sl@0: printf(" %s\n", impl->name); sl@0: if ((impl->flags & OIL_CPU_FLAG_MASK) & ~cpu_flags) sl@0: { sl@0: std_log(LOG_FILENAME_LINE, "not supported"); sl@0: printf("not supported\n"); sl@0: } sl@0: else sl@0: { sl@0: test->n = 1600; sl@0: ret = oil_test_check_impl (test, impl); //Runs the testing procedure described by test on the implementation impl sl@0: if (ret) sl@0: { sl@0: #if 0 sl@0: printf(" %lu %g\n",test->prof.min, sl@0: (double)test->prof.total/test->prof.n); sl@0: for(j=0;jprof.hist_n;j++){ sl@0: printf(" %lu %d\n",test->prof.hist_time[j],test->prof.hist_count[j]); sl@0: } sl@0: #endif sl@0: printf(" ave=%g std=%g\n", impl->profile_ave, impl->profile_std); sl@0: //hist(test); sl@0: } sl@0: else sl@0: { sl@0: printf(" not tested\n"); sl@0: oil_test_free (test); sl@0: std_log(LOG_FILENAME_LINE, "Test Failed"); sl@0: create_xml(1); sl@0: return 1; sl@0: } sl@0: } sl@0: }//for loop sl@0: sl@0: oil_test_free (test); //Frees memory associated with test(OilTest) sl@0: } sl@0: std_log(LOG_FILENAME_LINE, "Test Successful"); sl@0: create_xml(0); sl@0: return 0; sl@0: } sl@0: sl@0: sl@0: void sl@0: hist(OilTest *test) sl@0: { sl@0: double ave; sl@0: double std; sl@0: int max_i; sl@0: double off; sl@0: double s; sl@0: double s2; sl@0: int i; sl@0: int n; sl@0: double x; sl@0: sl@0: do { sl@0: s = s2 = 0; sl@0: n = 0; sl@0: max_i = -1; sl@0: for(i=0;i<10;i++){ sl@0: x = test->prof.hist_time[i]; sl@0: s2 += x * x * test->prof.hist_count[i]; sl@0: s += x * test->prof.hist_count[i]; sl@0: n += test->prof.hist_count[i]; sl@0: if (test->prof.hist_count[i] > 0) { sl@0: if (max_i == -1 || test->prof.hist_time[i] > test->prof.hist_time[max_i]) { sl@0: max_i = i; sl@0: } sl@0: } sl@0: } sl@0: sl@0: ave = s / n; sl@0: std = sqrt (s2 - s * s / n + n*n) / (n-1); sl@0: off = (test->prof.hist_time[max_i] - ave)/std; sl@0: sl@0: printf(" ave=%g std=%g max=%ld off=%g %s\n", sl@0: ave, std, test->prof.hist_time[max_i], off, (off>4.0)?"yes":"no"); sl@0: sl@0: if (off > 4.0) { sl@0: test->prof.hist_count[max_i] = 0; sl@0: } sl@0: } while (off > 4.0); sl@0: printf(" ave=%g std=%g\n", ave, std); sl@0: } sl@0: sl@0: