mirror of https://github.com/grpc/grpc.git
Craig Tiller
8 years ago
committed by
GitHub
commit
6628e36a89
121 changed files with 4500 additions and 264 deletions
@ -0,0 +1,70 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#ifndef GRPCXX_RESOURCE_QUOTA_H |
||||||
|
#define GRPCXX_RESOURCE_QUOTA_H |
||||||
|
|
||||||
|
struct grpc_resource_quota; |
||||||
|
|
||||||
|
#include <grpc++/impl/codegen/config.h> |
||||||
|
|
||||||
|
namespace grpc { |
||||||
|
|
||||||
|
/// ResourceQuota represents a bound on memory usage by the gRPC library.
|
||||||
|
/// A ResourceQuota can be attached to a server (via ServerBuilder), or a client
|
||||||
|
/// channel (via ChannelArguments). gRPC will attempt to keep memory used by
|
||||||
|
/// all attached entities below the ResourceQuota bound.
|
||||||
|
class ResourceQuota GRPC_FINAL { |
||||||
|
public: |
||||||
|
explicit ResourceQuota(const grpc::string& name); |
||||||
|
ResourceQuota(); |
||||||
|
~ResourceQuota(); |
||||||
|
|
||||||
|
/// Resize this ResourceQuota to a new size. If new_size is smaller than the
|
||||||
|
/// current size of the pool, memory usage will be monotonically decreased
|
||||||
|
/// until it falls under new_size. No time bound is given for this to occur
|
||||||
|
/// however.
|
||||||
|
ResourceQuota& Resize(size_t new_size); |
||||||
|
|
||||||
|
grpc_resource_quota* c_resource_quota() const { return impl_; } |
||||||
|
|
||||||
|
private: |
||||||
|
ResourceQuota(const ResourceQuota& rhs); |
||||||
|
ResourceQuota& operator=(const ResourceQuota& rhs); |
||||||
|
|
||||||
|
grpc_resource_quota* const impl_; |
||||||
|
}; |
||||||
|
|
||||||
|
} // namespace grpc
|
||||||
|
|
||||||
|
#endif // GRPCXX_RESOURCE_QUOTA_H
|
||||||
@ -0,0 +1,714 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/resource_quota.h" |
||||||
|
|
||||||
|
#include <string.h> |
||||||
|
|
||||||
|
#include <grpc/support/alloc.h> |
||||||
|
#include <grpc/support/log.h> |
||||||
|
#include <grpc/support/string_util.h> |
||||||
|
#include <grpc/support/useful.h> |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/combiner.h" |
||||||
|
|
||||||
|
int grpc_resource_quota_trace = 0; |
||||||
|
|
||||||
|
struct grpc_resource_quota { |
||||||
|
/* refcount */ |
||||||
|
gpr_refcount refs; |
||||||
|
|
||||||
|
/* Master combiner lock: all activity on a quota executes under this combiner
|
||||||
|
* (so no mutex is needed for this data structure) |
||||||
|
*/ |
||||||
|
grpc_combiner *combiner; |
||||||
|
/* Size of the resource quota */ |
||||||
|
int64_t size; |
||||||
|
/* Amount of free memory in the resource quota */ |
||||||
|
int64_t free_pool; |
||||||
|
|
||||||
|
/* Has rq_step been scheduled to occur? */ |
||||||
|
bool step_scheduled; |
||||||
|
/* Are we currently reclaiming memory */ |
||||||
|
bool reclaiming; |
||||||
|
/* Closure around rq_step */ |
||||||
|
grpc_closure rq_step_closure; |
||||||
|
/* Closure around rq_reclamation_done */ |
||||||
|
grpc_closure rq_reclamation_done_closure; |
||||||
|
|
||||||
|
/* Roots of all resource user lists */ |
||||||
|
grpc_resource_user *roots[GRPC_RULIST_COUNT]; |
||||||
|
|
||||||
|
char *name; |
||||||
|
}; |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* list management |
||||||
|
*/ |
||||||
|
|
||||||
|
static void rulist_add_head(grpc_resource_user *resource_user, |
||||||
|
grpc_rulist list) { |
||||||
|
grpc_resource_quota *resource_quota = resource_user->resource_quota; |
||||||
|
grpc_resource_user **root = &resource_quota->roots[list]; |
||||||
|
if (*root == NULL) { |
||||||
|
*root = resource_user; |
||||||
|
resource_user->links[list].next = resource_user->links[list].prev = |
||||||
|
resource_user; |
||||||
|
} else { |
||||||
|
resource_user->links[list].next = *root; |
||||||
|
resource_user->links[list].prev = (*root)->links[list].prev; |
||||||
|
resource_user->links[list].next->links[list].prev = |
||||||
|
resource_user->links[list].prev->links[list].next = resource_user; |
||||||
|
*root = resource_user; |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void rulist_add_tail(grpc_resource_user *resource_user, |
||||||
|
grpc_rulist list) { |
||||||
|
grpc_resource_quota *resource_quota = resource_user->resource_quota; |
||||||
|
grpc_resource_user **root = &resource_quota->roots[list]; |
||||||
|
if (*root == NULL) { |
||||||
|
*root = resource_user; |
||||||
|
resource_user->links[list].next = resource_user->links[list].prev = |
||||||
|
resource_user; |
||||||
|
} else { |
||||||
|
resource_user->links[list].next = (*root)->links[list].next; |
||||||
|
resource_user->links[list].prev = *root; |
||||||
|
resource_user->links[list].next->links[list].prev = |
||||||
|
resource_user->links[list].prev->links[list].next = resource_user; |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static bool rulist_empty(grpc_resource_quota *resource_quota, |
||||||
|
grpc_rulist list) { |
||||||
|
return resource_quota->roots[list] == NULL; |
||||||
|
} |
||||||
|
|
||||||
|
static grpc_resource_user *rulist_pop_head(grpc_resource_quota *resource_quota, |
||||||
|
grpc_rulist list) { |
||||||
|
grpc_resource_user **root = &resource_quota->roots[list]; |
||||||
|
grpc_resource_user *resource_user = *root; |
||||||
|
if (resource_user == NULL) { |
||||||
|
return NULL; |
||||||
|
} |
||||||
|
if (resource_user->links[list].next == resource_user) { |
||||||
|
*root = NULL; |
||||||
|
} else { |
||||||
|
resource_user->links[list].next->links[list].prev = |
||||||
|
resource_user->links[list].prev; |
||||||
|
resource_user->links[list].prev->links[list].next = |
||||||
|
resource_user->links[list].next; |
||||||
|
*root = resource_user->links[list].next; |
||||||
|
} |
||||||
|
resource_user->links[list].next = resource_user->links[list].prev = NULL; |
||||||
|
return resource_user; |
||||||
|
} |
||||||
|
|
||||||
|
static void rulist_remove(grpc_resource_user *resource_user, grpc_rulist list) { |
||||||
|
if (resource_user->links[list].next == NULL) return; |
||||||
|
grpc_resource_quota *resource_quota = resource_user->resource_quota; |
||||||
|
if (resource_quota->roots[list] == resource_user) { |
||||||
|
resource_quota->roots[list] = resource_user->links[list].next; |
||||||
|
if (resource_quota->roots[list] == resource_user) { |
||||||
|
resource_quota->roots[list] = NULL; |
||||||
|
} |
||||||
|
} |
||||||
|
resource_user->links[list].next->links[list].prev = |
||||||
|
resource_user->links[list].prev; |
||||||
|
resource_user->links[list].prev->links[list].next = |
||||||
|
resource_user->links[list].next; |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* resource quota state machine |
||||||
|
*/ |
||||||
|
|
||||||
|
static bool rq_alloc(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota); |
||||||
|
static bool rq_reclaim_from_per_user_free_pool( |
||||||
|
grpc_exec_ctx *exec_ctx, grpc_resource_quota *resource_quota); |
||||||
|
static bool rq_reclaim(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota, bool destructive); |
||||||
|
|
||||||
|
static void rq_step(grpc_exec_ctx *exec_ctx, void *rq, grpc_error *error) { |
||||||
|
grpc_resource_quota *resource_quota = rq; |
||||||
|
resource_quota->step_scheduled = false; |
||||||
|
do { |
||||||
|
if (rq_alloc(exec_ctx, resource_quota)) goto done; |
||||||
|
} while (rq_reclaim_from_per_user_free_pool(exec_ctx, resource_quota)); |
||||||
|
rq_reclaim(exec_ctx, resource_quota, false) || |
||||||
|
rq_reclaim(exec_ctx, resource_quota, true); |
||||||
|
done: |
||||||
|
grpc_resource_quota_internal_unref(exec_ctx, resource_quota); |
||||||
|
} |
||||||
|
|
||||||
|
static void rq_step_sched(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota) { |
||||||
|
if (resource_quota->step_scheduled) return; |
||||||
|
resource_quota->step_scheduled = true; |
||||||
|
grpc_resource_quota_internal_ref(resource_quota); |
||||||
|
grpc_combiner_execute_finally(exec_ctx, resource_quota->combiner, |
||||||
|
&resource_quota->rq_step_closure, |
||||||
|
GRPC_ERROR_NONE, false); |
||||||
|
} |
||||||
|
|
||||||
|
/* returns true if all allocations are completed */ |
||||||
|
static bool rq_alloc(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota) { |
||||||
|
grpc_resource_user *resource_user; |
||||||
|
while ((resource_user = rulist_pop_head(resource_quota, |
||||||
|
GRPC_RULIST_AWAITING_ALLOCATION))) { |
||||||
|
gpr_mu_lock(&resource_user->mu); |
||||||
|
if (resource_user->free_pool < 0 && |
||||||
|
-resource_user->free_pool <= resource_quota->free_pool) { |
||||||
|
int64_t amt = -resource_user->free_pool; |
||||||
|
resource_user->free_pool = 0; |
||||||
|
resource_quota->free_pool -= amt; |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: grant alloc %" PRId64 |
||||||
|
" bytes; rq_free_pool -> %" PRId64, |
||||||
|
resource_quota->name, resource_user->name, amt, |
||||||
|
resource_quota->free_pool); |
||||||
|
} |
||||||
|
} else if (grpc_resource_quota_trace && resource_user->free_pool >= 0) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: discard already satisfied alloc request", |
||||||
|
resource_quota->name, resource_user->name); |
||||||
|
} |
||||||
|
if (resource_user->free_pool >= 0) { |
||||||
|
resource_user->allocating = false; |
||||||
|
grpc_exec_ctx_enqueue_list(exec_ctx, &resource_user->on_allocated, NULL); |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
} else { |
||||||
|
rulist_add_head(resource_user, GRPC_RULIST_AWAITING_ALLOCATION); |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
return false; |
||||||
|
} |
||||||
|
} |
||||||
|
return true; |
||||||
|
} |
||||||
|
|
||||||
|
/* returns true if any memory could be reclaimed from buffers */ |
||||||
|
static bool rq_reclaim_from_per_user_free_pool( |
||||||
|
grpc_exec_ctx *exec_ctx, grpc_resource_quota *resource_quota) { |
||||||
|
grpc_resource_user *resource_user; |
||||||
|
while ((resource_user = rulist_pop_head(resource_quota, |
||||||
|
GRPC_RULIST_NON_EMPTY_FREE_POOL))) { |
||||||
|
gpr_mu_lock(&resource_user->mu); |
||||||
|
if (resource_user->free_pool > 0) { |
||||||
|
int64_t amt = resource_user->free_pool; |
||||||
|
resource_user->free_pool = 0; |
||||||
|
resource_quota->free_pool += amt; |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: reclaim_from_per_user_free_pool %" PRId64 |
||||||
|
" bytes; rq_free_pool -> %" PRId64, |
||||||
|
resource_quota->name, resource_user->name, amt, |
||||||
|
resource_quota->free_pool); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
return true; |
||||||
|
} else { |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
} |
||||||
|
} |
||||||
|
return false; |
||||||
|
} |
||||||
|
|
||||||
|
/* returns true if reclamation is proceeding */ |
||||||
|
static bool rq_reclaim(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota, bool destructive) { |
||||||
|
if (resource_quota->reclaiming) return true; |
||||||
|
grpc_rulist list = destructive ? GRPC_RULIST_RECLAIMER_DESTRUCTIVE |
||||||
|
: GRPC_RULIST_RECLAIMER_BENIGN; |
||||||
|
grpc_resource_user *resource_user = rulist_pop_head(resource_quota, list); |
||||||
|
if (resource_user == NULL) return false; |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: initiate %s reclamation", |
||||||
|
resource_quota->name, resource_user->name, |
||||||
|
destructive ? "destructive" : "benign"); |
||||||
|
} |
||||||
|
resource_quota->reclaiming = true; |
||||||
|
grpc_resource_quota_internal_ref(resource_quota); |
||||||
|
grpc_closure *c = resource_user->reclaimers[destructive]; |
||||||
|
resource_user->reclaimers[destructive] = NULL; |
||||||
|
grpc_closure_run(exec_ctx, c, GRPC_ERROR_NONE); |
||||||
|
return true; |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* ru_slice: a slice implementation that is backed by a grpc_resource_user |
||||||
|
*/ |
||||||
|
|
||||||
|
typedef struct { |
||||||
|
gpr_slice_refcount base; |
||||||
|
gpr_refcount refs; |
||||||
|
grpc_resource_user *resource_user; |
||||||
|
size_t size; |
||||||
|
} ru_slice_refcount; |
||||||
|
|
||||||
|
static void ru_slice_ref(void *p) { |
||||||
|
ru_slice_refcount *rc = p; |
||||||
|
gpr_ref(&rc->refs); |
||||||
|
} |
||||||
|
|
||||||
|
static void ru_slice_unref(void *p) { |
||||||
|
ru_slice_refcount *rc = p; |
||||||
|
if (gpr_unref(&rc->refs)) { |
||||||
|
/* TODO(ctiller): this is dangerous, but I think safe for now:
|
||||||
|
we have no guarantee here that we're at a safe point for creating an |
||||||
|
execution context, but we have no way of writing this code otherwise. |
||||||
|
In the future: consider lifting gpr_slice to grpc, and offering an |
||||||
|
internal_{ref,unref} pair that is execution context aware. |
||||||
|
Alternatively, |
||||||
|
make exec_ctx be thread local and 'do the right thing' (whatever that |
||||||
|
is) |
||||||
|
if NULL */ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, rc->resource_user, rc->size); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
gpr_free(rc); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static gpr_slice ru_slice_create(grpc_resource_user *resource_user, |
||||||
|
size_t size) { |
||||||
|
ru_slice_refcount *rc = gpr_malloc(sizeof(ru_slice_refcount) + size); |
||||||
|
rc->base.ref = ru_slice_ref; |
||||||
|
rc->base.unref = ru_slice_unref; |
||||||
|
gpr_ref_init(&rc->refs, 1); |
||||||
|
rc->resource_user = resource_user; |
||||||
|
rc->size = size; |
||||||
|
gpr_slice slice; |
||||||
|
slice.refcount = &rc->base; |
||||||
|
slice.data.refcounted.bytes = (uint8_t *)(rc + 1); |
||||||
|
slice.data.refcounted.length = size; |
||||||
|
return slice; |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* grpc_resource_quota internal implementation: resource user manipulation under |
||||||
|
* the combiner |
||||||
|
*/ |
||||||
|
|
||||||
|
static void ru_allocate(grpc_exec_ctx *exec_ctx, void *ru, grpc_error *error) { |
||||||
|
grpc_resource_user *resource_user = ru; |
||||||
|
if (rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_AWAITING_ALLOCATION)) { |
||||||
|
rq_step_sched(exec_ctx, resource_user->resource_quota); |
||||||
|
} |
||||||
|
rulist_add_tail(resource_user, GRPC_RULIST_AWAITING_ALLOCATION); |
||||||
|
} |
||||||
|
|
||||||
|
static void ru_add_to_free_pool(grpc_exec_ctx *exec_ctx, void *ru, |
||||||
|
grpc_error *error) { |
||||||
|
grpc_resource_user *resource_user = ru; |
||||||
|
if (!rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_AWAITING_ALLOCATION) && |
||||||
|
rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_NON_EMPTY_FREE_POOL)) { |
||||||
|
rq_step_sched(exec_ctx, resource_user->resource_quota); |
||||||
|
} |
||||||
|
rulist_add_tail(resource_user, GRPC_RULIST_NON_EMPTY_FREE_POOL); |
||||||
|
} |
||||||
|
|
||||||
|
static void ru_post_benign_reclaimer(grpc_exec_ctx *exec_ctx, void *ru, |
||||||
|
grpc_error *error) { |
||||||
|
grpc_resource_user *resource_user = ru; |
||||||
|
if (!rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_AWAITING_ALLOCATION) && |
||||||
|
rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_NON_EMPTY_FREE_POOL) && |
||||||
|
rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_RECLAIMER_BENIGN)) { |
||||||
|
rq_step_sched(exec_ctx, resource_user->resource_quota); |
||||||
|
} |
||||||
|
rulist_add_tail(resource_user, GRPC_RULIST_RECLAIMER_BENIGN); |
||||||
|
} |
||||||
|
|
||||||
|
static void ru_post_destructive_reclaimer(grpc_exec_ctx *exec_ctx, void *ru, |
||||||
|
grpc_error *error) { |
||||||
|
grpc_resource_user *resource_user = ru; |
||||||
|
if (!rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_AWAITING_ALLOCATION) && |
||||||
|
rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_NON_EMPTY_FREE_POOL) && |
||||||
|
rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_RECLAIMER_BENIGN) && |
||||||
|
rulist_empty(resource_user->resource_quota, |
||||||
|
GRPC_RULIST_RECLAIMER_DESTRUCTIVE)) { |
||||||
|
rq_step_sched(exec_ctx, resource_user->resource_quota); |
||||||
|
} |
||||||
|
rulist_add_tail(resource_user, GRPC_RULIST_RECLAIMER_DESTRUCTIVE); |
||||||
|
} |
||||||
|
|
||||||
|
static void ru_destroy(grpc_exec_ctx *exec_ctx, void *ru, grpc_error *error) { |
||||||
|
grpc_resource_user *resource_user = ru; |
||||||
|
GPR_ASSERT(resource_user->allocated == 0); |
||||||
|
for (int i = 0; i < GRPC_RULIST_COUNT; i++) { |
||||||
|
rulist_remove(resource_user, (grpc_rulist)i); |
||||||
|
} |
||||||
|
grpc_exec_ctx_sched(exec_ctx, resource_user->reclaimers[0], |
||||||
|
GRPC_ERROR_CANCELLED, NULL); |
||||||
|
grpc_exec_ctx_sched(exec_ctx, resource_user->reclaimers[1], |
||||||
|
GRPC_ERROR_CANCELLED, NULL); |
||||||
|
grpc_exec_ctx_sched(exec_ctx, (grpc_closure *)gpr_atm_no_barrier_load( |
||||||
|
&resource_user->on_done_destroy_closure), |
||||||
|
GRPC_ERROR_NONE, NULL); |
||||||
|
if (resource_user->free_pool != 0) { |
||||||
|
resource_user->resource_quota->free_pool += resource_user->free_pool; |
||||||
|
rq_step_sched(exec_ctx, resource_user->resource_quota); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void ru_allocated_slices(grpc_exec_ctx *exec_ctx, void *arg, |
||||||
|
grpc_error *error) { |
||||||
|
grpc_resource_user_slice_allocator *slice_allocator = arg; |
||||||
|
if (error == GRPC_ERROR_NONE) { |
||||||
|
for (size_t i = 0; i < slice_allocator->count; i++) { |
||||||
|
gpr_slice_buffer_add_indexed( |
||||||
|
slice_allocator->dest, ru_slice_create(slice_allocator->resource_user, |
||||||
|
slice_allocator->length)); |
||||||
|
} |
||||||
|
} |
||||||
|
grpc_closure_run(exec_ctx, &slice_allocator->on_done, GRPC_ERROR_REF(error)); |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* grpc_resource_quota internal implementation: quota manipulation under the |
||||||
|
* combiner |
||||||
|
*/ |
||||||
|
|
||||||
|
typedef struct { |
||||||
|
int64_t size; |
||||||
|
grpc_resource_quota *resource_quota; |
||||||
|
grpc_closure closure; |
||||||
|
} rq_resize_args; |
||||||
|
|
||||||
|
static void rq_resize(grpc_exec_ctx *exec_ctx, void *args, grpc_error *error) { |
||||||
|
rq_resize_args *a = args; |
||||||
|
int64_t delta = a->size - a->resource_quota->size; |
||||||
|
a->resource_quota->size += delta; |
||||||
|
a->resource_quota->free_pool += delta; |
||||||
|
rq_step_sched(exec_ctx, a->resource_quota); |
||||||
|
grpc_resource_quota_internal_unref(exec_ctx, a->resource_quota); |
||||||
|
gpr_free(a); |
||||||
|
} |
||||||
|
|
||||||
|
static void rq_reclamation_done(grpc_exec_ctx *exec_ctx, void *rq, |
||||||
|
grpc_error *error) { |
||||||
|
grpc_resource_quota *resource_quota = rq; |
||||||
|
resource_quota->reclaiming = false; |
||||||
|
rq_step_sched(exec_ctx, resource_quota); |
||||||
|
grpc_resource_quota_internal_unref(exec_ctx, resource_quota); |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* grpc_resource_quota api |
||||||
|
*/ |
||||||
|
|
||||||
|
/* Public API */ |
||||||
|
grpc_resource_quota *grpc_resource_quota_create(const char *name) { |
||||||
|
grpc_resource_quota *resource_quota = gpr_malloc(sizeof(*resource_quota)); |
||||||
|
gpr_ref_init(&resource_quota->refs, 1); |
||||||
|
resource_quota->combiner = grpc_combiner_create(NULL); |
||||||
|
resource_quota->free_pool = INT64_MAX; |
||||||
|
resource_quota->size = INT64_MAX; |
||||||
|
resource_quota->step_scheduled = false; |
||||||
|
resource_quota->reclaiming = false; |
||||||
|
if (name != NULL) { |
||||||
|
resource_quota->name = gpr_strdup(name); |
||||||
|
} else { |
||||||
|
gpr_asprintf(&resource_quota->name, "anonymous_pool_%" PRIxPTR, |
||||||
|
(intptr_t)resource_quota); |
||||||
|
} |
||||||
|
grpc_closure_init(&resource_quota->rq_step_closure, rq_step, resource_quota); |
||||||
|
grpc_closure_init(&resource_quota->rq_reclamation_done_closure, |
||||||
|
rq_reclamation_done, resource_quota); |
||||||
|
for (int i = 0; i < GRPC_RULIST_COUNT; i++) { |
||||||
|
resource_quota->roots[i] = NULL; |
||||||
|
} |
||||||
|
return resource_quota; |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_quota_internal_unref(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota) { |
||||||
|
if (gpr_unref(&resource_quota->refs)) { |
||||||
|
grpc_combiner_destroy(exec_ctx, resource_quota->combiner); |
||||||
|
gpr_free(resource_quota->name); |
||||||
|
gpr_free(resource_quota); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
/* Public API */ |
||||||
|
void grpc_resource_quota_unref(grpc_resource_quota *resource_quota) { |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_quota_internal_unref(&exec_ctx, resource_quota); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
|
||||||
|
grpc_resource_quota *grpc_resource_quota_internal_ref( |
||||||
|
grpc_resource_quota *resource_quota) { |
||||||
|
gpr_ref(&resource_quota->refs); |
||||||
|
return resource_quota; |
||||||
|
} |
||||||
|
|
||||||
|
/* Public API */ |
||||||
|
void grpc_resource_quota_ref(grpc_resource_quota *resource_quota) { |
||||||
|
grpc_resource_quota_internal_ref(resource_quota); |
||||||
|
} |
||||||
|
|
||||||
|
/* Public API */ |
||||||
|
void grpc_resource_quota_resize(grpc_resource_quota *resource_quota, |
||||||
|
size_t size) { |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
rq_resize_args *a = gpr_malloc(sizeof(*a)); |
||||||
|
a->resource_quota = grpc_resource_quota_internal_ref(resource_quota); |
||||||
|
a->size = (int64_t)size; |
||||||
|
grpc_closure_init(&a->closure, rq_resize, a); |
||||||
|
grpc_combiner_execute(&exec_ctx, resource_quota->combiner, &a->closure, |
||||||
|
GRPC_ERROR_NONE, false); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* grpc_resource_user channel args api |
||||||
|
*/ |
||||||
|
|
||||||
|
grpc_resource_quota *grpc_resource_quota_from_channel_args( |
||||||
|
const grpc_channel_args *channel_args) { |
||||||
|
for (size_t i = 0; i < channel_args->num_args; i++) { |
||||||
|
if (0 == strcmp(channel_args->args[i].key, GRPC_ARG_RESOURCE_QUOTA)) { |
||||||
|
if (channel_args->args[i].type == GRPC_ARG_POINTER) { |
||||||
|
return grpc_resource_quota_internal_ref( |
||||||
|
channel_args->args[i].value.pointer.p); |
||||||
|
} else { |
||||||
|
gpr_log(GPR_DEBUG, GRPC_ARG_RESOURCE_QUOTA " should be a pointer"); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
return grpc_resource_quota_create(NULL); |
||||||
|
} |
||||||
|
|
||||||
|
static void *rq_copy(void *rq) { |
||||||
|
grpc_resource_quota_ref(rq); |
||||||
|
return rq; |
||||||
|
} |
||||||
|
|
||||||
|
static void rq_destroy(void *rq) { grpc_resource_quota_unref(rq); } |
||||||
|
|
||||||
|
static int rq_cmp(void *a, void *b) { return GPR_ICMP(a, b); } |
||||||
|
|
||||||
|
const grpc_arg_pointer_vtable *grpc_resource_quota_arg_vtable(void) { |
||||||
|
static const grpc_arg_pointer_vtable vtable = {rq_copy, rq_destroy, rq_cmp}; |
||||||
|
return &vtable; |
||||||
|
} |
||||||
|
|
||||||
|
/*******************************************************************************
|
||||||
|
* grpc_resource_user api |
||||||
|
*/ |
||||||
|
|
||||||
|
void grpc_resource_user_init(grpc_resource_user *resource_user, |
||||||
|
grpc_resource_quota *resource_quota, |
||||||
|
const char *name) { |
||||||
|
resource_user->resource_quota = |
||||||
|
grpc_resource_quota_internal_ref(resource_quota); |
||||||
|
grpc_closure_init(&resource_user->allocate_closure, &ru_allocate, |
||||||
|
resource_user); |
||||||
|
grpc_closure_init(&resource_user->add_to_free_pool_closure, |
||||||
|
&ru_add_to_free_pool, resource_user); |
||||||
|
grpc_closure_init(&resource_user->post_reclaimer_closure[0], |
||||||
|
&ru_post_benign_reclaimer, resource_user); |
||||||
|
grpc_closure_init(&resource_user->post_reclaimer_closure[1], |
||||||
|
&ru_post_destructive_reclaimer, resource_user); |
||||||
|
grpc_closure_init(&resource_user->destroy_closure, &ru_destroy, |
||||||
|
resource_user); |
||||||
|
gpr_mu_init(&resource_user->mu); |
||||||
|
resource_user->allocated = 0; |
||||||
|
resource_user->free_pool = 0; |
||||||
|
grpc_closure_list_init(&resource_user->on_allocated); |
||||||
|
resource_user->allocating = false; |
||||||
|
resource_user->added_to_free_pool = false; |
||||||
|
gpr_atm_no_barrier_store(&resource_user->on_done_destroy_closure, 0); |
||||||
|
resource_user->reclaimers[0] = NULL; |
||||||
|
resource_user->reclaimers[1] = NULL; |
||||||
|
for (int i = 0; i < GRPC_RULIST_COUNT; i++) { |
||||||
|
resource_user->links[i].next = resource_user->links[i].prev = NULL; |
||||||
|
} |
||||||
|
if (name != NULL) { |
||||||
|
resource_user->name = gpr_strdup(name); |
||||||
|
} else { |
||||||
|
gpr_asprintf(&resource_user->name, "anonymous_resource_user_%" PRIxPTR, |
||||||
|
(intptr_t)resource_user); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_shutdown(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, |
||||||
|
grpc_closure *on_done) { |
||||||
|
gpr_mu_lock(&resource_user->mu); |
||||||
|
GPR_ASSERT(gpr_atm_no_barrier_load(&resource_user->on_done_destroy_closure) == |
||||||
|
0); |
||||||
|
gpr_atm_no_barrier_store(&resource_user->on_done_destroy_closure, |
||||||
|
(gpr_atm)on_done); |
||||||
|
if (resource_user->allocated == 0) { |
||||||
|
grpc_combiner_execute(exec_ctx, resource_user->resource_quota->combiner, |
||||||
|
&resource_user->destroy_closure, GRPC_ERROR_NONE, |
||||||
|
false); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_destroy(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user) { |
||||||
|
grpc_resource_quota_internal_unref(exec_ctx, resource_user->resource_quota); |
||||||
|
gpr_mu_destroy(&resource_user->mu); |
||||||
|
gpr_free(resource_user->name); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_alloc(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, size_t size, |
||||||
|
grpc_closure *optional_on_done) { |
||||||
|
gpr_mu_lock(&resource_user->mu); |
||||||
|
grpc_closure *on_done_destroy = (grpc_closure *)gpr_atm_no_barrier_load( |
||||||
|
&resource_user->on_done_destroy_closure); |
||||||
|
if (on_done_destroy != NULL) { |
||||||
|
/* already shutdown */ |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: alloc %" PRIdPTR " after shutdown", |
||||||
|
resource_user->resource_quota->name, resource_user->name, size); |
||||||
|
} |
||||||
|
grpc_exec_ctx_sched( |
||||||
|
exec_ctx, optional_on_done, |
||||||
|
GRPC_ERROR_CREATE("Buffer pool user is already shutdown"), NULL); |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
return; |
||||||
|
} |
||||||
|
resource_user->allocated += (int64_t)size; |
||||||
|
resource_user->free_pool -= (int64_t)size; |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: alloc %" PRIdPTR "; allocated -> %" PRId64 |
||||||
|
", free_pool -> %" PRId64, |
||||||
|
resource_user->resource_quota->name, resource_user->name, size, |
||||||
|
resource_user->allocated, resource_user->free_pool); |
||||||
|
} |
||||||
|
if (resource_user->free_pool < 0) { |
||||||
|
grpc_closure_list_append(&resource_user->on_allocated, optional_on_done, |
||||||
|
GRPC_ERROR_NONE); |
||||||
|
if (!resource_user->allocating) { |
||||||
|
resource_user->allocating = true; |
||||||
|
grpc_combiner_execute(exec_ctx, resource_user->resource_quota->combiner, |
||||||
|
&resource_user->allocate_closure, GRPC_ERROR_NONE, |
||||||
|
false); |
||||||
|
} |
||||||
|
} else { |
||||||
|
grpc_exec_ctx_sched(exec_ctx, optional_on_done, GRPC_ERROR_NONE, NULL); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_free(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, size_t size) { |
||||||
|
gpr_mu_lock(&resource_user->mu); |
||||||
|
GPR_ASSERT(resource_user->allocated >= (int64_t)size); |
||||||
|
bool was_zero_or_negative = resource_user->free_pool <= 0; |
||||||
|
resource_user->free_pool += (int64_t)size; |
||||||
|
resource_user->allocated -= (int64_t)size; |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: free %" PRIdPTR "; allocated -> %" PRId64 |
||||||
|
", free_pool -> %" PRId64, |
||||||
|
resource_user->resource_quota->name, resource_user->name, size, |
||||||
|
resource_user->allocated, resource_user->free_pool); |
||||||
|
} |
||||||
|
bool is_bigger_than_zero = resource_user->free_pool > 0; |
||||||
|
if (is_bigger_than_zero && was_zero_or_negative && |
||||||
|
!resource_user->added_to_free_pool) { |
||||||
|
resource_user->added_to_free_pool = true; |
||||||
|
grpc_combiner_execute(exec_ctx, resource_user->resource_quota->combiner, |
||||||
|
&resource_user->add_to_free_pool_closure, |
||||||
|
GRPC_ERROR_NONE, false); |
||||||
|
} |
||||||
|
grpc_closure *on_done_destroy = (grpc_closure *)gpr_atm_no_barrier_load( |
||||||
|
&resource_user->on_done_destroy_closure); |
||||||
|
if (on_done_destroy != NULL && resource_user->allocated == 0) { |
||||||
|
grpc_combiner_execute(exec_ctx, resource_user->resource_quota->combiner, |
||||||
|
&resource_user->destroy_closure, GRPC_ERROR_NONE, |
||||||
|
false); |
||||||
|
} |
||||||
|
gpr_mu_unlock(&resource_user->mu); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_post_reclaimer(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, |
||||||
|
bool destructive, |
||||||
|
grpc_closure *closure) { |
||||||
|
if (gpr_atm_acq_load(&resource_user->on_done_destroy_closure) == 0) { |
||||||
|
GPR_ASSERT(resource_user->reclaimers[destructive] == NULL); |
||||||
|
resource_user->reclaimers[destructive] = closure; |
||||||
|
grpc_combiner_execute(exec_ctx, resource_user->resource_quota->combiner, |
||||||
|
&resource_user->post_reclaimer_closure[destructive], |
||||||
|
GRPC_ERROR_NONE, false); |
||||||
|
} else { |
||||||
|
grpc_exec_ctx_sched(exec_ctx, closure, GRPC_ERROR_CANCELLED, NULL); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_finish_reclamation(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user) { |
||||||
|
if (grpc_resource_quota_trace) { |
||||||
|
gpr_log(GPR_DEBUG, "RQ %s %s: reclamation complete", |
||||||
|
resource_user->resource_quota->name, resource_user->name); |
||||||
|
} |
||||||
|
grpc_combiner_execute( |
||||||
|
exec_ctx, resource_user->resource_quota->combiner, |
||||||
|
&resource_user->resource_quota->rq_reclamation_done_closure, |
||||||
|
GRPC_ERROR_NONE, false); |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_slice_allocator_init( |
||||||
|
grpc_resource_user_slice_allocator *slice_allocator, |
||||||
|
grpc_resource_user *resource_user, grpc_iomgr_cb_func cb, void *p) { |
||||||
|
grpc_closure_init(&slice_allocator->on_allocated, ru_allocated_slices, |
||||||
|
slice_allocator); |
||||||
|
grpc_closure_init(&slice_allocator->on_done, cb, p); |
||||||
|
slice_allocator->resource_user = resource_user; |
||||||
|
} |
||||||
|
|
||||||
|
void grpc_resource_user_alloc_slices( |
||||||
|
grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user_slice_allocator *slice_allocator, size_t length, |
||||||
|
size_t count, gpr_slice_buffer *dest) { |
||||||
|
slice_allocator->length = length; |
||||||
|
slice_allocator->count = count; |
||||||
|
slice_allocator->dest = dest; |
||||||
|
grpc_resource_user_alloc(exec_ctx, slice_allocator->resource_user, |
||||||
|
count * length, &slice_allocator->on_allocated); |
||||||
|
} |
||||||
@ -0,0 +1,224 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#ifndef GRPC_CORE_LIB_IOMGR_RESOURCE_QUOTA_H |
||||||
|
#define GRPC_CORE_LIB_IOMGR_RESOURCE_QUOTA_H |
||||||
|
|
||||||
|
#include <grpc/grpc.h> |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/exec_ctx.h" |
||||||
|
|
||||||
|
/** \file Tracks resource usage against a pool.
|
||||||
|
|
||||||
|
The current implementation tracks only memory usage, but in the future |
||||||
|
this may be extended to (for example) threads and file descriptors. |
||||||
|
|
||||||
|
A grpc_resource_quota represents the pooled resources, and |
||||||
|
grpc_resource_user instances attach to the quota and consume those |
||||||
|
resources. They also offer a vector for reclamation: if we become |
||||||
|
resource constrained, grpc_resource_user instances are asked (in turn) to |
||||||
|
free up whatever they can so that the system as a whole can make progress. |
||||||
|
|
||||||
|
There are three kinds of reclamation that take place, in order of increasing |
||||||
|
invasiveness: |
||||||
|
- an internal reclamation, where cached resource at the resource user level |
||||||
|
is returned to the quota |
||||||
|
- a benign reclamation phase, whereby resources that are in use but are not |
||||||
|
helping anything make progress are reclaimed |
||||||
|
- a destructive reclamation, whereby resources that are helping something |
||||||
|
make progress may be enacted so that at least one part of the system can |
||||||
|
complete. |
||||||
|
|
||||||
|
Only one reclamation will be outstanding for a given quota at a given time. |
||||||
|
On each reclamation attempt, the kinds of reclamation are tried in order of |
||||||
|
increasing invasiveness, stopping at the first one that succeeds. Thus, on a |
||||||
|
given reclamation attempt, if internal and benign reclamation both fail, it |
||||||
|
will wind up doing a destructive reclamation. However, the next reclamation |
||||||
|
attempt may then be able to get what it needs via internal or benign |
||||||
|
reclamation, due to resources that may have been freed up by the destructive |
||||||
|
reclamation in the previous attempt. |
||||||
|
|
||||||
|
Future work will be to expose the current resource pressure so that back |
||||||
|
pressure can be applied to avoid reclamation phases starting. |
||||||
|
|
||||||
|
Resource users own references to resource quotas, and resource quotas |
||||||
|
maintain lists of users (which users arrange to leave before they are |
||||||
|
destroyed) */ |
||||||
|
|
||||||
|
extern int grpc_resource_quota_trace; |
||||||
|
|
||||||
|
grpc_resource_quota *grpc_resource_quota_internal_ref( |
||||||
|
grpc_resource_quota *resource_quota); |
||||||
|
void grpc_resource_quota_internal_unref(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_quota *resource_quota); |
||||||
|
grpc_resource_quota *grpc_resource_quota_from_channel_args( |
||||||
|
const grpc_channel_args *channel_args); |
||||||
|
|
||||||
|
/* Resource users are kept in (potentially) several intrusive linked lists
|
||||||
|
at once. These are the list names. */ |
||||||
|
typedef enum { |
||||||
|
/* Resource users that are waiting for an allocation */ |
||||||
|
GRPC_RULIST_AWAITING_ALLOCATION, |
||||||
|
/* Resource users that have free memory available for internal reclamation */ |
||||||
|
GRPC_RULIST_NON_EMPTY_FREE_POOL, |
||||||
|
/* Resource users that have published a benign reclamation is available */ |
||||||
|
GRPC_RULIST_RECLAIMER_BENIGN, |
||||||
|
/* Resource users that have published a destructive reclamation is
|
||||||
|
available */ |
||||||
|
GRPC_RULIST_RECLAIMER_DESTRUCTIVE, |
||||||
|
/* Number of lists: must be last */ |
||||||
|
GRPC_RULIST_COUNT |
||||||
|
} grpc_rulist; |
||||||
|
|
||||||
|
typedef struct grpc_resource_user grpc_resource_user; |
||||||
|
|
||||||
|
/* Internal linked list pointers for a resource user */ |
||||||
|
typedef struct { |
||||||
|
grpc_resource_user *next; |
||||||
|
grpc_resource_user *prev; |
||||||
|
} grpc_resource_user_link; |
||||||
|
|
||||||
|
struct grpc_resource_user { |
||||||
|
/* The quota this resource user consumes from */ |
||||||
|
grpc_resource_quota *resource_quota; |
||||||
|
|
||||||
|
/* Closure to schedule an allocation under the resource quota combiner lock */ |
||||||
|
grpc_closure allocate_closure; |
||||||
|
/* Closure to publish a non empty free pool under the resource quota combiner
|
||||||
|
lock */ |
||||||
|
grpc_closure add_to_free_pool_closure; |
||||||
|
|
||||||
|
gpr_mu mu; |
||||||
|
/* Total allocated memory outstanding by this resource user in bytes;
|
||||||
|
always positive */ |
||||||
|
int64_t allocated; |
||||||
|
/* The amount of memory (in bytes) this user has cached for its own use: to
|
||||||
|
avoid quota contention, each resource user can keep some memory in |
||||||
|
addition to what it is immediately using (e.g., for caching), and the quota |
||||||
|
can pull it back under memory pressure. |
||||||
|
This value can become negative if more memory has been requested than |
||||||
|
existed in the free pool, at which point the quota is consulted to bring |
||||||
|
this value non-negative (asynchronously). */ |
||||||
|
int64_t free_pool; |
||||||
|
/* A list of closures to call once free_pool becomes non-negative - ie when
|
||||||
|
all outstanding allocations have been granted. */ |
||||||
|
grpc_closure_list on_allocated; |
||||||
|
/* True if we are currently trying to allocate from the quota, false if not */ |
||||||
|
bool allocating; |
||||||
|
/* True if we are currently trying to add ourselves to the non-free quota
|
||||||
|
list, false otherwise */ |
||||||
|
bool added_to_free_pool; |
||||||
|
|
||||||
|
/* Reclaimers: index 0 is the benign reclaimer, 1 is the destructive reclaimer
|
||||||
|
*/ |
||||||
|
grpc_closure *reclaimers[2]; |
||||||
|
/* Trampoline closures to finish reclamation and re-enter the quota combiner
|
||||||
|
lock */ |
||||||
|
grpc_closure post_reclaimer_closure[2]; |
||||||
|
|
||||||
|
/* Closure to execute under the quota combiner to de-register and shutdown the
|
||||||
|
resource user */ |
||||||
|
grpc_closure destroy_closure; |
||||||
|
/* User supplied closure to call once the user has finished shutting down AND
|
||||||
|
all outstanding allocations have been freed. Real type is grpc_closure*, |
||||||
|
but it's stored as an atomic to avoid a mutex on some fast paths. */ |
||||||
|
gpr_atm on_done_destroy_closure; |
||||||
|
|
||||||
|
/* Links in the various grpc_rulist lists */ |
||||||
|
grpc_resource_user_link links[GRPC_RULIST_COUNT]; |
||||||
|
|
||||||
|
/* The name of this resource user, for debugging/tracing */ |
||||||
|
char *name; |
||||||
|
}; |
||||||
|
|
||||||
|
void grpc_resource_user_init(grpc_resource_user *resource_user, |
||||||
|
grpc_resource_quota *resource_quota, |
||||||
|
const char *name); |
||||||
|
void grpc_resource_user_shutdown(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, |
||||||
|
grpc_closure *on_done); |
||||||
|
void grpc_resource_user_destroy(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user); |
||||||
|
|
||||||
|
/* Allocate from the resource user (and its quota).
|
||||||
|
If optional_on_done is NULL, then allocate immediately. This may push the |
||||||
|
quota over-limit, at which point reclamation will kick in. |
||||||
|
If optional_on_done is non-NULL, it will be scheduled when the allocation has |
||||||
|
been granted by the quota. */ |
||||||
|
void grpc_resource_user_alloc(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, size_t size, |
||||||
|
grpc_closure *optional_on_done); |
||||||
|
/* Release memory back to the quota */ |
||||||
|
void grpc_resource_user_free(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, size_t size); |
||||||
|
/* Post a memory reclaimer to the resource user. Only one benign and one
|
||||||
|
destructive reclaimer can be posted at once. When executed, the reclaimer |
||||||
|
MUST call grpc_resource_user_finish_reclamation before it completes, to |
||||||
|
return control to the resource quota. */ |
||||||
|
void grpc_resource_user_post_reclaimer(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user, |
||||||
|
bool destructive, grpc_closure *closure); |
||||||
|
/* Finish a reclamation step */ |
||||||
|
void grpc_resource_user_finish_reclamation(grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user *resource_user); |
||||||
|
|
||||||
|
/* Helper to allocate slices from a resource user */ |
||||||
|
typedef struct grpc_resource_user_slice_allocator { |
||||||
|
/* Closure for when a resource user allocation completes */ |
||||||
|
grpc_closure on_allocated; |
||||||
|
/* Closure to call when slices have been allocated */ |
||||||
|
grpc_closure on_done; |
||||||
|
/* Length of slices to allocate on the current request */ |
||||||
|
size_t length; |
||||||
|
/* Number of slices to allocate on the current request */ |
||||||
|
size_t count; |
||||||
|
/* Destination for slices to allocate on the current request */ |
||||||
|
gpr_slice_buffer *dest; |
||||||
|
/* Parent resource user */ |
||||||
|
grpc_resource_user *resource_user; |
||||||
|
} grpc_resource_user_slice_allocator; |
||||||
|
|
||||||
|
/* Initialize a slice allocator.
|
||||||
|
When an allocation is completed, calls \a cb with arg \p. */ |
||||||
|
void grpc_resource_user_slice_allocator_init( |
||||||
|
grpc_resource_user_slice_allocator *slice_allocator, |
||||||
|
grpc_resource_user *resource_user, grpc_iomgr_cb_func cb, void *p); |
||||||
|
|
||||||
|
/* Allocate \a count slices of length \a length into \a dest. Only one request
|
||||||
|
can be outstanding at a time. */ |
||||||
|
void grpc_resource_user_alloc_slices( |
||||||
|
grpc_exec_ctx *exec_ctx, |
||||||
|
grpc_resource_user_slice_allocator *slice_allocator, size_t length, |
||||||
|
size_t count, gpr_slice_buffer *dest); |
||||||
|
|
||||||
|
#endif /* GRPC_CORE_LIB_IOMGR_RESOURCE_QUOTA_H */ |
||||||
@ -0,0 +1,45 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2015, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#ifndef GRPC_CORE_LIB_IOMGR_TCP_CLIENT_POSIX_H |
||||||
|
#define GRPC_CORE_LIB_IOMGR_TCP_CLIENT_POSIX_H |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/endpoint.h" |
||||||
|
#include "src/core/lib/iomgr/ev_posix.h" |
||||||
|
#include "src/core/lib/iomgr/tcp_client.h" |
||||||
|
|
||||||
|
grpc_endpoint *grpc_tcp_client_create_from_fd( |
||||||
|
grpc_exec_ctx *exec_ctx, grpc_fd *fd, const grpc_channel_args *channel_args, |
||||||
|
const char *addr_str); |
||||||
|
|
||||||
|
#endif /* GRPC_CORE_LIB_IOMGR_TCP_CLIENT_POSIX_H */ |
||||||
@ -0,0 +1,51 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#include <grpc++/resource_quota.h> |
||||||
|
#include <grpc/grpc.h> |
||||||
|
|
||||||
|
namespace grpc { |
||||||
|
|
||||||
|
ResourceQuota::ResourceQuota() : impl_(grpc_resource_quota_create(nullptr)) {} |
||||||
|
|
||||||
|
ResourceQuota::ResourceQuota(const grpc::string& name) |
||||||
|
: impl_(grpc_resource_quota_create(name.c_str())) {} |
||||||
|
|
||||||
|
ResourceQuota::~ResourceQuota() { grpc_resource_quota_unref(impl_); } |
||||||
|
|
||||||
|
ResourceQuota& ResourceQuota::Resize(size_t new_size) { |
||||||
|
grpc_resource_quota_resize(impl_, new_size); |
||||||
|
return *this; |
||||||
|
} |
||||||
|
|
||||||
|
} // namespace grpc
|
||||||
@ -0,0 +1,359 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#include "test/core/end2end/end2end_tests.h" |
||||||
|
|
||||||
|
#include <stdio.h> |
||||||
|
#include <string.h> |
||||||
|
|
||||||
|
#include <grpc/byte_buffer.h> |
||||||
|
#include <grpc/support/alloc.h> |
||||||
|
#include <grpc/support/log.h> |
||||||
|
#include <grpc/support/time.h> |
||||||
|
#include <grpc/support/useful.h> |
||||||
|
#include "test/core/end2end/cq_verifier.h" |
||||||
|
|
||||||
|
static void *tag(intptr_t t) { return (void *)t; } |
||||||
|
|
||||||
|
static grpc_end2end_test_fixture begin_test(grpc_end2end_test_config config, |
||||||
|
const char *test_name, |
||||||
|
grpc_channel_args *client_args, |
||||||
|
grpc_channel_args *server_args) { |
||||||
|
grpc_end2end_test_fixture f; |
||||||
|
gpr_log(GPR_INFO, "%s/%s", test_name, config.name); |
||||||
|
f = config.create_fixture(client_args, server_args); |
||||||
|
config.init_server(&f, server_args); |
||||||
|
config.init_client(&f, client_args, NULL); |
||||||
|
return f; |
||||||
|
} |
||||||
|
|
||||||
|
static gpr_timespec n_seconds_time(int n) { |
||||||
|
return GRPC_TIMEOUT_SECONDS_TO_DEADLINE(n); |
||||||
|
} |
||||||
|
|
||||||
|
static gpr_timespec five_seconds_time(void) { return n_seconds_time(5); } |
||||||
|
|
||||||
|
static void drain_cq(grpc_completion_queue *cq) { |
||||||
|
grpc_event ev; |
||||||
|
do { |
||||||
|
ev = grpc_completion_queue_next(cq, five_seconds_time(), NULL); |
||||||
|
} while (ev.type != GRPC_QUEUE_SHUTDOWN); |
||||||
|
} |
||||||
|
|
||||||
|
static void shutdown_server(grpc_end2end_test_fixture *f) { |
||||||
|
if (!f->server) return; |
||||||
|
grpc_server_shutdown_and_notify(f->server, f->cq, tag(1000)); |
||||||
|
GPR_ASSERT(grpc_completion_queue_pluck( |
||||||
|
f->cq, tag(1000), GRPC_TIMEOUT_SECONDS_TO_DEADLINE(5), NULL) |
||||||
|
.type == GRPC_OP_COMPLETE); |
||||||
|
grpc_server_destroy(f->server); |
||||||
|
f->server = NULL; |
||||||
|
} |
||||||
|
|
||||||
|
static void shutdown_client(grpc_end2end_test_fixture *f) { |
||||||
|
if (!f->client) return; |
||||||
|
grpc_channel_destroy(f->client); |
||||||
|
f->client = NULL; |
||||||
|
} |
||||||
|
|
||||||
|
static void end_test(grpc_end2end_test_fixture *f) { |
||||||
|
shutdown_server(f); |
||||||
|
shutdown_client(f); |
||||||
|
|
||||||
|
grpc_completion_queue_shutdown(f->cq); |
||||||
|
drain_cq(f->cq); |
||||||
|
grpc_completion_queue_destroy(f->cq); |
||||||
|
} |
||||||
|
|
||||||
|
/* Creates and returns a gpr_slice containing random alphanumeric characters. */ |
||||||
|
static gpr_slice generate_random_slice() { |
||||||
|
size_t i; |
||||||
|
static const char chars[] = "abcdefghijklmnopqrstuvwxyz1234567890"; |
||||||
|
char output[1024 * 1024]; |
||||||
|
for (i = 0; i < GPR_ARRAY_SIZE(output) - 1; ++i) { |
||||||
|
output[i] = chars[rand() % (int)(sizeof(chars) - 1)]; |
||||||
|
} |
||||||
|
output[GPR_ARRAY_SIZE(output) - 1] = '\0'; |
||||||
|
return gpr_slice_from_copied_string(output); |
||||||
|
} |
||||||
|
|
||||||
|
void resource_quota_server(grpc_end2end_test_config config) { |
||||||
|
grpc_resource_quota *resource_quota = |
||||||
|
grpc_resource_quota_create("test_server"); |
||||||
|
grpc_resource_quota_resize(resource_quota, 5 * 1024 * 1024); |
||||||
|
|
||||||
|
#define NUM_CALLS 100 |
||||||
|
#define CLIENT_BASE_TAG 1000 |
||||||
|
#define SERVER_START_BASE_TAG 2000 |
||||||
|
#define SERVER_RECV_BASE_TAG 3000 |
||||||
|
#define SERVER_END_BASE_TAG 4000 |
||||||
|
|
||||||
|
grpc_arg arg; |
||||||
|
arg.key = GRPC_ARG_RESOURCE_QUOTA; |
||||||
|
arg.type = GRPC_ARG_POINTER; |
||||||
|
arg.value.pointer.p = resource_quota; |
||||||
|
arg.value.pointer.vtable = grpc_resource_quota_arg_vtable(); |
||||||
|
grpc_channel_args args = {1, &arg}; |
||||||
|
|
||||||
|
grpc_end2end_test_fixture f = |
||||||
|
begin_test(config, "resource_quota_server", NULL, &args); |
||||||
|
|
||||||
|
/* Create large request and response bodies. These are big enough to require
|
||||||
|
* multiple round trips to deliver to the peer, and their exact contents of |
||||||
|
* will be verified on completion. */ |
||||||
|
gpr_slice request_payload_slice = generate_random_slice(); |
||||||
|
|
||||||
|
grpc_call *client_calls[NUM_CALLS]; |
||||||
|
grpc_call *server_calls[NUM_CALLS]; |
||||||
|
grpc_metadata_array initial_metadata_recv[NUM_CALLS]; |
||||||
|
grpc_metadata_array trailing_metadata_recv[NUM_CALLS]; |
||||||
|
grpc_metadata_array request_metadata_recv[NUM_CALLS]; |
||||||
|
grpc_call_details call_details[NUM_CALLS]; |
||||||
|
grpc_status_code status[NUM_CALLS]; |
||||||
|
char *details[NUM_CALLS]; |
||||||
|
size_t details_capacity[NUM_CALLS]; |
||||||
|
grpc_byte_buffer *request_payload_recv[NUM_CALLS]; |
||||||
|
int was_cancelled[NUM_CALLS]; |
||||||
|
grpc_call_error error; |
||||||
|
int pending_client_calls = 0; |
||||||
|
int pending_server_start_calls = 0; |
||||||
|
int pending_server_recv_calls = 0; |
||||||
|
int pending_server_end_calls = 0; |
||||||
|
int cancelled_calls_on_client = 0; |
||||||
|
int cancelled_calls_on_server = 0; |
||||||
|
|
||||||
|
grpc_byte_buffer *request_payload = |
||||||
|
grpc_raw_byte_buffer_create(&request_payload_slice, 1); |
||||||
|
|
||||||
|
grpc_op ops[6]; |
||||||
|
grpc_op *op; |
||||||
|
|
||||||
|
for (int i = 0; i < NUM_CALLS; i++) { |
||||||
|
grpc_metadata_array_init(&initial_metadata_recv[i]); |
||||||
|
grpc_metadata_array_init(&trailing_metadata_recv[i]); |
||||||
|
grpc_metadata_array_init(&request_metadata_recv[i]); |
||||||
|
grpc_call_details_init(&call_details[i]); |
||||||
|
details[i] = NULL; |
||||||
|
details_capacity[i] = 0; |
||||||
|
request_payload_recv[i] = NULL; |
||||||
|
was_cancelled[i] = 0; |
||||||
|
} |
||||||
|
|
||||||
|
for (int i = 0; i < NUM_CALLS; i++) { |
||||||
|
error = grpc_server_request_call( |
||||||
|
f.server, &server_calls[i], &call_details[i], &request_metadata_recv[i], |
||||||
|
f.cq, f.cq, tag(SERVER_START_BASE_TAG + i)); |
||||||
|
GPR_ASSERT(GRPC_CALL_OK == error); |
||||||
|
|
||||||
|
pending_server_start_calls++; |
||||||
|
} |
||||||
|
|
||||||
|
for (int i = 0; i < NUM_CALLS; i++) { |
||||||
|
client_calls[i] = grpc_channel_create_call( |
||||||
|
f.client, NULL, GRPC_PROPAGATE_DEFAULTS, f.cq, "/foo", |
||||||
|
"foo.test.google.fr", n_seconds_time(60), NULL); |
||||||
|
|
||||||
|
memset(ops, 0, sizeof(ops)); |
||||||
|
op = ops; |
||||||
|
op->op = GRPC_OP_SEND_INITIAL_METADATA; |
||||||
|
op->data.send_initial_metadata.count = 0; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
op->op = GRPC_OP_SEND_MESSAGE; |
||||||
|
op->data.send_message = request_payload; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
op->op = GRPC_OP_SEND_CLOSE_FROM_CLIENT; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
op->op = GRPC_OP_RECV_INITIAL_METADATA; |
||||||
|
op->data.recv_initial_metadata = &initial_metadata_recv[i]; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
op->op = GRPC_OP_RECV_STATUS_ON_CLIENT; |
||||||
|
op->data.recv_status_on_client.trailing_metadata = |
||||||
|
&trailing_metadata_recv[i]; |
||||||
|
op->data.recv_status_on_client.status = &status[i]; |
||||||
|
op->data.recv_status_on_client.status_details = &details[i]; |
||||||
|
op->data.recv_status_on_client.status_details_capacity = |
||||||
|
&details_capacity[i]; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
error = grpc_call_start_batch(client_calls[i], ops, (size_t)(op - ops), |
||||||
|
tag(CLIENT_BASE_TAG + i), NULL); |
||||||
|
GPR_ASSERT(GRPC_CALL_OK == error); |
||||||
|
|
||||||
|
pending_client_calls++; |
||||||
|
} |
||||||
|
|
||||||
|
while (pending_client_calls + pending_server_recv_calls + |
||||||
|
pending_server_end_calls > |
||||||
|
0) { |
||||||
|
grpc_event ev = grpc_completion_queue_next(f.cq, n_seconds_time(10), NULL); |
||||||
|
GPR_ASSERT(ev.type == GRPC_OP_COMPLETE); |
||||||
|
|
||||||
|
int ev_tag = (int)(intptr_t)ev.tag; |
||||||
|
if (ev_tag < CLIENT_BASE_TAG) { |
||||||
|
abort(); /* illegal tag */ |
||||||
|
} else if (ev_tag < SERVER_START_BASE_TAG) { |
||||||
|
/* client call finished */ |
||||||
|
int call_id = ev_tag - CLIENT_BASE_TAG; |
||||||
|
GPR_ASSERT(call_id >= 0); |
||||||
|
GPR_ASSERT(call_id < NUM_CALLS); |
||||||
|
switch (status[call_id]) { |
||||||
|
case GRPC_STATUS_RESOURCE_EXHAUSTED: |
||||||
|
cancelled_calls_on_client++; |
||||||
|
break; |
||||||
|
case GRPC_STATUS_OK: |
||||||
|
break; |
||||||
|
default: |
||||||
|
gpr_log(GPR_ERROR, "Unexpected status code: %d", status[call_id]); |
||||||
|
abort(); |
||||||
|
} |
||||||
|
GPR_ASSERT(pending_client_calls > 0); |
||||||
|
|
||||||
|
grpc_metadata_array_destroy(&initial_metadata_recv[call_id]); |
||||||
|
grpc_metadata_array_destroy(&trailing_metadata_recv[call_id]); |
||||||
|
grpc_call_destroy(client_calls[call_id]); |
||||||
|
gpr_free(details[call_id]); |
||||||
|
|
||||||
|
pending_client_calls--; |
||||||
|
} else if (ev_tag < SERVER_RECV_BASE_TAG) { |
||||||
|
/* new incoming call to the server */ |
||||||
|
int call_id = ev_tag - SERVER_START_BASE_TAG; |
||||||
|
GPR_ASSERT(call_id >= 0); |
||||||
|
GPR_ASSERT(call_id < NUM_CALLS); |
||||||
|
|
||||||
|
memset(ops, 0, sizeof(ops)); |
||||||
|
op = ops; |
||||||
|
op->op = GRPC_OP_SEND_INITIAL_METADATA; |
||||||
|
op->data.send_initial_metadata.count = 0; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
op->op = GRPC_OP_RECV_MESSAGE; |
||||||
|
op->data.recv_message = &request_payload_recv[call_id]; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
error = |
||||||
|
grpc_call_start_batch(server_calls[call_id], ops, (size_t)(op - ops), |
||||||
|
tag(SERVER_RECV_BASE_TAG + call_id), NULL); |
||||||
|
GPR_ASSERT(GRPC_CALL_OK == error); |
||||||
|
|
||||||
|
GPR_ASSERT(pending_server_start_calls > 0); |
||||||
|
pending_server_start_calls--; |
||||||
|
pending_server_recv_calls++; |
||||||
|
|
||||||
|
grpc_call_details_destroy(&call_details[call_id]); |
||||||
|
grpc_metadata_array_destroy(&request_metadata_recv[call_id]); |
||||||
|
} else if (ev_tag < SERVER_END_BASE_TAG) { |
||||||
|
/* finished read on the server */ |
||||||
|
int call_id = ev_tag - SERVER_RECV_BASE_TAG; |
||||||
|
GPR_ASSERT(call_id >= 0); |
||||||
|
GPR_ASSERT(call_id < NUM_CALLS); |
||||||
|
|
||||||
|
if (ev.success) { |
||||||
|
if (request_payload_recv[call_id] != NULL) { |
||||||
|
grpc_byte_buffer_destroy(request_payload_recv[call_id]); |
||||||
|
request_payload_recv[call_id] = NULL; |
||||||
|
} |
||||||
|
} else { |
||||||
|
GPR_ASSERT(request_payload_recv[call_id] == NULL); |
||||||
|
} |
||||||
|
|
||||||
|
memset(ops, 0, sizeof(ops)); |
||||||
|
op = ops; |
||||||
|
op->op = GRPC_OP_RECV_CLOSE_ON_SERVER; |
||||||
|
op->data.recv_close_on_server.cancelled = &was_cancelled[call_id]; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
op->op = GRPC_OP_SEND_STATUS_FROM_SERVER; |
||||||
|
op->data.send_status_from_server.trailing_metadata_count = 0; |
||||||
|
op->data.send_status_from_server.status = GRPC_STATUS_OK; |
||||||
|
op->data.send_status_from_server.status_details = "xyz"; |
||||||
|
op->flags = 0; |
||||||
|
op->reserved = NULL; |
||||||
|
op++; |
||||||
|
error = |
||||||
|
grpc_call_start_batch(server_calls[call_id], ops, (size_t)(op - ops), |
||||||
|
tag(SERVER_END_BASE_TAG + call_id), NULL); |
||||||
|
GPR_ASSERT(GRPC_CALL_OK == error); |
||||||
|
|
||||||
|
GPR_ASSERT(pending_server_recv_calls > 0); |
||||||
|
pending_server_recv_calls--; |
||||||
|
pending_server_end_calls++; |
||||||
|
} else { |
||||||
|
int call_id = ev_tag - SERVER_END_BASE_TAG; |
||||||
|
GPR_ASSERT(call_id >= 0); |
||||||
|
GPR_ASSERT(call_id < NUM_CALLS); |
||||||
|
|
||||||
|
if (was_cancelled[call_id]) { |
||||||
|
cancelled_calls_on_server++; |
||||||
|
} |
||||||
|
GPR_ASSERT(pending_server_end_calls > 0); |
||||||
|
pending_server_end_calls--; |
||||||
|
|
||||||
|
grpc_call_destroy(server_calls[call_id]); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
gpr_log( |
||||||
|
GPR_INFO, |
||||||
|
"Done. %d total calls: %d cancelled at server, %d cancelled at client.", |
||||||
|
NUM_CALLS, cancelled_calls_on_server, cancelled_calls_on_client); |
||||||
|
|
||||||
|
/* The call may be cancelled after the server has sent its status but before
|
||||||
|
* the client has received it. This means that we should see strictly more |
||||||
|
* failures on the client than on the server. */ |
||||||
|
GPR_ASSERT(cancelled_calls_on_client >= cancelled_calls_on_server); |
||||||
|
/* However, we shouldn't see radically more... 0.9 is a guessed bound on what
|
||||||
|
* we'd want that ratio to be... to at least trigger some investigation should |
||||||
|
* that ratio become much higher. */ |
||||||
|
GPR_ASSERT(cancelled_calls_on_server >= 0.9 * cancelled_calls_on_client); |
||||||
|
|
||||||
|
grpc_byte_buffer_destroy(request_payload); |
||||||
|
gpr_slice_unref(request_payload_slice); |
||||||
|
grpc_resource_quota_unref(resource_quota); |
||||||
|
|
||||||
|
end_test(&f); |
||||||
|
config.tear_down_data(&f); |
||||||
|
} |
||||||
|
|
||||||
|
void resource_quota_server_pre_init(void) {} |
||||||
@ -0,0 +1,749 @@ |
|||||||
|
/*
|
||||||
|
* |
||||||
|
* Copyright 2016, Google Inc. |
||||||
|
* All rights reserved. |
||||||
|
* |
||||||
|
* Redistribution and use in source and binary forms, with or without |
||||||
|
* modification, are permitted provided that the following conditions are |
||||||
|
* met: |
||||||
|
* |
||||||
|
* * Redistributions of source code must retain the above copyright |
||||||
|
* notice, this list of conditions and the following disclaimer. |
||||||
|
* * Redistributions in binary form must reproduce the above |
||||||
|
* copyright notice, this list of conditions and the following disclaimer |
||||||
|
* in the documentation and/or other materials provided with the |
||||||
|
* distribution. |
||||||
|
* * Neither the name of Google Inc. nor the names of its |
||||||
|
* contributors may be used to endorse or promote products derived from |
||||||
|
* this software without specific prior written permission. |
||||||
|
* |
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
||||||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
||||||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||||||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||||||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
||||||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||||
|
* |
||||||
|
*/ |
||||||
|
|
||||||
|
#include "src/core/lib/iomgr/resource_quota.h" |
||||||
|
|
||||||
|
#include <grpc/support/alloc.h> |
||||||
|
#include <grpc/support/log.h> |
||||||
|
|
||||||
|
#include "test/core/util/test_config.h" |
||||||
|
|
||||||
|
static void inc_int_cb(grpc_exec_ctx *exec_ctx, void *a, grpc_error *error) { |
||||||
|
++*(int *)a; |
||||||
|
} |
||||||
|
|
||||||
|
static void set_bool_cb(grpc_exec_ctx *exec_ctx, void *a, grpc_error *error) { |
||||||
|
*(bool *)a = true; |
||||||
|
} |
||||||
|
grpc_closure *set_bool(bool *p) { return grpc_closure_create(set_bool_cb, p); } |
||||||
|
|
||||||
|
typedef struct { |
||||||
|
size_t size; |
||||||
|
grpc_resource_user *resource_user; |
||||||
|
grpc_closure *then; |
||||||
|
} reclaimer_args; |
||||||
|
static void reclaimer_cb(grpc_exec_ctx *exec_ctx, void *args, |
||||||
|
grpc_error *error) { |
||||||
|
GPR_ASSERT(error == GRPC_ERROR_NONE); |
||||||
|
reclaimer_args *a = args; |
||||||
|
grpc_resource_user_free(exec_ctx, a->resource_user, a->size); |
||||||
|
grpc_resource_user_finish_reclamation(exec_ctx, a->resource_user); |
||||||
|
grpc_closure_run(exec_ctx, a->then, GRPC_ERROR_NONE); |
||||||
|
gpr_free(a); |
||||||
|
} |
||||||
|
grpc_closure *make_reclaimer(grpc_resource_user *resource_user, size_t size, |
||||||
|
grpc_closure *then) { |
||||||
|
reclaimer_args *a = gpr_malloc(sizeof(*a)); |
||||||
|
a->size = size; |
||||||
|
a->resource_user = resource_user; |
||||||
|
a->then = then; |
||||||
|
return grpc_closure_create(reclaimer_cb, a); |
||||||
|
} |
||||||
|
|
||||||
|
static void unused_reclaimer_cb(grpc_exec_ctx *exec_ctx, void *arg, |
||||||
|
grpc_error *error) { |
||||||
|
GPR_ASSERT(error == GRPC_ERROR_CANCELLED); |
||||||
|
grpc_closure_run(exec_ctx, arg, GRPC_ERROR_NONE); |
||||||
|
} |
||||||
|
grpc_closure *make_unused_reclaimer(grpc_closure *then) { |
||||||
|
return grpc_closure_create(unused_reclaimer_cb, then); |
||||||
|
} |
||||||
|
|
||||||
|
static void destroy_user(grpc_resource_user *usr) { |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
bool done = false; |
||||||
|
grpc_resource_user_shutdown(&exec_ctx, usr, set_bool(&done)); |
||||||
|
grpc_exec_ctx_flush(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
grpc_resource_user_destroy(&exec_ctx, usr); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_no_op(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_no_op **"); |
||||||
|
grpc_resource_quota_unref(grpc_resource_quota_create("test_no_op")); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_resize_then_destroy(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_resize_then_destroy **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_resize_then_destroy"); |
||||||
|
grpc_resource_quota_resize(q, 1024 * 1024); |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_resource_user_no_op(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_resource_user_no_op **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_resource_user_no_op"); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_instant_alloc_then_free(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_instant_alloc_then_free **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_instant_alloc_then_free"); |
||||||
|
grpc_resource_quota_resize(q, 1024 * 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, NULL); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_instant_alloc_free_pair(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_instant_alloc_free_pair **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_instant_alloc_free_pair"); |
||||||
|
grpc_resource_quota_resize(q, 1024 * 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, NULL); |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_simple_async_alloc(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_simple_async_alloc **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_simple_async_alloc"); |
||||||
|
grpc_resource_quota_resize(q, 1024 * 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_async_alloc_blocked_by_size(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_async_alloc_blocked_by_size **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_async_alloc_blocked_by_size"); |
||||||
|
grpc_resource_quota_resize(q, 1); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
bool done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!done); |
||||||
|
} |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
GPR_ASSERT(done); |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_scavenge(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_scavenge **"); |
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create("test_scavenge"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr1; |
||||||
|
grpc_resource_user usr2; |
||||||
|
grpc_resource_user_init(&usr1, q, "usr1"); |
||||||
|
grpc_resource_user_init(&usr2, q, "usr2"); |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr1, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr1, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr2, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr2, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr1); |
||||||
|
destroy_user(&usr2); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_scavenge_blocked(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_scavenge_blocked **"); |
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create("test_scavenge_blocked"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr1; |
||||||
|
grpc_resource_user usr2; |
||||||
|
grpc_resource_user_init(&usr1, q, "usr1"); |
||||||
|
grpc_resource_user_init(&usr2, q, "usr2"); |
||||||
|
bool done; |
||||||
|
{ |
||||||
|
done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr1, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr2, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr1, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr2, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr1); |
||||||
|
destroy_user(&usr2); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_blocked_until_scheduled_reclaim(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_blocked_until_scheduled_reclaim **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_blocked_until_scheduled_reclaim"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
bool reclaim_done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, false, |
||||||
|
make_reclaimer(&usr, 1024, set_bool(&reclaim_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(reclaim_done); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_blocked_until_scheduled_reclaim_and_scavenge(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_blocked_until_scheduled_reclaim_and_scavenge **"); |
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create( |
||||||
|
"test_blocked_until_scheduled_reclaim_and_scavenge"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr1; |
||||||
|
grpc_resource_user usr2; |
||||||
|
grpc_resource_user_init(&usr1, q, "usr1"); |
||||||
|
grpc_resource_user_init(&usr2, q, "usr2"); |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr1, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
bool reclaim_done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr1, false, |
||||||
|
make_reclaimer(&usr1, 1024, set_bool(&reclaim_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr2, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(reclaim_done); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr2, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr1); |
||||||
|
destroy_user(&usr2); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_blocked_until_scheduled_destructive_reclaim(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_blocked_until_scheduled_destructive_reclaim **"); |
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create( |
||||||
|
"test_blocked_until_scheduled_destructive_reclaim"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
bool reclaim_done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, true, |
||||||
|
make_reclaimer(&usr, 1024, set_bool(&reclaim_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(reclaim_done); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_unused_reclaim_is_cancelled(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_unused_reclaim_is_cancelled **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_unused_reclaim_is_cancelled"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
bool benign_done = false; |
||||||
|
bool destructive_done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, false, make_unused_reclaimer(set_bool(&benign_done))); |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, true, |
||||||
|
make_unused_reclaimer(set_bool(&destructive_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!benign_done); |
||||||
|
GPR_ASSERT(!destructive_done); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
GPR_ASSERT(benign_done); |
||||||
|
GPR_ASSERT(destructive_done); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_benign_reclaim_is_preferred(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_benign_reclaim_is_preferred **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_benign_reclaim_is_preferred"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
bool benign_done = false; |
||||||
|
bool destructive_done = false; |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, false, |
||||||
|
make_reclaimer(&usr, 1024, set_bool(&benign_done))); |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, true, |
||||||
|
make_unused_reclaimer(set_bool(&destructive_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!benign_done); |
||||||
|
GPR_ASSERT(!destructive_done); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(benign_done); |
||||||
|
GPR_ASSERT(!destructive_done); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
GPR_ASSERT(benign_done); |
||||||
|
GPR_ASSERT(destructive_done); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_multiple_reclaims_can_be_triggered(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_multiple_reclaims_can_be_triggered **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_multiple_reclaims_can_be_triggered"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
bool benign_done = false; |
||||||
|
bool destructive_done = false; |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, false, |
||||||
|
make_reclaimer(&usr, 512, set_bool(&benign_done))); |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, true, |
||||||
|
make_reclaimer(&usr, 512, set_bool(&destructive_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!benign_done); |
||||||
|
GPR_ASSERT(!destructive_done); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool done = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(benign_done); |
||||||
|
GPR_ASSERT(destructive_done); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
destroy_user(&usr); |
||||||
|
GPR_ASSERT(benign_done); |
||||||
|
GPR_ASSERT(destructive_done); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_resource_user_stays_allocated_until_memory_released(void) { |
||||||
|
gpr_log(GPR_INFO, |
||||||
|
"** test_resource_user_stays_allocated_until_memory_released **"); |
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create( |
||||||
|
"test_resource_user_stays_allocated_until_memory_released"); |
||||||
|
grpc_resource_quota_resize(q, 1024 * 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
bool done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, NULL); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
grpc_resource_user_shutdown(&exec_ctx, &usr, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_destroy(&exec_ctx, &usr); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
static void |
||||||
|
test_resource_user_stays_allocated_and_reclaimers_unrun_until_memory_released( |
||||||
|
void) { |
||||||
|
gpr_log(GPR_INFO, |
||||||
|
"** " |
||||||
|
"test_resource_user_stays_allocated_and_reclaimers_unrun_until_" |
||||||
|
"memory_released **"); |
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create( |
||||||
|
"test_resource_user_stays_allocated_and_reclaimers_unrun_until_memory_" |
||||||
|
"released"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
for (int i = 0; i < 10; i++) { |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
bool done = false; |
||||||
|
bool reclaimer_cancelled = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, false, |
||||||
|
make_unused_reclaimer(set_bool(&reclaimer_cancelled))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!reclaimer_cancelled); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool allocated = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&allocated)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(allocated); |
||||||
|
GPR_ASSERT(!reclaimer_cancelled); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_shutdown(&exec_ctx, &usr, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!done); |
||||||
|
GPR_ASSERT(!reclaimer_cancelled); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(done); |
||||||
|
GPR_ASSERT(reclaimer_cancelled); |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_destroy(&exec_ctx, &usr); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
} |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_reclaimers_can_be_posted_repeatedly(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_reclaimers_can_be_posted_repeatedly **"); |
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_reclaimers_can_be_posted_repeatedly"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
{ |
||||||
|
bool allocated = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&allocated)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(allocated); |
||||||
|
} |
||||||
|
for (int i = 0; i < 10; i++) { |
||||||
|
bool reclaimer_done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_post_reclaimer( |
||||||
|
&exec_ctx, &usr, false, |
||||||
|
make_reclaimer(&usr, 1024, set_bool(&reclaimer_done))); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!reclaimer_done); |
||||||
|
} |
||||||
|
{ |
||||||
|
bool allocated = false; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc(&exec_ctx, &usr, 1024, set_bool(&allocated)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(allocated); |
||||||
|
GPR_ASSERT(reclaimer_done); |
||||||
|
} |
||||||
|
} |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_free(&exec_ctx, &usr, 1024); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
destroy_user(&usr); |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_one_slice(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_one_slice **"); |
||||||
|
|
||||||
|
grpc_resource_quota *q = grpc_resource_quota_create("test_one_slice"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
|
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
|
||||||
|
grpc_resource_user_slice_allocator alloc; |
||||||
|
int num_allocs = 0; |
||||||
|
grpc_resource_user_slice_allocator_init(&alloc, &usr, inc_int_cb, |
||||||
|
&num_allocs); |
||||||
|
|
||||||
|
gpr_slice_buffer buffer; |
||||||
|
gpr_slice_buffer_init(&buffer); |
||||||
|
|
||||||
|
{ |
||||||
|
const int start_allocs = num_allocs; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc_slices(&exec_ctx, &alloc, 1024, 1, &buffer); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(num_allocs == start_allocs + 1); |
||||||
|
} |
||||||
|
|
||||||
|
gpr_slice_buffer_destroy(&buffer); |
||||||
|
destroy_user(&usr); |
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
} |
||||||
|
|
||||||
|
static void test_one_slice_deleted_late(void) { |
||||||
|
gpr_log(GPR_INFO, "** test_one_slice_deleted_late **"); |
||||||
|
|
||||||
|
grpc_resource_quota *q = |
||||||
|
grpc_resource_quota_create("test_one_slice_deleted_late"); |
||||||
|
grpc_resource_quota_resize(q, 1024); |
||||||
|
|
||||||
|
grpc_resource_user usr; |
||||||
|
grpc_resource_user_init(&usr, q, "usr"); |
||||||
|
|
||||||
|
grpc_resource_user_slice_allocator alloc; |
||||||
|
int num_allocs = 0; |
||||||
|
grpc_resource_user_slice_allocator_init(&alloc, &usr, inc_int_cb, |
||||||
|
&num_allocs); |
||||||
|
|
||||||
|
gpr_slice_buffer buffer; |
||||||
|
gpr_slice_buffer_init(&buffer); |
||||||
|
|
||||||
|
{ |
||||||
|
const int start_allocs = num_allocs; |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_alloc_slices(&exec_ctx, &alloc, 1024, 1, &buffer); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(num_allocs == start_allocs + 1); |
||||||
|
} |
||||||
|
|
||||||
|
bool done = false; |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_shutdown(&exec_ctx, &usr, set_bool(&done)); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
GPR_ASSERT(!done); |
||||||
|
} |
||||||
|
|
||||||
|
grpc_resource_quota_unref(q); |
||||||
|
gpr_slice_buffer_destroy(&buffer); |
||||||
|
GPR_ASSERT(done); |
||||||
|
{ |
||||||
|
grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT; |
||||||
|
grpc_resource_user_destroy(&exec_ctx, &usr); |
||||||
|
grpc_exec_ctx_finish(&exec_ctx); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
int main(int argc, char **argv) { |
||||||
|
grpc_test_init(argc, argv); |
||||||
|
grpc_init(); |
||||||
|
test_no_op(); |
||||||
|
test_resize_then_destroy(); |
||||||
|
test_resource_user_no_op(); |
||||||
|
test_instant_alloc_then_free(); |
||||||
|
test_instant_alloc_free_pair(); |
||||||
|
test_simple_async_alloc(); |
||||||
|
test_async_alloc_blocked_by_size(); |
||||||
|
test_scavenge(); |
||||||
|
test_scavenge_blocked(); |
||||||
|
test_blocked_until_scheduled_reclaim(); |
||||||
|
test_blocked_until_scheduled_reclaim_and_scavenge(); |
||||||
|
test_blocked_until_scheduled_destructive_reclaim(); |
||||||
|
test_unused_reclaim_is_cancelled(); |
||||||
|
test_benign_reclaim_is_preferred(); |
||||||
|
test_multiple_reclaims_can_be_triggered(); |
||||||
|
test_resource_user_stays_allocated_until_memory_released(); |
||||||
|
test_resource_user_stays_allocated_and_reclaimers_unrun_until_memory_released(); |
||||||
|
test_reclaimers_can_be_posted_repeatedly(); |
||||||
|
test_one_slice(); |
||||||
|
test_one_slice_deleted_late(); |
||||||
|
grpc_shutdown(); |
||||||
|
return 0; |
||||||
|
} |
||||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in new issue