2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)schedule.c 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/games/trek/schedule.c,v 1.4 1999/11/30 03:49:53 billf Exp $
35 * $DragonFly: src/games/trek/schedule.c,v 1.2 2003/06/17 04:25:25 dillon Exp $
43 ** An event of type 'type' is scheduled for time NOW + 'offset'
44 ** into the first available slot. 'x', 'y', and 'z' are
45 ** considered the attributes for this event.
47 ** The address of the slot is returned.
50 struct event *schedule(type, offset, x, y, z)
60 date = Now.date + offset;
61 for (i = 0; i < MAXEVENTS; i++)
69 printf("schedule: type %d @ %.2f slot %d parm %d %d %d\n",
70 type, date, i, x, y, z);
77 Now.eventptr[type] = e;
80 syserr("Cannot schedule event %d parm %d %d %d", type, x, y, z);
85 ** RESCHEDULE AN EVENT
87 ** The event pointed to by 'e' is rescheduled to the current
88 ** time plus 'offset'.
91 reschedule(e1, offset)
100 date = Now.date + offset;
104 printf("reschedule: type %d parm %d %d %d @ %.2f\n",
105 e->evcode, e->x, e->y, e->systemname, date);
112 ** UNSCHEDULE AN EVENT
114 ** The event at slot 'e' is deleted.
126 printf("unschedule: type %d @ %.2f parm %d %d %d\n",
127 e->evcode, e->date, e->x, e->y, e->systemname);
129 Now.eventptr[e->evcode & E_EVENT] = 0;
137 ** Abreviated schedule routine
139 ** Parameters are the event index and a factor for the time
143 struct event *xsched(ev1, factor, x, y, z)
151 return (schedule(ev, -Param.eventdly[ev] * Param.time * log(franf()) / factor, x, y, z));
156 ** Simplified reschedule routine
158 ** Parameters are the event index, the initial date, and the
159 ** division factor. Look at the code to see what really happens.
162 xresched(e1, ev1, factor)
172 reschedule(e, -Param.eventdly[ev] * Param.time * log(franf()) / factor);