libratbox/src/event.c

   1 /*
   2  *  ircd-ratbox: A slightly useful ircd.
   3  *  event.c: Event functions.
   4  *
   5  *  Copyright (C) 1998-2000 Regents of the University of California
   6  *  Copyright (C) 2001-2002 Hybrid Development Team
   7  *  Copyright (C) 2002-2005 ircd-ratbox development team
   8  *
   9  *  Code borrowed from the squid web cache by Adrian Chadd.
  10  *  Original header:
  11  *
  12  *  DEBUG: section 41   Event Processing
  13  *  AUTHOR: Henrik Nordstrom
  14  *
  15  *  SQUID Internet Object Cache  http://squid.nlanr.net/Squid/
  16  *  ----------------------------------------------------------
  17  *
  18  *  Squid is the result of efforts by numerous individuals from the
  19  *  Internet community.  Development is led by Duane Wessels of the
  20  *  National Laboratory for Applied Network Research and funded by the
  21  *  National Science Foundation.  Squid is Copyrighted (C) 1998 by
  22  *  the Regents of the University of California.  Please see the
  23  *  COPYRIGHT file for full details.  Squid incorporates software
  24  *  developed and/or copyrighted by other sources.  Please see the
  25  *  CREDITS file for full details.
  26  *
  27  *  This program is free software; you can redistribute it and/or modify
  28  *  it under the terms of the GNU General Public License as published by
  29  *  the Free Software Foundation; either version 2 of the License, or
  30  *  (at your option) any later version.
  31  *
  32  *  This program is distributed in the hope that it will be useful,
  33  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  34  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  35  *  GNU General Public License for more details.
  36  *
  37  *  You should have received a copy of the GNU General Public License
  38  *  along with this program; if not, write to the Free Software
  39  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
  40  *  USA
  41  *
  42  *  $Id: event.c 26272 2008-12-10 05:55:10Z androsyn $
  43  */
  44
  45 #include <libratbox_config.h>
  46 #include <ratbox_lib.h>
  47 #include <commio-int.h>
  48 #include <event-int.h>
  49
  50 #define EV_NAME_LEN 33
  51 static char last_event_ran[EV_NAME_LEN];
  52 static rb_dlink_list event_list;
  53
  54 static time_t event_time_min = -1;
  55
  56 /*
  57  * struct ev_entry *
  58  * rb_event_find(EVH *func, void *arg)
  59  *
  60  * Input: Event function and the argument passed to it
  61  * Output: Index to the slow in the event_table
  62  * Side Effects: None
  63  */
  64 static struct ev_entry *
  65 rb_event_find(EVH * func, void *arg)
  66 {
  67         rb_dlink_node *ptr;
  68         struct ev_entry *ev;
  69         RB_DLINK_FOREACH(ptr, event_list.head)
  70         {
  71                 ev = ptr->data;
  72                 if((ev->func == func) && (ev->arg == arg))
  73                         return ev;
  74         }
  75
  76         return NULL;
  77 }
  78
  79 /*
  80  * struct ev_entry *
  81  * rb_event_add(const char *name, EVH *func, void *arg, time_t when)
  82  *
  83  * Input: Name of event, function to call, arguments to pass, and frequency
  84  *        of the event.
  85  * Output: None
  86  * Side Effects: Adds the event to the event list.
  87  */
  88 struct ev_entry *
  89 rb_event_add(const char *name, EVH * func, void *arg, time_t when)
  90 {
  91         if (rb_unlikely(when <= 0)) {
  92                 rb_lib_log("rb_event_add: tried to schedule %s event with a delay of "
  93                         "%d seconds", name, (int) when);
  94                 when = 1;
  95         }
  96         struct ev_entry *ev;
  97         ev = rb_malloc(sizeof(struct ev_entry));
  98         ev->func = func;
  99         ev->name = rb_strndup(name, EV_NAME_LEN);
 100         ev->arg = arg;
 101         ev->when = rb_current_time() + when;
 102         ev->next = when;
 103         ev->frequency = when;
 104
 105         if((ev->when < event_time_min) || (event_time_min == -1))
 106         {
 107                 event_time_min = ev->when;
 108         }
 109         rb_dlinkAdd(ev, &ev->node, &event_list);
 110         rb_io_sched_event(ev, when);
 111         return ev;
 112 }
 113
 114 struct ev_entry *
 115 rb_event_addonce(const char *name, EVH * func, void *arg, time_t when)
 116 {
 117         if (rb_unlikely(when <= 0)) {
 118                 rb_lib_log("rb_event_addonce: tried to schedule %s event to run in "
 119                         "%d seconds", name, (int) when);
 120                 when = 1;
 121         }
 122         struct ev_entry *ev;
 123         ev = rb_malloc(sizeof(struct ev_entry));
 124         ev->func = func;
 125         ev->name = rb_strndup(name, EV_NAME_LEN);
 126         ev->arg = arg;
 127         ev->when = rb_current_time() + when;
 128         ev->next = when;
 129         ev->frequency = 0;
 130
 131         if((ev->when < event_time_min) || (event_time_min == -1))
 132                 event_time_min = ev->when;
 133
 134         rb_dlinkAdd(ev, &ev->node, &event_list);
 135         rb_io_sched_event(ev, when);
 136         return ev;
 137 }
 138
 139 /*
 140  * void rb_event_delete(struct ev_entry *ev)
 141  *
 142  * Input: pointer to ev_entry for the event
 143  * Output: None
 144  * Side Effects: Removes the event from the event list
 145  */
 146 void
 147 rb_event_delete(struct ev_entry *ev)
 148 {
 149         if(ev == NULL)
 150                 return;
 151
 152         rb_dlinkDelete(&ev->node, &event_list);
 153         rb_io_unsched_event(ev);
 154         rb_free(ev->name);
 155         rb_free(ev);
 156 }
 157
 158 /*
 159  * void rb_event_find_delete(EVH *func, void *arg)
 160  *
 161  * Input: pointer to func and data
 162  * Output: None
 163  * Side Effects: Removes the event from the event list
 164  */
 165 void
 166 rb_event_find_delete(EVH * func, void *arg)
 167 {
 168         rb_event_delete(rb_event_find(func, arg));
 169 }
 170
 171 /*
 172  * struct ev_entry *
 173  * rb_event_addish(const char *name, EVH *func, void *arg, time_t delta_isa)
 174  *
 175  * Input: Name of event, function to call, arguments to pass, and frequency
 176  *        of the event.
 177  * Output: None
 178  * Side Effects: Adds the event to the event list within +- 1/3 of the
 179  *               specified frequency.
 180  */
 181 struct ev_entry *
 182 rb_event_addish(const char *name, EVH * func, void *arg, time_t delta_ish)
 183 {
 184         if(delta_ish >= 3.0)
 185         {
 186                 const time_t two_third = (2 * delta_ish) / 3;
 187                 delta_ish = two_third + ((rand() % 1000) * two_third) / 1000;
 188                 /*
 189                  * XXX I hate the above magic, I don't even know if its right.
 190                  * Grr. -- adrian
 191                  */
 192         }
 193         return rb_event_add(name, func, arg, delta_ish);
 194 }
 195
 196
 197 void
 198 rb_run_event(struct ev_entry *ev)
 199 {
 200         rb_strlcpy(last_event_ran, ev->name, sizeof(last_event_ran));
 201         ev->func(ev->arg);
 202         if(!ev->frequency)
 203         {
 204                 rb_event_delete(ev);
 205                 return;
 206         }
 207         ev->when = rb_current_time() + ev->frequency;
 208         if((ev->when < event_time_min) || (event_time_min == -1))
 209                 event_time_min = ev->when;
 210 }
 211
 212 /*
 213  * void rb_event_run(void)
 214  *
 215  * Input: None
 216  * Output: None
 217  * Side Effects: Runs pending events in the event list
 218  */
 219 void
 220 rb_event_run(void)
 221 {
 222         rb_dlink_node *ptr, *next;
 223         struct ev_entry *ev;
 224
 225         if(rb_io_supports_event())
 226                 return;
 227
 228         event_time_min = -1;
 229         RB_DLINK_FOREACH_SAFE(ptr, next, event_list.head)
 230         {
 231                 ev = ptr->data;
 232                 if(ev->when <= rb_current_time())
 233                 {
 234                         rb_strlcpy(last_event_ran, ev->name, sizeof(last_event_ran));
 235                         ev->func(ev->arg);
 236
 237                         /* event is scheduled more than once */
 238                         if(ev->frequency)
 239                         {
 240                                 ev->when = rb_current_time() + ev->frequency;
 241                                 if((ev->when < event_time_min) || (event_time_min == -1))
 242                                         event_time_min = ev->when;
 243                         }
 244                         else
 245                         {
 246                                 rb_dlinkDelete(&ev->node, &event_list);
 247                                 rb_free(ev);
 248                         }
 249                 }
 250                 else
 251                 {
 252                         if((ev->when < event_time_min) || (event_time_min == -1))
 253                                 event_time_min = ev->when;
 254                 }
 255         }
 256 }
 257
 258 void
 259 rb_event_io_register_all(void)
 260 {
 261         rb_dlink_node *ptr;
 262         struct ev_entry *ev;
 263
 264         if(!rb_io_supports_event())
 265                 return;
 266
 267         RB_DLINK_FOREACH(ptr, event_list.head)
 268         {
 269                 ev = ptr->data;
 270                 rb_io_sched_event(ev, ev->next);
 271         }
 272 }
 273
 274 /*
 275  * void rb_event_init(void)
 276  *
 277  * Input: None
 278  * Output: None
 279  * Side Effects: Initializes the event system.
 280  */
 281 void
 282 rb_event_init(void)
 283 {
 284         rb_strlcpy(last_event_ran, "NONE", sizeof(last_event_ran));
 285 }
 286
 287 void
 288 rb_dump_events(void (*func) (char *, void *), void *ptr)
 289 {
 290         int len;
 291         char buf[512];
 292         rb_dlink_node *dptr;
 293         struct ev_entry *ev;
 294         len = sizeof(buf);
 295
 296         rb_snprintf(buf, len, "Last event to run: %s", last_event_ran);
 297         func(buf, ptr);
 298
 299         rb_strlcpy(buf, "Operation                    Next Execution", len);
 300         func(buf, ptr);
 301
 302         RB_DLINK_FOREACH(dptr, event_list.head)
 303         {
 304                 ev = dptr->data;
 305                 rb_snprintf(buf, len, "%-28s %-4ld seconds", ev->name,
 306                             ev->when - (long)rb_current_time());
 307                 func(buf, ptr);
 308         }
 309 }
 310
 311 /*
 312  * void rb_set_back_events(time_t by)
 313  * Input: Time to set back events by.
 314  * Output: None.
 315  * Side-effects: Sets back all events by "by" seconds.
 316  */
 317 void
 318 rb_set_back_events(time_t by)
 319 {
 320         rb_dlink_node *ptr;
 321         struct ev_entry *ev;
 322         RB_DLINK_FOREACH(ptr, event_list.head)
 323         {
 324                 ev = ptr->data;
 325                 if(ev->when > by)
 326                         ev->when -= by;
 327                 else
 328                         ev->when = 0;
 329         }
 330 }
 331
 332 void
 333 rb_event_update(struct ev_entry *ev, time_t freq)
 334 {
 335         if(ev == NULL)
 336                 return;
 337
 338         ev->frequency = freq;
 339
 340         /* update when its scheduled to run if its higher
 341          * than the new frequency
 342          */
 343         if((rb_current_time() + freq) < ev->when)
 344                 ev->when = rb_current_time() + freq;
 345         return;
 346 }
 347
 348 time_t
 349 rb_event_next(void)
 350 {
 351         return event_time_min;
 352 }