improve efficiency while waiting for new samples

Author: jfrey-xx

src/consumer_queue.cpp

@@ -2,7 +2,7 @@
 #include "common.h"
 #include "sample.h"
 #include "send_buffer.h"
-#include <boost/chrono/duration.hpp>
+#include <chrono>
 
 using namespace lsl;
 
@@ -26,6 +26,7 @@ void consumer_queue::push_sample(const sample_p &sample) {
 		sample_p dummy;
 		buffer_.pop(dummy);
 	}
+	cv_.notify_one();
 }
 
 sample_p consumer_queue::pop_sample(double timeout) {
@@ -34,12 +35,10 @@ sample_p consumer_queue::pop_sample(double timeout) {
 		buffer_.pop(result);
 	} else {
 		if (!buffer_.pop(result)) {
-			// turn timeout into the point in time at which we give up
-			timeout += lsl::lsl_clock();
-			do {
-				if (lsl::lsl_clock() >= timeout) break;
-				lslboost::this_thread::sleep_for(lslboost::chrono::milliseconds(1));
-			} while (!buffer_.pop(result));
+			// wait untill for a new sample until the thread calling push_sample delivers one, or until timeout
+			std::unique_lock<std::mutex> lk(lock_);
+			std::chrono::duration<double> sec(timeout);
+			cv_.wait_for(lk, sec, [&]{ return this->buffer_.pop(result); });
 		}
 	}
 	return result;

src/consumer_queue.h

@@ -4,6 +4,8 @@
 #include "common.h"
 #include "forward.h"
 #include <boost/lockfree/spsc_queue.hpp>
+#include <mutex>
+#include <condition_variable>
 
 namespace lsl {
 /**
@@ -43,6 +45,9 @@ class consumer_queue : private lslboost::noncopyable {
 private:
 	send_buffer_p registry_; // optional consumer registry
 	buffer_type buffer_;	 // the sample buffer
+	// used to wait for new samples
+	std::mutex lock_;
+	std::condition_variable cv_;
 };
 
 } // namespace lsl