add waitWithSemaphore to folly::wangle
authorMatt Dordal <mnd@fb.com>
Tue, 13 May 2014 17:37:45 +0000 (10:37 -0700)
committerDave Watson <davejwatson@fb.com>
Tue, 20 May 2014 19:53:59 +0000 (12:53 -0700)
Summary:
It may be useful to wait for a future to finish. This adds a utility function
to do so, returning a completed future.

NB: While it doesn't matter which thread executes the `then`, there does need
to be two threads. If not, this will deadlock forever. I'm not sure if there's
a way to detect/prevent that.

Test Plan: added some unit tests.

Reviewed By: hans@fb.com

FB internal diff: D1319330

folly/wangle/Future-inl.h
folly/wangle/Future.h
folly/wangle/test/FutureTest.cpp

index 8d8af26718359f9e9d290410791f242640eba08c..10d844c2e514e014a5b8681e6ff14bf643d0111f 100644 (file)
@@ -17,6 +17,7 @@
 #pragma once
 
 #include "detail.h"
 #pragma once
 
 #include "detail.h"
+#include <folly/LifoSem.h>
 
 namespace folly { namespace wangle {
 
 
 namespace folly { namespace wangle {
 
@@ -418,6 +419,18 @@ whenN(InputIterator first, InputIterator last, size_t n) {
   return ctx->p.getFuture();
 }
 
   return ctx->p.getFuture();
 }
 
+template <typename F>
+typename F::value_type waitWithSemaphore(F&& f) {
+  LifoSem sem;
+  Try<typename F::value_type> done;
+  f.then([&](Try<typename F::value_type> &&t) {
+    done = std::move(t);
+    sem.post();
+  });
+  sem.wait();
+  return done.value();
+}
+
 }}
 
 // I haven't included a Future<T&> specialization because I don't forsee us
 }}
 
 // I haven't included a Future<T&> specialization because I don't forsee us
index f20ef40965d6da4d42cabf0ba897bf909e12c0a7..a0030f84b3e669556be55c0eafac126dcb86a287 100644 (file)
@@ -313,6 +313,15 @@ Future<std::vector<std::pair<
   Try<typename std::iterator_traits<InputIterator>::value_type::value_type>>>>
 whenN(InputIterator first, InputIterator last, size_t n);
 
   Try<typename std::iterator_traits<InputIterator>::value_type::value_type>>>>
 whenN(InputIterator first, InputIterator last, size_t n);
 
+/** Wait for the given future to complete on a semaphore. Returns the result of
+ * the given future.
+ *
+ * NB if the promise for the future would be fulfilled in the same thread that
+ * you call this, it will deadlock.
+ */
+template <class F>
+typename F::value_type waitWithSemaphore(F&& f);
+
 }} // folly::wangle
 
 #include "Future-inl.h"
 }} // folly::wangle
 
 #include "Future-inl.h"
index a362e9bf4b5cef61ded48983195e4a4bfa82deeb..d925644589ea254c2b15a5dd45bbb1331ccffea7 100644 (file)
  */
 
 #include <algorithm>
  */
 
 #include <algorithm>
+#include <atomic>
 #include <folly/small_vector.h>
 #include <gtest/gtest.h>
 #include <memory>
 #include <string>
 #include <folly/small_vector.h>
 #include <gtest/gtest.h>
 #include <memory>
 #include <string>
+#include <thread>
 #include <type_traits>
 #include <unistd.h>
 #include "folly/wangle/Executor.h"
 #include <type_traits>
 #include <unistd.h>
 #include "folly/wangle/Executor.h"
@@ -621,3 +623,37 @@ TEST(Future, throwIfFailed) {
       EXPECT_NO_THROW(t.throwIfFailed());
     });
 }
       EXPECT_NO_THROW(t.throwIfFailed());
     });
 }
+
+TEST(Future, waitWithSemaphoreImmediate) {
+  waitWithSemaphore(makeFuture());
+  auto done = waitWithSemaphore(makeFuture(42));
+  EXPECT_EQ(done, 42);
+}
+
+TEST(Future, waitWithSemaphore) {
+  Promise<int> p;
+  Future<int> f = p.getFuture();
+  std::atomic<bool> flag{false};
+  std::atomic<int> result{1};
+  std::atomic<std::thread::id> id;
+
+  std::thread t([&](Future<int>&& tf){
+      auto n = tf.then([&](Try<int> && t) {
+          id = std::this_thread::get_id();
+          return t.value();
+        });
+      flag = true;
+      result.store(waitWithSemaphore(std::move(n)));
+      LOG(INFO) << result;
+    },
+    std::move(f)
+    );
+  while(!flag){}
+  EXPECT_EQ(result.load(), 1);
+  p.setValue(42);
+  t.join();
+  // validate that the continuation ended up executing in this thread, which
+  // is more to ensure that this test actually tests what it should
+  EXPECT_EQ(id, std::this_thread::get_id());
+  EXPECT_EQ(result.load(), 42);
+}