[gcc] GCC 4.5.0=>4.5.1

gcc/libstdc++-v3/testsuite/performance/26_numerics/complex_norm.cc

Index: gcc/libstdc++-v3/testsuite/performance/26_numerics/complex_norm.cc
diff --git a/gcc/libstdc++-v3/testsuite/performance/26_numerics/complex_norm.cc b/gcc/libstdc++-v3/testsuite/performance/26_numerics/complex_norm.cc
deleted file mode 100644
index 428959dc1e029ccd554fc28219b9a41139365be5..0000000000000000000000000000000000000000
--- a/gcc/libstdc++-v3/testsuite/performance/26_numerics/complex_norm.cc
+++ /dev/null
@@ -1,74 +0,0 @@
-// Copyright (C) 2003, 2009 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 3, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING3.  If not see
-// <http://www.gnu.org/licenses/>.
-
-
-#include <complex>
-#include <testsuite_performance.h>
-
-// based on libstdc++/5730, use --fast-math
-int main()
-{
-  using namespace std;
-  using namespace __gnu_test;
-
-  time_counter time;
-  resource_counter resource;
-  const int iterations = 2000;
-
-  typedef complex<double> complex_type;
-  complex_type u[2048];
-
-  for (int i = 0; i < 2048; ++i)
-    u[i] = 1.0;
-
-  start_counters(time, resource);
-  for (int i = 0; i < iterations; ++i) 
-    {
-      complex_type * p = u;
-      for (int j = 0; j < 2048; ++j) 
-	{
-	  double u2 = norm(*p);
-	  double t = u2 * 0.1;
-	  *p *= complex_type(cos(t), sin(t));
-	  ++p;
-	}
-    }
-  stop_counters(time, resource);
-  report_performance(__FILE__, "norm", time, resource);
-  clear_counters(time, resource);
-
-  start_counters(time, resource);
-  for (int i = 0; i < iterations; ++i) 
-    {
-      complex_type * p = u;
-      for (int j = 0; j < 2048; ++j) 
-	{
-	  // Shouldn't be slower than the above.
-	  double ur = real(*p); 
-	  double ui = imag(*p);
-	  double u2 = ur * ur + ui * ui;
-	  double t = u2 * 0.1;
-	  *p *= complex_type(cos(t), sin(t));
-	  ++p;
-	}
-    }
-  stop_counters(time, resource);
-  report_performance(__FILE__, "", time, resource);
-
-  return 0;
-}
-