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