File Manager

Hackfut Security File Manager

Current Path: /usr/include/isc

📁 ..
📄 app.h(10.29 KB)
📄 assertions.h(3.24 KB)
📄 atomic.h(4.16 KB)
📄 base64.h(2.9 KB)
📄 bind9.h(1.16 KB)
📄 bitstring.h(4.37 KB)
📄 boolean.h(1.18 KB)
📄 buffer.h(22.4 KB)
📄 bufferlist.h(1.93 KB)
📄 commandline.h(1.78 KB)
📄 condition.h(1.96 KB)
📄 counter.h(2.27 KB)
📄 dir.h(2.51 KB)
📄 entropy.h(9.22 KB)
📄 error.h(1.83 KB)
📄 event.h(3.28 KB)
📄 eventclass.h(1.87 KB)
📄 file.h(9.04 KB)
📄 formatcheck.h(1.39 KB)
📄 fsaccess.h(7.77 KB)
📄 hash.h(5.83 KB)
📄 heap.h(5.62 KB)
📄 hex.h(2.84 KB)
📄 hmacmd5.h(1.92 KB)
📄 httpd.h(1.98 KB)
📄 int.h(1.83 KB)
📄 interfaceiter.h(3.55 KB)
📄 iterated_hash.h(1.48 KB)
📄 keyboard.h(1.47 KB)
📄 lang.h(1.13 KB)
📄 lex.h(9.43 KB)
📄 lfsr.h(3.4 KB)
📄 lib.h(1.56 KB)
📄 list.h(5.75 KB)
📄 log.h(28.29 KB)
📄 magic.h(1.44 KB)
📄 md5.h(2.47 KB)
📄 mem.h(21.26 KB)
📄 msgcat.h(3.18 KB)
📄 msgs.h(8.65 KB)
📄 mutex.h(3.97 KB)
📄 mutexblock.h(1.86 KB)
📄 namespace.h(7.02 KB)
📄 net.h(9.05 KB)
📄 netaddr.h(4.8 KB)
📄 netdb.h(1.36 KB)
📄 offset.h(1.85 KB)
📄 once.h(1.47 KB)
📄 ondestroy.h(3.25 KB)
📄 os.h(1.16 KB)
📄 parseint.h(2.01 KB)
📄 platform.h(8.42 KB)
📄 print.h(2.39 KB)
📄 quota.h(2.81 KB)
📄 radix.h(6.89 KB)
📄 random.h(1.78 KB)
📄 ratelimiter.h(3.48 KB)
📄 refcount.h(6.06 KB)
📄 region.h(2.44 KB)
📄 resource.h(3.32 KB)
📄 result.h(4.67 KB)
📄 resultclass.h(2.03 KB)
📄 rwlock.h(3.75 KB)
📄 serial.h(1.91 KB)
📄 sha1.h(1.76 KB)
📄 sha2.h(5.72 KB)
📄 sockaddr.h(6.42 KB)
📄 socket.h(32.2 KB)
📄 stdio.h(2.19 KB)
📄 stdlib.h(1.19 KB)
📄 stdtime.h(1.84 KB)
📄 string.h(6.25 KB)
📄 symtab.h(4.64 KB)
📄 syslog.h(1.34 KB)
📄 task.h(19.17 KB)
📄 taskpool.h(3.7 KB)
📄 thread.h(1.83 KB)
📄 time.h(7.86 KB)
📄 timer.h(11.02 KB)
📄 types.h(5.79 KB)
📄 util.h(7.75 KB)
📄 version.h(1.18 KB)
📄 xml.h(1.52 KB)

Editing: heap.h

/*
 * Copyright (C) 2004-2007, 2009  Internet Systems Consortium, Inc. ("ISC")
 * Copyright (C) 1997-2001  Internet Software Consortium.
 *
 * Permission to use, copy, modify, and/or distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
 * AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
 * PERFORMANCE OF THIS SOFTWARE.
 */

/* $Id: heap.h,v 1.26 2009-01-17 23:47:43 tbox Exp $ */

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

Hackfut Security File Manager

Editing: heap.h

Upload File

Create Folder