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