Debian Codegraph @

src/lapack/dec/q/lqut/front/flamec/test/fla/test_LQ_UT.c

raw
1 /*
2
3 Copyright (C) 2014, The University of Texas at Austin
4
5 This file is part of libflame and is available under the 3-Clause
6 BSD license, which can be found in the LICENSE file at the top-level
7 directory, or at http://opensource.org/licenses/BSD-3-Clause
8
9 */
10
11 #include "FLAME.h"
12
13 #define FLA_ALG_REFERENCE 0
14 #define FLA_ALG_FRONT 1
15
16 void time_LQ_UT(
17 int variant, int type, int n_repeats, int m, int n,
18 FLA_Obj A, FLA_Obj A_ref, FLA_Obj t, FLA_Obj T, FLA_Obj W, FLA_Obj b, FLA_Obj b_ref,
19 double *dtime, double *diff, double *gflops );
20
21
22 int main(int argc, char *argv[])
23 {
24 int
25 datatype,
26 m_input, n_input,
27 m, n, min_m_n,
28 p_first, p_last, p_inc,
29 p,
30 variant,
31 n_repeats,
32 i,
33 n_variants = 1;
34
35 dim_t
36 b_alg;
37
38 char *colors = "brkgmcbrkg";
39 char *ticks = "o+*xso+*xs";
40 char m_dim_desc[14];
41 char n_dim_desc[14];
42 char m_dim_tag[10];
43 char n_dim_tag[10];
44
45 double max_gflops=6.0;
46
47 double
48 dtime,
49 gflops,
50 diff;
51
52 FLA_Obj
53 A, A_ref, t, T, W, b, b_ref;
54
55
56 FLA_Init();
57
58
59 fprintf( stdout, "%c number of repeats:", '%' );
60 scanf( "%d", &n_repeats );
61 fprintf( stdout, "%c %d\n", '%', n_repeats );
62
63 fprintf( stdout, "%c enter algorithmic blocksize: ", '%' );
64 scanf( "%u", &b_alg );
65 fprintf( stdout, "%c %u\n", '%', b_alg );
66
67 fprintf( stdout, "%c enter problem size first, last, inc:", '%' );
68 scanf( "%d%d%d", &p_first, &p_last, &p_inc );
69 fprintf( stdout, "%c %d %d %d\n", '%', p_first, p_last, p_inc );
70
71 fprintf( stdout, "%c enter m n (-1 means bind to problem size): ", '%' );
72 scanf( "%d %d", &m_input, &n_input );
73 fprintf( stdout, "%c %d %d\n", '%', m_input, n_input );
74
75
76 fprintf( stdout, "\nclear all;\n\n" );
77
78
79 if ( m_input > 0 ) {
80 sprintf( m_dim_desc, "m = %d", m_input );
81 sprintf( m_dim_tag, "m%dc", m_input);
82 }
83 else if( m_input < -1 ) {
84 sprintf( m_dim_desc, "m = p/%d", -m_input );
85 sprintf( m_dim_tag, "m%dp", -m_input );
86 }
87 else if( m_input == -1 ) {
88 sprintf( m_dim_desc, "m = p" );
89 sprintf( m_dim_tag, "m%dp", 1 );
90 }
91 if ( n_input > 0 ) {
92 sprintf( n_dim_desc, "n = %d", n_input );
93 sprintf( n_dim_tag, "n%dc", n_input);
94 }
95 else if( n_input < -1 ) {
96 sprintf( n_dim_desc, "n = p/%d", -n_input );
97 sprintf( n_dim_tag, "n%dp", -n_input );
98 }
99 else if( n_input == -1 ) {
100 sprintf( n_dim_desc, "n = p" );
101 sprintf( n_dim_tag, "n%dp", 1 );
102 }
103
104
105 //datatype = FLA_FLOAT;
106 datatype = FLA_DOUBLE;
107 //datatype = FLA_COMPLEX;
108 //datatype = FLA_DOUBLE_COMPLEX;
109
110 for ( p = p_first, i = 1; p <= p_last; p += p_inc, i += 1 )
111 {
112 m = m_input;
113 n = n_input;
114
115 if( m < 0 ) m = p * f2c_abs(m_input);
116 if( n < 0 ) n = p * f2c_abs(n_input);
117
118 min_m_n = min( m, n );
119
120 for ( variant = 0; variant < n_variants; variant++ ){
121
122 FLA_Obj_create( datatype, m, n, 0, 0, &A );
123 FLA_Obj_create( datatype, m, n, 0, 0, &A_ref );
124 FLA_Obj_create( datatype, min_m_n, 1, 0, 0, &t );
125 FLA_Obj_create( datatype, b_alg, min_m_n, 0, 0, &T );
126 FLA_Obj_create( datatype, m, 1, 0, 0, &W );
127 FLA_Obj_create( datatype, m, 1, 0, 0, &b );
128 FLA_Obj_create( datatype, m, 1, 0, 0, &b_ref );
129
130 FLA_Random_matrix( A );
131 FLA_Random_matrix( b );
132
133 fprintf( stdout, "data_lq_ut( %d, 1:3 ) = [ %d ", i, p );
134 fflush( stdout );
135
136 time_LQ_UT( variant, FLA_ALG_REFERENCE, n_repeats, m, n,
137 A, A_ref, t, T, W, b, b_ref, &dtime, &diff, &gflops );
138
139 fprintf( stdout, "%6.3lf %6.2le ", gflops, diff );
140 fflush( stdout );
141
142 time_LQ_UT( variant, FLA_ALG_FRONT, n_repeats, m, n,
143 A, A_ref, t, T, W, b, b_ref, &dtime, &diff, &gflops );
144
145 fprintf( stdout, "%6.3lf %6.2le ", gflops, diff );
146 fflush( stdout );
147
148 fprintf( stdout, " ]; \n" );
149 fflush( stdout );
150
151 FLA_Obj_free( &A );
152 FLA_Obj_free( &A_ref );
153 FLA_Obj_free( &t );
154 FLA_Obj_free( &T );
155 FLA_Obj_free( &W );
156 FLA_Obj_free( &b );
157 FLA_Obj_free( &b_ref );
158 }
159
160 }
161
162 /*
163 fprintf( stdout, "figure;\n" );
164
165 fprintf( stdout, "hold on;\n" );
166
167 for ( i = 0; i < n_variants; i++ ) {
168 fprintf( stdout, "plot( data_lq_ut( :,1 ), data_lq_ut( :, 2 ), '%c:%c' ); \n",
169 colors[ i ], ticks[ i ] );
170 fprintf( stdout, "plot( data_lq_ut( :,1 ), data_lq_ut( :, 4 ), '%c-.%c' ); \n",
171 colors[ i ], ticks[ i ] );
172 }
173
174 fprintf( stdout, "legend( ... \n" );
175
176 for ( i = 0; i < n_variants; i++ )
177 fprintf( stdout, "'ref\\_lq\\_ut', 'fla\\_lq\\_ut', ... \n" );
178
179 fprintf( stdout, "'Location', 'SouthEast' ); \n" );
180
181 fprintf( stdout, "xlabel( 'problem size p' );\n" );
182 fprintf( stdout, "ylabel( 'GFLOPS/sec.' );\n" );
183 fprintf( stdout, "axis( [ 0 %d 0 %.2f ] ); \n", p_last, max_gflops );
184 fprintf( stdout, "title( 'FLAME LQ_UT front-end performance (%s, %s)' );\n",
185 m_dim_desc, n_dim_desc );
186 fprintf( stdout, "print -depsc lq_ut_front_%s_%s.eps\n", m_dim_tag, n_dim_tag );
187 fprintf( stdout, "hold off;\n");
188 fflush( stdout );
189 */
190
191 FLA_Finalize( );
192
193 return 0;
194 }
195