obtained gcc-4.6.4.tar.bz2 from upstream website;upstream

verified gcc-4.6.4.tar.bz2.sig;
imported gcc-4.6.4 source tree from verified upstream tarball.

downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.

if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.

1 files changed, 64 insertions, 0 deletions

diff --git a/libstdc++-v3/testsuite/performance/30_threads/future/polling.cc b/libstdc++-v3/testsuite/performance/30_threads/future/polling.cc
new file mode 100644
index 000000000..83fde2710
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/30_threads/future/polling.cc
@@ -0,0 +1,64 @@
+// Copyright (C) 2009, 2010 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 <future>
+#include <thread>
+#include <testsuite_performance.h>
+
+inline bool is_ready(std::shared_future<void>& f)
+{
+  return f.wait_for(std::chrono::microseconds(1));
+}
+
+void poll(std::shared_future<void> f)
+{
+  while (!is_ready(f))
+  { }
+}
+
+int main()
+{
+#ifdef TEST_T1
+#define thread_type true
+#endif 
+
+  using namespace __gnu_test;
+  time_counter time;
+  resource_counter resource;
+
+  const int n = 20;
+  std::promise<void> p;
+  std::shared_future<void> f = p.get_future();
+  std::thread pollers[n];
+  for (int i=0; i < n; ++i)
+    pollers[i] = std::thread(poll, f);
+
+  start_counters(time, resource);
+
+  for (int i = 0; i < 1000000; ++i)
+    (void)is_ready(f);
+  p.set_value();
+
+  for (int i=0; i < n; ++i)
+    pollers[i].join();
+
+  stop_counters(time, resource);
+  report_performance(__FILE__, "", time, resource);
+
+  return 0;
+}