Gecko [ naturenectar.co.uk ]

Name	Size	Permission	Date
aes.h	1015 B	-rw-r--r--	2021-11-05 09:03
align.h	569 B	-rw-r--r--	2021-11-05 09:03
app.h	6.97 KB	-rw-r--r--	2021-11-05 09:03
assertions.h	2.17 KB	-rw-r--r--	2021-11-05 09:03
astack.h	1.11 KB	-rw-r--r--	2021-11-05 09:03
atomic.h	3.01 KB	-rw-r--r--	2021-11-05 09:03
backtrace.h	3.8 KB	-rw-r--r--	2021-11-05 09:03
barrier.h	1.03 KB	-rw-r--r--	2021-11-05 09:03
base32.h	4.35 KB	-rw-r--r--	2021-11-05 09:03
base64.h	2.8 KB	-rw-r--r--	2021-11-05 09:03
bind9.h	829 B	-rw-r--r--	2021-11-05 09:03
buffer.h	29.91 KB	-rw-r--r--	2021-11-05 09:03
bufferlist.h	1.42 KB	-rw-r--r--	2021-11-05 09:03
cmocka.h	1.35 KB	-rw-r--r--	2021-11-05 09:03
commandline.h	1.67 KB	-rw-r--r--	2021-11-05 09:03
condition.h	1.87 KB	-rw-r--r--	2021-11-05 09:03
counter.h	1.88 KB	-rw-r--r--	2021-11-05 09:03
crc64.h	998 B	-rw-r--r--	2021-11-05 09:03
deprecated.h	662 B	-rw-r--r--	2021-11-05 09:03
dir.h	1.51 KB	-rw-r--r--	2021-11-05 09:03
endian.h	4.75 KB	-rw-r--r--	2021-11-05 09:03
errno.h	659 B	-rw-r--r--	2021-11-05 09:03
errno2result.h	901 B	-rw-r--r--	2025-07-29 21:44
error.h	1.4 KB	-rw-r--r--	2021-11-05 09:03
event.h	3.36 KB	-rw-r--r--	2021-11-05 09:03
eventclass.h	1.41 KB	-rw-r--r--	2021-11-05 09:03
file.h	11.4 KB	-rw-r--r--	2021-11-05 09:03
formatcheck.h	940 B	-rw-r--r--	2021-11-05 09:03
fsaccess.h	7.28 KB	-rw-r--r--	2021-11-05 09:03
fuzz.h	593 B	-rw-r--r--	2021-11-05 09:03
hash.h	1.61 KB	-rw-r--r--	2021-11-05 09:03
heap.h	5.14 KB	-rw-r--r--	2021-11-05 09:03
hex.h	2.74 KB	-rw-r--r--	2021-11-05 09:03
hmac.h	3.88 KB	-rw-r--r--	2021-11-05 09:03
hp.h	4.48 KB	-rw-r--r--	2021-11-05 09:03
ht.h	4.38 KB	-rw-r--r--	2025-07-29 21:41
httpd.h	2.24 KB	-rw-r--r--	2021-11-05 09:03
interfaceiter.h	3.07 KB	-rw-r--r--	2021-11-05 09:03
iterated_hash.h	933 B	-rw-r--r--	2021-11-05 09:03
lang.h	686 B	-rw-r--r--	2021-11-05 09:03
lex.h	9.77 KB	-rw-r--r--	2021-11-05 09:03
lfsr.h	2.89 KB	-rw-r--r--	2021-11-05 09:03
lib.h	1.13 KB	-rw-r--r--	2021-11-05 09:03
likely.h	868 B	-rw-r--r--	2021-11-05 09:03
list.h	7.9 KB	-rw-r--r--	2021-11-05 09:03
log.h	25.88 KB	-rw-r--r--	2021-11-05 09:03
magic.h	999 B	-rw-r--r--	2021-11-05 09:03
managers.h	776 B	-rw-r--r--	2021-11-05 09:03
md.h	5.63 KB	-rw-r--r--	2021-11-05 09:03
mem.h	17.66 KB	-rw-r--r--	2021-11-05 09:03
meminfo.h	710 B	-rw-r--r--	2021-11-05 09:03
mutex.h	4.08 KB	-rw-r--r--	2021-11-05 09:03
mutexatomic.h	9.56 KB	-rw-r--r--	2021-11-05 09:03
mutexblock.h	1.13 KB	-rw-r--r--	2021-11-05 09:03
net.h	8.36 KB	-rw-r--r--	2021-11-05 09:03
netaddr.h	4.67 KB	-rw-r--r--	2021-11-05 09:03
netdb.h	860 B	-rw-r--r--	2021-11-05 09:03
netmgr.h	15.36 KB	-rw-r--r--	2025-07-29 21:41
netscope.h	966 B	-rw-r--r--	2021-11-05 09:03
nonce.h	743 B	-rw-r--r--	2021-11-05 09:03
offset.h	687 B	-rw-r--r--	2021-11-05 09:03
once.h	767 B	-rw-r--r--	2021-11-05 09:03
os.h	670 B	-rw-r--r--	2021-11-05 09:03
parseint.h	1.5 KB	-rw-r--r--	2021-11-05 09:03
platform.h	1.82 KB	-rw-r--r--	2025-07-29 21:41
pool.h	3.41 KB	-rw-r--r--	2021-11-05 09:03
portset.h	3.22 KB	-rw-r--r--	2021-11-05 09:03
print.h	680 B	-rw-r--r--	2021-11-05 09:03
queue.h	1.31 KB	-rw-r--r--	2021-11-05 09:03
quota.h	3.48 KB	-rw-r--r--	2021-11-05 09:03
radix.h	6.85 KB	-rw-r--r--	2021-11-05 09:03
random.h	1.45 KB	-rw-r--r--	2021-11-05 09:03
ratelimiter.h	3.41 KB	-rw-r--r--	2021-11-05 09:03
refcount.h	4.98 KB	-rw-r--r--	2021-11-05 09:03
regex.h	767 B	-rw-r--r--	2021-11-05 09:03
region.h	2.18 KB	-rw-r--r--	2021-11-05 09:03
resource.h	2.79 KB	-rw-r--r--	2021-11-05 09:03
result.h	5.45 KB	-rw-r--r--	2021-11-05 09:03
resultclass.h	1.56 KB	-rw-r--r--	2021-11-05 09:03
rwlock.h	2.48 KB	-rw-r--r--	2021-11-05 09:03
safe.h	1.12 KB	-rw-r--r--	2021-11-05 09:03
serial.h	1.33 KB	-rw-r--r--	2021-11-05 09:03
siphash.h	916 B	-rw-r--r--	2021-11-05 09:03
sockaddr.h	6.13 KB	-rw-r--r--	2021-11-05 09:03
socket.h	23.55 KB	-rw-r--r--	2021-11-05 09:03
stat.h	803 B	-rw-r--r--	2021-11-05 09:03
stats.h	6.53 KB	-rw-r--r--	2021-11-05 09:03
stdatomic.h	8.9 KB	-rw-r--r--	2021-11-05 09:03
stdio.h	1.69 KB	-rw-r--r--	2021-11-05 09:03
stdtime.h	1.36 KB	-rw-r--r--	2021-11-05 09:03
strerr.h	575 B	-rw-r--r--	2021-11-05 09:03
string.h	851 B	-rw-r--r--	2021-11-05 09:03
symtab.h	4.22 KB	-rw-r--r--	2021-11-05 09:03
syslog.h	843 B	-rw-r--r--	2021-11-05 09:03
task.h	16.72 KB	-rw-r--r--	2021-11-05 09:03
taskpool.h	3.2 KB	-rw-r--r--	2021-11-05 09:03
thread.h	1.86 KB	-rw-r--r--	2021-11-05 09:03
time.h	10.85 KB	-rw-r--r--	2021-11-05 09:03
timer.h	7.77 KB	-rw-r--r--	2021-11-05 09:03
tm.h	894 B	-rw-r--r--	2021-11-05 09:03
types.h	5.72 KB	-rw-r--r--	2021-11-05 09:03
url.h	2.62 KB	-rw-r--r--	2021-11-05 09:03
utf8.h	928 B	-rw-r--r--	2021-11-05 09:03
util.h	13.96 KB	-rw-r--r--	2021-11-05 09:03
version.h	499 B	-rw-r--r--	2021-11-05 09:03

