blob: 104c9fafb1db0e3a01ccea68e8f769e1e24c2021 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/**
* @file
* @author 2016 Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de)
* @copyright Simplified BSD
*
* @cond
* This program is free software: you can redistribute it and/or modify
* it under the terms of the FreeBSD license as published by the FreeBSD
* project.
*
* This program 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.
*
* You should have received a copy of the FreeBSD license along with this
* program. If not, see <http://www.opensource.org/licenses/bsd-license>.
* @endcond
*/
#include "BasicEventQueue.h"
#include <event2/util.h> // for evutil_socket_t
#include <event2/thread.h>
#include <assert.h>
//#include <iostream>
#include "uscxml/interpreter/Logging.h"
namespace uscxml {
BasicEventQueue::BasicEventQueue() {
}
BasicEventQueue::~BasicEventQueue() {
}
Event BasicEventQueue::dequeue(size_t blockMs) {
std::lock_guard<std::recursive_mutex> lock(_mutex);
if (blockMs > 0) {
// block for given milliseconds or until queue is non-empty
auto endTime = std::chrono::system_clock::now() + std::chrono::milliseconds(blockMs);
// std::time_t ttp = std::chrono::system_clock::to_time_t(endTime);
// std::cout << "End: " << ttp << std::endl;
// std::cout << "Now: " << std::chrono::system_clock::to_time_t(std::chrono::system_clock::now()) << std::endl;
while (endTime > std::chrono::system_clock::now() && _queue.empty()) {
_cond.wait_until(_mutex, endTime);
// std::cout << "Aft: " << std::chrono::system_clock::to_time_t(std::chrono::system_clock::now()) << std::endl;
// std::cout << blockMs << ".";
}
}
if (_queue.size() > 0) {
Event event = _queue.front();
_queue.pop_front();
// LOG(USCXML_ERROR) << event.name;
return event;
}
return Event();
}
void BasicEventQueue::enqueue(const Event& event) {
std::lock_guard<std::recursive_mutex> lock(_mutex);
_queue.push_back(event);
_cond.notify_all();
}
void BasicEventQueue::reset() {
std::lock_guard<std::recursive_mutex> lock(_mutex);
_queue.clear();
}
std::shared_ptr<EventQueueImpl> BasicEventQueue::create() {
return std::shared_ptr<EventQueueImpl>(new BasicEventQueue());
}
}
|
