-*- mode: troff; coding: utf-8 -*-
Automatically generated by Pod::Man 5.01 (Pod::Simple 3.43)
Standard preamble:
========================================================================
..
.... \*(C` and \*(C' are quotes in nroff, nothing in troff, for use with C<>.
. ds C` "" . ds C' "" 'br\} . ds C` . ds C' 'br\}
Escape single quotes in literal strings from groff's Unicode transform.
If the F register is >0, we'll generate index entries on stderr for
titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
entries marked with X<> in POD. Of course, you'll have to process the
output yourself in some meaningful fashion.
Avoid warning from groff about undefined register 'F'.
.. .nr rF 0 . if \nF \{\ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{\ . nr % 0 . nr F 2 . \} . \} .\} .rr rF ========================================================================
Title "OPENSSL_LH_COMPFUNC 3"
way too many mistakes in technical documents.
\fBlh_\f(BITYPE_new() creates a new LHASH_OF(\f(BITYPE) structure to store arbitrary data entries, and specifies the 'hash' and 'compare' callbacks to be used in organising the table's entries. The hash callback takes a pointer to a table entry as its argument and returns an unsigned long hash value for its key field. The hash value is normally truncated to a power of 2, so make sure that your hash function returns well mixed low order bits. The compare callback takes two arguments (pointers to two hash table entries), and returns 0 if their keys are equal, nonzero otherwise.
If your hash table will contain items of some particular type and the hash and \fIcompare callbacks hash/compare these types, then the \fBIMPLEMENT_LHASH_HASH_FN and IMPLEMENT_LHASH_COMP_FN macros can be used to create callback wrappers of the prototypes required by \fBlh_\f(BITYPE_new() as shown in this example:
.Vb 11 /* * Implement the hash and compare functions; "stuff" can be any word. */ static unsigned long stuff_hash(const TYPE *a) { ... } static int stuff_cmp(const TYPE *a, const TYPE *b) { ... } \& /* * Implement the wrapper functions. */ static IMPLEMENT_LHASH_HASH_FN(stuff, TYPE) static IMPLEMENT_LHASH_COMP_FN(stuff, TYPE) .Ve
If the type is going to be used in several places, the following macros can be used in a common header file to declare the function wrappers:
.Vb 2 DECLARE_LHASH_HASH_FN(stuff, TYPE) DECLARE_LHASH_COMP_FN(stuff, TYPE) .Ve
Then a hash table of \f(BITYPE objects can be created using this:
.Vb 1 LHASH_OF(TYPE) *htable; \& htable = B<lh_I<TYPE>_new>(LHASH_HASH_FN(stuff), LHASH_COMP_FN(stuff)); .Ve
\fBlh_\f(BITYPE_free() frees the LHASH_OF(\f(BITYPE) structure \fItable. Allocated hash table entries will not be freed; consider using lh_\f(BITYPE_doall() to deallocate any remaining entries in the hash table (see below). If the argument is NULL, nothing is done.
\fBlh_\f(BITYPE_flush() empties the LHASH_OF(\f(BITYPE) structure table. New entries can be added to the flushed table. Allocated hash table entries will not be freed; consider using lh_\f(BITYPE_doall() to deallocate any remaining entries in the hash table (see below).
\fBlh_\f(BITYPE_insert() inserts the structure pointed to by data into \fItable. If there already is an entry with the same key, the old value is replaced. Note that lh_\f(BITYPE_insert() stores pointers, the data are not copied.
\fBlh_\f(BITYPE_delete() deletes an entry from table.
\fBlh_\f(BITYPE_retrieve() looks up an entry in table. Normally, data is a structure with the key field(s) set; the function will return a pointer to a fully populated structure.
\fBlh_\f(BITYPE_doall() will, for every entry in the hash table, call \fIfunc with the data item as its parameter. For example:
.Vb 2 /* Cleans up resources belonging to \*(Aqa\*(Aq (this is implemented elsewhere) */ void TYPE_cleanup_doall(TYPE *a); \& /* Implement a prototype-compatible wrapper for "TYPE_cleanup" */ IMPLEMENT_LHASH_DOALL_FN(TYPE_cleanup, TYPE) \& /* Call "TYPE_cleanup" against all items in a hash table. */ lh_TYPE_doall(hashtable, LHASH_DOALL_FN(TYPE_cleanup)); \& /* Then the hash table itself can be deallocated */ lh_TYPE_free(hashtable); .Ve
\fBlh_\f(BITYPE_doall_arg() is the same as lh_\f(BITYPE_doall() except that \fIfunc will be called with arg as the second argument and func should be of type LHASH_DOALL_ARG_FN(\f(BITYPE) (a callback prototype that is passed both the table entry and an extra argument). As with \fBlh_doall(), you can instead choose to declare your callback with a prototype matching the types you are dealing with and use the declare/implement macros to create compatible wrappers that cast variables before calling your type-specific callbacks. An example of this is demonstrated here (printing all hash table entries to a BIO that is provided by the caller):
.Vb 2 /* Prints item \*(Aqa\*(Aq to \*(Aqoutput_bio\*(Aq (this is implemented elsewhere) */ void TYPE_print_doall_arg(const TYPE *a, BIO *output_bio); \& /* Implement a prototype-compatible wrapper for "TYPE_print" */ static IMPLEMENT_LHASH_DOALL_ARG_FN(TYPE, const TYPE, BIO) \& /* Print out the entire hashtable to a particular BIO */ lh_TYPE_doall_arg(hashtable, LHASH_DOALL_ARG_FN(TYPE_print), BIO, logging_bio); .Ve
Note that it is by default not safe to use lh_\f(BITYPE_delete() inside a callback passed to lh_\f(BITYPE_doall() or lh_\f(BITYPE_doall_arg(). The reason for this is that deleting an item from the hash table may result in the hash table being contracted to a smaller size and rehashed. \fBlh_\f(BITYPE_doall() and lh_\f(BITYPE_doall_arg() are unsafe and will exhibit undefined behaviour under these conditions, as these functions assume the hash table size and bucket pointers do not change during the call.
If it is desired to use lh_\f(BITYPE_doall() or lh_\f(BITYPE_doall_arg() with \fBlh_\f(BITYPE_delete(), it is essential that you call \fBlh_\f(BITYPE_set_down_load() with a down_load argument of 0 first. This disables hash table contraction and guarantees that it will be safe to delete items from a hash table during a call to lh_\f(BITYPE_doall() or \fBlh_\f(BITYPE_doall_arg().
It is never safe to call lh_\f(BITYPE_insert() during a call to \fBlh_\f(BITYPE_doall() or lh_\f(BITYPE_doall_arg().
\fBlh_\f(BITYPE_error() can be used to determine if an error occurred in the last operation.
\fBlh_\f(BITYPE_num_items() returns the number of items in the hash table.
\fBlh_\f(BITYPE_get_down_load() and lh_\f(BITYPE_set_down_load() get and set the factor used to determine when the hash table is contracted. The factor is the load factor at or below which hash table contraction will occur, multiplied by \fBLH_LOAD_MULT, where the load factor is the number of items divided by the number of nodes. Setting this value to 0 disables hash table contraction.
\fBOPENSSL_LH_new() is the same as the lh_\f(BITYPE_new() except that it is not type specific. So instead of returning an LHASH_OF(\f(BITYPE) value it returns a void *. In the same way the functions OPENSSL_LH_free(), \fBOPENSSL_LH_flush(), OPENSSL_LH_insert(), OPENSSL_LH_delete(), \fBOPENSSL_LH_retrieve(), OPENSSL_LH_doall(), OPENSSL_LH_doall_arg(), \fBOPENSSL_LH_num_items(), OPENSSL_LH_get_down_load(), OPENSSL_LH_set_down_load() and OPENSSL_LH_error() are equivalent to the similarly named lh_\f(BITYPE functions except that they return or use a void * where the equivalent \fBlh_\f(BITYPE function returns or uses a \f(BITYPE * or LHASH_OF(\f(BITYPE) *. \fBlh_\f(BITYPE functions are implemented as type checked wrappers around the \fBOPENSSL_LH functions. Most applications should not call the OPENSSL_LH functions directly.
When a hash table entry is replaced, lh_\f(BITYPE_insert() or \fBOPENSSL_LH_insert() return the value being replaced. NULL is returned on normal operation and on error.
\fBlh_\f(BITYPE_delete() and OPENSSL_LH_delete() return the entry being deleted. NULL is returned if there is no such value in the hash table.
\fBlh_\f(BITYPE_retrieve() and OPENSSL_LH_retrieve() return the hash table entry if it has been found, NULL otherwise.
\fBlh_\f(BITYPE_error() and OPENSSL_LH_error() return 1 if an error occurred in the last operation, 0 otherwise. It's meaningful only after non-retrieve operations.
\fBlh_\f(BITYPE_free(), OPENSSL_LH_free(), lh_\f(BITYPE_flush(), \fBOPENSSL_LH_flush(), lh_\f(BITYPE_doall() OPENSSL_LH_doall(), \fBlh_\f(BITYPE_doall_arg() and OPENSSL_LH_doall_arg() return no values.
The LHASH code regards table entries as constant data. As such, it internally represents lh_insert()'d items with a "const void *" pointer type. This is why callbacks such as those used by lh_doall() and lh_doall_arg() declare their prototypes with "const", even for the parameters that pass back the table items' data pointers - for consistency, user-provided data is "const" at all times as far as the LHASH code is concerned. However, as callers are themselves providing these pointers, they can choose whether they too should be treating all such parameters as constant.
As an example, a hash table may be maintained by code that, for reasons of encapsulation, has only "const" access to the data being indexed in the hash table (i.e. it is returned as "const" from elsewhere in their code) - in this case the LHASH prototypes are appropriate as-is. Conversely, if the caller is responsible for the life-time of the data in question, then they may well wish to make modifications to table item passed back in the lh_doall() or \fBlh_doall_arg() callbacks (see the "TYPE_cleanup" example above). If so, the caller can either cast the "const" away (if they're providing the raw callbacks themselves) or use the macros to declare/implement the wrapper functions without "const" types.
Callers that only have "const" access to data they're indexing in a table, yet declare callbacks without constant types (or cast the "const" away themselves), are therefore creating their own risks/bugs without being encouraged to do so by the API. On a related note, those auditing code should pay special attention to any instances of DECLARE/IMPLEMENT_LHASH_DOALL_[ARG_]_FN macros that provide types without any "const" qualifiers.
Licensed under the Apache License 2.0 (the "License"). You may not use this file except in compliance with the License. You can obtain a copy in the file LICENSE in the source distribution or at <https://www.openssl.org/source/license.html>.