Rename

/*
 * Copyright (C) Internet Systems Consortium, Inc. ("ISC")
 *
 * 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.
 */

#ifndef ISC_HEAP_H
#define ISC_HEAP_H 1

/*! \file isc/heap.h */

#include <stdbool.h>

#include <isc/lang.h>
#include <isc/types.h>

ISC_LANG_BEGINDECLS

/*%
 * The comparison function returns true if the first argument has
 * higher priority than the second argument, and false otherwise.
 */
typedef bool (*isc_heapcompare_t)(void *, void *);

/*%
 * The index function allows the client of the heap to receive a callback
 * when an item's index number changes.  This allows it to maintain
 * sync with its external state, but still delete itself, since deletions
 * from the heap require the index be provided.
 */
typedef void (*isc_heapindex_t)(void *, unsigned int);

/*%
 * The heapaction function is used when iterating over the heap.
 *
 * NOTE:  The heap structure CANNOT BE MODIFIED during the call to
 * isc_heap_foreach().
 */
typedef void (*isc_heapaction_t)(void *, void *);

typedef struct isc_heap isc_heap_t;

isc_result_t
isc_heap_create(isc_mem_t *mctx, isc_heapcompare_t compare,
		isc_heapindex_t index, unsigned int size_increment,
		isc_heap_t **heapp);
