| [2362] | 1 | #include "machdefs.h" | 
|---|
|  | 2 |  | 
|---|
|  | 3 | #include <math.h> | 
|---|
|  | 4 | #include <iostream> | 
|---|
|  | 5 | #include <fstream> | 
|---|
|  | 6 |  | 
|---|
|  | 7 | #include "tarrinit.h" | 
|---|
|  | 8 | #include "array.h" | 
|---|
|  | 9 |  | 
|---|
|  | 10 | #include "pexceptions.h" | 
|---|
|  | 11 | #include "srandgen.h" | 
|---|
|  | 12 |  | 
|---|
|  | 13 | #include "sophyainit.h" | 
|---|
|  | 14 | #include "ctimer.h" | 
|---|
|  | 15 | #include "timing.h" | 
|---|
|  | 16 |  | 
|---|
|  | 17 | #include "smtx.h" | 
|---|
|  | 18 |  | 
|---|
|  | 19 | //-------------------------------------------------------- | 
|---|
|  | 20 | //   Test d'expression template sur tableaux | 
|---|
|  | 21 | //       Reza - Avril 2003 | 
|---|
|  | 22 | //-------------------------------------------------------- | 
|---|
|  | 23 |  | 
|---|
|  | 24 | //-------  Le code de smtx.cc | 
|---|
|  | 25 |  | 
|---|
|  | 26 | #include "smtx.cc" | 
|---|
|  | 27 |  | 
|---|
|  | 28 | //------- | 
|---|
|  | 29 | // ------------------------------------------------ | 
|---|
|  | 30 | //   programme de test template expressions | 
|---|
|  | 31 | // ------------------------------------------------ | 
|---|
|  | 32 |  | 
|---|
|  | 33 | int main(int narg, char* arg[]) | 
|---|
|  | 34 | { | 
|---|
|  | 35 |  | 
|---|
|  | 36 | SophyaInit(); | 
|---|
|  | 37 | InitTim();   // Initializing the CPU timer | 
|---|
|  | 38 |  | 
|---|
|  | 39 | if (narg < 3) { | 
|---|
|  | 40 | cout << "\n te/ TemplateExpression Test - missing arguments\n" | 
|---|
|  | 41 | << "     Usage: te NLoop NRow NCol \n"  << endl; | 
|---|
|  | 42 | return 1; | 
|---|
|  | 43 | } | 
|---|
|  | 44 | int N = 10; | 
|---|
|  | 45 | int nrow = 2; | 
|---|
|  | 46 | int ncol = 2; | 
|---|
|  | 47 |  | 
|---|
|  | 48 | N = atoi(arg[1]); | 
|---|
|  | 49 |  | 
|---|
|  | 50 | nrow = atoi(arg[2]); | 
|---|
|  | 51 | ncol = atoi(arg[3]); | 
|---|
|  | 52 |  | 
|---|
|  | 53 | cout << " te/ TemplateExpression Test - NLoop = " << N | 
|---|
|  | 54 | << "  NRow=" << nrow << " NCol= " << ncol | 
|---|
|  | 55 | << "  Size=nr*nc= " << nrow*ncol << endl; | 
|---|
|  | 56 |  | 
|---|
|  | 57 | try { | 
|---|
|  | 58 | cout << " ---- Verification operation ------ " << endl; | 
|---|
|  | 59 | SimpleMatrix<int_4> mx1(4,6); | 
|---|
|  | 60 | mx1 = 3; | 
|---|
|  | 61 | mx1 *= 2; | 
|---|
|  | 62 | cout << " mx1=3; mx1*=2; : " << endl; | 
|---|
|  | 63 | cout << mx1 << endl; | 
|---|
|  | 64 | SimpleMatrix<int_4> mx2(4,6); | 
|---|
|  | 65 | mx2.Init(1,1); | 
|---|
|  | 66 | SimpleMatrix<int_4> mx3(4,6), mx4; | 
|---|
|  | 67 | mx3.Init(1000,100); | 
|---|
|  | 68 | mx4 = mx3+mx2*2 ; | 
|---|
|  | 69 | cout << " mx2, mx3, mx4=mx3+2mx2 " << endl; | 
|---|
|  | 70 | cout << mx2 << endl << mx3 << endl << mx4 << endl; | 
|---|
|  | 71 |  | 
|---|
| [2365] | 72 | cout << ">> Test with SimpleMatrix<T>/JET " << endl; | 
|---|
|  | 73 | PrtTim(" (0) -- "); | 
|---|
|  | 74 |  | 
|---|
| [2362] | 75 | int i,j,k; | 
|---|
| [2365] | 76 | { | 
|---|
| [2362] | 77 | SimpleMatrix<r_8> m1(nrow, ncol); | 
|---|
|  | 78 | SimpleMatrix<r_8> m2(nrow, ncol); | 
|---|
|  | 79 | SimpleMatrix<r_8> m3(nrow, ncol); | 
|---|
|  | 80 | SimpleMatrix<r_8> m4(nrow, ncol); | 
|---|
|  | 81 | SimpleMatrix<r_8> m5(nrow, ncol); | 
|---|
|  | 82 | for(k=0; k<N; k++) { | 
|---|
|  | 83 | double xxr = frand01(); | 
|---|
|  | 84 | double yyr = 2.*frand01(); | 
|---|
|  | 85 | for(i=0; i<nrow; i++) | 
|---|
|  | 86 | for(j=0; j<ncol; j++) { | 
|---|
|  | 87 | m1(i,j) = k*300+10.*i+j+xxr; | 
|---|
|  | 88 | m2(i,j) = k*550+20.*i+2.*j+yyr; | 
|---|
|  | 89 | m3(i,j) = k*860.+40.*i+7.*j+yyr*3.14; | 
|---|
|  | 90 | } | 
|---|
|  | 91 | } | 
|---|
| [2366] | 92 |  | 
|---|
| [2365] | 93 | cout << " (1) Element access done ---" << endl; | 
|---|
|  | 94 | PrtTim(" (1) -- "); | 
|---|
| [2362] | 95 | // Calcul m1*c1 + m2*c2 + m3*c3; | 
|---|
|  | 96 | for(k=0; k<N; k++) { | 
|---|
|  | 97 | double c1 = frand01() + 1.2; | 
|---|
|  | 98 | double c2 = frand01() + 3.5; | 
|---|
|  | 99 | double c3 = frand01() + 6.7; | 
|---|
|  | 100 | m5 = m1;  m5.MulCst(c1); | 
|---|
|  | 101 | m4 = m2;  m4.MulCst(c2); | 
|---|
|  | 102 | m5.AddElt(m4); | 
|---|
|  | 103 | m4 = m3;  m3.MulCst(c2); | 
|---|
|  | 104 | m5.AddElt(m4); | 
|---|
|  | 105 | } | 
|---|
| [2365] | 106 | cout << " (2) Add/MulElt/Cst m1*c1 + m2*c2 + m3*c3 done ---" << endl; | 
|---|
|  | 107 | PrtTim(" (2) -- "); | 
|---|
| [2362] | 108 |  | 
|---|
|  | 109 | for(k=0; k<N; k++) { | 
|---|
|  | 110 | double c1 = frand01() + 1.2; | 
|---|
|  | 111 | double c2 = frand01() + 3.5; | 
|---|
|  | 112 | double c3 = frand01() + 6.7; | 
|---|
|  | 113 | m5 = m1*c1+m2*c2+m3*c3; | 
|---|
|  | 114 | } | 
|---|
| [2365] | 115 | cout << " (3) JET: m1*c1 + m2*c2 + m3*c3 done ---" << endl; | 
|---|
|  | 116 | PrtTim(" (3) -- "); | 
|---|
| [2362] | 117 | // Calcul m1*c1 + m1*(m2+c2) + m2*c3; | 
|---|
|  | 118 | for(k=0; k<N; k++) { | 
|---|
|  | 119 | double c1 = frand01() + 1.2; | 
|---|
|  | 120 | double c2 = frand01() + 3.5; | 
|---|
|  | 121 | double c3 = frand01() + 6.7; | 
|---|
|  | 122 | m3 = m1;  m3.MulCst(c1); | 
|---|
|  | 123 | m4 = m2;  m4.AddCst(c2); m4.MulElt(m1); | 
|---|
|  | 124 | m5 = m2;  m5.MulCst(c3); | 
|---|
|  | 125 | m5.AddElt(m3); m5.AddElt(m4); | 
|---|
|  | 126 | } | 
|---|
| [2365] | 127 | cout << " (4) Add/MulElt/Cst m1*c1 + m1*(m2+c2) + m2*c3 done ---" << endl; | 
|---|
|  | 128 | PrtTim(" (4) --"); | 
|---|
| [2362] | 129 |  | 
|---|
|  | 130 | for(k=0; k<N; k++) { | 
|---|
|  | 131 | double c1 = frand01() + 1.2; | 
|---|
|  | 132 | double c2 = frand01() + 3.5; | 
|---|
|  | 133 | double c3 = frand01() + 6.7; | 
|---|
|  | 134 | //      m4 = SMExprAdd< r_8, SMExprMtx<r_8>, SMExprMtx<r_8> >( SMExprMtx<r_8>(m1), SMExprMtx<r_8> (m2) ); | 
|---|
|  | 135 | // Calcul m1*c1 + m1*(m2+c2) + m2*c3; | 
|---|
|  | 136 | m5 = m1*c1 + m1*(m2+c2) + m2*c3; | 
|---|
|  | 137 | } | 
|---|
| [2365] | 138 | cout << " (5) JET: m5 = m1*c1 + m1*(m2+c2) + m2*c3 ---" << endl; | 
|---|
|  | 139 | PrtTim(" (5) -- "); | 
|---|
| [2366] | 140 |  | 
|---|
|  | 141 | for(k=0; k<N; k++) { | 
|---|
|  | 142 | double c1 = frand01() + 1.2; | 
|---|
|  | 143 | double c2 = frand01() + 3.5; | 
|---|
|  | 144 | double c3 = frand01() + 6.7; | 
|---|
|  | 145 | // Calcul m1*c1 + m1*(m2+c2) + m2*c3; | 
|---|
|  | 146 | m5 = m1*c1 + m2 + c2*Sin(c3*m3+m1); | 
|---|
| [2365] | 147 | } | 
|---|
| [2366] | 148 | cout << " (6) JET: m5 = m1*c1 + m2 + c2*Sin(c3*m3+m1) ---" << endl; | 
|---|
|  | 149 | PrtTim(" (6) -- "); | 
|---|
|  | 150 |  | 
|---|
|  | 151 | } | 
|---|
|  | 152 |  | 
|---|
|  | 153 |  | 
|---|
| [2365] | 154 | // Test avec les TArray / TMatrix | 
|---|
|  | 155 | { | 
|---|
|  | 156 | cout << " >>>>> test with SOPHYA::TArray / TMatrix " << endl; | 
|---|
|  | 157 | TMatrix<r_8> m1(nrow, ncol); | 
|---|
|  | 158 | TMatrix<r_8> m2(nrow, ncol); | 
|---|
|  | 159 | TMatrix<r_8> m3(nrow, ncol); | 
|---|
|  | 160 | TMatrix<r_8> m4(nrow, ncol); | 
|---|
|  | 161 | TMatrix<r_8> m5(nrow, ncol); | 
|---|
|  | 162 | for(k=0; k<N; k++) { | 
|---|
|  | 163 | double xxr = frand01(); | 
|---|
|  | 164 | double yyr = 2.*frand01(); | 
|---|
|  | 165 | for(i=0; i<nrow; i++) | 
|---|
|  | 166 | for(j=0; j<ncol; j++) { | 
|---|
|  | 167 | m1(i,j) = k*300+10.*i+j+xxr; | 
|---|
|  | 168 | m2(i,j) = k*550+20.*i+2.*j+yyr; | 
|---|
|  | 169 | m3(i,j) = k*860.+40.*i+7.*j+yyr*3.14; | 
|---|
|  | 170 | } | 
|---|
|  | 171 | } | 
|---|
| [2366] | 172 | cout << " (21) Element access done ---" << endl; | 
|---|
|  | 173 | PrtTim(" (21) -- "); | 
|---|
| [2365] | 174 | // Calcul m1*c1 + m2*c2 + m3*c3; | 
|---|
|  | 175 | for(k=0; k<N; k++) { | 
|---|
|  | 176 | double c1 = frand01() + 1.2; | 
|---|
|  | 177 | double c2 = frand01() + 3.5; | 
|---|
|  | 178 | double c3 = frand01() + 6.7; | 
|---|
| [2798] | 179 | /* Changement interface SOPHYA  : 2004-2005 | 
|---|
|  | 180 | m5 = m1;  m5.Mul(c1); | 
|---|
|  | 181 | m4 = m2;  m4.Mul(c2); | 
|---|
|  | 182 | m5.AddElt(m4); | 
|---|
|  | 183 | m4 = m3;  m3.Mul(c3); | 
|---|
|  | 184 | m5.AddElt(m4); | 
|---|
|  | 185 | */ | 
|---|
|  | 186 | m1.MulCst(c1, m5); | 
|---|
|  | 187 | m2.MulCst(c2, m4); | 
|---|
|  | 188 | m5.AddElt(m4, m5); | 
|---|
|  | 189 | m3.MulCst(c3,m4); | 
|---|
|  | 190 | m4.AddElt(m5,m4); | 
|---|
| [2365] | 191 | } | 
|---|
| [2366] | 192 | cout << " (22) Add/MulElt/Cst m1*c1 + m2*c2 + m3*c3 done ---" << endl; | 
|---|
|  | 193 | PrtTim(" (22) -- "); | 
|---|
| [2365] | 194 |  | 
|---|
|  | 195 | for(k=0; k<N; k++) { | 
|---|
|  | 196 | double c1 = frand01() + 1.2; | 
|---|
|  | 197 | double c2 = frand01() + 3.5; | 
|---|
|  | 198 | double c3 = frand01() + 6.7; | 
|---|
|  | 199 | m5 = m1*c1+m2*c2+m3*c3; | 
|---|
|  | 200 | } | 
|---|
| [2366] | 201 | cout << " (23) m1*c1 + m2*c2 + m3*c3 done ---" << endl; | 
|---|
|  | 202 | PrtTim(" (23) -- "); | 
|---|
|  | 203 |  | 
|---|
|  | 204 | for(k=0; k<N; k++) { | 
|---|
|  | 205 | double c1 = frand01() + 1.2; | 
|---|
|  | 206 | double c2 = frand01() + 3.5; | 
|---|
|  | 207 | double c3 = frand01() + 6.7; | 
|---|
| [2939] | 208 | // Calcul m1*c1 + m1*(m2+c2) + m2*c3; | 
|---|
|  | 209 | m5 = m1*c1 + m1 && (m2+c2) + m2*c3; | 
|---|
|  | 210 | } | 
|---|
|  | 211 | cout << " (25) m5 = m1*c1 + m1*(m2+c2) + m2*c3 ---" << endl; | 
|---|
|  | 212 | PrtTim(" (25) -- "); | 
|---|
|  | 213 |  | 
|---|
|  | 214 | for(k=0; k<N; k++) { | 
|---|
|  | 215 | double c1 = frand01() + 1.2; | 
|---|
|  | 216 | double c2 = frand01() + 3.5; | 
|---|
|  | 217 | double c3 = frand01() + 6.7; | 
|---|
| [2366] | 218 | m5 = m1*c1 + m2 + c2*Sin(c3*m3+m1); | 
|---|
| [2365] | 219 | } | 
|---|
| [2366] | 220 | cout << " (26) m5 = m1*c1 + m2 + c2*Sin(c3*m3+m1) ---" << endl; | 
|---|
|  | 221 | PrtTim(" (26) -- "); | 
|---|
|  | 222 |  | 
|---|
|  | 223 | } | 
|---|
| [2367] | 224 |  | 
|---|
|  | 225 | // Test avec des double * x; | 
|---|
|  | 226 | { | 
|---|
| [2368] | 227 | cout << " >>>>> test with r_8 * p = new double[size] " << endl; | 
|---|
| [2367] | 228 | r_8 * m1 = new r_8[nrow*ncol]; | 
|---|
|  | 229 | r_8 * m2 = new r_8[nrow*ncol]; | 
|---|
|  | 230 | r_8 * m3 = new r_8[nrow*ncol]; | 
|---|
|  | 231 | r_8 * m5 = new r_8[nrow*ncol]; | 
|---|
|  | 232 | for(k=0; k<N; k++) { | 
|---|
|  | 233 | double xxr = frand01(); | 
|---|
|  | 234 | double yyr = 2.*frand01(); | 
|---|
|  | 235 | for(i=0; i<nrow*ncol; i++) { | 
|---|
|  | 236 | m1[i] = k*300+10.*i+j+xxr; | 
|---|
|  | 237 | m2[i] = k*550+20.*i+2.*j+yyr; | 
|---|
|  | 238 | m3[i] = k*860.+40.*i+7.*j+yyr*3.14; | 
|---|
|  | 239 | } | 
|---|
|  | 240 | } | 
|---|
|  | 241 | cout << " (31) p[i] Element access done ---" << endl; | 
|---|
|  | 242 | PrtTim(" (31) -- "); | 
|---|
|  | 243 | // Calcul m1*c1 + m2*c2 + m3*c3; | 
|---|
|  | 244 | for(k=0; k<N; k++) { | 
|---|
|  | 245 | double c1 = frand01() + 1.2; | 
|---|
|  | 246 | double c2 = frand01() + 3.5; | 
|---|
|  | 247 | double c3 = frand01() + 6.7; | 
|---|
|  | 248 | for(i=0; i<nrow*ncol; i++) | 
|---|
|  | 249 | m5[i] = c1*m1[i]+c2*m2[i]+c3*m3[i]; | 
|---|
|  | 250 | } | 
|---|
|  | 251 | cout << " (32) p[i] m1*c1 + m2*c2 + m3*c3 done ---" << endl; | 
|---|
|  | 252 | PrtTim(" (32) -- "); | 
|---|
|  | 253 |  | 
|---|
|  | 254 | delete[] m1; | 
|---|
|  | 255 | delete[] m2; | 
|---|
|  | 256 | delete[] m3; | 
|---|
|  | 257 | delete[] m5; | 
|---|
|  | 258 | } | 
|---|
| [2362] | 259 | } | 
|---|
|  | 260 | catch (PThrowable exc) { | 
|---|
|  | 261 | cerr << " te/catched Exception " << exc.Msg() << endl; | 
|---|
|  | 262 | } | 
|---|
|  | 263 | catch (...) { | 
|---|
|  | 264 | cerr << " te/catched unknown (...) exception " << endl; | 
|---|
|  | 265 | } | 
|---|
|  | 266 |  | 
|---|
|  | 267 | cout << "\n --------------------------------------------------------" << endl; | 
|---|
|  | 268 | PrtTim("--- End of te ---"); | 
|---|
|  | 269 | cout << " ----  END of te/TemplateExpression programme ------ " << endl; | 
|---|
|  | 270 | return 0; | 
|---|
|  | 271 | } | 
|---|
|  | 272 |  | 
|---|