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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
/*
* tc.sched.c: Scheduled command execution
*
* Karl Kleinpaste: Computer Consoles Inc. 1984
*/
/*-
* Copyright (c) 1980, 1991 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
*/
#include "sh.h"
#include "ed.h"
#include "tw.h"
#include "tc.h"
extern int just_signaled;
struct sched_event {
struct sched_event *t_next;
time_t t_when;
Char **t_lex;
};
static struct sched_event *sched_ptr = NULL;
time_t
sched_next(void)
{
if (sched_ptr)
return (sched_ptr->t_when);
return ((time_t) - 1);
}
/*ARGSUSED*/
void
dosched(Char **v, struct command *c)
{
struct sched_event *tp, **pp;
time_t cur_time;
int count, hours, minutes, dif_hour, dif_min;
Char *cp;
int relative; /* time specified as +hh:mm */
struct tm *ltp;
USE(c);
/* This is a major kludge because of a gcc linker */
/* Problem. It may or may not be needed for you */
#if defined(_MINIX) && !defined(_MINIX_VMD)
char kludge[10];
extern char *sprintf();
sprintf(kludge, CGETS(24, 1, "kludge"));
#endif /* _MINIX && !_MINIX_VMD */
v++;
cp = *v++;
if (cp == NULL) {
const Char *fmt;
if ((fmt = varval(STRsched)) == STRNULL)
fmt = str2short("%h\t%T\t%R\n");
/* print list of scheduled events */
for (count = 1, tp = sched_ptr; tp; count++, tp = tp->t_next) {
Char *buf, *str;
buf = blkexpand(tp->t_lex);
cleanup_push(buf, xfree);
str = tprintf(FMT_SCHED, fmt, short2str(buf), tp->t_when, &count);
cleanup_until(buf);
cleanup_push(str, xfree);
for (cp = str; *cp;)
xputwchar(*cp++);
cleanup_until(str);
}
return;
}
if (*cp == '-') {
/* remove item from list */
if (!sched_ptr)
stderror(ERR_NOSCHED);
if (*v)
stderror(ERR_SCHEDUSAGE);
count = atoi(short2str(++cp));
if (count <= 0)
stderror(ERR_SCHEDUSAGE);
pp = &sched_ptr;
tp = sched_ptr;
while (--count) {
if (tp->t_next == 0)
break;
else {
pp = &tp->t_next;
tp = tp->t_next;
}
}
if (count)
stderror(ERR_SCHEDEV);
*pp = tp->t_next;
blkfree(tp->t_lex);
xfree(tp);
return;
}
/* else, add an item to the list */
if (!*v)
stderror(ERR_SCHEDCOM);
relative = 0;
if (!Isdigit(*cp)) { /* not abs. time */
if (*cp != '+')
stderror(ERR_SCHEDUSAGE);
cp++, relative++;
}
minutes = 0;
hours = atoi(short2str(cp));
while (*cp && *cp != ':' && *cp != 'a' && *cp != 'p')
cp++;
if (*cp && *cp == ':')
minutes = atoi(short2str(++cp));
if ((hours < 0) || (minutes < 0) ||
(hours > 23) || (minutes > 59))
stderror(ERR_SCHEDTIME);
while (*cp && *cp != 'p' && *cp != 'a')
cp++;
if (*cp && relative)
stderror(ERR_SCHEDREL);
if (*cp == 'p')
hours += 12;
(void) time(&cur_time);
ltp = localtime(&cur_time);
if (relative) {
dif_hour = hours;
dif_min = minutes;
}
else {
if ((dif_hour = hours - ltp->tm_hour) < 0)
dif_hour += 24;
if ((dif_min = minutes - ltp->tm_min) < 0) {
dif_min += 60;
if ((--dif_hour) < 0)
dif_hour = 23;
}
}
tp = xcalloc(1, sizeof *tp);
#ifdef _SX
tp->t_when = cur_time - ltp->tm_sec + dif_hour * 3600 + dif_min * 60;
#else /* _SX */
tp->t_when = cur_time - ltp->tm_sec + dif_hour * 3600L + dif_min * 60L;
#endif /* _SX */
/* use of tm_sec: get to beginning of minute. */
for (pp = &sched_ptr; *pp != NULL && tp->t_when >= (*pp)->t_when;
pp = &(*pp)->t_next)
;
tp->t_next = *pp;
*pp = tp;
tp->t_lex = saveblk(v);
}
/*
* Execute scheduled events
*/
void
sched_run(void)
{
time_t cur_time;
struct sched_event *tp;
struct wordent cmd, *nextword, *lastword;
struct command *t;
Char **v, *cp;
pintr_disabled++;
cleanup_push(&pintr_disabled, disabled_cleanup);
(void) time(&cur_time);
/* bugfix by: Justin Bur at Universite de Montreal */
/*
* this test wouldn't be necessary if this routine were not called before
* each prompt (in sh.c). But it is, to catch missed alarms. Someone
* ought to fix it all up. -jbb
*/
if (!(sched_ptr && sched_ptr->t_when < cur_time)) {
cleanup_until(&pintr_disabled);
return;
}
if (GettingInput)
(void) Cookedmode();
while ((tp = sched_ptr) != NULL && tp->t_when < cur_time) {
if (seterr) {
xfree(seterr);
seterr = NULL;
}
cmd.word = STRNULL;
lastword = &cmd;
v = tp->t_lex;
for (cp = *v; cp; cp = *++v) {
nextword = xcalloc(1, sizeof cmd);
nextword->word = Strsave(cp);
lastword->next = nextword;
nextword->prev = lastword;
lastword = nextword;
}
lastword->next = &cmd;
cmd.prev = lastword;
sched_ptr = tp->t_next; /* looping termination cond: */
blkfree(tp->t_lex); /* straighten out in case of */
xfree(tp); /* command blow-up. */
cleanup_push(&cmd, lex_cleanup);
/* expand aliases like process() does. */
alias(&cmd);
/* build a syntax tree for the command. */
t = syntax(cmd.next, &cmd, 0);
cleanup_push(t, syntax_cleanup);
if (seterr)
stderror(ERR_OLD);
/* execute the parse tree. */
execute(t, -1, NULL, NULL, TRUE);
/* done. free the lex list and parse tree. */
cleanup_until(&cmd);
}
if (GettingInput && !just_signaled) { /* PWP */
(void) Rawmode();
ClearLines(); /* do a real refresh since something may */
ClearDisp(); /* have printed to the screen */
Refresh();
}
just_signaled = 0;
cleanup_until(&pintr_disabled);
}
|
