Windows NT KAMIDAKI 10.0 build 19045 (Windows 10) AMD64
Apache/2.4.58 (Win64) OpenSSL/3.1.3 PHP/8.3.9
Server IP : 192.168.3.16 & Your IP : 216.73.216.204
Domains :
Cant Read [ /etc/named.conf ]
User : SISTEMA
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
C: /
xampp /
apache /
include /
Delete
Unzip
Name
Size
Permission
Date
Action
ap_compat.h
1.08
KB
-rw-rw-rw-
2006-07-12 00:33
ap_config.h
6.65
KB
-rw-rw-rw-
2012-08-15 03:59
ap_config_layout.h
1.21
KB
-rw-rw-rw-
2022-01-02 15:34
ap_expr.h
14.09
KB
-rw-rw-rw-
2020-02-21 02:33
ap_hooks.h
6.01
KB
-rw-rw-rw-
2011-09-23 22:08
ap_listen.h
5.85
KB
-rw-rw-rw-
2016-05-30 23:26
ap_mmn.h
39.26
KB
-rw-rw-rw-
2023-08-29 11:23
ap_mpm.h
10.68
KB
-rw-rw-rw-
2020-04-23 16:32
ap_provider.h
3.55
KB
-rw-rw-rw-
2012-07-03 23:29
ap_regex.h
11.43
KB
-rw-rw-rw-
2022-02-28 13:56
ap_regkey.h
9.18
KB
-rw-rw-rw-
2011-09-23 17:38
ap_release.h
3.15
KB
-rw-rw-rw-
2023-10-16 17:28
ap_slotmem.h
7.26
KB
-rw-rw-rw-
2013-11-17 22:10
ap_socache.h
9.39
KB
-rw-rw-rw-
2012-02-11 00:47
apache_noprobes.h
15.93
KB
-rw-rw-rw-
2012-04-05 00:11
apr.h
18.28
KB
-rw-rw-rw-
2023-03-27 15:53
apr_allocator.h
6.25
KB
-rw-rw-rw-
2018-08-25 17:48
apr_anylock.h
5.06
KB
-rw-rw-rw-
2007-01-15 21:00
apr_atomic.h
6.25
KB
-rw-rw-rw-
2018-09-17 22:20
apr_base64.h
3.86
KB
-rw-rw-rw-
2012-12-23 00:24
apr_buckets.h
64.71
KB
-rw-rw-rw-
2021-09-18 17:25
apr_crypto.h
20.18
KB
-rw-rw-rw-
2017-06-14 00:28
apr_cstr.h
11.42
KB
-rw-rw-rw-
2016-12-03 22:49
apr_date.h
3.57
KB
-rw-rw-rw-
2007-01-15 21:00
apr_dbd.h
23.88
KB
-rw-rw-rw-
2017-04-02 21:57
apr_dbm.h
8.62
KB
-rw-rw-rw-
2008-11-21 08:20
apr_dso.h
2.73
KB
-rw-rw-rw-
2006-08-03 14:55
apr_encode.h
30.98
KB
-rw-rw-rw-
2022-10-18 11:38
apr_env.h
2.12
KB
-rw-rw-rw-
2009-09-26 00:07
apr_errno.h
55.08
KB
-rw-rw-rw-
2016-03-03 18:11
apr_escape.h
17.65
KB
-rw-rw-rw-
2018-08-26 14:24
apr_escape_test_char.h
1.4
KB
-rw-rw-rw-
2023-03-27 15:53
apr_file_info.h
17.59
KB
-rw-rw-rw-
2018-08-26 14:01
apr_file_io.h
43.11
KB
-rw-rw-rw-
2017-03-30 23:53
apr_fnmatch.h
6.23
KB
-rw-rw-rw-
2014-04-15 17:55
apr_general.h
7.36
KB
-rw-rw-rw-
2018-08-26 14:01
apr_getopt.h
6
KB
-rw-rw-rw-
2006-08-03 14:55
apr_global_mutex.h
7.38
KB
-rw-rw-rw-
2017-04-08 01:20
apr_hash.h
10.36
KB
-rw-rw-rw-
2020-11-08 10:13
apr_hooks.h
12.71
KB
-rw-rw-rw-
2013-10-03 17:32
apr_inherit.h
2.14
KB
-rw-rw-rw-
2013-10-03 17:29
apr_ldap.h
5.76
KB
-rw-rw-rw-
2023-01-24 11:36
apr_ldap_init.h
5.81
KB
-rw-rw-rw-
2009-02-19 10:04
apr_ldap_option.h
8.65
KB
-rw-rw-rw-
2009-02-19 10:04
apr_ldap_rebind.h
3.19
KB
-rw-rw-rw-
2009-02-19 10:04
apr_ldap_url.h
3.83
KB
-rw-rw-rw-
2009-02-19 10:04
apr_lib.h
8.47
KB
-rw-rw-rw-
2014-01-16 22:26
apr_md4.h
4.55
KB
-rw-rw-rw-
2007-01-15 21:00
apr_md5.h
6.37
KB
-rw-rw-rw-
2012-07-06 15:41
apr_memcache.h
17.25
KB
-rw-rw-rw-
2010-11-26 16:39
apr_mmap.h
5.18
KB
-rw-rw-rw-
2013-10-03 17:29
apr_network_io.h
36.95
KB
-rw-rw-rw-
2019-05-04 18:44
apr_optional.h
2.8
KB
-rw-rw-rw-
2007-01-15 21:00
apr_optional_hooks.h
3.9
KB
-rw-rw-rw-
2013-10-03 17:32
apr_perms_set.h
1.93
KB
-rw-rw-rw-
2014-04-28 16:08
apr_poll.h
21.04
KB
-rw-rw-rw-
2016-03-25 03:19
apr_pools.h
31.73
KB
-rw-rw-rw-
2022-06-18 00:09
apr_portable.h
20.56
KB
-rw-rw-rw-
2018-08-26 14:01
apr_proc_mutex.h
7.04
KB
-rw-rw-rw-
2017-04-08 01:20
apr_queue.h
4.12
KB
-rw-rw-rw-
2013-10-03 17:32
apr_random.h
5.07
KB
-rw-rw-rw-
2007-07-21 06:16
apr_redis.h
16.07
KB
-rw-rw-rw-
2017-09-27 20:02
apr_reslist.h
7.19
KB
-rw-rw-rw-
2013-10-03 17:32
apr_ring.h
19.28
KB
-rw-rw-rw-
2022-01-06 14:11
apr_rmm.h
4.8
KB
-rw-rw-rw-
2007-01-15 21:00
apr_sdbm.h
6.14
KB
-rw-rw-rw-
2007-10-23 13:59
apr_sha1.h
3.91
KB
-rw-rw-rw-
2007-01-15 21:00
apr_shm.h
9.48
KB
-rw-rw-rw-
2014-04-28 17:15
apr_signal.h
2.8
KB
-rw-rw-rw-
2007-08-05 19:48
apr_siphash.h
6.16
KB
-rw-rw-rw-
2017-06-15 00:00
apr_skiplist.h
14.56
KB
-rw-rw-rw-
2018-08-25 17:48
apr_strings.h
14.92
KB
-rw-rw-rw-
2018-08-26 14:01
apr_strmatch.h
2.69
KB
-rw-rw-rw-
2007-01-15 21:00
apr_support.h
1.65
KB
-rw-rw-rw-
2006-08-03 14:55
apr_tables.h
19.4
KB
-rw-rw-rw-
2020-11-08 09:24
apr_thread_cond.h
5.53
KB
-rw-rw-rw-
2007-06-29 21:20
apr_thread_mutex.h
4.51
KB
-rw-rw-rw-
2017-04-08 01:20
apr_thread_pool.h
11.14
KB
-rw-rw-rw-
2008-05-07 23:45
apr_thread_proc.h
36.11
KB
-rw-rw-rw-
2019-03-08 16:52
apr_thread_rwlock.h
4.78
KB
-rw-rw-rw-
2006-08-03 14:55
apr_time.h
7.62
KB
-rw-rw-rw-
2016-03-05 03:40
apr_uri.h
6.61
KB
-rw-rw-rw-
2009-01-07 22:39
apr_user.h
5.34
KB
-rw-rw-rw-
2013-10-03 17:29
apr_uuid.h
2.13
KB
-rw-rw-rw-
2007-01-15 21:00
apr_version.h
5.44
KB
-rw-rw-rw-
2023-04-13 11:38
apr_want.h
3.01
KB
-rw-rw-rw-
2012-08-15 00:48
apr_xlate.h
6.42
KB
-rw-rw-rw-
2007-01-15 21:00
apr_xml.h
12.54
KB
-rw-rw-rw-
2016-06-14 01:57
apu.h
4.76
KB
-rw-rw-rw-
2023-01-24 11:36
apu_errno.h
5.49
KB
-rw-rw-rw-
2009-01-07 22:35
apu_version.h
4.33
KB
-rw-rw-rw-
2023-02-01 09:56
apu_want.h
1.55
KB
-rw-rw-rw-
2023-01-24 11:36
cache_common.h
2.02
KB
-rw-rw-rw-
2013-05-29 00:30
expat.h
43.55
KB
-rw-rw-rw-
2022-10-25 19:09
heartbeat.h
1.62
KB
-rw-rw-rw-
2014-06-17 16:06
http_config.h
57.78
KB
-rw-rw-rw-
2022-02-23 16:39
http_connection.h
7.15
KB
-rw-rw-rw-
2021-09-26 18:11
http_core.h
37.25
KB
-rw-rw-rw-
2023-08-29 11:23
http_log.h
36.82
KB
-rw-rw-rw-
2016-08-25 16:48
http_main.h
3.25
KB
-rw-rw-rw-
2012-03-26 02:24
http_protocol.h
42.06
KB
-rw-rw-rw-
2022-06-01 16:34
http_request.h
26.34
KB
-rw-rw-rw-
2021-08-10 12:27
http_ssl.h
14.93
KB
-rw-rw-rw-
2022-08-22 00:26
http_vhost.h
4.61
KB
-rw-rw-rw-
2021-05-27 17:08
httpd.h
94.69
KB
-rw-rw-rw-
2022-03-09 16:04
mod_auth.h
4.55
KB
-rw-rw-rw-
2020-02-21 02:33
mod_cache.h
7.27
KB
-rw-rw-rw-
2011-12-03 20:02
mod_cgi.h
2.5
KB
-rw-rw-rw-
2011-09-23 17:38
mod_core.h
3.43
KB
-rw-rw-rw-
2012-09-24 13:49
mod_dav.h
100.22
KB
-rw-rw-rw-
2023-01-09 16:52
mod_dbd.h
4.18
KB
-rw-rw-rw-
2011-09-23 17:38
mod_http2.h
4.69
KB
-rw-rw-rw-
2023-08-29 11:23
mod_include.h
4.01
KB
-rw-rw-rw-
2011-09-23 17:38
mod_log_config.h
2.5
KB
-rw-rw-rw-
2011-09-23 17:38
mod_proxy.h
64.99
KB
-rw-rw-rw-
2023-03-31 18:33
mod_request.h
1.65
KB
-rw-rw-rw-
2011-02-18 20:40
mod_rewrite.h
1.41
KB
-rw-rw-rw-
2014-01-23 16:33
mod_so.h
1.23
KB
-rw-rw-rw-
2011-11-30 12:21
mod_ssl.h
4.99
KB
-rw-rw-rw-
2019-07-30 15:23
mod_ssl_openssl.h
4.79
KB
-rw-rw-rw-
2019-07-30 15:23
mod_status.h
2.45
KB
-rw-rw-rw-
2006-07-12 00:33
mod_watchdog.h
7.55
KB
-rw-rw-rw-
2014-09-05 18:19
mpm_common.h
17.39
KB
-rw-rw-rw-
2021-08-10 12:43
os.h
4.5
KB
-rw-rw-rw-
2021-04-21 05:10
scoreboard.h
9.98
KB
-rw-rw-rw-
2020-02-21 02:33
util_cfgtree.h
3.17
KB
-rw-rw-rw-
2011-09-23 17:38
util_charset.h
2.28
KB
-rw-rw-rw-
2014-11-01 11:19
util_cookies.h
4.99
KB
-rw-rw-rw-
2012-01-09 15:18
util_ebcdic.h
2.78
KB
-rw-rw-rw-
2014-11-01 11:19
util_fcgi.h
10.02
KB
-rw-rw-rw-
2020-02-21 02:33
util_filter.h
26.46
KB
-rw-rw-rw-
2013-04-15 16:37
util_ldap.h
18.33
KB
-rw-rw-rw-
2023-07-07 16:03
util_md5.h
2.19
KB
-rw-rw-rw-
2014-07-17 02:11
util_mutex.h
9.29
KB
-rw-rw-rw-
2011-10-09 22:35
util_script.h
9.8
KB
-rw-rw-rw-
2012-01-09 15:18
util_time.h
4.22
KB
-rw-rw-rw-
2023-07-18 01:16
util_varbuf.h
8.28
KB
-rw-rw-rw-
2014-07-19 21:22
util_xml.h
1.36
KB
-rw-rw-rw-
2014-07-19 21:22
zconf.h
16.83
KB
-rw-rw-rw-
2023-04-18 01:35
zlib.h
96.4
KB
-rw-rw-rw-
2023-08-18 12:45
Save
Rename
/* Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed with * this work for additional information regarding copyright ownership. * The ASF licenses this file to You under the Apache License, Version 2.0 * (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #ifndef APR_TABLES_H #define APR_TABLES_H /** * @file apr_tables.h * @brief APR Table library */ #include "apr.h" #include "apr_pools.h" #if APR_HAVE_STDARG_H #include <stdarg.h> /* for va_list */ #endif #ifdef __cplusplus extern "C" { #endif /* __cplusplus */ /** * @defgroup apr_tables Table and Array Functions * @ingroup APR * 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. * @{ */ /** the table abstract data type */ typedef struct apr_table_t apr_table_t; /** @see apr_array_header_t */ typedef struct apr_array_header_t apr_array_header_t; /** An opaque array type */ struct apr_array_header_t { /** The pool the array is allocated out of */ apr_pool_t *pool; /** The amount of memory allocated for each element of the array */ int elt_size; /** The number of active elements in the array */ int nelts; /** The number of elements allocated in the array */ int nalloc; /** The elements in the array */ char *elts; }; /** * The (opaque) structure for string-content tables. */ typedef struct apr_table_entry_t apr_table_entry_t; /** The type for each entry in a string-content table */ struct apr_table_entry_t { /** The key for the current table entry */ char *key; /* maybe NULL in future; * check when iterating thru table_elts */ /** The value for the current table entry */ char *val; /** A checksum for the key, for use by the apr_table internals */ apr_uint32_t key_checksum; }; /** * Get the elements from a table. * @param t The table * @return An array containing the contents of the table */ APR_DECLARE(const apr_array_header_t *) apr_table_elts(const apr_table_t *t); /** * Determine if the table is empty (either NULL or having no elements). * @param t The table to check * @return True if empty, False otherwise */ APR_DECLARE(int) apr_is_empty_table(const apr_table_t *t); /** * Determine if the array is empty (either NULL or having no elements). * @param a The array to check * @return True if empty, False otherwise */ APR_DECLARE(int) apr_is_empty_array(const apr_array_header_t *a); /** * Create an array. * @param p The pool to allocate the memory out of * @param nelts the number of elements in the initial array * @param elt_size The size of each element in the array. * @return The new array */ APR_DECLARE(apr_array_header_t *) apr_array_make(apr_pool_t *p, int nelts, int elt_size); /** * Add a new element to an array (as a first-in, last-out stack). * @param arr The array to add an element to. * @return Location for the new element in the array. * @remark If there are no free spots in the array, then this function will * allocate new space for the new element. */ APR_DECLARE(void *) apr_array_push(apr_array_header_t *arr); /** A helper macro for accessing a member of an APR array. * * @param ary the array * @param i the index into the array to return * @param type the type of the objects stored in the array * * @return the item at index i */ #define APR_ARRAY_IDX(ary,i,type) (((type *)(ary)->elts)[i]) /** A helper macro for pushing elements into an APR array. * * @param ary the array * @param type the type of the objects stored in the array * * @return the location where the new object should be placed */ #define APR_ARRAY_PUSH(ary,type) (*((type *)apr_array_push(ary))) /** * Remove an element from an array (as a first-in, last-out stack). * @param arr The array to remove an element from. * @return Location of the element in the array. * @remark If there are no elements in the array, NULL is returned. */ APR_DECLARE(void *) apr_array_pop(apr_array_header_t *arr); /** * Remove all elements from an array. * @param arr The array to remove all elements from. * @remark As the underlying storage is allocated from a pool, no * memory is freed by this operation, but is available for reuse. */ APR_DECLARE(void) apr_array_clear(apr_array_header_t *arr); /** * Concatenate two arrays together. * @param dst The destination array, and the one to go first in the combined * array * @param src The source array to add to the destination array */ APR_DECLARE(void) apr_array_cat(apr_array_header_t *dst, const apr_array_header_t *src); /** * Copy the entire array. * @param p The pool to allocate the copy of the array out of * @param arr The array to copy * @return An exact copy of the array passed in * @remark 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. */ APR_DECLARE(apr_array_header_t *) apr_array_copy(apr_pool_t *p, const apr_array_header_t *arr); /** * 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. * @param p The pool to allocate the copy of the array out of * @param arr The array to copy * @return An exact copy of the array passed in * @remark The alternate apr_array_copy() copies the *entire* array. */ APR_DECLARE(apr_array_header_t *) apr_array_copy_hdr(apr_pool_t *p, const apr_array_header_t *arr); /** * Append one array to the end of another, creating a new array in the process. * @param p The pool to allocate the new array out of * @param first The array to put first in the new array. * @param second The array to put second in the new array. * @return A new array containing the data from the two arrays passed in. */ APR_DECLARE(apr_array_header_t *) apr_array_append(apr_pool_t *p, const apr_array_header_t *first, const apr_array_header_t *second); /** * 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. * @param p The pool to allocate the string out of * @param arr The array to generate the string from * @param sep The separator to use * @return A string containing all of the data in the array. */ APR_DECLARE(char *) apr_array_pstrcat(apr_pool_t *p, const apr_array_header_t *arr, const char sep); /** * Make a new table. * @param p The pool to allocate the pool out of * @param nelts The number of elements in the initial table. * @return The new table. * @warning This table can only store text data */ APR_DECLARE(apr_table_t *) apr_table_make(apr_pool_t *p, int nelts); /** * Create a new table and copy another table into it. * @param p The pool to allocate the new table out of * @param t The table to copy * @return A copy of the table passed in * @warning The table keys and respective values are not copied */ APR_DECLARE(apr_table_t *) apr_table_copy(apr_pool_t *p, const apr_table_t *t); /** * 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. * @param p The pool to allocate the new table out of * @param t The table to clone * @return A deep copy of the table passed in */ APR_DECLARE(apr_table_t *) apr_table_clone(apr_pool_t *p, const apr_table_t *t); /** * Delete all of the elements from a table. * @param t The table to clear */ APR_DECLARE(void) apr_table_clear(apr_table_t *t); /** * Get the value associated with a given key from the table. After this call, * the data is still in the table. * @param t The table to search for the key * @param key The key to search for (case does not matter) * @return The value associated with the key, or NULL if the key does not exist. */ APR_DECLARE(const char *) apr_table_get(const apr_table_t *t, const char *key); /** * 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. * @param p The pool to allocate the combined value from, if necessary * @param t The table to search for the key * @param key The key to search for (case does not matter) * @return The value associated with the key, or NULL if the key does not exist. */ APR_DECLARE(const char *) apr_table_getm(apr_pool_t *p, const apr_table_t *t, const char *key); /** * Add a key/value pair to a table. If another element already exists with the * same key, this will overwrite the old data. * @param t The table to add the data to. * @param key The key to use (case does not matter) * @param val The value to add * @remark When adding data, this function makes a copy of both the key and the * value. */ APR_DECLARE(void) apr_table_set(apr_table_t *t, const char *key, const char *val); /** * Add a key/value pair to a table. If another element already exists with the * same key, this will overwrite the old data. * @param t The table to add the data to. * @param key The key to use (case does not matter) * @param 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.. */ APR_DECLARE(void) apr_table_setn(apr_table_t *t, const char *key, const char *val); /** * Remove data from the table. * @param t The table to remove data from * @param key The key of the data being removed (case does not matter) */ APR_DECLARE(void) apr_table_unset(apr_table_t *t, const char *key); /** * 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 ", ". * @param t The table to search for the data * @param key The key to merge data for (case does not matter) * @param val The data to add * @remark If the key is not found, then this function acts like apr_table_add() */ APR_DECLARE(void) apr_table_merge(apr_table_t *t, const char *key, const char *val); /** * 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 ", ". * @param t The table to search for the data * @param key The key to merge data for (case does not matter) * @param val The data to add * @remark If the key is not found, then this function acts like apr_table_addn() */ APR_DECLARE(void) apr_table_mergen(apr_table_t *t, const char *key, const char *val); /** * Add data to a table, regardless of whether there is another element with the * same key. * @param t The table to add to * @param key The key to use * @param val The value to add. * @remark When adding data, this function makes a copy of both the key and the * value. */ APR_DECLARE(void) apr_table_add(apr_table_t *t, const char *key, const char *val); /** * Add data to a table, regardless of whether there is another element with the * same key. * @param t The table to add to * @param key The key to use * @param val The value to add. * @remark 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. */ APR_DECLARE(void) apr_table_addn(apr_table_t *t, const char *key, const char *val); /** * Merge two tables into one new table. * @param p The pool to use for the new table * @param overlay The first table to put in the new table * @param base The table to add at the end of the new table * @return A new table containing all of the data from the two passed in */ APR_DECLARE(apr_table_t *) apr_table_overlay(apr_pool_t *p, const apr_table_t *overlay, const apr_table_t *base); /** * Declaration prototype for the iterator callback function of apr_table_do() * and apr_table_vdo(). * @param rec The data passed as the first argument to apr_table_[v]do() * @param key The key from this iteration of the table * @param value The value from this iteration of the table * @remark 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 apr_table_do @see apr_table_vdo */ typedef int (apr_table_do_callback_fn_t)(void *rec, const char *key, const char *value); /** * 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 @p 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 @p comp function returns zero, * iteration will continue using the next specified key, if any. * * @param comp The function to run * @param rec The data to pass as the first argument to the function * @param t The table to iterate over * @param ... A varargs array of zero or more (char *) keys followed by NULL * @return FALSE if one of the comp() iterations returned zero; TRUE if all * iterations returned non-zero * @see apr_table_do_callback_fn_t @see apr_table_vdo */ APR_DECLARE_NONSTD(int) apr_table_do(apr_table_do_callback_fn_t *comp, void *rec, const apr_table_t *t, ...) #if defined(__GNUC__) && __GNUC__ >= 4 __attribute__((sentinel)) #endif ; /** * Iterate over a table running the provided function once for every * element in the table. The @p vp varargs parameter must be a * list of zero or more (char *) keys followed by a NULL pointer. If * zero keys are given, the @p 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 @p comp function returns zero, * iteration will continue using the next specified key, if any. * * @param comp The function to run * @param rec The data to pass as the first argument to the function * @param t The table to iterate over * @param vp List of zero or more (char *) keys followed by NULL * @return FALSE if one of the comp() iterations returned zero; TRUE if all * iterations returned non-zero * @see apr_table_do_callback_fn_t @see apr_table_do */ APR_DECLARE(int) apr_table_vdo(apr_table_do_callback_fn_t *comp, void *rec, const apr_table_t *t, va_list vp); /** flag for overlap to use apr_table_setn */ #define APR_OVERLAP_TABLES_SET (0) /** flag for overlap to use apr_table_mergen */ #define APR_OVERLAP_TABLES_MERGE (1) /** flag for overlap to use apr_table_addn */ #define APR_OVERLAP_TABLES_ADD (2) /** * 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. * @param a The table to add the data to. * @param b The table to iterate over, adding its data to table a * @param 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 * @remark When merging duplicates, the two values are concatenated, * separated by the string ", ". * @remark 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: * * <pre> * 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); * } * } * </pre> * * 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. */ APR_DECLARE(void) apr_table_overlap(apr_table_t *a, const apr_table_t *b, unsigned flags); /** * Eliminate redundant entries in a table by either overwriting * or merging duplicates. * * @param t Table. * @param flags APR_OVERLAP_TABLES_MERGE to merge, or * APR_OVERLAP_TABLES_SET to overwrite, or * APR_OVERLAP_TABLES_ADD to add * @remark When merging duplicates, the two values are concatenated, * separated by the string ", ". */ APR_DECLARE(void) apr_table_compress(apr_table_t *t, unsigned flags); /** @} */ #ifdef __cplusplus } #endif #endif /* ! APR_TABLES_H */