socket_poller.cpp 21.2 KB
Newer Older
1
/*
2
    Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
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

    This file is part of libzmq, the ZeroMQ core engine in C++.

    libzmq is free software; you can redistribute it and/or modify it under
    the terms of the GNU Lesser General Public License (LGPL) as published
    by the Free Software Foundation; either version 3 of the License, or
    (at your option) any later version.

    As a special exception, the Contributors give you permission to link
    this library with independent modules to produce an executable,
    regardless of the license terms of these independent modules, and to
    copy and distribute the resulting executable under terms of your choice,
    provided that you also meet, for each linked independent module, the
    terms and conditions of the license of that module. An independent
    module is a module which is not derived from or based on this library.
    If you modify this library, you must extend this exception to your
    version of the library.

    libzmq is distributed in the hope that it will be useful, but WITHOUT
    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
    License for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

30
#include "precompiled.hpp"
31 32 33 34 35
#include "socket_poller.hpp"
#include "err.hpp"

zmq::socket_poller_t::socket_poller_t () :
    tag (0xCAFEBABE),
36
    signaler (NULL),
37
    need_rebuild (true),
38 39
    use_signaler (false),
    poll_size(0)
40
#if defined ZMQ_POLL_BASED_ON_POLL
41 42
    ,
    pollfds (NULL)
43 44 45
#elif defined ZMQ_POLL_BASED_ON_SELECT
    ,
    maxfd(0)
46
#endif
47
{
48
#if defined ZMQ_POLL_BASED_ON_SELECT
49 50 51 52 53 54 55 56
#if defined ZMQ_HAVE_WINDOWS
    // On Windows fd_set contains array of SOCKETs, each 4 bytes.
    // For large fd_sets memset() could be expensive and it is unnecessary.
    // It is enough to set fd_count to 0, exactly what FD_ZERO() macro does.
    FD_ZERO (&pollset_in);
    FD_ZERO (&pollset_out);
    FD_ZERO (&pollset_err);
#else
57
    memset(&pollset_in, 0, sizeof(pollset_in));
58 59 60
    memset(&pollset_out, 0, sizeof(pollset_out));
    memset(&pollset_err, 0, sizeof(pollset_err));
#endif
61
#endif
62 63 64 65 66
}

zmq::socket_poller_t::~socket_poller_t ()
{
    //  Mark the socket_poller as dead
67
    tag = 0xdeadbeef;
68

69
    for (items_t::iterator it = items.begin(); it != items.end(); ++it) {
70
        if (it->socket && it->socket->check_tag()) {
71 72 73
            int thread_safe;
            size_t thread_safe_size = sizeof(int);

74
            if (it->socket->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == 0 && thread_safe)
75
                it->socket->remove_signaler (signaler);
76 77 78
        }
    }

79 80 81 82 83
    if (signaler != NULL) {
        delete signaler;
        signaler = NULL;
    }

84 85 86 87
#if defined ZMQ_POLL_BASED_ON_POLL
    if (pollfds) {
        free (pollfds);
        pollfds = NULL;
88
    }
89
#endif
90 91
}

92
bool zmq::socket_poller_t::check_tag ()
93 94 95 96
{
    return tag == 0xCAFEBABE;
}

97
int zmq::socket_poller_t::add (socket_base_t *socket_, void* user_data_, short events_)
98
{
99
    for (items_t::iterator it = items.begin (); it != items.end (); ++it) {
100 101 102
        if (it->socket == socket_) {
            errno = EINVAL;
            return -1;
103
        }
104 105 106 107
    }

    int thread_safe;
    size_t thread_safe_size = sizeof(int);
108 109

    if (socket_->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == -1)
110 111 112
        return -1;

    if (thread_safe) {
113 114 115 116
        if (signaler == NULL)
            signaler = new signaler_t ();

        if (socket_->add_signaler (signaler) == -1)
117 118
           return -1;
    }
119

120 121 122 123 124
    item_t item = {socket_, 0, user_data_, events_
#if defined ZMQ_POLL_BASED_ON_POLL
                   ,-1
#endif
    };
125
    items.push_back (item);
126 127 128 129 130
    need_rebuild = true;

    return 0;
}

131
int zmq::socket_poller_t::add_fd (fd_t fd_, void *user_data_, short events_)
132
{
133
   for (items_t::iterator it = items.begin (); it != items.end (); ++it) {
134 135 136
        if (!it->socket && it->fd == fd_) {
            errno = EINVAL;
            return -1;
137
        }
138 139
    }

140 141 142 143 144
    item_t item = {NULL, fd_, user_data_, events_
#if defined ZMQ_POLL_BASED_ON_POLL
                   ,-1
#endif
                   };
145
    items.push_back (item);
146 147 148 149 150
    need_rebuild = true;

    return 0;
}

151
int zmq::socket_poller_t::modify (socket_base_t  *socket_, short events_)
152
{
153
    items_t::iterator it;
154

155
    for (it = items.begin (); it != items.end (); ++it) {
156 157 158 159
        if (it->socket == socket_)
            break;
    }

160
    if (it == items.end()) {
161 162 163 164 165 166 167 168 169 170 171
        errno = EINVAL;
        return -1;
    }

    it->events = events_;
    need_rebuild = true;

    return 0;
}


172
int zmq::socket_poller_t::modify_fd (fd_t fd_, short events_)
173
{
174
    items_t::iterator it;
175

176
    for (it = items.begin (); it != items.end (); ++it) {
177 178 179 180
        if (!it->socket && it->fd == fd_)
            break;
    }

181
    if (it == items.end()) {
182 183 184
        errno = EINVAL;
        return -1;
    }
185

186 187 188 189
    it->events = events_;
    need_rebuild = true;

    return 0;
190
}
191 192


193
int zmq::socket_poller_t::remove (socket_base_t *socket_)
194
{
195
    items_t::iterator it;
196

197
    for (it = items.begin (); it != items.end (); ++it) {
198 199 200 201
        if (it->socket == socket_)
            break;
    }

202
    if (it == items.end()) {
203 204 205
        errno = EINVAL;
        return -1;
    }
206

207 208 209
    items.erase(it);
    need_rebuild = true;

210 211 212
    int thread_safe;
    size_t thread_safe_size = sizeof(int);

213
    if (socket_->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == 0 && thread_safe)
214
        socket_->remove_signaler (signaler);
215

216 217 218
    return 0;
}

219
int zmq::socket_poller_t::remove_fd (fd_t fd_)
220
{
221
    items_t::iterator it;
222

223
    for (it = items.begin (); it != items.end (); ++it) {
224 225 226 227
        if (!it->socket && it->fd == fd_)
            break;
    }

228
    if (it == items.end()) {
229 230 231
        errno = EINVAL;
        return -1;
    }
232

233
    items.erase (it);
234 235 236
    need_rebuild = true;

    return 0;
237
}
238

239
int zmq::socket_poller_t::rebuild ()
240
{
241
#if defined ZMQ_POLL_BASED_ON_POLL
242

243 244 245 246
    if (pollfds) {
        free (pollfds);
        pollfds = NULL;
    }
247

248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
    use_signaler = false;

    poll_size = 0;

    for (items_t::iterator it = items.begin (); it != items.end (); ++it) {
        if (it->events) {
            if (it->socket) {
                int thread_safe;
                size_t thread_safe_size = sizeof(int);

                if (it->socket->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == -1)
                    return -1;

                if (thread_safe) {
                    if (!use_signaler) {
                        use_signaler = true;
                        poll_size++;
265
                    }
266 267 268 269
                }
                else
                    poll_size++;
            }
270 271
            else
                poll_size++;
272
        }
273
    }
274

275 276
    if (poll_size == 0)
        return 0;
277

278 279 280 281 282 283 284
    pollfds = (pollfd*) malloc (poll_size * sizeof (pollfd));
    alloc_assert (pollfds);

    int item_nbr = 0;

    if (use_signaler) {
        item_nbr = 1;
285
        pollfds[0].fd = signaler->get_fd();
286
        pollfds[0].events = POLLIN;
287 288
    }

289
    for (items_t::iterator it = items.begin (); it != items.end (); ++it) {
290 291 292 293 294 295 296 297
        if (it->events) {
            if (it->socket) {
                int thread_safe;
                size_t thread_safe_size = sizeof(int);

                if (it->socket->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == -1)
                    return -1;

298
                if (!thread_safe) {
299 300 301 302
                    size_t fd_size = sizeof (zmq::fd_t);
                    if (it->socket->getsockopt (ZMQ_FD, &pollfds [item_nbr].fd, &fd_size) == -1) {
                        return -1;
                    }
303

304 305 306 307 308 309 310 311 312 313 314
                    pollfds [item_nbr].events = POLLIN;
                    item_nbr++;
                }
            }
            else {
                pollfds [item_nbr].fd = it->fd;
                pollfds [item_nbr].events =
                    (it->events & ZMQ_POLLIN ? POLLIN : 0) |
                    (it->events & ZMQ_POLLOUT ? POLLOUT : 0) |
                    (it->events & ZMQ_POLLPRI ? POLLPRI : 0);
                it->pollfd_index = item_nbr;
315
                item_nbr++;
316 317 318
            }
        }
    }
319

320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343
 #elif defined ZMQ_POLL_BASED_ON_SELECT

    FD_ZERO (&pollset_in);
    FD_ZERO (&pollset_out);
    FD_ZERO (&pollset_err);

    //  Ensure we do not attempt to select () on more than FD_SETSIZE
    //  file descriptors.
    zmq_assert (items.size () <= FD_SETSIZE);

    poll_size = 0;

    use_signaler = false;

    for (items_t::iterator it = items.begin (); it != items.end (); ++it) {
        if (it->socket) {
            int thread_safe;
            size_t thread_safe_size = sizeof(int);

            if (it->socket->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == -1)
                return -1;

            if (thread_safe && it->events) {
                use_signaler = true;
344
                FD_SET (signaler->get_fd (), &pollset_in);
345 346 347
                poll_size = 1;
                break;
            }
348 349
        }
    }
350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372

    maxfd = 0;

    //  Build the fd_sets for passing to select ().
    for (items_t::iterator it = items.begin (); it != items.end (); ++it) {
        if (it->events) {
            //  If the poll item is a 0MQ socket we are interested in input on the
            //  notification file descriptor retrieved by the ZMQ_FD socket option.
            if (it->socket) {
                int thread_safe;
                size_t thread_safe_size = sizeof(int);

                if (it->socket->getsockopt (ZMQ_THREAD_SAFE, &thread_safe, &thread_safe_size) == -1)
                    return -1;

                if (!thread_safe) {
                    zmq::fd_t notify_fd;
                    size_t fd_size = sizeof (zmq::fd_t);
                    if (it->socket->getsockopt (ZMQ_FD, &notify_fd, &fd_size) == -1)
                        return -1;

                    FD_SET (notify_fd, &pollset_in);
                    if (maxfd < notify_fd)
373
                        maxfd = notify_fd;
374

375
                    poll_size++;
376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397
                }
            }
            //  Else, the poll item is a raw file descriptor. Convert the poll item
            //  events to the appropriate fd_sets.
            else {
                if (it->events & ZMQ_POLLIN)
                    FD_SET (it->fd, &pollset_in);
                if (it->events & ZMQ_POLLOUT)
                    FD_SET (it->fd, &pollset_out);
                if (it->events & ZMQ_POLLERR)
                    FD_SET (it->fd, &pollset_err);
                if (maxfd < it->fd)
                    maxfd = it->fd;

                poll_size++;
            }
        }
    }

#endif

    need_rebuild = false;
398 399 400
    return 0;
}

401
int zmq::socket_poller_t::wait (zmq::socket_poller_t::event_t *events_, int n_events_, long timeout_)
402
{
403 404 405 406 407 408
    if (need_rebuild)
        if (rebuild () == -1)
            return -1;

#if defined ZMQ_POLL_BASED_ON_POLL
    if (unlikely (poll_size == 0)) {
409 410 411 412
        // We'll report an error (timed out) as if the list was non-empty and
        // no event occured within the specified timeout. Otherwise the caller
        // needs to check the return value AND the event to avoid using the
        // nullified event data.
413
        errno = ETIMEDOUT;
414
        if (timeout_ == 0)
415
            return -1;
416 417
#if defined ZMQ_HAVE_WINDOWS
        Sleep (timeout_ > 0 ? timeout_ : INFINITE);
418
        return -1;
419 420
#elif defined ZMQ_HAVE_ANDROID
        usleep (timeout_ * 1000);
421
        return -1;
422
#else
423 424
        usleep (timeout_ * 1000);
        return -1;
425
#endif
426 427
    }

428 429 430
    zmq::clock_t clock;
    uint64_t now = 0;
    uint64_t end = 0;
431

432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456
    bool first_pass = true;

    while (true) {
        //  Compute the timeout for the subsequent poll.
        int timeout;
        if (first_pass)
            timeout = 0;
        else
        if (timeout_ < 0)
            timeout = -1;
        else
            timeout = end - now;

        //  Wait for events.
        while (true) {
            int rc = poll (pollfds, poll_size, timeout);
            if (rc == -1 && errno == EINTR) {
                return -1;
            }
            errno_assert (rc >= 0);
            break;
        }

        //  Receive the signal from pollfd
        if (use_signaler && pollfds[0].revents & POLLIN)
457
            signaler->recv ();
458 459

        //  Check for the events.
460 461
        int found = 0;
        for (items_t::iterator it = items.begin (); it != items.end () && found < n_events_; ++it) {
462

463 464 465 466
            events_[found].socket = NULL;
            events_[found].fd = 0;
            events_[found].user_data = NULL;
            events_[found].events = 0;
467 468 469 470 471 472 473 474 475 476 477

            //  The poll item is a 0MQ socket. Retrieve pending events
            //  using the ZMQ_EVENTS socket option.
            if (it->socket) {
                size_t events_size = sizeof (uint32_t);
                uint32_t events;
                if (it->socket->getsockopt (ZMQ_EVENTS, &events, &events_size) == -1) {
                    return -1;
                }

                if (it->events & events) {
478 479 480 481
                    events_[found].socket = it->socket;
                    events_[found].user_data = it->user_data;
                    events_[found].events = it->events & events;
                    ++found;
482
                }
483 484 485 486 487
            }
            //  Else, the poll item is a raw file descriptor, simply convert
            //  the events to zmq_pollitem_t-style format.
            else {
                short revents = pollfds [it->pollfd_index].revents;
488 489
                short events = 0;

490 491 492 493 494 495 496 497 498 499
                if (revents & POLLIN)
                    events |= ZMQ_POLLIN;
                if (revents & POLLOUT)
                    events |= ZMQ_POLLOUT;
                if (revents & POLLPRI)
                    events |= ZMQ_POLLPRI;
                if (revents & ~(POLLIN | POLLOUT | POLLPRI))
                    events |= ZMQ_POLLERR;

                if (events) {
500 501 502 503 504
                    events_[found].socket = NULL;
                    events_[found].user_data = it->user_data;
                    events_[found].fd = it->fd;
                    events_[found].events = events;
                    ++found;
505 506 507
                }
            }
        }
508
        if (found) {
509 510 511 512 513 514 515
            for (int i = found; i < n_events_; ++i) {
                events_[i].socket = NULL;
                events_[i].fd = 0;
                events_[i].user_data = NULL;
                events_[i].events = 0;
            }
            return found;
516
        }
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546

        //  If timeout is zero, exit immediately whether there are events or not.
        if (timeout_ == 0)
            break;

        //  At this point we are meant to wait for events but there are none.
        //  If timeout is infinite we can just loop until we get some events.
        if (timeout_ < 0) {
            if (first_pass)
                first_pass = false;
            continue;
        }

        //  The timeout is finite and there are no events. In the first pass
        //  we get a timestamp of when the polling have begun. (We assume that
        //  first pass have taken negligible time). We also compute the time
        //  when the polling should time out.
        if (first_pass) {
            now = clock.now_ms ();
            end = now + timeout_;
            if (now == end)
                break;
            first_pass = false;
            continue;
        }

        //  Find out whether timeout have expired.
        now = clock.now_ms ();
        if (now >= end)
            break;
547
    }
548 549 550 551 552 553
    errno = ETIMEDOUT;
    return -1;

#elif defined ZMQ_POLL_BASED_ON_SELECT

    if (unlikely (poll_size == 0)) {
554 555 556 557 558
        // We'll report an error (timed out) as if the list was non-empty and
        // no event occured within the specified timeout. Otherwise the caller
        // needs to check the return value AND the event to avoid using the
        // nullified event data.
        errno = ETIMEDOUT;
559
        if (timeout_ == 0)
560
            return -1;
561 562
#if defined ZMQ_HAVE_WINDOWS
        Sleep (timeout_ > 0 ? timeout_ : INFINITE);
563
        return -1;
564
#else
565 566
        usleep (timeout_ * 1000);
        return -1;
567 568 569 570 571 572
#endif
    }
    zmq::clock_t clock;
    uint64_t now = 0;
    uint64_t end = 0;

573
    bool first_pass = true;
574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597
    fd_set inset, outset, errset;

    while (true) {

        //  Compute the timeout for the subsequent poll.
        timeval timeout;
        timeval *ptimeout;
        if (first_pass) {
            timeout.tv_sec = 0;
            timeout.tv_usec = 0;
            ptimeout = &timeout;
        }
        else
        if (timeout_ < 0)
            ptimeout = NULL;
        else {
            timeout.tv_sec = (long) ((end - now) / 1000);
            timeout.tv_usec = (long) ((end - now) % 1000 * 1000);
            ptimeout = &timeout;
        }

        //  Wait for events. Ignore interrupts if there's infinite timeout.
        while (true) {
#if defined ZMQ_HAVE_WINDOWS
598 599 600 601
            // On Windows we don't need to copy the whole fd_set.
            // SOCKETS are continuous from the beginning of fd_array in fd_set.
            // We just need to copy fd_count elements of fd_array.
            // We gain huge memcpy() improvement if number of used SOCKETs is much lower than FD_SETSIZE.
602 603 604
            memcpy (&inset,  &pollset_in,  (char *) (pollset_in.fd_array  + pollset_in.fd_count ) - (char *) &pollset_in );
            memcpy (&outset, &pollset_out, (char *) (pollset_out.fd_array + pollset_out.fd_count) - (char *) &pollset_out);
            memcpy (&errset, &pollset_err, (char *) (pollset_err.fd_array + pollset_err.fd_count) - (char *) &pollset_err);
605 606 607 608 609 610 611
            int rc = select (0, &inset, &outset, &errset, ptimeout);
            if (unlikely (rc == SOCKET_ERROR)) {
                errno = zmq::wsa_error_to_errno (WSAGetLastError ());
                wsa_assert (errno == ENOTSOCK);
                return -1;
            }
#else
612 613 614
            memcpy (&inset, &pollset_in, sizeof (fd_set));
            memcpy (&outset, &pollset_out, sizeof (fd_set));
            memcpy (&errset, &pollset_err, sizeof (fd_set));
615 616 617 618 619 620 621 622 623
            int rc = select (maxfd + 1, &inset, &outset, &errset, ptimeout);
            if (unlikely (rc == -1)) {
                errno_assert (errno == EINTR || errno == EBADF);
                return -1;
            }
#endif
            break;
        }

624 625
        if (use_signaler && FD_ISSET (signaler->get_fd (), &inset))
            signaler->recv ();
626 627

        //  Check for the events.
628 629
        int found = 0;
        for (items_t::iterator it = items.begin (); it != items.end () && found < n_events_; ++it) {
630 631 632 633 634 635 636 637 638 639

            //  The poll item is a 0MQ socket. Retrieve pending events
            //  using the ZMQ_EVENTS socket option.
            if (it->socket) {
                size_t events_size = sizeof (uint32_t);
                uint32_t events;
                if (it->socket->getsockopt (ZMQ_EVENTS, &events, &events_size) == -1)
                    return -1;

                if (it->events & events) {
640 641 642 643
                    events_[found].socket = it->socket;
                    events_[found].user_data = it->user_data;
                    events_[found].events = it->events & events;
                    ++found;
644
                }
645 646 647 648 649 650 651 652 653 654 655 656
            }
            //  Else, the poll item is a raw file descriptor, simply convert
            //  the events to zmq_pollitem_t-style format.
            else {
                short events = 0;

                if (FD_ISSET (it->fd, &inset))
                    events |= ZMQ_POLLIN;
                if (FD_ISSET (it->fd, &outset))
                    events |= ZMQ_POLLOUT;
                if (FD_ISSET (it->fd, &errset))
                    events |= ZMQ_POLLERR;
657

658
                if (events) {
659 660 661 662 663
                    events_[found].socket = NULL;
                    events_[found].user_data = it->user_data;
                    events_[found].fd = it->fd;
                    events_[found].events = events;
                    ++found;
664 665 666
                }
            }
        }
667
        if (found) {
668 669 670 671 672 673 674 675
            // zero-out remaining events
            for (int i = found; i < n_events_; ++i) {
                events_[i].socket = NULL;
                events_[i].fd = 0;
                events_[i].user_data = NULL;
                events_[i].events = 0;
            }
            return found;
676
        }
677

678 679 680
        //  If timeout is zero, exit immediately whether there are events or not.
        if (timeout_ == 0)
            break;
681

682 683 684 685 686 687 688
        //  At this point we are meant to wait for events but there are none.
        //  If timeout is infinite we can just loop until we get some events.
        if (timeout_ < 0) {
            if (first_pass)
                first_pass = false;
            continue;
        }
689

690 691 692 693 694 695 696 697 698 699 700 701
        //  The timeout is finite and there are no events. In the first pass
        //  we get a timestamp of when the polling have begun. (We assume that
        //  first pass have taken negligible time). We also compute the time
        //  when the polling should time out.
        if (first_pass) {
            now = clock.now_ms ();
            end = now + timeout_;
            if (now == end)
                break;
            first_pass = false;
            continue;
        }
702

703 704 705 706
        //  Find out whether timeout have expired.
        now = clock.now_ms ();
        if (now >= end)
            break;
707 708
    }

709 710 711 712 713 714 715 716
    errno = ETIMEDOUT;
    return -1;

#else
    //  Exotic platforms that support neither poll() nor select().
    errno = ENOTSUP;
    return -1;
#endif
717
}