Gecko [ sachasauda.akalacademy.ac.in ]

Name	Size	Permission
aes.h	1.05 KB	-rw-r--r--
app.h	10.23 KB	-rw-r--r--
assertions.h	2.78 KB	-rw-r--r--
atomic.h	4.15 KB	-rw-r--r--
backtrace.h	3.8 KB	-rw-r--r--
base32.h	3.94 KB	-rw-r--r--
base64.h	2.39 KB	-rw-r--r--
bind9.h	849 B	-rw-r--r--
boolean.h	746 B	-rw-r--r--
buffer.h	25.69 KB	-rw-r--r--
bufferlist.h	1.42 KB	-rw-r--r--
commandline.h	1.69 KB	-rw-r--r--
condition.h	1.44 KB	-rw-r--r--
counter.h	1.88 KB	-rw-r--r--
crc64.h	986 B	-rw-r--r--
deprecated.h	622 B	-rw-r--r--
dir.h	1.96 KB	-rw-r--r--
entropy.h	8.76 KB	-rw-r--r--
errno.h	658 B	-rw-r--r--
errno2result.h	893 B	-rw-r--r--
error.h	1.4 KB	-rw-r--r--
event.h	2.98 KB	-rw-r--r--
eventclass.h	1.35 KB	-rw-r--r--
file.h	11.43 KB	-rw-r--r--
formatcheck.h	892 B	-rw-r--r--
fsaccess.h	7.25 KB	-rw-r--r--
hash.h	7.52 KB	-rw-r--r--
heap.h	5.14 KB	-rw-r--r--
hex.h	2.33 KB	-rw-r--r--
hmacmd5.h	1.75 KB	-rw-r--r--
hmacsha.h	4.44 KB	-rw-r--r--
ht.h	4.29 KB	-rw-r--r--
httpd.h	2.26 KB	-rw-r--r--
int.h	1.37 KB	-rw-r--r--
interfaceiter.h	3.03 KB	-rw-r--r--
iterated_hash.h	1.02 KB	-rw-r--r--
json.h	1.42 KB	-rw-r--r--
keyboard.h	976 B	-rw-r--r--
lang.h	636 B	-rw-r--r--
lex.h	9.42 KB	-rw-r--r--
lfsr.h	2.88 KB	-rw-r--r--
lib.h	1.04 KB	-rw-r--r--
likely.h	718 B	-rw-r--r--
list.h	5.65 KB	-rw-r--r--
log.h	28.06 KB	-rw-r--r--
magic.h	993 B	-rw-r--r--
md5.h	2.34 KB	-rw-r--r--
mem.h	20.63 KB	-rw-r--r--
meminfo.h	690 B	-rw-r--r--
msgcat.h	2.66 KB	-rw-r--r--
msgs.h	8.22 KB	-rw-r--r--
mutex.h	3.44 KB	-rw-r--r--
mutexblock.h	1.34 KB	-rw-r--r--
net.h	10.32 KB	-rw-r--r--
netaddr.h	4.56 KB	-rw-r--r--
netdb.h	862 B	-rw-r--r--
netscope.h	947 B	-rw-r--r--
offset.h	699 B	-rw-r--r--
once.h	981 B	-rw-r--r--
ondestroy.h	2.79 KB	-rw-r--r--
os.h	670 B	-rw-r--r--
parseint.h	1.49 KB	-rw-r--r--
platform.h	9.31 KB	-rw-r--r--
pool.h	3.42 KB	-rw-r--r--
portset.h	3.21 KB	-rw-r--r--
print.h	2.49 KB	-rw-r--r--
queue.h	4.66 KB	-rw-r--r--
quota.h	2.29 KB	-rw-r--r--
radix.h	6.37 KB	-rw-r--r--
random.h	2.99 KB	-rw-r--r--
ratelimiter.h	3.38 KB	-rw-r--r--
refcount.h	7.89 KB	-rw-r--r--
regex.h	766 B	-rw-r--r--
region.h	1.99 KB	-rw-r--r--
resource.h	2.8 KB	-rw-r--r--
result.h	4.62 KB	-rw-r--r--
resultclass.h	1.56 KB	-rw-r--r--
rwlock.h	3.6 KB	-rw-r--r--
safe.h	1.21 KB	-rw-r--r--
serial.h	1.4 KB	-rw-r--r--
sha1.h	1.52 KB	-rw-r--r--
sha2.h	5.65 KB	-rw-r--r--
sockaddr.h	6 KB	-rw-r--r--
socket.h	35.81 KB	-rw-r--r--
stat.h	805 B	-rw-r--r--
stats.h	3.02 KB	-rw-r--r--
stdio.h	1.74 KB	-rw-r--r--
stdlib.h	703 B	-rw-r--r--
stdtime.h	1.3 KB	-rw-r--r--
strerror.h	776 B	-rw-r--r--
string.h	5.94 KB	-rw-r--r--
symtab.h	4.21 KB	-rw-r--r--
syslog.h	843 B	-rw-r--r--
task.h	21.08 KB	-rw-r--r--
taskpool.h	3.61 KB	-rw-r--r--
thread.h	1.47 KB	-rw-r--r--
time.h	8.66 KB	-rw-r--r--
timer.h	10.54 KB	-rw-r--r--
tm.h	894 B	-rw-r--r--
types.h	5.54 KB	-rw-r--r--
util.h	7.49 KB	-rw-r--r--
version.h	688 B	-rw-r--r--
xml.h	1.07 KB	-rw-r--r--

Code Editor : ht.h

