File: ormtst.c

package info (click to toggle)
atlas 3.10.3-10
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 38,308 kB
  • sloc: ansic: 486,789; fortran: 66,209; asm: 7,267; makefile: 1,466; sh: 604
file content (1381 lines) | stat: -rw-r--r-- 37,553 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
/*
 *             Automatically Tuned Linear Algebra Software v3.10.3
 * Copyright (C) 2009 Siju Samuel
 *
 * Code contributers : Siju Samuel, Anthony M. Castaldo, R. Clint Whaley
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *   1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *   2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions, and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *   3. The name of the ATLAS group or the names of its contributers may
 *      not be used to endorse or promote products derived from this
 *      software without specific written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE ATLAS GROUP OR ITS CONTRIBUTORS
 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 *
 */


/*
 *  This program is a tester for ORM routines.
 *  Logic:
 *       a) Based on the Input dimensions m and n, create a matrix A and perform
 *          QR(LQ,RQ,QL) factorization.
 *       b) Create the input matrix C for ORM routines
 *       c) Identify input dimension for call to ORM routines based on SIDE, TRANS
 *          and factorization variant.
 *       d) Call LAPACK Fortran version of ORM routine   with modified A & C
 *       d) Call ATLAS C version of ORM routine   with modified A & C
 *       e) Compare the results
 */

/************************   Some Sample Input :***********************
QR
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 R  -U 1 u -# 1   -x L -y N  -z 100
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 R  -U 1 u -# 1   -x L -y T  -z 100
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 R  -U 1 u -# 1   -x R -y N  -z 100
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 R  -U 1 u -# 1   -x R -y T  -z 100
RQ
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 L  -U 1 u -# 1   -x L -y N  -z 100

QL
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 R  -U 1 l -# 1   -x L -y N  -z 100

LQ
./xsormtst_pt  -m 1 800   -n 1 128 -a 200 -S 1 L  -U 1 l -# 1   -x L -y T  -z 100
 ***********************************************************************/


#include "atlas_misc.h"
#include "atlas_lapack.h"
#include "cblas.h"
#include "atlas_cblastypealias.h"
#include "atlas_tst.h"
#ifndef TimeF77
   #include "clapack.h"
#endif
//#define ormCtime 1
#define ormFtime 1

#ifdef ATL_FULL_LAPACK
   #include "atlas_C2Flapack.h"
   #ifdef TREAL
      #define LA_LQ2Q Mjoin(Mjoin(ATL_C2F,PRE),ormlq)
   #else
      #define LA_LQ2Q Mjoin(Mjoin(ATL_C2F,PRE),unmlq)
   #endif
   #ifdef TREAL
      #define LA_RQ2Q Mjoin(Mjoin(ATL_C2F,PRE),ormrq)
   #else
      #define LA_RQ2Q Mjoin(Mjoin(ATL_C2F,PRE),unmrq)
   #endif
   #ifdef TREAL
      #define LA_QL2Q Mjoin(Mjoin(ATL_C2F,PRE),ormql)
   #else
      #define LA_QL2Q Mjoin(Mjoin(ATL_C2F,PRE),unmql)
   #endif
   #ifdef TREAL
      #define LA_QR2Q Mjoin(Mjoin(ATL_C2F,PRE),ormqr)
   #else
      #define LA_QR2Q Mjoin(Mjoin(ATL_C2F,PRE),unmqr)
   #endif
#endif

#ifdef GCCWIN
   ___main(){} __main(){} MAIN__(){} _MAIN_(){}
#endif
#define PRINT_1    0
#define PRINT_2    1

#ifdef TREAL
   static const TYPE ONE = ATL_rone;
   static const TYPE ZEROVAL = ATL_rzero;
   #define MY_TRANS CblasTrans
#else
   static const TYPE ONE[2] = {ATL_rone, ATL_rzero};
   static const TYPE ZEROVAL[2] = {ATL_rzero, ATL_rzero};
   #define MY_TRANS CblasConjTrans
#endif



#ifdef TimeF77
   #define test_gelqf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,f77gelqf) \
         (Major_, M_, N_, A_, lda_, tau_, wrk_, lw_))
#elif defined(TimeC)
   #define test_gelqf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
   { \
      if ((lw_) != -1) \
      { \
         ATL_assert(!Mjoin(Mjoin(clapack_,PRE),gelqf) \
            (CblasColMajor, M_, N_, A_, lda_, tau_)) \
      } \
      else (wrk_)[0] = 0; \
   }
#else
   #define test_gelqf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,gelqf) \
         (M_, N_, A_, lda_, tau_, wrk_, lw_))
#endif
#ifdef TimeF77
   #define test_gerqf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,f77gerqf) \
         (Major_, M_, N_, A_, lda_, tau_, wrk_, lw_))
#elif defined(TimeC)
   #define test_gerqf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
   { \
      if ((lw_) != -1) \
      { \
         ATL_assert(!Mjoin(Mjoin(clapack_,PRE),gerqf) \
            (CblasColMajor, M_, N_, A_, lda_, tau_)) \
      } \
      else (wrk_)[0] = 0; \
   }
#else
   #define test_gerqf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,gerqf) \
         (M_, N_, A_, lda_, tau_, wrk_, lw_))
#endif
#ifdef TimeF77
   #define test_geqlf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,f77geqlf) \
         (Major_, M_, N_, A_, lda_, tau_, wrk_, lw_))
#elif defined(TimeC)
   #define test_geqlf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
   { \
      if ((lw_) != -1) \
      { \
         ATL_assert(!Mjoin(Mjoin(clapack_,PRE),geqlf) \
            (CblasColMajor, M_, N_, A_, lda_, tau_)) \
      } \
      else (wrk_)[0] = 0; \
   }
