Linux server.serveridoramd.com 4.18.0-553.121.1.lve.el8.x86_64 #1 SMP Thu Apr 30 16:40:41 UTC 2026 x86_64
LiteSpeed
Server IP : 138.128.189.138 & Your IP : 216.73.216.158
Domains :
Cant Read [ /etc/named.conf ]
User : avisosenacribj05
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
bind9 /
isc /
Delete
Unzip
Name
Size
Permission
Date
Action
aes.h
1.05
KB
-rw-r--r--
2026-08-13 18:52
app.h
10.23
KB
-rw-r--r--
2026-08-13 18:52
assertions.h
2.84
KB
-rw-r--r--
2026-08-13 18:52
atomic.h
4.07
KB
-rw-r--r--
2026-08-13 18:52
backtrace.h
3.8
KB
-rw-r--r--
2026-08-13 18:52
base32.h
4.35
KB
-rw-r--r--
2026-08-13 18:52
base64.h
2.8
KB
-rw-r--r--
2026-08-13 18:52
bind9.h
830
B
-rw-r--r--
2026-08-13 18:52
boolean.h
594
B
-rw-r--r--
2026-08-13 18:52
buffer.h
25.65
KB
-rw-r--r--
2026-08-13 18:52
bufferlist.h
1.42
KB
-rw-r--r--
2026-08-13 18:52
cmocka.h
1.35
KB
-rw-r--r--
2026-08-13 18:52
commandline.h
1.67
KB
-rw-r--r--
2026-08-13 18:52
condition.h
1.44
KB
-rw-r--r--
2026-08-13 18:52
counter.h
1.88
KB
-rw-r--r--
2026-08-13 18:52
crc64.h
998
B
-rw-r--r--
2026-08-13 18:52
deprecated.h
623
B
-rw-r--r--
2026-08-13 18:52
dir.h
1.56
KB
-rw-r--r--
2026-08-13 18:52
endian.h
4.67
KB
-rw-r--r--
2026-08-13 18:52
entropy.h
10.13
KB
-rw-r--r--
2026-08-13 18:52
errno.h
659
B
-rw-r--r--
2026-08-13 18:52
errno2result.h
902
B
-rw-r--r--
2026-08-13 18:53
error.h
1.4
KB
-rw-r--r--
2026-08-13 18:52
event.h
2.98
KB
-rw-r--r--
2026-08-13 18:52
eventclass.h
1.35
KB
-rw-r--r--
2026-08-13 18:52
file.h
11.39
KB
-rw-r--r--
2026-08-13 18:52
formatcheck.h
893
B
-rw-r--r--
2026-08-13 18:52
fsaccess.h
7.27
KB
-rw-r--r--
2026-08-13 18:52
hash.h
7.48
KB
-rw-r--r--
2026-08-13 18:52
heap.h
5.14
KB
-rw-r--r--
2026-08-13 18:52
hex.h
2.74
KB
-rw-r--r--
2026-08-13 18:52
hmacmd5.h
1.75
KB
-rw-r--r--
2026-08-13 18:52
hmacsha.h
4.41
KB
-rw-r--r--
2026-08-13 18:52
ht.h
4.29
KB
-rw-r--r--
2026-08-13 18:52
httpd.h
2.26
KB
-rw-r--r--
2026-08-13 18:52
int.h
1.06
KB
-rw-r--r--
2026-08-13 18:52
interfaceiter.h
3.05
KB
-rw-r--r--
2026-08-13 18:52
iterated_hash.h
1.02
KB
-rw-r--r--
2026-08-13 18:52
json.h
1.42
KB
-rw-r--r--
2026-08-13 18:52
keyboard.h
989
B
-rw-r--r--
2026-08-13 18:52
lang.h
637
B
-rw-r--r--
2026-08-13 18:52
lex.h
9.54
KB
-rw-r--r--
2026-08-13 18:52
lfsr.h
2.89
KB
-rw-r--r--
2026-08-13 18:52
lib.h
1.04
KB
-rw-r--r--
2026-08-13 18:52
likely.h
818
B
-rw-r--r--
2026-08-13 18:52
list.h
5.62
KB
-rw-r--r--
2026-08-13 18:52
log.h
28.06
KB
-rw-r--r--
2026-08-13 18:52
magic.h
994
B
-rw-r--r--
2026-08-13 18:52
md5.h
2.32
KB
-rw-r--r--
2026-08-13 18:52
mem.h
20.62
KB
-rw-r--r--
2026-08-13 18:52
meminfo.h
710
B
-rw-r--r--
2026-08-13 18:52
msgcat.h
2.66
KB
-rw-r--r--
2026-08-13 18:52
msgs.h
8.22
KB
-rw-r--r--
2026-08-13 18:52
mutex.h
3.44
KB
-rw-r--r--
2026-08-13 18:52
mutexblock.h
1.34
KB
-rw-r--r--
2026-08-13 18:52
net.h
10.29
KB
-rw-r--r--
2026-08-13 18:52
netaddr.h
4.48
KB
-rw-r--r--
2026-08-13 18:52
netdb.h
863
B
-rw-r--r--
2026-08-13 18:52
netscope.h
967
B
-rw-r--r--
2026-08-13 18:52
offset.h
700
B
-rw-r--r--
2026-08-13 18:52
once.h
983
B
-rw-r--r--
2026-08-13 18:52
ondestroy.h
2.73
KB
-rw-r--r--
2026-08-13 18:52
os.h
671
B
-rw-r--r--
2026-08-13 18:52
parseint.h
1.51
KB
-rw-r--r--
2026-08-13 18:52
platform.h
9.49
KB
-rw-r--r--
2026-08-13 18:52
pool.h
3.42
KB
-rw-r--r--
2026-08-13 18:52
portset.h
3.22
KB
-rw-r--r--
2026-08-13 18:52
print.h
2.42
KB
-rw-r--r--
2026-08-13 18:52
queue.h
5.08
KB
-rw-r--r--
2026-08-13 18:52
quota.h
2.38
KB
-rw-r--r--
2026-08-13 18:52
radix.h
6.34
KB
-rw-r--r--
2026-08-13 18:52
random.h
3.5
KB
-rw-r--r--
2026-08-13 18:52
ratelimiter.h
3.42
KB
-rw-r--r--
2026-08-13 18:52
refcount.h
8
KB
-rw-r--r--
2026-08-13 18:52
regex.h
767
B
-rw-r--r--
2026-08-13 18:52
region.h
1.99
KB
-rw-r--r--
2026-08-13 18:52
resource.h
2.79
KB
-rw-r--r--
2026-08-13 18:52
result.h
4.87
KB
-rw-r--r--
2026-08-13 18:52
resultclass.h
1.56
KB
-rw-r--r--
2026-08-13 18:52
rwlock.h
3.72
KB
-rw-r--r--
2026-08-13 18:52
safe.h
1.32
KB
-rw-r--r--
2026-08-13 18:52
serial.h
1.34
KB
-rw-r--r--
2026-08-13 18:52
sha1.h
1.52
KB
-rw-r--r--
2026-08-13 18:52
sha2.h
5.6
KB
-rw-r--r--
2026-08-13 18:52
siphash.h
734
B
-rw-r--r--
2026-08-13 18:52
sockaddr.h
5.9
KB
-rw-r--r--
2026-08-13 18:52
socket.h
35.8
KB
-rw-r--r--
2026-08-13 18:52
stat.h
806
B
-rw-r--r--
2026-08-13 18:52
stats.h
3.62
KB
-rw-r--r--
2026-08-13 18:52
stdatomic.h
5.13
KB
-rw-r--r--
2026-08-13 18:52
stdio.h
1.75
KB
-rw-r--r--
2026-08-13 18:52
stdlib.h
704
B
-rw-r--r--
2026-08-13 18:52
stdtime.h
1.04
KB
-rw-r--r--
2026-08-13 18:52
strerror.h
777
B
-rw-r--r--
2026-08-13 18:52
string.h
5.88
KB
-rw-r--r--
2026-08-13 18:52
symtab.h
4.22
KB
-rw-r--r--
2026-08-13 18:52
syslog.h
844
B
-rw-r--r--
2026-08-13 18:52
task.h
21.04
KB
-rw-r--r--
2026-08-13 18:52
taskpool.h
3.62
KB
-rw-r--r--
2026-08-13 18:52
thread.h
1.47
KB
-rw-r--r--
2026-08-13 18:52
time.h
8.67
KB
-rw-r--r--
2026-08-13 18:52
timer.h
10.54
KB
-rw-r--r--
2026-08-13 18:52
tm.h
895
B
-rw-r--r--
2026-08-13 18:52
types.h
5.64
KB
-rw-r--r--
2026-08-13 18:52
utf8.h
928
B
-rw-r--r--
2026-08-13 18:52
util.h
10.29
KB
-rw-r--r--
2026-08-13 18:52
version.h
689
B
-rw-r--r--
2026-08-13 18:52
xml.h
1.07
KB
-rw-r--r--
2026-08-13 18:52
Save
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 */