X-Git-Url: https://git.lttng.org/?a=blobdiff_plain;f=src%2Fcommon%2Fcompat%2Fcompat-poll.c;h=4ea23c17318e1439f36a94b134194d13b070e4de;hb=9f32e9bf43a6438c55f35d3c5ed1c378d0c715c4;hp=b45b39dc6bdbd45daf69944316b1d663f1744867;hpb=8a2827515ad2b019753b84bcc3cb726af4ae428d;p=lttng-tools.git diff --git a/src/common/compat/compat-poll.c b/src/common/compat/compat-poll.c index b45b39dc6..4ea23c173 100644 --- a/src/common/compat/compat-poll.c +++ b/src/common/compat/compat-poll.c @@ -1,5 +1,6 @@ /* * Copyright (C) 2011 - David Goulet + * Copyright (C) 2019 - Yannick Lamarre * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License, version 2 only, @@ -204,10 +205,10 @@ int compat_poll_mod(struct lttng_poll_event *events, int fd, uint32_t req_events) { int i; - bool fd_found = false; struct compat_poll_event_array *current; - if (events == NULL || events->current.events == NULL || fd < 0) { + if (events == NULL || events->current.nb_fd == 0 || + events->current.events == NULL || fd < 0) { ERR("Bad compat poll mod arguments"); goto error; } @@ -216,16 +217,16 @@ int compat_poll_mod(struct lttng_poll_event *events, int fd, for (i = 0; i < current->nb_fd; i++) { if (current->events[i].fd == fd) { - fd_found = true; current->events[i].events = req_events; events->need_update = 1; break; } } - if (!fd_found) { - goto error; - } + /* + * The epoll flavor doesn't flag modifying a non-included FD as an + * error. + */ return 0; @@ -238,11 +239,12 @@ error: */ int compat_poll_del(struct lttng_poll_event *events, int fd) { - int new_size, i, count = 0, ret; + int i, count = 0, ret; + uint32_t new_size; struct compat_poll_event_array *current; - if (events == NULL || events->current.events == NULL || fd < 0) { - ERR("Wrong arguments for poll del"); + if (events == NULL || events->current.nb_fd == 0 || + events->current.events == NULL || fd < 0) { goto error; } @@ -257,13 +259,20 @@ int compat_poll_del(struct lttng_poll_event *events, int fd) count++; } } + + /* The fd was not in our set, return no error as with epoll. */ + if (current->nb_fd == count) { + goto end; + } + /* No fd duplicate should be ever added into array. */ assert(current->nb_fd - 1 == count); current->nb_fd = count; /* Resize array if needed. */ new_size = 1U << utils_get_count_order_u32(current->nb_fd); - if (new_size != current->alloc_size && new_size >= current->init_size) { + if (new_size != current->alloc_size && new_size >= current->init_size + && current->nb_fd != 0) { ret = resize_poll_event(current, new_size); if (ret < 0) { goto error; @@ -272,6 +281,7 @@ int compat_poll_del(struct lttng_poll_event *events, int fd) events->need_update = 1; +end: return 0; error: @@ -281,9 +291,12 @@ error: /* * Wait on poll() with timeout. Blocking call. */ -int compat_poll_wait(struct lttng_poll_event *events, int timeout) +int compat_poll_wait(struct lttng_poll_event *events, int timeout, + bool interruptible) { - int ret; + int ret, active_fd_count; + int idle_pfd_index = 0; + size_t i; if (events == NULL || events->current.events == NULL) { ERR("poll wait arguments error"); @@ -308,18 +321,47 @@ int compat_poll_wait(struct lttng_poll_event *events, int timeout) do { ret = poll(events->wait.events, events->wait.nb_fd, timeout); - } while (ret == -1 && errno == EINTR); + } while (!interruptible && ret == -1 && errno == EINTR); if (ret < 0) { - /* At this point, every error is fatal */ - PERROR("poll wait"); + if (errno != EINTR) { + PERROR("poll wait"); + } goto error; } + active_fd_count = ret; + /* - * poll() should always iterate on all FDs since we handle the pollset in - * user space and after poll returns, we have to try every fd for a match. + * Swap all active pollfd structs to the beginning of the + * array to emulate compat-epoll behaviour. This algorithm takes + * advantage of poll's returned value and the burst nature of active + * events on the file descriptors. The while loop guarantees that + * idle_pfd will always point to an idle fd. */ - return events->wait.nb_fd; + if (active_fd_count == events->wait.nb_fd) { + goto end; + } + while (idle_pfd_index < active_fd_count && + events->wait.events[idle_pfd_index].revents != 0) { + idle_pfd_index++; + } + + for (i = idle_pfd_index + 1; idle_pfd_index < active_fd_count; + i++) { + struct pollfd swap_pfd; + struct pollfd *idle_pfd = &events->wait.events[idle_pfd_index]; + struct pollfd *current_pfd = &events->wait.events[i]; + + if (idle_pfd->revents != 0) { + swap_pfd = *current_pfd; + *current_pfd = *idle_pfd; + *idle_pfd = swap_pfd; + idle_pfd_index++; + } + } + +end: + return ret; error: return -1;