File Manager

X7ROOT File Manager

Current Path: /usr/include/bind9/isc

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

Editing: heap.h

/*
 * 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 http://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 <isc/lang.h>
#include <isc/types.h>

ISC_LANG_BEGINDECLS

/*%
 * The comparison function returns ISC_TRUE if the first argument has
 * higher priority than the second argument, and ISC_FALSE otherwise.
 */
typedef isc_boolean_t (*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 ISC_TRUE if the first argument has a higher priority than
 *	the second, and ISC_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 */

X7ROOT File Manager

Editing: heap.h

Upload File

Create Folder