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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* Copyright 2014 Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 3, as published
* by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranties of
* MERCHANTABILITY, SATISFACTORY QUALITY, 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 program. If not, see <http://www.gnu.org/licenses/>.
*
* Authors:
* Charles Kerr <charles.kerr@canonical.com>
*/
#include <datetime/alarm-queue-simple.h>
#include <cmath>
namespace unity {
namespace indicator {
namespace datetime {
/***
**** Public API
***/
SimpleAlarmQueue::SimpleAlarmQueue(const std::shared_ptr<Clock>& clock,
const std::shared_ptr<Planner>& planner,
const std::shared_ptr<WakeupTimer>& timer):
m_clock(clock),
m_planner(planner),
m_timer(timer),
m_datetime(clock->localtime())
{
m_planner->appointments().changed().connect([this](const std::vector<Appointment>&){
g_debug("AlarmQueue %p calling requeue() due to appointments changed", this);
requeue();
});
m_clock->minute_changed.connect([=]{
const auto now = m_clock->localtime();
constexpr auto skew_threshold_usec = int64_t{90} * G_USEC_PER_SEC;
const bool clock_jumped = std::abs(now - m_datetime) > skew_threshold_usec;
m_datetime = now;
if (clock_jumped) {
g_debug("AlarmQueue %p calling requeue() due to clock skew", this);
requeue();
}
});
m_timer->timeout().connect([this](){
g_debug("AlarmQueue %p calling requeue() due to timeout", this);
requeue();
});
requeue();
}
SimpleAlarmQueue::~SimpleAlarmQueue()
{
}
core::Signal<const Appointment&>& SimpleAlarmQueue::alarm_reached()
{
return m_alarm_reached;
}
/***
****
***/
void SimpleAlarmQueue::requeue()
{
// kick any current alarms
for (auto current : find_current_alarms())
{
m_triggered.insert(current.uid);
m_alarm_reached(current);
}
// idle until the next alarm
Appointment next;
if (find_next_alarm(next))
{
g_debug ("setting timer to wake up for next appointment '%s' at %s",
next.summary.c_str(),
next.begin.format("%F %T").c_str());
m_timer->set_wakeup_time(next.begin);
}
}
// find the next alarm that will kick now or in the future
bool SimpleAlarmQueue::find_next_alarm(Appointment& setme) const
{
bool found = false;
Appointment tmp;
const auto now = m_clock->localtime();
const auto beginning_of_minute = now.add_full (0, 0, 0, 0, 0, -now.seconds());
for(const auto& walk : m_planner->appointments().get())
{
if (m_triggered.count(walk.uid)) // did we already use this one?
continue;
if (walk.begin < beginning_of_minute) // has this one already passed?
continue;
if (found && (tmp.begin < walk.begin)) // do we already have a better match?
continue;
tmp = walk;
found = true;
}
if (found)
setme = tmp;
return found;
}
// find the alarm(s) that should kick right now
std::vector<Appointment> SimpleAlarmQueue::find_current_alarms() const
{
std::vector<Appointment> appointments;
const auto now = m_clock->localtime();
for(const auto& walk : m_planner->appointments().get())
{
if (m_triggered.count(walk.uid)) // did we already use this one?
continue;
if (!DateTime::is_same_minute(now, walk.begin))
continue;
appointments.push_back(walk);
}
return appointments;
}
/***
****
***/
} // namespace datetime
} // namespace indicator
} // namespace unity
|
