/* Copyright 1988,1990,1993,1994 by Paul Vixie
 * All rights reserved
 */

/*
 * Copyright (c) 1997 by Internet Software Consortium
 *
 * 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 INTERNET SOFTWARE CONSORTIUM DISCLAIMS
 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
 * CONSORTIUM 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 "cron.h"


typedef struct _job {
        struct _job     *next;
        entry           *e;
        user            *u;
} job;


static job      *jhead = NULL, *jtail = NULL;


void
job_add(entry *e, user *u)
{
        job *j;

        /* if already on queue, keep going */
        for (j = jhead; j != NULL; j = j->next)
                if (j->e == e && j->u == u)
                        return;

        /* build a job queue element */
        if ((j = (job*)malloc(sizeof(job))) == NULL)
                return;
        j->next = (job*) NULL;
        j->e = e;
        j->u = u;

        /* add it to the tail */
        if (jhead == NULL)
                jhead = j;
        else
                jtail->next = j;
        jtail = j;
}


int
job_runqueue(void)
{
        job     *j, *jn;
        int     run = 0;

        for (j = jhead; j; j = jn) {
                do_command(j->e, j->u);
                jn = j->next;
                free(j);
                run++;
        }
        jhead = jtail = NULL;
        return (run);
}