Do not use .Xo/.Xc to work around ancient roff limits.
[netbsd-mini2440.git] / libexec / cron / job.c
blob8cddf2d606681a78b90cd49aa15bfadce89cb49a
1 /* Copyright 1988,1990,1993 by Paul Vixie
2 * All rights reserved
4 * Distribute freely, except: don't remove my name from the source or
5 * documentation (don't take credit for my work), mark your changes (don't
6 * get me blamed for your possible bugs), don't alter or remove this
7 * notice. May be sold if buildable source is provided to buyer. No
8 * warrantee of any kind, express or implied, is included with this
9 * software; use at your own risk, responsibility for damages (if any) to
10 * anyone resulting from the use of this software rests entirely with the
11 * user.
13 * Send bug reports, bug fixes, enhancements, requests, flames, etc., and
14 * I'll try to keep a version up to date. I can be reached as follows:
15 * Paul Vixie <paul@vix.com> uunet!decwrl!vixie!paul
18 #if !defined(lint) && !defined(LINT)
19 static char rcsid[] = "$Id: job.c,v 1.1 1994/01/05 20:40:15 jtc Exp $";
20 #endif
23 #include "cron.h"
24 #include "externs.h"
27 typedef struct _job {
28 struct _job *next;
29 entry *e;
30 user *u;
31 } job;
34 static job *jhead = NULL, *jtail = NULL;
37 void
38 job_add(e, u)
39 register entry *e;
40 register user *u;
42 register job *j;
44 /* if already on queue, keep going */
45 for (j=jhead; j; j=j->next)
46 if (j->e == e && j->u == u) { return; }
48 /* build a job queue element */
49 j = (job*)malloc(sizeof(job));
50 j->next = (job*) NULL;
51 j->e = e;
52 j->u = u;
54 /* add it to the tail */
55 if (!jhead) { jhead=j; }
56 else { jtail->next=j; }
57 jtail = j;
61 int
62 job_runqueue()
64 register job *j, *jn;
65 register int run = 0;
67 for (j=jhead; j; j=jn) {
68 do_command(j->e, j->u);
69 jn = j->next;
70 free(j);
71 run++;
73 jhead = jtail = NULL;
74 return run;