mirror of https://github.com/grpc/grpc.git
pull/5726/head
Craig Tiller
9 years ago
commit
60aa010905
129 changed files with 6724 additions and 10569 deletions
@ -0,0 +1,2 @@ |
|||||||
|
dns: scheme name resolution, using getaddrbyname |
||||||
|
(or other OS specific implementation) |
||||||
@ -0,0 +1 @@ |
|||||||
|
Support for resolving ipv4:, ipv6:, unix: schemes |
||||||
@ -0,0 +1 @@ |
|||||||
|
Zookeeper based name resolver: WIP |
||||||
@ -1,42 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#ifndef GRPC_CORE_LIB_CLIENT_CONFIG_RESOLVERS_DNS_RESOLVER_H |
|
||||||
#define GRPC_CORE_LIB_CLIENT_CONFIG_RESOLVERS_DNS_RESOLVER_H |
|
||||||
|
|
||||||
#include "src/core/lib/client_config/resolver_factory.h" |
|
||||||
|
|
||||||
/** Create a dns resolver factory */ |
|
||||||
grpc_resolver_factory *grpc_dns_resolver_factory_create(void); |
|
||||||
|
|
||||||
#endif /* GRPC_CORE_LIB_CLIENT_CONFIG_RESOLVERS_DNS_RESOLVER_H */ |
|
||||||
@ -1,42 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#ifndef GRPC_CORE_LIB_CLIENT_CONFIG_RESOLVERS_ZOOKEEPER_RESOLVER_H |
|
||||||
#define GRPC_CORE_LIB_CLIENT_CONFIG_RESOLVERS_ZOOKEEPER_RESOLVER_H |
|
||||||
|
|
||||||
#include "src/core/lib/client_config/resolver_factory.h" |
|
||||||
|
|
||||||
/** Create a zookeeper resolver factory */ |
|
||||||
grpc_resolver_factory *grpc_zookeeper_resolver_factory_create(void); |
|
||||||
|
|
||||||
#endif /* GRPC_CORE_LIB_CLIENT_CONFIG_RESOLVERS_ZOOKEEPER_RESOLVER_H */ |
|
||||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,165 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2015-2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * 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. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#include <grpc/support/port_platform.h> |
||||||
|
|
||||||
|
#ifdef GPR_POSIX_SOCKET |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/ev_posix.h" |
||||||
|
|
||||||
|
#include <grpc/support/log.h> |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/ev_poll_and_epoll_posix.h" |
||||||
|
|
||||||
|
static const grpc_event_engine_vtable *g_event_engine; |
||||||
|
|
||||||
|
grpc_poll_function_type grpc_poll_function = poll; |
||||||
|
grpc_wakeup_fd grpc_global_wakeup_fd; |
||||||
|
|
||||||
|
void grpc_event_engine_init(void) { |
||||||
|
if ((g_event_engine = grpc_init_poll_and_epoll_posix())) { |
||||||
|
return; |
||||||
|
} |
||||||
|
gpr_log(GPR_ERROR, "No event engine could be initialized"); |
||||||
|
abort(); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_event_engine_shutdown(void) { g_event_engine->shutdown_engine(); } |
||||||
|
|
||||||
|
grpc_fd *grpc_fd_create(int fd, const char *name) { |
||||||
|
return g_event_engine->fd_create(fd, name); |
||||||
|
} |
||||||
|
|
||||||
|
int grpc_fd_wrapped_fd(grpc_fd *fd) { |
||||||
|
return g_event_engine->fd_wrapped_fd(fd); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_fd_orphan(grpc_exec_ctx *exec_ctx, grpc_fd *fd, grpc_closure *on_done, |
||||||
|
int *release_fd, const char *reason) { |
||||||
|
g_event_engine->fd_orphan(exec_ctx, fd, on_done, release_fd, reason); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_fd_shutdown(grpc_exec_ctx *exec_ctx, grpc_fd *fd) { |
||||||
|
g_event_engine->fd_shutdown(exec_ctx, fd); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_fd_notify_on_read(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
||||||
|
grpc_closure *closure) { |
||||||
|
g_event_engine->fd_notify_on_read(exec_ctx, fd, closure); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_fd_notify_on_write(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
||||||
|
grpc_closure *closure) { |
||||||
|
g_event_engine->fd_notify_on_write(exec_ctx, fd, closure); |
||||||
|
} |
||||||
|
|
||||||
|
size_t grpc_pollset_size(void) { return g_event_engine->pollset_size; } |
||||||
|
|
||||||
|
void grpc_pollset_init(grpc_pollset *pollset, gpr_mu **mu) { |
||||||
|
g_event_engine->pollset_init(pollset, mu); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_shutdown(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
grpc_closure *closure) { |
||||||
|
g_event_engine->pollset_shutdown(exec_ctx, pollset, closure); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_reset(grpc_pollset *pollset) { |
||||||
|
g_event_engine->pollset_reset(pollset); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_destroy(grpc_pollset *pollset) { |
||||||
|
g_event_engine->pollset_destroy(pollset); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_work(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
grpc_pollset_worker **worker, gpr_timespec now, |
||||||
|
gpr_timespec deadline) { |
||||||
|
g_event_engine->pollset_work(exec_ctx, pollset, worker, now, deadline); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_kick(grpc_pollset *pollset, |
||||||
|
grpc_pollset_worker *specific_worker) { |
||||||
|
g_event_engine->pollset_kick(pollset, specific_worker); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_add_fd(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
struct grpc_fd *fd) { |
||||||
|
g_event_engine->pollset_add_fd(exec_ctx, pollset, fd); |
||||||
|
} |
||||||
|
|
||||||
|
grpc_pollset_set *grpc_pollset_set_create(void) { |
||||||
|
return g_event_engine->pollset_set_create(); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_destroy(grpc_pollset_set *pollset_set) { |
||||||
|
g_event_engine->pollset_set_destroy(pollset_set); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_add_pollset(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, |
||||||
|
grpc_pollset *pollset) { |
||||||
|
g_event_engine->pollset_set_add_pollset(exec_ctx, pollset_set, pollset); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_del_pollset(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, |
||||||
|
grpc_pollset *pollset) { |
||||||
|
g_event_engine->pollset_set_del_pollset(exec_ctx, pollset_set, pollset); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_add_pollset_set(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *bag, |
||||||
|
grpc_pollset_set *item) { |
||||||
|
g_event_engine->pollset_set_add_pollset_set(exec_ctx, bag, item); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_del_pollset_set(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *bag, |
||||||
|
grpc_pollset_set *item) { |
||||||
|
g_event_engine->pollset_set_del_pollset_set(exec_ctx, bag, item); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_add_fd(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, grpc_fd *fd) { |
||||||
|
g_event_engine->pollset_set_add_fd(exec_ctx, pollset_set, fd); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_pollset_set_del_fd(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, grpc_fd *fd) { |
||||||
|
g_event_engine->pollset_set_del_fd(exec_ctx, pollset_set, fd); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_kick_poller(void) { g_event_engine->kick_poller(); } |
||||||
|
|
||||||
|
#endif // GPR_POSIX_SOCKET
|
||||||
@ -0,0 +1,158 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2015-2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * 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. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#ifndef GRPC_CORE_LIB_IOMGR_EV_POSIX_H |
||||||
|
#define GRPC_CORE_LIB_IOMGR_EV_POSIX_H |
||||||
|
|
||||||
|
#include <poll.h> |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/exec_ctx.h" |
||||||
|
#include "src/core/lib/iomgr/pollset.h" |
||||||
|
#include "src/core/lib/iomgr/pollset_set.h" |
||||||
|
#include "src/core/lib/iomgr/wakeup_fd_posix.h" |
||||||
|
|
||||||
|
typedef struct grpc_fd grpc_fd; |
||||||
|
|
||||||
|
typedef struct grpc_event_engine_vtable { |
||||||
|
size_t pollset_size; |
||||||
|
|
||||||
|
grpc_fd *(*fd_create)(int fd, const char *name); |
||||||
|
int (*fd_wrapped_fd)(grpc_fd *fd); |
||||||
|
void (*fd_orphan)(grpc_exec_ctx *exec_ctx, grpc_fd *fd, grpc_closure *on_done, |
||||||
|
int *release_fd, const char *reason); |
||||||
|
void (*fd_shutdown)(grpc_exec_ctx *exec_ctx, grpc_fd *fd); |
||||||
|
void (*fd_notify_on_read)(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
||||||
|
grpc_closure *closure); |
||||||
|
void (*fd_notify_on_write)(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
||||||
|
grpc_closure *closure); |
||||||
|
|
||||||
|
void (*pollset_init)(grpc_pollset *pollset, gpr_mu **mu); |
||||||
|
void (*pollset_shutdown)(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
grpc_closure *closure); |
||||||
|
void (*pollset_reset)(grpc_pollset *pollset); |
||||||
|
void (*pollset_destroy)(grpc_pollset *pollset); |
||||||
|
void (*pollset_work)(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
grpc_pollset_worker **worker, gpr_timespec now, |
||||||
|
gpr_timespec deadline); |
||||||
|
void (*pollset_kick)(grpc_pollset *pollset, |
||||||
|
grpc_pollset_worker *specific_worker); |
||||||
|
void (*pollset_add_fd)(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
struct grpc_fd *fd); |
||||||
|
|
||||||
|
grpc_pollset_set *(*pollset_set_create)(void); |
||||||
|
void (*pollset_set_destroy)(grpc_pollset_set *pollset_set); |
||||||
|
void (*pollset_set_add_pollset)(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, |
||||||
|
grpc_pollset *pollset); |
||||||
|
void (*pollset_set_del_pollset)(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, |
||||||
|
grpc_pollset *pollset); |
||||||
|
void (*pollset_set_add_pollset_set)(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *bag, |
||||||
|
grpc_pollset_set *item); |
||||||
|
void (*pollset_set_del_pollset_set)(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *bag, |
||||||
|
grpc_pollset_set *item); |
||||||
|
void (*pollset_set_add_fd)(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, grpc_fd *fd); |
||||||
|
void (*pollset_set_del_fd)(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, grpc_fd *fd); |
||||||
|
|
||||||
|
void (*kick_poller)(void); |
||||||
|
|
||||||
|
void (*shutdown_engine)(void); |
||||||
|
} grpc_event_engine_vtable; |
||||||
|
|
||||||
|
void grpc_event_engine_init(void); |
||||||
|
void grpc_event_engine_shutdown(void); |
||||||
|
|
||||||
|
/* Create a wrapped file descriptor.
|
||||||
|
Requires fd is a non-blocking file descriptor. |
||||||
|
This takes ownership of closing fd. */ |
||||||
|
grpc_fd *grpc_fd_create(int fd, const char *name); |
||||||
|
|
||||||
|
/* Return the wrapped fd, or -1 if it has been released or closed. */ |
||||||
|
int grpc_fd_wrapped_fd(grpc_fd *fd); |
||||||
|
|
||||||
|
/* Releases fd to be asynchronously destroyed.
|
||||||
|
on_done is called when the underlying file descriptor is definitely close()d. |
||||||
|
If on_done is NULL, no callback will be made. |
||||||
|
If release_fd is not NULL, it's set to fd and fd will not be closed. |
||||||
|
Requires: *fd initialized; no outstanding notify_on_read or |
||||||
|
notify_on_write. |
||||||
|
MUST NOT be called with a pollset lock taken */ |
||||||
|
void grpc_fd_orphan(grpc_exec_ctx *exec_ctx, grpc_fd *fd, grpc_closure *on_done, |
||||||
|
int *release_fd, const char *reason); |
||||||
|
|
||||||
|
/* Cause any current callbacks to error out with GRPC_CALLBACK_CANCELLED. */ |
||||||
|
void grpc_fd_shutdown(grpc_exec_ctx *exec_ctx, grpc_fd *fd); |
||||||
|
|
||||||
|
/* Register read interest, causing read_cb to be called once when fd becomes
|
||||||
|
readable, on deadline specified by deadline, or on shutdown triggered by |
||||||
|
grpc_fd_shutdown. |
||||||
|
read_cb will be called with read_cb_arg when *fd becomes readable. |
||||||
|
read_cb is Called with status of GRPC_CALLBACK_SUCCESS if readable, |
||||||
|
GRPC_CALLBACK_TIMED_OUT if the call timed out, |
||||||
|
and CANCELLED if the call was cancelled. |
||||||
|
|
||||||
|
Requires:This method must not be called before the read_cb for any previous |
||||||
|
call runs. Edge triggered events are used whenever they are supported by the |
||||||
|
underlying platform. This means that users must drain fd in read_cb before |
||||||
|
calling notify_on_read again. Users are also expected to handle spurious |
||||||
|
events, i.e read_cb is called while nothing can be readable from fd */ |
||||||
|
void grpc_fd_notify_on_read(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
||||||
|
grpc_closure *closure); |
||||||
|
|
||||||
|
/* Exactly the same semantics as above, except based on writable events. */ |
||||||
|
void grpc_fd_notify_on_write(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
||||||
|
grpc_closure *closure); |
||||||
|
|
||||||
|
/* pollset_posix functions */ |
||||||
|
|
||||||
|
/* Add an fd to a pollset */ |
||||||
|
void grpc_pollset_add_fd(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
||||||
|
struct grpc_fd *fd); |
||||||
|
|
||||||
|
/* pollset_set_posix functions */ |
||||||
|
|
||||||
|
void grpc_pollset_set_add_fd(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, grpc_fd *fd); |
||||||
|
void grpc_pollset_set_del_fd(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_pollset_set *pollset_set, grpc_fd *fd); |
||||||
|
|
||||||
|
/* override to allow tests to hook poll() usage */ |
||||||
|
typedef int (*grpc_poll_function_type)(struct pollfd *, nfds_t, int); |
||||||
|
extern grpc_poll_function_type grpc_poll_function; |
||||||
|
extern grpc_wakeup_fd grpc_global_wakeup_fd; |
||||||
|
|
||||||
|
#endif /* GRPC_CORE_LIB_IOMGR_EV_POSIX_H */ |
||||||
@ -1,454 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#include <grpc/support/port_platform.h> |
|
||||||
|
|
||||||
#ifdef GPR_POSIX_SOCKET |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/fd_posix.h" |
|
||||||
|
|
||||||
#include <assert.h> |
|
||||||
#include <sys/socket.h> |
|
||||||
#include <unistd.h> |
|
||||||
|
|
||||||
#include <grpc/support/alloc.h> |
|
||||||
#include <grpc/support/log.h> |
|
||||||
#include <grpc/support/string_util.h> |
|
||||||
#include <grpc/support/useful.h> |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/pollset_posix.h" |
|
||||||
|
|
||||||
#define CLOSURE_NOT_READY ((grpc_closure *)0) |
|
||||||
#define CLOSURE_READY ((grpc_closure *)1) |
|
||||||
|
|
||||||
/* We need to keep a freelist not because of any concerns of malloc performance
|
|
||||||
* but instead so that implementations with multiple threads in (for example) |
|
||||||
* epoll_wait deal with the race between pollset removal and incoming poll |
|
||||||
* notifications. |
|
||||||
* |
|
||||||
* The problem is that the poller ultimately holds a reference to this |
|
||||||
* object, so it is very difficult to know when is safe to free it, at least |
|
||||||
* without some expensive synchronization. |
|
||||||
* |
|
||||||
* If we keep the object freelisted, in the worst case losing this race just |
|
||||||
* becomes a spurious read notification on a reused fd. |
|
||||||
*/ |
|
||||||
/* TODO(klempner): We could use some form of polling generation count to know
|
|
||||||
* when these are safe to free. */ |
|
||||||
/* TODO(klempner): Consider disabling freelisting if we don't have multiple
|
|
||||||
* threads in poll on the same fd */ |
|
||||||
/* TODO(klempner): Batch these allocations to reduce fragmentation */ |
|
||||||
static grpc_fd *fd_freelist = NULL; |
|
||||||
static gpr_mu fd_freelist_mu; |
|
||||||
|
|
||||||
static void freelist_fd(grpc_fd *fd) { |
|
||||||
gpr_mu_lock(&fd_freelist_mu); |
|
||||||
fd->freelist_next = fd_freelist; |
|
||||||
fd_freelist = fd; |
|
||||||
grpc_iomgr_unregister_object(&fd->iomgr_object); |
|
||||||
gpr_mu_unlock(&fd_freelist_mu); |
|
||||||
} |
|
||||||
|
|
||||||
static grpc_fd *alloc_fd(int fd) { |
|
||||||
grpc_fd *r = NULL; |
|
||||||
gpr_mu_lock(&fd_freelist_mu); |
|
||||||
if (fd_freelist != NULL) { |
|
||||||
r = fd_freelist; |
|
||||||
fd_freelist = fd_freelist->freelist_next; |
|
||||||
} |
|
||||||
gpr_mu_unlock(&fd_freelist_mu); |
|
||||||
if (r == NULL) { |
|
||||||
r = gpr_malloc(sizeof(grpc_fd)); |
|
||||||
gpr_mu_init(&r->mu); |
|
||||||
} |
|
||||||
|
|
||||||
gpr_mu_lock(&r->mu); |
|
||||||
r->shutdown = 0; |
|
||||||
r->read_closure = CLOSURE_NOT_READY; |
|
||||||
r->write_closure = CLOSURE_NOT_READY; |
|
||||||
r->fd = fd; |
|
||||||
r->inactive_watcher_root.next = r->inactive_watcher_root.prev = |
|
||||||
&r->inactive_watcher_root; |
|
||||||
r->freelist_next = NULL; |
|
||||||
r->read_watcher = r->write_watcher = NULL; |
|
||||||
r->on_done_closure = NULL; |
|
||||||
r->closed = 0; |
|
||||||
r->released = 0; |
|
||||||
gpr_atm_rel_store(&r->refst, 1); |
|
||||||
gpr_mu_unlock(&r->mu); |
|
||||||
|
|
||||||
return r; |
|
||||||
} |
|
||||||
|
|
||||||
static void destroy(grpc_fd *fd) { |
|
||||||
gpr_mu_destroy(&fd->mu); |
|
||||||
gpr_free(fd); |
|
||||||
} |
|
||||||
|
|
||||||
#ifdef GRPC_FD_REF_COUNT_DEBUG |
|
||||||
#define REF_BY(fd, n, reason) ref_by(fd, n, reason, __FILE__, __LINE__) |
|
||||||
#define UNREF_BY(fd, n, reason) unref_by(fd, n, reason, __FILE__, __LINE__) |
|
||||||
static void ref_by(grpc_fd *fd, int n, const char *reason, const char *file, |
|
||||||
int line) { |
|
||||||
gpr_log(GPR_DEBUG, "FD %d %p ref %d %d -> %d [%s; %s:%d]", fd->fd, fd, n, |
|
||||||
gpr_atm_no_barrier_load(&fd->refst), |
|
||||||
gpr_atm_no_barrier_load(&fd->refst) + n, reason, file, line); |
|
||||||
#else |
|
||||||
#define REF_BY(fd, n, reason) ref_by(fd, n) |
|
||||||
#define UNREF_BY(fd, n, reason) unref_by(fd, n) |
|
||||||
static void ref_by(grpc_fd *fd, int n) { |
|
||||||
#endif |
|
||||||
GPR_ASSERT(gpr_atm_no_barrier_fetch_add(&fd->refst, n) > 0); |
|
||||||
} |
|
||||||
|
|
||||||
#ifdef GRPC_FD_REF_COUNT_DEBUG |
|
||||||
static void unref_by(grpc_fd *fd, int n, const char *reason, const char *file, |
|
||||||
int line) { |
|
||||||
gpr_atm old; |
|
||||||
gpr_log(GPR_DEBUG, "FD %d %p unref %d %d -> %d [%s; %s:%d]", fd->fd, fd, n, |
|
||||||
gpr_atm_no_barrier_load(&fd->refst), |
|
||||||
gpr_atm_no_barrier_load(&fd->refst) - n, reason, file, line); |
|
||||||
#else |
|
||||||
static void unref_by(grpc_fd *fd, int n) { |
|
||||||
gpr_atm old; |
|
||||||
#endif |
|
||||||
old = gpr_atm_full_fetch_add(&fd->refst, -n); |
|
||||||
if (old == n) { |
|
||||||
freelist_fd(fd); |
|
||||||
} else { |
|
||||||
GPR_ASSERT(old > n); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_global_init(void) { gpr_mu_init(&fd_freelist_mu); } |
|
||||||
|
|
||||||
void grpc_fd_global_shutdown(void) { |
|
||||||
gpr_mu_lock(&fd_freelist_mu); |
|
||||||
gpr_mu_unlock(&fd_freelist_mu); |
|
||||||
while (fd_freelist != NULL) { |
|
||||||
grpc_fd *fd = fd_freelist; |
|
||||||
fd_freelist = fd_freelist->freelist_next; |
|
||||||
destroy(fd); |
|
||||||
} |
|
||||||
gpr_mu_destroy(&fd_freelist_mu); |
|
||||||
} |
|
||||||
|
|
||||||
grpc_fd *grpc_fd_create(int fd, const char *name) { |
|
||||||
grpc_fd *r = alloc_fd(fd); |
|
||||||
char *name2; |
|
||||||
gpr_asprintf(&name2, "%s fd=%d", name, fd); |
|
||||||
grpc_iomgr_register_object(&r->iomgr_object, name2); |
|
||||||
gpr_free(name2); |
|
||||||
#ifdef GRPC_FD_REF_COUNT_DEBUG |
|
||||||
gpr_log(GPR_DEBUG, "FD %d %p create %s", fd, r, name); |
|
||||||
#endif |
|
||||||
return r; |
|
||||||
} |
|
||||||
|
|
||||||
int grpc_fd_is_orphaned(grpc_fd *fd) { |
|
||||||
return (gpr_atm_acq_load(&fd->refst) & 1) == 0; |
|
||||||
} |
|
||||||
|
|
||||||
static void pollset_kick_locked(grpc_fd_watcher *watcher) { |
|
||||||
gpr_mu_lock(&watcher->pollset->mu); |
|
||||||
GPR_ASSERT(watcher->worker); |
|
||||||
grpc_pollset_kick_ext(watcher->pollset, watcher->worker, |
|
||||||
GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP); |
|
||||||
gpr_mu_unlock(&watcher->pollset->mu); |
|
||||||
} |
|
||||||
|
|
||||||
static void maybe_wake_one_watcher_locked(grpc_fd *fd) { |
|
||||||
if (fd->inactive_watcher_root.next != &fd->inactive_watcher_root) { |
|
||||||
pollset_kick_locked(fd->inactive_watcher_root.next); |
|
||||||
} else if (fd->read_watcher) { |
|
||||||
pollset_kick_locked(fd->read_watcher); |
|
||||||
} else if (fd->write_watcher) { |
|
||||||
pollset_kick_locked(fd->write_watcher); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void wake_all_watchers_locked(grpc_fd *fd) { |
|
||||||
grpc_fd_watcher *watcher; |
|
||||||
for (watcher = fd->inactive_watcher_root.next; |
|
||||||
watcher != &fd->inactive_watcher_root; watcher = watcher->next) { |
|
||||||
pollset_kick_locked(watcher); |
|
||||||
} |
|
||||||
if (fd->read_watcher) { |
|
||||||
pollset_kick_locked(fd->read_watcher); |
|
||||||
} |
|
||||||
if (fd->write_watcher && fd->write_watcher != fd->read_watcher) { |
|
||||||
pollset_kick_locked(fd->write_watcher); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static int has_watchers(grpc_fd *fd) { |
|
||||||
return fd->read_watcher != NULL || fd->write_watcher != NULL || |
|
||||||
fd->inactive_watcher_root.next != &fd->inactive_watcher_root; |
|
||||||
} |
|
||||||
|
|
||||||
static void close_fd_locked(grpc_exec_ctx *exec_ctx, grpc_fd *fd) { |
|
||||||
fd->closed = 1; |
|
||||||
if (!fd->released) { |
|
||||||
close(fd->fd); |
|
||||||
} else { |
|
||||||
grpc_remove_fd_from_all_epoll_sets(fd->fd); |
|
||||||
} |
|
||||||
grpc_exec_ctx_enqueue(exec_ctx, fd->on_done_closure, true, NULL); |
|
||||||
} |
|
||||||
|
|
||||||
int grpc_fd_wrapped_fd(grpc_fd *fd) { |
|
||||||
if (fd->released || fd->closed) { |
|
||||||
return -1; |
|
||||||
} else { |
|
||||||
return fd->fd; |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_orphan(grpc_exec_ctx *exec_ctx, grpc_fd *fd, grpc_closure *on_done, |
|
||||||
int *release_fd, const char *reason) { |
|
||||||
fd->on_done_closure = on_done; |
|
||||||
fd->released = release_fd != NULL; |
|
||||||
if (!fd->released) { |
|
||||||
shutdown(fd->fd, SHUT_RDWR); |
|
||||||
} else { |
|
||||||
*release_fd = fd->fd; |
|
||||||
} |
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
REF_BY(fd, 1, reason); /* remove active status, but keep referenced */ |
|
||||||
if (!has_watchers(fd)) { |
|
||||||
close_fd_locked(exec_ctx, fd); |
|
||||||
} else { |
|
||||||
wake_all_watchers_locked(fd); |
|
||||||
} |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
UNREF_BY(fd, 2, reason); /* drop the reference */ |
|
||||||
} |
|
||||||
|
|
||||||
/* increment refcount by two to avoid changing the orphan bit */ |
|
||||||
#ifdef GRPC_FD_REF_COUNT_DEBUG |
|
||||||
void grpc_fd_ref(grpc_fd *fd, const char *reason, const char *file, int line) { |
|
||||||
ref_by(fd, 2, reason, file, line); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_unref(grpc_fd *fd, const char *reason, const char *file, |
|
||||||
int line) { |
|
||||||
unref_by(fd, 2, reason, file, line); |
|
||||||
} |
|
||||||
#else |
|
||||||
void grpc_fd_ref(grpc_fd *fd) { ref_by(fd, 2); } |
|
||||||
|
|
||||||
void grpc_fd_unref(grpc_fd *fd) { unref_by(fd, 2); } |
|
||||||
#endif |
|
||||||
|
|
||||||
static void notify_on_locked(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
|
||||||
grpc_closure **st, grpc_closure *closure) { |
|
||||||
if (*st == CLOSURE_NOT_READY) { |
|
||||||
/* not ready ==> switch to a waiting state by setting the closure */ |
|
||||||
*st = closure; |
|
||||||
} else if (*st == CLOSURE_READY) { |
|
||||||
/* already ready ==> queue the closure to run immediately */ |
|
||||||
*st = CLOSURE_NOT_READY; |
|
||||||
grpc_exec_ctx_enqueue(exec_ctx, closure, !fd->shutdown, NULL); |
|
||||||
maybe_wake_one_watcher_locked(fd); |
|
||||||
} else { |
|
||||||
/* upcallptr was set to a different closure. This is an error! */ |
|
||||||
gpr_log(GPR_ERROR, |
|
||||||
"User called a notify_on function with a previous callback still " |
|
||||||
"pending"); |
|
||||||
abort(); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
/* returns 1 if state becomes not ready */ |
|
||||||
static int set_ready_locked(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
|
||||||
grpc_closure **st) { |
|
||||||
if (*st == CLOSURE_READY) { |
|
||||||
/* duplicate ready ==> ignore */ |
|
||||||
return 0; |
|
||||||
} else if (*st == CLOSURE_NOT_READY) { |
|
||||||
/* not ready, and not waiting ==> flag ready */ |
|
||||||
*st = CLOSURE_READY; |
|
||||||
return 0; |
|
||||||
} else { |
|
||||||
/* waiting ==> queue closure */ |
|
||||||
grpc_exec_ctx_enqueue(exec_ctx, *st, !fd->shutdown, NULL); |
|
||||||
*st = CLOSURE_NOT_READY; |
|
||||||
return 1; |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void set_ready(grpc_exec_ctx *exec_ctx, grpc_fd *fd, grpc_closure **st) { |
|
||||||
/* only one set_ready can be active at once (but there may be a racing
|
|
||||||
notify_on) */ |
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
set_ready_locked(exec_ctx, fd, st); |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_shutdown(grpc_exec_ctx *exec_ctx, grpc_fd *fd) { |
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
GPR_ASSERT(!fd->shutdown); |
|
||||||
fd->shutdown = 1; |
|
||||||
set_ready_locked(exec_ctx, fd, &fd->read_closure); |
|
||||||
set_ready_locked(exec_ctx, fd, &fd->write_closure); |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_notify_on_read(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
|
||||||
grpc_closure *closure) { |
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
notify_on_locked(exec_ctx, fd, &fd->read_closure, closure); |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_notify_on_write(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
|
||||||
grpc_closure *closure) { |
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
notify_on_locked(exec_ctx, fd, &fd->write_closure, closure); |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
} |
|
||||||
|
|
||||||
uint32_t grpc_fd_begin_poll(grpc_fd *fd, grpc_pollset *pollset, |
|
||||||
grpc_pollset_worker *worker, uint32_t read_mask, |
|
||||||
uint32_t write_mask, grpc_fd_watcher *watcher) { |
|
||||||
uint32_t mask = 0; |
|
||||||
grpc_closure *cur; |
|
||||||
int requested; |
|
||||||
/* keep track of pollers that have requested our events, in case they change
|
|
||||||
*/ |
|
||||||
GRPC_FD_REF(fd, "poll"); |
|
||||||
|
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
|
|
||||||
/* if we are shutdown, then don't add to the watcher set */ |
|
||||||
if (fd->shutdown) { |
|
||||||
watcher->fd = NULL; |
|
||||||
watcher->pollset = NULL; |
|
||||||
watcher->worker = NULL; |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
GRPC_FD_UNREF(fd, "poll"); |
|
||||||
return 0; |
|
||||||
} |
|
||||||
|
|
||||||
/* if there is nobody polling for read, but we need to, then start doing so */ |
|
||||||
cur = fd->read_closure; |
|
||||||
requested = cur != CLOSURE_READY; |
|
||||||
if (read_mask && fd->read_watcher == NULL && requested) { |
|
||||||
fd->read_watcher = watcher; |
|
||||||
mask |= read_mask; |
|
||||||
} |
|
||||||
/* if there is nobody polling for write, but we need to, then start doing so
|
|
||||||
*/ |
|
||||||
cur = fd->write_closure; |
|
||||||
requested = cur != CLOSURE_READY; |
|
||||||
if (write_mask && fd->write_watcher == NULL && requested) { |
|
||||||
fd->write_watcher = watcher; |
|
||||||
mask |= write_mask; |
|
||||||
} |
|
||||||
/* if not polling, remember this watcher in case we need someone to later */ |
|
||||||
if (mask == 0 && worker != NULL) { |
|
||||||
watcher->next = &fd->inactive_watcher_root; |
|
||||||
watcher->prev = watcher->next->prev; |
|
||||||
watcher->next->prev = watcher->prev->next = watcher; |
|
||||||
} |
|
||||||
watcher->pollset = pollset; |
|
||||||
watcher->worker = worker; |
|
||||||
watcher->fd = fd; |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
|
|
||||||
return mask; |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_end_poll(grpc_exec_ctx *exec_ctx, grpc_fd_watcher *watcher, |
|
||||||
int got_read, int got_write) { |
|
||||||
int was_polling = 0; |
|
||||||
int kick = 0; |
|
||||||
grpc_fd *fd = watcher->fd; |
|
||||||
|
|
||||||
if (fd == NULL) { |
|
||||||
return; |
|
||||||
} |
|
||||||
|
|
||||||
gpr_mu_lock(&fd->mu); |
|
||||||
|
|
||||||
if (watcher == fd->read_watcher) { |
|
||||||
/* remove read watcher, kick if we still need a read */ |
|
||||||
was_polling = 1; |
|
||||||
if (!got_read) { |
|
||||||
kick = 1; |
|
||||||
} |
|
||||||
fd->read_watcher = NULL; |
|
||||||
} |
|
||||||
if (watcher == fd->write_watcher) { |
|
||||||
/* remove write watcher, kick if we still need a write */ |
|
||||||
was_polling = 1; |
|
||||||
if (!got_write) { |
|
||||||
kick = 1; |
|
||||||
} |
|
||||||
fd->write_watcher = NULL; |
|
||||||
} |
|
||||||
if (!was_polling && watcher->worker != NULL) { |
|
||||||
/* remove from inactive list */ |
|
||||||
watcher->next->prev = watcher->prev; |
|
||||||
watcher->prev->next = watcher->next; |
|
||||||
} |
|
||||||
if (got_read) { |
|
||||||
if (set_ready_locked(exec_ctx, fd, &fd->read_closure)) { |
|
||||||
kick = 1; |
|
||||||
} |
|
||||||
} |
|
||||||
if (got_write) { |
|
||||||
if (set_ready_locked(exec_ctx, fd, &fd->write_closure)) { |
|
||||||
kick = 1; |
|
||||||
} |
|
||||||
} |
|
||||||
if (kick) { |
|
||||||
maybe_wake_one_watcher_locked(fd); |
|
||||||
} |
|
||||||
if (grpc_fd_is_orphaned(fd) && !has_watchers(fd) && !fd->closed) { |
|
||||||
close_fd_locked(exec_ctx, fd); |
|
||||||
} |
|
||||||
gpr_mu_unlock(&fd->mu); |
|
||||||
|
|
||||||
GRPC_FD_UNREF(fd, "poll"); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_become_readable(grpc_exec_ctx *exec_ctx, grpc_fd *fd) { |
|
||||||
set_ready(exec_ctx, fd, &fd->read_closure); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_fd_become_writable(grpc_exec_ctx *exec_ctx, grpc_fd *fd) { |
|
||||||
set_ready(exec_ctx, fd, &fd->write_closure); |
|
||||||
} |
|
||||||
|
|
||||||
#endif |
|
||||||
@ -1,192 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#ifndef GRPC_CORE_LIB_IOMGR_FD_POSIX_H |
|
||||||
#define GRPC_CORE_LIB_IOMGR_FD_POSIX_H |
|
||||||
|
|
||||||
#include <grpc/support/atm.h> |
|
||||||
#include <grpc/support/sync.h> |
|
||||||
#include <grpc/support/time.h> |
|
||||||
#include "src/core/lib/iomgr/iomgr_internal.h" |
|
||||||
#include "src/core/lib/iomgr/pollset.h" |
|
||||||
|
|
||||||
typedef struct grpc_fd grpc_fd; |
|
||||||
|
|
||||||
typedef struct grpc_fd_watcher { |
|
||||||
struct grpc_fd_watcher *next; |
|
||||||
struct grpc_fd_watcher *prev; |
|
||||||
grpc_pollset *pollset; |
|
||||||
grpc_pollset_worker *worker; |
|
||||||
grpc_fd *fd; |
|
||||||
} grpc_fd_watcher; |
|
||||||
|
|
||||||
struct grpc_fd { |
|
||||||
int fd; |
|
||||||
/* refst format:
|
|
||||||
bit0: 1=active/0=orphaned |
|
||||||
bit1-n: refcount |
|
||||||
meaning that mostly we ref by two to avoid altering the orphaned bit, |
|
||||||
and just unref by 1 when we're ready to flag the object as orphaned */ |
|
||||||
gpr_atm refst; |
|
||||||
|
|
||||||
gpr_mu mu; |
|
||||||
int shutdown; |
|
||||||
int closed; |
|
||||||
int released; |
|
||||||
|
|
||||||
/* The watcher list.
|
|
||||||
|
|
||||||
The following watcher related fields are protected by watcher_mu. |
|
||||||
|
|
||||||
An fd_watcher is an ephemeral object created when an fd wants to |
|
||||||
begin polling, and destroyed after the poll. |
|
||||||
|
|
||||||
It denotes the fd's interest in whether to read poll or write poll |
|
||||||
or both or neither on this fd. |
|
||||||
|
|
||||||
If a watcher is asked to poll for reads or writes, the read_watcher |
|
||||||
or write_watcher fields are set respectively. A watcher may be asked |
|
||||||
to poll for both, in which case both fields will be set. |
|
||||||
|
|
||||||
read_watcher and write_watcher may be NULL if no watcher has been |
|
||||||
asked to poll for reads or writes. |
|
||||||
|
|
||||||
If an fd_watcher is not asked to poll for reads or writes, it's added |
|
||||||
to a linked list of inactive watchers, rooted at inactive_watcher_root. |
|
||||||
If at a later time there becomes need of a poller to poll, one of |
|
||||||
the inactive pollers may be kicked out of their poll loops to take |
|
||||||
that responsibility. */ |
|
||||||
grpc_fd_watcher inactive_watcher_root; |
|
||||||
grpc_fd_watcher *read_watcher; |
|
||||||
grpc_fd_watcher *write_watcher; |
|
||||||
|
|
||||||
grpc_closure *read_closure; |
|
||||||
grpc_closure *write_closure; |
|
||||||
|
|
||||||
struct grpc_fd *freelist_next; |
|
||||||
|
|
||||||
grpc_closure *on_done_closure; |
|
||||||
|
|
||||||
grpc_iomgr_object iomgr_object; |
|
||||||
}; |
|
||||||
|
|
||||||
/* Create a wrapped file descriptor.
|
|
||||||
Requires fd is a non-blocking file descriptor. |
|
||||||
This takes ownership of closing fd. */ |
|
||||||
grpc_fd *grpc_fd_create(int fd, const char *name); |
|
||||||
|
|
||||||
/* Return the wrapped fd, or -1 if it has been released or closed. */ |
|
||||||
int grpc_fd_wrapped_fd(grpc_fd *fd); |
|
||||||
|
|
||||||
/* Releases fd to be asynchronously destroyed.
|
|
||||||
on_done is called when the underlying file descriptor is definitely close()d. |
|
||||||
If on_done is NULL, no callback will be made. |
|
||||||
If release_fd is not NULL, it's set to fd and fd will not be closed. |
|
||||||
Requires: *fd initialized; no outstanding notify_on_read or |
|
||||||
notify_on_write. |
|
||||||
MUST NOT be called with a pollset lock taken */ |
|
||||||
void grpc_fd_orphan(grpc_exec_ctx *exec_ctx, grpc_fd *fd, grpc_closure *on_done, |
|
||||||
int *release_fd, const char *reason); |
|
||||||
|
|
||||||
/* Begin polling on an fd.
|
|
||||||
Registers that the given pollset is interested in this fd - so that if read |
|
||||||
or writability interest changes, the pollset can be kicked to pick up that |
|
||||||
new interest. |
|
||||||
Return value is: |
|
||||||
(fd_needs_read? read_mask : 0) | (fd_needs_write? write_mask : 0) |
|
||||||
i.e. a combination of read_mask and write_mask determined by the fd's current |
|
||||||
interest in said events. |
|
||||||
Polling strategies that do not need to alter their behavior depending on the |
|
||||||
fd's current interest (such as epoll) do not need to call this function. |
|
||||||
MUST NOT be called with a pollset lock taken */ |
|
||||||
uint32_t grpc_fd_begin_poll(grpc_fd *fd, grpc_pollset *pollset, |
|
||||||
grpc_pollset_worker *worker, uint32_t read_mask, |
|
||||||
uint32_t write_mask, grpc_fd_watcher *rec); |
|
||||||
/* Complete polling previously started with grpc_fd_begin_poll
|
|
||||||
MUST NOT be called with a pollset lock taken |
|
||||||
if got_read or got_write are 1, also does the become_{readable,writable} as |
|
||||||
appropriate. */ |
|
||||||
void grpc_fd_end_poll(grpc_exec_ctx *exec_ctx, grpc_fd_watcher *rec, |
|
||||||
int got_read, int got_write); |
|
||||||
|
|
||||||
/* Return 1 if this fd is orphaned, 0 otherwise */ |
|
||||||
int grpc_fd_is_orphaned(grpc_fd *fd); |
|
||||||
|
|
||||||
/* Cause any current callbacks to error out with GRPC_CALLBACK_CANCELLED. */ |
|
||||||
void grpc_fd_shutdown(grpc_exec_ctx *exec_ctx, grpc_fd *fd); |
|
||||||
|
|
||||||
/* Register read interest, causing read_cb to be called once when fd becomes
|
|
||||||
readable, on deadline specified by deadline, or on shutdown triggered by |
|
||||||
grpc_fd_shutdown. |
|
||||||
read_cb will be called with read_cb_arg when *fd becomes readable. |
|
||||||
read_cb is Called with status of GRPC_CALLBACK_SUCCESS if readable, |
|
||||||
GRPC_CALLBACK_TIMED_OUT if the call timed out, |
|
||||||
and CANCELLED if the call was cancelled. |
|
||||||
|
|
||||||
Requires:This method must not be called before the read_cb for any previous |
|
||||||
call runs. Edge triggered events are used whenever they are supported by the |
|
||||||
underlying platform. This means that users must drain fd in read_cb before |
|
||||||
calling notify_on_read again. Users are also expected to handle spurious |
|
||||||
events, i.e read_cb is called while nothing can be readable from fd */ |
|
||||||
void grpc_fd_notify_on_read(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
|
||||||
grpc_closure *closure); |
|
||||||
|
|
||||||
/* Exactly the same semantics as above, except based on writable events. */ |
|
||||||
void grpc_fd_notify_on_write(grpc_exec_ctx *exec_ctx, grpc_fd *fd, |
|
||||||
grpc_closure *closure); |
|
||||||
|
|
||||||
/* Notification from the poller to an fd that it has become readable or
|
|
||||||
writable. |
|
||||||
If allow_synchronous_callback is 1, allow running the fd callback inline |
|
||||||
in this callstack, otherwise register an asynchronous callback and return */ |
|
||||||
void grpc_fd_become_readable(grpc_exec_ctx *exec_ctx, grpc_fd *fd); |
|
||||||
void grpc_fd_become_writable(grpc_exec_ctx *exec_ctx, grpc_fd *fd); |
|
||||||
|
|
||||||
/* Reference counting for fds */ |
|
||||||
/*#define GRPC_FD_REF_COUNT_DEBUG*/ |
|
||||||
#ifdef GRPC_FD_REF_COUNT_DEBUG |
|
||||||
void grpc_fd_ref(grpc_fd *fd, const char *reason, const char *file, int line); |
|
||||||
void grpc_fd_unref(grpc_fd *fd, const char *reason, const char *file, int line); |
|
||||||
#define GRPC_FD_REF(fd, reason) grpc_fd_ref(fd, reason, __FILE__, __LINE__) |
|
||||||
#define GRPC_FD_UNREF(fd, reason) grpc_fd_unref(fd, reason, __FILE__, __LINE__) |
|
||||||
#else |
|
||||||
void grpc_fd_ref(grpc_fd *fd); |
|
||||||
void grpc_fd_unref(grpc_fd *fd); |
|
||||||
#define GRPC_FD_REF(fd, reason) grpc_fd_ref(fd) |
|
||||||
#define GRPC_FD_UNREF(fd, reason) grpc_fd_unref(fd) |
|
||||||
#endif |
|
||||||
|
|
||||||
void grpc_fd_global_init(void); |
|
||||||
void grpc_fd_global_shutdown(void); |
|
||||||
|
|
||||||
#endif /* GRPC_CORE_LIB_IOMGR_FD_POSIX_H */ |
|
||||||
@ -1,324 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#include <grpc/support/port_platform.h> |
|
||||||
|
|
||||||
#ifdef GPR_LINUX_MULTIPOLL_WITH_EPOLL |
|
||||||
|
|
||||||
#include <errno.h> |
|
||||||
#include <poll.h> |
|
||||||
#include <string.h> |
|
||||||
#include <sys/epoll.h> |
|
||||||
#include <unistd.h> |
|
||||||
|
|
||||||
#include <grpc/support/alloc.h> |
|
||||||
#include <grpc/support/log.h> |
|
||||||
#include <grpc/support/useful.h> |
|
||||||
#include "src/core/lib/iomgr/fd_posix.h" |
|
||||||
#include "src/core/lib/iomgr/pollset_posix.h" |
|
||||||
#include "src/core/lib/profiling/timers.h" |
|
||||||
#include "src/core/lib/support/block_annotate.h" |
|
||||||
|
|
||||||
struct epoll_fd_list { |
|
||||||
int *epoll_fds; |
|
||||||
size_t count; |
|
||||||
size_t capacity; |
|
||||||
}; |
|
||||||
|
|
||||||
static struct epoll_fd_list epoll_fd_global_list; |
|
||||||
static gpr_once init_epoll_fd_list_mu = GPR_ONCE_INIT; |
|
||||||
static gpr_mu epoll_fd_list_mu; |
|
||||||
|
|
||||||
static void init_mu(void) { gpr_mu_init(&epoll_fd_list_mu); } |
|
||||||
|
|
||||||
static void add_epoll_fd_to_global_list(int epoll_fd) { |
|
||||||
gpr_once_init(&init_epoll_fd_list_mu, init_mu); |
|
||||||
|
|
||||||
gpr_mu_lock(&epoll_fd_list_mu); |
|
||||||
if (epoll_fd_global_list.count == epoll_fd_global_list.capacity) { |
|
||||||
epoll_fd_global_list.capacity = |
|
||||||
GPR_MAX((size_t)8, epoll_fd_global_list.capacity * 2); |
|
||||||
epoll_fd_global_list.epoll_fds = |
|
||||||
gpr_realloc(epoll_fd_global_list.epoll_fds, |
|
||||||
epoll_fd_global_list.capacity * sizeof(int)); |
|
||||||
} |
|
||||||
epoll_fd_global_list.epoll_fds[epoll_fd_global_list.count++] = epoll_fd; |
|
||||||
gpr_mu_unlock(&epoll_fd_list_mu); |
|
||||||
} |
|
||||||
|
|
||||||
static void remove_epoll_fd_from_global_list(int epoll_fd) { |
|
||||||
gpr_mu_lock(&epoll_fd_list_mu); |
|
||||||
GPR_ASSERT(epoll_fd_global_list.count > 0); |
|
||||||
for (size_t i = 0; i < epoll_fd_global_list.count; i++) { |
|
||||||
if (epoll_fd == epoll_fd_global_list.epoll_fds[i]) { |
|
||||||
epoll_fd_global_list.epoll_fds[i] = |
|
||||||
epoll_fd_global_list.epoll_fds[--(epoll_fd_global_list.count)]; |
|
||||||
break; |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&epoll_fd_list_mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_remove_fd_from_all_epoll_sets(int fd) { |
|
||||||
int err; |
|
||||||
gpr_once_init(&init_epoll_fd_list_mu, init_mu); |
|
||||||
gpr_mu_lock(&epoll_fd_list_mu); |
|
||||||
if (epoll_fd_global_list.count == 0) { |
|
||||||
gpr_mu_unlock(&epoll_fd_list_mu); |
|
||||||
return; |
|
||||||
} |
|
||||||
for (size_t i = 0; i < epoll_fd_global_list.count; i++) { |
|
||||||
err = epoll_ctl(epoll_fd_global_list.epoll_fds[i], EPOLL_CTL_DEL, fd, NULL); |
|
||||||
if (err < 0 && errno != ENOENT) { |
|
||||||
gpr_log(GPR_ERROR, "epoll_ctl del for %d failed: %s", fd, |
|
||||||
strerror(errno)); |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&epoll_fd_list_mu); |
|
||||||
} |
|
||||||
|
|
||||||
typedef struct { |
|
||||||
grpc_pollset *pollset; |
|
||||||
grpc_fd *fd; |
|
||||||
grpc_closure closure; |
|
||||||
} delayed_add; |
|
||||||
|
|
||||||
typedef struct { int epoll_fd; } pollset_hdr; |
|
||||||
|
|
||||||
static void finally_add_fd(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
grpc_fd *fd) { |
|
||||||
pollset_hdr *h = pollset->data.ptr; |
|
||||||
struct epoll_event ev; |
|
||||||
int err; |
|
||||||
grpc_fd_watcher watcher; |
|
||||||
|
|
||||||
/* We pretend to be polling whilst adding an fd to keep the fd from being
|
|
||||||
closed during the add. This may result in a spurious wakeup being assigned |
|
||||||
to this pollset whilst adding, but that should be benign. */ |
|
||||||
GPR_ASSERT(grpc_fd_begin_poll(fd, pollset, NULL, 0, 0, &watcher) == 0); |
|
||||||
if (watcher.fd != NULL) { |
|
||||||
ev.events = (uint32_t)(EPOLLIN | EPOLLOUT | EPOLLET); |
|
||||||
ev.data.ptr = fd; |
|
||||||
err = epoll_ctl(h->epoll_fd, EPOLL_CTL_ADD, fd->fd, &ev); |
|
||||||
if (err < 0) { |
|
||||||
/* FDs may be added to a pollset multiple times, so EEXIST is normal. */ |
|
||||||
if (errno != EEXIST) { |
|
||||||
gpr_log(GPR_ERROR, "epoll_ctl add for %d failed: %s", fd->fd, |
|
||||||
strerror(errno)); |
|
||||||
} |
|
||||||
} |
|
||||||
} |
|
||||||
grpc_fd_end_poll(exec_ctx, &watcher, 0, 0); |
|
||||||
} |
|
||||||
|
|
||||||
static void perform_delayed_add(grpc_exec_ctx *exec_ctx, void *arg, |
|
||||||
bool iomgr_status) { |
|
||||||
delayed_add *da = arg; |
|
||||||
|
|
||||||
if (!grpc_fd_is_orphaned(da->fd)) { |
|
||||||
finally_add_fd(exec_ctx, da->pollset, da->fd); |
|
||||||
} |
|
||||||
|
|
||||||
gpr_mu_lock(&da->pollset->mu); |
|
||||||
da->pollset->in_flight_cbs--; |
|
||||||
if (da->pollset->shutting_down) { |
|
||||||
/* We don't care about this pollset anymore. */ |
|
||||||
if (da->pollset->in_flight_cbs == 0 && !da->pollset->called_shutdown) { |
|
||||||
da->pollset->called_shutdown = 1; |
|
||||||
grpc_exec_ctx_enqueue(exec_ctx, da->pollset->shutdown_done, true, NULL); |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&da->pollset->mu); |
|
||||||
|
|
||||||
GRPC_FD_UNREF(da->fd, "delayed_add"); |
|
||||||
|
|
||||||
gpr_free(da); |
|
||||||
} |
|
||||||
|
|
||||||
static void multipoll_with_epoll_pollset_add_fd(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, |
|
||||||
grpc_fd *fd, |
|
||||||
int and_unlock_pollset) { |
|
||||||
if (and_unlock_pollset) { |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
finally_add_fd(exec_ctx, pollset, fd); |
|
||||||
} else { |
|
||||||
delayed_add *da = gpr_malloc(sizeof(*da)); |
|
||||||
da->pollset = pollset; |
|
||||||
da->fd = fd; |
|
||||||
GRPC_FD_REF(fd, "delayed_add"); |
|
||||||
grpc_closure_init(&da->closure, perform_delayed_add, da); |
|
||||||
pollset->in_flight_cbs++; |
|
||||||
grpc_exec_ctx_enqueue(exec_ctx, &da->closure, true, NULL); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
/* TODO(klempner): We probably want to turn this down a bit */ |
|
||||||
#define GRPC_EPOLL_MAX_EVENTS 1000 |
|
||||||
|
|
||||||
static void multipoll_with_epoll_pollset_maybe_work_and_unlock( |
|
||||||
grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, grpc_pollset_worker *worker, |
|
||||||
gpr_timespec deadline, gpr_timespec now) { |
|
||||||
struct epoll_event ep_ev[GRPC_EPOLL_MAX_EVENTS]; |
|
||||||
int ep_rv; |
|
||||||
int poll_rv; |
|
||||||
pollset_hdr *h = pollset->data.ptr; |
|
||||||
int timeout_ms; |
|
||||||
struct pollfd pfds[2]; |
|
||||||
|
|
||||||
/* If you want to ignore epoll's ability to sanely handle parallel pollers,
|
|
||||||
* for a more apples-to-apples performance comparison with poll, add a |
|
||||||
* if (pollset->counter != 0) { return 0; } |
|
||||||
* here. |
|
||||||
*/ |
|
||||||
|
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
|
|
||||||
timeout_ms = grpc_poll_deadline_to_millis_timeout(deadline, now); |
|
||||||
|
|
||||||
pfds[0].fd = GRPC_WAKEUP_FD_GET_READ_FD(&worker->wakeup_fd->fd); |
|
||||||
pfds[0].events = POLLIN; |
|
||||||
pfds[0].revents = 0; |
|
||||||
pfds[1].fd = h->epoll_fd; |
|
||||||
pfds[1].events = POLLIN; |
|
||||||
pfds[1].revents = 0; |
|
||||||
|
|
||||||
/* TODO(vpai): Consider first doing a 0 timeout poll here to avoid
|
|
||||||
even going into the blocking annotation if possible */ |
|
||||||
GPR_TIMER_BEGIN("poll", 0); |
|
||||||
GRPC_SCHEDULING_START_BLOCKING_REGION; |
|
||||||
poll_rv = grpc_poll_function(pfds, 2, timeout_ms); |
|
||||||
GRPC_SCHEDULING_END_BLOCKING_REGION; |
|
||||||
GPR_TIMER_END("poll", 0); |
|
||||||
|
|
||||||
if (poll_rv < 0) { |
|
||||||
if (errno != EINTR) { |
|
||||||
gpr_log(GPR_ERROR, "poll() failed: %s", strerror(errno)); |
|
||||||
} |
|
||||||
} else if (poll_rv == 0) { |
|
||||||
/* do nothing */ |
|
||||||
} else { |
|
||||||
if (pfds[0].revents) { |
|
||||||
grpc_wakeup_fd_consume_wakeup(&worker->wakeup_fd->fd); |
|
||||||
} |
|
||||||
if (pfds[1].revents) { |
|
||||||
do { |
|
||||||
/* The following epoll_wait never blocks; it has a timeout of 0 */ |
|
||||||
ep_rv = epoll_wait(h->epoll_fd, ep_ev, GRPC_EPOLL_MAX_EVENTS, 0); |
|
||||||
if (ep_rv < 0) { |
|
||||||
if (errno != EINTR) { |
|
||||||
gpr_log(GPR_ERROR, "epoll_wait() failed: %s", strerror(errno)); |
|
||||||
} |
|
||||||
} else { |
|
||||||
int i; |
|
||||||
for (i = 0; i < ep_rv; ++i) { |
|
||||||
grpc_fd *fd = ep_ev[i].data.ptr; |
|
||||||
/* TODO(klempner): We might want to consider making err and pri
|
|
||||||
* separate events */ |
|
||||||
int cancel = ep_ev[i].events & (EPOLLERR | EPOLLHUP); |
|
||||||
int read_ev = ep_ev[i].events & (EPOLLIN | EPOLLPRI); |
|
||||||
int write_ev = ep_ev[i].events & EPOLLOUT; |
|
||||||
if (fd == NULL) { |
|
||||||
grpc_wakeup_fd_consume_wakeup(&grpc_global_wakeup_fd); |
|
||||||
} else { |
|
||||||
if (read_ev || cancel) { |
|
||||||
grpc_fd_become_readable(exec_ctx, fd); |
|
||||||
} |
|
||||||
if (write_ev || cancel) { |
|
||||||
grpc_fd_become_writable(exec_ctx, fd); |
|
||||||
} |
|
||||||
} |
|
||||||
} |
|
||||||
} |
|
||||||
} while (ep_rv == GRPC_EPOLL_MAX_EVENTS); |
|
||||||
} |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void multipoll_with_epoll_pollset_finish_shutdown( |
|
||||||
grpc_pollset *pollset) {} |
|
||||||
|
|
||||||
static void multipoll_with_epoll_pollset_destroy(grpc_pollset *pollset) { |
|
||||||
pollset_hdr *h = pollset->data.ptr; |
|
||||||
close(h->epoll_fd); |
|
||||||
remove_epoll_fd_from_global_list(h->epoll_fd); |
|
||||||
gpr_free(h); |
|
||||||
} |
|
||||||
|
|
||||||
static const grpc_pollset_vtable multipoll_with_epoll_pollset = { |
|
||||||
multipoll_with_epoll_pollset_add_fd, |
|
||||||
multipoll_with_epoll_pollset_maybe_work_and_unlock, |
|
||||||
multipoll_with_epoll_pollset_finish_shutdown, |
|
||||||
multipoll_with_epoll_pollset_destroy}; |
|
||||||
|
|
||||||
static void epoll_become_multipoller(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, grpc_fd **fds, |
|
||||||
size_t nfds) { |
|
||||||
size_t i; |
|
||||||
pollset_hdr *h = gpr_malloc(sizeof(pollset_hdr)); |
|
||||||
struct epoll_event ev; |
|
||||||
int err; |
|
||||||
|
|
||||||
pollset->vtable = &multipoll_with_epoll_pollset; |
|
||||||
pollset->data.ptr = h; |
|
||||||
h->epoll_fd = epoll_create1(EPOLL_CLOEXEC); |
|
||||||
if (h->epoll_fd < 0) { |
|
||||||
/* TODO(klempner): Fall back to poll here, especially on ENOSYS */ |
|
||||||
gpr_log(GPR_ERROR, "epoll_create1 failed: %s", strerror(errno)); |
|
||||||
abort(); |
|
||||||
} |
|
||||||
add_epoll_fd_to_global_list(h->epoll_fd); |
|
||||||
|
|
||||||
ev.events = (uint32_t)(EPOLLIN | EPOLLET); |
|
||||||
ev.data.ptr = NULL; |
|
||||||
err = epoll_ctl(h->epoll_fd, EPOLL_CTL_ADD, |
|
||||||
GRPC_WAKEUP_FD_GET_READ_FD(&grpc_global_wakeup_fd), &ev); |
|
||||||
if (err < 0) { |
|
||||||
gpr_log(GPR_ERROR, "epoll_ctl add for %d failed: %s", |
|
||||||
GRPC_WAKEUP_FD_GET_READ_FD(&grpc_global_wakeup_fd), |
|
||||||
strerror(errno)); |
|
||||||
} |
|
||||||
|
|
||||||
for (i = 0; i < nfds; i++) { |
|
||||||
multipoll_with_epoll_pollset_add_fd(exec_ctx, pollset, fds[i], 0); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
grpc_platform_become_multipoller_type grpc_platform_become_multipoller = |
|
||||||
epoll_become_multipoller; |
|
||||||
|
|
||||||
#else /* GPR_LINUX_MULTIPOLL_WITH_EPOLL */ |
|
||||||
|
|
||||||
void grpc_remove_fd_from_all_epoll_sets(int fd) {} |
|
||||||
|
|
||||||
#endif /* GPR_LINUX_MULTIPOLL_WITH_EPOLL */ |
|
||||||
@ -1,234 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#include <grpc/support/port_platform.h> |
|
||||||
|
|
||||||
#ifdef GPR_POSIX_SOCKET |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/pollset_posix.h" |
|
||||||
|
|
||||||
#include <errno.h> |
|
||||||
#include <poll.h> |
|
||||||
#include <stdlib.h> |
|
||||||
#include <string.h> |
|
||||||
|
|
||||||
#include <grpc/support/alloc.h> |
|
||||||
#include <grpc/support/log.h> |
|
||||||
#include <grpc/support/useful.h> |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/fd_posix.h" |
|
||||||
#include "src/core/lib/iomgr/iomgr_internal.h" |
|
||||||
#include "src/core/lib/iomgr/pollset_posix.h" |
|
||||||
#include "src/core/lib/support/block_annotate.h" |
|
||||||
|
|
||||||
typedef struct { |
|
||||||
/* all polled fds */ |
|
||||||
size_t fd_count; |
|
||||||
size_t fd_capacity; |
|
||||||
grpc_fd **fds; |
|
||||||
/* fds that have been removed from the pollset explicitly */ |
|
||||||
size_t del_count; |
|
||||||
size_t del_capacity; |
|
||||||
grpc_fd **dels; |
|
||||||
} pollset_hdr; |
|
||||||
|
|
||||||
static void multipoll_with_poll_pollset_add_fd(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, |
|
||||||
grpc_fd *fd, |
|
||||||
int and_unlock_pollset) { |
|
||||||
size_t i; |
|
||||||
pollset_hdr *h = pollset->data.ptr; |
|
||||||
/* TODO(ctiller): this is O(num_fds^2); maybe switch to a hash set here */ |
|
||||||
for (i = 0; i < h->fd_count; i++) { |
|
||||||
if (h->fds[i] == fd) goto exit; |
|
||||||
} |
|
||||||
if (h->fd_count == h->fd_capacity) { |
|
||||||
h->fd_capacity = GPR_MAX(h->fd_capacity + 8, h->fd_count * 3 / 2); |
|
||||||
h->fds = gpr_realloc(h->fds, sizeof(grpc_fd *) * h->fd_capacity); |
|
||||||
} |
|
||||||
h->fds[h->fd_count++] = fd; |
|
||||||
GRPC_FD_REF(fd, "multipoller"); |
|
||||||
exit: |
|
||||||
if (and_unlock_pollset) { |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void multipoll_with_poll_pollset_maybe_work_and_unlock( |
|
||||||
grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, grpc_pollset_worker *worker, |
|
||||||
gpr_timespec deadline, gpr_timespec now) { |
|
||||||
#define POLLOUT_CHECK (POLLOUT | POLLHUP | POLLERR) |
|
||||||
#define POLLIN_CHECK (POLLIN | POLLHUP | POLLERR) |
|
||||||
|
|
||||||
int timeout; |
|
||||||
int r; |
|
||||||
size_t i, j, fd_count; |
|
||||||
nfds_t pfd_count; |
|
||||||
pollset_hdr *h; |
|
||||||
/* TODO(ctiller): inline some elements to avoid an allocation */ |
|
||||||
grpc_fd_watcher *watchers; |
|
||||||
struct pollfd *pfds; |
|
||||||
|
|
||||||
h = pollset->data.ptr; |
|
||||||
timeout = grpc_poll_deadline_to_millis_timeout(deadline, now); |
|
||||||
/* TODO(ctiller): perform just one malloc here if we exceed the inline case */ |
|
||||||
pfds = gpr_malloc(sizeof(*pfds) * (h->fd_count + 2)); |
|
||||||
watchers = gpr_malloc(sizeof(*watchers) * (h->fd_count + 2)); |
|
||||||
fd_count = 0; |
|
||||||
pfd_count = 2; |
|
||||||
pfds[0].fd = GRPC_WAKEUP_FD_GET_READ_FD(&grpc_global_wakeup_fd); |
|
||||||
pfds[0].events = POLLIN; |
|
||||||
pfds[0].revents = 0; |
|
||||||
pfds[1].fd = GRPC_WAKEUP_FD_GET_READ_FD(&worker->wakeup_fd->fd); |
|
||||||
pfds[1].events = POLLIN; |
|
||||||
pfds[1].revents = 0; |
|
||||||
for (i = 0; i < h->fd_count; i++) { |
|
||||||
int remove = grpc_fd_is_orphaned(h->fds[i]); |
|
||||||
for (j = 0; !remove && j < h->del_count; j++) { |
|
||||||
if (h->fds[i] == h->dels[j]) remove = 1; |
|
||||||
} |
|
||||||
if (remove) { |
|
||||||
GRPC_FD_UNREF(h->fds[i], "multipoller"); |
|
||||||
} else { |
|
||||||
h->fds[fd_count++] = h->fds[i]; |
|
||||||
watchers[pfd_count].fd = h->fds[i]; |
|
||||||
GRPC_FD_REF(watchers[pfd_count].fd, "multipoller_start"); |
|
||||||
pfds[pfd_count].fd = h->fds[i]->fd; |
|
||||||
pfds[pfd_count].revents = 0; |
|
||||||
pfd_count++; |
|
||||||
} |
|
||||||
} |
|
||||||
for (j = 0; j < h->del_count; j++) { |
|
||||||
GRPC_FD_UNREF(h->dels[j], "multipoller_del"); |
|
||||||
} |
|
||||||
h->del_count = 0; |
|
||||||
h->fd_count = fd_count; |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
|
|
||||||
for (i = 2; i < pfd_count; i++) { |
|
||||||
grpc_fd *fd = watchers[i].fd; |
|
||||||
pfds[i].events = (short)grpc_fd_begin_poll(fd, pollset, worker, POLLIN, |
|
||||||
POLLOUT, &watchers[i]); |
|
||||||
GRPC_FD_UNREF(fd, "multipoller_start"); |
|
||||||
} |
|
||||||
|
|
||||||
/* TODO(vpai): Consider first doing a 0 timeout poll here to avoid
|
|
||||||
even going into the blocking annotation if possible */ |
|
||||||
GRPC_SCHEDULING_START_BLOCKING_REGION; |
|
||||||
r = grpc_poll_function(pfds, pfd_count, timeout); |
|
||||||
GRPC_SCHEDULING_END_BLOCKING_REGION; |
|
||||||
|
|
||||||
if (r < 0) { |
|
||||||
if (errno != EINTR) { |
|
||||||
gpr_log(GPR_ERROR, "poll() failed: %s", strerror(errno)); |
|
||||||
} |
|
||||||
for (i = 2; i < pfd_count; i++) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &watchers[i], 0, 0); |
|
||||||
} |
|
||||||
} else if (r == 0) { |
|
||||||
for (i = 2; i < pfd_count; i++) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &watchers[i], 0, 0); |
|
||||||
} |
|
||||||
} else { |
|
||||||
if (pfds[0].revents & POLLIN_CHECK) { |
|
||||||
grpc_wakeup_fd_consume_wakeup(&grpc_global_wakeup_fd); |
|
||||||
} |
|
||||||
if (pfds[1].revents & POLLIN_CHECK) { |
|
||||||
grpc_wakeup_fd_consume_wakeup(&worker->wakeup_fd->fd); |
|
||||||
} |
|
||||||
for (i = 2; i < pfd_count; i++) { |
|
||||||
if (watchers[i].fd == NULL) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &watchers[i], 0, 0); |
|
||||||
continue; |
|
||||||
} |
|
||||||
grpc_fd_end_poll(exec_ctx, &watchers[i], pfds[i].revents & POLLIN_CHECK, |
|
||||||
pfds[i].revents & POLLOUT_CHECK); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
gpr_free(pfds); |
|
||||||
gpr_free(watchers); |
|
||||||
} |
|
||||||
|
|
||||||
static void multipoll_with_poll_pollset_finish_shutdown(grpc_pollset *pollset) { |
|
||||||
size_t i; |
|
||||||
pollset_hdr *h = pollset->data.ptr; |
|
||||||
for (i = 0; i < h->fd_count; i++) { |
|
||||||
GRPC_FD_UNREF(h->fds[i], "multipoller"); |
|
||||||
} |
|
||||||
for (i = 0; i < h->del_count; i++) { |
|
||||||
GRPC_FD_UNREF(h->dels[i], "multipoller_del"); |
|
||||||
} |
|
||||||
h->fd_count = 0; |
|
||||||
h->del_count = 0; |
|
||||||
} |
|
||||||
|
|
||||||
static void multipoll_with_poll_pollset_destroy(grpc_pollset *pollset) { |
|
||||||
pollset_hdr *h = pollset->data.ptr; |
|
||||||
multipoll_with_poll_pollset_finish_shutdown(pollset); |
|
||||||
gpr_free(h->fds); |
|
||||||
gpr_free(h->dels); |
|
||||||
gpr_free(h); |
|
||||||
} |
|
||||||
|
|
||||||
static const grpc_pollset_vtable multipoll_with_poll_pollset = { |
|
||||||
multipoll_with_poll_pollset_add_fd, |
|
||||||
multipoll_with_poll_pollset_maybe_work_and_unlock, |
|
||||||
multipoll_with_poll_pollset_finish_shutdown, |
|
||||||
multipoll_with_poll_pollset_destroy}; |
|
||||||
|
|
||||||
void grpc_poll_become_multipoller(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, grpc_fd **fds, |
|
||||||
size_t nfds) { |
|
||||||
size_t i; |
|
||||||
pollset_hdr *h = gpr_malloc(sizeof(pollset_hdr)); |
|
||||||
pollset->vtable = &multipoll_with_poll_pollset; |
|
||||||
pollset->data.ptr = h; |
|
||||||
h->fd_count = nfds; |
|
||||||
h->fd_capacity = nfds; |
|
||||||
h->fds = gpr_malloc(nfds * sizeof(grpc_fd *)); |
|
||||||
h->del_count = 0; |
|
||||||
h->del_capacity = 0; |
|
||||||
h->dels = NULL; |
|
||||||
for (i = 0; i < nfds; i++) { |
|
||||||
h->fds[i] = fds[i]; |
|
||||||
GRPC_FD_REF(fds[i], "multipoller"); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
#endif /* GPR_POSIX_SOCKET */ |
|
||||||
|
|
||||||
#ifdef GPR_POSIX_MULTIPOLL_WITH_POLL |
|
||||||
grpc_platform_become_multipoller_type grpc_platform_become_multipoller = |
|
||||||
grpc_poll_become_multipoller; |
|
||||||
#endif |
|
||||||
@ -1,633 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#include <grpc/support/port_platform.h> |
|
||||||
|
|
||||||
#ifdef GPR_POSIX_SOCKET |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/pollset_posix.h" |
|
||||||
|
|
||||||
#include <errno.h> |
|
||||||
#include <stdlib.h> |
|
||||||
#include <string.h> |
|
||||||
#include <unistd.h> |
|
||||||
|
|
||||||
#include <grpc/support/alloc.h> |
|
||||||
#include <grpc/support/log.h> |
|
||||||
#include <grpc/support/thd.h> |
|
||||||
#include <grpc/support/tls.h> |
|
||||||
#include <grpc/support/useful.h> |
|
||||||
#include "src/core/lib/iomgr/fd_posix.h" |
|
||||||
#include "src/core/lib/iomgr/iomgr_internal.h" |
|
||||||
#include "src/core/lib/iomgr/socket_utils_posix.h" |
|
||||||
#include "src/core/lib/profiling/timers.h" |
|
||||||
#include "src/core/lib/support/block_annotate.h" |
|
||||||
|
|
||||||
GPR_TLS_DECL(g_current_thread_poller); |
|
||||||
GPR_TLS_DECL(g_current_thread_worker); |
|
||||||
|
|
||||||
/** Default poll() function - a pointer so that it can be overridden by some
|
|
||||||
* tests */ |
|
||||||
grpc_poll_function_type grpc_poll_function = poll; |
|
||||||
|
|
||||||
/** The alarm system needs to be able to wakeup 'some poller' sometimes
|
|
||||||
* (specifically when a new alarm needs to be triggered earlier than the next |
|
||||||
* alarm 'epoch'). |
|
||||||
* This wakeup_fd gives us something to alert on when such a case occurs. */ |
|
||||||
grpc_wakeup_fd grpc_global_wakeup_fd; |
|
||||||
|
|
||||||
static void remove_worker(grpc_pollset *p, grpc_pollset_worker *worker) { |
|
||||||
worker->prev->next = worker->next; |
|
||||||
worker->next->prev = worker->prev; |
|
||||||
} |
|
||||||
|
|
||||||
int grpc_pollset_has_workers(grpc_pollset *p) { |
|
||||||
return p->root_worker.next != &p->root_worker; |
|
||||||
} |
|
||||||
|
|
||||||
static grpc_pollset_worker *pop_front_worker(grpc_pollset *p) { |
|
||||||
if (grpc_pollset_has_workers(p)) { |
|
||||||
grpc_pollset_worker *w = p->root_worker.next; |
|
||||||
remove_worker(p, w); |
|
||||||
return w; |
|
||||||
} else { |
|
||||||
return NULL; |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void push_back_worker(grpc_pollset *p, grpc_pollset_worker *worker) { |
|
||||||
worker->next = &p->root_worker; |
|
||||||
worker->prev = worker->next->prev; |
|
||||||
worker->prev->next = worker->next->prev = worker; |
|
||||||
} |
|
||||||
|
|
||||||
static void push_front_worker(grpc_pollset *p, grpc_pollset_worker *worker) { |
|
||||||
worker->prev = &p->root_worker; |
|
||||||
worker->next = worker->prev->next; |
|
||||||
worker->prev->next = worker->next->prev = worker; |
|
||||||
} |
|
||||||
|
|
||||||
size_t grpc_pollset_size(void) { return sizeof(grpc_pollset); } |
|
||||||
|
|
||||||
void grpc_pollset_kick_ext(grpc_pollset *p, |
|
||||||
grpc_pollset_worker *specific_worker, |
|
||||||
uint32_t flags) { |
|
||||||
GPR_TIMER_BEGIN("grpc_pollset_kick_ext", 0); |
|
||||||
|
|
||||||
/* pollset->mu already held */ |
|
||||||
if (specific_worker != NULL) { |
|
||||||
if (specific_worker == GRPC_POLLSET_KICK_BROADCAST) { |
|
||||||
GPR_TIMER_BEGIN("grpc_pollset_kick_ext.broadcast", 0); |
|
||||||
GPR_ASSERT((flags & GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP) == 0); |
|
||||||
for (specific_worker = p->root_worker.next; |
|
||||||
specific_worker != &p->root_worker; |
|
||||||
specific_worker = specific_worker->next) { |
|
||||||
grpc_wakeup_fd_wakeup(&specific_worker->wakeup_fd->fd); |
|
||||||
} |
|
||||||
p->kicked_without_pollers = 1; |
|
||||||
GPR_TIMER_END("grpc_pollset_kick_ext.broadcast", 0); |
|
||||||
} else if (gpr_tls_get(&g_current_thread_worker) != |
|
||||||
(intptr_t)specific_worker) { |
|
||||||
GPR_TIMER_MARK("different_thread_worker", 0); |
|
||||||
if ((flags & GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP) != 0) { |
|
||||||
specific_worker->reevaluate_polling_on_wakeup = 1; |
|
||||||
} |
|
||||||
specific_worker->kicked_specifically = 1; |
|
||||||
grpc_wakeup_fd_wakeup(&specific_worker->wakeup_fd->fd); |
|
||||||
} else if ((flags & GRPC_POLLSET_CAN_KICK_SELF) != 0) { |
|
||||||
GPR_TIMER_MARK("kick_yoself", 0); |
|
||||||
if ((flags & GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP) != 0) { |
|
||||||
specific_worker->reevaluate_polling_on_wakeup = 1; |
|
||||||
} |
|
||||||
specific_worker->kicked_specifically = 1; |
|
||||||
grpc_wakeup_fd_wakeup(&specific_worker->wakeup_fd->fd); |
|
||||||
} |
|
||||||
} else if (gpr_tls_get(&g_current_thread_poller) != (intptr_t)p) { |
|
||||||
GPR_ASSERT((flags & GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP) == 0); |
|
||||||
GPR_TIMER_MARK("kick_anonymous", 0); |
|
||||||
specific_worker = pop_front_worker(p); |
|
||||||
if (specific_worker != NULL) { |
|
||||||
if (gpr_tls_get(&g_current_thread_worker) == (intptr_t)specific_worker) { |
|
||||||
GPR_TIMER_MARK("kick_anonymous_not_self", 0); |
|
||||||
push_back_worker(p, specific_worker); |
|
||||||
specific_worker = pop_front_worker(p); |
|
||||||
if ((flags & GRPC_POLLSET_CAN_KICK_SELF) == 0 && |
|
||||||
gpr_tls_get(&g_current_thread_worker) == |
|
||||||
(intptr_t)specific_worker) { |
|
||||||
push_back_worker(p, specific_worker); |
|
||||||
specific_worker = NULL; |
|
||||||
} |
|
||||||
} |
|
||||||
if (specific_worker != NULL) { |
|
||||||
GPR_TIMER_MARK("finally_kick", 0); |
|
||||||
push_back_worker(p, specific_worker); |
|
||||||
grpc_wakeup_fd_wakeup(&specific_worker->wakeup_fd->fd); |
|
||||||
} |
|
||||||
} else { |
|
||||||
GPR_TIMER_MARK("kicked_no_pollers", 0); |
|
||||||
p->kicked_without_pollers = 1; |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
GPR_TIMER_END("grpc_pollset_kick_ext", 0); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_kick(grpc_pollset *p, grpc_pollset_worker *specific_worker) { |
|
||||||
grpc_pollset_kick_ext(p, specific_worker, 0); |
|
||||||
} |
|
||||||
|
|
||||||
/* global state management */ |
|
||||||
|
|
||||||
void grpc_pollset_global_init(void) { |
|
||||||
gpr_tls_init(&g_current_thread_poller); |
|
||||||
gpr_tls_init(&g_current_thread_worker); |
|
||||||
grpc_wakeup_fd_global_init(); |
|
||||||
grpc_wakeup_fd_init(&grpc_global_wakeup_fd); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_global_shutdown(void) { |
|
||||||
grpc_wakeup_fd_destroy(&grpc_global_wakeup_fd); |
|
||||||
gpr_tls_destroy(&g_current_thread_poller); |
|
||||||
gpr_tls_destroy(&g_current_thread_worker); |
|
||||||
grpc_wakeup_fd_global_destroy(); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_kick_poller(void) { grpc_wakeup_fd_wakeup(&grpc_global_wakeup_fd); } |
|
||||||
|
|
||||||
/* main interface */ |
|
||||||
|
|
||||||
static void become_basic_pollset(grpc_pollset *pollset, grpc_fd *fd_or_null); |
|
||||||
|
|
||||||
void grpc_pollset_init(grpc_pollset *pollset, gpr_mu **mu) { |
|
||||||
gpr_mu_init(&pollset->mu); |
|
||||||
*mu = &pollset->mu; |
|
||||||
pollset->root_worker.next = pollset->root_worker.prev = &pollset->root_worker; |
|
||||||
pollset->in_flight_cbs = 0; |
|
||||||
pollset->shutting_down = 0; |
|
||||||
pollset->called_shutdown = 0; |
|
||||||
pollset->kicked_without_pollers = 0; |
|
||||||
pollset->idle_jobs.head = pollset->idle_jobs.tail = NULL; |
|
||||||
pollset->local_wakeup_cache = NULL; |
|
||||||
pollset->kicked_without_pollers = 0; |
|
||||||
become_basic_pollset(pollset, NULL); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_destroy(grpc_pollset *pollset) { |
|
||||||
GPR_ASSERT(pollset->in_flight_cbs == 0); |
|
||||||
GPR_ASSERT(!grpc_pollset_has_workers(pollset)); |
|
||||||
GPR_ASSERT(pollset->idle_jobs.head == pollset->idle_jobs.tail); |
|
||||||
pollset->vtable->destroy(pollset); |
|
||||||
while (pollset->local_wakeup_cache) { |
|
||||||
grpc_cached_wakeup_fd *next = pollset->local_wakeup_cache->next; |
|
||||||
grpc_wakeup_fd_destroy(&pollset->local_wakeup_cache->fd); |
|
||||||
gpr_free(pollset->local_wakeup_cache); |
|
||||||
pollset->local_wakeup_cache = next; |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_reset(grpc_pollset *pollset) { |
|
||||||
GPR_ASSERT(pollset->shutting_down); |
|
||||||
GPR_ASSERT(pollset->in_flight_cbs == 0); |
|
||||||
GPR_ASSERT(!grpc_pollset_has_workers(pollset)); |
|
||||||
GPR_ASSERT(pollset->idle_jobs.head == pollset->idle_jobs.tail); |
|
||||||
pollset->vtable->destroy(pollset); |
|
||||||
pollset->shutting_down = 0; |
|
||||||
pollset->called_shutdown = 0; |
|
||||||
pollset->kicked_without_pollers = 0; |
|
||||||
become_basic_pollset(pollset, NULL); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_add_fd(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
grpc_fd *fd) { |
|
||||||
gpr_mu_lock(&pollset->mu); |
|
||||||
pollset->vtable->add_fd(exec_ctx, pollset, fd, 1); |
|
||||||
/* the following (enabled only in debug) will reacquire and then release
|
|
||||||
our lock - meaning that if the unlocking flag passed to add_fd above is |
|
||||||
not respected, the code will deadlock (in a way that we have a chance of |
|
||||||
debugging) */ |
|
||||||
#ifndef NDEBUG |
|
||||||
gpr_mu_lock(&pollset->mu); |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
#endif |
|
||||||
} |
|
||||||
|
|
||||||
static void finish_shutdown(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset) { |
|
||||||
GPR_ASSERT(grpc_closure_list_empty(pollset->idle_jobs)); |
|
||||||
pollset->vtable->finish_shutdown(pollset); |
|
||||||
grpc_exec_ctx_enqueue(exec_ctx, pollset->shutdown_done, true, NULL); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_work(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
grpc_pollset_worker **worker_hdl, gpr_timespec now, |
|
||||||
gpr_timespec deadline) { |
|
||||||
grpc_pollset_worker worker; |
|
||||||
*worker_hdl = &worker; |
|
||||||
|
|
||||||
/* pollset->mu already held */ |
|
||||||
int added_worker = 0; |
|
||||||
int locked = 1; |
|
||||||
int queued_work = 0; |
|
||||||
int keep_polling = 0; |
|
||||||
GPR_TIMER_BEGIN("grpc_pollset_work", 0); |
|
||||||
/* this must happen before we (potentially) drop pollset->mu */ |
|
||||||
worker.next = worker.prev = NULL; |
|
||||||
worker.reevaluate_polling_on_wakeup = 0; |
|
||||||
if (pollset->local_wakeup_cache != NULL) { |
|
||||||
worker.wakeup_fd = pollset->local_wakeup_cache; |
|
||||||
pollset->local_wakeup_cache = worker.wakeup_fd->next; |
|
||||||
} else { |
|
||||||
worker.wakeup_fd = gpr_malloc(sizeof(*worker.wakeup_fd)); |
|
||||||
grpc_wakeup_fd_init(&worker.wakeup_fd->fd); |
|
||||||
} |
|
||||||
worker.kicked_specifically = 0; |
|
||||||
/* If there's work waiting for the pollset to be idle, and the
|
|
||||||
pollset is idle, then do that work */ |
|
||||||
if (!grpc_pollset_has_workers(pollset) && |
|
||||||
!grpc_closure_list_empty(pollset->idle_jobs)) { |
|
||||||
GPR_TIMER_MARK("grpc_pollset_work.idle_jobs", 0); |
|
||||||
grpc_exec_ctx_enqueue_list(exec_ctx, &pollset->idle_jobs, NULL); |
|
||||||
goto done; |
|
||||||
} |
|
||||||
/* If we're shutting down then we don't execute any extended work */ |
|
||||||
if (pollset->shutting_down) { |
|
||||||
GPR_TIMER_MARK("grpc_pollset_work.shutting_down", 0); |
|
||||||
goto done; |
|
||||||
} |
|
||||||
/* Give do_promote priority so we don't starve it out */ |
|
||||||
if (pollset->in_flight_cbs) { |
|
||||||
GPR_TIMER_MARK("grpc_pollset_work.in_flight_cbs", 0); |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
locked = 0; |
|
||||||
goto done; |
|
||||||
} |
|
||||||
/* Start polling, and keep doing so while we're being asked to
|
|
||||||
re-evaluate our pollers (this allows poll() based pollers to |
|
||||||
ensure they don't miss wakeups) */ |
|
||||||
keep_polling = 1; |
|
||||||
while (keep_polling) { |
|
||||||
keep_polling = 0; |
|
||||||
if (!pollset->kicked_without_pollers) { |
|
||||||
if (!added_worker) { |
|
||||||
push_front_worker(pollset, &worker); |
|
||||||
added_worker = 1; |
|
||||||
gpr_tls_set(&g_current_thread_worker, (intptr_t)&worker); |
|
||||||
} |
|
||||||
gpr_tls_set(&g_current_thread_poller, (intptr_t)pollset); |
|
||||||
GPR_TIMER_BEGIN("maybe_work_and_unlock", 0); |
|
||||||
pollset->vtable->maybe_work_and_unlock(exec_ctx, pollset, &worker, |
|
||||||
deadline, now); |
|
||||||
GPR_TIMER_END("maybe_work_and_unlock", 0); |
|
||||||
locked = 0; |
|
||||||
gpr_tls_set(&g_current_thread_poller, 0); |
|
||||||
} else { |
|
||||||
GPR_TIMER_MARK("grpc_pollset_work.kicked_without_pollers", 0); |
|
||||||
pollset->kicked_without_pollers = 0; |
|
||||||
} |
|
||||||
/* Finished execution - start cleaning up.
|
|
||||||
Note that we may arrive here from outside the enclosing while() loop. |
|
||||||
In that case we won't loop though as we haven't added worker to the |
|
||||||
worker list, which means nobody could ask us to re-evaluate polling). */ |
|
||||||
done: |
|
||||||
if (!locked) { |
|
||||||
queued_work |= grpc_exec_ctx_flush(exec_ctx); |
|
||||||
gpr_mu_lock(&pollset->mu); |
|
||||||
locked = 1; |
|
||||||
} |
|
||||||
/* If we're forced to re-evaluate polling (via grpc_pollset_kick with
|
|
||||||
GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP) then we land here and force |
|
||||||
a loop */ |
|
||||||
if (worker.reevaluate_polling_on_wakeup) { |
|
||||||
worker.reevaluate_polling_on_wakeup = 0; |
|
||||||
pollset->kicked_without_pollers = 0; |
|
||||||
if (queued_work || worker.kicked_specifically) { |
|
||||||
/* If there's queued work on the list, then set the deadline to be
|
|
||||||
immediate so we get back out of the polling loop quickly */ |
|
||||||
deadline = gpr_inf_past(GPR_CLOCK_MONOTONIC); |
|
||||||
} |
|
||||||
keep_polling = 1; |
|
||||||
} |
|
||||||
} |
|
||||||
if (added_worker) { |
|
||||||
remove_worker(pollset, &worker); |
|
||||||
gpr_tls_set(&g_current_thread_worker, 0); |
|
||||||
} |
|
||||||
/* release wakeup fd to the local pool */ |
|
||||||
worker.wakeup_fd->next = pollset->local_wakeup_cache; |
|
||||||
pollset->local_wakeup_cache = worker.wakeup_fd; |
|
||||||
/* check shutdown conditions */ |
|
||||||
if (pollset->shutting_down) { |
|
||||||
if (grpc_pollset_has_workers(pollset)) { |
|
||||||
grpc_pollset_kick(pollset, NULL); |
|
||||||
} else if (!pollset->called_shutdown && pollset->in_flight_cbs == 0) { |
|
||||||
pollset->called_shutdown = 1; |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
finish_shutdown(exec_ctx, pollset); |
|
||||||
grpc_exec_ctx_flush(exec_ctx); |
|
||||||
/* Continuing to access pollset here is safe -- it is the caller's
|
|
||||||
* responsibility to not destroy when it has outstanding calls to |
|
||||||
* grpc_pollset_work. |
|
||||||
* TODO(dklempner): Can we refactor the shutdown logic to avoid this? */ |
|
||||||
gpr_mu_lock(&pollset->mu); |
|
||||||
} else if (!grpc_closure_list_empty(pollset->idle_jobs)) { |
|
||||||
grpc_exec_ctx_enqueue_list(exec_ctx, &pollset->idle_jobs, NULL); |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
grpc_exec_ctx_flush(exec_ctx); |
|
||||||
gpr_mu_lock(&pollset->mu); |
|
||||||
} |
|
||||||
} |
|
||||||
*worker_hdl = NULL; |
|
||||||
GPR_TIMER_END("grpc_pollset_work", 0); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_shutdown(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
grpc_closure *closure) { |
|
||||||
GPR_ASSERT(!pollset->shutting_down); |
|
||||||
pollset->shutting_down = 1; |
|
||||||
pollset->shutdown_done = closure; |
|
||||||
grpc_pollset_kick(pollset, GRPC_POLLSET_KICK_BROADCAST); |
|
||||||
if (!grpc_pollset_has_workers(pollset)) { |
|
||||||
grpc_exec_ctx_enqueue_list(exec_ctx, &pollset->idle_jobs, NULL); |
|
||||||
} |
|
||||||
if (!pollset->called_shutdown && pollset->in_flight_cbs == 0 && |
|
||||||
!grpc_pollset_has_workers(pollset)) { |
|
||||||
pollset->called_shutdown = 1; |
|
||||||
finish_shutdown(exec_ctx, pollset); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
int grpc_poll_deadline_to_millis_timeout(gpr_timespec deadline, |
|
||||||
gpr_timespec now) { |
|
||||||
gpr_timespec timeout; |
|
||||||
static const int64_t max_spin_polling_us = 10; |
|
||||||
if (gpr_time_cmp(deadline, gpr_inf_future(deadline.clock_type)) == 0) { |
|
||||||
return -1; |
|
||||||
} |
|
||||||
if (gpr_time_cmp(deadline, gpr_time_add(now, gpr_time_from_micros( |
|
||||||
max_spin_polling_us, |
|
||||||
GPR_TIMESPAN))) <= 0) { |
|
||||||
return 0; |
|
||||||
} |
|
||||||
timeout = gpr_time_sub(deadline, now); |
|
||||||
return gpr_time_to_millis(gpr_time_add( |
|
||||||
timeout, gpr_time_from_nanos(GPR_NS_PER_MS - 1, GPR_TIMESPAN))); |
|
||||||
} |
|
||||||
|
|
||||||
/*
|
|
||||||
* basic_pollset - a vtable that provides polling for zero or one file |
|
||||||
* descriptor via poll() |
|
||||||
*/ |
|
||||||
|
|
||||||
typedef struct grpc_unary_promote_args { |
|
||||||
const grpc_pollset_vtable *original_vtable; |
|
||||||
grpc_pollset *pollset; |
|
||||||
grpc_fd *fd; |
|
||||||
grpc_closure promotion_closure; |
|
||||||
} grpc_unary_promote_args; |
|
||||||
|
|
||||||
static void basic_do_promote(grpc_exec_ctx *exec_ctx, void *args, |
|
||||||
bool success) { |
|
||||||
grpc_unary_promote_args *up_args = args; |
|
||||||
const grpc_pollset_vtable *original_vtable = up_args->original_vtable; |
|
||||||
grpc_pollset *pollset = up_args->pollset; |
|
||||||
grpc_fd *fd = up_args->fd; |
|
||||||
|
|
||||||
/*
|
|
||||||
* This is quite tricky. There are a number of cases to keep in mind here: |
|
||||||
* 1. fd may have been orphaned |
|
||||||
* 2. The pollset may no longer be a unary poller (and we can't let case #1 |
|
||||||
* leak to other pollset types!) |
|
||||||
* 3. pollset's fd (which may have changed) may have been orphaned |
|
||||||
* 4. The pollset may be shutting down. |
|
||||||
*/ |
|
||||||
|
|
||||||
gpr_mu_lock(&pollset->mu); |
|
||||||
/* First we need to ensure that nobody is polling concurrently */ |
|
||||||
GPR_ASSERT(!grpc_pollset_has_workers(pollset)); |
|
||||||
|
|
||||||
gpr_free(up_args); |
|
||||||
/* At this point the pollset may no longer be a unary poller. In that case
|
|
||||||
* we should just call the right add function and be done. */ |
|
||||||
/* TODO(klempner): If we're not careful this could cause infinite recursion.
|
|
||||||
* That's not a problem for now because empty_pollset has a trivial poller |
|
||||||
* and we don't have any mechanism to unbecome multipoller. */ |
|
||||||
pollset->in_flight_cbs--; |
|
||||||
if (pollset->shutting_down) { |
|
||||||
/* We don't care about this pollset anymore. */ |
|
||||||
if (pollset->in_flight_cbs == 0 && !pollset->called_shutdown) { |
|
||||||
pollset->called_shutdown = 1; |
|
||||||
finish_shutdown(exec_ctx, pollset); |
|
||||||
} |
|
||||||
} else if (grpc_fd_is_orphaned(fd)) { |
|
||||||
/* Don't try to add it to anything, we'll drop our ref on it below */ |
|
||||||
} else if (pollset->vtable != original_vtable) { |
|
||||||
pollset->vtable->add_fd(exec_ctx, pollset, fd, 0); |
|
||||||
} else if (fd != pollset->data.ptr) { |
|
||||||
grpc_fd *fds[2]; |
|
||||||
fds[0] = pollset->data.ptr; |
|
||||||
fds[1] = fd; |
|
||||||
|
|
||||||
if (fds[0] && !grpc_fd_is_orphaned(fds[0])) { |
|
||||||
grpc_platform_become_multipoller(exec_ctx, pollset, fds, |
|
||||||
GPR_ARRAY_SIZE(fds)); |
|
||||||
GRPC_FD_UNREF(fds[0], "basicpoll"); |
|
||||||
} else { |
|
||||||
/* old fd is orphaned and we haven't cleaned it up until now, so remain a
|
|
||||||
* unary poller */ |
|
||||||
/* Note that it is possible that fds[1] is also orphaned at this point.
|
|
||||||
* That's okay, we'll correct it at the next add or poll. */ |
|
||||||
if (fds[0]) GRPC_FD_UNREF(fds[0], "basicpoll"); |
|
||||||
pollset->data.ptr = fd; |
|
||||||
GRPC_FD_REF(fd, "basicpoll"); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
|
|
||||||
/* Matching ref in basic_pollset_add_fd */ |
|
||||||
GRPC_FD_UNREF(fd, "basicpoll_add"); |
|
||||||
} |
|
||||||
|
|
||||||
static void basic_pollset_add_fd(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
grpc_fd *fd, int and_unlock_pollset) { |
|
||||||
grpc_unary_promote_args *up_args; |
|
||||||
GPR_ASSERT(fd); |
|
||||||
if (fd == pollset->data.ptr) goto exit; |
|
||||||
|
|
||||||
if (!grpc_pollset_has_workers(pollset)) { |
|
||||||
/* Fast path -- no in flight cbs */ |
|
||||||
/* TODO(klempner): Comment this out and fix any test failures or establish
|
|
||||||
* they are due to timing issues */ |
|
||||||
grpc_fd *fds[2]; |
|
||||||
fds[0] = pollset->data.ptr; |
|
||||||
fds[1] = fd; |
|
||||||
|
|
||||||
if (fds[0] == NULL) { |
|
||||||
pollset->data.ptr = fd; |
|
||||||
GRPC_FD_REF(fd, "basicpoll"); |
|
||||||
} else if (!grpc_fd_is_orphaned(fds[0])) { |
|
||||||
grpc_platform_become_multipoller(exec_ctx, pollset, fds, |
|
||||||
GPR_ARRAY_SIZE(fds)); |
|
||||||
GRPC_FD_UNREF(fds[0], "basicpoll"); |
|
||||||
} else { |
|
||||||
/* old fd is orphaned and we haven't cleaned it up until now, so remain a
|
|
||||||
* unary poller */ |
|
||||||
GRPC_FD_UNREF(fds[0], "basicpoll"); |
|
||||||
pollset->data.ptr = fd; |
|
||||||
GRPC_FD_REF(fd, "basicpoll"); |
|
||||||
} |
|
||||||
goto exit; |
|
||||||
} |
|
||||||
|
|
||||||
/* Now we need to promote. This needs to happen when we're not polling. Since
|
|
||||||
* this may be called from poll, the wait needs to happen asynchronously. */ |
|
||||||
GRPC_FD_REF(fd, "basicpoll_add"); |
|
||||||
pollset->in_flight_cbs++; |
|
||||||
up_args = gpr_malloc(sizeof(*up_args)); |
|
||||||
up_args->fd = fd; |
|
||||||
up_args->original_vtable = pollset->vtable; |
|
||||||
up_args->pollset = pollset; |
|
||||||
up_args->promotion_closure.cb = basic_do_promote; |
|
||||||
up_args->promotion_closure.cb_arg = up_args; |
|
||||||
|
|
||||||
grpc_closure_list_add(&pollset->idle_jobs, &up_args->promotion_closure, 1); |
|
||||||
grpc_pollset_kick(pollset, GRPC_POLLSET_KICK_BROADCAST); |
|
||||||
|
|
||||||
exit: |
|
||||||
if (and_unlock_pollset) { |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void basic_pollset_maybe_work_and_unlock(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, |
|
||||||
grpc_pollset_worker *worker, |
|
||||||
gpr_timespec deadline, |
|
||||||
gpr_timespec now) { |
|
||||||
#define POLLOUT_CHECK (POLLOUT | POLLHUP | POLLERR) |
|
||||||
#define POLLIN_CHECK (POLLIN | POLLHUP | POLLERR) |
|
||||||
|
|
||||||
struct pollfd pfd[3]; |
|
||||||
grpc_fd *fd; |
|
||||||
grpc_fd_watcher fd_watcher; |
|
||||||
int timeout; |
|
||||||
int r; |
|
||||||
nfds_t nfds; |
|
||||||
|
|
||||||
fd = pollset->data.ptr; |
|
||||||
if (fd && grpc_fd_is_orphaned(fd)) { |
|
||||||
GRPC_FD_UNREF(fd, "basicpoll"); |
|
||||||
fd = pollset->data.ptr = NULL; |
|
||||||
} |
|
||||||
timeout = grpc_poll_deadline_to_millis_timeout(deadline, now); |
|
||||||
pfd[0].fd = GRPC_WAKEUP_FD_GET_READ_FD(&grpc_global_wakeup_fd); |
|
||||||
pfd[0].events = POLLIN; |
|
||||||
pfd[0].revents = 0; |
|
||||||
pfd[1].fd = GRPC_WAKEUP_FD_GET_READ_FD(&worker->wakeup_fd->fd); |
|
||||||
pfd[1].events = POLLIN; |
|
||||||
pfd[1].revents = 0; |
|
||||||
nfds = 2; |
|
||||||
if (fd) { |
|
||||||
pfd[2].fd = fd->fd; |
|
||||||
pfd[2].revents = 0; |
|
||||||
GRPC_FD_REF(fd, "basicpoll_begin"); |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
pfd[2].events = (short)grpc_fd_begin_poll(fd, pollset, worker, POLLIN, |
|
||||||
POLLOUT, &fd_watcher); |
|
||||||
if (pfd[2].events != 0) { |
|
||||||
nfds++; |
|
||||||
} |
|
||||||
} else { |
|
||||||
gpr_mu_unlock(&pollset->mu); |
|
||||||
} |
|
||||||
|
|
||||||
/* TODO(vpai): Consider first doing a 0 timeout poll here to avoid
|
|
||||||
even going into the blocking annotation if possible */ |
|
||||||
/* poll fd count (argument 2) is shortened by one if we have no events
|
|
||||||
to poll on - such that it only includes the kicker */ |
|
||||||
GPR_TIMER_BEGIN("poll", 0); |
|
||||||
GRPC_SCHEDULING_START_BLOCKING_REGION; |
|
||||||
r = grpc_poll_function(pfd, nfds, timeout); |
|
||||||
GRPC_SCHEDULING_END_BLOCKING_REGION; |
|
||||||
GPR_TIMER_END("poll", 0); |
|
||||||
|
|
||||||
if (r < 0) { |
|
||||||
if (errno != EINTR) { |
|
||||||
gpr_log(GPR_ERROR, "poll() failed: %s", strerror(errno)); |
|
||||||
} |
|
||||||
if (fd) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &fd_watcher, 0, 0); |
|
||||||
} |
|
||||||
} else if (r == 0) { |
|
||||||
if (fd) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &fd_watcher, 0, 0); |
|
||||||
} |
|
||||||
} else { |
|
||||||
if (pfd[0].revents & POLLIN_CHECK) { |
|
||||||
grpc_wakeup_fd_consume_wakeup(&grpc_global_wakeup_fd); |
|
||||||
} |
|
||||||
if (pfd[1].revents & POLLIN_CHECK) { |
|
||||||
grpc_wakeup_fd_consume_wakeup(&worker->wakeup_fd->fd); |
|
||||||
} |
|
||||||
if (nfds > 2) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &fd_watcher, pfd[2].revents & POLLIN_CHECK, |
|
||||||
pfd[2].revents & POLLOUT_CHECK); |
|
||||||
} else if (fd) { |
|
||||||
grpc_fd_end_poll(exec_ctx, &fd_watcher, 0, 0); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
if (fd) { |
|
||||||
GRPC_FD_UNREF(fd, "basicpoll_begin"); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static void basic_pollset_destroy(grpc_pollset *pollset) { |
|
||||||
if (pollset->data.ptr != NULL) { |
|
||||||
GRPC_FD_UNREF(pollset->data.ptr, "basicpoll"); |
|
||||||
pollset->data.ptr = NULL; |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
static const grpc_pollset_vtable basic_pollset = { |
|
||||||
basic_pollset_add_fd, basic_pollset_maybe_work_and_unlock, |
|
||||||
basic_pollset_destroy, basic_pollset_destroy}; |
|
||||||
|
|
||||||
static void become_basic_pollset(grpc_pollset *pollset, grpc_fd *fd_or_null) { |
|
||||||
pollset->vtable = &basic_pollset; |
|
||||||
pollset->data.ptr = fd_or_null; |
|
||||||
if (fd_or_null != NULL) { |
|
||||||
GRPC_FD_REF(fd_or_null, "basicpoll"); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
#endif /* GPR_POSIX_POLLSET */ |
|
||||||
@ -1,153 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#ifndef GRPC_CORE_LIB_IOMGR_POLLSET_POSIX_H |
|
||||||
#define GRPC_CORE_LIB_IOMGR_POLLSET_POSIX_H |
|
||||||
|
|
||||||
#include <poll.h> |
|
||||||
|
|
||||||
#include <grpc/support/sync.h> |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/exec_ctx.h" |
|
||||||
#include "src/core/lib/iomgr/iomgr.h" |
|
||||||
#include "src/core/lib/iomgr/pollset.h" |
|
||||||
#include "src/core/lib/iomgr/wakeup_fd_posix.h" |
|
||||||
|
|
||||||
typedef struct grpc_pollset_vtable grpc_pollset_vtable; |
|
||||||
|
|
||||||
/* forward declare only in this file to avoid leaking impl details via
|
|
||||||
pollset.h; real users of grpc_fd should always include 'fd_posix.h' and not |
|
||||||
use the struct tag */ |
|
||||||
struct grpc_fd; |
|
||||||
|
|
||||||
typedef struct grpc_cached_wakeup_fd { |
|
||||||
grpc_wakeup_fd fd; |
|
||||||
struct grpc_cached_wakeup_fd *next; |
|
||||||
} grpc_cached_wakeup_fd; |
|
||||||
|
|
||||||
struct grpc_pollset_worker { |
|
||||||
grpc_cached_wakeup_fd *wakeup_fd; |
|
||||||
int reevaluate_polling_on_wakeup; |
|
||||||
int kicked_specifically; |
|
||||||
struct grpc_pollset_worker *next; |
|
||||||
struct grpc_pollset_worker *prev; |
|
||||||
}; |
|
||||||
|
|
||||||
struct grpc_pollset { |
|
||||||
/* pollsets under posix can mutate representation as fds are added and
|
|
||||||
removed. |
|
||||||
For example, we may choose a poll() based implementation on linux for |
|
||||||
few fds, and an epoll() based implementation for many fds */ |
|
||||||
const grpc_pollset_vtable *vtable; |
|
||||||
gpr_mu mu; |
|
||||||
grpc_pollset_worker root_worker; |
|
||||||
int in_flight_cbs; |
|
||||||
int shutting_down; |
|
||||||
int called_shutdown; |
|
||||||
int kicked_without_pollers; |
|
||||||
grpc_closure *shutdown_done; |
|
||||||
grpc_closure_list idle_jobs; |
|
||||||
union { |
|
||||||
int fd; |
|
||||||
void *ptr; |
|
||||||
} data; |
|
||||||
/* Local cache of eventfds for workers */ |
|
||||||
grpc_cached_wakeup_fd *local_wakeup_cache; |
|
||||||
}; |
|
||||||
|
|
||||||
struct grpc_pollset_vtable { |
|
||||||
void (*add_fd)(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
struct grpc_fd *fd, int and_unlock_pollset); |
|
||||||
void (*maybe_work_and_unlock)(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
grpc_pollset_worker *worker, |
|
||||||
gpr_timespec deadline, gpr_timespec now); |
|
||||||
void (*finish_shutdown)(grpc_pollset *pollset); |
|
||||||
void (*destroy)(grpc_pollset *pollset); |
|
||||||
}; |
|
||||||
|
|
||||||
/* Add an fd to a pollset */ |
|
||||||
void grpc_pollset_add_fd(grpc_exec_ctx *exec_ctx, grpc_pollset *pollset, |
|
||||||
struct grpc_fd *fd); |
|
||||||
|
|
||||||
/* Returns the fd to listen on for kicks */ |
|
||||||
int grpc_kick_read_fd(grpc_pollset *p); |
|
||||||
/* Call after polling has been kicked to leave the kicked state */ |
|
||||||
void grpc_kick_drain(grpc_pollset *p); |
|
||||||
|
|
||||||
/* Convert a timespec to milliseconds:
|
|
||||||
- very small or negative poll times are clamped to zero to do a |
|
||||||
non-blocking poll (which becomes spin polling) |
|
||||||
- other small values are rounded up to one millisecond |
|
||||||
- longer than a millisecond polls are rounded up to the next nearest |
|
||||||
millisecond to avoid spinning |
|
||||||
- infinite timeouts are converted to -1 */ |
|
||||||
int grpc_poll_deadline_to_millis_timeout(gpr_timespec deadline, |
|
||||||
gpr_timespec now); |
|
||||||
|
|
||||||
/* Allow kick to wakeup the currently polling worker */ |
|
||||||
#define GRPC_POLLSET_CAN_KICK_SELF 1 |
|
||||||
/* Force the wakee to repoll when awoken */ |
|
||||||
#define GRPC_POLLSET_REEVALUATE_POLLING_ON_WAKEUP 2 |
|
||||||
/* As per grpc_pollset_kick, with an extended set of flags (defined above)
|
|
||||||
-- mostly for fd_posix's use. */ |
|
||||||
void grpc_pollset_kick_ext(grpc_pollset *p, |
|
||||||
grpc_pollset_worker *specific_worker, |
|
||||||
uint32_t flags); |
|
||||||
|
|
||||||
/* turn a pollset into a multipoller: platform specific */ |
|
||||||
typedef void (*grpc_platform_become_multipoller_type)(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, |
|
||||||
struct grpc_fd **fds, |
|
||||||
size_t fd_count); |
|
||||||
extern grpc_platform_become_multipoller_type grpc_platform_become_multipoller; |
|
||||||
|
|
||||||
void grpc_poll_become_multipoller(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset *pollset, struct grpc_fd **fds, |
|
||||||
size_t fd_count); |
|
||||||
|
|
||||||
/* Return 1 if the pollset has active threads in grpc_pollset_work (pollset must
|
|
||||||
* be locked) */ |
|
||||||
int grpc_pollset_has_workers(grpc_pollset *pollset); |
|
||||||
|
|
||||||
void grpc_remove_fd_from_all_epoll_sets(int fd); |
|
||||||
|
|
||||||
/* override to allow tests to hook poll() usage */ |
|
||||||
/* NOTE: Any changes to grpc_poll_function must take place when the gRPC
|
|
||||||
is certainly not doing any polling anywhere. |
|
||||||
Otherwise, there might be a race between changing the variable and actually |
|
||||||
doing a polling operation */ |
|
||||||
typedef int (*grpc_poll_function_type)(struct pollfd *, nfds_t, int); |
|
||||||
extern grpc_poll_function_type grpc_poll_function; |
|
||||||
extern grpc_wakeup_fd grpc_global_wakeup_fd; |
|
||||||
|
|
||||||
#endif /* GRPC_CORE_LIB_IOMGR_POLLSET_POSIX_H */ |
|
||||||
@ -1,202 +0,0 @@ |
|||||||
/*
|
|
||||||
* |
|
||||||
* Copyright 2015, Google Inc. |
|
||||||
* All rights reserved. |
|
||||||
* |
|
||||||
* Redistribution and use in source and binary forms, with or without |
|
||||||
* modification, are permitted provided that the following conditions are |
|
||||||
* met: |
|
||||||
* |
|
||||||
* * Redistributions of source code must retain the above copyright |
|
||||||
* notice, this list of conditions and the following disclaimer. |
|
||||||
* * 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. |
|
||||||
* * Neither the name of Google Inc. nor the names of its |
|
||||||
* contributors may be used to endorse or promote products derived from |
|
||||||
* this software without specific prior written permission. |
|
||||||
* |
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
||||||
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
#include <grpc/support/port_platform.h> |
|
||||||
|
|
||||||
#ifdef GPR_POSIX_SOCKET |
|
||||||
|
|
||||||
#include <stdlib.h> |
|
||||||
#include <string.h> |
|
||||||
|
|
||||||
#include <grpc/support/alloc.h> |
|
||||||
#include <grpc/support/useful.h> |
|
||||||
|
|
||||||
#include "src/core/lib/iomgr/pollset_posix.h" |
|
||||||
#include "src/core/lib/iomgr/pollset_set_posix.h" |
|
||||||
|
|
||||||
struct grpc_pollset_set { |
|
||||||
gpr_mu mu; |
|
||||||
|
|
||||||
size_t pollset_count; |
|
||||||
size_t pollset_capacity; |
|
||||||
grpc_pollset **pollsets; |
|
||||||
|
|
||||||
size_t pollset_set_count; |
|
||||||
size_t pollset_set_capacity; |
|
||||||
struct grpc_pollset_set **pollset_sets; |
|
||||||
|
|
||||||
size_t fd_count; |
|
||||||
size_t fd_capacity; |
|
||||||
grpc_fd **fds; |
|
||||||
}; |
|
||||||
|
|
||||||
grpc_pollset_set *grpc_pollset_set_create(void) { |
|
||||||
grpc_pollset_set *pollset_set = gpr_malloc(sizeof(*pollset_set)); |
|
||||||
memset(pollset_set, 0, sizeof(*pollset_set)); |
|
||||||
gpr_mu_init(&pollset_set->mu); |
|
||||||
return pollset_set; |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_destroy(grpc_pollset_set *pollset_set) { |
|
||||||
size_t i; |
|
||||||
gpr_mu_destroy(&pollset_set->mu); |
|
||||||
for (i = 0; i < pollset_set->fd_count; i++) { |
|
||||||
GRPC_FD_UNREF(pollset_set->fds[i], "pollset_set"); |
|
||||||
} |
|
||||||
gpr_free(pollset_set->pollsets); |
|
||||||
gpr_free(pollset_set->pollset_sets); |
|
||||||
gpr_free(pollset_set->fds); |
|
||||||
gpr_free(pollset_set); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_add_pollset(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset_set *pollset_set, |
|
||||||
grpc_pollset *pollset) { |
|
||||||
size_t i, j; |
|
||||||
gpr_mu_lock(&pollset_set->mu); |
|
||||||
if (pollset_set->pollset_count == pollset_set->pollset_capacity) { |
|
||||||
pollset_set->pollset_capacity = |
|
||||||
GPR_MAX(8, 2 * pollset_set->pollset_capacity); |
|
||||||
pollset_set->pollsets = |
|
||||||
gpr_realloc(pollset_set->pollsets, pollset_set->pollset_capacity * |
|
||||||
sizeof(*pollset_set->pollsets)); |
|
||||||
} |
|
||||||
pollset_set->pollsets[pollset_set->pollset_count++] = pollset; |
|
||||||
for (i = 0, j = 0; i < pollset_set->fd_count; i++) { |
|
||||||
if (grpc_fd_is_orphaned(pollset_set->fds[i])) { |
|
||||||
GRPC_FD_UNREF(pollset_set->fds[i], "pollset_set"); |
|
||||||
} else { |
|
||||||
grpc_pollset_add_fd(exec_ctx, pollset, pollset_set->fds[i]); |
|
||||||
pollset_set->fds[j++] = pollset_set->fds[i]; |
|
||||||
} |
|
||||||
} |
|
||||||
pollset_set->fd_count = j; |
|
||||||
gpr_mu_unlock(&pollset_set->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_del_pollset(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset_set *pollset_set, |
|
||||||
grpc_pollset *pollset) { |
|
||||||
size_t i; |
|
||||||
gpr_mu_lock(&pollset_set->mu); |
|
||||||
for (i = 0; i < pollset_set->pollset_count; i++) { |
|
||||||
if (pollset_set->pollsets[i] == pollset) { |
|
||||||
pollset_set->pollset_count--; |
|
||||||
GPR_SWAP(grpc_pollset *, pollset_set->pollsets[i], |
|
||||||
pollset_set->pollsets[pollset_set->pollset_count]); |
|
||||||
break; |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&pollset_set->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_add_pollset_set(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset_set *bag, |
|
||||||
grpc_pollset_set *item) { |
|
||||||
size_t i, j; |
|
||||||
gpr_mu_lock(&bag->mu); |
|
||||||
if (bag->pollset_set_count == bag->pollset_set_capacity) { |
|
||||||
bag->pollset_set_capacity = GPR_MAX(8, 2 * bag->pollset_set_capacity); |
|
||||||
bag->pollset_sets = |
|
||||||
gpr_realloc(bag->pollset_sets, |
|
||||||
bag->pollset_set_capacity * sizeof(*bag->pollset_sets)); |
|
||||||
} |
|
||||||
bag->pollset_sets[bag->pollset_set_count++] = item; |
|
||||||
for (i = 0, j = 0; i < bag->fd_count; i++) { |
|
||||||
if (grpc_fd_is_orphaned(bag->fds[i])) { |
|
||||||
GRPC_FD_UNREF(bag->fds[i], "pollset_set"); |
|
||||||
} else { |
|
||||||
grpc_pollset_set_add_fd(exec_ctx, item, bag->fds[i]); |
|
||||||
bag->fds[j++] = bag->fds[i]; |
|
||||||
} |
|
||||||
} |
|
||||||
bag->fd_count = j; |
|
||||||
gpr_mu_unlock(&bag->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_del_pollset_set(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset_set *bag, |
|
||||||
grpc_pollset_set *item) { |
|
||||||
size_t i; |
|
||||||
gpr_mu_lock(&bag->mu); |
|
||||||
for (i = 0; i < bag->pollset_set_count; i++) { |
|
||||||
if (bag->pollset_sets[i] == item) { |
|
||||||
bag->pollset_set_count--; |
|
||||||
GPR_SWAP(grpc_pollset_set *, bag->pollset_sets[i], |
|
||||||
bag->pollset_sets[bag->pollset_set_count]); |
|
||||||
break; |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&bag->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_add_fd(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset_set *pollset_set, grpc_fd *fd) { |
|
||||||
size_t i; |
|
||||||
gpr_mu_lock(&pollset_set->mu); |
|
||||||
if (pollset_set->fd_count == pollset_set->fd_capacity) { |
|
||||||
pollset_set->fd_capacity = GPR_MAX(8, 2 * pollset_set->fd_capacity); |
|
||||||
pollset_set->fds = gpr_realloc( |
|
||||||
pollset_set->fds, pollset_set->fd_capacity * sizeof(*pollset_set->fds)); |
|
||||||
} |
|
||||||
GRPC_FD_REF(fd, "pollset_set"); |
|
||||||
pollset_set->fds[pollset_set->fd_count++] = fd; |
|
||||||
for (i = 0; i < pollset_set->pollset_count; i++) { |
|
||||||
grpc_pollset_add_fd(exec_ctx, pollset_set->pollsets[i], fd); |
|
||||||
} |
|
||||||
for (i = 0; i < pollset_set->pollset_set_count; i++) { |
|
||||||
grpc_pollset_set_add_fd(exec_ctx, pollset_set->pollset_sets[i], fd); |
|
||||||
} |
|
||||||
gpr_mu_unlock(&pollset_set->mu); |
|
||||||
} |
|
||||||
|
|
||||||
void grpc_pollset_set_del_fd(grpc_exec_ctx *exec_ctx, |
|
||||||
grpc_pollset_set *pollset_set, grpc_fd *fd) { |
|
||||||
size_t i; |
|
||||||
gpr_mu_lock(&pollset_set->mu); |
|
||||||
for (i = 0; i < pollset_set->fd_count; i++) { |
|
||||||
if (pollset_set->fds[i] == fd) { |
|
||||||
pollset_set->fd_count--; |
|
||||||
GPR_SWAP(grpc_fd *, pollset_set->fds[i], |
|
||||||
pollset_set->fds[pollset_set->fd_count]); |
|
||||||
GRPC_FD_UNREF(fd, "pollset_set"); |
|
||||||
break; |
|
||||||
} |
|
||||||
} |
|
||||||
for (i = 0; i < pollset_set->pollset_set_count; i++) { |
|
||||||
grpc_pollset_set_del_fd(exec_ctx, pollset_set->pollset_sets[i], fd); |
|
||||||
} |
|
||||||
gpr_mu_unlock(&pollset_set->mu); |
|
||||||
} |
|
||||||
|
|
||||||
#endif /* GPR_POSIX_SOCKET */ |
|
||||||
@ -0,0 +1,97 @@ |
|||||||
|
#region Copyright notice and license |
||||||
|
|
||||||
|
// Copyright 2016, Google Inc. |
||||||
|
// All rights reserved. |
||||||
|
// |
||||||
|
// Redistribution and use in source and binary forms, with or without |
||||||
|
// modification, are permitted provided that the following conditions are |
||||||
|
// met: |
||||||
|
// |
||||||
|
// * Redistributions of source code must retain the above copyright |
||||||
|
// notice, this list of conditions and the following disclaimer. |
||||||
|
// * 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. |
||||||
|
// * Neither the name of Google Inc. nor the names of its |
||||||
|
// contributors may be used to endorse or promote products derived from |
||||||
|
// this software without specific prior written permission. |
||||||
|
// |
||||||
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
// SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
|
||||||
|
#endregion |
||||||
|
|
||||||
|
using System; |
||||||
|
using System.Collections.Generic; |
||||||
|
using System.Diagnostics; |
||||||
|
using System.Linq; |
||||||
|
using System.Threading; |
||||||
|
using System.Threading.Tasks; |
||||||
|
|
||||||
|
using Grpc.Core; |
||||||
|
using Grpc.Core.Internal; |
||||||
|
using Grpc.Core.Utils; |
||||||
|
|
||||||
|
using NUnit.Framework; |
||||||
|
|
||||||
|
namespace Grpc.Core.Tests |
||||||
|
{ |
||||||
|
public class HalfcloseTest |
||||||
|
{ |
||||||
|
MockServiceHelper helper; |
||||||
|
Server server; |
||||||
|
Channel channel; |
||||||
|
|
||||||
|
[SetUp] |
||||||
|
public void Init() |
||||||
|
{ |
||||||
|
helper = new MockServiceHelper(); |
||||||
|
|
||||||
|
server = helper.GetServer(); |
||||||
|
server.Start(); |
||||||
|
channel = helper.GetChannel(); |
||||||
|
} |
||||||
|
|
||||||
|
[TearDown] |
||||||
|
public void Cleanup() |
||||||
|
{ |
||||||
|
channel.ShutdownAsync().Wait(); |
||||||
|
server.ShutdownAsync().Wait(); |
||||||
|
} |
||||||
|
|
||||||
|
/// <summary> |
||||||
|
/// For client streaming and duplex streaming calls, if server does a full close |
||||||
|
/// before we halfclose the request stream, an attempt to halfclose |
||||||
|
/// (complete the request stream) shouldn't be treated as an error. |
||||||
|
/// </summary> |
||||||
|
[Test] |
||||||
|
public async Task HalfcloseAfterFullclose_ClientStreamingCall() |
||||||
|
{ |
||||||
|
helper.ClientStreamingHandler = new ClientStreamingServerMethod<string, string>(async (requestStream, context) => |
||||||
|
{ |
||||||
|
return "PASS"; |
||||||
|
}); |
||||||
|
|
||||||
|
var call = Calls.AsyncClientStreamingCall(helper.CreateClientStreamingCall()); |
||||||
|
// make sure server has fullclosed on us |
||||||
|
Assert.AreEqual("PASS", await call.ResponseAsync); |
||||||
|
|
||||||
|
// sending close from client should be still fine because server can finish |
||||||
|
// the call anytime and we cannot do anything about it on the client side. |
||||||
|
await call.RequestStream.CompleteAsync(); |
||||||
|
|
||||||
|
// Second attempt to close from client is not allowed. |
||||||
|
Assert.Throws(typeof(InvalidOperationException), async () => await call.RequestStream.CompleteAsync()); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
@ -0,0 +1,126 @@ |
|||||||
|
/* |
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * 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. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
'use strict'; |
||||||
|
|
||||||
|
var _ = require('lodash'); |
||||||
|
|
||||||
|
var grpc = require('../../..'); |
||||||
|
|
||||||
|
var interop_client = require('../interop/interop_client'); |
||||||
|
var MetricsServer = require('./metrics_server'); |
||||||
|
|
||||||
|
var running; |
||||||
|
|
||||||
|
var metrics_server; |
||||||
|
|
||||||
|
var start_time; |
||||||
|
var query_count; |
||||||
|
|
||||||
|
function makeCall(client, test_cases) { |
||||||
|
if (!running) { |
||||||
|
return; |
||||||
|
} |
||||||
|
var test_case = test_cases[_.random(test_cases.length - 1)]; |
||||||
|
interop_client.test_cases[test_case].run(client, function() { |
||||||
|
query_count += 1; |
||||||
|
makeCall(client, test_cases); |
||||||
|
}); |
||||||
|
} |
||||||
|
|
||||||
|
function makeCalls(client, test_cases, parallel_calls_per_channel) { |
||||||
|
_.times(parallel_calls_per_channel, function() { |
||||||
|
makeCall(client, test_cases); |
||||||
|
}); |
||||||
|
} |
||||||
|
|
||||||
|
function getQps() { |
||||||
|
var diff = process.hrtime(start_time); |
||||||
|
var seconds = diff[0] + diff[1] / 1e9; |
||||||
|
return {long_value: query_count / seconds}; |
||||||
|
} |
||||||
|
|
||||||
|
function start(server_addresses, test_cases, channels_per_server, |
||||||
|
parallel_calls_per_channel, metrics_port) { |
||||||
|
running = true; |
||||||
|
/* Assuming that we are not calling unimplemented_method. The client class |
||||||
|
* used by empty_unary is (currently) the client class used by every interop |
||||||
|
* test except unimplemented_method */ |
||||||
|
var Client = interop_client.test_cases.empty_unary.Client; |
||||||
|
/* Make channels_per_server clients connecting to each server address */ |
||||||
|
var channels = _.flatten(_.times( |
||||||
|
channels_per_server, _.partial(_.map, server_addresses, function(address) { |
||||||
|
return new Client(address, grpc.credentials.createInsecure()); |
||||||
|
}))); |
||||||
|
metrics_server = new MetricsServer(metrics_port); |
||||||
|
metrics_server.registerGauge('qps', getQps); |
||||||
|
start_time = process.hrtime(); |
||||||
|
query_count = 0; |
||||||
|
_.each(channels, _.partial(makeCalls, _, test_cases, |
||||||
|
parallel_calls_per_channel)); |
||||||
|
metrics_server.start(); |
||||||
|
} |
||||||
|
|
||||||
|
function stop() { |
||||||
|
running = false; |
||||||
|
metrics_server.shutdown(); |
||||||
|
console.log('QPS: ' + getQps().long_value); |
||||||
|
} |
||||||
|
|
||||||
|
function main() { |
||||||
|
var parseArgs = require('minimist'); |
||||||
|
var argv = parseArgs(process.argv, { |
||||||
|
string: ['server_addresses', 'test_cases', 'metrics_port'], |
||||||
|
default: {'server_addresses': 'localhost:8080', |
||||||
|
'test_duration-secs': -1, |
||||||
|
'num_channels_per_server': 1, |
||||||
|
'num_stubs_per_channel': 1, |
||||||
|
'metrics_port': '8081'} |
||||||
|
}); |
||||||
|
var server_addresses = argv.server_addresses.split(','); |
||||||
|
/* Generate an array of test cases, where the number of instances of each name |
||||||
|
* corresponds to the number given in the argument. |
||||||
|
* e.g. 'empty_unary:1,large_unary:2' => |
||||||
|
* ['empty_unary', 'large_unary', 'large_unary'] */ |
||||||
|
var test_cases = _.flatten(_.map(argv.test_cases.split(','), function(value) { |
||||||
|
var split = value.split(':'); |
||||||
|
return _.times(split[1], _.constant(split[0])); |
||||||
|
})); |
||||||
|
start(server_addresses, test_cases, argv.num_channels_per_server, |
||||||
|
argv.num_stubs_per_channel, argv.metrics_port); |
||||||
|
if (argv['test_duration-secs'] > -1) { |
||||||
|
setTimeout(stop, argv['test_duration-secs'] * 1000); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
main(); |
||||||
@ -0,0 +1,164 @@ |
|||||||
|
#!/usr/bin/env ruby |
||||||
|
|
||||||
|
# Copyright 2016, Google Inc. |
||||||
|
# All rights reserved. |
||||||
|
# |
||||||
|
# Redistribution and use in source and binary forms, with or without |
||||||
|
# modification, are permitted provided that the following conditions are |
||||||
|
# met: |
||||||
|
# |
||||||
|
# * Redistributions of source code must retain the above copyright |
||||||
|
# notice, this list of conditions and the following disclaimer. |
||||||
|
# * 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. |
||||||
|
# * Neither the name of Google Inc. nor the names of its |
||||||
|
# contributors may be used to endorse or promote products derived from |
||||||
|
# this software without specific prior written permission. |
||||||
|
# |
||||||
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
# SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
|
||||||
|
# Worker and worker service implementation |
||||||
|
|
||||||
|
this_dir = File.expand_path(File.dirname(__FILE__)) |
||||||
|
lib_dir = File.join(File.dirname(this_dir), 'lib') |
||||||
|
$LOAD_PATH.unshift(lib_dir) unless $LOAD_PATH.include?(lib_dir) |
||||||
|
$LOAD_PATH.unshift(this_dir) unless $LOAD_PATH.include?(this_dir) |
||||||
|
|
||||||
|
require 'grpc' |
||||||
|
require 'histogram' |
||||||
|
require 'src/proto/grpc/testing/services_services' |
||||||
|
|
||||||
|
class Poisson |
||||||
|
def interarrival |
||||||
|
@lambda_recip * (-Math.log(1.0-rand)) |
||||||
|
end |
||||||
|
def advance |
||||||
|
t = @next_time |
||||||
|
@next_time += interarrival |
||||||
|
t |
||||||
|
end |
||||||
|
def initialize(lambda) |
||||||
|
@lambda_recip = 1.0/lambda |
||||||
|
@next_time = Time.now + interarrival |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
class BenchmarkClient |
||||||
|
def initialize(config) |
||||||
|
opts = {} |
||||||
|
if config.security_params |
||||||
|
if config.security_params.use_test_ca |
||||||
|
certs = load_test_certs |
||||||
|
cred = GRPC::Core::ChannelCredentials.new(certs[0]) |
||||||
|
else |
||||||
|
cred = GRPC::Core::ChannelCredentials.new() |
||||||
|
end |
||||||
|
if config.security_params.server_host_override |
||||||
|
opts[GRPC::Core::Channel::SSL_TARGET] = |
||||||
|
config.security_params.server_host_override |
||||||
|
end |
||||||
|
else |
||||||
|
cred = :this_channel_is_insecure |
||||||
|
end |
||||||
|
@histres = config.histogram_params.resolution |
||||||
|
@histmax = config.histogram_params.max_possible |
||||||
|
@start_time = Time.now |
||||||
|
@histogram = Histogram.new(@histres, @histmax) |
||||||
|
@done = false |
||||||
|
|
||||||
|
gtsr = Grpc::Testing::SimpleRequest |
||||||
|
gtpt = Grpc::Testing::PayloadType |
||||||
|
gtp = Grpc::Testing::Payload |
||||||
|
simple_params = config.payload_config.simple_params |
||||||
|
req = gtsr.new(response_type: gtpt::COMPRESSABLE, |
||||||
|
response_size: simple_params.resp_size, |
||||||
|
payload: gtp.new(type: gtpt::COMPRESSABLE, |
||||||
|
body: nulls(simple_params.req_size))) |
||||||
|
|
||||||
|
(0..config.client_channels-1).each do |chan| |
||||||
|
gtbss = Grpc::Testing::BenchmarkService::Stub |
||||||
|
st = config.server_targets |
||||||
|
stub = gtbss.new(st[chan % st.length], cred, **opts) |
||||||
|
(0..config.outstanding_rpcs_per_channel-1).each do |r| |
||||||
|
Thread.new { |
||||||
|
case config.load_params.load.to_s |
||||||
|
when 'closed_loop' |
||||||
|
waiter = nil |
||||||
|
when 'poisson' |
||||||
|
waiter = Poisson.new(config.load_params.poisson.offered_load / |
||||||
|
(config.client_channels * |
||||||
|
config.outstanding_rpcs_per_channel)) |
||||||
|
end |
||||||
|
case config.rpc_type |
||||||
|
when :UNARY |
||||||
|
unary_ping_ponger(req,stub,config,waiter) |
||||||
|
when :STREAMING |
||||||
|
streaming_ping_ponger(req,stub,config,waiter) |
||||||
|
end |
||||||
|
} |
||||||
|
end |
||||||
|
end |
||||||
|
end |
||||||
|
def wait_to_issue(waiter) |
||||||
|
if waiter |
||||||
|
delay = waiter.advance-Time.now |
||||||
|
sleep delay if delay > 0 |
||||||
|
end |
||||||
|
end |
||||||
|
def unary_ping_ponger(req, stub, config,waiter) |
||||||
|
while !@done |
||||||
|
wait_to_issue(waiter) |
||||||
|
start = Time.now |
||||||
|
resp = stub.unary_call(req) |
||||||
|
@histogram.add((Time.now-start)*1e9) |
||||||
|
end |
||||||
|
end |
||||||
|
def streaming_ping_ponger(req, stub, config, waiter) |
||||||
|
q = EnumeratorQueue.new(self) |
||||||
|
resp = stub.streaming_call(q.each_item) |
||||||
|
start = Time.now |
||||||
|
q.push(req) |
||||||
|
resp.each do |r| |
||||||
|
@histogram.add((Time.now-start)*1e9) |
||||||
|
if !@done |
||||||
|
wait_to_issue(waiter) |
||||||
|
start = Time.now |
||||||
|
q.push(req) |
||||||
|
else |
||||||
|
q.push(self) |
||||||
|
break |
||||||
|
end |
||||||
|
end |
||||||
|
end |
||||||
|
def mark(reset) |
||||||
|
lat = Grpc::Testing::HistogramData.new( |
||||||
|
bucket: @histogram.contents, |
||||||
|
min_seen: @histogram.minimum, |
||||||
|
max_seen: @histogram.maximum, |
||||||
|
sum: @histogram.sum, |
||||||
|
sum_of_squares: @histogram.sum_of_squares, |
||||||
|
count: @histogram.count |
||||||
|
) |
||||||
|
elapsed = Time.now-@start_time |
||||||
|
if reset |
||||||
|
@start_time = Time.now |
||||||
|
@histogram = Histogram.new(@histres, @histmax) |
||||||
|
end |
||||||
|
Grpc::Testing::ClientStats.new(latencies: lat, time_elapsed: elapsed) |
||||||
|
end |
||||||
|
def shutdown |
||||||
|
@done = true |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,88 @@ |
|||||||
|
#!/usr/bin/env ruby |
||||||
|
|
||||||
|
# Copyright 2016, Google Inc. |
||||||
|
# All rights reserved. |
||||||
|
# |
||||||
|
# Redistribution and use in source and binary forms, with or without |
||||||
|
# modification, are permitted provided that the following conditions are |
||||||
|
# met: |
||||||
|
# |
||||||
|
# * Redistributions of source code must retain the above copyright |
||||||
|
# notice, this list of conditions and the following disclaimer. |
||||||
|
# * 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. |
||||||
|
# * Neither the name of Google Inc. nor the names of its |
||||||
|
# contributors may be used to endorse or promote products derived from |
||||||
|
# this software without specific prior written permission. |
||||||
|
# |
||||||
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
# SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
|
||||||
|
# Histogram class for use in performance testing and measurement |
||||||
|
|
||||||
|
class Histogram |
||||||
|
# Determine the bucket index for a given value |
||||||
|
# @param {number} value The value to check |
||||||
|
# @return {number} The bucket index |
||||||
|
def bucket_for(value) |
||||||
|
(Math.log(value)/Math.log(@multiplier)).to_i |
||||||
|
end |
||||||
|
# Initialize an empty histogram |
||||||
|
# @param {number} resolution The resolution of the histogram |
||||||
|
# @param {number} max_possible The maximum value for the histogram |
||||||
|
def initialize(resolution, max_possible) |
||||||
|
@resolution=resolution |
||||||
|
@max_possible=max_possible |
||||||
|
@sum=0 |
||||||
|
@sum_of_squares=0 |
||||||
|
@multiplier=1+resolution |
||||||
|
@count=0 |
||||||
|
@min_seen=max_possible |
||||||
|
@max_seen=0 |
||||||
|
@buckets=Array.new(bucket_for(max_possible)+1, 0) |
||||||
|
end |
||||||
|
# Add a value to the histogram. This updates all statistics with the new |
||||||
|
# value. Those statistics should not be modified except with this function |
||||||
|
# @param {number} value The value to add |
||||||
|
def add(value) |
||||||
|
@sum += value |
||||||
|
@sum_of_squares += value * value |
||||||
|
@count += 1 |
||||||
|
if value < @min_seen |
||||||
|
@min_seen = value |
||||||
|
end |
||||||
|
if value > @max_seen |
||||||
|
@max_seen = value |
||||||
|
end |
||||||
|
@buckets[bucket_for(value)] += 1 |
||||||
|
end |
||||||
|
def minimum |
||||||
|
@min_seen |
||||||
|
end |
||||||
|
def maximum |
||||||
|
@max_seen |
||||||
|
end |
||||||
|
def sum |
||||||
|
@sum |
||||||
|
end |
||||||
|
def sum_of_squares |
||||||
|
@sum_of_squares |
||||||
|
end |
||||||
|
def count |
||||||
|
@count |
||||||
|
end |
||||||
|
def contents |
||||||
|
@buckets |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,76 @@ |
|||||||
|
#!/usr/bin/env ruby |
||||||
|
|
||||||
|
# Copyright 2016, Google Inc. |
||||||
|
# All rights reserved. |
||||||
|
# |
||||||
|
# Redistribution and use in source and binary forms, with or without |
||||||
|
# modification, are permitted provided that the following conditions are |
||||||
|
# met: |
||||||
|
# |
||||||
|
# * Redistributions of source code must retain the above copyright |
||||||
|
# notice, this list of conditions and the following disclaimer. |
||||||
|
# * 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. |
||||||
|
# * Neither the name of Google Inc. nor the names of its |
||||||
|
# contributors may be used to endorse or promote products derived from |
||||||
|
# this software without specific prior written permission. |
||||||
|
# |
||||||
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
# SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
|
||||||
|
# Worker and worker service implementation |
||||||
|
|
||||||
|
this_dir = File.expand_path(File.dirname(__FILE__)) |
||||||
|
lib_dir = File.join(File.dirname(this_dir), 'lib') |
||||||
|
$LOAD_PATH.unshift(lib_dir) unless $LOAD_PATH.include?(lib_dir) |
||||||
|
$LOAD_PATH.unshift(this_dir) unless $LOAD_PATH.include?(this_dir) |
||||||
|
|
||||||
|
require 'grpc' |
||||||
|
|
||||||
|
# produces a string of null chars (\0 aka pack 'x') of length l. |
||||||
|
def nulls(l) |
||||||
|
fail 'requires #{l} to be +ve' if l < 0 |
||||||
|
[].pack('x' * l).force_encoding('ascii-8bit') |
||||||
|
end |
||||||
|
|
||||||
|
# load the test-only certificates |
||||||
|
def load_test_certs |
||||||
|
this_dir = File.expand_path(File.dirname(__FILE__)) |
||||||
|
data_dir = File.join(File.dirname(this_dir), 'spec/testdata') |
||||||
|
files = ['ca.pem', 'server1.key', 'server1.pem'] |
||||||
|
files.map { |f| File.open(File.join(data_dir, f)).read } |
||||||
|
end |
||||||
|
|
||||||
|
# A EnumeratorQueue wraps a Queue yielding the items added to it via each_item. |
||||||
|
class EnumeratorQueue |
||||||
|
extend Forwardable |
||||||
|
def_delegators :@q, :push |
||||||
|
|
||||||
|
def initialize(sentinel) |
||||||
|
@q = Queue.new |
||||||
|
@sentinel = sentinel |
||||||
|
end |
||||||
|
|
||||||
|
def each_item |
||||||
|
return enum_for(:each_item) unless block_given? |
||||||
|
loop do |
||||||
|
r = @q.pop |
||||||
|
break if r.equal?(@sentinel) |
||||||
|
fail r if r.is_a? Exception |
||||||
|
yield r |
||||||
|
end |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
|
||||||
@ -0,0 +1,91 @@ |
|||||||
|
#!/usr/bin/env ruby |
||||||
|
|
||||||
|
# Copyright 2016, Google Inc. |
||||||
|
# All rights reserved. |
||||||
|
# |
||||||
|
# Redistribution and use in source and binary forms, with or without |
||||||
|
# modification, are permitted provided that the following conditions are |
||||||
|
# met: |
||||||
|
# |
||||||
|
# * Redistributions of source code must retain the above copyright |
||||||
|
# notice, this list of conditions and the following disclaimer. |
||||||
|
# * 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. |
||||||
|
# * Neither the name of Google Inc. nor the names of its |
||||||
|
# contributors may be used to endorse or promote products derived from |
||||||
|
# this software without specific prior written permission. |
||||||
|
# |
||||||
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
# SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
|
||||||
|
# Worker and worker service implementation |
||||||
|
|
||||||
|
this_dir = File.expand_path(File.dirname(__FILE__)) |
||||||
|
lib_dir = File.join(File.dirname(this_dir), 'lib') |
||||||
|
$LOAD_PATH.unshift(lib_dir) unless $LOAD_PATH.include?(lib_dir) |
||||||
|
$LOAD_PATH.unshift(this_dir) unless $LOAD_PATH.include?(this_dir) |
||||||
|
|
||||||
|
require 'grpc' |
||||||
|
require 'qps-common' |
||||||
|
require 'src/proto/grpc/testing/messages' |
||||||
|
require 'src/proto/grpc/testing/services_services' |
||||||
|
require 'src/proto/grpc/testing/stats' |
||||||
|
|
||||||
|
class BenchmarkServiceImpl < Grpc::Testing::BenchmarkService::Service |
||||||
|
def unary_call(req, _call) |
||||||
|
sr = Grpc::Testing::SimpleResponse |
||||||
|
pl = Grpc::Testing::Payload |
||||||
|
sr.new(payload: pl.new(body: nulls(req.response_size))) |
||||||
|
end |
||||||
|
def streaming_call(reqs) |
||||||
|
q = EnumeratorQueue.new(self) |
||||||
|
Thread.new { |
||||||
|
sr = Grpc::Testing::SimpleResponse |
||||||
|
pl = Grpc::Testing::Payload |
||||||
|
reqs.each do |req| |
||||||
|
q.push(sr.new(payload: pl.new(body: nulls(req.response_size)))) |
||||||
|
end |
||||||
|
q.push(self) |
||||||
|
} |
||||||
|
q.each_item |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
class BenchmarkServer |
||||||
|
def initialize(config, port) |
||||||
|
if config.security_params |
||||||
|
certs = load_test_certs |
||||||
|
cred = GRPC::Core::ServerCredentials.new( |
||||||
|
nil, [{private_key: certs[1], cert_chain: certs[2]}], false) |
||||||
|
else |
||||||
|
cred = :this_port_is_insecure |
||||||
|
end |
||||||
|
@server = GRPC::RpcServer.new |
||||||
|
@port = @server.add_http2_port("0.0.0.0:" + port.to_s, cred) |
||||||
|
@server.handle(BenchmarkServiceImpl.new) |
||||||
|
@start_time = Time.now |
||||||
|
Thread.new { |
||||||
|
@server.run |
||||||
|
} |
||||||
|
end |
||||||
|
def mark(reset) |
||||||
|
s = Grpc::Testing::ServerStats.new(time_elapsed: |
||||||
|
(Time.now-@start_time).to_f) |
||||||
|
@start_time = Time.now if reset |
||||||
|
s |
||||||
|
end |
||||||
|
def get_port |
||||||
|
@port |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,129 @@ |
|||||||
|
# Generated by the protocol buffer compiler. DO NOT EDIT! |
||||||
|
# source: src/proto/grpc/testing/control.proto |
||||||
|
|
||||||
|
require 'google/protobuf' |
||||||
|
|
||||||
|
require 'src/proto/grpc/testing/payloads' |
||||||
|
require 'src/proto/grpc/testing/stats' |
||||||
|
Google::Protobuf::DescriptorPool.generated_pool.build do |
||||||
|
add_message "grpc.testing.PoissonParams" do |
||||||
|
optional :offered_load, :double, 1 |
||||||
|
end |
||||||
|
add_message "grpc.testing.UniformParams" do |
||||||
|
optional :interarrival_lo, :double, 1 |
||||||
|
optional :interarrival_hi, :double, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.DeterministicParams" do |
||||||
|
optional :offered_load, :double, 1 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ParetoParams" do |
||||||
|
optional :interarrival_base, :double, 1 |
||||||
|
optional :alpha, :double, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ClosedLoopParams" do |
||||||
|
end |
||||||
|
add_message "grpc.testing.LoadParams" do |
||||||
|
oneof :load do |
||||||
|
optional :closed_loop, :message, 1, "grpc.testing.ClosedLoopParams" |
||||||
|
optional :poisson, :message, 2, "grpc.testing.PoissonParams" |
||||||
|
optional :uniform, :message, 3, "grpc.testing.UniformParams" |
||||||
|
optional :determ, :message, 4, "grpc.testing.DeterministicParams" |
||||||
|
optional :pareto, :message, 5, "grpc.testing.ParetoParams" |
||||||
|
end |
||||||
|
end |
||||||
|
add_message "grpc.testing.SecurityParams" do |
||||||
|
optional :use_test_ca, :bool, 1 |
||||||
|
optional :server_host_override, :string, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ClientConfig" do |
||||||
|
repeated :server_targets, :string, 1 |
||||||
|
optional :client_type, :enum, 2, "grpc.testing.ClientType" |
||||||
|
optional :security_params, :message, 3, "grpc.testing.SecurityParams" |
||||||
|
optional :outstanding_rpcs_per_channel, :int32, 4 |
||||||
|
optional :client_channels, :int32, 5 |
||||||
|
optional :async_client_threads, :int32, 7 |
||||||
|
optional :rpc_type, :enum, 8, "grpc.testing.RpcType" |
||||||
|
optional :load_params, :message, 10, "grpc.testing.LoadParams" |
||||||
|
optional :payload_config, :message, 11, "grpc.testing.PayloadConfig" |
||||||
|
optional :histogram_params, :message, 12, "grpc.testing.HistogramParams" |
||||||
|
repeated :core_list, :int32, 13 |
||||||
|
optional :core_limit, :int32, 14 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ClientStatus" do |
||||||
|
optional :stats, :message, 1, "grpc.testing.ClientStats" |
||||||
|
end |
||||||
|
add_message "grpc.testing.Mark" do |
||||||
|
optional :reset, :bool, 1 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ClientArgs" do |
||||||
|
oneof :argtype do |
||||||
|
optional :setup, :message, 1, "grpc.testing.ClientConfig" |
||||||
|
optional :mark, :message, 2, "grpc.testing.Mark" |
||||||
|
end |
||||||
|
end |
||||||
|
add_message "grpc.testing.ServerConfig" do |
||||||
|
optional :server_type, :enum, 1, "grpc.testing.ServerType" |
||||||
|
optional :security_params, :message, 2, "grpc.testing.SecurityParams" |
||||||
|
optional :port, :int32, 4 |
||||||
|
optional :async_server_threads, :int32, 7 |
||||||
|
optional :core_limit, :int32, 8 |
||||||
|
optional :payload_config, :message, 9, "grpc.testing.PayloadConfig" |
||||||
|
repeated :core_list, :int32, 10 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ServerArgs" do |
||||||
|
oneof :argtype do |
||||||
|
optional :setup, :message, 1, "grpc.testing.ServerConfig" |
||||||
|
optional :mark, :message, 2, "grpc.testing.Mark" |
||||||
|
end |
||||||
|
end |
||||||
|
add_message "grpc.testing.ServerStatus" do |
||||||
|
optional :stats, :message, 1, "grpc.testing.ServerStats" |
||||||
|
optional :port, :int32, 2 |
||||||
|
optional :cores, :int32, 3 |
||||||
|
end |
||||||
|
add_message "grpc.testing.CoreRequest" do |
||||||
|
end |
||||||
|
add_message "grpc.testing.CoreResponse" do |
||||||
|
optional :cores, :int32, 1 |
||||||
|
end |
||||||
|
add_message "grpc.testing.Void" do |
||||||
|
end |
||||||
|
add_enum "grpc.testing.ClientType" do |
||||||
|
value :SYNC_CLIENT, 0 |
||||||
|
value :ASYNC_CLIENT, 1 |
||||||
|
end |
||||||
|
add_enum "grpc.testing.ServerType" do |
||||||
|
value :SYNC_SERVER, 0 |
||||||
|
value :ASYNC_SERVER, 1 |
||||||
|
value :ASYNC_GENERIC_SERVER, 2 |
||||||
|
end |
||||||
|
add_enum "grpc.testing.RpcType" do |
||||||
|
value :UNARY, 0 |
||||||
|
value :STREAMING, 1 |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
module Grpc |
||||||
|
module Testing |
||||||
|
PoissonParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.PoissonParams").msgclass |
||||||
|
UniformParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.UniformParams").msgclass |
||||||
|
DeterministicParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.DeterministicParams").msgclass |
||||||
|
ParetoParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ParetoParams").msgclass |
||||||
|
ClosedLoopParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ClosedLoopParams").msgclass |
||||||
|
LoadParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.LoadParams").msgclass |
||||||
|
SecurityParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.SecurityParams").msgclass |
||||||
|
ClientConfig = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ClientConfig").msgclass |
||||||
|
ClientStatus = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ClientStatus").msgclass |
||||||
|
Mark = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.Mark").msgclass |
||||||
|
ClientArgs = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ClientArgs").msgclass |
||||||
|
ServerConfig = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ServerConfig").msgclass |
||||||
|
ServerArgs = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ServerArgs").msgclass |
||||||
|
ServerStatus = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ServerStatus").msgclass |
||||||
|
CoreRequest = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.CoreRequest").msgclass |
||||||
|
CoreResponse = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.CoreResponse").msgclass |
||||||
|
Void = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.Void").msgclass |
||||||
|
ClientType = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ClientType").enummodule |
||||||
|
ServerType = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ServerType").enummodule |
||||||
|
RpcType = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.RpcType").enummodule |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,80 @@ |
|||||||
|
# Generated by the protocol buffer compiler. DO NOT EDIT! |
||||||
|
# source: src/proto/grpc/testing/messages.proto |
||||||
|
|
||||||
|
require 'google/protobuf' |
||||||
|
|
||||||
|
Google::Protobuf::DescriptorPool.generated_pool.build do |
||||||
|
add_message "grpc.testing.Payload" do |
||||||
|
optional :type, :enum, 1, "grpc.testing.PayloadType" |
||||||
|
optional :body, :bytes, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.EchoStatus" do |
||||||
|
optional :code, :int32, 1 |
||||||
|
optional :message, :string, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.SimpleRequest" do |
||||||
|
optional :response_type, :enum, 1, "grpc.testing.PayloadType" |
||||||
|
optional :response_size, :int32, 2 |
||||||
|
optional :payload, :message, 3, "grpc.testing.Payload" |
||||||
|
optional :fill_username, :bool, 4 |
||||||
|
optional :fill_oauth_scope, :bool, 5 |
||||||
|
optional :response_compression, :enum, 6, "grpc.testing.CompressionType" |
||||||
|
optional :response_status, :message, 7, "grpc.testing.EchoStatus" |
||||||
|
end |
||||||
|
add_message "grpc.testing.SimpleResponse" do |
||||||
|
optional :payload, :message, 1, "grpc.testing.Payload" |
||||||
|
optional :username, :string, 2 |
||||||
|
optional :oauth_scope, :string, 3 |
||||||
|
end |
||||||
|
add_message "grpc.testing.StreamingInputCallRequest" do |
||||||
|
optional :payload, :message, 1, "grpc.testing.Payload" |
||||||
|
end |
||||||
|
add_message "grpc.testing.StreamingInputCallResponse" do |
||||||
|
optional :aggregated_payload_size, :int32, 1 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ResponseParameters" do |
||||||
|
optional :size, :int32, 1 |
||||||
|
optional :interval_us, :int32, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.StreamingOutputCallRequest" do |
||||||
|
optional :response_type, :enum, 1, "grpc.testing.PayloadType" |
||||||
|
repeated :response_parameters, :message, 2, "grpc.testing.ResponseParameters" |
||||||
|
optional :payload, :message, 3, "grpc.testing.Payload" |
||||||
|
optional :response_compression, :enum, 6, "grpc.testing.CompressionType" |
||||||
|
optional :response_status, :message, 7, "grpc.testing.EchoStatus" |
||||||
|
end |
||||||
|
add_message "grpc.testing.StreamingOutputCallResponse" do |
||||||
|
optional :payload, :message, 1, "grpc.testing.Payload" |
||||||
|
end |
||||||
|
add_message "grpc.testing.ReconnectInfo" do |
||||||
|
optional :passed, :bool, 1 |
||||||
|
repeated :backoff_ms, :int32, 2 |
||||||
|
end |
||||||
|
add_enum "grpc.testing.PayloadType" do |
||||||
|
value :COMPRESSABLE, 0 |
||||||
|
value :UNCOMPRESSABLE, 1 |
||||||
|
value :RANDOM, 2 |
||||||
|
end |
||||||
|
add_enum "grpc.testing.CompressionType" do |
||||||
|
value :NONE, 0 |
||||||
|
value :GZIP, 1 |
||||||
|
value :DEFLATE, 2 |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
module Grpc |
||||||
|
module Testing |
||||||
|
Payload = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.Payload").msgclass |
||||||
|
EchoStatus = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.EchoStatus").msgclass |
||||||
|
SimpleRequest = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.SimpleRequest").msgclass |
||||||
|
SimpleResponse = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.SimpleResponse").msgclass |
||||||
|
StreamingInputCallRequest = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.StreamingInputCallRequest").msgclass |
||||||
|
StreamingInputCallResponse = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.StreamingInputCallResponse").msgclass |
||||||
|
ResponseParameters = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ResponseParameters").msgclass |
||||||
|
StreamingOutputCallRequest = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.StreamingOutputCallRequest").msgclass |
||||||
|
StreamingOutputCallResponse = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.StreamingOutputCallResponse").msgclass |
||||||
|
ReconnectInfo = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ReconnectInfo").msgclass |
||||||
|
PayloadType = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.PayloadType").enummodule |
||||||
|
CompressionType = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.CompressionType").enummodule |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,33 @@ |
|||||||
|
# Generated by the protocol buffer compiler. DO NOT EDIT! |
||||||
|
# source: src/proto/grpc/testing/payloads.proto |
||||||
|
|
||||||
|
require 'google/protobuf' |
||||||
|
|
||||||
|
Google::Protobuf::DescriptorPool.generated_pool.build do |
||||||
|
add_message "grpc.testing.ByteBufferParams" do |
||||||
|
optional :req_size, :int32, 1 |
||||||
|
optional :resp_size, :int32, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.SimpleProtoParams" do |
||||||
|
optional :req_size, :int32, 1 |
||||||
|
optional :resp_size, :int32, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ComplexProtoParams" do |
||||||
|
end |
||||||
|
add_message "grpc.testing.PayloadConfig" do |
||||||
|
oneof :payload do |
||||||
|
optional :bytebuf_params, :message, 1, "grpc.testing.ByteBufferParams" |
||||||
|
optional :simple_params, :message, 2, "grpc.testing.SimpleProtoParams" |
||||||
|
optional :complex_params, :message, 3, "grpc.testing.ComplexProtoParams" |
||||||
|
end |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
module Grpc |
||||||
|
module Testing |
||||||
|
ByteBufferParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ByteBufferParams").msgclass |
||||||
|
SimpleProtoParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.SimpleProtoParams").msgclass |
||||||
|
ComplexProtoParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ComplexProtoParams").msgclass |
||||||
|
PayloadConfig = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.PayloadConfig").msgclass |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,14 @@ |
|||||||
|
# Generated by the protocol buffer compiler. DO NOT EDIT! |
||||||
|
# source: src/proto/grpc/testing/services.proto |
||||||
|
|
||||||
|
require 'google/protobuf' |
||||||
|
|
||||||
|
require 'src/proto/grpc/testing/messages' |
||||||
|
require 'src/proto/grpc/testing/control' |
||||||
|
Google::Protobuf::DescriptorPool.generated_pool.build do |
||||||
|
end |
||||||
|
|
||||||
|
module Grpc |
||||||
|
module Testing |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,46 @@ |
|||||||
|
# Generated by the protocol buffer compiler. DO NOT EDIT! |
||||||
|
# Source: src/proto/grpc/testing/services.proto for package 'grpc.testing' |
||||||
|
|
||||||
|
require 'grpc' |
||||||
|
require 'src/proto/grpc/testing/services' |
||||||
|
|
||||||
|
module Grpc |
||||||
|
module Testing |
||||||
|
module BenchmarkService |
||||||
|
|
||||||
|
# TODO: add proto service documentation here |
||||||
|
class Service |
||||||
|
|
||||||
|
include GRPC::GenericService |
||||||
|
|
||||||
|
self.marshal_class_method = :encode |
||||||
|
self.unmarshal_class_method = :decode |
||||||
|
self.service_name = 'grpc.testing.BenchmarkService' |
||||||
|
|
||||||
|
rpc :UnaryCall, SimpleRequest, SimpleResponse |
||||||
|
rpc :StreamingCall, stream(SimpleRequest), stream(SimpleResponse) |
||||||
|
end |
||||||
|
|
||||||
|
Stub = Service.rpc_stub_class |
||||||
|
end |
||||||
|
module WorkerService |
||||||
|
|
||||||
|
# TODO: add proto service documentation here |
||||||
|
class Service |
||||||
|
|
||||||
|
include GRPC::GenericService |
||||||
|
|
||||||
|
self.marshal_class_method = :encode |
||||||
|
self.unmarshal_class_method = :decode |
||||||
|
self.service_name = 'grpc.testing.WorkerService' |
||||||
|
|
||||||
|
rpc :RunServer, stream(ServerArgs), stream(ServerStatus) |
||||||
|
rpc :RunClient, stream(ClientArgs), stream(ClientStatus) |
||||||
|
rpc :CoreCount, CoreRequest, CoreResponse |
||||||
|
rpc :QuitWorker, Void, Void |
||||||
|
end |
||||||
|
|
||||||
|
Stub = Service.rpc_stub_class |
||||||
|
end |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,39 @@ |
|||||||
|
# Generated by the protocol buffer compiler. DO NOT EDIT! |
||||||
|
# source: src/proto/grpc/testing/stats.proto |
||||||
|
|
||||||
|
require 'google/protobuf' |
||||||
|
|
||||||
|
Google::Protobuf::DescriptorPool.generated_pool.build do |
||||||
|
add_message "grpc.testing.ServerStats" do |
||||||
|
optional :time_elapsed, :double, 1 |
||||||
|
optional :time_user, :double, 2 |
||||||
|
optional :time_system, :double, 3 |
||||||
|
end |
||||||
|
add_message "grpc.testing.HistogramParams" do |
||||||
|
optional :resolution, :double, 1 |
||||||
|
optional :max_possible, :double, 2 |
||||||
|
end |
||||||
|
add_message "grpc.testing.HistogramData" do |
||||||
|
repeated :bucket, :uint32, 1 |
||||||
|
optional :min_seen, :double, 2 |
||||||
|
optional :max_seen, :double, 3 |
||||||
|
optional :sum, :double, 4 |
||||||
|
optional :sum_of_squares, :double, 5 |
||||||
|
optional :count, :double, 6 |
||||||
|
end |
||||||
|
add_message "grpc.testing.ClientStats" do |
||||||
|
optional :latencies, :message, 1, "grpc.testing.HistogramData" |
||||||
|
optional :time_elapsed, :double, 2 |
||||||
|
optional :time_user, :double, 3 |
||||||
|
optional :time_system, :double, 4 |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
module Grpc |
||||||
|
module Testing |
||||||
|
ServerStats = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ServerStats").msgclass |
||||||
|
HistogramParams = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.HistogramParams").msgclass |
||||||
|
HistogramData = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.HistogramData").msgclass |
||||||
|
ClientStats = Google::Protobuf::DescriptorPool.generated_pool.lookup("grpc.testing.ClientStats").msgclass |
||||||
|
end |
||||||
|
end |
||||||
@ -0,0 +1,128 @@ |
|||||||
|
#!/usr/bin/env ruby |
||||||
|
|
||||||
|
# Copyright 2016, Google Inc. |
||||||
|
# All rights reserved. |
||||||
|
# |
||||||
|
# Redistribution and use in source and binary forms, with or without |
||||||
|
# modification, are permitted provided that the following conditions are |
||||||
|
# met: |
||||||
|
# |
||||||
|
# * Redistributions of source code must retain the above copyright |
||||||
|
# notice, this list of conditions and the following disclaimer. |
||||||
|
# * 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. |
||||||
|
# * Neither the name of Google Inc. nor the names of its |
||||||
|
# contributors may be used to endorse or promote products derived from |
||||||
|
# this software without specific prior written permission. |
||||||
|
# |
||||||
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
# SPECIAL, 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 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
|
||||||
|
# Worker and worker service implementation |
||||||
|
|
||||||
|
this_dir = File.expand_path(File.dirname(__FILE__)) |
||||||
|
lib_dir = File.join(File.dirname(this_dir), 'lib') |
||||||
|
$LOAD_PATH.unshift(lib_dir) unless $LOAD_PATH.include?(lib_dir) |
||||||
|
$LOAD_PATH.unshift(this_dir) unless $LOAD_PATH.include?(this_dir) |
||||||
|
|
||||||
|
require 'grpc' |
||||||
|
require 'optparse' |
||||||
|
require 'histogram' |
||||||
|
require 'etc' |
||||||
|
require 'facter' |
||||||
|
require 'client' |
||||||
|
require 'qps-common' |
||||||
|
require 'server' |
||||||
|
require 'src/proto/grpc/testing/services_services' |
||||||
|
|
||||||
|
class WorkerServiceImpl < Grpc::Testing::WorkerService::Service |
||||||
|
def cpu_cores |
||||||
|
Facter.value('processors')['count'] |
||||||
|
end |
||||||
|
def run_server(reqs) |
||||||
|
q = EnumeratorQueue.new(self) |
||||||
|
Thread.new { |
||||||
|
bms = '' |
||||||
|
gtss = Grpc::Testing::ServerStatus |
||||||
|
reqs.each do |req| |
||||||
|
case req.argtype.to_s |
||||||
|
when 'setup' |
||||||
|
bms = BenchmarkServer.new(req.setup, @server_port) |
||||||
|
q.push(gtss.new(stats: bms.mark(false), port: bms.get_port)) |
||||||
|
when 'mark' |
||||||
|
q.push(gtss.new(stats: bms.mark(req.mark.reset), cores: cpu_cores)) |
||||||
|
end |
||||||
|
end |
||||||
|
q.push(self) |
||||||
|
bms.stop |
||||||
|
} |
||||||
|
q.each_item |
||||||
|
end |
||||||
|
def run_client(reqs) |
||||||
|
q = EnumeratorQueue.new(self) |
||||||
|
Thread.new { |
||||||
|
client = '' |
||||||
|
reqs.each do |req| |
||||||
|
case req.argtype.to_s |
||||||
|
when 'setup' |
||||||
|
client = BenchmarkClient.new(req.setup) |
||||||
|
q.push(Grpc::Testing::ClientStatus.new(stats: client.mark(false))) |
||||||
|
when 'mark' |
||||||
|
q.push(Grpc::Testing::ClientStatus.new(stats: |
||||||
|
client.mark(req.mark.reset))) |
||||||
|
end |
||||||
|
end |
||||||
|
q.push(self) |
||||||
|
client.shutdown |
||||||
|
} |
||||||
|
q.each_item |
||||||
|
end |
||||||
|
def core_count(_args, _call) |
||||||
|
Grpc::Testing::CoreResponse.new(cores: cpu_cores) |
||||||
|
end |
||||||
|
def quit_worker(_args, _call) |
||||||
|
Thread.new { |
||||||
|
sleep 3 |
||||||
|
@server.stop |
||||||
|
} |
||||||
|
Grpc::Testing::Void.new |
||||||
|
end |
||||||
|
def initialize(s, sp) |
||||||
|
@server = s |
||||||
|
@server_port = sp |
||||||
|
end |
||||||
|
end |
||||||
|
|
||||||
|
def main |
||||||
|
options = { |
||||||
|
'driver_port' => 0, |
||||||
|
'server_port' => 0 |
||||||
|
} |
||||||
|
OptionParser.new do |opts| |
||||||
|
opts.banner = 'Usage: [--driver_port <port>] [--server_port <port>]' |
||||||
|
opts.on('--driver_port PORT', '<port>') do |v| |
||||||
|
options['driver_port'] = v |
||||||
|
end |
||||||
|
opts.on('--server_port PORT', '<port>') do |v| |
||||||
|
options['server_port'] = v |
||||||
|
end |
||||||
|
end.parse! |
||||||
|
s = GRPC::RpcServer.new |
||||||
|
s.add_http2_port("0.0.0.0:" + options['driver_port'].to_s, |
||||||
|
:this_port_is_insecure) |
||||||
|
s.handle(WorkerServiceImpl.new(s, options['server_port'].to_i)) |
||||||
|
s.run |
||||||
|
end |
||||||
|
|
||||||
|
main |
||||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in new issue