X7ROOT File Manager
Current Path:
/usr/include/bind9/isc
usr
/
include
/
bind9
/
isc
/
📁
..
📄
aes.h
(1.05 KB)
📄
app.h
(10.23 KB)
📄
assertions.h
(2.84 KB)
📄
atomic.h
(4.07 KB)
📄
backtrace.h
(3.8 KB)
📄
base32.h
(4.35 KB)
📄
base64.h
(2.8 KB)
📄
bind9.h
(830 B)
📄
boolean.h
(594 B)
📄
buffer.h
(25.65 KB)
📄
bufferlist.h
(1.42 KB)
📄
cmocka.h
(1.35 KB)
📄
commandline.h
(1.67 KB)
📄
condition.h
(1.44 KB)
📄
counter.h
(1.88 KB)
📄
crc64.h
(998 B)
📄
deprecated.h
(623 B)
📄
dir.h
(1.56 KB)
📄
endian.h
(4.67 KB)
📄
entropy.h
(10.13 KB)
📄
errno.h
(659 B)
📄
errno2result.h
(902 B)
📄
error.h
(1.4 KB)
📄
event.h
(2.98 KB)
📄
eventclass.h
(1.35 KB)
📄
file.h
(11.39 KB)
📄
formatcheck.h
(893 B)
📄
fsaccess.h
(7.27 KB)
📄
hash.h
(7.48 KB)
📄
heap.h
(5.14 KB)
📄
hex.h
(2.74 KB)
📄
hmacmd5.h
(1.75 KB)
📄
hmacsha.h
(4.41 KB)
📄
ht.h
(4.29 KB)
📄
httpd.h
(2.26 KB)
📄
int.h
(1.06 KB)
📄
interfaceiter.h
(3.05 KB)
📄
iterated_hash.h
(1.02 KB)
📄
json.h
(1.42 KB)
📄
keyboard.h
(989 B)
📄
lang.h
(637 B)
📄
lex.h
(9.54 KB)
📄
lfsr.h
(2.89 KB)
📄
lib.h
(1.04 KB)
📄
likely.h
(818 B)
📄
list.h
(5.62 KB)
📄
log.h
(28.06 KB)
📄
magic.h
(994 B)
📄
md5.h
(2.32 KB)
📄
mem.h
(20.62 KB)
📄
meminfo.h
(710 B)
📄
msgcat.h
(2.66 KB)
📄
msgs.h
(8.22 KB)
📄
mutex.h
(3.44 KB)
📄
mutexblock.h
(1.34 KB)
📄
net.h
(10.29 KB)
📄
netaddr.h
(4.48 KB)
📄
netdb.h
(863 B)
📄
netscope.h
(967 B)
📄
offset.h
(700 B)
📄
once.h
(983 B)
📄
ondestroy.h
(2.73 KB)
📄
os.h
(671 B)
📄
parseint.h
(1.51 KB)
📄
platform.h
(9.49 KB)
📄
pool.h
(3.42 KB)
📄
portset.h
(3.22 KB)
📄
print.h
(2.42 KB)
📄
queue.h
(5.08 KB)
📄
quota.h
(2.38 KB)
📄
radix.h
(6.34 KB)
📄
random.h
(3.5 KB)
📄
ratelimiter.h
(3.42 KB)
📄
refcount.h
(8 KB)
📄
regex.h
(767 B)
📄
region.h
(1.99 KB)
📄
resource.h
(2.79 KB)
📄
result.h
(4.87 KB)
📄
resultclass.h
(1.56 KB)
📄
rwlock.h
(3.72 KB)
📄
safe.h
(1.32 KB)
📄
serial.h
(1.34 KB)
📄
sha1.h
(1.52 KB)
📄
sha2.h
(5.6 KB)
📄
siphash.h
(734 B)
📄
sockaddr.h
(5.9 KB)
📄
socket.h
(35.8 KB)
📄
stat.h
(806 B)
📄
stats.h
(3.62 KB)
📄
stdatomic.h
(5.13 KB)
📄
stdio.h
(1.75 KB)
📄
stdlib.h
(704 B)
📄
stdtime.h
(1.04 KB)
📄
strerror.h
(777 B)
📄
string.h
(5.88 KB)
📄
symtab.h
(4.22 KB)
📄
syslog.h
(844 B)
📄
task.h
(21.04 KB)
📄
taskpool.h
(3.62 KB)
📄
thread.h
(1.47 KB)
📄
time.h
(8.67 KB)
📄
timer.h
(10.54 KB)
📄
tm.h
(895 B)
📄
types.h
(5.64 KB)
📄
utf8.h
(928 B)
📄
util.h
(10.29 KB)
📄
version.h
(689 B)
📄
xml.h
(1.07 KB)
Editing: 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 https://mozilla.org/MPL/2.0/. * * See the COPYRIGHT file distributed with this work for additional * information regarding copyright ownership. */ /* ! \file */ #pragma once #include <inttypes.h> #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, 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 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 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 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);
Upload File
Create Folder