Vijay Pai
10 years ago
commit
f0c66c6365
121 changed files with 1808 additions and 716 deletions
@ -0,0 +1,38 @@ |
||||
/*
|
||||
* |
||||
* 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/census.h> |
||||
#include "src/core/census/rpc_stat_id.h" |
||||
|
||||
void census_record_stat(census_context *context, census_stat *stats, |
||||
size_t nstats) {} |
||||
@ -0,0 +1,46 @@ |
||||
/*
|
||||
* |
||||
* 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 CENSUS_RPC_STAT_ID_H |
||||
#define CENSUS_RPC_STAT_ID_H |
||||
|
||||
/* Stats ID's used for RPC measurements. */ |
||||
#define CENSUS_INVALID_STAT_ID 0 /* ID 0 is always invalid */ |
||||
#define CENSUS_RPC_CLIENT_REQUESTS 1 /* Count of client requests sent. */ |
||||
#define CENSUS_RPC_SERVER_REQUESTS 2 /* Count of server requests sent. */ |
||||
#define CENSUS_RPC_CLIENT_ERRORS 3 /* Client error counts. */ |
||||
#define CENSUS_RPC_SERVER_ERRORS 4 /* Server error counts. */ |
||||
#define CENSUS_RPC_CLIENT_LATENCY 5 /* Client side request latency. */ |
||||
#define CENSUS_RPC_SERVER_LATENCY 6 /* Server side request latency. */ |
||||
|
||||
#endif /* CENSUS_RPC_STAT_ID_H */ |
||||
@ -0,0 +1,299 @@ |
||||
/*
|
||||
* |
||||
* 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> |
||||
|
||||
#include "src/core/client_config/resolvers/sockaddr_resolver.h" |
||||
|
||||
#include <stdio.h> |
||||
#include <string.h> |
||||
#ifdef GPR_POSIX_SOCKET |
||||
#include <sys/un.h> |
||||
#endif |
||||
|
||||
#include <grpc/support/alloc.h> |
||||
#include <grpc/support/host_port.h> |
||||
#include <grpc/support/string_util.h> |
||||
|
||||
#include "src/core/client_config/lb_policies/pick_first.h" |
||||
#include "src/core/iomgr/resolve_address.h" |
||||
#include "src/core/support/string.h" |
||||
|
||||
typedef struct { |
||||
/** base class: must be first */ |
||||
grpc_resolver base; |
||||
/** refcount */ |
||||
gpr_refcount refs; |
||||
/** subchannel factory */ |
||||
grpc_subchannel_factory *subchannel_factory; |
||||
/** load balancing policy factory */ |
||||
grpc_lb_policy *(*lb_policy_factory)(grpc_subchannel **subchannels, |
||||
size_t num_subchannels); |
||||
|
||||
/** the address that we've 'resolved' */ |
||||
struct sockaddr_storage addr; |
||||
int addr_len; |
||||
|
||||
/** mutex guarding the rest of the state */ |
||||
gpr_mu mu; |
||||
/** have we published? */ |
||||
int published; |
||||
/** pending next completion, or NULL */ |
||||
grpc_iomgr_closure *next_completion; |
||||
/** target config address for next completion */ |
||||
grpc_client_config **target_config; |
||||
} sockaddr_resolver; |
||||
|
||||
static void sockaddr_destroy(grpc_resolver *r); |
||||
|
||||
static void sockaddr_maybe_finish_next_locked(sockaddr_resolver *r); |
||||
|
||||
static void sockaddr_shutdown(grpc_resolver *r); |
||||
static void sockaddr_channel_saw_error(grpc_resolver *r, |
||||
struct sockaddr *failing_address, |
||||
int failing_address_len); |
||||
static void sockaddr_next(grpc_resolver *r, grpc_client_config **target_config, |
||||
grpc_iomgr_closure *on_complete); |
||||
|
||||
static const grpc_resolver_vtable sockaddr_resolver_vtable = { |
||||
sockaddr_destroy, sockaddr_shutdown, sockaddr_channel_saw_error, |
||||
sockaddr_next}; |
||||
|
||||
static void sockaddr_shutdown(grpc_resolver *resolver) { |
||||
sockaddr_resolver *r = (sockaddr_resolver *)resolver; |
||||
gpr_mu_lock(&r->mu); |
||||
if (r->next_completion != NULL) { |
||||
*r->target_config = NULL; |
||||
/* TODO(ctiller): add delayed callback */ |
||||
grpc_iomgr_add_callback(r->next_completion); |
||||
r->next_completion = NULL; |
||||
} |
||||
gpr_mu_unlock(&r->mu); |
||||
} |
||||
|
||||
static void sockaddr_channel_saw_error(grpc_resolver *resolver, |
||||
struct sockaddr *sa, int len) {} |
||||
|
||||
static void sockaddr_next(grpc_resolver *resolver, |
||||
grpc_client_config **target_config, |
||||
grpc_iomgr_closure *on_complete) { |
||||
sockaddr_resolver *r = (sockaddr_resolver *)resolver; |
||||
gpr_mu_lock(&r->mu); |
||||
GPR_ASSERT(!r->next_completion); |
||||
r->next_completion = on_complete; |
||||
r->target_config = target_config; |
||||
sockaddr_maybe_finish_next_locked(r); |
||||
gpr_mu_unlock(&r->mu); |
||||
} |
||||
|
||||
static void sockaddr_maybe_finish_next_locked(sockaddr_resolver *r) { |
||||
grpc_client_config *cfg; |
||||
grpc_lb_policy *lb_policy; |
||||
grpc_subchannel *subchannel; |
||||
grpc_subchannel_args args; |
||||
|
||||
if (r->next_completion != NULL && !r->published) { |
||||
cfg = grpc_client_config_create(); |
||||
memset(&args, 0, sizeof(args)); |
||||
args.addr = (struct sockaddr *)&r->addr; |
||||
args.addr_len = r->addr_len; |
||||
subchannel = |
||||
grpc_subchannel_factory_create_subchannel(r->subchannel_factory, &args); |
||||
lb_policy = r->lb_policy_factory(&subchannel, 1); |
||||
grpc_client_config_set_lb_policy(cfg, lb_policy); |
||||
GRPC_LB_POLICY_UNREF(lb_policy, "unix"); |
||||
r->published = 1; |
||||
*r->target_config = cfg; |
||||
grpc_iomgr_add_callback(r->next_completion); |
||||
r->next_completion = NULL; |
||||
} |
||||
} |
||||
|
||||
static void sockaddr_destroy(grpc_resolver *gr) { |
||||
sockaddr_resolver *r = (sockaddr_resolver *)gr; |
||||
gpr_mu_destroy(&r->mu); |
||||
grpc_subchannel_factory_unref(r->subchannel_factory); |
||||
gpr_free(r); |
||||
} |
||||
|
||||
#ifdef GPR_POSIX_SOCKET |
||||
static int parse_unix(grpc_uri *uri, struct sockaddr_storage *addr, int *len) { |
||||
struct sockaddr_un *un = (struct sockaddr_un *)addr; |
||||
|
||||
un->sun_family = AF_UNIX; |
||||
strcpy(un->sun_path, uri->path); |
||||
*len = strlen(un->sun_path) + sizeof(un->sun_family) + 1; |
||||
|
||||
return 1; |
||||
} |
||||
#endif |
||||
|
||||
static int parse_ipv4(grpc_uri *uri, struct sockaddr_storage *addr, int *len) { |
||||
const char *host_port = uri->path; |
||||
char *host; |
||||
char *port; |
||||
int port_num; |
||||
int result = 0; |
||||
struct sockaddr_in *in = (struct sockaddr_in *)addr; |
||||
|
||||
if (*host_port == '/') ++host_port; |
||||
if (!gpr_split_host_port(host_port, &host, &port)) { |
||||
return 0; |
||||
} |
||||
|
||||
memset(in, 0, sizeof(*in)); |
||||
*len = sizeof(*in); |
||||
in->sin_family = AF_INET; |
||||
if (inet_pton(AF_INET, host, &in->sin_addr) == 0) { |
||||
gpr_log(GPR_ERROR, "invalid ipv4 address: '%s'", host); |
||||
goto done; |
||||
} |
||||
|
||||
if (port != NULL) { |
||||
if (sscanf(port, "%d", &port_num) != 1 || port_num < 0 || |
||||
port_num > 65535) { |
||||
gpr_log(GPR_ERROR, "invalid ipv4 port: '%s'", port); |
||||
goto done; |
||||
} |
||||
in->sin_port = htons(port_num); |
||||
} else { |
||||
gpr_log(GPR_ERROR, "no port given for ipv4 scheme"); |
||||
goto done; |
||||
} |
||||
|
||||
result = 1; |
||||
done: |
||||
gpr_free(host); |
||||
gpr_free(port); |
||||
return result; |
||||
} |
||||
|
||||
static int parse_ipv6(grpc_uri *uri, struct sockaddr_storage *addr, int *len) { |
||||
const char *host_port = uri->path; |
||||
char *host; |
||||
char *port; |
||||
int port_num; |
||||
int result = 0; |
||||
struct sockaddr_in6 *in6 = (struct sockaddr_in6 *)addr; |
||||
|
||||
if (*host_port == '/') ++host_port; |
||||
if (!gpr_split_host_port(host_port, &host, &port)) { |
||||
return 0; |
||||
} |
||||
|
||||
memset(in6, 0, sizeof(*in6)); |
||||
*len = sizeof(*in6); |
||||
in6->sin6_family = AF_INET6; |
||||
if (inet_pton(AF_INET6, host, &in6->sin6_addr) == 0) { |
||||
gpr_log(GPR_ERROR, "invalid ipv6 address: '%s'", host); |
||||
goto done; |
||||
} |
||||
|
||||
if (port != NULL) { |
||||
if (sscanf(port, "%d", &port_num) != 1 || port_num < 0 || |
||||
port_num > 65535) { |
||||
gpr_log(GPR_ERROR, "invalid ipv6 port: '%s'", port); |
||||
goto done; |
||||
} |
||||
in6->sin6_port = htons(port_num); |
||||
} else { |
||||
gpr_log(GPR_ERROR, "no port given for ipv6 scheme"); |
||||
goto done; |
||||
} |
||||
|
||||
result = 1; |
||||
done: |
||||
gpr_free(host); |
||||
gpr_free(port); |
||||
return result; |
||||
} |
||||
|
||||
static grpc_resolver *sockaddr_create( |
||||
grpc_uri *uri, |
||||
grpc_lb_policy *(*lb_policy_factory)(grpc_subchannel **subchannels, |
||||
size_t num_subchannels), |
||||
grpc_subchannel_factory *subchannel_factory, |
||||
int parse(grpc_uri *uri, struct sockaddr_storage *dst, int *len)) { |
||||
sockaddr_resolver *r; |
||||
|
||||
if (0 != strcmp(uri->authority, "")) { |
||||
gpr_log(GPR_ERROR, "authority based uri's not supported"); |
||||
return NULL; |
||||
} |
||||
|
||||
r = gpr_malloc(sizeof(sockaddr_resolver)); |
||||
memset(r, 0, sizeof(*r)); |
||||
if (!parse(uri, &r->addr, &r->addr_len)) { |
||||
gpr_free(r); |
||||
return NULL; |
||||
} |
||||
|
||||
gpr_ref_init(&r->refs, 1); |
||||
gpr_mu_init(&r->mu); |
||||
grpc_resolver_init(&r->base, &sockaddr_resolver_vtable); |
||||
r->subchannel_factory = subchannel_factory; |
||||
r->lb_policy_factory = lb_policy_factory; |
||||
|
||||
grpc_subchannel_factory_ref(subchannel_factory); |
||||
return &r->base; |
||||
} |
||||
|
||||
/*
|
||||
* FACTORY |
||||
*/ |
||||
|
||||
static void sockaddr_factory_ref(grpc_resolver_factory *factory) {} |
||||
|
||||
static void sockaddr_factory_unref(grpc_resolver_factory *factory) {} |
||||
|
||||
#define DECL_FACTORY(name) \ |
||||
static grpc_resolver *name##_factory_create_resolver( \
|
||||
grpc_resolver_factory *factory, grpc_uri *uri, \
|
||||
grpc_subchannel_factory *subchannel_factory) { \
|
||||
return sockaddr_create(uri, grpc_create_pick_first_lb_policy, \
|
||||
subchannel_factory, parse_##name); \
|
||||
} \
|
||||
static const grpc_resolver_factory_vtable name##_factory_vtable = { \
|
||||
sockaddr_factory_ref, sockaddr_factory_unref, \
|
||||
name##_factory_create_resolver}; \
|
||||
static grpc_resolver_factory name##_resolver_factory = { \
|
||||
&name##_factory_vtable}; \
|
||||
grpc_resolver_factory *grpc_##name##_resolver_factory_create() { \
|
||||
return &name##_resolver_factory; \
|
||||
} |
||||
|
||||
#ifdef GPR_POSIX_SOCKET |
||||
DECL_FACTORY(unix) |
||||
#endif |
||||
DECL_FACTORY(ipv4) |
||||
DECL_FACTORY(ipv6) |
||||
@ -1,195 +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/client_config/resolvers/unix_resolver_posix.h" |
||||
|
||||
#include <string.h> |
||||
#include <sys/un.h> |
||||
|
||||
#include <grpc/support/alloc.h> |
||||
#include <grpc/support/string_util.h> |
||||
|
||||
#include "src/core/client_config/lb_policies/pick_first.h" |
||||
#include "src/core/iomgr/resolve_address.h" |
||||
#include "src/core/support/string.h" |
||||
|
||||
typedef struct { |
||||
/** base class: must be first */ |
||||
grpc_resolver base; |
||||
/** refcount */ |
||||
gpr_refcount refs; |
||||
/** subchannel factory */ |
||||
grpc_subchannel_factory *subchannel_factory; |
||||
/** load balancing policy factory */ |
||||
grpc_lb_policy *(*lb_policy_factory)(grpc_subchannel **subchannels, |
||||
size_t num_subchannels); |
||||
|
||||
/** the address that we've 'resolved' */ |
||||
struct sockaddr_un addr; |
||||
int addr_len; |
||||
|
||||
/** mutex guarding the rest of the state */ |
||||
gpr_mu mu; |
||||
/** have we published? */ |
||||
int published; |
||||
/** pending next completion, or NULL */ |
||||
grpc_iomgr_closure *next_completion; |
||||
/** target config address for next completion */ |
||||
grpc_client_config **target_config; |
||||
} unix_resolver; |
||||
|
||||
static void unix_destroy(grpc_resolver *r); |
||||
|
||||
static void unix_maybe_finish_next_locked(unix_resolver *r); |
||||
|
||||
static void unix_shutdown(grpc_resolver *r); |
||||
static void unix_channel_saw_error(grpc_resolver *r, |
||||
struct sockaddr *failing_address, |
||||
int failing_address_len); |
||||
static void unix_next(grpc_resolver *r, grpc_client_config **target_config, |
||||
grpc_iomgr_closure *on_complete); |
||||
|
||||
static const grpc_resolver_vtable unix_resolver_vtable = { |
||||
unix_destroy, unix_shutdown, unix_channel_saw_error, unix_next}; |
||||
|
||||
static void unix_shutdown(grpc_resolver *resolver) { |
||||
unix_resolver *r = (unix_resolver *)resolver; |
||||
gpr_mu_lock(&r->mu); |
||||
if (r->next_completion != NULL) { |
||||
*r->target_config = NULL; |
||||
/* TODO(ctiller): add delayed callback */ |
||||
grpc_iomgr_add_callback(r->next_completion); |
||||
r->next_completion = NULL; |
||||
} |
||||
gpr_mu_unlock(&r->mu); |
||||
} |
||||
|
||||
static void unix_channel_saw_error(grpc_resolver *resolver, struct sockaddr *sa, |
||||
int len) {} |
||||
|
||||
static void unix_next(grpc_resolver *resolver, |
||||
grpc_client_config **target_config, |
||||
grpc_iomgr_closure *on_complete) { |
||||
unix_resolver *r = (unix_resolver *)resolver; |
||||
gpr_mu_lock(&r->mu); |
||||
GPR_ASSERT(!r->next_completion); |
||||
r->next_completion = on_complete; |
||||
r->target_config = target_config; |
||||
unix_maybe_finish_next_locked(r); |
||||
gpr_mu_unlock(&r->mu); |
||||
} |
||||
|
||||
static void unix_maybe_finish_next_locked(unix_resolver *r) { |
||||
grpc_client_config *cfg; |
||||
grpc_lb_policy *lb_policy; |
||||
grpc_subchannel *subchannel; |
||||
grpc_subchannel_args args; |
||||
|
||||
if (r->next_completion != NULL && !r->published) { |
||||
cfg = grpc_client_config_create(); |
||||
memset(&args, 0, sizeof(args)); |
||||
args.addr = (struct sockaddr *)&r->addr; |
||||
args.addr_len = r->addr_len; |
||||
subchannel = |
||||
grpc_subchannel_factory_create_subchannel(r->subchannel_factory, &args); |
||||
lb_policy = r->lb_policy_factory(&subchannel, 1); |
||||
grpc_client_config_set_lb_policy(cfg, lb_policy); |
||||
GRPC_LB_POLICY_UNREF(lb_policy, "unix"); |
||||
r->published = 1; |
||||
*r->target_config = cfg; |
||||
grpc_iomgr_add_callback(r->next_completion); |
||||
r->next_completion = NULL; |
||||
} |
||||
} |
||||
|
||||
static void unix_destroy(grpc_resolver *gr) { |
||||
unix_resolver *r = (unix_resolver *)gr; |
||||
gpr_mu_destroy(&r->mu); |
||||
grpc_subchannel_factory_unref(r->subchannel_factory); |
||||
gpr_free(r); |
||||
} |
||||
|
||||
static grpc_resolver *unix_create( |
||||
grpc_uri *uri, |
||||
grpc_lb_policy *(*lb_policy_factory)(grpc_subchannel **subchannels, |
||||
size_t num_subchannels), |
||||
grpc_subchannel_factory *subchannel_factory) { |
||||
unix_resolver *r; |
||||
|
||||
if (0 != strcmp(uri->authority, "")) { |
||||
gpr_log(GPR_ERROR, "authority based uri's not supported"); |
||||
return NULL; |
||||
} |
||||
|
||||
r = gpr_malloc(sizeof(unix_resolver)); |
||||
memset(r, 0, sizeof(*r)); |
||||
gpr_ref_init(&r->refs, 1); |
||||
gpr_mu_init(&r->mu); |
||||
grpc_resolver_init(&r->base, &unix_resolver_vtable); |
||||
r->subchannel_factory = subchannel_factory; |
||||
r->lb_policy_factory = lb_policy_factory; |
||||
|
||||
r->addr.sun_family = AF_UNIX; |
||||
strcpy(r->addr.sun_path, uri->path); |
||||
r->addr_len = strlen(r->addr.sun_path) + sizeof(r->addr.sun_family) + 1; |
||||
|
||||
grpc_subchannel_factory_ref(subchannel_factory); |
||||
return &r->base; |
||||
} |
||||
|
||||
/*
|
||||
* FACTORY |
||||
*/ |
||||
|
||||
static void unix_factory_ref(grpc_resolver_factory *factory) {} |
||||
|
||||
static void unix_factory_unref(grpc_resolver_factory *factory) {} |
||||
|
||||
static grpc_resolver *unix_factory_create_resolver( |
||||
grpc_resolver_factory *factory, grpc_uri *uri, |
||||
grpc_subchannel_factory *subchannel_factory) { |
||||
return unix_create(uri, grpc_create_pick_first_lb_policy, subchannel_factory); |
||||
} |
||||
|
||||
static const grpc_resolver_factory_vtable unix_factory_vtable = { |
||||
unix_factory_ref, unix_factory_unref, unix_factory_create_resolver}; |
||||
static grpc_resolver_factory unix_resolver_factory = {&unix_factory_vtable}; |
||||
|
||||
grpc_resolver_factory *grpc_unix_resolver_factory_create() { |
||||
return &unix_resolver_factory; |
||||
} |
||||
|
||||
#endif |
||||
@ -0,0 +1,202 @@ |
||||
#region Copyright notice and license |
||||
|
||||
// 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. |
||||
|
||||
#endregion |
||||
|
||||
using System; |
||||
using System.Runtime.InteropServices; |
||||
using Grpc.Core.Internal; |
||||
using NUnit.Framework; |
||||
|
||||
namespace Grpc.Core.Internal.Tests |
||||
{ |
||||
public class TimespecTest |
||||
{ |
||||
[Test] |
||||
public void Now_IsInUtc() |
||||
{ |
||||
Assert.AreEqual(DateTimeKind.Utc, Timespec.Now.ToDateTime().Kind); |
||||
} |
||||
|
||||
[Test] |
||||
public void Now_AgreesWithUtcNow() |
||||
{ |
||||
var timespec = Timespec.Now; |
||||
var utcNow = DateTime.UtcNow; |
||||
|
||||
TimeSpan difference = utcNow - timespec.ToDateTime(); |
||||
|
||||
// This test is inherently a race - but the two timestamps |
||||
// should really be way less that a minute apart. |
||||
Assert.IsTrue(difference.TotalSeconds < 60); |
||||
} |
||||
|
||||
[Test] |
||||
public void InfFuture() |
||||
{ |
||||
var timespec = Timespec.InfFuture; |
||||
} |
||||
|
||||
[Test] |
||||
public void InfPast() |
||||
{ |
||||
var timespec = Timespec.InfPast; |
||||
} |
||||
|
||||
[Test] |
||||
public void TimespecSizeIsNativeSize() |
||||
{ |
||||
Assert.AreEqual(Timespec.NativeSize, Marshal.SizeOf(typeof(Timespec))); |
||||
} |
||||
|
||||
[Test] |
||||
public void ToDateTime() |
||||
{ |
||||
Assert.AreEqual(new DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Utc), |
||||
new Timespec(IntPtr.Zero, 0).ToDateTime()); |
||||
|
||||
Assert.AreEqual(new DateTime(1970, 1, 1, 0, 0, 10, DateTimeKind.Utc).AddTicks(50), |
||||
new Timespec(new IntPtr(10), 5000).ToDateTime()); |
||||
|
||||
Assert.AreEqual(new DateTime(2015, 7, 21, 4, 21, 48, DateTimeKind.Utc), |
||||
new Timespec(new IntPtr(1437452508), 0).ToDateTime()); |
||||
|
||||
// before epoch |
||||
Assert.AreEqual(new DateTime(1969, 12, 31, 23, 59, 55, DateTimeKind.Utc).AddTicks(10), |
||||
new Timespec(new IntPtr(-5), 1000).ToDateTime()); |
||||
|
||||
// infinity |
||||
Assert.AreEqual(DateTime.MaxValue, Timespec.InfFuture.ToDateTime()); |
||||
Assert.AreEqual(DateTime.MinValue, Timespec.InfPast.ToDateTime()); |
||||
|
||||
// nanos are rounded to ticks are rounded up |
||||
Assert.AreEqual(new DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Utc).AddTicks(1), |
||||
new Timespec(IntPtr.Zero, 99).ToDateTime()); |
||||
|
||||
// Illegal inputs |
||||
Assert.Throws(typeof(InvalidOperationException), |
||||
() => new Timespec(new IntPtr(0), -2).ToDateTime()); |
||||
Assert.Throws(typeof(InvalidOperationException), |
||||
() => new Timespec(new IntPtr(0), 1000 * 1000 * 1000).ToDateTime()); |
||||
Assert.Throws(typeof(InvalidOperationException), |
||||
() => new Timespec(new IntPtr(0), 0, GPRClockType.Monotonic).ToDateTime()); |
||||
} |
||||
|
||||
[Test] |
||||
public void ToDateTime_ReturnsUtc() |
||||
{ |
||||
Assert.AreEqual(DateTimeKind.Utc, new Timespec(new IntPtr(1437452508), 0).ToDateTime().Kind); |
||||
Assert.AreNotEqual(DateTimeKind.Unspecified, new Timespec(new IntPtr(1437452508), 0).ToDateTime().Kind); |
||||
} |
||||
|
||||
[Test] |
||||
public void ToDateTime_Overflow() |
||||
{ |
||||
// we can only get overflow in ticks arithmetic on 64-bit |
||||
if (IntPtr.Size == 8) |
||||
{ |
||||
var timespec = new Timespec(new IntPtr(long.MaxValue - 100), 0); |
||||
Assert.AreNotEqual(Timespec.InfFuture, timespec); |
||||
Assert.AreEqual(DateTime.MaxValue, timespec.ToDateTime()); |
||||
|
||||
Assert.AreEqual(DateTime.MinValue, new Timespec(new IntPtr(long.MinValue + 100), 0).ToDateTime()); |
||||
} |
||||
else |
||||
{ |
||||
Console.WriteLine("Test cannot be run on this platform, skipping the test."); |
||||
} |
||||
} |
||||
|
||||
[Test] |
||||
public void ToDateTime_OutOfDateTimeRange() |
||||
{ |
||||
// we can only get out of range on 64-bit, on 32 bit the max |
||||
// timestamp is ~ Jan 19 2038, which is far within range of DateTime |
||||
// same case for min value. |
||||
if (IntPtr.Size == 8) |
||||
{ |
||||
// DateTime range goes up to year 9999, 20000 years from now should |
||||
// be out of range. |
||||
long seconds = 20000L * 365L * 24L * 3600L; |
||||
|
||||
var timespec = new Timespec(new IntPtr(seconds), 0); |
||||
Assert.AreNotEqual(Timespec.InfFuture, timespec); |
||||
Assert.AreEqual(DateTime.MaxValue, timespec.ToDateTime()); |
||||
|
||||
Assert.AreEqual(DateTime.MinValue, new Timespec(new IntPtr(-seconds), 0).ToDateTime()); |
||||
} |
||||
else |
||||
{ |
||||
Console.WriteLine("Test cannot be run on this platform, skipping the test"); |
||||
} |
||||
} |
||||
|
||||
[Test] |
||||
public void FromDateTime() |
||||
{ |
||||
Assert.AreEqual(new Timespec(IntPtr.Zero, 0), |
||||
Timespec.FromDateTime(new DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Utc))); |
||||
|
||||
Assert.AreEqual(new Timespec(new IntPtr(10), 5000), |
||||
Timespec.FromDateTime(new DateTime(1970, 1, 1, 0, 0, 10, DateTimeKind.Utc).AddTicks(50))); |
||||
|
||||
Assert.AreEqual(new Timespec(new IntPtr(1437452508), 0), |
||||
Timespec.FromDateTime(new DateTime(2015, 7, 21, 4, 21, 48, DateTimeKind.Utc))); |
||||
|
||||
// before epoch |
||||
Assert.AreEqual(new Timespec(new IntPtr(-5), 1000), |
||||
Timespec.FromDateTime(new DateTime(1969, 12, 31, 23, 59, 55, DateTimeKind.Utc).AddTicks(10))); |
||||
|
||||
// infinity |
||||
Assert.AreEqual(Timespec.InfFuture, Timespec.FromDateTime(DateTime.MaxValue)); |
||||
Assert.AreEqual(Timespec.InfPast, Timespec.FromDateTime(DateTime.MinValue)); |
||||
|
||||
// illegal inputs |
||||
Assert.Throws(typeof(ArgumentException), |
||||
() => Timespec.FromDateTime(new DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Unspecified))); |
||||
} |
||||
|
||||
[Test] |
||||
public void FromDateTime_OutOfTimespecRange() |
||||
{ |
||||
// we can only get overflow in Timespec on 32-bit |
||||
if (IntPtr.Size == 4) |
||||
{ |
||||
Assert.AreEqual(Timespec.InfFuture, Timespec.FromDateTime(new DateTime(2040, 1, 1, 0, 0, 0, DateTimeKind.Utc))); |
||||
Assert.AreEqual(Timespec.InfPast, Timespec.FromDateTime(new DateTime(1800, 1, 1, 0, 0, 0, DateTimeKind.Utc))); |
||||
} |
||||
else |
||||
{ |
||||
Console.WriteLine("Test cannot be run on this platform, skipping the test."); |
||||
} |
||||
} |
||||
} |
||||
} |
||||
@ -0,0 +1,207 @@ |
||||
#region Copyright notice and license |
||||
|
||||
// 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. |
||||
|
||||
#endregion |
||||
|
||||
using System; |
||||
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 |
||||
{ |
||||
/// <summary> |
||||
/// Tests for Deadline support. |
||||
/// </summary> |
||||
public class TimeoutsTest |
||||
{ |
||||
const string Host = "localhost"; |
||||
const string ServiceName = "/tests.Test"; |
||||
|
||||
static readonly Method<string, string> TestMethod = new Method<string, string>( |
||||
MethodType.Unary, |
||||
"/tests.Test/Test", |
||||
Marshallers.StringMarshaller, |
||||
Marshallers.StringMarshaller); |
||||
|
||||
static readonly ServerServiceDefinition ServiceDefinition = ServerServiceDefinition.CreateBuilder(ServiceName) |
||||
.AddMethod(TestMethod, TestMethodHandler) |
||||
.Build(); |
||||
|
||||
// provides a way how to retrieve an out-of-band result value from server handler |
||||
static TaskCompletionSource<string> stringFromServerHandlerTcs; |
||||
|
||||
Server server; |
||||
Channel channel; |
||||
|
||||
[SetUp] |
||||
public void Init() |
||||
{ |
||||
server = new Server(); |
||||
server.AddServiceDefinition(ServiceDefinition); |
||||
int port = server.AddListeningPort(Host, Server.PickUnusedPort); |
||||
server.Start(); |
||||
channel = new Channel(Host, port); |
||||
|
||||
stringFromServerHandlerTcs = new TaskCompletionSource<string>(); |
||||
} |
||||
|
||||
[TearDown] |
||||
public void Cleanup() |
||||
{ |
||||
channel.Dispose(); |
||||
server.ShutdownAsync().Wait(); |
||||
} |
||||
|
||||
[TestFixtureTearDown] |
||||
public void CleanupClass() |
||||
{ |
||||
GrpcEnvironment.Shutdown(); |
||||
} |
||||
|
||||
[Test] |
||||
public void InfiniteDeadline() |
||||
{ |
||||
// no deadline specified, check server sees infinite deadline |
||||
var internalCall = new Call<string, string>(ServiceName, TestMethod, channel, Metadata.Empty); |
||||
Assert.AreEqual("DATETIME_MAXVALUE", Calls.BlockingUnaryCall(internalCall, "RETURN_DEADLINE", CancellationToken.None)); |
||||
|
||||
// DateTime.MaxValue deadline specified, check server sees infinite deadline |
||||
var internalCall2 = new Call<string, string>(ServiceName, TestMethod, channel, Metadata.Empty, DateTime.MaxValue); |
||||
Assert.AreEqual("DATETIME_MAXVALUE", Calls.BlockingUnaryCall(internalCall2, "RETURN_DEADLINE", CancellationToken.None)); |
||||
} |
||||
|
||||
[Test] |
||||
public void DeadlineTransferredToServer() |
||||
{ |
||||
var remainingTimeClient = TimeSpan.FromDays(7); |
||||
var deadline = DateTime.UtcNow + remainingTimeClient; |
||||
Thread.Sleep(1000); |
||||
var internalCall = new Call<string, string>(ServiceName, TestMethod, channel, Metadata.Empty, deadline); |
||||
|
||||
var serverDeadlineTicksString = Calls.BlockingUnaryCall(internalCall, "RETURN_DEADLINE", CancellationToken.None); |
||||
var serverDeadline = new DateTime(long.Parse(serverDeadlineTicksString), DateTimeKind.Utc); |
||||
|
||||
// A fairly relaxed check that the deadline set by client and deadline seen by server |
||||
// are in agreement. C core takes care of the work with transferring deadline over the wire, |
||||
// so we don't need an exact check here. |
||||
Assert.IsTrue(Math.Abs((deadline - serverDeadline).TotalMilliseconds) < 5000); |
||||
} |
||||
|
||||
[Test] |
||||
public void DeadlineInThePast() |
||||
{ |
||||
var deadline = DateTime.MinValue; |
||||
var internalCall = new Call<string, string>(ServiceName, TestMethod, channel, Metadata.Empty, deadline); |
||||
|
||||
try |
||||
{ |
||||
Calls.BlockingUnaryCall(internalCall, "TIMEOUT", CancellationToken.None); |
||||
Assert.Fail(); |
||||
} |
||||
catch (RpcException e) |
||||
{ |
||||
Assert.AreEqual(StatusCode.DeadlineExceeded, e.Status.StatusCode); |
||||
} |
||||
} |
||||
|
||||
[Test] |
||||
public void DeadlineExceededStatusOnTimeout() |
||||
{ |
||||
var deadline = DateTime.UtcNow.Add(TimeSpan.FromSeconds(5)); |
||||
var internalCall = new Call<string, string>(ServiceName, TestMethod, channel, Metadata.Empty, deadline); |
||||
|
||||
try |
||||
{ |
||||
Calls.BlockingUnaryCall(internalCall, "TIMEOUT", CancellationToken.None); |
||||
Assert.Fail(); |
||||
} |
||||
catch (RpcException e) |
||||
{ |
||||
Assert.AreEqual(StatusCode.DeadlineExceeded, e.Status.StatusCode); |
||||
} |
||||
} |
||||
|
||||
[Test] |
||||
public void ServerReceivesCancellationOnTimeout() |
||||
{ |
||||
var deadline = DateTime.UtcNow.Add(TimeSpan.FromSeconds(5)); |
||||
var internalCall = new Call<string, string>(ServiceName, TestMethod, channel, Metadata.Empty, deadline); |
||||
|
||||
try |
||||
{ |
||||
Calls.BlockingUnaryCall(internalCall, "CHECK_CANCELLATION_RECEIVED", CancellationToken.None); |
||||
Assert.Fail(); |
||||
} |
||||
catch (RpcException e) |
||||
{ |
||||
Assert.AreEqual(StatusCode.DeadlineExceeded, e.Status.StatusCode); |
||||
} |
||||
Assert.AreEqual("CANCELLED", stringFromServerHandlerTcs.Task.Result); |
||||
} |
||||
|
||||
private static async Task<string> TestMethodHandler(string request, ServerCallContext context) |
||||
{ |
||||
if (request == "TIMEOUT") |
||||
{ |
||||
await Task.Delay(60000); |
||||
return ""; |
||||
} |
||||
|
||||
if (request == "RETURN_DEADLINE") |
||||
{ |
||||
if (context.Deadline == DateTime.MaxValue) |
||||
{ |
||||
return "DATETIME_MAXVALUE"; |
||||
} |
||||
|
||||
return context.Deadline.Ticks.ToString(); |
||||
} |
||||
|
||||
if (request == "CHECK_CANCELLATION_RECEIVED") |
||||
{ |
||||
// wait until cancellation token is fired. |
||||
var tcs = new TaskCompletionSource<object>(); |
||||
context.CancellationToken.Register(() => { tcs.SetResult(null); }); |
||||
await tcs.Task; |
||||
stringFromServerHandlerTcs.SetResult("CANCELLED"); |
||||
return ""; |
||||
} |
||||
|
||||
return ""; |
||||
} |
||||
} |
||||
} |
||||
@ -1,101 +0,0 @@ |
||||
#region Copyright notice and license |
||||
|
||||
// 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. |
||||
|
||||
#endregion |
||||
|
||||
using System; |
||||
using System.Runtime.InteropServices; |
||||
using Grpc.Core.Internal; |
||||
using NUnit.Framework; |
||||
|
||||
namespace Grpc.Core.Internal.Tests |
||||
{ |
||||
public class TimespecTest |
||||
{ |
||||
[Test] |
||||
public void Now() |
||||
{ |
||||
var timespec = Timespec.Now; |
||||
} |
||||
|
||||
[Test] |
||||
public void InfFuture() |
||||
{ |
||||
var timespec = Timespec.InfFuture; |
||||
} |
||||
|
||||
[Test] |
||||
public void TimespecSizeIsNativeSize() |
||||
{ |
||||
Assert.AreEqual(Timespec.NativeSize, Marshal.SizeOf(typeof(Timespec))); |
||||
} |
||||
|
||||
[Test] |
||||
public void ToDateTime() |
||||
{ |
||||
Assert.AreEqual(new DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Utc), |
||||
new Timespec(IntPtr.Zero, 0).ToDateTime()); |
||||
|
||||
Assert.AreEqual(new DateTime(1970, 1, 1, 0, 0, 10, DateTimeKind.Utc).AddTicks(50), |
||||
new Timespec(new IntPtr(10), 5000).ToDateTime()); |
||||
|
||||
Assert.AreEqual(new DateTime(2015, 7, 21, 4, 21, 48, DateTimeKind.Utc), |
||||
new Timespec(new IntPtr(1437452508), 0).ToDateTime()); |
||||
} |
||||
|
||||
[Test] |
||||
public void Add() |
||||
{ |
||||
var t = new Timespec { tv_sec = new IntPtr(12345), tv_nsec = 123456789 }; |
||||
var result = t.Add(TimeSpan.FromTicks(TimeSpan.TicksPerSecond * 10)); |
||||
Assert.AreEqual(result.tv_sec, new IntPtr(12355)); |
||||
Assert.AreEqual(result.tv_nsec, 123456789); |
||||
} |
||||
|
||||
[Test] |
||||
public void Add_Nanos() |
||||
{ |
||||
var t = new Timespec { tv_sec = new IntPtr(12345), tv_nsec = 123456789 }; |
||||
var result = t.Add(TimeSpan.FromTicks(10)); |
||||
Assert.AreEqual(result.tv_sec, new IntPtr(12345)); |
||||
Assert.AreEqual(result.tv_nsec, 123456789 + 1000); |
||||
} |
||||
|
||||
[Test] |
||||
public void Add_NanosOverflow() |
||||
{ |
||||
var t = new Timespec { tv_sec = new IntPtr(12345), tv_nsec = 999999999 }; |
||||
var result = t.Add(TimeSpan.FromTicks(TimeSpan.TicksPerSecond * 10 + 10)); |
||||
Assert.AreEqual(result.tv_sec, new IntPtr(12356)); |
||||
Assert.AreEqual(result.tv_nsec, 999); |
||||
} |
||||
} |
||||
} |
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in new issue