1992-08-19 03:54:46 +00:00
|
|
|
|
/* timer.c --- daemon to provide a tagged interval timer service
|
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
This little daemon runs forever waiting for commands to schedule events.
|
|
|
|
|
SIGALRM causes
|
1992-08-19 03:54:46 +00:00
|
|
|
|
it to check its queue for events attached to the current second; if
|
|
|
|
|
one is found, its label is written to stdout. SIGTERM causes it to
|
|
|
|
|
terminate, printing a list of pending events.
|
|
|
|
|
|
|
|
|
|
This program is intended to be used with the lisp package called
|
1994-01-19 15:12:34 +00:00
|
|
|
|
timer.el. The first such program was written anonymously in 1990.
|
|
|
|
|
This version was documented and rewritten for portability by
|
|
|
|
|
esr@snark.thyrsus.com, Aug 7 1992. */
|
1992-08-19 03:54:46 +00:00
|
|
|
|
|
1990-01-20 04:04:04 +00:00
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <signal.h>
|
1994-01-19 15:12:34 +00:00
|
|
|
|
#include <errno.h>
|
1990-01-20 04:04:04 +00:00
|
|
|
|
#include <sys/types.h> /* time_t */
|
|
|
|
|
|
1993-09-10 06:15:46 +00:00
|
|
|
|
#include <../src/config.h>
|
1994-01-19 15:12:34 +00:00
|
|
|
|
#undef read
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1993-06-01 08:08:11 +00:00
|
|
|
|
#ifdef LINUX
|
|
|
|
|
/* Perhaps this is correct unconditionally. */
|
|
|
|
|
#undef signal
|
|
|
|
|
#endif
|
1994-01-19 15:12:34 +00:00
|
|
|
|
#ifdef _CX_UX
|
|
|
|
|
/* I agree with the comment above, this probably should be unconditional (it
|
|
|
|
|
* is already unconditional in a couple of other files in this directory),
|
|
|
|
|
* but in the spirit of minimizing the effects of my port, I am making it
|
|
|
|
|
* conditional on _CX_UX.
|
|
|
|
|
*/
|
|
|
|
|
#undef signal
|
|
|
|
|
#endif
|
1993-06-01 08:08:11 +00:00
|
|
|
|
|
|
|
|
|
|
1990-01-20 04:04:04 +00:00
|
|
|
|
extern int errno;
|
1994-09-17 05:50:17 +00:00
|
|
|
|
extern char *strerror ();
|
1992-08-19 03:54:46 +00:00
|
|
|
|
extern time_t time ();
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
1992-08-12 12:57:12 +00:00
|
|
|
|
/*
|
1994-01-19 15:12:34 +00:00
|
|
|
|
* The field separator for input. This character shouldn't occur in dates,
|
|
|
|
|
* and should be printable so event strings are readable by people.
|
1992-08-12 12:57:12 +00:00
|
|
|
|
*/
|
|
|
|
|
#define FS '@'
|
|
|
|
|
|
|
|
|
|
struct event
|
1992-08-19 03:54:46 +00:00
|
|
|
|
{
|
1992-08-12 12:57:12 +00:00
|
|
|
|
char *token;
|
|
|
|
|
time_t reply_at;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
};
|
|
|
|
|
int events_size; /* How many slots have we allocated? */
|
|
|
|
|
int num_events; /* How many are actually scheduled? */
|
|
|
|
|
struct event *events; /* events[0 .. num_events-1] are the
|
|
|
|
|
valid events. */
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
char *pname; /* program name for error messages */
|
|
|
|
|
|
|
|
|
|
/* This buffer is used for reading commands.
|
|
|
|
|
We make it longer when necessary, but we never free it. */
|
|
|
|
|
char *buf;
|
|
|
|
|
/* This is the allocated size of buf. */
|
|
|
|
|
int buf_size;
|
|
|
|
|
|
|
|
|
|
/* Non-zero means don't handle an alarm now;
|
|
|
|
|
instead, just set alarm_deferred if an alarm happens.
|
|
|
|
|
We set this around parts of the program that call malloc and free. */
|
|
|
|
|
int defer_alarms;
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Non-zero if an alarm came in during the reading of a command. */
|
|
|
|
|
int alarm_deferred;
|
|
|
|
|
|
|
|
|
|
/* Schedule one event, and arrange an alarm for it.
|
|
|
|
|
STR is a string of two fields separated by FS.
|
1993-05-15 23:05:46 +00:00
|
|
|
|
First field is string for get_date, saying when to wake-up.
|
1992-08-19 03:54:46 +00:00
|
|
|
|
Second field is a token to identify the request. */
|
1994-01-19 15:12:34 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
void
|
|
|
|
|
schedule (str)
|
|
|
|
|
char *str;
|
1990-01-20 04:04:04 +00:00
|
|
|
|
{
|
1993-05-15 23:05:46 +00:00
|
|
|
|
extern time_t get_date ();
|
1992-08-19 03:54:46 +00:00
|
|
|
|
extern char *strcpy ();
|
|
|
|
|
time_t now;
|
|
|
|
|
register char *p;
|
|
|
|
|
static struct event *ep;
|
1994-01-19 15:12:34 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
/* check entry format */
|
|
|
|
|
for (p = str; *p && *p != FS; p++)
|
|
|
|
|
continue;
|
|
|
|
|
if (!*p)
|
1992-08-12 12:57:12 +00:00
|
|
|
|
{
|
1993-01-08 21:12:58 +00:00
|
|
|
|
fprintf (stderr, "%s: bad input format: %s\n", pname, str);
|
1992-08-19 03:54:46 +00:00
|
|
|
|
return;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
}
|
1992-08-19 03:54:46 +00:00
|
|
|
|
*p++ = 0;
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
/* allocate an event slot */
|
|
|
|
|
ep = events + num_events;
|
|
|
|
|
|
|
|
|
|
/* If the event array is full, stretch it. After stretching, we know
|
|
|
|
|
that ep will be pointing to an available event spot. */
|
|
|
|
|
if (ep == events + events_size)
|
1992-08-12 12:57:12 +00:00
|
|
|
|
{
|
1992-08-19 03:54:46 +00:00
|
|
|
|
int old_size = events_size;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
events_size *= 2;
|
|
|
|
|
events = ((struct event *)
|
|
|
|
|
realloc (events, events_size * sizeof (struct event)));
|
|
|
|
|
if (! events)
|
|
|
|
|
{
|
|
|
|
|
fprintf (stderr, "%s: virtual memory exhausted.\n", pname);
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Since there is so much virtual memory, and running out
|
|
|
|
|
almost surely means something is very very wrong,
|
|
|
|
|
it is best to exit rather than continue. */
|
|
|
|
|
exit (1);
|
1992-08-19 03:54:46 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
while (old_size < events_size)
|
|
|
|
|
events[old_size++].token = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Don't allow users to schedule events in past time. */
|
|
|
|
|
ep->reply_at = get_date (str, NULL);
|
|
|
|
|
if (ep->reply_at - time (&now) < 0)
|
|
|
|
|
{
|
1993-01-08 21:12:58 +00:00
|
|
|
|
fprintf (stderr, "%s: bad time spec: %s%c%s\n", pname, str, FS, p);
|
1992-08-19 03:54:46 +00:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* save the event description */
|
|
|
|
|
ep->token = (char *) malloc ((unsigned) strlen (p) + 1);
|
|
|
|
|
if (! ep->token)
|
|
|
|
|
{
|
1993-01-08 21:12:58 +00:00
|
|
|
|
fprintf (stderr, "%s: malloc %s: %s%c%s\n",
|
1994-01-08 21:52:28 +00:00
|
|
|
|
pname, strerror (errno), str, FS, p);
|
1992-08-19 03:54:46 +00:00
|
|
|
|
return;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
}
|
1992-08-19 03:54:46 +00:00
|
|
|
|
|
|
|
|
|
strcpy (ep->token, p);
|
|
|
|
|
num_events++;
|
1990-01-20 04:04:04 +00:00
|
|
|
|
}
|
1994-01-19 15:12:34 +00:00
|
|
|
|
|
|
|
|
|
/* Print the notification for the alarmed event just arrived if any,
|
|
|
|
|
and schedule an alarm for the next event if any. */
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
|
|
|
|
void
|
1992-08-19 03:54:46 +00:00
|
|
|
|
notify ()
|
1990-01-20 04:04:04 +00:00
|
|
|
|
{
|
1993-03-02 08:25:47 +00:00
|
|
|
|
time_t now, tdiff, waitfor = -1;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
register struct event *ep;
|
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Inhibit interference with alarms while changing global vars. */
|
|
|
|
|
defer_alarms = 1;
|
|
|
|
|
alarm_deferred = 0;
|
1993-04-27 21:59:39 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
now = time ((time_t *) NULL);
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
for (ep = events; ep < events + num_events; ep++)
|
|
|
|
|
/* Are any events ready to fire? */
|
|
|
|
|
if (ep->reply_at <= now)
|
|
|
|
|
{
|
|
|
|
|
fputs (ep->token, stdout);
|
1993-01-08 20:36:35 +00:00
|
|
|
|
putc ('\n', stdout);
|
1993-01-08 20:26:54 +00:00
|
|
|
|
fflush (stdout);
|
1992-08-19 03:54:46 +00:00
|
|
|
|
free (ep->token);
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
/* We now have a hole in the event array; fill it with the last
|
|
|
|
|
event. */
|
1993-04-27 21:59:39 +00:00
|
|
|
|
ep->token = events[num_events - 1].token;
|
|
|
|
|
ep->reply_at = events[num_events - 1].reply_at;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
num_events--;
|
|
|
|
|
|
|
|
|
|
/* We ought to scan this event again. */
|
|
|
|
|
ep--;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* next timeout should be the soonest of any remaining */
|
|
|
|
|
if ((tdiff = ep->reply_at - now) < waitfor || waitfor < 0)
|
|
|
|
|
waitfor = (long)tdiff;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If there are no more events, we needn't bother setting an alarm. */
|
|
|
|
|
if (num_events > 0)
|
|
|
|
|
alarm (waitfor);
|
1993-04-27 21:59:39 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Now check if there was another alarm
|
|
|
|
|
while we were handling an explicit request. */
|
|
|
|
|
defer_alarms = 0;
|
|
|
|
|
if (alarm_deferred)
|
|
|
|
|
notify ();
|
|
|
|
|
alarm_deferred = 0;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
}
|
1994-01-19 15:12:34 +00:00
|
|
|
|
|
|
|
|
|
/* Read one command from command from standard input
|
|
|
|
|
and schedule the event for it. */
|
1992-08-19 03:54:46 +00:00
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
getevent ()
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
/* In principle the itimer should be disabled on entry to this
|
|
|
|
|
function, but it really doesn't make any important difference
|
|
|
|
|
if it isn't. */
|
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
if (buf == 0)
|
|
|
|
|
{
|
|
|
|
|
buf_size = 80;
|
|
|
|
|
buf = (char *) malloc (buf_size);
|
|
|
|
|
}
|
1992-08-19 03:54:46 +00:00
|
|
|
|
|
|
|
|
|
/* Read a line from standard input, expanding buf if it is too short
|
|
|
|
|
to hold the line. */
|
|
|
|
|
for (i = 0; ; i++)
|
|
|
|
|
{
|
1994-01-19 15:12:34 +00:00
|
|
|
|
char c;
|
|
|
|
|
int nread;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
|
|
|
|
|
if (i >= buf_size)
|
1992-08-12 12:57:12 +00:00
|
|
|
|
{
|
1992-08-19 03:54:46 +00:00
|
|
|
|
buf_size *= 2;
|
1994-01-19 15:12:34 +00:00
|
|
|
|
alarm_deferred = 0;
|
|
|
|
|
defer_alarms = 1;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
buf = (char *) realloc (buf, buf_size);
|
1994-01-19 15:12:34 +00:00
|
|
|
|
defer_alarms = 0;
|
|
|
|
|
if (alarm_deferred)
|
|
|
|
|
notify ();
|
|
|
|
|
alarm_deferred = 0;
|
|
|
|
|
}
|
1992-08-19 03:54:46 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Read one character into c. */
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
|
|
|
|
nread = read (fileno (stdin), &c, 1);
|
|
|
|
|
|
|
|
|
|
/* Retry after transient error. */
|
|
|
|
|
if (nread < 0
|
|
|
|
|
&& (1
|
|
|
|
|
#ifdef EINTR
|
|
|
|
|
|| errno == EINTR
|
|
|
|
|
#endif
|
|
|
|
|
#ifdef EAGAIN
|
|
|
|
|
|| errno == EAGAIN
|
|
|
|
|
#endif
|
|
|
|
|
))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
/* Report serious errors. */
|
|
|
|
|
if (nread < 0)
|
1992-08-12 12:57:12 +00:00
|
|
|
|
{
|
1994-01-19 15:12:34 +00:00
|
|
|
|
perror ("read");
|
|
|
|
|
exit (1);
|
1992-08-12 12:57:12 +00:00
|
|
|
|
}
|
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* On eof, exit. */
|
|
|
|
|
if (nread == 0)
|
|
|
|
|
exit (0);
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
break;
|
|
|
|
|
}
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
if (c == '\n')
|
|
|
|
|
{
|
|
|
|
|
buf[i] = '\0';
|
|
|
|
|
break;
|
|
|
|
|
}
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
buf[i] = c;
|
|
|
|
|
}
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
/* Register the event. */
|
1994-01-19 15:12:34 +00:00
|
|
|
|
alarm_deferred = 0;
|
|
|
|
|
defer_alarms = 1;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
schedule (buf);
|
1994-01-19 15:12:34 +00:00
|
|
|
|
defer_alarms = 0;
|
1992-08-19 03:54:46 +00:00
|
|
|
|
notify ();
|
1994-01-19 15:12:34 +00:00
|
|
|
|
alarm_deferred = 0;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
}
|
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Handle incoming signal SIG. */
|
|
|
|
|
|
1993-03-11 07:00:12 +00:00
|
|
|
|
SIGTYPE
|
1992-08-19 03:54:46 +00:00
|
|
|
|
sigcatch (sig)
|
|
|
|
|
int sig;
|
1990-01-20 04:04:04 +00:00
|
|
|
|
{
|
1992-08-19 03:54:46 +00:00
|
|
|
|
struct event *ep;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* required on older UNIXes; harmless on newer ones */
|
|
|
|
|
signal (sig, sigcatch);
|
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
switch (sig)
|
1992-08-12 12:57:12 +00:00
|
|
|
|
{
|
|
|
|
|
case SIGALRM:
|
1994-01-19 15:12:34 +00:00
|
|
|
|
if (defer_alarms)
|
|
|
|
|
alarm_deferred = 1;
|
|
|
|
|
else
|
|
|
|
|
notify ();
|
1992-08-19 03:54:46 +00:00
|
|
|
|
break;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
case SIGTERM:
|
1992-08-19 03:54:46 +00:00
|
|
|
|
fprintf (stderr, "Events still queued:\n");
|
|
|
|
|
for (ep = events; ep < events + num_events; ep++)
|
1993-01-08 21:12:58 +00:00
|
|
|
|
fprintf (stderr, "%d = %ld @ %s\n",
|
1992-08-19 03:54:46 +00:00
|
|
|
|
ep - events, ep->reply_at, ep->token);
|
|
|
|
|
exit (0);
|
|
|
|
|
break;
|
1992-08-12 12:57:12 +00:00
|
|
|
|
}
|
1990-01-20 04:04:04 +00:00
|
|
|
|
}
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1990-01-20 04:04:04 +00:00
|
|
|
|
/*ARGSUSED*/
|
|
|
|
|
int
|
1992-08-19 03:54:46 +00:00
|
|
|
|
main (argc, argv)
|
1990-01-20 04:04:04 +00:00
|
|
|
|
int argc;
|
|
|
|
|
char **argv;
|
|
|
|
|
{
|
1992-08-19 03:54:46 +00:00
|
|
|
|
for (pname = argv[0] + strlen (argv[0]);
|
|
|
|
|
*pname != '/' && pname != argv[0];
|
1990-01-20 04:04:04 +00:00
|
|
|
|
pname--);
|
1992-08-19 03:54:46 +00:00
|
|
|
|
if (*pname == '/')
|
|
|
|
|
pname++;
|
|
|
|
|
|
|
|
|
|
events_size = 16;
|
|
|
|
|
events = ((struct event *) malloc (events_size * sizeof (*events)));
|
|
|
|
|
num_events = 0;
|
1990-01-20 04:04:04 +00:00
|
|
|
|
|
1992-08-19 03:54:46 +00:00
|
|
|
|
signal (SIGALRM, sigcatch);
|
|
|
|
|
signal (SIGTERM, sigcatch);
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1994-01-19 15:12:34 +00:00
|
|
|
|
/* Loop reading commands from standard input
|
|
|
|
|
and scheduling alarms accordingly.
|
|
|
|
|
The alarms are handled asynchronously, while we wait for commands. */
|
|
|
|
|
while (1)
|
|
|
|
|
getevent ();
|
1990-01-20 04:04:04 +00:00
|
|
|
|
}
|
1994-01-08 22:27:30 +00:00
|
|
|
|
|
|
|
|
|
#ifndef HAVE_STRERROR
|
|
|
|
|
char *
|
|
|
|
|
strerror (errnum)
|
|
|
|
|
int errnum;
|
|
|
|
|
{
|
|
|
|
|
extern char *sys_errlist[];
|
|
|
|
|
extern int sys_nerr;
|
|
|
|
|
|
|
|
|
|
if (errnum >= 0 && errnum < sys_nerr)
|
|
|
|
|
return sys_errlist[errnum];
|
|
|
|
|
return (char *) "Unknown error";
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* ! HAVE_STRERROR */
|
1992-08-12 12:57:12 +00:00
|
|
|
|
|
1994-07-13 19:10:27 +00:00
|
|
|
|
long *
|
|
|
|
|
xmalloc (size)
|
|
|
|
|
int size;
|
|
|
|
|
{
|
|
|
|
|
register long *val;
|
|
|
|
|
|
|
|
|
|
val = (long *) malloc (size);
|
|
|
|
|
|
|
|
|
|
if (!val && size)
|
|
|
|
|
{
|
|
|
|
|
fprintf (stderr, "timer: virtual memory exceeded\n");
|
|
|
|
|
exit (1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return val;
|
|
|
|
|
}
|
|
|
|
|
|
1992-08-12 12:57:12 +00:00
|
|
|
|
/* timer.c ends here */
|