ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_poll.c
(Generate patch)

Comparing libev/ev_poll.c (file contents):
Revision 1.9 by root, Tue Nov 6 17:09:45 2007 UTC vs.
Revision 1.17 by root, Wed Nov 28 11:15:55 2007 UTC

1/* 1/*
2 * libev epoll fd activity backend 2 * libev poll fd activity backend
3 * 3 *
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de>
5 * All rights reserved. 5 * All rights reserved.
6 * 6 *
7 * Redistribution and use in source and binary forms, with or without 7 * Redistribution and use in source and binary forms, with or without
… …
50 50
51 idx = pollidxs [fd]; 51 idx = pollidxs [fd];
52 52
53 if (idx < 0) /* need to allocate a new pollfd */ 53 if (idx < 0) /* need to allocate a new pollfd */
54 { 54 {
55 idx = pollcnt++; 55 pollidxs [fd] = idx = pollcnt++;
56 array_needsize (struct pollfd, polls, pollmax, pollcnt, ); 56 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2);
57 polls [idx].fd = fd; 57 polls [idx].fd = fd;
58 } 58 }
59
60 assert (polls [idx].fd == fd);
59 61
60 if (nev) 62 if (nev)
61 polls [idx].events = 63 polls [idx].events =
62 (nev & EV_READ ? POLLIN : 0) 64 (nev & EV_READ ? POLLIN : 0)
63 | (nev & EV_WRITE ? POLLOUT : 0); 65 | (nev & EV_WRITE ? POLLOUT : 0);
64 else /* remove pollfd */ 66 else /* remove pollfd */
65 { 67 {
68 pollidxs [fd] = -1;
69
66 if (idx < pollcnt--) 70 if (idx < --pollcnt)
67 { 71 {
68 pollidxs [fd] = -1;
69 polls [idx] = polls [pollcnt]; 72 polls [idx] = polls [pollcnt];
70 pollidxs [polls [idx].fd] = idx; 73 pollidxs [polls [idx].fd] = idx;
71 } 74 }
72 } 75 }
73} 76}
74 77
75static void 78static void
76poll_poll (EV_P_ ev_tstamp timeout) 79poll_poll (EV_P_ ev_tstamp timeout)
77{ 80{
78 int i; 81 int i;
79 int res = poll (polls, pollcnt, ceil (timeout * 1000.)); 82 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.));
80 83
81 if (res < 0) 84 if (res < 0)
82 { 85 {
83 if (errno == EBADF) 86 if (errno == EBADF)
84 fd_ebadf (EV_A); 87 fd_ebadf (EV_A);
… …
89 92
90 return; 93 return;
91 } 94 }
92 95
93 for (i = 0; i < pollcnt; ++i) 96 for (i = 0; i < pollcnt; ++i)
97 if (polls [i].revents & POLLNVAL)
98 fd_kill (EV_A_ polls [i].fd);
99 else
94 fd_event ( 100 fd_event (
95 EV_A_ 101 EV_A_
96 polls [i].fd, 102 polls [i].fd,
97 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 103 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
98 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 104 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
99 ); 105 );
100} 106}
101 107
102static int 108int inline_size
103poll_init (EV_P_ int flags) 109poll_init (EV_P_ int flags)
104{ 110{
105 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */ 111 backend_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */
106 method_modify = poll_modify; 112 backend_modify = poll_modify;
107 method_poll = poll_poll; 113 backend_poll = poll_poll;
108 114
109 pollidxs = 0; pollidxmax = 0; 115 pollidxs = 0; pollidxmax = 0;
110 polls = 0; pollmax = 0; pollcnt = 0; 116 polls = 0; pollmax = 0; pollcnt = 0;
111 117
112 return EVMETHOD_POLL; 118 return EVBACKEND_POLL;
113} 119}
114 120
115static void 121void inline_size
116poll_destroy (EV_P) 122poll_destroy (EV_P)
117{ 123{
118 ev_free (pollidxs); 124 ev_free (pollidxs);
119 ev_free (polls); 125 ev_free (polls);
120} 126}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines