PATH: //usr/include/bind9/isc
FILE_BARU
CREATE
FOLDER_BARU
MKDIR
UPLOAD_FILE
GO
[ .. KEMBALI ]
📄 aes.h
↓
X
📄 align.h
↓
X
📄 app.h
↓
X
📄 assertions.h
↓
X
📄 astack.h
↓
X
📄 atomic.h
↓
X
📄 backtrace.h
↓
X
📄 barrier.h
↓
X
📄 base32.h
↓
X
📄 base64.h
↓
X
📄 bind9.h
↓
X
📄 buffer.h
↓
X
📄 bufferlist.h
↓
X
📄 cmocka.h
↓
X
📄 commandline.h
↓
X
📄 condition.h
↓
X
📄 counter.h
↓
X
📄 crc64.h
↓
X
📄 deprecated.h
↓
X
📄 dir.h
↓
X
📄 endian.h
↓
X
📄 errno.h
↓
X
📄 errno2result.h
↓
X
📄 error.h
↓
X
📄 event.h
↓
X
📄 eventclass.h
↓
X
📄 file.h
↓
X
📄 formatcheck.h
↓
X
📄 fsaccess.h
↓
X
📄 fuzz.h
↓
X
📄 hash.h
↓
X
📄 heap.h
↓
X
📄 hex.h
↓
X
📄 hmac.h
↓
X
📄 hp.h
↓
X
📄 ht.h
↓
X
📄 httpd.h
↓
X
📄 interfaceiter.h
↓
X
📄 iterated_hash.h
↓
X
📄 lang.h
↓
X
📄 lex.h
↓
X
📄 lfsr.h
↓
X
📄 lib.h
↓
X
📄 likely.h
↓
X
📄 list.h
↓
X
📄 log.h
↓
X
📄 magic.h
↓
X
📄 managers.h
↓
X
📄 md.h
↓
X
📄 mem.h
↓
X
📄 meminfo.h
↓
X
📄 mutex.h
↓
X
📄 mutexatomic.h
↓
X
📄 mutexblock.h
↓
X
📄 net.h
↓
X
📄 netaddr.h
↓
X
📄 netdb.h
↓
X
📄 netmgr.h
↓
X
📄 netscope.h
↓
X
📄 nonce.h
↓
X
📄 offset.h
↓
X
📄 once.h
↓
X
📄 os.h
↓
X
📄 parseint.h
↓
X
📄 platform.h
↓
X
📄 pool.h
↓
X
📄 portset.h
↓
X
📄 print.h
↓
X
📄 queue.h
↓
X
📄 quota.h
↓
X
📄 radix.h
↓
X
📄 random.h
↓
X
📄 ratelimiter.h
↓
X
📄 refcount.h
↓
X
📄 regex.h
↓
X
📄 region.h
↓
X
📄 resource.h
↓
X
📄 result.h
↓
X
📄 resultclass.h
↓
X
📄 rwlock.h
↓
X
📄 safe.h
↓
X
📄 serial.h
↓
X
📄 siphash.h
↓
X
📄 sockaddr.h
↓
X
📄 socket.h
↓
X
📄 stat.h
↓
X
📄 stats.h
↓
X
📄 stdatomic.h
↓
X
📄 stdio.h
↓
X
📄 stdtime.h
↓
X
📄 strerr.h
↓
X
📄 string.h
↓
X
📄 symtab.h
↓
X
📄 syslog.h
↓
X
📄 task.h
↓
X
📄 taskpool.h
↓
X
📄 thread.h
↓
X
📄 time.h
↓
X
📄 timer.h
↓
X
📄 tm.h
↓
X
📄 types.h
↓
X
📄 url.h
↓
X
📄 utf8.h
↓
X
📄 util.h
↓
X
📄 version.h
↓
X
SAVING...
BERHASIL DIUBAH!
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 https://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/assertions.h> #ifdef ISC_LIST_CHECKINIT #define ISC_LINK_INSIST(x) ISC_INSIST(x) #else /* ifdef ISC_LIST_CHECKINIT */ #define ISC_LINK_INSIST(x) #endif /* ifdef ISC_LIST_CHECKINIT */ #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) ((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 */
SIMPAN PERUBAHAN