Changeset 62 for tests/test-ftrsm.C

Timestamp:

06/03/08 21:24:57 (7 months ago)

Author:

pernet

Message:

* Change the design of fflas-bounds
* Modular<double> -> ModularBalanced?<double>
* Fix the winograd recursion issue (when some steps are done over the field)
* Fix a bunch of bugs
* Remove the template specialization by the Element (incompatible with the soon coming compressed representations over small fields)
* Create a randiter file, generic wrt the modular field

Location:

tests

Files:

• . (modified) (1 prop)
• test-ftrsm.C (modified) (5 diffs)

tests/test-ftrsm.C

@@ -1 +1 @@
 /* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
 //--------------------------------------------------------------------------
-//                        Test for ftrtri : 1 computation
+//                        Test for ftrsm : 1 computation
 //                  
 //--------------------------------------------------------------------------
@@ -20 +20 @@
 using namespace std;
 
-typedef Modular<double> Field;
+//typedef ModularBalanced<double> Field;
+typedef ModularBalanced<float> Field;
 
 int main(int argc, char** argv){
@@ -34 +35 @@
         }
         int nbit=atoi(argv[4]); // number of times the product is performed
-        Field F(atoi(argv[1]));
+        Field F(atof(argv[1]));
         F.init(zero,0.0);
         F.init(one,1.0);
@@ -97 +98 @@
                 //write_field (F,cerr<<"B2="<<endl,B2,m,n,n);
                 //write_field (F,cerr<<"B="<<endl,B,m,n,n);
-        }else{
-        
+        } else  
                 cerr<<"PASS"<<endl;
-        }
-
-        Field::Element * C = read_field (F, argv[2], &k, &k);
-        wrong = false;
-
-        for (int i=0;i<k;++i)
-                for (int j=0;j<k;++j)
-                        if ( !F.areEqual(*(A+i*k+j), *(C+i*k+j))){
-                                cerr<<"A ["<<i<<", "<<j<<"] = "<<(*(A+i*k+j))
-                                    <<" ; C ["<<i<<", "<<j<<"] = "<<(*(C+i*k+j))
-                                    <<endl;
-                                wrong = true;
-                        }
-        
-        delete[] C;
-                
-        if ( wrong ){
-                cerr<<"FAIL A modifed"<<endl;
-                //write_field (F,cerr<<"B2="<<endl,B2,m,n,n);
-                //write_field (F,cerr<<"B="<<endl,B,m,n,n);
-        }else{
-        
-                cerr<<"PASS"<<endl;
-        }
-        
 #endif
 
@@ -130 +105 @@
         delete[] B;
         delete[] B2;
+
 #if TIME
         double mflops = m*n/1000000.0*nbit*n/time;