2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 #include <afsconfig.h>
12 #include "afs/param.h"
14 #include <afs/param.h>
18 #include <sys/time_impl.h>
26 #include "afs/afs_osi.h"
28 #include "afs/sysincludes.h"
29 #include "afsincludes.h"
31 #include "rx/rx_clock.h"
32 #include "rx/rx_queue.h"
33 #include "rx/rx_event.h"
34 #include "rx/rx_kernel.h"
35 #include "rx_kmutex.h"
36 #ifdef RX_ENABLE_LOCKS
38 #endif /* RX_ENABLE_LOCKS */
39 #include "rx/rx_globals.h"
40 #if defined(AFS_SGI_ENV)
41 #include "sys/debug.h"
42 /* These are necessary to get curproc (used by GLOCK asserts) to work. */
44 #if !defined(AFS_SGI64_ENV) && !defined(UKERNEL)
47 extern void *osi_Alloc();
49 #if defined(AFS_OBSD_ENV)
58 #ifdef AFS_PTHREAD_ENV
59 #include <rx/rx_pthread.h>
63 #ifdef RX_ENABLE_LOCKS
65 #endif /* RX_ENABLE_LOCKS */
66 #include "rx_globals.h"
73 /* All event processing is relative to the apparent current time given by clock_GetTime */
75 /* This should be static, but event_test wants to look at the free list... */
76 struct rx_queue rxevent_free; /* It's somewhat bogus to use a doubly-linked queue for the free list */
77 struct rx_queue rxepoch_free; /* It's somewhat bogus to use a doubly-linked queue for the free list */
78 static struct rx_queue rxepoch_queue; /* list of waiting epochs */
79 static int rxevent_allocUnit = 10; /* Allocation unit (number of event records to allocate at one time) */
80 static int rxepoch_allocUnit = 10; /* Allocation unit (number of epoch records to allocate at one time) */
81 int rxevent_nFree; /* Number of free event records */
82 int rxevent_nPosted; /* Current number of posted events */
83 int rxepoch_nFree; /* Number of free epoch records */
84 static void (*rxevent_ScheduledEarlierEvent) (void); /* Proc to call when an event is scheduled that is earlier than all other events */
88 struct xfreelist *next;
90 static struct xfreelist *xfreemallocs = 0, *xsp = 0;
92 struct clock rxevent_nextRaiseEvents; /* Time of next call to raise events */
93 struct clock rxevent_lastEvent; /* backwards time detection */
94 int rxevent_raiseScheduled; /* true if raise events is scheduled */
96 #ifdef RX_ENABLE_LOCKS
98 /* rxdb_fileID is used to identify the lock location, along with line#. */
99 static int rxdb_fileID = RXDB_FILE_RX_EVENT;
100 #endif /* RX_LOCKS_DB */
101 #define RX_ENABLE_LOCKS 1
102 afs_kmutex_t rxevent_lock;
103 #endif /* RX_ENABLE_LOCKS */
105 #ifdef AFS_PTHREAD_ENV
107 * This mutex protects the following global variables:
108 * rxevent_initialized
112 pthread_mutex_t rx_event_mutex;
113 #define LOCK_EV_INIT assert(pthread_mutex_lock(&rx_event_mutex)==0)
114 #define UNLOCK_EV_INIT assert(pthread_mutex_unlock(&rx_event_mutex)==0)
117 #define UNLOCK_EV_INIT
118 #endif /* AFS_PTHREAD_ENV */
122 rxevent_adjTimes(struct clock *adjTime)
124 /* backwards clock correction */
126 struct rxepoch *qep, *nqep;
127 struct rxevent *qev, *nqev;
129 for (queue_Scan(&rxepoch_queue, qep, nqep, rxepoch)) {
130 for (queue_Scan(&qep->events, qev, nqev, rxevent)) {
131 if (clock_Gt(&qev->eventTime, adjTime)) {
132 clock_Sub(&qev->eventTime, adjTime);
136 if (qep->epochSec > adjTime->sec) {
137 qep->epochSec -= adjTime->sec;
143 /* Pass in the number of events to allocate at a time */
144 int rxevent_initialized = 0;
146 rxevent_Init(int nEvents, void (*scheduler) (void))
149 if (rxevent_initialized) {
153 MUTEX_INIT(&rxevent_lock, "rxevent_lock", MUTEX_DEFAULT, 0);
156 rxevent_allocUnit = nEvents;
157 queue_Init(&rxevent_free);
158 queue_Init(&rxepoch_free);
159 queue_Init(&rxepoch_queue);
160 rxevent_nFree = rxevent_nPosted = 0;
162 rxevent_ScheduledEarlierEvent = scheduler;
163 rxevent_initialized = 1;
164 clock_Zero(&rxevent_nextRaiseEvents);
165 clock_Zero(&rxevent_lastEvent);
166 rxevent_raiseScheduled = 0;
170 /* Create and initialize new epoch structure */
172 rxepoch_Allocate(struct clock *when)
177 /* If we are short on free epoch entries, create a block of new oned
178 * and add them to the free queue */
179 if (queue_IsEmpty(&rxepoch_free)) {
180 #if defined(AFS_AIX32_ENV) && defined(KERNEL)
181 ep = (struct rxepoch *)rxi_Alloc(sizeof(struct rxepoch));
182 queue_Append(&rxepoch_free, &ep[0]), rxepoch_nFree++;
184 ep = (struct rxepoch *)
185 osi_Alloc(sizeof(struct rxepoch) * rxepoch_allocUnit);
188 (struct xfreelist *)osi_Alloc(sizeof(struct xfreelist));
189 xfreemallocs->mem = (void *)ep;
190 xfreemallocs->size = sizeof(struct rxepoch) * rxepoch_allocUnit;
191 xfreemallocs->next = xsp;
192 for (i = 0; i < rxepoch_allocUnit; i++)
193 queue_Append(&rxepoch_free, &ep[i]), rxepoch_nFree++;
196 ep = queue_First(&rxepoch_free, rxepoch);
199 ep->epochSec = when->sec;
200 queue_Init(&ep->events);
204 /* Add the indicated event (function, arg) at the specified clock time. The
205 * "when" argument specifies when "func" should be called, in clock (clock.h)
208 static struct rxevent *
209 _rxevent_Post(struct clock *when, struct clock *now, void (*func) (),
210 void *arg, void *arg1, int arg2, int newargs)
212 register struct rxevent *ev, *evqe, *evqpr;
213 register struct rxepoch *ep, *epqe, *epqpr;
216 MUTEX_ENTER(&rxevent_lock);
220 clock_GetTime(&now1);
221 fprintf(rx_Log_event, "%d.%d: rxevent_Post(%d.%d, %lp, %lp, %lp, %d)\n",
222 (int)now1.sec, (int)now1.usec, (int)when->sec, (int)when->usec,
227 /* If a time was provided, check for consistency */
229 if (clock_Gt(&rxevent_lastEvent, now)) {
230 struct clock adjTime = rxevent_lastEvent;
231 clock_Sub(&adjTime, now);
232 rxevent_adjTimes(&adjTime);
234 rxevent_lastEvent = *now;
236 /* Get a pointer to the epoch for this event, if none is found then
237 * create a new epoch and insert it into the sorted list */
238 for (ep = NULL, queue_ScanBackwards(&rxepoch_queue, epqe, epqpr, rxepoch)) {
239 if (when->sec == epqe->epochSec) {
240 /* already have an structure for this epoch */
242 if (ep == queue_First(&rxepoch_queue, rxepoch))
245 } else if (when->sec > epqe->epochSec) {
246 /* Create a new epoch and insert after qe */
247 ep = rxepoch_Allocate(when);
248 queue_InsertAfter(epqe, ep);
253 /* Create a new epoch and place it at the head of the list */
254 ep = rxepoch_Allocate(when);
255 queue_Prepend(&rxepoch_queue, ep);
259 /* If we're short on free event entries, create a block of new ones and add
260 * them to the free queue */
261 if (queue_IsEmpty(&rxevent_free)) {
263 #if defined(AFS_AIX32_ENV) && defined(KERNEL)
264 ev = (struct rxevent *)rxi_Alloc(sizeof(struct rxevent));
265 queue_Append(&rxevent_free, &ev[0]), rxevent_nFree++;
267 ev = (struct rxevent *)osi_Alloc(sizeof(struct rxevent) *
271 (struct xfreelist *)osi_Alloc(sizeof(struct xfreelist));
272 xfreemallocs->mem = (void *)ev;
273 xfreemallocs->size = sizeof(struct rxevent) * rxevent_allocUnit;
274 xfreemallocs->next = xsp;
275 for (i = 0; i < rxevent_allocUnit; i++)
276 queue_Append(&rxevent_free, &ev[i]), rxevent_nFree++;
280 /* Grab and initialize a new rxevent structure */
281 ev = queue_First(&rxevent_free, rxevent);
285 /* Record user defined event state */
286 ev->eventTime = *when;
291 ev->newargs = newargs;
292 rxevent_nPosted += 1; /* Rather than ++, to shut high-C up
293 * regarding never-set variables
296 /* Insert the event into the sorted list of events for this epoch */
297 for (queue_ScanBackwards(&ep->events, evqe, evqpr, rxevent)) {
298 if (when->usec >= evqe->eventTime.usec) {
299 /* Insert event after evqe */
300 queue_InsertAfter(evqe, ev);
301 MUTEX_EXIT(&rxevent_lock);
305 /* Insert event at head of current epoch */
306 queue_Prepend(&ep->events, ev);
307 if (isEarliest && rxevent_ScheduledEarlierEvent
308 && (!rxevent_raiseScheduled
309 || clock_Lt(&ev->eventTime, &rxevent_nextRaiseEvents))) {
310 rxevent_raiseScheduled = 1;
311 clock_Zero(&rxevent_nextRaiseEvents);
312 MUTEX_EXIT(&rxevent_lock);
313 /* Notify our external scheduler */
314 (*rxevent_ScheduledEarlierEvent) ();
315 MUTEX_ENTER(&rxevent_lock);
317 MUTEX_EXIT(&rxevent_lock);
322 rxevent_Post(struct clock *when, void (*func) (), void *arg, void *arg1)
326 return _rxevent_Post(when, &now, func, arg, arg1, 0, 0);
330 rxevent_Post2(struct clock *when, void (*func) (), void *arg, void *arg1,
335 return _rxevent_Post(when, &now, func, arg, arg1, arg2, 1);
339 rxevent_PostNow(struct clock *when, struct clock *now, void (*func) (),
340 void *arg, void *arg1)
342 return _rxevent_Post(when, now, func, arg, arg1, 0, 0);
346 rxevent_PostNow2(struct clock *when, struct clock *now, void (*func) (),
347 void *arg, void *arg1, int arg2)
349 return _rxevent_Post(when, now, func, arg, arg1, arg2, 1);
352 /* Cancel an event by moving it from the event queue to the free list.
353 * Warning, the event must be on the event queue! If not, this should core
354 * dump (reference through 0). This routine should be called using the macro
355 * event_Cancel, which checks for a null event and also nulls the caller's
356 * event pointer after cancelling the event.
358 #ifdef RX_ENABLE_LOCKS
359 #ifdef RX_REFCOUNT_CHECK
360 int rxevent_Cancel_type = 0;
365 rxevent_Cancel_1(register struct rxevent *ev, register struct rx_call *call,
372 fprintf(rx_Log_event, "%d.%d: rxevent_Cancel_1(%d.%d, %lp, %lp)\n",
373 (int)now.sec, (int)now.usec, (int)ev->eventTime.sec,
374 (int)ev->eventTime.usec, ev->func,
378 /* Append it to the free list (rather than prepending) to keep the free
379 * list hot so nothing pages out
381 MUTEX_ENTER(&rxevent_lock);
383 MUTEX_EXIT(&rxevent_lock);
386 #ifdef RX_ENABLE_LOCKS
387 /* It's possible we're currently processing this event. */
388 if (queue_IsOnQueue(ev)) {
389 queue_MoveAppend(&rxevent_free, ev);
394 #ifdef RX_REFCOUNT_CHECK
395 call->refCDebug[type]--;
396 if (call->refCDebug[type] < 0) {
397 rxevent_Cancel_type = type;
398 osi_Panic("rxevent_Cancel: call refCount < 0");
400 #endif /* RX_REFCOUNT_CHECK */
403 #else /* RX_ENABLE_LOCKS */
404 queue_MoveAppend(&rxevent_free, ev);
407 #endif /* RX_ENABLE_LOCKS */
408 MUTEX_EXIT(&rxevent_lock);
411 /* Process all epochs that have expired relative to the current clock time
412 * (which is not re-evaluated unless clock_NewTime has been called). The
413 * relative time to the next epoch is returned in the output parameter next
414 * and the function returns 1. If there are is no next epoch, the function
418 rxevent_RaiseEvents(struct clock *next)
420 register struct rxepoch *ep;
421 register struct rxevent *ev;
422 volatile struct clock now;
423 MUTEX_ENTER(&rxevent_lock);
425 /* Events are sorted by time, so only scan until an event is found that has
426 * not yet timed out */
429 while (queue_IsNotEmpty(&rxepoch_queue)) {
430 ep = queue_First(&rxepoch_queue, rxepoch);
431 if (queue_IsEmpty(&ep->events)) {
433 queue_Append(&rxepoch_free, ep);
439 ev = queue_First(&ep->events, rxevent);
440 if (clock_Lt(&now, &ev->eventTime)) {
442 if (clock_Gt(&rxevent_lastEvent, &now)) {
443 struct clock adjTime = rxevent_lastEvent;
445 clock_Sub(&adjTime, &now);
446 adjusted = rxevent_adjTimes(&adjTime);
447 rxevent_lastEvent = now;
451 if (clock_Lt(&now, &ev->eventTime)) {
452 *next = rxevent_nextRaiseEvents = ev->eventTime;
453 rxevent_raiseScheduled = 1;
454 clock_Sub(next, &now);
455 MUTEX_EXIT(&rxevent_lock);
461 MUTEX_EXIT(&rxevent_lock);
463 ev->func(ev, ev->arg, ev->arg1, ev->arg2);
465 ev->func(ev, ev->arg, ev->arg1);
467 MUTEX_ENTER(&rxevent_lock);
468 queue_Append(&rxevent_free, ev);
470 } while (queue_IsNotEmpty(&ep->events));
474 fprintf(rx_Log_event, "rxevent_RaiseEvents(%d.%d)\n", (int)now.sec,
477 rxevent_raiseScheduled = 0;
478 MUTEX_EXIT(&rxevent_lock);
483 shutdown_rxevent(void)
485 struct xfreelist *xp, *nxp;
488 if (!rxevent_initialized) {
492 rxevent_initialized = 0;
494 MUTEX_DESTROY(&rxevent_lock);
495 #if defined(AFS_AIX32_ENV) && defined(KERNEL)
496 /* Everything is freed in afs_osinet.c */
501 osi_Free((char *)xp->mem, xp->size);
502 osi_Free((char *)xp, sizeof(struct xfreelist));