/*!<
 * \brief Create a new heap.  The heap is implemented using a space-efficient
 * storage method.  When the heap elements are deleted space is not freed
 * but will be reused when new elements are inserted.
 *
 * Heap elements are indexed from 1.
 *
 * Requires:
 *\li	"mctx" is valid.
 *\li	"compare" is a function which takes two void * arguments and
 *	returns true if the first argument has a higher priority than
 *	the second, and false otherwise.
 *\li	"index" is a function which takes a void *, and an unsigned int
 *	argument.  This function will be called whenever an element's
 *	index value changes, so it may continue to delete itself from the
 *	heap.  This option may be NULL if this functionality is unneeded.
 *\li	"size_increment" is a hint about how large the heap should grow
 *	when resizing is needed.  If this is 0, a default size will be
 *	used, which is currently 1024, allowing space for an additional 1024
 *	heap elements to be inserted before adding more space.
 *\li	"heapp" is not NULL, and "*heap" is NULL.
 *
 * Returns:
 *\li	ISC_R_SUCCESS		- success
 *\li	ISC_R_NOMEMORY		- insufficient memory
 */

void
isc_heap_destroy(isc_heap_t **heapp);
/*!<
 * \brief Destroys a heap.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 */

isc_result_t
isc_heap_insert(isc_heap_t *heap, void *elt);
/*!<
 * \brief Inserts a new element into a heap.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 */

void
isc_heap_delete(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Deletes an element from a heap, by element index.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 */

void
isc_heap_increased(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Indicates to the heap that an element's priority has increased.
 * This function MUST be called whenever an element has increased in priority.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 */

void
isc_heap_decreased(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Indicates to the heap that an element's priority has decreased.
 * This function MUST be called whenever an element has decreased in priority.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 */

void *
isc_heap_element(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Returns the element for a specific element index.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 *
 * Returns:
 *\li	A pointer to the element for the element index.
 */

void
isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap);
/*!<
 * \brief Iterate over the heap, calling an action for each element.  The
 * order of iteration is not sorted.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"action" is not NULL, and is a function which takes two arguments.
 *	The first is a void *, representing the element, and the second is
 *	"uap" as provided to isc_heap_foreach.
 *\li	"uap" is a caller-provided argument, and may be NULL.
 *
 * Note:
 *\li	The heap structure CANNOT be modified during this iteration.  The only
 *	safe function to call while iterating the heap is isc_heap_element().
 */

ISC_LANG_ENDDECLS

#endif /* ISC_HEAP_H */