You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

gesv.c 4.9 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /*********************************************************************/
  2. /* Copyright 2009, 2010 The University of Texas at Austin. */
  3. /* All rights reserved. */
  4. /* */
  5. /* Redistribution and use in source and binary forms, with or */
  6. /* without modification, are permitted provided that the following */
  7. /* conditions are met: */
  8. /* */
  9. /* 1. Redistributions of source code must retain the above */
  10. /* copyright notice, this list of conditions and the following */
  11. /* disclaimer. */
  12. /* */
  13. /* 2. Redistributions in binary form must reproduce the above */
  14. /* copyright notice, this list of conditions and the following */
  15. /* disclaimer in the documentation and/or other materials */
  16. /* provided with the distribution. */
  17. /* */
  18. /* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
  19. /* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
  20. /* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
  21. /* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
  22. /* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
  23. /* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
  24. /* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
  25. /* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
  26. /* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
  27. /* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
  28. /* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
  29. /* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
  30. /* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
  31. /* POSSIBILITY OF SUCH DAMAGE. */
  32. /* */
  33. /* The views and conclusions contained in the software and */
  34. /* documentation are those of the authors and should not be */
  35. /* interpreted as representing official policies, either expressed */
  36. /* or implied, of The University of Texas at Austin. */
  37. /*********************************************************************/
  38. #include "bench.h"
  39. double fabs(double);
  40. #undef GESV
  41. #undef GETRS
  42. #ifndef COMPLEX
  43. #ifdef XDOUBLE
  44. #define GESV BLASFUNC(qgesv)
  45. #elif defined(DOUBLE)
  46. #define GESV BLASFUNC(dgesv)
  47. #else
  48. #define GESV BLASFUNC(sgesv)
  49. #endif
  50. #else
  51. #ifdef XDOUBLE
  52. #define GESV BLASFUNC(xgesv)
  53. #elif defined(DOUBLE)
  54. #define GESV BLASFUNC(zgesv)
  55. #else
  56. #define GESV BLASFUNC(cgesv)
  57. #endif
  58. #endif
  59. int main(int argc, char *argv[]){
  60. FLOAT *a, *b;
  61. blasint *ipiv;
  62. blasint m, i, j, info;
  63. int from = 1;
  64. int to = 200;
  65. int step = 1;
  66. double time1;
  67. argc--;argv++;
  68. if (argc > 0) { from = atol(*argv); argc--; argv++;}
  69. if (argc > 0) { to = MAX(atol(*argv), from); argc--; argv++;}
  70. if (argc > 0) { step = atol(*argv); argc--; argv++;}
  71. fprintf(stderr, "From : %3d To : %3d Step = %3d\n", from, to, step);
  72. if (( a = (FLOAT *)malloc(sizeof(FLOAT) * to * to * COMPSIZE)) == NULL){
  73. fprintf(stderr,"Out of Memory!!\n");exit(1);
  74. }
  75. if (( b = (FLOAT *)malloc(sizeof(FLOAT) * to * to * COMPSIZE)) == NULL){
  76. fprintf(stderr,"Out of Memory!!\n");exit(1);
  77. }
  78. if (( ipiv = (blasint *)malloc(sizeof(blasint) * to * COMPSIZE)) == NULL){
  79. fprintf(stderr,"Out of Memory!!\n");exit(1);
  80. }
  81. #ifdef __linux
  82. srandom(getpid());
  83. #endif
  84. fprintf(stderr, " SIZE Flops Time\n");
  85. for(m = from; m <= to; m += step){
  86. fprintf(stderr, " %dx%d : ", (int)m, (int)m);
  87. for(j = 0; j < m; j++){
  88. for(i = 0; i < m * COMPSIZE; i++){
  89. a[(long)i + (long)j * (long)m * COMPSIZE] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
  90. }
  91. }
  92. for(j = 0; j < m; j++){
  93. for(i = 0; i < m * COMPSIZE; i++){
  94. b[(long)i + (long)j * (long)m * COMPSIZE] = 0.0;
  95. }
  96. }
  97. for (j = 0; j < m; ++j) {
  98. for (i = 0; i < m * COMPSIZE; ++i) {
  99. b[i] += a[(long)i + (long)j * (long)m * COMPSIZE];
  100. }
  101. }
  102. begin();
  103. GESV (&m, &m, a, &m, ipiv, b, &m, &info);
  104. end();
  105. time1 = getsec();
  106. fprintf(stderr,
  107. "%10.2f MFlops %10.6f s\n",
  108. COMPSIZE * COMPSIZE * (2. / 3. * (double)m * (double)m * (double)m + 2. * (double)m * (double)m * (double)m ) / (time1) * 1.e-6 , time1);
  109. }
  110. return 0;
  111. }
  112. // void main(int argc, char *argv[]) __attribute__((weak, alias("MAIN__")));