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 * @(#)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.3 2006/09/07 21:19:44 pavalos Exp $ 36 */ 37 38 # include "trek.h" 39 40 /* 41 ** SCHEDULE AN EVENT 42 ** 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. 46 ** 47 ** The address of the slot is returned. 48 */ 49 50 struct event * 51 schedule(int type, double offset, char x, char y, char z) 52 { 53 struct event *e; 54 int i; 55 double date; 56 57 date = Now.date + offset; 58 for (i = 0; i < MAXEVENTS; i++) 59 { 60 e = &Event[i]; 61 if (e->evcode) 62 continue; 63 /* got a slot */ 64 # ifdef xTRACE 65 if (Trace) 66 printf("schedule: type %d @ %.2f slot %d parm %d %d %d\n", 67 type, date, i, x, y, z); 68 # endif 69 e->evcode = type; 70 e->date = date; 71 e->x = x; 72 e->y = y; 73 e->systemname = z; 74 Now.eventptr[type] = e; 75 return (e); 76 } 77 syserr("Cannot schedule event %d parm %d %d %d", type, x, y, z); 78 /* NOTREACHED */ 79 return(NULL); 80 } 81 82 83 /* 84 ** RESCHEDULE AN EVENT 85 ** 86 ** The event pointed to by 'e' is rescheduled to the current 87 ** time plus 'offset'. 88 */ 89 90 void 91 reschedule(struct event *e1, double offset) 92 { 93 double date; 94 struct event *e; 95 96 e = e1; 97 98 date = Now.date + offset; 99 e->date = date; 100 # ifdef xTRACE 101 if (Trace) 102 printf("reschedule: type %d parm %d %d %d @ %.2f\n", 103 e->evcode, e->x, e->y, e->systemname, date); 104 # endif 105 return; 106 } 107 108 109 /* 110 ** UNSCHEDULE AN EVENT 111 ** 112 ** The event at slot 'e' is deleted. 113 */ 114 115 void 116 unschedule(struct event *e1) 117 { 118 struct event *e; 119 120 e = e1; 121 122 # ifdef xTRACE 123 if (Trace) 124 printf("unschedule: type %d @ %.2f parm %d %d %d\n", 125 e->evcode, e->date, e->x, e->y, e->systemname); 126 # endif 127 Now.eventptr[e->evcode & E_EVENT] = 0; 128 e->date = 1e50; 129 e->evcode = 0; 130 return; 131 } 132 133 134 /* 135 ** Abreviated schedule routine 136 ** 137 ** Parameters are the event index and a factor for the time 138 ** figure. 139 */ 140 141 struct event * 142 xsched(int ev1, int factor, int x, int y, int z) 143 { 144 int ev; 145 146 ev = ev1; 147 return (schedule(ev, -Param.eventdly[ev] * Param.time * log(franf()) / factor, x, y, z)); 148 } 149 150 151 /* 152 ** Simplified reschedule routine 153 ** 154 ** Parameters are the event index, the initial date, and the 155 ** division factor. Look at the code to see what really happens. 156 */ 157 158 void 159 xresched(struct event *e1, int ev1, int factor) 160 { 161 int ev; 162 struct event *e; 163 164 ev = ev1; 165 e = e1; 166 reschedule(e, -Param.eventdly[ev] * Param.time * log(franf()) / factor); 167 } 168