|
Packit |
90a5c9 |
/* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
Packit |
90a5c9 |
* contributor license agreements. See the NOTICE file distributed with
|
|
Packit |
90a5c9 |
* this work for additional information regarding copyright ownership.
|
|
Packit |
90a5c9 |
* The ASF licenses this file to You under the Apache License, Version 2.0
|
|
Packit |
90a5c9 |
* (the "License"); you may not use this file except in compliance with
|
|
Packit |
90a5c9 |
* the License. You may obtain a copy of the License at
|
|
Packit |
90a5c9 |
*
|
|
Packit |
90a5c9 |
* http://www.apache.org/licenses/LICENSE-2.0
|
|
Packit |
90a5c9 |
*
|
|
Packit |
90a5c9 |
* Unless required by applicable law or agreed to in writing, software
|
|
Packit |
90a5c9 |
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
Packit |
90a5c9 |
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
Packit |
90a5c9 |
* See the License for the specific language governing permissions and
|
|
Packit |
90a5c9 |
* limitations under the License.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
#include "mpm_fdqueue.h"
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
#if APR_HAS_THREADS
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
#include <apr_atomic.h>
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
static const apr_uint32_t zero_pt = APR_UINT32_MAX/2;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
struct recycled_pool
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_pool_t *pool;
|
|
Packit |
90a5c9 |
struct recycled_pool *next;
|
|
Packit |
90a5c9 |
};
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
struct fd_queue_info_t
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_uint32_t volatile idlers; /**
|
|
Packit |
90a5c9 |
* >= zero_pt: number of idle worker threads
|
|
Packit |
90a5c9 |
* < zero_pt: number of threads blocked,
|
|
Packit |
90a5c9 |
* waiting for an idle worker
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
apr_thread_mutex_t *idlers_mutex;
|
|
Packit |
90a5c9 |
apr_thread_cond_t *wait_for_idler;
|
|
Packit |
90a5c9 |
int terminated;
|
|
Packit |
90a5c9 |
int max_idlers;
|
|
Packit |
90a5c9 |
int max_recycled_pools;
|
|
Packit |
90a5c9 |
apr_uint32_t recycled_pools_count;
|
|
Packit |
90a5c9 |
struct recycled_pool *volatile recycled_pools;
|
|
Packit |
90a5c9 |
};
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
struct fd_queue_elem_t
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_socket_t *sd;
|
|
Packit |
90a5c9 |
void *sd_baton;
|
|
Packit |
90a5c9 |
apr_pool_t *p;
|
|
Packit |
90a5c9 |
};
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
static apr_status_t queue_info_cleanup(void *data_)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
fd_queue_info_t *qi = data_;
|
|
Packit |
90a5c9 |
apr_thread_cond_destroy(qi->wait_for_idler);
|
|
Packit |
90a5c9 |
apr_thread_mutex_destroy(qi->idlers_mutex);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* Clean up any pools in the recycled list */
|
|
Packit |
90a5c9 |
for (;;) {
|
|
Packit |
90a5c9 |
struct recycled_pool *first_pool = qi->recycled_pools;
|
|
Packit |
90a5c9 |
if (first_pool == NULL) {
|
|
Packit |
90a5c9 |
break;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if (apr_atomic_casptr((void *)&qi->recycled_pools, first_pool->next,
|
|
Packit |
90a5c9 |
first_pool) == first_pool) {
|
|
Packit |
90a5c9 |
apr_pool_destroy(first_pool->pool);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_info_create(fd_queue_info_t **queue_info,
|
|
Packit |
90a5c9 |
apr_pool_t *pool, int max_idlers,
|
|
Packit |
90a5c9 |
int max_recycled_pools)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
fd_queue_info_t *qi;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
qi = apr_pcalloc(pool, sizeof(*qi));
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_create(&qi->idlers_mutex, APR_THREAD_MUTEX_DEFAULT,
|
|
Packit |
90a5c9 |
pool);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
rv = apr_thread_cond_create(&qi->wait_for_idler, pool);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
qi->recycled_pools = NULL;
|
|
Packit |
90a5c9 |
qi->max_recycled_pools = max_recycled_pools;
|
|
Packit |
90a5c9 |
qi->max_idlers = max_idlers;
|
|
Packit |
90a5c9 |
qi->idlers = zero_pt;
|
|
Packit |
90a5c9 |
apr_pool_cleanup_register(pool, qi, queue_info_cleanup,
|
|
Packit |
90a5c9 |
apr_pool_cleanup_null);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
*queue_info = qi;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_info_set_idle(fd_queue_info_t *queue_info,
|
|
Packit |
90a5c9 |
apr_pool_t *pool_to_recycle)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
ap_queue_info_push_pool(queue_info, pool_to_recycle);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* If other threads are waiting on a worker, wake one up */
|
|
Packit |
90a5c9 |
if (apr_atomic_inc32(&queue_info->idlers) < zero_pt) {
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_lock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
AP_DEBUG_ASSERT(0);
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
rv = apr_thread_cond_signal(queue_info->wait_for_idler);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
apr_thread_mutex_unlock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_unlock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_info_try_get_idler(fd_queue_info_t *queue_info)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
/* Don't block if there isn't any idle worker. */
|
|
Packit |
90a5c9 |
for (;;) {
|
|
Packit |
90a5c9 |
apr_uint32_t idlers = queue_info->idlers;
|
|
Packit |
90a5c9 |
if (idlers <= zero_pt) {
|
|
Packit |
90a5c9 |
return APR_EAGAIN;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if (apr_atomic_cas32(&queue_info->idlers, idlers - 1,
|
|
Packit |
90a5c9 |
idlers) == idlers) {
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_info_wait_for_idler(fd_queue_info_t *queue_info,
|
|
Packit |
90a5c9 |
int *had_to_block)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* Block if there isn't any idle worker.
|
|
Packit |
90a5c9 |
* apr_atomic_add32(x, -1) does the same as dec32(x), except
|
|
Packit |
90a5c9 |
* that it returns the previous value (unlike dec32's bool).
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
if (apr_atomic_add32(&queue_info->idlers, -1) <= zero_pt) {
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_lock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
AP_DEBUG_ASSERT(0);
|
|
Packit |
90a5c9 |
apr_atomic_inc32(&(queue_info->idlers)); /* back out dec */
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
/* Re-check the idle worker count to guard against a
|
|
Packit |
90a5c9 |
* race condition. Now that we're in the mutex-protected
|
|
Packit |
90a5c9 |
* region, one of two things may have happened:
|
|
Packit |
90a5c9 |
* - If the idle worker count is still negative, the
|
|
Packit |
90a5c9 |
* workers are all still busy, so it's safe to
|
|
Packit |
90a5c9 |
* block on a condition variable.
|
|
Packit |
90a5c9 |
* - If the idle worker count is non-negative, then a
|
|
Packit |
90a5c9 |
* worker has become idle since the first check
|
|
Packit |
90a5c9 |
* of queue_info->idlers above. It's possible
|
|
Packit |
90a5c9 |
* that the worker has also signaled the condition
|
|
Packit |
90a5c9 |
* variable--and if so, the listener missed it
|
|
Packit |
90a5c9 |
* because it wasn't yet blocked on the condition
|
|
Packit |
90a5c9 |
* variable. But if the idle worker count is
|
|
Packit |
90a5c9 |
* now non-negative, it's safe for this function to
|
|
Packit |
90a5c9 |
* return immediately.
|
|
Packit |
90a5c9 |
*
|
|
Packit |
90a5c9 |
* A "negative value" (relative to zero_pt) in
|
|
Packit |
90a5c9 |
* queue_info->idlers tells how many
|
|
Packit |
90a5c9 |
* threads are waiting on an idle worker.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
if (queue_info->idlers < zero_pt) {
|
|
Packit |
90a5c9 |
if (had_to_block) {
|
|
Packit |
90a5c9 |
*had_to_block = 1;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
rv = apr_thread_cond_wait(queue_info->wait_for_idler,
|
|
Packit |
90a5c9 |
queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
AP_DEBUG_ASSERT(0);
|
|
Packit |
90a5c9 |
apr_thread_mutex_unlock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_unlock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if (queue_info->terminated) {
|
|
Packit |
90a5c9 |
return APR_EOF;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
else {
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_uint32_t ap_queue_info_num_idlers(fd_queue_info_t *queue_info)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_uint32_t val;
|
|
Packit |
90a5c9 |
val = apr_atomic_read32(&queue_info->idlers);
|
|
Packit |
90a5c9 |
return (val > zero_pt) ? val - zero_pt : 0;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
void ap_queue_info_push_pool(fd_queue_info_t *queue_info,
|
|
Packit |
90a5c9 |
apr_pool_t *pool_to_recycle)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
struct recycled_pool *new_recycle;
|
|
Packit |
90a5c9 |
/* If we have been given a pool to recycle, atomically link
|
|
Packit |
90a5c9 |
* it into the queue_info's list of recycled pools
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
if (!pool_to_recycle)
|
|
Packit |
90a5c9 |
return;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if (queue_info->max_recycled_pools >= 0) {
|
|
Packit |
90a5c9 |
apr_uint32_t n = apr_atomic_read32(&queue_info->recycled_pools_count);
|
|
Packit |
90a5c9 |
if (n >= queue_info->max_recycled_pools) {
|
|
Packit |
90a5c9 |
apr_pool_destroy(pool_to_recycle);
|
|
Packit |
90a5c9 |
return;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
apr_atomic_inc32(&queue_info->recycled_pools_count);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_pool_clear(pool_to_recycle);
|
|
Packit |
90a5c9 |
new_recycle = apr_palloc(pool_to_recycle, sizeof *new_recycle);
|
|
Packit |
90a5c9 |
new_recycle->pool = pool_to_recycle;
|
|
Packit |
90a5c9 |
for (;;) {
|
|
Packit |
90a5c9 |
/*
|
|
Packit |
90a5c9 |
* Save queue_info->recycled_pool in local variable next because
|
|
Packit |
90a5c9 |
* new_recycle->next can be changed after apr_atomic_casptr
|
|
Packit |
90a5c9 |
* function call. For gory details see PR 44402.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
struct recycled_pool *next = queue_info->recycled_pools;
|
|
Packit |
90a5c9 |
new_recycle->next = next;
|
|
Packit |
90a5c9 |
if (apr_atomic_casptr((void *)&queue_info->recycled_pools,
|
|
Packit |
90a5c9 |
new_recycle, next) == next)
|
|
Packit |
90a5c9 |
break;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
void ap_queue_info_pop_pool(fd_queue_info_t *queue_info,
|
|
Packit |
90a5c9 |
apr_pool_t **recycled_pool)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
/* Atomically pop a pool from the recycled list */
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* This function is safe only as long as it is single threaded because
|
|
Packit |
90a5c9 |
* it reaches into the queue and accesses "next" which can change.
|
|
Packit |
90a5c9 |
* We are OK today because it is only called from the listener thread.
|
|
Packit |
90a5c9 |
* cas-based pushes do not have the same limitation - any number can
|
|
Packit |
90a5c9 |
* happen concurrently with a single cas-based pop.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
*recycled_pool = NULL;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* Atomically pop a pool from the recycled list */
|
|
Packit |
90a5c9 |
for (;;) {
|
|
Packit |
90a5c9 |
struct recycled_pool *first_pool = queue_info->recycled_pools;
|
|
Packit |
90a5c9 |
if (first_pool == NULL) {
|
|
Packit |
90a5c9 |
break;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if (apr_atomic_casptr((void *)&queue_info->recycled_pools,
|
|
Packit |
90a5c9 |
first_pool->next, first_pool) == first_pool) {
|
|
Packit |
90a5c9 |
*recycled_pool = first_pool->pool;
|
|
Packit |
90a5c9 |
if (queue_info->max_recycled_pools >= 0)
|
|
Packit |
90a5c9 |
apr_atomic_dec32(&queue_info->recycled_pools_count);
|
|
Packit |
90a5c9 |
break;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
void ap_queue_info_free_idle_pools(fd_queue_info_t *queue_info)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_pool_t *p;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
queue_info->max_recycled_pools = 0;
|
|
Packit |
90a5c9 |
for (;;) {
|
|
Packit |
90a5c9 |
ap_queue_info_pop_pool(queue_info, &p);
|
|
Packit |
90a5c9 |
if (p == NULL)
|
|
Packit |
90a5c9 |
break;
|
|
Packit |
90a5c9 |
apr_pool_destroy(p);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
apr_atomic_set32(&queue_info->recycled_pools_count, 0);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_info_term(fd_queue_info_t *queue_info)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_lock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
queue_info->terminated = 1;
|
|
Packit |
90a5c9 |
apr_thread_cond_broadcast(queue_info->wait_for_idler);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return apr_thread_mutex_unlock(queue_info->idlers_mutex);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/**
|
|
Packit |
90a5c9 |
* Detects when the fd_queue_t is full. This utility function is expected
|
|
Packit |
90a5c9 |
* to be called from within critical sections, and is not threadsafe.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
#define ap_queue_full(queue) ((queue)->nelts == (queue)->bounds)
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/**
|
|
Packit |
90a5c9 |
* Detects when the fd_queue_t is empty. This utility function is expected
|
|
Packit |
90a5c9 |
* to be called from within critical sections, and is not threadsafe.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
#define ap_queue_empty(queue) ((queue)->nelts == 0 && \
|
|
Packit |
90a5c9 |
APR_RING_EMPTY(&queue->timers, \
|
|
Packit |
90a5c9 |
timer_event_t, link))
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/**
|
|
Packit |
90a5c9 |
* Callback routine that is called to destroy this
|
|
Packit |
90a5c9 |
* fd_queue_t when its pool is destroyed.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
static apr_status_t ap_queue_destroy(void *data)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
fd_queue_t *queue = data;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* Ignore errors here, we can't do anything about them anyway.
|
|
Packit |
90a5c9 |
* XXX: We should at least try to signal an error here, it is
|
|
Packit |
90a5c9 |
* indicative of a programmer error. -aaron */
|
|
Packit |
90a5c9 |
apr_thread_cond_destroy(queue->not_empty);
|
|
Packit |
90a5c9 |
apr_thread_mutex_destroy(queue->one_big_mutex);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/**
|
|
Packit |
90a5c9 |
* Initialize the fd_queue_t.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_create(fd_queue_t **pqueue, int capacity, apr_pool_t *p)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
fd_queue_t *queue;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
queue = apr_pcalloc(p, sizeof *queue);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if ((rv = apr_thread_mutex_create(&queue->one_big_mutex,
|
|
Packit |
90a5c9 |
APR_THREAD_MUTEX_DEFAULT,
|
|
Packit |
90a5c9 |
p)) != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if ((rv = apr_thread_cond_create(&queue->not_empty, p)) != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
APR_RING_INIT(&queue->timers, timer_event_t, link);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
queue->data = apr_pcalloc(p, capacity * sizeof(fd_queue_elem_t));
|
|
Packit |
90a5c9 |
queue->bounds = capacity;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_pool_cleanup_register(p, queue, ap_queue_destroy,
|
|
Packit |
90a5c9 |
apr_pool_cleanup_null);
|
|
Packit |
90a5c9 |
*pqueue = queue;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return APR_SUCCESS;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/**
|
|
Packit |
90a5c9 |
* Push a new socket onto the queue.
|
|
Packit |
90a5c9 |
*
|
|
Packit |
90a5c9 |
* precondition: ap_queue_info_wait_for_idler has already been called
|
|
Packit |
90a5c9 |
* to reserve an idle worker thread
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_push_socket(fd_queue_t *queue,
|
|
Packit |
90a5c9 |
apr_socket_t *sd, void *sd_baton,
|
|
Packit |
90a5c9 |
apr_pool_t *p)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
fd_queue_elem_t *elem;
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if ((rv = apr_thread_mutex_lock(queue->one_big_mutex)) != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
AP_DEBUG_ASSERT(!queue->terminated);
|
|
Packit |
90a5c9 |
AP_DEBUG_ASSERT(!ap_queue_full(queue));
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
elem = &queue->data[queue->in++];
|
|
Packit |
90a5c9 |
if (queue->in >= queue->bounds)
|
|
Packit |
90a5c9 |
queue->in -= queue->bounds;
|
|
Packit |
90a5c9 |
elem->sd = sd;
|
|
Packit |
90a5c9 |
elem->sd_baton = sd_baton;
|
|
Packit |
90a5c9 |
elem->p = p;
|
|
Packit |
90a5c9 |
queue->nelts++;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_thread_cond_signal(queue->not_empty);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return apr_thread_mutex_unlock(queue->one_big_mutex);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_push_timer(fd_queue_t *queue, timer_event_t *te)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if ((rv = apr_thread_mutex_lock(queue->one_big_mutex)) != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
AP_DEBUG_ASSERT(!queue->terminated);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
APR_RING_INSERT_TAIL(&queue->timers, te, timer_event_t, link);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_thread_cond_signal(queue->not_empty);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return apr_thread_mutex_unlock(queue->one_big_mutex);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/**
|
|
Packit |
90a5c9 |
* Retrieves the next available socket from the queue. If there are no
|
|
Packit |
90a5c9 |
* sockets available, it will block until one becomes available.
|
|
Packit |
90a5c9 |
* Once retrieved, the socket is placed into the address specified by
|
|
Packit |
90a5c9 |
* 'sd'.
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_pop_something(fd_queue_t *queue,
|
|
Packit |
90a5c9 |
apr_socket_t **sd, void **sd_baton,
|
|
Packit |
90a5c9 |
apr_pool_t **p, timer_event_t **te_out)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
fd_queue_elem_t *elem;
|
|
Packit |
90a5c9 |
timer_event_t *te;
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if ((rv = apr_thread_mutex_lock(queue->one_big_mutex)) != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* Keep waiting until we wake up and find that the queue is not empty. */
|
|
Packit |
90a5c9 |
if (ap_queue_empty(queue)) {
|
|
Packit |
90a5c9 |
if (!queue->terminated) {
|
|
Packit |
90a5c9 |
apr_thread_cond_wait(queue->not_empty, queue->one_big_mutex);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
/* If we wake up and it's still empty, then we were interrupted */
|
|
Packit |
90a5c9 |
if (ap_queue_empty(queue)) {
|
|
Packit |
90a5c9 |
rv = apr_thread_mutex_unlock(queue->one_big_mutex);
|
|
Packit |
90a5c9 |
if (rv != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if (queue->terminated) {
|
|
Packit |
90a5c9 |
return APR_EOF; /* no more elements ever again */
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
else {
|
|
Packit |
90a5c9 |
return APR_EINTR;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
te = NULL;
|
|
Packit |
90a5c9 |
if (te_out) {
|
|
Packit |
90a5c9 |
if (!APR_RING_EMPTY(&queue->timers, timer_event_t, link)) {
|
|
Packit |
90a5c9 |
te = APR_RING_FIRST(&queue->timers);
|
|
Packit |
90a5c9 |
APR_RING_REMOVE(te, link);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
*te_out = te;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if (!te) {
|
|
Packit |
90a5c9 |
elem = &queue->data[queue->out++];
|
|
Packit |
90a5c9 |
if (queue->out >= queue->bounds)
|
|
Packit |
90a5c9 |
queue->out -= queue->bounds;
|
|
Packit |
90a5c9 |
queue->nelts--;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
*sd = elem->sd;
|
|
Packit |
90a5c9 |
if (sd_baton) {
|
|
Packit |
90a5c9 |
*sd_baton = elem->sd_baton;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
*p = elem->p;
|
|
Packit |
90a5c9 |
#ifdef AP_DEBUG
|
|
Packit |
90a5c9 |
elem->sd = NULL;
|
|
Packit |
90a5c9 |
elem->p = NULL;
|
|
Packit |
90a5c9 |
#endif /* AP_DEBUG */
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return apr_thread_mutex_unlock(queue->one_big_mutex);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
static apr_status_t queue_interrupt(fd_queue_t *queue, int all, int term)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
apr_status_t rv;
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
if ((rv = apr_thread_mutex_lock(queue->one_big_mutex)) != APR_SUCCESS) {
|
|
Packit |
90a5c9 |
return rv;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
/* we must hold one_big_mutex when setting this... otherwise,
|
|
Packit |
90a5c9 |
* we could end up setting it and waking everybody up just after a
|
|
Packit |
90a5c9 |
* would-be popper checks it but right before they block
|
|
Packit |
90a5c9 |
*/
|
|
Packit |
90a5c9 |
if (term) {
|
|
Packit |
90a5c9 |
queue->terminated = 1;
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
if (all)
|
|
Packit |
90a5c9 |
apr_thread_cond_broadcast(queue->not_empty);
|
|
Packit |
90a5c9 |
else
|
|
Packit |
90a5c9 |
apr_thread_cond_signal(queue->not_empty);
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
return apr_thread_mutex_unlock(queue->one_big_mutex);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_interrupt_all(fd_queue_t *queue)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
return queue_interrupt(queue, 1, 0);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_interrupt_one(fd_queue_t *queue)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
return queue_interrupt(queue, 0, 0);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
apr_status_t ap_queue_term(fd_queue_t *queue)
|
|
Packit |
90a5c9 |
{
|
|
Packit |
90a5c9 |
return queue_interrupt(queue, 1, 1);
|
|
Packit |
90a5c9 |
}
|
|
Packit |
90a5c9 |
|
|
Packit |
90a5c9 |
#endif /* APR_HAS_THREADS */
|