1 /* 2 * Copyright (c) 1980, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 20 * 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 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 #if 0 36 static char sccsid[] = "@(#)schedule.c 8.1 (Berkeley) 5/31/93"; 37 #endif 38 static const char rcsid[] = 39 "$FreeBSD: src/games/trek/schedule.c,v 1.4 1999/11/30 03:49:53 billf Exp $"; 40 #endif /* not lint */ 41 42 # include "trek.h" 43 44 /* 45 ** SCHEDULE AN EVENT 46 ** 47 ** An event of type 'type' is scheduled for time NOW + 'offset' 48 ** into the first available slot. 'x', 'y', and 'z' are 49 ** considered the attributes for this event. 50 ** 51 ** The address of the slot is returned. 52 */ 53 54 struct event *schedule(type, offset, x, y, z) 55 int type; 56 double offset; 57 char x, y; 58 char z; 59 { 60 struct event *e; 61 int i; 62 double date; 63 64 date = Now.date + offset; 65 for (i = 0; i < MAXEVENTS; i++) 66 { 67 e = &Event[i]; 68 if (e->evcode) 69 continue; 70 /* got a slot */ 71 # ifdef xTRACE 72 if (Trace) 73 printf("schedule: type %d @ %.2f slot %d parm %d %d %d\n", 74 type, date, i, x, y, z); 75 # endif 76 e->evcode = type; 77 e->date = date; 78 e->x = x; 79 e->y = y; 80 e->systemname = z; 81 Now.eventptr[type] = e; 82 return (e); 83 } 84 syserr("Cannot schedule event %d parm %d %d %d", type, x, y, z); 85 } 86 87 88 /* 89 ** RESCHEDULE AN EVENT 90 ** 91 ** The event pointed to by 'e' is rescheduled to the current 92 ** time plus 'offset'. 93 */ 94 95 reschedule(e1, offset) 96 struct event *e1; 97 double offset; 98 { 99 double date; 100 struct event *e; 101 102 e = e1; 103 104 date = Now.date + offset; 105 e->date = date; 106 # ifdef xTRACE 107 if (Trace) 108 printf("reschedule: type %d parm %d %d %d @ %.2f\n", 109 e->evcode, e->x, e->y, e->systemname, date); 110 # endif 111 return; 112 } 113 114 115 /* 116 ** UNSCHEDULE AN EVENT 117 ** 118 ** The event at slot 'e' is deleted. 119 */ 120 121 unschedule(e1) 122 struct event *e1; 123 { 124 struct event *e; 125 126 e = e1; 127 128 # ifdef xTRACE 129 if (Trace) 130 printf("unschedule: type %d @ %.2f parm %d %d %d\n", 131 e->evcode, e->date, e->x, e->y, e->systemname); 132 # endif 133 Now.eventptr[e->evcode & E_EVENT] = 0; 134 e->date = 1e50; 135 e->evcode = 0; 136 return; 137 } 138 139 140 /* 141 ** Abreviated schedule routine 142 ** 143 ** Parameters are the event index and a factor for the time 144 ** figure. 145 */ 146 147 struct event *xsched(ev1, factor, x, y, z) 148 int ev1; 149 int factor; 150 int x, y, z; 151 { 152 int ev; 153 154 ev = ev1; 155 return (schedule(ev, -Param.eventdly[ev] * Param.time * log(franf()) / factor, x, y, z)); 156 } 157 158 159 /* 160 ** Simplified reschedule routine 161 ** 162 ** Parameters are the event index, the initial date, and the 163 ** division factor. Look at the code to see what really happens. 164 */ 165 166 xresched(e1, ev1, factor) 167 struct event *e1; 168 int ev1; 169 int factor; 170 { 171 int ev; 172 struct event *e; 173 174 ev = ev1; 175 e = e1; 176 reschedule(e, -Param.eventdly[ev] * Param.time * log(franf()) / factor); 177 } 178