#else
   #define test_geqlf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,geqlf) \
         (M_, N_, A_, lda_, tau_, wrk_, lw_))
#endif
#ifdef TimeF77
   #define test_geqrf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,f77geqrf) \
         (Major_, M_, N_, A_, lda_, tau_, wrk_, lw_))
#elif defined(TimeC)
   #define test_geqrf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
   { \
      if ((lw_) != -1) \
      { \
         ATL_assert(!Mjoin(Mjoin(clapack_,PRE),geqrf) \
            (CblasColMajor, M_, N_, A_, lda_, tau_)) \
      } \
      else (wrk_)[0] = 0; \
   }
#else
   #define test_geqrf(Major_, M_, N_, A_, lda_, tau_, wrk_, lw_) \
      ATL_assert(!Mjoin(PATL,geqrf) \
         (M_, N_, A_, lda_, tau_, wrk_, lw_))
#endif


/*
 * Print a Matrix
 */
void printMatrix(char *msg, TYPE *A, int M, int N, int lda)
{
   if(PRINT_1)
      Mjoin(PATL,geprint)(msg, M, N, A, lda);
}

/*
 * Print a Vector
 */
void printVector( char * msg, TYPE *X, int N)
{
   if(PRINT_1)
      Mjoin(PATL,geprint)(msg, N, 1, X, N);
}


int AllocationErr( char * msg)
{
   printf("Error while allocating %s\n", msg);
   exit(-1);
}

/*
 * Returns a duplicate of the A matrix, with new leading dimension
 * lda   : leading dimension of A
 * ldc   : leading dimension of Duplicate Matrix
 */
static TYPE *DupMat(enum ATLAS_ORDER Order, int M, int N, TYPE *A, int lda,
                     int ldc)
{
   int i, j, M2;
   const int ldc2 = (ldc SHIFT), lda2 = (lda SHIFT);
   TYPE *C;
   if (Order == CblasRowMajor)
   {
      i = M;
      M = N;
      N = i;
   }
   M2 = M SHIFT;
   ATL_assert(ldc >= M);
   C = malloc(ATL_MulBySize(ldc)*N);
   ATL_assert(C);
   for (j=0; j != N; j++)
   {
      for (i=0; i != M2; i++) C[i] = A[i];
      C += ldc2;
      A += lda2;
   }
   return(C-N*ldc2);
}


/*
 * Allocate a space for ldmxN for 'real'.
 * For Complex allocate space for (2*ldm)xN.
 * It also takes care of the precision.
 * Then generate matrix for MxN, real/complex values based on the precision.
 */
TYPE *GetGE(int M, int N, int lda)
{
   TYPE *A;
   A = malloc(ATL_MulBySize(lda)*N);
   if (A) Mjoin(PATL,gegen)(M, N, A, lda, M*N+lda);
   return(A);
}


