#include "apr_private.h"
#include "apr_general.h"
#include "apr_pools.h"
#include "apr_tables.h"
#include "apr_strings.h"
#include "apr_lib.h"
Go to the source code of this file.
|
| static void | make_array_core (apr_array_header_t *res, apr_pool_t *p, int nelts, int elt_size, int clear) |
| |
| | APR_DECLARE (int) |
| |
| | APR_DECLARE (apr_array_header_t *) |
| |
| | APR_DECLARE (void) |
| |
| | APR_DECLARE (void *) |
| |
| static void * | apr_array_push_noclear (apr_array_header_t *arr) |
| |
| static APR_INLINE void | copy_array_hdr_core (apr_array_header_t *res, const apr_array_header_t *arr) |
| |
| | apr_array_copy_hdr (apr_pool_t *p, const apr_array_header_t *arr) |
| |
| | apr_array_append (apr_pool_t *p, const apr_array_header_t *first, const apr_array_header_t *second) |
| |
| | APR_DECLARE (char *) |
| |
| | APR_DECLARE (const apr_array_header_t *) |
| |
| | APR_DECLARE (apr_table_t *) |
| |
| static void | table_reindex (apr_table_t *t) |
| |
| | APR_DECLARE (const char *) |
| |
| | APR_DECLARE_NONSTD (int) |
| |
| static apr_table_entry_t ** | table_mergesort (apr_pool_t *pool, apr_table_entry_t **values, apr_size_t n) |
| |
| static void | apr_table_cat (apr_table_t *t, const apr_table_t *s) |
| |
| static int | table_getm_do (void *v, const char *key, const char *val) |
| |
◆ CASE_MASK
◆ COMPUTE_KEY_CHECKSUM
Value:{ \
} \
} \
} \
}
apr_vformatter_buff_t * c
Definition at line 308 of file apr_tables.c.
◆ TABLE_HASH
◆ TABLE_HASH_SIZE
◆ TABLE_INDEX_IS_INITIALIZED
| #define TABLE_INDEX_IS_INITIALIZED |
( |
|
t, |
|
|
|
i |
|
) |
| ((t)->index_initialized & (1u << (i))) |
◆ TABLE_INDEX_MASK
◆ table_push
◆ TABLE_SET_INDEX_INITIALIZED
| #define TABLE_SET_INDEX_INITIALIZED |
( |
|
t, |
|
|
|
i |
|
) |
| ((t)->index_initialized |= (1u << (i))) |
◆ apr_array_append()
◆ apr_array_copy_hdr()
◆ apr_array_push_noclear()
◆ APR_DECLARE() [1/4]
◆ APR_DECLARE() [2/4]
◆ APR_DECLARE() [3/4]
◆ APR_DECLARE() [4/4]
◆ apr_table_cat()
◆ copy_array_hdr_core()
◆ make_array_core()
◆ table_getm_do()
The most common case is a single header, and this is covered by a fast path that doesn't allocate any memory. On the second and subsequent header, an array is created and the array concatenated together to form the final value.
Definition at line 1254 of file apr_tables.c.
◆ table_mergesort()
◆ table_reindex()