FilesExpand file tree

 master

/

ev_kqueue.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

198 lines (168 loc) · 6.12 KB

 master

/

ev_kqueue.c

Copy path

Top

File metadata and controls

• Code
• Blame

198 lines (168 loc) · 6.12 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/*

* libev kqueue backend

*

* Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libev@schmorp.de>

* All rights reserved.

*

* Redistribution and use in source and binary forms, with or without modifica-

* tion, are permitted provided that the following conditions are met:

*

* 1. Redistributions of source code must retain the above copyright notice,

* this list of conditions and the following disclaimer.

*

* 2. Redistributions in binary form must reproduce the above copyright

* notice, this list of conditions and the following disclaimer in the

* documentation and/or other materials provided with the distribution.

*

* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED

* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-

* CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO

* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-

* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;

* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,

* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-

* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED

* OF THE POSSIBILITY OF SUCH DAMAGE.

*

* Alternatively, the contents of this file may be used under the terms of

* the GNU General Public License ("GPL") version 2 or any later version,

* in which case the provisions of the GPL are applicable instead of

* the above. If you wish to allow the use of your version of this file

* only under the terms of the GPL and not to allow others to use your

* version of this file under the BSD license, indicate your decision

* by deleting the provisions above and replace them with the notice

* and other provisions required by the GPL. If you do not delete the

* provisions above, a recipient may use your version of this file under

* either the BSD or the GPL.

*/

#include <sys/types.h>

#include <sys/time.h>

#include <sys/event.h>

#include <string.h>

#include <errno.h>

void inline_speed

kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)

{

++kqueue_changecnt;

array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);

EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);

}

/* OS X at least needs this */

#ifndef EV_ENABLE

# define EV_ENABLE 0

#endif

#ifndef NOTE_EOF

# define NOTE_EOF 0

#endif

static void

kqueue_modify (EV_P_ int fd, int oev, int nev)

{

if (oev != nev)

{

if (oev & EV_READ)

kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);

if (oev & EV_WRITE)

kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);

}

/* to detect close/reopen reliably, we have to re-add */

/* event requests even when oev == nev */

if (nev & EV_READ)

kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD | EV_ENABLE, NOTE_EOF);

if (nev & EV_WRITE)

kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, NOTE_EOF);

}

static void

kqueue_poll (EV_P_ ev_tstamp timeout)

{

int res, i;

struct timespec ts;

/* need to resize so there is enough space for errors */

if (kqueue_changecnt > kqueue_eventmax)

{

ev_free (kqueue_events);

kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);

kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);

}

EV_RELEASE_CB;

EV_TS_SET (ts, timeout);

res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);

EV_ACQUIRE_CB;

kqueue_changecnt = 0;

if (expect_false (res < 0))

{

if (errno != EINTR)

ev_syserr ("(libev) kevent");

return;

}

for (i = 0; i < res; ++i)

{

int fd = kqueue_events [i].ident;

if (expect_false (kqueue_events [i].flags & EV_ERROR))

{

int err = kqueue_events [i].data;

/* we are only interested in errors for fds that we are interested in :) */

if (anfds [fd].events)

{

if (err == ENOENT) /* resubmit changes on ENOENT */

kqueue_modify (EV_A_ fd, 0, anfds [fd].events);

else if (err == EBADF) /* on EBADF, we re-check the fd */

{

if (fd_valid (fd))

kqueue_modify (EV_A_ fd, 0, anfds [fd].events);

else

fd_kill (EV_A_ fd);

}

else /* on all other errors, we error out on the fd */

fd_kill (EV_A_ fd);

}

}

else

fd_event (

EV_A_

fd,

kqueue_events [i].filter == EVFILT_READ ? EV_READ

: kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE

: 0

);

}

if (expect_false (res == kqueue_eventmax))

{

ev_free (kqueue_events);

kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);

kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);

}

}

int inline_size

kqueue_init (EV_P_ int flags)

{

/* Initialize the kernel queue */

if ((backend_fd = kqueue ()) < 0)

return 0;

fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */

backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */

backend_modify = kqueue_modify;

backend_poll = kqueue_poll;

kqueue_eventmax = 64; /* initial number of events receivable per poll */

kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);

kqueue_changes = 0;

kqueue_changemax = 0;

kqueue_changecnt = 0;

return EVBACKEND_KQUEUE;

}

void inline_size

kqueue_destroy (EV_P)

{

ev_free (kqueue_events);

ev_free (kqueue_changes);

}

void inline_size

kqueue_fork (EV_P)

{

close (backend_fd);

while ((backend_fd = kqueue ()) < 0)

ev_syserr ("(libev) kqueue");

fcntl (backend_fd, F_SETFD, FD_CLOEXEC);

/* re-register interest in fds */

fd_rearm_all (EV_A);

}