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
|
/*
* Calcurse - text-based organizer
*
* Copyright (c) 2004-2023 calcurse Development Team <misc@calcurse.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the
* following disclaimer in the documentation and/or other
* materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Send your feedback or comments to : misc@calcurse.org
* Calcurse home page : http://calcurse.org
*
*/
#include "calcurse.h"
/*
* A queue for calcurse system messages.
*/
llist_t sysqueue;
static pthread_mutex_t que_mutex = PTHREAD_MUTEX_INITIALIZER;
void que_init(void)
{
LLIST_INIT(&sysqueue);
}
/*
* Test for queued system events.
*/
int que_ued(void)
{
return sysqueue.head ? 1 : 0;
}
/*
* Insert a system event at the tail of the queue.
*/
struct event *que_ins(char *mesg, time_t time, int id)
{
struct event *ev;
ev = mem_malloc(sizeof(struct event));
ev->mesg = mem_strdup(mesg);
ev->day = time;
ev->id = id;
ev->note = NULL;
pthread_mutex_lock(&que_mutex);
LLIST_ADD(&sysqueue, ev);
pthread_mutex_unlock(&que_mutex);
return ev;
}
/*
* Get the system event at the head of the queue.
*/
struct event *que_get(void)
{
return sysqueue.head ? sysqueue.head->data : NULL;
}
/*
* Remove the system event at the head of the queue.
*/
void que_rem(void)
{
struct event *ev;
if (!sysqueue.head)
return;
ev = sysqueue.head->data;
pthread_mutex_lock(&que_mutex);
LLIST_REMOVE(&sysqueue, sysqueue.head);
pthread_mutex_unlock(&que_mutex);
mem_free(ev->mesg);
mem_free(ev);
}
/*
* Display the system event at the head of the queue in a popup window.
*/
void que_show(void)
{
struct event *ev;
char *date;
if (!que_ued())
return;
ev = que_get();
date = date_sec2date_str(ev->day, "%F %T");
item_in_popup(date, "", ev->mesg, _("System event"));
mem_free(date);
}
/*
* Save the system event at the head of the queue as an appointment.
*/
void que_save(void)
{
struct event *ev;
if (!que_ued())
return;
ev = que_get();
apoint_new(ev->mesg, NULL, ev->day, 0, APOINT_NULL);
io_set_modified();
}
|
