schedule.c revision 1.5 1 1.5 agc /* $NetBSD: schedule.c,v 1.5 2003/08/07 09:37:53 agc Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.5 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.4 christos #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.3 cgd #if 0
35 1.3 cgd static char sccsid[] = "@(#)schedule.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.5 agc __RCSID("$NetBSD: schedule.c,v 1.5 2003/08/07 09:37:53 agc Exp $");
38 1.3 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.4 christos #include <stdio.h>
42 1.4 christos #include <math.h>
43 1.4 christos #include <err.h>
44 1.4 christos #include "trek.h"
45 1.1 cgd
46 1.1 cgd /*
47 1.1 cgd ** SCHEDULE AN EVENT
48 1.1 cgd **
49 1.1 cgd ** An event of type 'type' is scheduled for time NOW + 'offset'
50 1.1 cgd ** into the first available slot. 'x', 'y', and 'z' are
51 1.1 cgd ** considered the attributes for this event.
52 1.1 cgd **
53 1.1 cgd ** The address of the slot is returned.
54 1.1 cgd */
55 1.1 cgd
56 1.1 cgd struct event *schedule(type, offset, x, y, z)
57 1.1 cgd int type;
58 1.1 cgd double offset;
59 1.1 cgd char x, y;
60 1.1 cgd char z;
61 1.1 cgd {
62 1.4 christos struct event *e;
63 1.4 christos int i;
64 1.1 cgd double date;
65 1.1 cgd
66 1.1 cgd date = Now.date + offset;
67 1.1 cgd for (i = 0; i < MAXEVENTS; i++)
68 1.1 cgd {
69 1.1 cgd e = &Event[i];
70 1.1 cgd if (e->evcode)
71 1.1 cgd continue;
72 1.1 cgd /* got a slot */
73 1.1 cgd # ifdef xTRACE
74 1.1 cgd if (Trace)
75 1.1 cgd printf("schedule: type %d @ %.2f slot %d parm %d %d %d\n",
76 1.1 cgd type, date, i, x, y, z);
77 1.1 cgd # endif
78 1.1 cgd e->evcode = type;
79 1.1 cgd e->date = date;
80 1.1 cgd e->x = x;
81 1.1 cgd e->y = y;
82 1.1 cgd e->systemname = z;
83 1.1 cgd Now.eventptr[type] = e;
84 1.1 cgd return (e);
85 1.1 cgd }
86 1.4 christos errx(1, "Cannot schedule event %d parm %d %d %d", type, x, y, z);
87 1.1 cgd }
88 1.1 cgd
89 1.1 cgd
90 1.1 cgd /*
91 1.1 cgd ** RESCHEDULE AN EVENT
92 1.1 cgd **
93 1.1 cgd ** The event pointed to by 'e' is rescheduled to the current
94 1.1 cgd ** time plus 'offset'.
95 1.1 cgd */
96 1.1 cgd
97 1.4 christos void
98 1.1 cgd reschedule(e1, offset)
99 1.1 cgd struct event *e1;
100 1.1 cgd double offset;
101 1.1 cgd {
102 1.1 cgd double date;
103 1.4 christos struct event *e;
104 1.1 cgd
105 1.1 cgd e = e1;
106 1.1 cgd
107 1.1 cgd date = Now.date + offset;
108 1.1 cgd e->date = date;
109 1.1 cgd # ifdef xTRACE
110 1.1 cgd if (Trace)
111 1.1 cgd printf("reschedule: type %d parm %d %d %d @ %.2f\n",
112 1.1 cgd e->evcode, e->x, e->y, e->systemname, date);
113 1.1 cgd # endif
114 1.1 cgd return;
115 1.1 cgd }
116 1.1 cgd
117 1.1 cgd
118 1.1 cgd /*
119 1.1 cgd ** UNSCHEDULE AN EVENT
120 1.1 cgd **
121 1.1 cgd ** The event at slot 'e' is deleted.
122 1.1 cgd */
123 1.1 cgd
124 1.4 christos void
125 1.1 cgd unschedule(e1)
126 1.1 cgd struct event *e1;
127 1.1 cgd {
128 1.4 christos struct event *e;
129 1.1 cgd
130 1.1 cgd e = e1;
131 1.1 cgd
132 1.1 cgd # ifdef xTRACE
133 1.1 cgd if (Trace)
134 1.1 cgd printf("unschedule: type %d @ %.2f parm %d %d %d\n",
135 1.1 cgd e->evcode, e->date, e->x, e->y, e->systemname);
136 1.1 cgd # endif
137 1.1 cgd Now.eventptr[e->evcode & E_EVENT] = 0;
138 1.1 cgd e->date = 1e50;
139 1.1 cgd e->evcode = 0;
140 1.1 cgd return;
141 1.1 cgd }
142 1.1 cgd
143 1.1 cgd
144 1.1 cgd /*
145 1.1 cgd ** Abreviated schedule routine
146 1.1 cgd **
147 1.1 cgd ** Parameters are the event index and a factor for the time
148 1.1 cgd ** figure.
149 1.1 cgd */
150 1.1 cgd
151 1.1 cgd struct event *xsched(ev1, factor, x, y, z)
152 1.1 cgd int ev1;
153 1.1 cgd int factor;
154 1.1 cgd int x, y, z;
155 1.1 cgd {
156 1.4 christos int ev;
157 1.1 cgd
158 1.1 cgd ev = ev1;
159 1.1 cgd return (schedule(ev, -Param.eventdly[ev] * Param.time * log(franf()) / factor, x, y, z));
160 1.1 cgd }
161 1.1 cgd
162 1.1 cgd
163 1.1 cgd /*
164 1.1 cgd ** Simplified reschedule routine
165 1.1 cgd **
166 1.1 cgd ** Parameters are the event index, the initial date, and the
167 1.1 cgd ** division factor. Look at the code to see what really happens.
168 1.1 cgd */
169 1.1 cgd
170 1.4 christos void
171 1.1 cgd xresched(e1, ev1, factor)
172 1.1 cgd struct event *e1;
173 1.1 cgd int ev1;
174 1.1 cgd int factor;
175 1.1 cgd {
176 1.4 christos int ev;
177 1.4 christos struct event *e;
178 1.1 cgd
179 1.1 cgd ev = ev1;
180 1.1 cgd e = e1;
181 1.1 cgd reschedule(e, -Param.eventdly[ev] * Param.time * log(franf()) / factor);
182 1.1 cgd }
183