mirror of https://github.com/grpc/grpc.git
murgatroid99
9 years ago
commit
c04c03cb52
163 changed files with 3824 additions and 1233 deletions
@ -0,0 +1,501 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* 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 "src/core/client_config/resolvers/zookeeper_resolver.h" |
||||||
|
|
||||||
|
#include <string.h> |
||||||
|
|
||||||
|
#include <grpc/support/alloc.h> |
||||||
|
#include <grpc/support/string_util.h> |
||||||
|
|
||||||
|
#include <grpc/grpc_zookeeper.h> |
||||||
|
#include <zookeeper/zookeeper.h> |
||||||
|
|
||||||
|
#include "src/core/client_config/lb_policies/pick_first.h" |
||||||
|
#include "src/core/client_config/resolver_registry.h" |
||||||
|
#include "src/core/iomgr/resolve_address.h" |
||||||
|
#include "src/core/support/string.h" |
||||||
|
#include "src/core/json/json.h" |
||||||
|
|
||||||
|
/** Zookeeper session expiration time in milliseconds */ |
||||||
|
#define GRPC_ZOOKEEPER_SESSION_TIMEOUT 15000 |
||||||
|
|
||||||
|
typedef struct { |
||||||
|
/** base class: must be first */ |
||||||
|
grpc_resolver base; |
||||||
|
/** refcount */ |
||||||
|
gpr_refcount refs; |
||||||
|
/** name to resolve */ |
||||||
|
char *name; |
||||||
|
/** subchannel factory */ |
||||||
|
grpc_subchannel_factory *subchannel_factory; |
||||||
|
/** load balancing policy factory */ |
||||||
|
grpc_lb_policy *(*lb_policy_factory)(grpc_subchannel **subchannels, |
||||||
|
size_t num_subchannels); |
||||||
|
|
||||||
|
/** mutex guarding the rest of the state */ |
||||||
|
gpr_mu mu; |
||||||
|
/** are we currently resolving? */ |
||||||
|
int resolving; |
||||||
|
/** which version of resolved_config have we published? */ |
||||||
|
int published_version; |
||||||
|
/** which version of resolved_config is current? */ |
||||||
|
int resolved_version; |
||||||
|
/** pending next completion, or NULL */ |
||||||
|
grpc_iomgr_closure *next_completion; |
||||||
|
/** target config address for next completion */ |
||||||
|
grpc_client_config **target_config; |
||||||
|
/** current (fully resolved) config */ |
||||||
|
grpc_client_config *resolved_config; |
||||||
|
|
||||||
|
/** zookeeper handle */ |
||||||
|
zhandle_t *zookeeper_handle; |
||||||
|
/** zookeeper resolved addresses */ |
||||||
|
grpc_resolved_addresses *resolved_addrs; |
||||||
|
/** total number of addresses to be resolved */ |
||||||
|
int resolved_total; |
||||||
|
/** number of addresses resolved */ |
||||||
|
int resolved_num; |
||||||
|
} zookeeper_resolver; |
||||||
|
|
||||||
|
static void zookeeper_destroy(grpc_resolver *r); |
||||||
|
|
||||||
|
static void zookeeper_start_resolving_locked(zookeeper_resolver *r); |
||||||
|
static void zookeeper_maybe_finish_next_locked(zookeeper_resolver *r); |
||||||
|
|
||||||
|
static void zookeeper_shutdown(grpc_resolver *r); |
||||||
|
static void zookeeper_channel_saw_error(grpc_resolver *r, |
||||||
|
struct sockaddr *failing_address, |
||||||
|
int failing_address_len); |
||||||
|
static void zookeeper_next(grpc_resolver *r, grpc_client_config **target_config, |
||||||
|
grpc_iomgr_closure *on_complete); |
||||||
|
|
||||||
|
static const grpc_resolver_vtable zookeeper_resolver_vtable = { |
||||||
|
zookeeper_destroy, zookeeper_shutdown, zookeeper_channel_saw_error, |
||||||
|
zookeeper_next}; |
||||||
|
|
||||||
|
static void zookeeper_shutdown(grpc_resolver *resolver) { |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)resolver; |
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
if (r->next_completion != NULL) { |
||||||
|
*r->target_config = NULL; |
||||||
|
grpc_iomgr_add_callback(r->next_completion); |
||||||
|
r->next_completion = NULL; |
||||||
|
} |
||||||
|
zookeeper_close(r->zookeeper_handle); |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_channel_saw_error(grpc_resolver *resolver, |
||||||
|
struct sockaddr *sa, int len) { |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)resolver; |
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
if (r->resolving == 0) { |
||||||
|
zookeeper_start_resolving_locked(r); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_next(grpc_resolver *resolver, |
||||||
|
grpc_client_config **target_config, |
||||||
|
grpc_iomgr_closure *on_complete) { |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)resolver; |
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
GPR_ASSERT(r->next_completion == NULL); |
||||||
|
r->next_completion = on_complete; |
||||||
|
r->target_config = target_config; |
||||||
|
if (r->resolved_version == 0 && r->resolving == 0) { |
||||||
|
zookeeper_start_resolving_locked(r); |
||||||
|
} else { |
||||||
|
zookeeper_maybe_finish_next_locked(r); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
} |
||||||
|
|
||||||
|
/** Zookeeper global watcher for connection management
|
||||||
|
TODO: better connection management besides logs */ |
||||||
|
static void zookeeper_global_watcher(zhandle_t *zookeeper_handle, int type, |
||||||
|
int state, const char *path, |
||||||
|
void *watcher_ctx) { |
||||||
|
if (type == ZOO_SESSION_EVENT) { |
||||||
|
if (state == ZOO_EXPIRED_SESSION_STATE) { |
||||||
|
gpr_log(GPR_ERROR, "Zookeeper session expired"); |
||||||
|
} else if (state == ZOO_AUTH_FAILED_STATE) { |
||||||
|
gpr_log(GPR_ERROR, "Zookeeper authentication failed"); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
/** Zookeeper watcher triggered by changes to watched nodes
|
||||||
|
Once triggered, it tries to resolve again to get updated addresses */ |
||||||
|
static void zookeeper_watcher(zhandle_t *zookeeper_handle, int type, int state, |
||||||
|
const char *path, void *watcher_ctx) { |
||||||
|
if (watcher_ctx != NULL) { |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)watcher_ctx; |
||||||
|
if (state == ZOO_CONNECTED_STATE) { |
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
if (r->resolving == 0) { |
||||||
|
zookeeper_start_resolving_locked(r); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
/** Callback function after getting all resolved addresses
|
||||||
|
Creates a subchannel for each address */ |
||||||
|
static void zookeeper_on_resolved(void *arg, |
||||||
|
grpc_resolved_addresses *addresses) { |
||||||
|
zookeeper_resolver *r = arg; |
||||||
|
grpc_client_config *config = NULL; |
||||||
|
grpc_subchannel **subchannels; |
||||||
|
grpc_subchannel_args args; |
||||||
|
grpc_lb_policy *lb_policy; |
||||||
|
size_t i; |
||||||
|
if (addresses != NULL) { |
||||||
|
config = grpc_client_config_create(); |
||||||
|
subchannels = gpr_malloc(sizeof(grpc_subchannel *) * addresses->naddrs); |
||||||
|
for (i = 0; i < addresses->naddrs; i++) { |
||||||
|
memset(&args, 0, sizeof(args)); |
||||||
|
args.addr = (struct sockaddr *)(addresses->addrs[i].addr); |
||||||
|
args.addr_len = addresses->addrs[i].len; |
||||||
|
subchannels[i] = grpc_subchannel_factory_create_subchannel( |
||||||
|
r->subchannel_factory, &args); |
||||||
|
} |
||||||
|
lb_policy = r->lb_policy_factory(subchannels, addresses->naddrs); |
||||||
|
grpc_client_config_set_lb_policy(config, lb_policy); |
||||||
|
GRPC_LB_POLICY_UNREF(lb_policy, "construction"); |
||||||
|
grpc_resolved_addresses_destroy(addresses); |
||||||
|
gpr_free(subchannels); |
||||||
|
} |
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
GPR_ASSERT(r->resolving == 1); |
||||||
|
r->resolving = 0; |
||||||
|
if (r->resolved_config != NULL) { |
||||||
|
grpc_client_config_unref(r->resolved_config); |
||||||
|
} |
||||||
|
r->resolved_config = config; |
||||||
|
r->resolved_version++; |
||||||
|
zookeeper_maybe_finish_next_locked(r); |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
|
||||||
|
GRPC_RESOLVER_UNREF(&r->base, "zookeeper-resolving"); |
||||||
|
} |
||||||
|
|
||||||
|
/** Callback function for each DNS resolved address */ |
||||||
|
static void zookeeper_dns_resolved(void *arg, |
||||||
|
grpc_resolved_addresses *addresses) { |
||||||
|
size_t i; |
||||||
|
zookeeper_resolver *r = arg; |
||||||
|
int resolve_done = 0; |
||||||
|
|
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
r->resolved_num++; |
||||||
|
r->resolved_addrs->addrs = |
||||||
|
gpr_realloc(r->resolved_addrs->addrs, |
||||||
|
sizeof(grpc_resolved_address) * |
||||||
|
(r->resolved_addrs->naddrs + addresses->naddrs)); |
||||||
|
for (i = 0; i < addresses->naddrs; i++) { |
||||||
|
memcpy(r->resolved_addrs->addrs[i + r->resolved_addrs->naddrs].addr, |
||||||
|
addresses->addrs[i].addr, addresses->addrs[i].len); |
||||||
|
r->resolved_addrs->addrs[i + r->resolved_addrs->naddrs].len = |
||||||
|
addresses->addrs[i].len; |
||||||
|
} |
||||||
|
|
||||||
|
r->resolved_addrs->naddrs += addresses->naddrs; |
||||||
|
grpc_resolved_addresses_destroy(addresses); |
||||||
|
|
||||||
|
/** Wait for all addresses to be resolved */ |
||||||
|
resolve_done = (r->resolved_num == r->resolved_total); |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
if (resolve_done) { |
||||||
|
zookeeper_on_resolved(r, r->resolved_addrs); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
/** Parses JSON format address of a zookeeper node */ |
||||||
|
static char *zookeeper_parse_address(const char *value, int value_len) { |
||||||
|
grpc_json *json; |
||||||
|
grpc_json *cur; |
||||||
|
const char *host; |
||||||
|
const char *port; |
||||||
|
char* buffer; |
||||||
|
char *address = NULL; |
||||||
|
|
||||||
|
buffer = gpr_malloc(value_len); |
||||||
|
memcpy(buffer, value, value_len); |
||||||
|
json = grpc_json_parse_string_with_len(buffer, value_len); |
||||||
|
if (json != NULL) { |
||||||
|
host = NULL; |
||||||
|
port = NULL; |
||||||
|
for (cur = json->child; cur != NULL; cur = cur->next) { |
||||||
|
if (!strcmp(cur->key, "host")) { |
||||||
|
host = cur->value; |
||||||
|
if (port != NULL) { |
||||||
|
break; |
||||||
|
} |
||||||
|
} else if (!strcmp(cur->key, "port")) { |
||||||
|
port = cur->value; |
||||||
|
if (host != NULL) { |
||||||
|
break; |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
if (host != NULL && port != NULL) { |
||||||
|
gpr_asprintf(&address, "%s:%s", host, port); |
||||||
|
} |
||||||
|
grpc_json_destroy(json); |
||||||
|
} |
||||||
|
gpr_free(buffer); |
||||||
|
|
||||||
|
return address; |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_get_children_node_completion(int rc, const char *value, |
||||||
|
int value_len, |
||||||
|
const struct Stat *stat, |
||||||
|
const void *arg) { |
||||||
|
char *address = NULL; |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)arg; |
||||||
|
int resolve_done = 0; |
||||||
|
|
||||||
|
if (rc != 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in getting a child node of %s", r->name); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
address = zookeeper_parse_address(value, value_len); |
||||||
|
if (address != NULL) { |
||||||
|
/** Further resolves address by DNS */ |
||||||
|
grpc_resolve_address(address, NULL, zookeeper_dns_resolved, r); |
||||||
|
gpr_free(address); |
||||||
|
} else { |
||||||
|
gpr_log(GPR_ERROR, "Error in resolving a child node of %s", r->name); |
||||||
|
gpr_mu_lock(&r->mu); |
||||||
|
r->resolved_total--; |
||||||
|
resolve_done = (r->resolved_num == r->resolved_total); |
||||||
|
gpr_mu_unlock(&r->mu); |
||||||
|
if (resolve_done) { |
||||||
|
zookeeper_on_resolved(r, r->resolved_addrs); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_get_children_completion( |
||||||
|
int rc, const struct String_vector *children, const void *arg) { |
||||||
|
char *path; |
||||||
|
int status; |
||||||
|
int i; |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)arg; |
||||||
|
|
||||||
|
if (rc != 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in getting zookeeper children of %s", r->name); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
if (children->count == 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in resolving zookeeper address %s", r->name); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
r->resolved_addrs = gpr_malloc(sizeof(grpc_resolved_addresses)); |
||||||
|
r->resolved_addrs->addrs = NULL; |
||||||
|
r->resolved_addrs->naddrs = 0; |
||||||
|
r->resolved_total = children->count; |
||||||
|
|
||||||
|
/** TODO: Replace expensive heap allocation with stack
|
||||||
|
if we can get maximum length of zookeeper path */ |
||||||
|
for (i = 0; i < children->count; i++) { |
||||||
|
gpr_asprintf(&path, "%s/%s", r->name, children->data[i]); |
||||||
|
status = zoo_awget(r->zookeeper_handle, path, zookeeper_watcher, r, |
||||||
|
zookeeper_get_children_node_completion, r); |
||||||
|
gpr_free(path); |
||||||
|
if (status != 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in getting zookeeper node %s", path); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_get_node_completion(int rc, const char *value, |
||||||
|
int value_len, |
||||||
|
const struct Stat *stat, |
||||||
|
const void *arg) { |
||||||
|
int status; |
||||||
|
char *address = NULL; |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)arg; |
||||||
|
r->resolved_addrs = NULL; |
||||||
|
r->resolved_total = 0; |
||||||
|
r->resolved_num = 0; |
||||||
|
|
||||||
|
if (rc != 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in getting zookeeper node %s", r->name); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
/** If zookeeper node of path r->name does not have address
|
||||||
|
(i.e. service node), get its children */ |
||||||
|
address = zookeeper_parse_address(value, value_len); |
||||||
|
if (address != NULL) { |
||||||
|
r->resolved_addrs = gpr_malloc(sizeof(grpc_resolved_addresses)); |
||||||
|
r->resolved_addrs->addrs = NULL; |
||||||
|
r->resolved_addrs->naddrs = 0; |
||||||
|
r->resolved_total = 1; |
||||||
|
/** Further resolves address by DNS */ |
||||||
|
grpc_resolve_address(address, NULL, zookeeper_dns_resolved, r); |
||||||
|
gpr_free(address); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
status = zoo_awget_children(r->zookeeper_handle, r->name, zookeeper_watcher, |
||||||
|
r, zookeeper_get_children_completion, r); |
||||||
|
if (status != 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in getting zookeeper children of %s", r->name); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_resolve_address(zookeeper_resolver *r) { |
||||||
|
int status; |
||||||
|
status = zoo_awget(r->zookeeper_handle, r->name, zookeeper_watcher, r, |
||||||
|
zookeeper_get_node_completion, r); |
||||||
|
if (status != 0) { |
||||||
|
gpr_log(GPR_ERROR, "Error in getting zookeeper node %s", r->name); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_start_resolving_locked(zookeeper_resolver *r) { |
||||||
|
GRPC_RESOLVER_REF(&r->base, "zookeeper-resolving"); |
||||||
|
GPR_ASSERT(r->resolving == 0); |
||||||
|
r->resolving = 1; |
||||||
|
zookeeper_resolve_address(r); |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_maybe_finish_next_locked(zookeeper_resolver *r) { |
||||||
|
if (r->next_completion != NULL && |
||||||
|
r->resolved_version != r->published_version) { |
||||||
|
*r->target_config = r->resolved_config; |
||||||
|
if (r->resolved_config != NULL) { |
||||||
|
grpc_client_config_ref(r->resolved_config); |
||||||
|
} |
||||||
|
grpc_iomgr_add_callback(r->next_completion); |
||||||
|
r->next_completion = NULL; |
||||||
|
r->published_version = r->resolved_version; |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_destroy(grpc_resolver *gr) { |
||||||
|
zookeeper_resolver *r = (zookeeper_resolver *)gr; |
||||||
|
gpr_mu_destroy(&r->mu); |
||||||
|
if (r->resolved_config != NULL) { |
||||||
|
grpc_client_config_unref(r->resolved_config); |
||||||
|
} |
||||||
|
grpc_subchannel_factory_unref(r->subchannel_factory); |
||||||
|
gpr_free(r->name); |
||||||
|
gpr_free(r); |
||||||
|
} |
||||||
|
|
||||||
|
static grpc_resolver *zookeeper_create( |
||||||
|
grpc_uri *uri, |
||||||
|
grpc_lb_policy *(*lb_policy_factory)(grpc_subchannel **subchannels, |
||||||
|
size_t num_subchannels), |
||||||
|
grpc_subchannel_factory *subchannel_factory) { |
||||||
|
zookeeper_resolver *r; |
||||||
|
size_t length; |
||||||
|
char *path = uri->path; |
||||||
|
|
||||||
|
if (0 == strcmp(uri->authority, "")) { |
||||||
|
gpr_log(GPR_ERROR, "No authority specified in zookeeper uri"); |
||||||
|
return NULL; |
||||||
|
} |
||||||
|
|
||||||
|
/** Removes the trailing slash if exists */ |
||||||
|
length = strlen(path); |
||||||
|
if (length > 1 && path[length - 1] == '/') { |
||||||
|
path[length - 1] = 0; |
||||||
|
} |
||||||
|
|
||||||
|
r = gpr_malloc(sizeof(zookeeper_resolver)); |
||||||
|
memset(r, 0, sizeof(*r)); |
||||||
|
gpr_ref_init(&r->refs, 1); |
||||||
|
gpr_mu_init(&r->mu); |
||||||
|
grpc_resolver_init(&r->base, &zookeeper_resolver_vtable); |
||||||
|
r->name = gpr_strdup(path); |
||||||
|
|
||||||
|
r->subchannel_factory = subchannel_factory; |
||||||
|
r->lb_policy_factory = lb_policy_factory; |
||||||
|
grpc_subchannel_factory_ref(subchannel_factory); |
||||||
|
|
||||||
|
/** Initializes zookeeper client */ |
||||||
|
zoo_set_debug_level(ZOO_LOG_LEVEL_WARN); |
||||||
|
r->zookeeper_handle = zookeeper_init(uri->authority, zookeeper_global_watcher, |
||||||
|
GRPC_ZOOKEEPER_SESSION_TIMEOUT, 0, 0, 0); |
||||||
|
if (r->zookeeper_handle == NULL) { |
||||||
|
gpr_log(GPR_ERROR, "Unable to connect to zookeeper server"); |
||||||
|
return NULL; |
||||||
|
} |
||||||
|
|
||||||
|
return &r->base; |
||||||
|
} |
||||||
|
|
||||||
|
static void zookeeper_plugin_init() { |
||||||
|
grpc_register_resolver_type("zookeeper", |
||||||
|
grpc_zookeeper_resolver_factory_create()); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_zookeeper_register() { |
||||||
|
grpc_register_plugin(zookeeper_plugin_init, NULL); |
||||||
|
} |
||||||
|
|
||||||
|
/*
|
||||||
|
* FACTORY |
||||||
|
*/ |
||||||
|
|
||||||
|
static void zookeeper_factory_ref(grpc_resolver_factory *factory) {} |
||||||
|
|
||||||
|
static void zookeeper_factory_unref(grpc_resolver_factory *factory) {} |
||||||
|
|
||||||
|
static grpc_resolver *zookeeper_factory_create_resolver( |
||||||
|
grpc_resolver_factory *factory, grpc_uri *uri, |
||||||
|
grpc_subchannel_factory *subchannel_factory) { |
||||||
|
return zookeeper_create(uri, grpc_create_pick_first_lb_policy, |
||||||
|
subchannel_factory); |
||||||
|
} |
||||||
|
|
||||||
|
static const grpc_resolver_factory_vtable zookeeper_factory_vtable = { |
||||||
|
zookeeper_factory_ref, zookeeper_factory_unref, |
||||||
|
zookeeper_factory_create_resolver}; |
||||||
|
static grpc_resolver_factory zookeeper_resolver_factory = { |
||||||
|
&zookeeper_factory_vtable}; |
||||||
|
|
||||||
|
grpc_resolver_factory *grpc_zookeeper_resolver_factory_create() { |
||||||
|
return &zookeeper_resolver_factory; |
||||||
|
} |
||||||
@ -0,0 +1,42 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* 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_INTERNAL_CORE_CLIENT_CONFIG_RESOLVERS_ZOOKEEPER_RESOLVER_H |
||||||
|
#define GRPC_INTERNAL_CORE_CLIENT_CONFIG_RESOLVERS_ZOOKEEPER_RESOLVER_H |
||||||
|
|
||||||
|
#include "src/core/client_config/resolver_factory.h" |
||||||
|
|
||||||
|
/** Create a zookeeper resolver factory */ |
||||||
|
grpc_resolver_factory *grpc_zookeeper_resolver_factory_create(void); |
||||||
|
|
||||||
|
#endif /* GRPC_INTERNAL_CORE_CLIENT_CONFIG_RESOLVERS_ZOOKEEPER_RESOLVER_H */ |
||||||
@ -0,0 +1,438 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* 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. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
/* FIXME: "posix" files shouldn't be depending on _GNU_SOURCE */ |
||||||
|
#ifndef _GNU_SOURCE |
||||||
|
#define _GNU_SOURCE |
||||||
|
#endif |
||||||
|
|
||||||
|
#include <grpc/support/port_platform.h> |
||||||
|
|
||||||
|
#ifdef GPR_POSIX_SOCKET |
||||||
|
|
||||||
|
#include "src/core/iomgr/udp_server.h" |
||||||
|
|
||||||
|
#include <errno.h> |
||||||
|
#include <fcntl.h> |
||||||
|
#include <limits.h> |
||||||
|
#include <netinet/in.h> |
||||||
|
#include <netinet/tcp.h> |
||||||
|
#include <string.h> |
||||||
|
#include <sys/socket.h> |
||||||
|
#include <sys/stat.h> |
||||||
|
#include <sys/types.h> |
||||||
|
#include <sys/un.h> |
||||||
|
#include <unistd.h> |
||||||
|
|
||||||
|
#include "src/core/iomgr/fd_posix.h" |
||||||
|
#include "src/core/iomgr/pollset_posix.h" |
||||||
|
#include "src/core/iomgr/resolve_address.h" |
||||||
|
#include "src/core/iomgr/sockaddr_utils.h" |
||||||
|
#include "src/core/iomgr/socket_utils_posix.h" |
||||||
|
#include "src/core/support/string.h" |
||||||
|
#include <grpc/support/alloc.h> |
||||||
|
#include <grpc/support/log.h> |
||||||
|
#include <grpc/support/sync.h> |
||||||
|
#include <grpc/support/string_util.h> |
||||||
|
#include <grpc/support/time.h> |
||||||
|
|
||||||
|
#define INIT_PORT_CAP 2 |
||||||
|
|
||||||
|
/* one listening port */ |
||||||
|
typedef struct { |
||||||
|
int fd; |
||||||
|
grpc_fd *emfd; |
||||||
|
grpc_udp_server *server; |
||||||
|
union { |
||||||
|
gpr_uint8 untyped[GRPC_MAX_SOCKADDR_SIZE]; |
||||||
|
struct sockaddr sockaddr; |
||||||
|
struct sockaddr_un un; |
||||||
|
} addr; |
||||||
|
int addr_len; |
||||||
|
grpc_iomgr_closure read_closure; |
||||||
|
grpc_iomgr_closure destroyed_closure; |
||||||
|
grpc_udp_server_read_cb read_cb; |
||||||
|
} server_port; |
||||||
|
|
||||||
|
static void unlink_if_unix_domain_socket(const struct sockaddr_un *un) { |
||||||
|
struct stat st; |
||||||
|
|
||||||
|
if (stat(un->sun_path, &st) == 0 && (st.st_mode & S_IFMT) == S_IFSOCK) { |
||||||
|
unlink(un->sun_path); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
/* the overall server */ |
||||||
|
struct grpc_udp_server { |
||||||
|
grpc_udp_server_cb cb; |
||||||
|
void *cb_arg; |
||||||
|
|
||||||
|
gpr_mu mu; |
||||||
|
gpr_cv cv; |
||||||
|
|
||||||
|
/* active port count: how many ports are actually still listening */ |
||||||
|
size_t active_ports; |
||||||
|
/* destroyed port count: how many ports are completely destroyed */ |
||||||
|
size_t destroyed_ports; |
||||||
|
|
||||||
|
/* is this server shutting down? (boolean) */ |
||||||
|
int shutdown; |
||||||
|
|
||||||
|
/* all listening ports */ |
||||||
|
server_port *ports; |
||||||
|
size_t nports; |
||||||
|
size_t port_capacity; |
||||||
|
|
||||||
|
/* shutdown callback */ |
||||||
|
void (*shutdown_complete)(void *); |
||||||
|
void *shutdown_complete_arg; |
||||||
|
|
||||||
|
/* all pollsets interested in new connections */ |
||||||
|
grpc_pollset **pollsets; |
||||||
|
/* number of pollsets in the pollsets array */ |
||||||
|
size_t pollset_count; |
||||||
|
}; |
||||||
|
|
||||||
|
grpc_udp_server *grpc_udp_server_create(void) { |
||||||
|
grpc_udp_server *s = gpr_malloc(sizeof(grpc_udp_server)); |
||||||
|
gpr_mu_init(&s->mu); |
||||||
|
gpr_cv_init(&s->cv); |
||||||
|
s->active_ports = 0; |
||||||
|
s->destroyed_ports = 0; |
||||||
|
s->shutdown = 0; |
||||||
|
s->cb = NULL; |
||||||
|
s->cb_arg = NULL; |
||||||
|
s->ports = gpr_malloc(sizeof(server_port) * INIT_PORT_CAP); |
||||||
|
s->nports = 0; |
||||||
|
s->port_capacity = INIT_PORT_CAP; |
||||||
|
|
||||||
|
return s; |
||||||
|
} |
||||||
|
|
||||||
|
static void finish_shutdown(grpc_udp_server *s) { |
||||||
|
s->shutdown_complete(s->shutdown_complete_arg); |
||||||
|
|
||||||
|
gpr_mu_destroy(&s->mu); |
||||||
|
gpr_cv_destroy(&s->cv); |
||||||
|
|
||||||
|
gpr_free(s->ports); |
||||||
|
gpr_free(s); |
||||||
|
} |
||||||
|
|
||||||
|
static void destroyed_port(void *server, int success) { |
||||||
|
grpc_udp_server *s = server; |
||||||
|
gpr_mu_lock(&s->mu); |
||||||
|
s->destroyed_ports++; |
||||||
|
if (s->destroyed_ports == s->nports) { |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
finish_shutdown(s); |
||||||
|
} else { |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void dont_care_about_shutdown_completion(void *ignored) {} |
||||||
|
|
||||||
|
/* called when all listening endpoints have been shutdown, so no further
|
||||||
|
events will be received on them - at this point it's safe to destroy |
||||||
|
things */ |
||||||
|
static void deactivated_all_ports(grpc_udp_server *s) { |
||||||
|
size_t i; |
||||||
|
|
||||||
|
/* delete ALL the things */ |
||||||
|
gpr_mu_lock(&s->mu); |
||||||
|
|
||||||
|
if (!s->shutdown) { |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
if (s->nports) { |
||||||
|
for (i = 0; i < s->nports; i++) { |
||||||
|
server_port *sp = &s->ports[i]; |
||||||
|
if (sp->addr.sockaddr.sa_family == AF_UNIX) { |
||||||
|
unlink_if_unix_domain_socket(&sp->addr.un); |
||||||
|
} |
||||||
|
sp->destroyed_closure.cb = destroyed_port; |
||||||
|
sp->destroyed_closure.cb_arg = s; |
||||||
|
grpc_fd_orphan(sp->emfd, &sp->destroyed_closure, "udp_listener_shutdown"); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
} else { |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
finish_shutdown(s); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_udp_server_destroy( |
||||||
|
grpc_udp_server *s, void (*shutdown_complete)(void *shutdown_complete_arg), |
||||||
|
void *shutdown_complete_arg) { |
||||||
|
size_t i; |
||||||
|
gpr_mu_lock(&s->mu); |
||||||
|
|
||||||
|
GPR_ASSERT(!s->shutdown); |
||||||
|
s->shutdown = 1; |
||||||
|
|
||||||
|
s->shutdown_complete = shutdown_complete |
||||||
|
? shutdown_complete |
||||||
|
: dont_care_about_shutdown_completion; |
||||||
|
s->shutdown_complete_arg = shutdown_complete_arg; |
||||||
|
|
||||||
|
/* shutdown all fd's */ |
||||||
|
if (s->active_ports) { |
||||||
|
for (i = 0; i < s->nports; i++) { |
||||||
|
grpc_fd_shutdown(s->ports[i].emfd); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
} else { |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
deactivated_all_ports(s); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
/* Prepare a recently-created socket for listening. */ |
||||||
|
static int prepare_socket(int fd, const struct sockaddr *addr, int addr_len) { |
||||||
|
struct sockaddr_storage sockname_temp; |
||||||
|
socklen_t sockname_len; |
||||||
|
int get_local_ip; |
||||||
|
int rc; |
||||||
|
|
||||||
|
if (fd < 0) { |
||||||
|
goto error; |
||||||
|
} |
||||||
|
|
||||||
|
get_local_ip = 1; |
||||||
|
rc = setsockopt(fd, IPPROTO_IP, IP_PKTINFO, |
||||||
|
&get_local_ip, sizeof(get_local_ip)); |
||||||
|
if (rc == 0 && addr->sa_family == AF_INET6) { |
||||||
|
rc = setsockopt(fd, IPPROTO_IPV6, IPV6_RECVPKTINFO, |
||||||
|
&get_local_ip, sizeof(get_local_ip)); |
||||||
|
} |
||||||
|
|
||||||
|
if (bind(fd, addr, addr_len) < 0) { |
||||||
|
char *addr_str; |
||||||
|
grpc_sockaddr_to_string(&addr_str, addr, 0); |
||||||
|
gpr_log(GPR_ERROR, "bind addr=%s: %s", addr_str, strerror(errno)); |
||||||
|
gpr_free(addr_str); |
||||||
|
goto error; |
||||||
|
} |
||||||
|
|
||||||
|
sockname_len = sizeof(sockname_temp); |
||||||
|
if (getsockname(fd, (struct sockaddr *)&sockname_temp, &sockname_len) < 0) { |
||||||
|
goto error; |
||||||
|
} |
||||||
|
|
||||||
|
return grpc_sockaddr_get_port((struct sockaddr *)&sockname_temp); |
||||||
|
|
||||||
|
error: |
||||||
|
if (fd >= 0) { |
||||||
|
close(fd); |
||||||
|
} |
||||||
|
return -1; |
||||||
|
} |
||||||
|
|
||||||
|
/* event manager callback when reads are ready */ |
||||||
|
static void on_read(void *arg, int success) { |
||||||
|
server_port *sp = arg; |
||||||
|
|
||||||
|
if (success == 0) { |
||||||
|
gpr_mu_lock(&sp->server->mu); |
||||||
|
if (0 == --sp->server->active_ports) { |
||||||
|
gpr_mu_unlock(&sp->server->mu); |
||||||
|
deactivated_all_ports(sp->server); |
||||||
|
} else { |
||||||
|
gpr_mu_unlock(&sp->server->mu); |
||||||
|
} |
||||||
|
return; |
||||||
|
} |
||||||
|
|
||||||
|
/* Tell the registered callback that data is available to read. */ |
||||||
|
GPR_ASSERT(sp->read_cb); |
||||||
|
sp->read_cb(sp->fd, sp->server->cb, sp->server->cb_arg); |
||||||
|
|
||||||
|
/* Re-arm the notification event so we get another chance to read. */ |
||||||
|
grpc_fd_notify_on_read(sp->emfd, &sp->read_closure); |
||||||
|
} |
||||||
|
|
||||||
|
static int add_socket_to_server(grpc_udp_server *s, int fd, |
||||||
|
const struct sockaddr *addr, int addr_len, |
||||||
|
grpc_udp_server_read_cb read_cb) { |
||||||
|
server_port *sp; |
||||||
|
int port; |
||||||
|
char *addr_str; |
||||||
|
char *name; |
||||||
|
|
||||||
|
port = prepare_socket(fd, addr, addr_len); |
||||||
|
if (port >= 0) { |
||||||
|
grpc_sockaddr_to_string(&addr_str, (struct sockaddr *)&addr, 1); |
||||||
|
gpr_asprintf(&name, "udp-server-listener:%s", addr_str); |
||||||
|
gpr_mu_lock(&s->mu); |
||||||
|
GPR_ASSERT(!s->cb && "must add ports before starting server"); |
||||||
|
/* append it to the list under a lock */ |
||||||
|
if (s->nports == s->port_capacity) { |
||||||
|
s->port_capacity *= 2; |
||||||
|
s->ports = gpr_realloc(s->ports, sizeof(server_port) * s->port_capacity); |
||||||
|
} |
||||||
|
sp = &s->ports[s->nports++]; |
||||||
|
sp->server = s; |
||||||
|
sp->fd = fd; |
||||||
|
sp->emfd = grpc_fd_create(fd, name); |
||||||
|
memcpy(sp->addr.untyped, addr, addr_len); |
||||||
|
sp->addr_len = addr_len; |
||||||
|
sp->read_cb = read_cb; |
||||||
|
GPR_ASSERT(sp->emfd); |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
} |
||||||
|
|
||||||
|
return port; |
||||||
|
} |
||||||
|
|
||||||
|
int grpc_udp_server_add_port(grpc_udp_server *s, const void *addr, |
||||||
|
int addr_len, grpc_udp_server_read_cb read_cb) { |
||||||
|
int allocated_port1 = -1; |
||||||
|
int allocated_port2 = -1; |
||||||
|
unsigned i; |
||||||
|
int fd; |
||||||
|
grpc_dualstack_mode dsmode; |
||||||
|
struct sockaddr_in6 addr6_v4mapped; |
||||||
|
struct sockaddr_in wild4; |
||||||
|
struct sockaddr_in6 wild6; |
||||||
|
struct sockaddr_in addr4_copy; |
||||||
|
struct sockaddr *allocated_addr = NULL; |
||||||
|
struct sockaddr_storage sockname_temp; |
||||||
|
socklen_t sockname_len; |
||||||
|
int port; |
||||||
|
|
||||||
|
if (((struct sockaddr *)addr)->sa_family == AF_UNIX) { |
||||||
|
unlink_if_unix_domain_socket(addr); |
||||||
|
} |
||||||
|
|
||||||
|
/* Check if this is a wildcard port, and if so, try to keep the port the same
|
||||||
|
as some previously created listener. */ |
||||||
|
if (grpc_sockaddr_get_port(addr) == 0) { |
||||||
|
for (i = 0; i < s->nports; i++) { |
||||||
|
sockname_len = sizeof(sockname_temp); |
||||||
|
if (0 == getsockname(s->ports[i].fd, (struct sockaddr *)&sockname_temp, |
||||||
|
&sockname_len)) { |
||||||
|
port = grpc_sockaddr_get_port((struct sockaddr *)&sockname_temp); |
||||||
|
if (port > 0) { |
||||||
|
allocated_addr = malloc(addr_len); |
||||||
|
memcpy(allocated_addr, addr, addr_len); |
||||||
|
grpc_sockaddr_set_port(allocated_addr, port); |
||||||
|
addr = allocated_addr; |
||||||
|
break; |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
if (grpc_sockaddr_to_v4mapped(addr, &addr6_v4mapped)) { |
||||||
|
addr = (const struct sockaddr *)&addr6_v4mapped; |
||||||
|
addr_len = sizeof(addr6_v4mapped); |
||||||
|
} |
||||||
|
|
||||||
|
/* Treat :: or 0.0.0.0 as a family-agnostic wildcard. */ |
||||||
|
if (grpc_sockaddr_is_wildcard(addr, &port)) { |
||||||
|
grpc_sockaddr_make_wildcards(port, &wild4, &wild6); |
||||||
|
|
||||||
|
/* Try listening on IPv6 first. */ |
||||||
|
addr = (struct sockaddr *)&wild6; |
||||||
|
addr_len = sizeof(wild6); |
||||||
|
fd = grpc_create_dualstack_socket(addr, SOCK_DGRAM, IPPROTO_UDP, &dsmode); |
||||||
|
allocated_port1 = add_socket_to_server(s, fd, addr, addr_len, read_cb); |
||||||
|
if (fd >= 0 && dsmode == GRPC_DSMODE_DUALSTACK) { |
||||||
|
goto done; |
||||||
|
} |
||||||
|
|
||||||
|
/* If we didn't get a dualstack socket, also listen on 0.0.0.0. */ |
||||||
|
if (port == 0 && allocated_port1 > 0) { |
||||||
|
grpc_sockaddr_set_port((struct sockaddr *)&wild4, allocated_port1); |
||||||
|
} |
||||||
|
addr = (struct sockaddr *)&wild4; |
||||||
|
addr_len = sizeof(wild4); |
||||||
|
} |
||||||
|
|
||||||
|
fd = grpc_create_dualstack_socket(addr, SOCK_DGRAM, IPPROTO_UDP, &dsmode); |
||||||
|
if (fd < 0) { |
||||||
|
gpr_log(GPR_ERROR, "Unable to create socket: %s", strerror(errno)); |
||||||
|
} |
||||||
|
if (dsmode == GRPC_DSMODE_IPV4 && |
||||||
|
grpc_sockaddr_is_v4mapped(addr, &addr4_copy)) { |
||||||
|
addr = (struct sockaddr *)&addr4_copy; |
||||||
|
addr_len = sizeof(addr4_copy); |
||||||
|
} |
||||||
|
allocated_port2 = add_socket_to_server(s, fd, addr, addr_len, read_cb); |
||||||
|
|
||||||
|
done: |
||||||
|
gpr_free(allocated_addr); |
||||||
|
return allocated_port1 >= 0 ? allocated_port1 : allocated_port2; |
||||||
|
} |
||||||
|
|
||||||
|
int grpc_udp_server_get_fd(grpc_udp_server *s, unsigned index) { |
||||||
|
return (index < s->nports) ? s->ports[index].fd : -1; |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_udp_server_start(grpc_udp_server *s, grpc_pollset **pollsets, |
||||||
|
size_t pollset_count, |
||||||
|
grpc_udp_server_cb new_transport_cb, void *cb_arg) { |
||||||
|
size_t i, j; |
||||||
|
GPR_ASSERT(new_transport_cb); |
||||||
|
gpr_mu_lock(&s->mu); |
||||||
|
GPR_ASSERT(!s->cb); |
||||||
|
GPR_ASSERT(s->active_ports == 0); |
||||||
|
s->cb = new_transport_cb; |
||||||
|
s->cb_arg = cb_arg; |
||||||
|
s->pollsets = pollsets; |
||||||
|
for (i = 0; i < s->nports; i++) { |
||||||
|
for (j = 0; j < pollset_count; j++) { |
||||||
|
grpc_pollset_add_fd(pollsets[j], s->ports[i].emfd); |
||||||
|
} |
||||||
|
s->ports[i].read_closure.cb = on_read; |
||||||
|
s->ports[i].read_closure.cb_arg = &s->ports[i]; |
||||||
|
grpc_fd_notify_on_read(s->ports[i].emfd, &s->ports[i].read_closure); |
||||||
|
s->active_ports++; |
||||||
|
} |
||||||
|
gpr_mu_unlock(&s->mu); |
||||||
|
} |
||||||
|
|
||||||
|
/* TODO(rjshade): Add a test for this method. */ |
||||||
|
void grpc_udp_server_write(server_port *sp, const char *buffer, size_t buf_len, |
||||||
|
const struct sockaddr *peer_address) { |
||||||
|
int rc; |
||||||
|
rc = sendto(sp->fd, buffer, buf_len, 0, peer_address, sizeof(peer_address)); |
||||||
|
if (rc < 0) { |
||||||
|
gpr_log(GPR_ERROR, "Unable to send data: %s", strerror(errno)); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
#endif |
||||||
@ -0,0 +1,85 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* 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_INTERNAL_CORE_IOMGR_UDP_SERVER_H |
||||||
|
#define GRPC_INTERNAL_CORE_IOMGR_UDP_SERVER_H |
||||||
|
|
||||||
|
#include "src/core/iomgr/endpoint.h" |
||||||
|
|
||||||
|
/* Forward decl of grpc_udp_server */ |
||||||
|
typedef struct grpc_udp_server grpc_udp_server; |
||||||
|
|
||||||
|
/* New server callback: ep is the newly connected connection */ |
||||||
|
typedef void (*grpc_udp_server_cb)(void *arg, grpc_endpoint *ep); |
||||||
|
|
||||||
|
/* Called when data is available to read from the socket. */ |
||||||
|
typedef void (*grpc_udp_server_read_cb)(int fd, |
||||||
|
grpc_udp_server_cb new_transport_cb, |
||||||
|
void *cb_arg); |
||||||
|
|
||||||
|
/* Create a server, initially not bound to any ports */ |
||||||
|
grpc_udp_server *grpc_udp_server_create(void); |
||||||
|
|
||||||
|
/* Start listening to bound ports */ |
||||||
|
void grpc_udp_server_start(grpc_udp_server *server, grpc_pollset **pollsets, |
||||||
|
size_t pollset_count, grpc_udp_server_cb cb, |
||||||
|
void *cb_arg); |
||||||
|
|
||||||
|
int grpc_udp_server_get_fd(grpc_udp_server *s, unsigned index); |
||||||
|
|
||||||
|
/* Add a port to the server, returning port number on success, or negative
|
||||||
|
on failure. |
||||||
|
|
||||||
|
The :: and 0.0.0.0 wildcard addresses are treated identically, accepting |
||||||
|
both IPv4 and IPv6 connections, but :: is the preferred style. This usually |
||||||
|
creates one socket, but possibly two on systems which support IPv6, |
||||||
|
but not dualstack sockets. */ |
||||||
|
|
||||||
|
/* TODO(ctiller): deprecate this, and make grpc_udp_server_add_ports to handle
|
||||||
|
all of the multiple socket port matching logic in one place */ |
||||||
|
int grpc_udp_server_add_port(grpc_udp_server *s, const void *addr, int addr_len, |
||||||
|
grpc_udp_server_read_cb read_cb); |
||||||
|
|
||||||
|
void grpc_udp_server_destroy(grpc_udp_server *server, |
||||||
|
void (*shutdown_done)(void *shutdown_done_arg), |
||||||
|
void *shutdown_done_arg); |
||||||
|
|
||||||
|
/* Write the contents of buffer to the underlying UDP socket. */ |
||||||
|
/*
|
||||||
|
void grpc_udp_server_write(grpc_udp_server *s, |
||||||
|
const char *buffer, |
||||||
|
int buf_len, |
||||||
|
const struct sockaddr* to); |
||||||
|
*/ |
||||||
|
|
||||||
|
#endif /* GRPC_INTERNAL_CORE_IOMGR_UDP_SERVER_H */ |
||||||
@ -1,157 +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. |
|
||||||
* |
|
||||||
*/ |
|
||||||
|
|
||||||
/* Implementation for gpr_cancellable */ |
|
||||||
|
|
||||||
#include <grpc/support/atm.h> |
|
||||||
#include <grpc/support/sync.h> |
|
||||||
#include <grpc/support/time.h> |
|
||||||
|
|
||||||
void gpr_cancellable_init(gpr_cancellable *c) { |
|
||||||
gpr_mu_init(&c->mu); |
|
||||||
c->cancelled = 0; |
|
||||||
c->waiters.next = &c->waiters; |
|
||||||
c->waiters.prev = &c->waiters; |
|
||||||
c->waiters.mu = NULL; |
|
||||||
c->waiters.cv = NULL; |
|
||||||
} |
|
||||||
|
|
||||||
void gpr_cancellable_destroy(gpr_cancellable *c) { gpr_mu_destroy(&c->mu); } |
|
||||||
|
|
||||||
int gpr_cancellable_is_cancelled(gpr_cancellable *c) { |
|
||||||
return gpr_atm_acq_load(&c->cancelled) != 0; |
|
||||||
} |
|
||||||
|
|
||||||
/* Threads in gpr_cv_cancellable_wait(cv, mu, ..., c) place themselves on a
|
|
||||||
linked list c->waiters of gpr_cancellable_list_ before waiting on their |
|
||||||
condition variables. They check for cancellation while holding *mu. Thus, |
|
||||||
to wake a thread from gpr_cv_cancellable_wait(), it suffices to: |
|
||||||
- set c->cancelled |
|
||||||
- acquire and release *mu |
|
||||||
- gpr_cv_broadcast(cv) |
|
||||||
|
|
||||||
However, gpr_cancellable_cancel() may not use gpr_mu_lock(mu), since the |
|
||||||
caller may already hold *mu---a possible deadlock. (If we knew the caller |
|
||||||
did not hold *mu, care would still be needed, because c->mu follows *mu in |
|
||||||
the locking order, so *mu could not be acquired while holding c->mu---which |
|
||||||
is needed to iterate over c->waiters.) |
|
||||||
|
|
||||||
Therefore, gpr_cancellable_cancel() uses gpr_mu_trylock() rather than |
|
||||||
gpr_mu_lock(), and retries until either gpr_mu_trylock() succeeds or the |
|
||||||
thread leaves gpr_cv_cancellable_wait() for other reasons. In the first |
|
||||||
case, gpr_cancellable_cancel() removes the entry from the waiters list; in |
|
||||||
the second, the waiting thread removes itself from the list. |
|
||||||
|
|
||||||
A one-entry cache of mutexes and condition variables processed is kept to |
|
||||||
avoid doing the same work again and again if many threads are blocked in the |
|
||||||
same place. However, it's important to broadcast on a condition variable if |
|
||||||
the corresponding mutex has been locked successfully, even if the condition |
|
||||||
variable has been signalled before. */ |
|
||||||
|
|
||||||
void gpr_cancellable_cancel(gpr_cancellable *c) { |
|
||||||
if (!gpr_cancellable_is_cancelled(c)) { |
|
||||||
int failures; |
|
||||||
int backoff = 1; |
|
||||||
do { |
|
||||||
struct gpr_cancellable_list_ *l; |
|
||||||
struct gpr_cancellable_list_ *nl; |
|
||||||
gpr_mu *omu = 0; /* one-element cache of a processed gpr_mu */ |
|
||||||
gpr_cv *ocv = 0; /* one-element cache of a processd gpr_cv */ |
|
||||||
gpr_mu_lock(&c->mu); |
|
||||||
gpr_atm_rel_store(&c->cancelled, 1); |
|
||||||
failures = 0; |
|
||||||
for (l = c->waiters.next; l != &c->waiters; l = nl) { |
|
||||||
nl = l->next; |
|
||||||
if (omu != l->mu) { |
|
||||||
omu = l->mu; |
|
||||||
if (gpr_mu_trylock(l->mu)) { |
|
||||||
gpr_mu_unlock(l->mu); |
|
||||||
l->next->prev = l->prev; /* remove *l from list */ |
|
||||||
l->prev->next = l->next; |
|
||||||
/* allow unconditional dequeue in gpr_cv_cancellable_wait() */ |
|
||||||
l->next = l; |
|
||||||
l->prev = l; |
|
||||||
ocv = 0; /* force broadcast */ |
|
||||||
} else { |
|
||||||
failures++; |
|
||||||
} |
|
||||||
} |
|
||||||
if (ocv != l->cv) { |
|
||||||
ocv = l->cv; |
|
||||||
gpr_cv_broadcast(l->cv); |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&c->mu); |
|
||||||
if (failures != 0) { |
|
||||||
if (backoff < 10) { |
|
||||||
volatile int i; |
|
||||||
for (i = 0; i != (1 << backoff); i++) { |
|
||||||
} |
|
||||||
backoff++; |
|
||||||
} else { |
|
||||||
gpr_event ev; |
|
||||||
gpr_event_init(&ev); |
|
||||||
gpr_event_wait( |
|
||||||
&ev, gpr_time_add(gpr_now(GPR_CLOCK_REALTIME), |
|
||||||
gpr_time_from_micros(1000, GPR_TIMESPAN))); |
|
||||||
} |
|
||||||
} |
|
||||||
} while (failures != 0); |
|
||||||
} |
|
||||||
} |
|
||||||
|
|
||||||
int gpr_cv_cancellable_wait(gpr_cv *cv, gpr_mu *mu, gpr_timespec abs_deadline, |
|
||||||
gpr_cancellable *c) { |
|
||||||
gpr_int32 timeout; |
|
||||||
gpr_mu_lock(&c->mu); |
|
||||||
timeout = gpr_cancellable_is_cancelled(c); |
|
||||||
if (!timeout) { |
|
||||||
struct gpr_cancellable_list_ le; |
|
||||||
le.mu = mu; |
|
||||||
le.cv = cv; |
|
||||||
le.next = c->waiters.next; |
|
||||||
le.prev = &c->waiters; |
|
||||||
le.next->prev = ≤ |
|
||||||
le.prev->next = ≤ |
|
||||||
gpr_mu_unlock(&c->mu); |
|
||||||
timeout = gpr_cv_wait(cv, mu, abs_deadline); |
|
||||||
gpr_mu_lock(&c->mu); |
|
||||||
le.next->prev = le.prev; |
|
||||||
le.prev->next = le.next; |
|
||||||
if (!timeout) { |
|
||||||
timeout = gpr_cancellable_is_cancelled(c); |
|
||||||
} |
|
||||||
} |
|
||||||
gpr_mu_unlock(&c->mu); |
|
||||||
return timeout; |
|
||||||
} |
|
||||||
@ -0,0 +1,2 @@ |
|||||||
|
<%namespace file="../vcxproj_defs.include" import="gen_project"/>\ |
||||||
|
${gen_project('grpc_test_util_unsecure', libs)} |
||||||
@ -0,0 +1,43 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* 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. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
/* This is just a compilation test, to see if we have Zookeeper C client
|
||||||
|
library installed. */ |
||||||
|
|
||||||
|
#include <stdlib.h> |
||||||
|
#include <zookeeper/zookeeper.h> |
||||||
|
|
||||||
|
int main() { |
||||||
|
zookeeper_init(NULL, NULL, 0, 0, 0, 0); |
||||||
|
return 0; |
||||||
|
} |
||||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in new issue