|
Apache HTTPD
|
Macros | |
| #define | APR_RESLIST_CLEANUP_DEFAULT 0 |
| #define | APR_RESLIST_CLEANUP_FIRST 1 |
Typedefs | |
| typedef struct apr_reslist_t | apr_reslist_t |
| typedef apr_status_t(* | apr_reslist_constructor) (void **resource, void *params, apr_pool_t *pool) |
| typedef apr_status_t(* | apr_reslist_destructor) (void *resource, void *params, apr_pool_t *pool) |
Functions | |
| APU_DECLARE (apr_status_t) apr_reslist_create(apr_reslist_t **reslist | |
| APU_DECLARE (void) apr_reslist_timeout_set(apr_reslist_t *reslist | |
| Computes SipHash-2-4, producing a 64bit (APR_SIPHASH_DSIZE) hash from a message and a 128bit (APR_SIPHASH_KSIZE) secret key, into a possibly unaligned buffer (using the little endian representation as defined by the authors for interoperabilty) usable as a MAC. | |
| APU_DECLARE (apr_uint32_t) apr_reslist_acquired_count(apr_reslist_t *reslist) | |
| #define APR_RESLIST_CLEANUP_DEFAULT 0 |
default pool cleanup
Definition at line 63 of file apr_reslist.h.
| #define APR_RESLIST_CLEANUP_FIRST 1 |
use pool pre cleanup
Definition at line 64 of file apr_reslist.h.
| typedef apr_status_t(* apr_reslist_constructor) (void **resource, void *params, apr_pool_t *pool) |
Definition at line 50 of file apr_reslist.h.
| typedef apr_status_t(* apr_reslist_destructor) (void *resource, void *params, apr_pool_t *pool) |
Definition at line 59 of file apr_reslist.h.
Opaque resource list object
Definition at line 42 of file apr_reslist.h.
| APU_DECLARE | ( | apr_status_t | ) |
Create a new resource list with the following parameters:
| reslist | An address where the pointer to the new resource list will be stored. |
| min | Allowed minimum number of available resources. Zero creates new resources only when needed. |
| smax | Resources will be destroyed during reslist maintenance to meet this maximum restriction as they expire (reach their ttl). |
| hmax | Absolute maximum limit on the number of total resources. |
| ttl | If non-zero, sets the maximum amount of time in microseconds an unused resource is valid. Any resource which has exceeded this time will be destroyed, either when encountered by apr_reslist_acquire() or during reslist maintenance. |
| con | Constructor routine that is called to create a new resource. |
| de | Destructor routine that is called to destroy an expired resource. |
| params | Passed to constructor and deconstructor |
| pool | The pool from which to create this resource list. Also the same pool that is passed to the constructor and destructor routines. |
Destroy the given resource list and all resources controlled by this list. FIXME: Should this block until all resources become available, or maybe just destroy all the free ones, or maybe destroy them even though they might be in use by something else? Currently it will abort if there are resources that haven't been released, so there is an assumption that all resources have been released to the list before calling this function.
| reslist | The reslist to destroy |
Retrieve a resource from the list, creating a new one if necessary. If we have met our maximum number of resources, we will block until one becomes available.
| reslist | The resource list. |
| resource | An address where the pointer to the resource will be stored. |
Return a resource back to the list of available resources.
| reslist | The resource list. |
| resource | The resource to return to the list. |
Invalidate a resource in the pool - e.g. a database connection that returns a "lost connection" error and can't be restored. Use this instead of apr_reslist_release if the resource is bad.
| reslist | The resource list. |
| resource | The resource to invalidate. |
Perform routine maintenance on the resource list. This call may instantiate new resources or expire old resources.
| reslist | The resource list. |
< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.
< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.
< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".
< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".
< Replace
< Insert with duplicates
< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.
< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.
< mask to extract lock type
< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.
< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".
< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".
< Size of the file
< Shared lock. More than one process or thread can hold a shared lock at any given time. Essentially, this is a "read lock", preventing writers from establishing an exclusive lock.
< Exclusive lock. Only one process may hold an exclusive lock at any given time. This is analogous to a "write lock".
Definition at line 358 of file apr_brigade.c.
| APU_DECLARE | ( | apr_uint32_t | ) |
Return the number of outstanding resources.
| reslist | The resource list. |
Creates a crc32 hash used to split keys between servers
| mc | The memcache client object to use |
| data | Data to be hashed |
| data_len | Length of the data to use |
Pure CRC32 Hash. Used by some clients.
hash compatible with the standard Perl Client.
Creates a crc32 hash used to split keys between servers
| rc | The redis client object to use |
| data | Data to be hashed |
| data_len | Length of the data to use |
Pure CRC32 Hash. Used by some clients.
hash compatible with the standard Perl Client.
Definition at line 129 of file apr_memcache.c.
| APU_DECLARE | ( | void | ) |
Computes SipHash-2-4, producing a 64bit (APR_SIPHASH_DSIZE) hash from a message and a 128bit (APR_SIPHASH_KSIZE) secret key, into a possibly unaligned buffer (using the little endian representation as defined by the authors for interoperabilty) usable as a MAC.
Set the timeout the acquire will wait for a free resource when the maximum number of resources is exceeded.
| reslist | The resource list. |
| timeout | Timeout to wait. The zero waits forever. |
Set reslist cleanup order.
| reslist | The resource list. |
| mode | Cleanup order mode
APR_RESLIST_CLEANUP_DEFAULT default pool cleanup order
APR_RESLIST_CLEANUP_FIRST use pool pre cleanup
|
< use pool pre cleanup
Definition at line 128 of file apr_sha1.c.
Definition at line 92 of file apr_reslist.h.
Definition at line 93 of file apr_reslist.h.
Definition at line 90 of file apr_reslist.h.
| int min |
Definition at line 90 of file apr_reslist.h.
| apr_uint32_t mode |
Definition at line 175 of file apr_reslist.h.
Definition at line 94 of file apr_reslist.h.
| int int int apr_interval_time_t apr_reslist_constructor apr_reslist_destructor void apr_pool_t* pool |
Definition at line 95 of file apr_reslist.h.
| void * resource |
Definition at line 119 of file apr_reslist.h.
Definition at line 90 of file apr_reslist.h.
Definition at line 136 of file apr_reslist.h.
| int int int apr_interval_time_t ttl |
Definition at line 91 of file apr_reslist.h.
1.9.8