-
Notifications
You must be signed in to change notification settings - Fork 0
/
PollReactor.c
231 lines (180 loc) · 6.98 KB
/
PollReactor.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
/********************************************************************
* (C) Adam Petersen 2005
*
* This code accompanies the article "Patterns in C, part 5: REACTOR".
* The article is available as PDF from www.adampetersen.se
*
* The code is intended as a illustration of the Reactor at work and
* is not suitable for use in production code (in order to keep this
* example as short as possible, the error handling has been strongly
* simplified).
*
********************************************************************/
/***************************************************************************
* A sample implementation of a concrete Reactor using the poll() function as
* a synchronous event demultiplexer.
****************************************************************************/
#include "Reactor.h"
#include "ReactorEventLoop.h"
#include "Error.h"
#include <poll.h>
#include <assert.h>
#include <stddef.h>
#include <stdio.h>
#define MAX_NO_OF_HANDLES 32
/* POSIX requires <poll.h> to define INFTIM.
However, in my environment it doesn't -> follow the recommendations by Mr. Stevens.
*/
#ifndef INFTIM
#define INFTIM -1
#endif
/* Bind an event handler to the struct used to interface poll(). */
typedef struct
{
int isUsed;
EventHandler handler;
struct pollfd fd;
} HandlerRegistration;
static HandlerRegistration registeredHandlers[MAX_NO_OF_HANDLES];
/************************************************************
* Function declarations.
************************************************************/
/* Add a copy of the given handler to the first free position in registeredHandlers. */
static int addToRegistry(EventHandler* handler);
/* Identify the event handler in the registeredHandlers and remove it. */
static int removeFromRegistry(EventHandler* handler);
/* Add a copy of all registered handlers to the given array. */
static size_t buildPollArray(struct pollfd* fds);
/* Identify the event handler corresponding to the given descriptor in the registeredHandlers. */
static EventHandler* findHandler(int fd);
/* Detect all signalled handles and invoke their corresponding event handlers. */
static void dispatchSignalledHandles(const struct pollfd* fds, size_t noOfHandles);
/****************************************************************
* Implementation of the Reactor interface used for registrations.
*****************************************************************/
void Register(EventHandler* handler)
{
assert(NULL != handler);
if(!addToRegistry(handler)) {
/* NOTE: In production code, this error should be delegated to the client instead. */
error("No more registrations possible");
}
}
void Unregister(EventHandler* handler)
{
assert(NULL != handler);
if(!removeFromRegistry(handler)) {
/* NOTE: In production code, this error should be delegated to the client instead. */
error("Event handler not registered");
}
}
/****************************************************************
* Implementation of the reactive event loop
* (interface separated in ReactorEventLoop.h).
*****************************************************************/
void HandleEvents(void)
{
/* Build the array required to interact with poll().*/
struct pollfd fds[MAX_NO_OF_HANDLES] = {0};
const size_t noOfHandles = buildPollArray(fds);
/* Inoke the synchronous event demultiplexer.*/
if(0 < poll(fds, noOfHandles, INFTIM)){
/* Identify all signalled handles and invoke the event handler associated with each one. */
dispatchSignalledHandles(fds, noOfHandles);
}
else{
error("Poll failure");
}
}
/************************************************************
* Definition of the local utility functions.
************************************************************/
/**
* Add a copy of the given handler to the first free position in registeredHandlers.
*/
static int addToRegistry(EventHandler* handler)
{
/* Identify the first free position. */
int isRegistered = 0;
int i = 0;
for(i = 0; (i < MAX_NO_OF_HANDLES) && (0 == isRegistered); ++i) {
if(0 == registeredHandlers[i].isUsed) {
/* A free position found. */
HandlerRegistration* freeEntry = ®isteredHandlers[i];
/* Create a binding between the handle provided by the client and the events of interest. */
freeEntry->handler = *handler;
freeEntry->fd.fd = handler->getHandle(handler->instance);
freeEntry->fd.events = POLLRDNORM;
isRegistered = freeEntry->isUsed = 1;
(void) printf("Reactor: Added handle with ID = %d\n", freeEntry->fd.fd);
}
}
return isRegistered;
}
/**
* Identify the event handler in the registeredHandlers and remove it.
*/
static int removeFromRegistry(EventHandler* handler)
{
/* Identify the event handler in the registeredHandlers and remove it. */
int i = 0;
int nodeRemoved = 0;
for(i = 0; (i < MAX_NO_OF_HANDLES) && (0 == nodeRemoved); ++i) {
if(registeredHandlers[i].isUsed && (registeredHandlers[i].handler.instance == handler->instance)) {
/* The given event handler is found -> mark it as unused and terminate the loop. */
registeredHandlers[i].isUsed = 0;
nodeRemoved = 1;
(void) printf("Reactor: Removed event handler with ID = %d\n", registeredHandlers[i].fd.fd);
}
}
return nodeRemoved;
}
/**
* Add a copy of all registered handlers to the given array.
*/
static size_t buildPollArray(struct pollfd* fds)
{
/* Add all registered handlers to the given array. */
int i = 0;
size_t noOfCopiedHandles = 0;
for(i = 0; i < MAX_NO_OF_HANDLES; ++i) {
if(registeredHandlers[i].isUsed) {
fds[noOfCopiedHandles] = registeredHandlers[i].fd;
++noOfCopiedHandles;
}
}
return noOfCopiedHandles;
}
/**
* Identify the event handler corresponding to the given descriptor in the registeredHandlers.
*/
static EventHandler* findHandler(int fd)
{
EventHandler* matchingHandler = NULL;
/* Identify the corresponding concrete event handler in the registeredHandles. */
int i = 0;
for(i = 0; (i < MAX_NO_OF_HANDLES) && (NULL == matchingHandler); ++i) {
if(registeredHandlers[i].isUsed && (registeredHandlers[i].fd.fd == fd)) {
matchingHandler = ®isteredHandlers[i].handler;
}
}
return matchingHandler;
}
/**
* Loop through all handles. Upon detection of a handle signalled by poll(), its
* corresponding event handler is fetched and invoked.
*/
static void dispatchSignalledHandles(const struct pollfd* fds, size_t noOfHandles)
{
size_t i = 0;
for(i = 0; i < noOfHandles; ++i) {
/* Detect all signalled handles. */
if((POLLRDNORM | POLLERR) & fds[i].revents) {
/* This handle is signalled -> find and invoke its corresponding event handler. */
EventHandler* signalledHandler = findHandler(fds[i].fd);
if(NULL != signalledHandler){
signalledHandler-> handleEvent(signalledHandler->instance);
}
}
}
}