1*7d8fb588SMatthias Schmidt /*
2*7d8fb588SMatthias Schmidt * tc.sched.c: Scheduled command execution
3*7d8fb588SMatthias Schmidt *
4*7d8fb588SMatthias Schmidt * Karl Kleinpaste: Computer Consoles Inc. 1984
5*7d8fb588SMatthias Schmidt */
6*7d8fb588SMatthias Schmidt /*-
7*7d8fb588SMatthias Schmidt * Copyright (c) 1980, 1991 The Regents of the University of California.
8*7d8fb588SMatthias Schmidt * All rights reserved.
9*7d8fb588SMatthias Schmidt *
10*7d8fb588SMatthias Schmidt * Redistribution and use in source and binary forms, with or without
11*7d8fb588SMatthias Schmidt * modification, are permitted provided that the following conditions
12*7d8fb588SMatthias Schmidt * are met:
13*7d8fb588SMatthias Schmidt * 1. Redistributions of source code must retain the above copyright
14*7d8fb588SMatthias Schmidt * notice, this list of conditions and the following disclaimer.
15*7d8fb588SMatthias Schmidt * 2. Redistributions in binary form must reproduce the above copyright
16*7d8fb588SMatthias Schmidt * notice, this list of conditions and the following disclaimer in the
17*7d8fb588SMatthias Schmidt * documentation and/or other materials provided with the distribution.
18*7d8fb588SMatthias Schmidt * 3. Neither the name of the University nor the names of its contributors
19*7d8fb588SMatthias Schmidt * may be used to endorse or promote products derived from this software
20*7d8fb588SMatthias Schmidt * without specific prior written permission.
21*7d8fb588SMatthias Schmidt *
22*7d8fb588SMatthias Schmidt * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23*7d8fb588SMatthias Schmidt * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24*7d8fb588SMatthias Schmidt * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25*7d8fb588SMatthias Schmidt * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26*7d8fb588SMatthias Schmidt * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27*7d8fb588SMatthias Schmidt * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28*7d8fb588SMatthias Schmidt * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29*7d8fb588SMatthias Schmidt * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30*7d8fb588SMatthias Schmidt * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31*7d8fb588SMatthias Schmidt * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32*7d8fb588SMatthias Schmidt * SUCH DAMAGE.
33*7d8fb588SMatthias Schmidt */
34*7d8fb588SMatthias Schmidt #include "sh.h"
35*7d8fb588SMatthias Schmidt #include "ed.h"
36*7d8fb588SMatthias Schmidt #include "tw.h"
37*7d8fb588SMatthias Schmidt #include "tc.h"
38*7d8fb588SMatthias Schmidt
39*7d8fb588SMatthias Schmidt extern int just_signaled;
40*7d8fb588SMatthias Schmidt
41*7d8fb588SMatthias Schmidt struct sched_event {
42*7d8fb588SMatthias Schmidt struct sched_event *t_next;
43*7d8fb588SMatthias Schmidt time_t t_when;
44*7d8fb588SMatthias Schmidt Char **t_lex;
45*7d8fb588SMatthias Schmidt };
46*7d8fb588SMatthias Schmidt static struct sched_event *sched_ptr = NULL;
47*7d8fb588SMatthias Schmidt
48*7d8fb588SMatthias Schmidt
49*7d8fb588SMatthias Schmidt time_t
sched_next(void)50*7d8fb588SMatthias Schmidt sched_next(void)
51*7d8fb588SMatthias Schmidt {
52*7d8fb588SMatthias Schmidt if (sched_ptr)
53*7d8fb588SMatthias Schmidt return (sched_ptr->t_when);
54*7d8fb588SMatthias Schmidt return ((time_t) - 1);
55*7d8fb588SMatthias Schmidt }
56*7d8fb588SMatthias Schmidt
57*7d8fb588SMatthias Schmidt /*ARGSUSED*/
58*7d8fb588SMatthias Schmidt void
dosched(Char ** v,struct command * c)59*7d8fb588SMatthias Schmidt dosched(Char **v, struct command *c)
60*7d8fb588SMatthias Schmidt {
61*7d8fb588SMatthias Schmidt struct sched_event *tp, **pp;
62*7d8fb588SMatthias Schmidt time_t cur_time;
63*7d8fb588SMatthias Schmidt int count, hours, minutes, dif_hour, dif_min;
64*7d8fb588SMatthias Schmidt Char *cp;
65*7d8fb588SMatthias Schmidt int relative; /* time specified as +hh:mm */
66*7d8fb588SMatthias Schmidt struct tm *ltp;
67*7d8fb588SMatthias Schmidt
68*7d8fb588SMatthias Schmidt USE(c);
69*7d8fb588SMatthias Schmidt /* This is a major kludge because of a gcc linker */
70*7d8fb588SMatthias Schmidt /* Problem. It may or may not be needed for you */
71*7d8fb588SMatthias Schmidt #if defined(_MINIX) && !defined(_MINIX_VMD)
72*7d8fb588SMatthias Schmidt char kludge[10];
73*7d8fb588SMatthias Schmidt extern char *sprintf();
74*7d8fb588SMatthias Schmidt sprintf(kludge, CGETS(24, 1, "kludge"));
75*7d8fb588SMatthias Schmidt #endif /* _MINIX && !_MINIX_VMD */
76*7d8fb588SMatthias Schmidt
77*7d8fb588SMatthias Schmidt v++;
78*7d8fb588SMatthias Schmidt cp = *v++;
79*7d8fb588SMatthias Schmidt if (cp == NULL) {
80*7d8fb588SMatthias Schmidt const Char *fmt;
81*7d8fb588SMatthias Schmidt if ((fmt = varval(STRsched)) == STRNULL)
82*7d8fb588SMatthias Schmidt fmt = str2short("%h\t%T\t%R\n");
83*7d8fb588SMatthias Schmidt /* print list of scheduled events */
84*7d8fb588SMatthias Schmidt for (count = 1, tp = sched_ptr; tp; count++, tp = tp->t_next) {
85*7d8fb588SMatthias Schmidt Char *buf, *str;
86*7d8fb588SMatthias Schmidt
87*7d8fb588SMatthias Schmidt buf = blkexpand(tp->t_lex);
88*7d8fb588SMatthias Schmidt cleanup_push(buf, xfree);
89*7d8fb588SMatthias Schmidt str = tprintf(FMT_SCHED, fmt, short2str(buf), tp->t_when, &count);
90*7d8fb588SMatthias Schmidt cleanup_until(buf);
91*7d8fb588SMatthias Schmidt cleanup_push(str, xfree);
92*7d8fb588SMatthias Schmidt for (cp = str; *cp;)
93*7d8fb588SMatthias Schmidt xputwchar(*cp++);
94*7d8fb588SMatthias Schmidt cleanup_until(str);
95*7d8fb588SMatthias Schmidt }
96*7d8fb588SMatthias Schmidt return;
97*7d8fb588SMatthias Schmidt }
98*7d8fb588SMatthias Schmidt
99*7d8fb588SMatthias Schmidt if (*cp == '-') {
100*7d8fb588SMatthias Schmidt /* remove item from list */
101*7d8fb588SMatthias Schmidt if (!sched_ptr)
102*7d8fb588SMatthias Schmidt stderror(ERR_NOSCHED);
103*7d8fb588SMatthias Schmidt if (*v)
104*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDUSAGE);
105*7d8fb588SMatthias Schmidt count = atoi(short2str(++cp));
106*7d8fb588SMatthias Schmidt if (count <= 0)
107*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDUSAGE);
108*7d8fb588SMatthias Schmidt pp = &sched_ptr;
109*7d8fb588SMatthias Schmidt tp = sched_ptr;
110*7d8fb588SMatthias Schmidt while (--count) {
111*7d8fb588SMatthias Schmidt if (tp->t_next == 0)
112*7d8fb588SMatthias Schmidt break;
113*7d8fb588SMatthias Schmidt else {
114*7d8fb588SMatthias Schmidt pp = &tp->t_next;
115*7d8fb588SMatthias Schmidt tp = tp->t_next;
116*7d8fb588SMatthias Schmidt }
117*7d8fb588SMatthias Schmidt }
118*7d8fb588SMatthias Schmidt if (count)
119*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDEV);
120*7d8fb588SMatthias Schmidt *pp = tp->t_next;
121*7d8fb588SMatthias Schmidt blkfree(tp->t_lex);
122*7d8fb588SMatthias Schmidt xfree(tp);
123*7d8fb588SMatthias Schmidt return;
124*7d8fb588SMatthias Schmidt }
125*7d8fb588SMatthias Schmidt
126*7d8fb588SMatthias Schmidt /* else, add an item to the list */
127*7d8fb588SMatthias Schmidt if (!*v)
128*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDCOM);
129*7d8fb588SMatthias Schmidt relative = 0;
130*7d8fb588SMatthias Schmidt if (!Isdigit(*cp)) { /* not abs. time */
131*7d8fb588SMatthias Schmidt if (*cp != '+')
132*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDUSAGE);
133*7d8fb588SMatthias Schmidt cp++, relative++;
134*7d8fb588SMatthias Schmidt }
135*7d8fb588SMatthias Schmidt minutes = 0;
136*7d8fb588SMatthias Schmidt hours = atoi(short2str(cp));
137*7d8fb588SMatthias Schmidt while (*cp && *cp != ':' && *cp != 'a' && *cp != 'p')
138*7d8fb588SMatthias Schmidt cp++;
139*7d8fb588SMatthias Schmidt if (*cp && *cp == ':')
140*7d8fb588SMatthias Schmidt minutes = atoi(short2str(++cp));
141*7d8fb588SMatthias Schmidt if ((hours < 0) || (minutes < 0) ||
142*7d8fb588SMatthias Schmidt (hours > 23) || (minutes > 59))
143*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDTIME);
144*7d8fb588SMatthias Schmidt while (*cp && *cp != 'p' && *cp != 'a')
145*7d8fb588SMatthias Schmidt cp++;
146*7d8fb588SMatthias Schmidt if (*cp && relative)
147*7d8fb588SMatthias Schmidt stderror(ERR_SCHEDREL);
148*7d8fb588SMatthias Schmidt if (*cp == 'p')
149*7d8fb588SMatthias Schmidt hours += 12;
150*7d8fb588SMatthias Schmidt (void) time(&cur_time);
151*7d8fb588SMatthias Schmidt ltp = localtime(&cur_time);
152*7d8fb588SMatthias Schmidt if (relative) {
153*7d8fb588SMatthias Schmidt dif_hour = hours;
154*7d8fb588SMatthias Schmidt dif_min = minutes;
155*7d8fb588SMatthias Schmidt }
156*7d8fb588SMatthias Schmidt else {
157*7d8fb588SMatthias Schmidt if ((dif_hour = hours - ltp->tm_hour) < 0)
158*7d8fb588SMatthias Schmidt dif_hour += 24;
159*7d8fb588SMatthias Schmidt if ((dif_min = minutes - ltp->tm_min) < 0) {
160*7d8fb588SMatthias Schmidt dif_min += 60;
161*7d8fb588SMatthias Schmidt if ((--dif_hour) < 0)
162*7d8fb588SMatthias Schmidt dif_hour = 23;
163*7d8fb588SMatthias Schmidt }
164*7d8fb588SMatthias Schmidt }
165*7d8fb588SMatthias Schmidt tp = xcalloc(1, sizeof *tp);
166*7d8fb588SMatthias Schmidt #ifdef _SX
167*7d8fb588SMatthias Schmidt tp->t_when = cur_time - ltp->tm_sec + dif_hour * 3600 + dif_min * 60;
168*7d8fb588SMatthias Schmidt #else /* _SX */
169*7d8fb588SMatthias Schmidt tp->t_when = cur_time - ltp->tm_sec + dif_hour * 3600L + dif_min * 60L;
170*7d8fb588SMatthias Schmidt #endif /* _SX */
171*7d8fb588SMatthias Schmidt /* use of tm_sec: get to beginning of minute. */
172*7d8fb588SMatthias Schmidt for (pp = &sched_ptr; *pp != NULL && tp->t_when >= (*pp)->t_when;
173*7d8fb588SMatthias Schmidt pp = &(*pp)->t_next)
174*7d8fb588SMatthias Schmidt ;
175*7d8fb588SMatthias Schmidt tp->t_next = *pp;
176*7d8fb588SMatthias Schmidt *pp = tp;
177*7d8fb588SMatthias Schmidt tp->t_lex = saveblk(v);
178*7d8fb588SMatthias Schmidt }
179*7d8fb588SMatthias Schmidt
180*7d8fb588SMatthias Schmidt /*
181*7d8fb588SMatthias Schmidt * Execute scheduled events
182*7d8fb588SMatthias Schmidt */
183*7d8fb588SMatthias Schmidt void
sched_run(void)184*7d8fb588SMatthias Schmidt sched_run(void)
185*7d8fb588SMatthias Schmidt {
186*7d8fb588SMatthias Schmidt time_t cur_time;
187*7d8fb588SMatthias Schmidt struct sched_event *tp;
188*7d8fb588SMatthias Schmidt struct wordent cmd, *nextword, *lastword;
189*7d8fb588SMatthias Schmidt struct command *t;
190*7d8fb588SMatthias Schmidt Char **v, *cp;
191*7d8fb588SMatthias Schmidt
192*7d8fb588SMatthias Schmidt pintr_disabled++;
193*7d8fb588SMatthias Schmidt cleanup_push(&pintr_disabled, disabled_cleanup);
194*7d8fb588SMatthias Schmidt
195*7d8fb588SMatthias Schmidt (void) time(&cur_time);
196*7d8fb588SMatthias Schmidt
197*7d8fb588SMatthias Schmidt /* bugfix by: Justin Bur at Universite de Montreal */
198*7d8fb588SMatthias Schmidt /*
199*7d8fb588SMatthias Schmidt * this test wouldn't be necessary if this routine were not called before
200*7d8fb588SMatthias Schmidt * each prompt (in sh.c). But it is, to catch missed alarms. Someone
201*7d8fb588SMatthias Schmidt * ought to fix it all up. -jbb
202*7d8fb588SMatthias Schmidt */
203*7d8fb588SMatthias Schmidt if (!(sched_ptr && sched_ptr->t_when < cur_time)) {
204*7d8fb588SMatthias Schmidt cleanup_until(&pintr_disabled);
205*7d8fb588SMatthias Schmidt return;
206*7d8fb588SMatthias Schmidt }
207*7d8fb588SMatthias Schmidt
208*7d8fb588SMatthias Schmidt if (GettingInput)
209*7d8fb588SMatthias Schmidt (void) Cookedmode();
210*7d8fb588SMatthias Schmidt
211*7d8fb588SMatthias Schmidt while ((tp = sched_ptr) != NULL && tp->t_when < cur_time) {
212*7d8fb588SMatthias Schmidt if (seterr) {
213*7d8fb588SMatthias Schmidt xfree(seterr);
214*7d8fb588SMatthias Schmidt seterr = NULL;
215*7d8fb588SMatthias Schmidt }
216*7d8fb588SMatthias Schmidt cmd.word = STRNULL;
217*7d8fb588SMatthias Schmidt lastword = &cmd;
218*7d8fb588SMatthias Schmidt v = tp->t_lex;
219*7d8fb588SMatthias Schmidt for (cp = *v; cp; cp = *++v) {
220*7d8fb588SMatthias Schmidt nextword = xcalloc(1, sizeof cmd);
221*7d8fb588SMatthias Schmidt nextword->word = Strsave(cp);
222*7d8fb588SMatthias Schmidt lastword->next = nextword;
223*7d8fb588SMatthias Schmidt nextword->prev = lastword;
224*7d8fb588SMatthias Schmidt lastword = nextword;
225*7d8fb588SMatthias Schmidt }
226*7d8fb588SMatthias Schmidt lastword->next = &cmd;
227*7d8fb588SMatthias Schmidt cmd.prev = lastword;
228*7d8fb588SMatthias Schmidt sched_ptr = tp->t_next; /* looping termination cond: */
229*7d8fb588SMatthias Schmidt blkfree(tp->t_lex); /* straighten out in case of */
230*7d8fb588SMatthias Schmidt xfree(tp); /* command blow-up. */
231*7d8fb588SMatthias Schmidt
232*7d8fb588SMatthias Schmidt cleanup_push(&cmd, lex_cleanup);
233*7d8fb588SMatthias Schmidt /* expand aliases like process() does. */
234*7d8fb588SMatthias Schmidt alias(&cmd);
235*7d8fb588SMatthias Schmidt /* build a syntax tree for the command. */
236*7d8fb588SMatthias Schmidt t = syntax(cmd.next, &cmd, 0);
237*7d8fb588SMatthias Schmidt cleanup_push(t, syntax_cleanup);
238*7d8fb588SMatthias Schmidt if (seterr)
239*7d8fb588SMatthias Schmidt stderror(ERR_OLD);
240*7d8fb588SMatthias Schmidt /* execute the parse tree. */
241*7d8fb588SMatthias Schmidt execute(t, -1, NULL, NULL, TRUE);
242*7d8fb588SMatthias Schmidt /* done. free the lex list and parse tree. */
243*7d8fb588SMatthias Schmidt cleanup_until(&cmd);
244*7d8fb588SMatthias Schmidt }
245*7d8fb588SMatthias Schmidt if (GettingInput && !just_signaled) { /* PWP */
246*7d8fb588SMatthias Schmidt (void) Rawmode();
247*7d8fb588SMatthias Schmidt ClearLines(); /* do a real refresh since something may */
248*7d8fb588SMatthias Schmidt ClearDisp(); /* have printed to the screen */
249*7d8fb588SMatthias Schmidt Refresh();
250*7d8fb588SMatthias Schmidt }
251*7d8fb588SMatthias Schmidt just_signaled = 0;
252*7d8fb588SMatthias Schmidt
253*7d8fb588SMatthias Schmidt cleanup_until(&pintr_disabled);
254*7d8fb588SMatthias Schmidt }
255