Gecko [ satitravel.com ]

Name	Size	Permission	Date
aes.h	1.05 KB	-rw-r--r--	2026-06-08 03:37
app.h	10.23 KB	-rw-r--r--	2026-06-08 03:37
assertions.h	2.84 KB	-rw-r--r--	2026-06-08 03:37
atomic.h	4.07 KB	-rw-r--r--	2026-06-08 03:37
backtrace.h	3.8 KB	-rw-r--r--	2026-06-08 03:37
base32.h	4.35 KB	-rw-r--r--	2026-06-08 03:37
base64.h	2.8 KB	-rw-r--r--	2026-06-08 03:37
bind9.h	830 B	-rw-r--r--	2026-06-08 03:37
boolean.h	594 B	-rw-r--r--	2026-06-08 03:37
buffer.h	25.65 KB	-rw-r--r--	2026-06-08 03:37
bufferlist.h	1.42 KB	-rw-r--r--	2026-06-08 03:37
cmocka.h	1.35 KB	-rw-r--r--	2026-06-08 03:37
commandline.h	1.67 KB	-rw-r--r--	2026-06-08 03:37
condition.h	1.44 KB	-rw-r--r--	2026-06-08 03:37
counter.h	1.88 KB	-rw-r--r--	2026-06-08 03:37
crc64.h	998 B	-rw-r--r--	2026-06-08 03:37
deprecated.h	623 B	-rw-r--r--	2026-06-08 03:37
dir.h	1.56 KB	-rw-r--r--	2026-06-08 03:37
endian.h	4.67 KB	-rw-r--r--	2026-06-08 03:37
entropy.h	10.13 KB	-rw-r--r--	2026-06-08 03:37
errno.h	659 B	-rw-r--r--	2026-06-08 03:37
errno2result.h	902 B	-rw-r--r--	2026-06-08 03:38
error.h	1.4 KB	-rw-r--r--	2026-06-08 03:37
event.h	2.98 KB	-rw-r--r--	2026-06-08 03:37
eventclass.h	1.35 KB	-rw-r--r--	2026-06-08 03:37
file.h	11.39 KB	-rw-r--r--	2026-06-08 03:37
formatcheck.h	893 B	-rw-r--r--	2026-06-08 03:37
fsaccess.h	7.27 KB	-rw-r--r--	2026-06-08 03:37
hash.h	7.48 KB	-rw-r--r--	2026-06-08 03:37
heap.h	5.14 KB	-rw-r--r--	2026-06-08 03:37
hex.h	2.74 KB	-rw-r--r--	2026-06-08 03:37
hmacmd5.h	1.75 KB	-rw-r--r--	2026-06-08 03:37
hmacsha.h	4.41 KB	-rw-r--r--	2026-06-08 03:37
ht.h	4.29 KB	-rw-r--r--	2026-06-08 03:37
httpd.h	2.26 KB	-rw-r--r--	2026-06-08 03:37
int.h	1.06 KB	-rw-r--r--	2026-06-08 03:37
interfaceiter.h	3.05 KB	-rw-r--r--	2026-06-08 03:37
iterated_hash.h	1.02 KB	-rw-r--r--	2026-06-08 03:37
json.h	1.42 KB	-rw-r--r--	2026-06-08 03:37
keyboard.h	989 B	-rw-r--r--	2026-06-08 03:37
lang.h	637 B	-rw-r--r--	2026-06-08 03:37
lex.h	9.54 KB	-rw-r--r--	2026-06-08 03:37
lfsr.h	2.89 KB	-rw-r--r--	2026-06-08 03:37
lib.h	1.04 KB	-rw-r--r--	2026-06-08 03:37
likely.h	818 B	-rw-r--r--	2026-06-08 03:37
list.h	5.62 KB	-rw-r--r--	2026-06-08 03:37
log.h	28.06 KB	-rw-r--r--	2026-06-08 03:37
magic.h	994 B	-rw-r--r--	2026-06-08 03:37
md5.h	2.32 KB	-rw-r--r--	2026-06-08 03:37
mem.h	20.62 KB	-rw-r--r--	2026-06-08 03:37
meminfo.h	710 B	-rw-r--r--	2026-06-08 03:37
msgcat.h	2.66 KB	-rw-r--r--	2026-06-08 03:37
msgs.h	8.22 KB	-rw-r--r--	2026-06-08 03:37
mutex.h	3.44 KB	-rw-r--r--	2026-06-08 03:37
mutexblock.h	1.34 KB	-rw-r--r--	2026-06-08 03:37
net.h	10.29 KB	-rw-r--r--	2026-06-08 03:37
netaddr.h	4.48 KB	-rw-r--r--	2026-06-08 03:37
netdb.h	863 B	-rw-r--r--	2026-06-08 03:37
netscope.h	967 B	-rw-r--r--	2026-06-08 03:37
offset.h	700 B	-rw-r--r--	2026-06-08 03:37
once.h	983 B	-rw-r--r--	2026-06-08 03:37
ondestroy.h	2.73 KB	-rw-r--r--	2026-06-08 03:37
os.h	671 B	-rw-r--r--	2026-06-08 03:37
parseint.h	1.51 KB	-rw-r--r--	2026-06-08 03:37
platform.h	9.49 KB	-rw-r--r--	2026-06-08 03:37
pool.h	3.42 KB	-rw-r--r--	2026-06-08 03:37
portset.h	3.22 KB	-rw-r--r--	2026-06-08 03:37
print.h	2.42 KB	-rw-r--r--	2026-06-08 03:37
queue.h	5.08 KB	-rw-r--r--	2026-06-08 03:37
quota.h	2.38 KB	-rw-r--r--	2026-06-08 03:37
radix.h	6.34 KB	-rw-r--r--	2026-06-08 03:37
random.h	3.5 KB	-rw-r--r--	2026-06-08 03:37
ratelimiter.h	3.42 KB	-rw-r--r--	2026-06-08 03:37
refcount.h	8 KB	-rw-r--r--	2026-06-08 03:37
regex.h	767 B	-rw-r--r--	2026-06-08 03:37
region.h	1.99 KB	-rw-r--r--	2026-06-08 03:37
resource.h	2.79 KB	-rw-r--r--	2026-06-08 03:37
result.h	4.87 KB	-rw-r--r--	2026-06-08 03:37
resultclass.h	1.56 KB	-rw-r--r--	2026-06-08 03:37
rwlock.h	3.72 KB	-rw-r--r--	2026-06-08 03:37
safe.h	1.32 KB	-rw-r--r--	2026-06-08 03:37
serial.h	1.34 KB	-rw-r--r--	2026-06-08 03:37
sha1.h	1.52 KB	-rw-r--r--	2026-06-08 03:37
sha2.h	5.6 KB	-rw-r--r--	2026-06-08 03:37
siphash.h	734 B	-rw-r--r--	2026-06-08 03:37
sockaddr.h	5.9 KB	-rw-r--r--	2026-06-08 03:37
socket.h	35.8 KB	-rw-r--r--	2026-06-08 03:37
stat.h	806 B	-rw-r--r--	2026-06-08 03:37
stats.h	3.62 KB	-rw-r--r--	2026-06-08 03:37
stdatomic.h	5.13 KB	-rw-r--r--	2026-06-08 03:37
stdio.h	1.75 KB	-rw-r--r--	2026-06-08 03:37
stdlib.h	704 B	-rw-r--r--	2026-06-08 03:37
stdtime.h	1.04 KB	-rw-r--r--	2026-06-08 03:37
strerror.h	777 B	-rw-r--r--	2026-06-08 03:37
string.h	5.88 KB	-rw-r--r--	2026-06-08 03:37
symtab.h	4.22 KB	-rw-r--r--	2026-06-08 03:37
syslog.h	844 B	-rw-r--r--	2026-06-08 03:37
task.h	21.04 KB	-rw-r--r--	2026-06-08 03:37
taskpool.h	3.62 KB	-rw-r--r--	2026-06-08 03:37
thread.h	1.47 KB	-rw-r--r--	2026-06-08 03:37
time.h	8.67 KB	-rw-r--r--	2026-06-08 03:37
timer.h	10.54 KB	-rw-r--r--	2026-06-08 03:37
tm.h	895 B	-rw-r--r--	2026-06-08 03:37
types.h	5.64 KB	-rw-r--r--	2026-06-08 03:37
utf8.h	928 B	-rw-r--r--	2026-06-08 03:37
util.h	10.29 KB	-rw-r--r--	2026-06-08 03:37
version.h	689 B	-rw-r--r--	2026-06-08 03:37
xml.h	1.07 KB	-rw-r--r--	2026-06-08 03:37

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 */