X7ROOT File Manager
Current Path:
/usr/include/bind9/isc
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: list.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_LIST_H #define ISC_LIST_H 1 #include <isc/boolean.h> #include <isc/assertions.h> #ifdef ISC_LIST_CHECKINIT #define ISC_LINK_INSIST(x) ISC_INSIST(x) #else #define ISC_LINK_INSIST(x) #endif #define ISC_LIST(type) struct { type *head, *tail; } #define ISC_LIST_INIT(list) \ do { (list).head = NULL; (list).tail = NULL; } while (0) #define ISC_LINK(type) struct { type *prev, *next; } #define ISC_LINK_INIT_TYPE(elt, link, type) \ do { \ (elt)->link.prev = (type *)(-1); \ (elt)->link.next = (type *)(-1); \ } while (0) #define ISC_LINK_INIT(elt, link) \ ISC_LINK_INIT_TYPE(elt, link, void) #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1)) #define ISC_LIST_HEAD(list) ((list).head) #define ISC_LIST_TAIL(list) ((list).tail) #define ISC_LIST_EMPTY(list) ISC_TF((list).head == NULL) #define __ISC_LIST_PREPENDUNSAFE(list, elt, link) \ do { \ if ((list).head != NULL) \ (list).head->link.prev = (elt); \ else \ (list).tail = (elt); \ (elt)->link.prev = NULL; \ (elt)->link.next = (list).head; \ (list).head = (elt); \ } while (0) #define ISC_LIST_PREPEND(list, elt, link) \ do { \ ISC_LINK_INSIST(!ISC_LINK_LINKED(elt, link)); \ __ISC_LIST_PREPENDUNSAFE(list, elt, link); \ } while (0) #define ISC_LIST_INITANDPREPEND(list, elt, link) \ __ISC_LIST_PREPENDUNSAFE(list, elt, link) #define __ISC_LIST_APPENDUNSAFE(list, elt, link) \ do { \ if ((list).tail != NULL) \ (list).tail->link.next = (elt); \ else \ (list).head = (elt); \ (elt)->link.prev = (list).tail; \ (elt)->link.next = NULL; \ (list).tail = (elt); \ } while (0) #define ISC_LIST_APPEND(list, elt, link) \ do { \ ISC_LINK_INSIST(!ISC_LINK_LINKED(elt, link)); \ __ISC_LIST_APPENDUNSAFE(list, elt, link); \ } while (0) #define ISC_LIST_INITANDAPPEND(list, elt, link) \ __ISC_LIST_APPENDUNSAFE(list, elt, link) #define __ISC_LIST_UNLINKUNSAFE_TYPE(list, elt, link, type) \ do { \ if ((elt)->link.next != NULL) \ (elt)->link.next->link.prev = (elt)->link.prev; \ else { \ ISC_INSIST((list).tail == (elt)); \ (list).tail = (elt)->link.prev; \ } \ if ((elt)->link.prev != NULL) \ (elt)->link.prev->link.next = (elt)->link.next; \ else { \ ISC_INSIST((list).head == (elt)); \ (list).head = (elt)->link.next; \ } \ (elt)->link.prev = (type *)(-1); \ (elt)->link.next = (type *)(-1); \ ISC_INSIST((list).head != (elt)); \ ISC_INSIST((list).tail != (elt)); \ } while (0) #define __ISC_LIST_UNLINKUNSAFE(list, elt, link) \ __ISC_LIST_UNLINKUNSAFE_TYPE(list, elt, link, void) #define ISC_LIST_UNLINK_TYPE(list, elt, link, type) \ do { \ ISC_LINK_INSIST(ISC_LINK_LINKED(elt, link)); \ __ISC_LIST_UNLINKUNSAFE_TYPE(list, elt, link, type); \ } while (0) #define ISC_LIST_UNLINK(list, elt, link) \ ISC_LIST_UNLINK_TYPE(list, elt, link, void) #define ISC_LIST_PREV(elt, link) ((elt)->link.prev) #define ISC_LIST_NEXT(elt, link) ((elt)->link.next) #define __ISC_LIST_INSERTBEFOREUNSAFE(list, before, elt, link) \ do { \ if ((before)->link.prev == NULL) \ ISC_LIST_PREPEND(list, elt, link); \ else { \ (elt)->link.prev = (before)->link.prev; \ (before)->link.prev = (elt); \ (elt)->link.prev->link.next = (elt); \ (elt)->link.next = (before); \ } \ } while (0) #define ISC_LIST_INSERTBEFORE(list, before, elt, link) \ do { \ ISC_LINK_INSIST(ISC_LINK_LINKED(before, link)); \ ISC_LINK_INSIST(!ISC_LINK_LINKED(elt, link)); \ __ISC_LIST_INSERTBEFOREUNSAFE(list, before, elt, link); \ } while (0) #define __ISC_LIST_INSERTAFTERUNSAFE(list, after, elt, link) \ do { \ if ((after)->link.next == NULL) \ ISC_LIST_APPEND(list, elt, link); \ else { \ (elt)->link.next = (after)->link.next; \ (after)->link.next = (elt); \ (elt)->link.next->link.prev = (elt); \ (elt)->link.prev = (after); \ } \ } while (0) #define ISC_LIST_INSERTAFTER(list, after, elt, link) \ do { \ ISC_LINK_INSIST(ISC_LINK_LINKED(after, link)); \ ISC_LINK_INSIST(!ISC_LINK_LINKED(elt, link)); \ __ISC_LIST_INSERTAFTERUNSAFE(list, after, elt, link); \ } while (0) #define ISC_LIST_APPENDLIST(list1, list2, link) \ do { \ if (ISC_LIST_EMPTY(list1)) \ (list1) = (list2); \ else if (!ISC_LIST_EMPTY(list2)) { \ (list1).tail->link.next = (list2).head; \ (list2).head->link.prev = (list1).tail; \ (list1).tail = (list2).tail; \ } \ (list2).head = NULL; \ (list2).tail = NULL; \ } while (0) #define ISC_LIST_PREPENDLIST(list1, list2, link) \ do { \ if (ISC_LIST_EMPTY(list1)) \ (list1) = (list2); \ else if (!ISC_LIST_EMPTY(list2)) { \ (list2).tail->link.next = (list1).head; \ (list1).head->link.prev = (list2).tail; \ (list1).head = (list2).head; \ } \ (list2).head = NULL; \ (list2).tail = NULL; \ } while (0) #define ISC_LIST_ENQUEUE(list, elt, link) ISC_LIST_APPEND(list, elt, link) #define __ISC_LIST_ENQUEUEUNSAFE(list, elt, link) \ __ISC_LIST_APPENDUNSAFE(list, elt, link) #define ISC_LIST_DEQUEUE(list, elt, link) \ ISC_LIST_UNLINK_TYPE(list, elt, link, void) #define ISC_LIST_DEQUEUE_TYPE(list, elt, link, type) \ ISC_LIST_UNLINK_TYPE(list, elt, link, type) #define __ISC_LIST_DEQUEUEUNSAFE(list, elt, link) \ __ISC_LIST_UNLINKUNSAFE_TYPE(list, elt, link, void) #define __ISC_LIST_DEQUEUEUNSAFE_TYPE(list, elt, link, type) \ __ISC_LIST_UNLINKUNSAFE_TYPE(list, elt, link, type) #endif /* ISC_LIST_H */
Upload File
Create Folder