1/* $KAME: schedule.h,v 1.12 2001/03/06 20:41:02 thorpej Exp $ */ 2 3/* 4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the project nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32#include <sys/queue.h> 33 34/* scheduling table */ 35/* the head is the nearest event. */ 36struct sched { 37 time_t xtime; /* event time which is as time(3). */ 38 /* 39 * if defined FIXY2038PROBLEM, this time 40 * is from the time when called sched_init(). 41 */ 42 void (*func) __P((void *)); /* call this function when timeout. */ 43 void *param; /* pointer to parameter */ 44 45 int dead; /* dead or alive */ 46 long id; /* for debug */ 47 time_t created; /* for debug */ 48 time_t tick; /* for debug */ 49 50 TAILQ_ENTRY(sched) chain; 51}; 52 53/* cancel schedule */ 54#define SCHED_KILL(s) \ 55do { \ 56 sched_kill(s); \ 57 s = NULL; \ 58} while(0) 59 60/* must be called after it's called from scheduler. */ 61#define SCHED_INIT(s) (s) = NULL 62 63struct scheddump { 64 time_t xtime; 65 long id; 66 time_t created; 67 time_t tick; 68}; 69 70struct timeval *schedular __P((void)); 71struct sched *sched_new __P((time_t, void (*func) __P((void *)), void *)); 72void sched_kill __P((struct sched *)); 73int sched_dump __P((caddr_t *, int *)); 74void sched_init __P((void)); 75void sched_scrub_param __P((void *)); 76