static TYPE ORlqtest(int M, int N, int lda, int flushKB, double *time, char Cside, char Ctrans, int CsideSz)
{

   TYPE *A, *TAU,  *WORK, *WORKC ;
   TYPE *C, *CF;

   TYPE *AORIG ;
   TYPE  dtmp, dtmp1;
   double t0;

   int LWORK, LWORKC;
   TYPE normC, eps, resid;

   int  ldm, ldmn, ldn, cM, cN, ldc ;

   enum CBLAS_SIDE SIDE; enum CBLAS_TRANSPOSE TRANS ;

   ldm = M;
   ldn = N;
   const int MNmin = Mmin(M,N);
   ldmn = MNmin;

/* Epsilon */
   eps = Mjoin(PATL,epsilon)();

/* Allocate A and initialize */
   A = GetGE(M, N, lda);
   if (A == NULL) AllocationErr("A");

/* Allocate C  and CF  as the matrix to be multiplied with A                  */
/* and will get the same matrix                                               */
/* Note that ALWAYS Q will have size M since we are caling  ATL_ormqrf        */

   if( Cside == 'L')
   {
      if(Ctrans  ==  'N')
      {
         cM = N;
         cN = CsideSz;
         ldc = ldn;
         SIDE = CblasLeft;
         TRANS = CblasNoTrans;
      }
      else
      {
         cM = N;
         cN = CsideSz;
         ldc = ldn;
         SIDE = CblasLeft;
         #ifdef TREAL
            TRANS = CblasTrans;
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
   else
   {
      if(Ctrans  ==  'N')
      {
         cM = CsideSz;
         cN = N;
         ldc = CsideSz;
         SIDE = CblasRight;
         TRANS = CblasNoTrans;
      }
      else
      {
         cM = CsideSz;
         cN = N;
         ldc = CsideSz;
         SIDE = CblasRight;
         #ifdef TREAL
            TRANS = CblasTrans;
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
/* Allocate C and CF  for ormqr inp - will get modified */
   C  =  GetGE(cM,cN, ldc);                 /* Q will have side M             */
   CF =  GetGE(cM,cN, ldc);       /* Both C an CF are having the same values  */

/* Allocate A Original and copy from A */
   AORIG = DupMat(CblasColMajor, M, N, A, lda, lda);

/* Call to get the  size of workspace required */
   test_gelqf(CblasColMajor, M, N, &dtmp1, lda, &dtmp1, &dtmp, -1);

   LWORK = dtmp;

   WORK = malloc(ATL_MulBySize(LWORK));
   if (WORK == NULL) return(-1);

   TAU = malloc(ATL_MulBySize(MNmin));
   if (TAU == NULL) AllocationErr("TAU");

   if (flushKB)
   {
      t0 = ATL_flushcache(flushKB*1024);
      t0 += ATL_flushcache(-1);
   }
   t0 = time00();

   test_gelqf(CblasColMajor, M, N, (TYPE*)(A), lda, (TYPE*)(TAU),
              (TYPE*)(WORK), LWORK);

   *time = time00() - t0;
   if (flushKB)
      t0 += ATL_flushcache(0);


   printMatrix("AORIG", AORIG, M, N, lda);
   printMatrix("A", A, M, N, lda);
   printVector("TAU", TAU, MNmin);


//   LWORKC = 1000000;            // TODO : Temporary Code  Modify  later
   LWORKC = Mjoin(PATL,ormlq)(SIDE, TRANS, cM, cN, MNmin, &dtmp1, lda, TAU, &dtmp1, ldc,
                     &dtmp,  -1);
   LWORKC = dtmp;
   WORKC = malloc(ATL_MulBySize(LWORKC));


   ATL_assert(!LA_LQ2Q(SIDE, TRANS, cM, cN, MNmin, A, lda, TAU,
                       CF, ldc));

   Mjoin(PATL,ormlq)(SIDE, TRANS, cM, cN, MNmin, A, lda, TAU, C, ldc,
                     WORKC,  LWORKC);


   normC = Mjoin(PATL,genrm1)(cM, cN, C, ldc);
   resid  = Mjoin(PATL,gediffnrm1)(cM, cN, C, ldc, CF, ldc);

   resid /= (normC * eps * Mmin(cM, cN));

   return(resid);
}

static TYPE ORqltest(int M, int N, int lda, int flushKB, double *time, char Cside, char Ctrans, int CsideSz)
{
   TYPE *A, *TAU,  *WORK, *WORKC ;
   TYPE *C, *CF;

   TYPE *AORIG ;
   TYPE  dtmp, dtmp1;
   double t0;


   int LWORK, LWORKC;
   TYPE normC, eps, resid;
   int  ldm, ldmn, ldn, cM, cN, ldc ;
   const int lda2 = (lda SHIFT);

   enum CBLAS_SIDE SIDE; enum CBLAS_TRANSPOSE TRANS ;


   ldm = M;
   ldn = N;
   const int MNmin = Mmin(M,N);
   ldmn = MNmin;

   eps = Mjoin(PATL,epsilon)();

/* Allocate A and initialize */
   A = GetGE(M, N, lda);
   if (A == NULL) AllocationErr("A");

/* Allocate C  and CF  as the matrix to be multiplied with A
 * and will get the same matrix
 * Note that ALWAYS Q will have size M since we are caling  ATL_ormqrf
 */

   if( Cside == 'L')
   {
      if(Ctrans  ==  'N')
      {
         cM = M;
         cN = CsideSz;
         ldc = ldm;
         SIDE = CblasLeft;
         TRANS = CblasNoTrans;
      }
      else
      {
         cM = M;
         cN = CsideSz;
         ldc = ldm;
         SIDE = CblasLeft;
         #ifdef TREAL
            TRANS = CblasTrans;                 //or MY_TRAN?
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
   else
   {
      if(Ctrans  ==  'N')
      {
         cM = CsideSz;
         cN = M;
         ldc = CsideSz;
         SIDE = CblasRight;
         TRANS = CblasNoTrans;                 //or MY_TRAN?
      }
      else
      {
         cM = CsideSz;
         cN = M;
         ldc = CsideSz;
         SIDE = CblasRight;
         #ifdef TREAL
            TRANS = CblasTrans;                 //or MY_TRAN?
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
/* Allocate C and CF  for ormqr inp - will get modified */
   C  =  GetGE(cM,cN, ldc);                 /* Q will have side M             */
   CF =  GetGE(cM,cN, ldc);       /* Both C an CF are having the same values  */

/* Allocate A Original and copy from A */
   AORIG = DupMat(CblasColMajor, M, N, A, lda, lda);

/* Call to get the  size of workspace required */
   test_geqlf(CblasColMajor, M, N, &dtmp1, lda,
               &dtmp1,
               &dtmp, -1);

   LWORK = dtmp;

/* Get Work and LWORK   */
   WORK = malloc(ATL_MulBySize(LWORK));
   if (WORK == NULL) return(-1);

   TAU = malloc(ATL_MulBySize(MNmin));
   if (TAU == NULL) AllocationErr("TAU");

   if (flushKB)
   {
      t0 = ATL_flushcache(flushKB*1024);
      t0 += ATL_flushcache(-1);
   }
   t0 = time00();
   test_geqlf(CblasColMajor, M, N, (TYPE*)(A), lda,
               (TYPE*)(TAU),
               (TYPE*)(WORK), LWORK);
   *time = time00() - t0;
   if (flushKB)
      t0 += ATL_flushcache(0);

   printMatrix("AORIG", AORIG, M, N, lda);
   printMatrix("A", A, M, N, lda);
   printVector("TAU", TAU, MNmin);


//   LWORKC = 1000000;
   LWORKC = Mjoin(PATL,ormql)(SIDE, TRANS, cM, cN, MNmin, &dtmp1, lda, TAU, &dtmp1, ldc,
                     &dtmp,  -1);
   LWORKC = dtmp;

   WORKC = malloc(ATL_MulBySize(LWORKC));

   ATL_assert(!LA_QL2Q(SIDE, TRANS, cM, cN, MNmin, A+(N-MNmin)*lda2, lda, TAU,
                                 CF, ldc));

   ATL_ormql(SIDE, TRANS, cM, cN, MNmin, A+(N-MNmin)*lda2, lda,
                                 TAU, C, ldc, WORKC,  LWORKC);

   normC = Mjoin(PATL,genrm1)(cM, cN, C, ldc);
   resid  = Mjoin(PATL,gediffnrm1)(cM, cN, C, ldc, CF, ldc);

   resid /= (normC * eps * Mmin(cM, cN));
   return(resid);
}


/*
 * Calls gerq ( single, double, single complex and double complex ).
 * From A[MxN] Matrix returned from geqr routines, compute Q and R matrix.
 * Find the residual for ( A_original - RQ  ) operation.
 *
 *   Also, make H(k) = i-tau*vv'
 *   and compute Q = H(1)*H(2)...H(k)  where k = Min(M,N)
 *
 *   VI has size of N
 *
 */
static TYPE ORrqtest(int M, int N, int lda, int flushKB, double *time, char Cside, char Ctrans, int CsideSz )
{
   TYPE *A, *TAU,  *WORK, *WORKC ;
   TYPE *C, *CF;

   TYPE *AORIG ;
   TYPE  dtmp, dtmp1;
   double t0;


   int LWORK, LWORKC;
   TYPE normC, eps, resid;
   int  ldm, ldmn, ldn, cM, cN, ldc ;

   enum CBLAS_SIDE SIDE; enum CBLAS_TRANSPOSE TRANS ;


   ldm = M;
   ldn = N;
   const int MNmin = Mmin(M,N);
   ldmn = MNmin;

   eps = Mjoin(PATL,epsilon)();

/* Allocate A and initialize */
   A = GetGE(M, N, lda);
   if (A == NULL) AllocationErr("A");

/* Allocate C  and CF  as the matrix to be multiplied with A
 * and will get the same matrix
 * Note that ALWAYS Q will have size M since we are caling  ATL_ormqrf
 *
 * fprintf(stderr, " inside rqtest  \n");
 * fprintf(stderr, " CSide %c  Ctrans %c \n", Cside, Ctrans);
 */

   if( Cside == 'L')
   {
      if(Ctrans  ==  'N')
      {
         cM = N;
         cN = CsideSz;
         ldc = ldn;
         SIDE = CblasLeft;
         TRANS = CblasNoTrans;
      }
      else
      {
         cM = N;
         cN = CsideSz;
         ldc = ldn;
         SIDE = CblasLeft;
         #ifdef TREAL
            TRANS = CblasTrans;                 //or MY_TRAN?
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
   else
   {
      if(Ctrans  ==  'N')
      {
         cM = CsideSz;
         cN = N;
         ldc = CsideSz;
         SIDE = CblasRight;
         TRANS = CblasNoTrans;                 //or MY_TRAN?
      }
      else
      {
         cM = CsideSz;
         cN = N;
         ldc = CsideSz;
         SIDE = CblasRight;
         #ifdef TREAL
            TRANS = CblasTrans;                 //or MY_TRAN?
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
/* Allocate C and CF  for ormqr inp - will get modified */
   C  =  GetGE(cM,cN, ldc);                 /* Q will have side M             */
   CF =  GetGE(cM,cN, ldc);       /* Both C an CF are having the same values  */

/* Allocate A Original and copy from A */
   AORIG = DupMat(CblasColMajor, M, N, A, lda, lda);

/* Call to get the  size of workspace required */
   test_gerqf(CblasColMajor, M, N, &dtmp1, lda,
               &dtmp1,
               &dtmp, -1);

   LWORK = dtmp;

/* Get Work and LWORK */
   WORK = malloc(ATL_MulBySize(LWORK));
   if (WORK == NULL) return(-1);

   TAU = malloc(ATL_MulBySize(MNmin));
   if (TAU == NULL) AllocationErr("TAU");

   if (flushKB)
   {
      t0 = ATL_flushcache(flushKB*1024);
      t0 += ATL_flushcache(-1);
   }
   t0 = time00();

   test_gerqf(CblasColMajor, M, N, (TYPE*)(A), lda,
               (TYPE*)(TAU),
               (TYPE*)(WORK), LWORK);

   *time = time00() - t0;
   if (flushKB)
      t0 += ATL_flushcache(0);


   printMatrix("AORIG", AORIG, M, N, lda);
   printMatrix("A", A, M, N, lda);
   printVector("TAU", TAU, MNmin);


//   LWORKC = 10000000;            // TODO : Temporary Code  Modify  later
   LWORKC = Mjoin(PATL,ormrq)(SIDE, TRANS, cM, cN, MNmin, &dtmp1, lda, TAU, &dtmp1, ldc,
                     &dtmp,  -1);
   LWORKC = dtmp;
   WORKC = malloc(ATL_MulBySize(LWORKC));

   ATL_assert(!LA_RQ2Q(SIDE, TRANS, cM, cN, MNmin,
                       A+((M-MNmin)SHIFT), lda, TAU, CF, ldc));

   Mjoin(PATL,ormrq)(SIDE, TRANS,
                     cM, cN, MNmin, A+((M-MNmin) SHIFT) , lda, TAU, C, ldc,
                     WORKC,  LWORKC);

   normC = Mjoin(PATL,genrm1)(cM, cN, C, ldc);
   resid  = Mjoin(PATL,gediffnrm1)(cM, cN, C, ldc, CF, ldc);

   resid /= (normC * eps * Mmin(cM, cN));   /* Scale                          */

   return(resid);
}


/*
 * Calls geqr ( single, double, single complex and double complex ).
 * From A[MxN] Matrix returned from geqr routines, compute Q and R matrix.
 * Find the residual for ( A_original - QR  ) operation.
 *
 *   Also, make H(k) = i-tau*vv'
 *   and compute Q = H(1)*H(2)...H(k)  where k = Min(M,N)
 *    Cside is the column
 */
TYPE ORqrtest(int M, int N, int lda, int flushKB, double *time, char Cside, char Ctrans, int CsideSz )
{
   TYPE *A, *TAU,  *WORK, *WORKC ;
   TYPE *C, *CF;

   TYPE *AORIG ;
   TYPE  dtmp, dtmp1;
   double t0;


   int LWORK, LWORKC;
   TYPE normC, eps, resid;
   int  ldm, ldmn, ldn, cM, cN, ldc ;

   enum CBLAS_SIDE SIDE; enum CBLAS_TRANSPOSE TRANS ;

   ldm = M;
   ldn = N;
   const int MNmin = Mmin(M,N);
   ldmn = MNmin;

/* Epsilon                                                                    */
   eps = Mjoin(PATL,epsilon)();

/* Allocate A and initialize                                                  */
   A = GetGE(M, N, lda);
   if (A == NULL) AllocationErr("A");
/*
 * Allocate C  and CF  as the matrix to be multiplied with A
 * and will get the same matrix
 * Note that ALWAYS Q will have size M since we are caling  ATL_ormqrf
 */

   if( Cside == 'L')
   {
      if(Ctrans  ==  'N')
      {
         cM = M;
         cN = CsideSz;
         ldc = ldm;
         SIDE = CblasLeft;
         TRANS = CblasNoTrans;
      }
      else
      {
         cM = M;
         cN = CsideSz;
         ldc = ldm;
         SIDE = CblasLeft;
         #ifdef TREAL
            TRANS = CblasTrans;                 //or MY_TRAN?
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
   else
   {
      if(Ctrans  ==  'N')
      {
         cM = CsideSz;
         cN = M;
         ldc = CsideSz;
         SIDE = CblasRight;
         TRANS = CblasNoTrans;                 //or MY_TRAN?
      }
      else
      {
         cM = CsideSz;
         cN = M;
         ldc = CsideSz;
         SIDE = CblasRight;
         #ifdef TREAL
            TRANS = CblasTrans;                 //or MY_TRAN?
         #else
            TRANS = CblasConjTrans;
         #endif
      }
   }
/* Allocate C and CF  for ormqr inp - will get modified */
   C  =  GetGE(cM,cN, ldc);                 /* Q will have side M             */
   CF =  GetGE(cM,cN, ldc);       /* Both C an CF are having the same values  */

/* Allocate A Original and copy from A */
   AORIG = DupMat(CblasColMajor, M, N, A, lda, lda);

/* Call to get the  size of workspace required */
   test_geqrf(CblasColMajor, M, N, &dtmp1, lda,
               &dtmp1,
               &dtmp, -1);

   LWORK = dtmp;

   WORK = malloc(ATL_MulBySize(LWORK));
   if (WORK == NULL) return(-1);

   TAU = malloc(ATL_MulBySize(MNmin));
   if (TAU == NULL) AllocationErr("TAU");

   if (flushKB)
   {
      t0 = ATL_flushcache(flushKB*1024);
      t0 += ATL_flushcache(-1);
   }
   t0 = time00();
   test_geqrf(CblasColMajor, M, N, (TYPE*)(A), lda,
               (TYPE*)(TAU),
               (TYPE*)(WORK), LWORK);
   *time = time00() - t0;
   if (flushKB)
      t0 += ATL_flushcache(0);


   printMatrix("AORIG", AORIG, M, N, lda);
   printMatrix("A", A, M, N, lda);
   printVector("TAU", TAU, MNmin);

//   LWORKC = 100000;            // TODO : Temporary Code  Modify  later
   LWORKC = Mjoin(PATL,ormqr)(SIDE, TRANS, cM, cN, MNmin, &dtmp1, lda, TAU, &dtmp1, ldc,
                     &dtmp,  -1);
   LWORKC = dtmp;
   WORKC = malloc(ATL_MulBySize(LWORKC));

   if(PRINT_2) printf("Input to ORM routine cM=%d cN=%d K=%d\n",
                                     cM, cN, MNmin);
   #ifdef ormFtime
   t0 = time00();
   #endif
   ATL_assert(!LA_QR2Q(SIDE, TRANS, cM, cN, MNmin, A, lda, TAU,
                                 CF, ldc));
   #ifdef ormFtime
   *time = time00() - t0;
   #endif

   #ifdef ormCtime
   t0 = time00();
   #endif
   ATL_ormqr(SIDE, TRANS, cM, cN, MNmin, A, lda,
                                 TAU, C, ldc, WORKC,  LWORKC);
   #ifdef ormCtime
   *time = time00() - t0;
   #endif

   normC = Mjoin(PATL,genrm1)(cM, cN, C, ldc);
   resid  = Mjoin(PATL,gediffnrm1)(cM, cN, C, ldc, CF, ldc);

   resid /= (normC * eps * Mmin(cM, cN));

/* free */
   if (A)   free(A);
   if (C)   free(C);
   if (CF) free(CF);
   if (WORK)  free(WORK);
   if (WORKC)  free(WORKC);
   if (AORIG)  free(AORIG);

   return(resid);
}


int GetMyReps(int N, int *nreps)
/*
 * Finds the correct nreps for this N
 */
{
   int n, i;

   n = *nreps++;
   for (i=n+n-2; i>=0; i -= 2)
   {
      if (N >= nreps[i])
         return(nreps[i+1]);
   }
   return(nreps[1]);
}

int RunCase(TYPE thresh, int flushKB, int side, int uplo, int M, int N, int lda, char Cside, char Ctrans, int CsideSz)
/*
 * RETURNS: 0 if residual is <= thresh, otherwise 1
 */
{
   TYPE resid;
   TYPE (*qtest)(int, int, int, int, double*, char, char, int);
   double time;
   double Time2FlopsNew(int rout, int UPLO, int M, int N, double time, char  QSIDE, int CsideSize);
   char qs[4];

   qs[2] = '\0';
   if (side == LARight)
   {
      qs[0] = 'Q';
      if (uplo == LALower) { qtest = ORqltest; qs[1] = 'L'; }
      else { qtest = ORqrtest; qs[1] = 'R'; }
   }
   else
   {
      qs[1] = 'Q';
      if (uplo == LALower) { qtest = ORlqtest; qs[0] = 'L'; }
      else { qtest = ORrqtest; qs[0] = 'R'; }
   }
   resid = qtest(M, N, lda, flushKB, &time, Cside, Ctrans, CsideSz);
   printf("%2s  %3s %6d %6d %6d  %10.4e %11.2f  %9.2e\n", qs, "Col", M, N, lda,
          time, Time2FlopsNew(LAgeqrf, uplo+side, M, N, time, Cside, CsideSz), resid);
   return(resid <= thresh ? 1 : 0);
}

int RunCases(TYPE thresh, int flushKB, int ldagap, int *NREPS,
              int *sides, int *uplos, int *Ms, int *Ns,
              char Cside, char Ctrans, int CsideSz)
/*
 * RETURNS: number of failed cases
 */
{
   int u, s, o, m, n, M, lda, npass=0, ntest=0, nreps, k;
   printf("Rt  Maj      M      N    lda        TIME       MFLOP   RESIDUAL\n");
   printf("==  ===  =====  =====  =====  ==========  ==========  =========\n");

   for (s=1; s <= sides[0]; s++)            /* loop over sides                */
   {
      for (u=1; u <= uplos[0]; u++)         /* loop over uplos                */
      {
         for (o=0; o < 1; o++)              /* useless order loop, add later  */
         {
            for (n=1; n <= Ns[0]; n++)
            {
               for (m=1; m <= Ms[0]; m++)
               {
                  M = (Ms[m]) ? Ms[m]:Ns[n];
                  nreps = GetMyReps(Mmin(M, Ns[n]), NREPS);
                  for (k=0; k < nreps; k++)
                  {

                     npass += RunCase(thresh, flushKB, sides[s], uplos[u],

//orig QR -QL
//                                      M, Ns[n], M+ldagap,  'L', 'N', 100);
//                                      M, Ns[n], M+ldagap,  'L', 'T', 100);
//orig RQ -LQ
//                                      M, Ns[n], M+ldagap,  'R', 'N', 100);
//                                      M, Ns[n], M+ldagap,  'R', 'T', 100);
                                      M, Ns[n], M+ldagap,  Cside, Ctrans, CsideSz);

                     ntest++;
                  }
               }
            }
         }
      }
   }
   printf("\n%d cases ran, %d cases passed\n\n", ntest, npass);
   return(ntest-npass);
}

#define CAN_NB 0
void PrintUsage(char *name, int ierr, char *flag)
{
   if (ierr > 0)
      fprintf(stderr, "Bad argument #%d: '%s'\n",
         ierr, flag ? flag : "Not enough arguments");
   else if (ierr < 0)
      fprintf(stderr, "ERROR: %s\n", flag);

   fprintf(stderr, "USAGE: %s [flags]:\n", name);
   fprintf(stderr, "      routs: geqrf, geqlf, gerqf, gelqf\n");
   fprintf(stderr, "   -T <thresh> : set residual error threshold\n");
   fprintf(stderr, "   -# <#> : repeat each timing # times\n");
   fprintf(stderr, "   -n <#> <N1> ... <N#>\n");
   fprintf(stderr, "   -N <Nstart> <Nend> <Ninc>\n");
   fprintf(stderr, "   -m <#> <M1> ... <M#>\n");
   fprintf(stderr, "   -M <Mstart> <Mend> <Minc>\n");
   fprintf(stderr, "   -a <ldagap> : lda = M + <ldagap> foreach M\n");
   fprintf(stderr, "   -f <flushKB> : flush at least this mem in LRU timers\n");
   fprintf(stderr, "   -S <#> <side1> ... <side#>\n");
   fprintf(stderr, "   -U <nuplo> <up1> ... <upN> : Vals: [u,l,q,g]\n");
   exit(ierr ? ierr : -1);
}

int *GetIntList1(int ival)
/*
 * returns integer array with iarr[0] = 1, iarr[1] = ival
 */
{
   int *iarr;
   iarr = malloc(2*sizeof(int));
   ATL_assert(iarr);
   iarr[0] = 1;
   iarr[1] = ival;
   return(iarr);
}

int *GetIntList2(int ival1, int ival2)
/*
 * returns integer array with iarr[0] = 1, iarr[1] = ival1, ival[2] = ival2
 */
{
   int *iarr;
   iarr = malloc(3*sizeof(int));
   ATL_assert(iarr);
   iarr[0] = 1;
   iarr[1] = ival1;
   iarr[2] = ival2;
   return(iarr);
}

int *GetIntList(int nargs, char **args, int i, int nmul)
/*
 * Gets a list of integers, whose length is given by atoi(args[i])*nmul
 * list is this length+1, since 0'th location gets atoi(args[i])
 */
{
   int n, *iarr, k;

   if (++i >= nargs)
      PrintUsage(args[0], i, NULL);
   n = atoi(args[i]) * nmul;
   ATL_assert(n > 0);
   iarr = malloc(sizeof(int)*(n+1));
   ATL_assert(iarr);

   iarr[0] = n / nmul;
   for (k=0; k < n; k++)
   {
      if (++i >= nargs)
         PrintUsage(args[0], i, NULL);
      iarr[k+1] = atoi(args[i]);
   }
   return(iarr);
}

int *RoutNames2IntList(int nargs, char **args, int i)
{
   int n, *iarr, k;

   if (++i >= nargs)
      PrintUsage(args[0], i, NULL);
   n = atoi(args[i]);
   ATL_assert(n > 0);
   iarr = malloc(sizeof(int)*(n+1));
   ATL_assert(iarr);

   iarr[0] = n;
   for (k=0; k < n; k++)
   {
      if (++i >= nargs)
         PrintUsage(args[0], i, NULL);
      if (!strcmp(args[i], "getrf") || !strcmp(args[i], "GETRF"))
         iarr[k+1] = LAgetrf;
      else if (!strcmp(args[i], "potrf") || !strcmp(args[i], "POTRF"))
         iarr[k+1] = LApotrf;
      else if (!strcmp(args[i], "geqrf") || !strcmp(args[i], "GEQRF"))
         iarr[k+1] = LAgeqrf;
      else if (!strcmp(args[i], "geqlf") || !strcmp(args[i], "GEQLF"))
         iarr[k+1] = LAgeqrf;
      else if (!strcmp(args[i], "gerqf") || !strcmp(args[i], "GERQF"))
         iarr[k+1] = LAgeqrf;
      else if (!strcmp(args[i], "gelqf") || !strcmp(args[i], "GELQF"))
         iarr[k+1] = LAgeqrf;
      else
         PrintUsage(args[0], i, args[i]);
   }
   return(iarr);
}

int *IntRange2IntList(int N0, int NN, int incN)
{
   int i, n;
   int *iarr;

   for (i=N0, n=0; i <= NN; i += incN) n++;
   iarr = malloc(sizeof(int)*(n+1));
   ATL_assert(iarr);
   iarr[0] = n;
   for (i=N0, n=1 ; i <= NN; i += incN, n++)
      iarr[n] = i;
   return(iarr);
}

void GetFlags(int nargs, char **args, int *flsizeKB, TYPE *thresh,
              int **nreps, int *ldagap, int **Ms, int **Ns,
              int **UPLOs, int **SDs,
              char  *cside,
              char *ctrans,
              int *csideSz)
{
   int *NBs=NULL, *ns=NULL, *ms=NULL, *ups=NULL, *sds=NULL, *ip;
   int i, k, n;

   *ldagap = 0;
   *flsizeKB = L2SIZE/1024;
   *nreps = NULL;
    *thresh = 100.0;
   /* Temporary Setting For ormm Matrix  C */
   *cside  = 'L';
   *ctrans = 'N';
   *csideSz = 100;
   for (i=1; i < nargs; i++)
   {
      if (args[i][0] != '-')
         PrintUsage(args[0], i, args[i]);
      switch(args[i][1])
      {
      case 'T':
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         *thresh = atof(args[i]);
         break;
      case 'n':                             /* -n or -nb                      */
         ns = GetIntList(nargs, args, i, 1);
         i += ns[0] + 1;
         break;
      case 'm':                             /* -m # <M1> ... <M#>             */
         ms = GetIntList(nargs, args, i, 1);
         i += ms[0] + 1;
         break;
      case 'N':                             /* -N or -NB                      */
      case 'M':                   /* -M <Mstart> <Mend> <Minc>\n");           */
         if (i+3 >= nargs)
            PrintUsage(args[0], i, NULL);
         ip = IntRange2IntList(atoi(args[i+1]),atoi(args[i+2]),atoi(args[i+3]));
         if (args[i][0] == 'M')
            ms = ip;
         else if (args[i][2] == 'B')        /* -NB <NBstart> <NBend> <NBinc>  */
            NBs = ip;
         else                     /* -N <Nstart> <Nend> <Ninc>\n");           */
            ns = ip;
         i += 3;
         break;
      case '#':                             /* set nreps                      */
         if (args[i][2] == 't')             /* -#t N1 reps1 ... Nt repst      */
         {
            *nreps = GetIntList(nargs, args, i, 2);
            i += ((*nreps)[0] << 1) + 1;
         }
         else                               /* -# <reps>                      */
         {
            if (++i >= nargs)
               PrintUsage(args[0], i, NULL);
            *nreps = GetIntList2(0, atoi(args[i]));
         }
         break;
      case 'f':                             /* -f <flushKB>                   */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         *flsizeKB = atoi(args[i]);
         break;
      case 'U':                   /* -U <nup> <u1> ... <uN>;[u,l,q,g]         */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         n = atoi(args[i]);
         ATL_assert(n > 0);
         ups = malloc(sizeof(int)*(n+1));
         ups[0] = n;
         for (k=0; k < n; k++)
         {
            if (++i >= nargs)
               PrintUsage(args[0], i, NULL);
            switch(args[i][0])
            {
            case 'U':
            case 'u':
               ups[k+1] = LAUpper;
               break;
            case 'l':
            case 'L':
            default:
               ups[k+1] = LALower;
               break;
            }
         }
         break;
      case 'S':                             /* -S <#> <side1> ... <sideN>     */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         n = atoi(args[i]);
         ATL_assert(n > 0);
         sds = malloc(sizeof(int)*(n+1));
         sds[0] = n;
         for (k=0; k < n; k++)
         {
            if (++i >= nargs)
               PrintUsage(args[0], i, NULL);
            switch(args[i][0])
            {
            case 'L':
            case 'l':
               sds[k+1] = LALeft;
               break;
            default:
               sds[k+1] = LARight;
               break;
            }
         }
         break;
      case 'a':                             /* -a <ldagap>                    */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         *ldagap = atoi(args[i]);
         break;
      case 'x':                         /* -x L      -x R      side for Q */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         *cside = args[i][0];
         break;
      case 'y':                         /* -y T      -y T      trans  Q */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         *ctrans = args[i][0];
         break;
      case 'z':                         /* -z <size> */
         if (++i >= nargs)
            PrintUsage(args[0], i, NULL);
         *csideSz =  atoi(args[i]);
         break;
      default:
         PrintUsage(args[0], i, args[i]);
      }
   }
/*
 * Take default values
 */
   if (!(*nreps))
      *nreps = GetIntList2(0, 1);
   if (!ns)
      ns = GetIntList1(1000);
   if (!ms)
      ms = GetIntList1(0);
   if (!ups)
      ups = GetIntList1(LAUpper);
   if (!sds)
      sds = GetIntList1(LARight);

   *Ns = ns;
   *Ms = ms;
   *UPLOs = ups;
   *SDs = sds;
}

double GetFlopCount(enum ATL_LAROUT rout, enum ATL_LAFLG flags,
                     int M, int N, int KL, int KU, int nb)
/*
 * These numbers copied from LAPACK timer routines TIMING/[EIG,LIN]/dopla[2].f
 */
{
   double m=(M?M:N), n=N, kl=KL, ku=ku, mn;
   double adds=0.0, muls=0.0;

   if (rout & LAgetrf)
   {
      mn = (m >= n) ? n : m;                /* mn = MIN(M,N)                  */
      adds = mn * ( m*n-(m+n)*(mn+1.0)/2.0 + (mn+1.0)*(2.0*mn+1.0)/6.0 );
      muls = adds + mn * ( m-(mn+1.0)/2.0 );
   }
   else if (rout & LAgeqrf)
   {
      if (flags & LARight)                  /* LAgeqrf || LAgeqlf             */
      {
         if (M >= N)
         {
            muls = n*( ((23.0/6.0)+m+(n/2.0)) + n*(m-(n/3.0)) );
            adds = n*( (5.0/6.0) + n*((1.0/2.0) + (m-(n/3.0))) );
         }
         else
         {
            muls = m*( ((23.0/6.0) + 2.0*n - (m/2.0)) + m*(n-(m/3.0)) );
            adds = m*( (5.0/6.0) + n - (m/2.0) + m*(n-(m/3.0)) );
         }
      }
      else                                  /* LAgerqf || LAgelqf             */
      {
         if (M >= N)
         {
            muls = n*( ((29.0/6.0) + m + n/2.0) + n*(m-n/3.0) );
            adds = n*( (5.0/6.0) + m + n*(-0.5 + (m - n/3.0)) );
         }
         else
         {
            muls = m*( ((29.0/6.0) + 2.0*n - 0.5*m) +m*(n - m/3.0) );
            adds = m*( (5.0/6.0) + 0.5*m + m*(n - m/3.0) );
         }
      }
   }
    else if (rout & LAormqr)
    {
    }
   else if (rout & LApotrf)
   {
      muls = m*( (1.0/3.0) + m*((1.0/2.0) + (m/6.0)) );
      adds = (1.0/6.0)*m*(-1.0+m*m);
   }
   #if defined (SCPLX) || defined(DCPLX)
      return(2.0*adds + 6.0*muls);
   #else
      return(adds+muls);
    #endif
}


double Time2FlopsNew(int rout, int UPLO, int M, int N, double time, char QSIDE, int csideSz )
{
   double mflop;
   int cM, cN;


//ORlqtest
//   if( Cside == 'L')
//   {
//         cM = N;
//         cN = CsideSz;
//   }
//   else
//   {
//         cM = CsideSz;
//         cN = N;
//   }
//
//ORqltest
//   if( Cside == 'L')
//   {
//         cM = M;
//         cN = CsideSz;
//   }
//   else
//   {
//         cM = CsideSz;
//         cN = M;
//   }
//
//ORrqtest
//   if( Cside == 'L')
//   {
//         cM = N;
//         cN = CsideSz;
//   }
//   else
//   {
//         cM = CsideSz;
//         cN = N;
//   }
//
//ORqrtest
//   if( Cside == 'L')
//   {
//         cM = M;
//         cN = CsideSz;
//   }
//   else
//   {
//         cM = CsideSz;
//         cN = M;
//   }
   mflop = GetFlopCount(rout, UPLO, M, N, 0, 0, CAN_NB);
   if (mflop > 0)
      mflop /= time*1e6;          /* translate flops & time to MFLOPS         */
   return(mflop);
}

int main(int nargs, char **args)
{
   int *Ns, *Ms, *nreps, *UPLOs, *SDs;
   int flushKB, ldagap;
   TYPE thresh;

   char cside, ctrans;
   int  csideSz ;
   GetFlags(nargs, args, &flushKB, &thresh, &nreps, &ldagap, &Ms, &Ns,
            &UPLOs, &SDs, &cside, &ctrans, &csideSz);

  printf ("cside   = %c   ctrans = %c  csidesz = %d \n", cside, ctrans, csideSz);
   return(RunCases(thresh, flushKB, ldagap, nreps, SDs, UPLOs, Ms, Ns, cside, ctrans, csideSz));
}