ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/svn/ircd-hybrid/trunk/src/event.c
Revision: 6306
Committed: Fri Jul 24 13:23:31 2015 UTC (10 years, 1 month ago) by michael
Content type: text/x-csrc
File size: 2674 byte(s)
Log Message:
- Move show_events() from event.c to m_stats.c. Remove now unused prototypes.

File Contents

# User Rev Content
1 adx 30 /*
2 michael 4130 * ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
3 adx 30 *
4 michael 5347 * Copyright (c) 2000-2015 ircd-hybrid development team
5 adx 30 *
6 michael 4130 * This program is free software; you can redistribute it and/or modify
7     * it under the terms of the GNU General Public License as published by
8     * the Free Software Foundation; either version 2 of the License, or
9     * (at your option) any later version.
10     *
11     * This program is distributed in the hope that it will be useful,
12     * but WITHOUT ANY WARRANTY; without even the implied warranty of
13     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14     * GNU General Public License for more details.
15     *
16     * You should have received a copy of the GNU General Public License
17     * along with this program; if not, write to the Free Software
18 michael 4565 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
19 michael 4130 * USA
20 adx 30 */
21    
22 michael 4130 /*! \file event.c
23     * \brief Timer based event execution
24     * \version $Id$
25     */
26    
27 adx 30 #include "stdinc.h"
28 michael 1011 #include "list.h"
29 adx 30 #include "ircd.h"
30     #include "event.h"
31     #include "client.h"
32     #include "send.h"
33     #include "numeric.h"
34 michael 2680 #include "rng_mt.h"
35 adx 30
36 michael 4094 static dlink_list events;
37 michael 2680
38 michael 6306
39     const dlink_list *
40     event_get_list(void)
41     {
42     return &events;
43     }
44    
45 michael 4094 void
46     event_add(struct event *ev, void *data)
47     {
48     dlink_node *node;
49 adx 30
50 michael 4094 event_delete(ev);
51 michael 3599
52 michael 4094 ev->data = data;
53     ev->next = CurrentTime + ev->when;
54     ev->enabled = 1;
55 michael 3599
56 michael 4094 DLINK_FOREACH(node, events.head)
57     {
58     struct event *e = node->data;
59 michael 3599
60 michael 4094 if (e->next > ev->next)
61 adx 30 {
62 michael 4094 dlinkAddBefore(node, ev, &ev->node, &events);
63 adx 30 return;
64     }
65     }
66    
67 michael 4094 dlinkAddTail(ev, &ev->node, &events);
68 adx 30 }
69    
70     void
71 michael 4094 event_addish(struct event *ev, void *data)
72 adx 30 {
73 michael 4094 if (ev->when >= 3)
74 adx 30 {
75 michael 4094 const time_t two_third = (2 * ev->when) / 3;
76 michael 4126
77 michael 4094 ev->when = two_third + ((genrand_int32() % 1000) * two_third) / 1000;
78 adx 30 }
79    
80 michael 4094 event_add(ev, data);
81 adx 30 }
82    
83     void
84 michael 4094 event_delete(struct event *ev)
85 adx 30 {
86 michael 4094 if (!ev->enabled)
87     return;
88    
89     dlinkDelete(&ev->node, &events);
90     ev->enabled = 0;
91 adx 30 }
92    
93 michael 4094 void
94     event_run(void)
95 adx 30 {
96 michael 4094 static time_t last = 0;
97 michael 4118 unsigned int len = 0;
98 adx 30
99 michael 4094 if (last == CurrentTime)
100     return;
101     last = CurrentTime;
102    
103     len = dlink_list_length(&events);
104     while (len-- && dlink_list_length(&events))
105     {
106     struct event *e = events.head->data;
107    
108 michael 4099 if (e->next > CurrentTime)
109 michael 4094 break;
110    
111     event_delete(e);
112    
113     e->handler(e->data);
114    
115     if (!e->oneshot)
116     event_add(e, e->data);
117     }
118 adx 30 }
119    
120     /*
121 michael 4094 * void set_back_events(time_t by)
122     * Input: Time to set back events by.
123     * Output: None.
124     * Side-effects: Sets back all events by "by" seconds.
125 adx 30 */
126     void
127 michael 4094 set_back_events(time_t by)
128 adx 30 {
129 michael 4094 dlink_node *node;
130    
131     DLINK_FOREACH(node, events.head)
132     {
133     struct event *ev = node->data;
134     ev->next -= by;
135     }
136 adx 30 }

Properties

Name Value
svn:eol-style native
svn:keywords Id Revision