Classes
struct	apr_array_header_t

struct	apr_table_entry_t

Macros
#define	APR_ARRAY_IDX(ary, i, type) (((type *)(ary)->elts)[i])

#define	APR_ARRAY_PUSH(ary, type) (((type )apr_array_push(ary)))

#define	APR_OVERLAP_TABLES_SET (0)

#define	APR_OVERLAP_TABLES_MERGE (1)

#define	APR_OVERLAP_TABLES_ADD (2)

Functions
	APR_DECLARE (const apr_array_header_t ) apr_table_elts(const apr_table_t t)

	APR_DECLARE (int) apr_is_empty_table(const apr_table_t *t)

	APR_DECLARE (apr_array_header_t ) apr_array_make(apr_pool_t p

	APR_DECLARE (void ) apr_array_push(apr_array_header_t arr)

	APR_DECLARE (void) apr_array_clear(apr_array_header_t *arr)

	APR_DECLARE (char ) apr_array_pstrcat(apr_pool_t p

	APR_DECLARE (apr_table_t ) apr_table_make(apr_pool_t p

	APR_DECLARE (const char ) apr_table_get(const apr_table_t t

	APR_DECLARE_NONSTD (int) apr_table_do(apr_table_do_callback_fn_t *comp

Variables
int	nelts

int int	elt_size

const apr_array_header_t *	src

const apr_array_header_t *	arr

const apr_array_header_t *	first

const apr_array_header_t const apr_array_header_t *	second

const apr_array_header_t const char	sep

const apr_table_t *	t

const char *	key

const char const char *	val

const apr_table_t *	overlay

const apr_table_t const apr_table_t *	base

void *	rec

void const apr_table_t void const apr_table_t va_list	vp

const apr_table_t *	b

const apr_table_t unsigned	flags

Detailed Description

Arrays are used to store data which is referenced sequentially or as a stack. Functions are provided to push and pop individual elements as well as to operate on the entire array.

Tables are used to store data which can be referenced by key. Limited capabilities are provided for tables with multiple elements which share a key; while key lookup will return only a single element, iteration is available. Additionally, a table can be compressed to resolve duplicates.

Both arrays and tables may store string or binary data; some features, such as concatenation or merging of elements, work only for string data.

Macro Definition Documentation

◆ APR_ARRAY_IDX

#define APR_ARRAY_IDX	(	ary,
		i,
		type
	)	(((type *)(ary)->elts)[i])

A helper macro for accessing a member of an APR array.

Parameters

ary	the array
i	the index into the array to return
type	the type of the objects stored in the array

Returns: the item at index i

Definition at line 141 of file apr_tables.h.

◆ APR_ARRAY_PUSH

#define APR_ARRAY_PUSH	(	ary,
		type
	)	(((type )apr_array_push(ary)))

A helper macro for pushing elements into an APR array.

Parameters

ary	the array
type	the type of the objects stored in the array

Returns: the location where the new object should be placed

Definition at line 150 of file apr_tables.h.

◆ APR_OVERLAP_TABLES_ADD

#define APR_OVERLAP_TABLES_ADD (2)

flag for overlap to use apr_table_addn

Definition at line 441 of file apr_tables.h.

◆ APR_OVERLAP_TABLES_MERGE

#define APR_OVERLAP_TABLES_MERGE (1)

flag for overlap to use apr_table_mergen

Definition at line 439 of file apr_tables.h.

◆ APR_OVERLAP_TABLES_SET

#define APR_OVERLAP_TABLES_SET (0)

flag for overlap to use apr_table_setn

Definition at line 437 of file apr_tables.h.

Typedef Documentation

◆ apr_array_header_t

typedef struct apr_array_header_t apr_array_header_t

See also: apr_array_header_t

Definition at line 59 of file apr_tables.h.

◆ apr_table_do_callback_fn_t

typedef int() apr_table_do_callback_fn_t(void *rec, const char *key, const char *value)

Declaration prototype for the iterator callback function of apr_table_do() and apr_table_vdo().

Parameters

rec	The data passed as the first argument to apr_table_[v]do()
key	The key from this iteration of the table
value	The value from this iteration of the table

Remarks: Iteration continues while this callback function returns non-zero. To export the callback function for apr_table_[v]do() it must be declared in the _NONSTD convention.

See also: apr_table_do; apr_table_vdo

Definition at line 385 of file apr_tables.h.

◆ apr_table_entry_t

typedef struct apr_table_entry_t apr_table_entry_t

The (opaque) structure for string-content tables.

Definition at line 78 of file apr_tables.h.

◆ apr_table_t

typedef struct apr_table_t apr_table_t

the table abstract data type

Definition at line 56 of file apr_tables.h.

Function Documentation

◆ APR_DECLARE() [1/8]

APR_DECLARE ( apr_array_header_t * )

Create an array.

Parameters

p	The pool to allocate the memory out of
nelts	the number of elements in the initial array
elt_size	The size of each element in the array.

Returns: The new array

Copy the entire array.

Parameters

p	The pool to allocate the copy of the array out of
arr	The array to copy

Returns: An exact copy of the array passed in

Remarks: The alternate apr_array_copy_hdr() copies only the header, and arranges for the elements to be copied if (and only if) the code subsequently does a push or arraycat.

Copy the headers of the array, and arrange for the elements to be copied if and only if the code subsequently does a push or arraycat.

Parameters

p	The pool to allocate the copy of the array out of
arr	The array to copy

Returns: An exact copy of the array passed in

Remarks: The alternate apr_array_copy() copies the entire array.

Append one array to the end of another, creating a new array in the process.

Parameters

p	The pool to allocate the new array out of
first	The array to put first in the new array.
second	The array to put second in the new array.

Returns: A new array containing the data from the two arrays passed in.

◆ APR_DECLARE() [2/8]

APR_DECLARE ( apr_table_t * )

Make a new table.

Parameters

p	The pool to allocate the pool out of
nelts	The number of elements in the initial table.

Returns: The new table.

Warning: This table can only store text data

Create a new table and copy another table into it.

Parameters

p	The pool to allocate the new table out of
t	The table to copy

Returns: A copy of the table passed in

Warning: The table keys and respective values are not copied

Create a new table whose contents are deep copied from the given table. A deep copy operation copies all fields, and makes copies of dynamically allocated memory pointed to by the fields.

Parameters

p	The pool to allocate the new table out of
t	The table to clone

Returns: A deep copy of the table passed in

Merge two tables into one new table.

Parameters

p	The pool to use for the new table
overlay	The first table to put in the new table
base	The table to add at the end of the new table

Returns: A new table containing all of the data from the two passed in

◆ APR_DECLARE() [3/8]

APR_DECLARE ( char * )

Generate a new string from the apr_pool_t containing the concatenated sequence of substrings referenced as elements within the array. The string will be empty if all substrings are empty or null, or if there are no elements in the array. If sep is non-NUL, it will be inserted between elements as a separator.

Parameters

p	The pool to allocate the string out of
arr	The array to generate the string from
sep	The separator to use

Returns: A string containing all of the data in the array.

◆ APR_DECLARE() [4/8]

APR_DECLARE ( const apr_array_header_t * ) const

Get the elements from a table.

Parameters

t The table

Returns: An array containing the contents of the table

◆ APR_DECLARE() [5/8]

APR_DECLARE ( const char * ) const

Get the value associated with a given key from the table. After this call, the data is still in the table.

Parameters

t	The table to search for the key
key	The key to search for (case does not matter)

Returns: The value associated with the key, or NULL if the key does not exist.

Get values associated with a given key from the table. If more than one value exists, return a comma separated list of values. After this call, the data is still in the table.

Parameters

p	The pool to allocate the combined value from, if necessary
t	The table to search for the key
key	The key to search for (case does not matter)

Returns: The value associated with the key, or NULL if the key does not exist.

◆ APR_DECLARE() [6/8]

void const apr_table_t APR_DECLARE ( int ) const

Determine if the table is empty (either NULL or having no elements).

Parameters

t	The table to check

Returns: True if empty, False otherwise

Determine if the array is empty (either NULL or having no elements).

Parameters

a	The array to check

Returns: True if empty, False otherwise

Iterate over a table running the provided function once for every element in the table. The vp varargs parameter must be a list of zero or more (char *) keys followed by a NULL pointer. If zero keys are given, the comp function will be invoked for every element in the table. Otherwise, the function is invoked only for those elements matching the keys specified.

If an invocation of the comp function returns zero, iteration will continue using the next specified key, if any.

Parameters

comp	The function to run
rec	The data to pass as the first argument to the function
t	The table to iterate over
vp	List of zero or more (char *) keys followed by NULL

Returns: FALSE if one of the comp() iterations returned zero; TRUE if all iterations returned non-zero

See also: apr_table_do_callback_fn_t; apr_table_do

◆ APR_DECLARE() [7/8]

APR_DECLARE ( void * )

Add a new element to an array (as a first-in, last-out stack).

Parameters

arr	The array to add an element to.

Returns: Location for the new element in the array.

Remarks: If there are no free spots in the array, then this function will allocate new space for the new element.

Remove an element from an array (as a first-in, last-out stack).

Parameters

arr	The array to remove an element from.

Returns: Location of the element in the array.

Remarks: If there are no elements in the array, NULL is returned.

Look up the value associated with a key in a hash table.

Parameters

ht	The hash table
key	Pointer to the key
klen	Length of the key. Can be APR_HASH_KEY_STRING to use the string length.

Returns: Returns NULL if the key is not present.

Get the current entry's value from the iteration state.

Parameters

hi	The iteration state

Returns: The pointer to the value

Allocate a block of memory from a pool

Parameters

p	The pool to allocate from
size	The amount of memory to allocate

Returns: The allocated memory

Debug version of apr_palloc

Parameters

p	See: apr_palloc
size	See: apr_palloc
file_line	Where the function is called from. This is usually APR_POOL__FILE_LINE__.

Returns: See: apr_palloc

Debug version of apr_pcalloc

Parameters

p	See: apr_pcalloc
size	See: apr_pcalloc
file_line	Where the function is called from. This is usually APR_POOL__FILE_LINE__.

Returns: See: apr_pcalloc

Allocate memory using the same mechanism as the skip list.

Parameters

sl	The skip list
size	The amount to allocate

Remarks: If a pool was provided to apr_skiplist_init(), memory will be allocated from the pool or from a free list maintained with the skip list. Otherwise, memory will be allocated using the C standard library heap functions.

Return the next matching element in the skip list using the specified comparison function.

Parameters

sl	The skip list
data	The value to search for
iter	A pointer to the returned skip list node representing the element found
func	The comparison function to use

Return the next matching element in the skip list using the current comparison function.

Parameters

sl	The skip list
data	The value to search for
iter	A pointer to the returned skip list node representing the element found

Return the last matching element in the skip list using the specified comparison function.

Parameters

sl	The skip list
data	The value to search for
iter	A pointer to the returned skip list node representing the element found
comp	The comparison function to use

Return the last matching element in the skip list using the current comparison function.

Parameters

sl	The skip list
data	The value to search for
iter	A pointer to the returned skip list node representing the element found

Return the next element in the skip list.

Parameters

sl	The skip list
iter	On entry, a pointer to the skip list node to start with; on return, a pointer to the skip list node representing the element returned

Remarks: If iter points to a NULL value on entry, NULL will be returned.

Return the previous element in the skip list.

Parameters

sl	The skip list
iter	On entry, a pointer to the skip list node to start with; on return, a pointer to the skip list node representing the element returned

Remarks: If iter points to a NULL value on entry, NULL will be returned.

Return the element of the skip list node

Parameters

iter	The skip list node

Return the first element in the skip list, removing the element from the skip list.

Parameters

sl	The skip list
myfree	A function to be called for the removed element

Remarks: NULL will be returned if there are no elements

Return the first element in the skip list, leaving the element in the skip list.

Parameters

sl	The skip list

Remarks: NULL will be returned if there are no elements

Duplicate a block of memory.

Parameters

p	The pool to allocate from
m	The memory to duplicate
n	The number of bytes to duplicate

Returns: The new block of memory or NULL if m == NULL

Definition at line 70 of file apr_atomic.c.

◆ APR_DECLARE() [8/8]

APR_DECLARE ( void )

Remove all elements from an array.

Parameters

arr	The array to remove all elements from.

Remarks: As the underlying storage is allocated from a pool, no memory is freed by this operation, but is available for reuse.

Concatenate two arrays together.

Parameters

dst	The destination array, and the one to go first in the combined array
src	The source array to add to the destination array

Delete all of the elements from a table.

Parameters

t	The table to clear

Add a key/value pair to a table. If another element already exists with the same key, this will overwrite the old data.

Parameters

t	The table to add the data to.
key	The key to use (case does not matter)
val	The value to add

Remarks: When adding data, this function makes a copy of both the key and the value.

Add a key/value pair to a table. If another element already exists with the same key, this will overwrite the old data.

Parameters

t	The table to add the data to.
key	The key to use (case does not matter)
val	The value to add

Warning: When adding data, this function does not make a copy of the key or the value, so care should be taken to ensure that the values will not change after they have been added..

Remove data from the table.

Parameters

t	The table to remove data from
key	The key of the data being removed (case does not matter)

Add data to a table by merging the value with data that has already been stored. The merging is done by concatenating the two values, separated by the string ", ".

Parameters

t	The table to search for the data
key	The key to merge data for (case does not matter)
val	The data to add

Remarks: If the key is not found, then this function acts like apr_table_add()

Add data to a table by merging the value with data that has already been stored. The merging is done by concatenating the two values, separated by the string ", ".

Parameters

t	The table to search for the data
key	The key to merge data for (case does not matter)
val	The data to add

Remarks: If the key is not found, then this function acts like apr_table_addn()

Add data to a table, regardless of whether there is another element with the same key.

Parameters

t	The table to add to
key	The key to use
val	The value to add.

Remarks: When adding data, this function makes a copy of both the key and the value.

Add data to a table, regardless of whether there is another element with the same key.

Parameters

t	The table to add to
key	The key to use
val	The value to add.

Remarks: When adding data, this function does not make a copy of the key or the value, so care should be taken to ensure that the values will not change after they have been added.

For each element in table b, either use setn or mergen to add the data to table a. Which method is used is determined by the flags passed in.

Parameters

a	The table to add the data to.
b	The table to iterate over, adding its data to table a
flags	How to add the table to table a. One of: APR_OVERLAP_TABLES_SET Use apr_table_setn APR_OVERLAP_TABLES_MERGE Use apr_table_mergen APR_OVERLAP_TABLES_ADD Use apr_table_addn

Remarks: When merging duplicates, the two values are concatenated, separated by the string ", ".; This function is highly optimized, and uses less memory and CPU cycles than a function that just loops through table b calling other functions. Conceptually, apr_table_overlap does this:

 apr_array_header_t *barr = apr_table_elts(b);
 apr_table_entry_t *belt = (apr_table_entry_t *)barr->elts;
 int i;

 for (i = 0; i < barr->nelts; ++i) {
     if (flags & APR_OVERLAP_TABLES_MERGE) {
         apr_table_mergen(a, belt[i].key, belt[i].val);
     }
     else if (flags & APR_OVERLAP_TABLES_ADD) {
         apr_table_addn(a, belt[i].key, belt[i].val);
     }
     else {
         apr_table_setn(a, belt[i].key, belt[i].val);
     }
 }

Except that it is more efficient (less space and cpu-time) especially when b has many elements.

Notice the assumptions on the keys and values in b – they must be in an ancestor of a's pool. In practice b and a are usually from the same pool.

Eliminate redundant entries in a table by either overwriting or merging duplicates.

Parameters

t	Table.
flags	APR_OVERLAP_TABLES_MERGE to merge, or APR_OVERLAP_TABLES_SET to overwrite, or APR_OVERLAP_TABLES_ADD to add

Remarks: When merging duplicates, the two values are concatenated, separated by the string ", ".

< File is read-only

< File is executable

< all protections

< File is read-only

< Write by user

<

Deprecated:

See also: APR_FPROT_UWRITE

< Write by group

<

Deprecated:

See also: APR_FPROT_GWRITE

< Write by others

<

Deprecated:

See also: APR_FPROT_WWRITE

< Write by user

<

Deprecated:

See also: APR_FPROT_UWRITE

< Write by group

<

Deprecated:

See also: APR_FPROT_GWRITE

< Write by others

<

Deprecated:

See also: APR_FPROT_WWRITE

< File is executable

< Execute by user

<

Deprecated:

See also: APR_FPROT_UEXECUTE

< Execute by group

<

Deprecated:

See also: APR_FPROT_GEXECUTE

< Execute by others

<

Deprecated:

See also: APR_FPROT_WEXECUTE

< Execute by user

<

Deprecated:

See also: APR_FPROT_UEXECUTE

< Execute by group

<

Deprecated:

See also: APR_FPROT_GEXECUTE

< Execute by others

<

Deprecated:

See also: APR_FPROT_WEXECUTE

Definition at line 224 of file apr_pools.h.

◆ APR_DECLARE_NONSTD()

APR_DECLARE_NONSTD ( int )

Iterate over a table running the provided function once for every element in the table. The varargs array must be a list of zero or more (char *) keys followed by a NULL pointer. If zero keys are given, the comp function will be invoked for every element in the table. Otherwise, the function is invoked only for those elements matching the keys specified.

If an invocation of the comp function returns zero, iteration will continue using the next specified key, if any.

Parameters

comp	The function to run
rec	The data to pass as the first argument to the function
t	The table to iterate over
...	A varargs array of zero or more (char *) keys followed by NULL

Returns: FALSE if one of the comp() iterations returned zero; TRUE if all iterations returned non-zero

See also: apr_table_do_callback_fn_t; apr_table_vdo

Definition at line 707 of file readwrite.c.

Variable Documentation

◆ arr

const apr_array_header_t * arr

Definition at line 187 of file apr_tables.h.

◆ b

const apr_table_t* b

Definition at line 485 of file apr_tables.h.

◆ base

const apr_table_t const apr_table_t* base

Definition at line 372 of file apr_tables.h.

◆ elt_size

int int elt_size

Definition at line 122 of file apr_tables.h.

◆ first

const apr_array_header_t* first

Definition at line 207 of file apr_tables.h.

◆ flags

unsigned flags

Definition at line 486 of file apr_tables.h.

◆ key

const char * key

Definition at line 268 of file apr_tables.h.

◆ nelts

int nelts

Definition at line 122 of file apr_tables.h.

◆ overlay

const apr_table_t* overlay

Definition at line 371 of file apr_tables.h.

◆ rec

void const apr_table_t void * rec

Definition at line 408 of file apr_tables.h.

◆ second

const apr_array_header_t const apr_array_header_t* second

Definition at line 208 of file apr_tables.h.

◆ sep

const apr_array_header_t const char sep

Definition at line 223 of file apr_tables.h.

◆ src

const apr_array_header_t* src

Definition at line 175 of file apr_tables.h.

◆ t

void const apr_table_t void const apr_table_t * t

Definition at line 242 of file apr_tables.h.

◆ val

const char const char * val

Definition at line 292 of file apr_tables.h.

◆ vp

void const apr_table_t void const apr_table_t va_list vp

Definition at line 434 of file apr_tables.h.

Functions
	APR_DECLARE (const apr_array_header_t ) apr_table_elts(const apr_table_t t)

	APR_DECLARE (int) apr_is_empty_table(const apr_table_t *t)

	APR_DECLARE (apr_array_header_t ) apr_array_make(apr_pool_t p

	APR_DECLARE (void ) apr_array_push(apr_array_header_t arr)

	APR_DECLARE (void) apr_array_clear(apr_array_header_t *arr)

	APR_DECLARE (char ) apr_array_pstrcat(apr_pool_t p

	APR_DECLARE (apr_table_t ) apr_table_make(apr_pool_t p

	APR_DECLARE (const char ) apr_table_get(const apr_table_t t

	APR_DECLARE_NONSTD (int) apr_table_do(apr_table_do_callback_fn_t *comp

Typedefs
typedef struct apr_table_t	apr_table_t

typedef struct apr_array_header_t	apr_array_header_t

typedef struct apr_table_entry_t	apr_table_entry_t

typedef int()	apr_table_do_callback_fn_t(void rec, const char key, const char *value)

Classes

Macros

Typedefs

Functions

Variables

Detailed Description

Macro Definition Documentation

◆ APR_ARRAY_IDX

◆ APR_ARRAY_PUSH

◆ APR_OVERLAP_TABLES_ADD

◆ APR_OVERLAP_TABLES_MERGE

◆ APR_OVERLAP_TABLES_SET

Typedef Documentation

◆ apr_array_header_t

◆ apr_table_do_callback_fn_t

◆ apr_table_entry_t

◆ apr_table_t

Function Documentation

◆ APR_DECLARE() [1/8]

◆ APR_DECLARE() [2/8]

◆ APR_DECLARE() [3/8]

◆ APR_DECLARE() [4/8]

◆ APR_DECLARE() [5/8]

◆ APR_DECLARE() [6/8]

◆ APR_DECLARE() [7/8]

◆ APR_DECLARE() [8/8]

◆ APR_DECLARE_NONSTD()

Variable Documentation

◆ arr

◆ b

◆ base

◆ elt_size

◆ first

◆ flags

◆ key

◆ nelts

◆ overlay

◆ rec

◆ second

◆ sep

◆ src

◆ t

◆ val

◆ vp