/* This file is part of the Pangolin Project. * http://github.com/stevenlovegrove/Pangolin * * Permission is hereby granted, free of charge, to any person * obtaining a copy of this software and associated documentation * files (the "Software"), to deal in the Software without * restriction, including without limitation the rights to use, * copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following * conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR * OTHER DEALINGS IN THE SOFTWARE. */ #pragma once #include #include #include #include #include #include #include namespace pangolin { // Lightweight timestamp class to allow synchronized playback from the same (or a different) stream. // All playback functions called with the same SyncTime will be time-synchronized, and will remain synchronized on seek() if the SyncTime is passed in when seeking. // Playback with multiple SyncTimes (on the same or different streams) should also be synced, even in different processes or systems (underlying clock sync is not required). // However, playback with multiple SyncTimes will break on seek(). class PANGOLIN_EXPORT SyncTime { public: using Clock = baseclock; using Duration = Clock::duration; using TimePoint = Clock::time_point; struct SeekInterruption: std::runtime_error { SeekInterruption() : std::runtime_error("Time queue invalidated by seek"){} }; SyncTime(Duration virtual_clock_offset = std::chrono::milliseconds(0)) : seeking(false) { SetOffset(virtual_clock_offset); } // No copy constructor SyncTime(const SyncTime&) = delete; void SetOffset(Duration virtual_clock_offset) { virtual_offset = virtual_clock_offset; } void SetClock(TimePoint virtual_now) { virtual_offset = virtual_now - Clock::now(); } TimePoint TimeNow() const { return Clock::now() + virtual_offset; } TimePoint ToVirtual(TimePoint real) const { return real + virtual_offset; } TimePoint ToReal(TimePoint virt) const { return virt - virtual_offset; } void WaitUntil(TimePoint virtual_time) const { std::this_thread::sleep_until( ToReal(virtual_time) ); } int64_t QueueEvent(int64_t new_event_time_us) { return WaitDequeueAndQueueEvent(0, new_event_time_us); } void DequeueEvent(int64_t event_time_us) { std::unique_lock l(time_mutex); auto i = std::find(time_queue_us.begin(), time_queue_us.end(), event_time_us); PANGO_ENSURE(i != time_queue_us.end()); time_queue_us.erase(i); queue_changed.notify_all(); } int64_t WaitDequeueAndQueueEvent(int64_t event_time_us, int64_t new_event_time_us =0 ) { std::unique_lock l(time_mutex); if(event_time_us) { PANGO_ENSURE(time_queue_us.size()); // Wait until we're top the priority-queue queue_changed.wait(l, [&](){ if(seeking) { // Time queue will be invalidated on seek. // Unblock without action throw SeekInterruption(); } return time_queue_us.back() == event_time_us; }); // Dequeue time_queue_us.pop_back(); } if(new_event_time_us) { // Add the new event whilst we still hold the lock, so that our // event can't be missed insert_sorted(time_queue_us, new_event_time_us, std::greater()); if(time_queue_us.back() == new_event_time_us) { // Return to avoid yielding when we're next. return new_event_time_us; } } // Only yield if another device is next queue_changed.notify_all(); return new_event_time_us; } void NotifyAll() { queue_changed.notify_all(); } std::mutex& TimeMutex() { return time_mutex; } void Stop() { seeking = true; OnTimeStop(); queue_changed.notify_all(); } void Start() { OnTimeStart(); seeking=false; } void Seek(TimePoint t) { Stop(); OnSeek(t); Start(); } Signal<> OnTimeStart; Signal<> OnTimeStop; Signal OnSeek; private: template< typename T, typename Pred > static typename std::vector::iterator insert_sorted( std::vector & vec, T const& item, Pred pred ) { return vec.insert ( std::upper_bound( vec.begin(), vec.end(), item, pred ), item ); } std::vector time_queue_us; Duration virtual_offset; std::mutex time_mutex; std::condition_variable queue_changed; bool seeking; }; struct SyncTimeEventPromise { SyncTimeEventPromise(SyncTime& sync, int64_t time_us = 0) : sync(sync), time_us(time_us) { sync.QueueEvent(time_us); } ~SyncTimeEventPromise() { Cancel(); } void Cancel() { if(time_us) { sync.DequeueEvent(time_us); time_us = 0; } } void WaitAndRenew(int64_t new_time_us) { time_us = sync.WaitDequeueAndQueueEvent(time_us, new_time_us); } private: SyncTime& sync; int64_t time_us; }; }