int32_t max_nfds;
int32_t nfds;
cstring_t desc;
- struct poll_interest *next;
+ LIST_ENTRY(poll_interest) entry;
};
-static struct poll_interest *reg=NULL;
+static LIST_HEAD(, poll_interest) reg = LIST_HEAD_INITIALIZER(®);
static int32_t total_nfds=10;
static bool_t finished=False;
i->desc=desc;
assert(total_nfds < INT_MAX - max_nfds);
total_nfds+=max_nfds;
- i->next=reg;
- reg=i;
+ LIST_INSERT_HEAD(®, i, entry);
return;
}
now_global=((uint64_t)tv_now_global.tv_sec*(uint64_t)1000)+
((uint64_t)tv_now_global.tv_usec/(uint64_t)1000);
idx=0;
- for (i=reg; i; i=i->next) {
+ LIST_FOREACH(i, ®, entry) {
int check;
for (check=0; check<i->nfds; check++) {
if(fds[idx+check].revents & POLLNVAL) {
remain=total_nfds;
idx=0;
timeout=-1;
- for (i=reg; i; i=i->next) {
+ LIST_FOREACH(i, ®, entry) {
nfds=remain;
rv=i->before(i->state, fds+idx, &nfds, &timeout);
if (rv!=0) {