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
|
/* $OpenBSD: job.c,v 1.13 2015/11/09 01:12:27 millert Exp $ */
/* Copyright 1988,1990,1993,1994 by Paul Vixie
* Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
* Copyright (c) 1997,2000 by Internet Software Consortium, Inc.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <bitstring.h> /* for structs.h */
#include <stdio.h>
#include <stdlib.h>
#include <time.h> /* for structs.h */
#include "macros.h"
#include "structs.h"
#include "funcs.h"
typedef struct _job {
SIMPLEQ_ENTRY(_job) entries;
entry *e;
user *u;
} job;
static SIMPLEQ_HEAD(job_queue, _job) jobs = SIMPLEQ_HEAD_INITIALIZER(jobs);
void
job_add(entry *e, user *u)
{
job *j;
/* if already on queue, keep going */
SIMPLEQ_FOREACH(j, &jobs, entries)
if (j->e == e && j->u == u)
return;
/* build a job queue element */
if ((j = malloc(sizeof(job))) == NULL)
return;
j->e = e;
j->u = u;
/* add it to the tail */
SIMPLEQ_INSERT_TAIL(&jobs, j, entries);
}
int
job_runqueue(void)
{
job *j;
int run = 0;
while ((j = SIMPLEQ_FIRST(&jobs))) {
SIMPLEQ_REMOVE_HEAD(&jobs, entries);
do_command(j->e, j->u);
free(j);
run++;
}
return (run);
}
|