/*
 * Copyright (C) Internet Systems Consortium, Inc. ("ISC")
 *
 * SPDX-License-Identifier: MPL-2.0
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
 *
 * See the COPYRIGHT file distributed with this work for additional
 * information regarding copyright ownership.
 */

/* ! \file */

#pragma once

#include <string.h>
#include <isc/result.h>
#include <isc/types.h>

typedef struct isc_ht	   isc_ht_t;
typedef struct isc_ht_iter isc_ht_iter_t;

enum { ISC_HT_CASE_SENSITIVE = 0x00, ISC_HT_CASE_INSENSITIVE = 0x01 };

/*%
 * Initialize hashtable at *htp, using memory context and size of (1<<bits)
 *
 * If 'options' contains ISC_HT_CASE_INSENSITIVE, then upper- and lower-case
 * letters in key values will generate the same hash values; this can be used
 * when the key for a hash table is a DNS name.
 *
 * Requires:
 *\li	'htp' is not NULL and '*htp' is NULL.
 *\li	'mctx' is a valid memory context.
 *\li	'bits' >=1 and 'bits' <=32
 *
 */
void
isc_ht_init(isc_ht_t **htp, isc_mem_t *mctx, isc_uint8_t bits,
		unsigned int options);

/*%
 * Destroy hashtable, freeing everything
 *
 * Requires:
 * \li	'*htp' is valid hashtable
 */
void
isc_ht_destroy(isc_ht_t **htp);

/*%
 * Add a node to hashtable, pointed by binary key 'key' of size 'keysize';
 * set its value to 'value'
 *
 * Requires:
 *\li	'ht' is a valid hashtable
 *\li   write-lock
 *
 * Returns:
 *\li	#ISC_R_NOMEMORY		-- not enough memory to create pool
 *\li	#ISC_R_EXISTS		-- node of the same key already exists
 *\li	#ISC_R_SUCCESS		-- all is well.
 */
isc_result_t
isc_ht_add(isc_ht_t *ht, const unsigned char *key, const isc_uint32_t keysize,
	   void *value);

/*%
 * Find a node matching 'key'/'keysize' in hashtable 'ht';
 * if found, set '*valuep' to its value. (If 'valuep' is NULL,
 * then simply return SUCCESS or NOTFOUND to indicate whether the
 * key exists in the hashtable.)
 *
 * Requires:
 * \li	'ht' is a valid hashtable
 * \li  read-lock
 *
 * Returns:
 * \li	#ISC_R_SUCCESS		-- success
 * \li	#ISC_R_NOTFOUND		-- key not found
 */
isc_result_t
isc_ht_find(const isc_ht_t *ht, const unsigned char *key,
	    const isc_uint32_t keysize, void **valuep);

/*%
 * Delete node from hashtable
 *
 * Requires:
 *\li	ht is a valid hashtable
 *\li   write-lock
 *
 * Returns:
 *\li	#ISC_R_NOTFOUND		-- key not found
 *\li	#ISC_R_SUCCESS		-- all is well
 */
isc_result_t
isc_ht_delete(isc_ht_t *ht, const unsigned char *key, const isc_uint32_t keysize);

/*%
 * Create an iterator for the hashtable; point '*itp' to it.
 *
 * Requires:
 *\li	'ht' is a valid hashtable
 *\li	'itp' is non NULL and '*itp' is NULL.
 */
void
isc_ht_iter_create(isc_ht_t *ht, isc_ht_iter_t **itp);

/*%
 * Destroy the iterator '*itp', set it to NULL
 *
 * Requires:
 *\li	'itp' is non NULL and '*itp' is non NULL.
 */
void
isc_ht_iter_destroy(isc_ht_iter_t **itp);

/*%
 * Set an iterator to the first entry.
 *
 * Requires:
 *\li	'it' is non NULL.
 *
 * Returns:
 * \li 	#ISC_R_SUCCESS	-- success
 * \li	#ISC_R_NOMORE	-- no data in the hashtable
 */
isc_result_t
isc_ht_iter_first(isc_ht_iter_t *it);

/*%
 * Set an iterator to the next entry.
 *
 * Requires:
 *\li	'it' is non NULL.
 *
 * Returns:
 * \li 	#ISC_R_SUCCESS	-- success
 * \li	#ISC_R_NOMORE	-- end of hashtable reached
 */
isc_result_t
isc_ht_iter_next(isc_ht_iter_t *it);

/*%
 * Delete current entry and set an iterator to the next entry.
 *
 * Requires:
 *\li	'it' is non NULL.
 *
 * Returns:
 * \li 	#ISC_R_SUCCESS	-- success
 * \li	#ISC_R_NOMORE	-- end of hashtable reached
 */
isc_result_t
isc_ht_iter_delcurrent_next(isc_ht_iter_t *it);

/*%
 * Set 'value' to the current value under the iterator
 *
 * Requires:
 *\li	'it' is non NULL.
 *\li   'valuep' is non NULL and '*valuep' is NULL.
 */
void
isc_ht_iter_current(isc_ht_iter_t *it, void **valuep);

/*%
 * Set 'key' and 'keysize to the current key and keysize for the value
 * under the iterator
 *
 * Requires:
 *\li	'it' is non NULL.
 *\li   'key' is non NULL and '*key' is NULL.
 *\li	'keysize' is non NULL.
 */
void
isc_ht_iter_currentkey(isc_ht_iter_t *it, unsigned char **key, size_t *keysize);

/*%
 * Returns the number of items in the hashtable.
 *
 * Requires:
 *\li	'ht' is a valid hashtable
 */
size_t
isc_ht_count(const isc_ht_t *ht);

${this.title}

Code Editor : ht.h