System
:
Linux server1.ontime-gulf.com 4.18.0-553.5.1.el8_10.x86_64 #1 SMP Wed Jun 5 09:12:13 EDT 2024 x86_64
Software
:
Apache
Server
:
162.0.230.206
Domains
:
40 Domain
Permission
:
[
drwxr-xr-x
]
:
/
usr
/
include
/
bind9
/
isc
/
216.73.216.49
Select
Submit
Home
Add User
Mailer
About
DBName
DBUser
DBPass
DBHost
WpUser
WpPass
Input e-mail
ACUPOFTEA for mail.ontime-ae.com made by tabagkayu.
Folder Name
File Name
File Content
File
queue.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. */ /* * This is a generic implementation of a two-lock concurrent queue. * There are built-in mutex locks for the head and tail of the queue, * allowing elements to be safely added and removed at the same time. * * NULL is "end of list" * -1 is "not linked" */ #ifndef ISC_QUEUE_H #define ISC_QUEUE_H 1 #include <stdbool.h> #include <isc/assertions.h> #include <isc/mutex.h> #ifdef ISC_QUEUE_CHECKINIT #define ISC_QLINK_INSIST(x) ISC_INSIST(x) #else #define ISC_QLINK_INSIST(x) (void)0 #endif #define ISC_QLINK(type) struct { type *prev, *next; } #define ISC_QLINK_INIT(elt, link) \ do { \ (elt)->link.next = (elt)->link.prev = (void *)(-1); \ } while(0) #define ISC_QLINK_LINKED(elt, link) ((void*)(elt)->link.next != (void*)(-1)) #define ISC_QUEUE(type) struct { \ type *head, *tail; \ isc_mutex_t headlock, taillock; \ } #define ISC_QUEUE_INIT(queue, link) \ do { \ (void) isc_mutex_init(&(queue).taillock); \ (void) isc_mutex_init(&(queue).headlock); \ (queue).tail = (queue).head = NULL; \ } while (0) #define ISC_QUEUE_EMPTY(queue) ((queue).head == NULL) #define ISC_QUEUE_DESTROY(queue) \ do { \ ISC_QLINK_INSIST(ISC_QUEUE_EMPTY(queue)); \ (void) isc_mutex_destroy(&(queue).taillock); \ (void) isc_mutex_destroy(&(queue).headlock); \ } while (0) /* * queues are meant to separate the locks at either end. For best effect, that * means keeping the ends separate - i.e. non-empty queues work best. * * a push to an empty queue has to take the pop lock to update * the pop side of the queue. * Popping the last entry has to take the push lock to update * the push side of the queue. * * The order is (pop, push), because a pop is presumably in the * latency path and a push is when we're done. * * We do an MT hot test in push to see if we need both locks, so we can * acquire them in order. Hopefully that makes the case where we get * the push lock and find we need the pop lock (and have to release it) rare. * * > 1 entry - no collision, push works on one end, pop on the other * 0 entry - headlock race * pop wins - return(NULL), push adds new as both head/tail * push wins - updates head/tail, becomes 1 entry case. * 1 entry - taillock race * pop wins - return(pop) sets head/tail NULL, becomes 0 entry case * push wins - updates {head,tail}->link.next, pop updates head * with new ->link.next and doesn't update tail * */ #define ISC_QUEUE_PUSH(queue, elt, link) \ do { \ bool headlocked = false; \ ISC_QLINK_INSIST(!ISC_QLINK_LINKED(elt, link)); \ LOCK(&(queue).taillock); \ if ((queue).tail == NULL) { \ UNLOCK(&(queue).taillock); \ LOCK(&(queue).headlock); \ LOCK(&(queue).taillock); \ headlocked = true; \ } \ (elt)->link.prev = (queue).tail; \ (elt)->link.next = NULL; \ if ((queue).tail != NULL) \ (queue).tail->link.next = (elt); \ (queue).tail = (elt); \ UNLOCK(&(queue).taillock); \ if (headlocked) { \ if ((queue).head == NULL) \ (queue).head = (elt); \ UNLOCK(&(queue).headlock); \ } \ } while (0) #define ISC_QUEUE_POP(queue, link, ret) \ do { \ LOCK(&(queue).headlock); \ ret = (queue).head; \ while (ret != NULL) { \ if (ret->link.next == NULL) { \ LOCK(&(queue).taillock); \ if (ret->link.next == NULL) { \ (queue).head = (queue).tail = NULL; \ UNLOCK(&(queue).taillock); \ break; \ }\ UNLOCK(&(queue).taillock); \ } \ (queue).head = ret->link.next; \ (queue).head->link.prev = NULL; \ break; \ } \ UNLOCK(&(queue).headlock); \ if (ret != NULL) \ (ret)->link.next = (ret)->link.prev = (void *)(-1); \ } while(0) #define ISC_QUEUE_UNLINK(queue, elt, link) \ do { \ ISC_QLINK_INSIST(ISC_QLINK_LINKED(elt, link)); \ LOCK(&(queue).headlock); \ LOCK(&(queue).taillock); \ if ((elt)->link.prev == NULL) \ (queue).head = (elt)->link.next; \ else \ (elt)->link.prev->link.next = (elt)->link.next; \ if ((elt)->link.next == NULL) \ (queue).tail = (elt)->link.prev; \ else \ (elt)->link.next->link.prev = (elt)->link.prev; \ UNLOCK(&(queue).taillock); \ UNLOCK(&(queue).headlock); \ (elt)->link.next = (elt)->link.prev = (void *)(-1); \ } while(0) #define ISC_QUEUE_UNLINKIFLINKED(queue, elt, link) \ do { \ LOCK(&(queue).headlock); \ LOCK(&(queue).taillock); \ if (ISC_QLINK_LINKED(elt, link)) { \ if ((elt)->link.prev == NULL) \ (queue).head = (elt)->link.next; \ else \ (elt)->link.prev->link.next = (elt)->link.next; \ if ((elt)->link.next == NULL) \ (queue).tail = (elt)->link.prev; \ else \ (elt)->link.next->link.prev = (elt)->link.prev; \ } \ UNLOCK(&(queue).taillock); \ UNLOCK(&(queue).headlock); \ (elt)->link.next = (elt)->link.prev = (void *)(-1); \ } while(0) #endif /* ISC_QUEUE_H */
New name for
Are you sure will delete
?
New date for
New perm for
Name
Type
Size
Permission
Last Modified
Actions
.
DIR
-
drwxr-xr-x
2025-02-21 10:57:15
..
DIR
-
drwxr-xr-x
2025-02-21 10:57:16
aes.h
text/x-c
1.05 KB
-rw-r--r--
2025-02-20 09:05:24
app.h
text/x-c
10.23 KB
-rw-r--r--
2025-02-20 09:05:24
assertions.h
text/x-c
2.84 KB
-rw-r--r--
2025-02-20 09:05:24
atomic.h
text/x-c
4.07 KB
-rw-r--r--
2025-02-20 09:05:24
backtrace.h
text/x-c
3.8 KB
-rw-r--r--
2025-02-20 09:05:24
base32.h
text/x-c
4.35 KB
-rw-r--r--
2025-02-20 09:05:24
base64.h
text/x-c
2.8 KB
-rw-r--r--
2025-02-20 09:05:24
bind9.h
text/x-c
830 B
-rw-r--r--
2025-02-20 09:05:24
boolean.h
text/plain
594 B
-rw-r--r--
2025-02-20 09:05:24
buffer.h
text/x-c
25.65 KB
-rw-r--r--
2025-02-20 09:05:24
bufferlist.h
text/x-c
1.42 KB
-rw-r--r--
2025-02-20 09:05:24
cmocka.h
text/x-c
1.35 KB
-rw-r--r--
2025-02-20 09:05:24
commandline.h
text/x-c
1.67 KB
-rw-r--r--
2025-02-20 09:05:24
condition.h
text/x-c
1.44 KB
-rw-r--r--
2025-02-20 09:05:24
counter.h
text/x-c
1.88 KB
-rw-r--r--
2025-02-20 09:05:24
crc64.h
text/x-c
998 B
-rw-r--r--
2025-02-20 09:05:24
deprecated.h
text/plain
623 B
-rw-r--r--
2025-02-20 09:05:24
dir.h
text/x-c
1.56 KB
-rw-r--r--
2025-02-20 09:05:24
endian.h
text/x-c
4.67 KB
-rw-r--r--
2025-02-20 09:05:24
entropy.h
text/x-c
10.13 KB
-rw-r--r--
2025-02-20 09:05:24
errno.h
text/x-c
659 B
-rw-r--r--
2025-02-20 09:05:24
errno2result.h
text/x-c
902 B
-rw-r--r--
2025-02-20 09:05:37
error.h
text/x-c
1.4 KB
-rw-r--r--
2025-02-20 09:05:24
event.h
text/x-c
2.98 KB
-rw-r--r--
2025-02-20 09:05:24
eventclass.h
text/plain
1.35 KB
-rw-r--r--
2025-02-20 09:05:24
file.h
text/x-c
11.39 KB
-rw-r--r--
2025-02-20 09:05:24
formatcheck.h
text/plain
893 B
-rw-r--r--
2025-02-20 09:05:24
fsaccess.h
text/x-c
7.27 KB
-rw-r--r--
2025-02-20 09:05:24
hash.h
text/x-c
7.48 KB
-rw-r--r--
2025-02-20 09:05:24
heap.h
text/x-c
5.14 KB
-rw-r--r--
2025-02-20 09:05:24
hex.h
text/x-c
2.74 KB
-rw-r--r--
2025-02-20 09:05:24
hmacmd5.h
text/x-c
1.75 KB
-rw-r--r--
2025-02-20 09:05:24
hmacsha.h
text/x-c
4.41 KB
-rw-r--r--
2025-02-20 09:05:24
ht.h
text/x-c
4.29 KB
-rw-r--r--
2025-02-20 09:05:24
httpd.h
text/x-c
2.26 KB
-rw-r--r--
2025-02-20 09:05:24
int.h
text/x-c
1.06 KB
-rw-r--r--
2025-02-20 09:05:24
interfaceiter.h
text/x-c
3.05 KB
-rw-r--r--
2025-02-20 09:05:24
iterated_hash.h
text/x-c
1.02 KB
-rw-r--r--
2025-02-20 09:05:24
json.h
text/x-c
1.42 KB
-rw-r--r--
2025-02-20 09:05:24
keyboard.h
text/x-c
989 B
-rw-r--r--
2025-02-20 09:05:24
lang.h
text/plain
637 B
-rw-r--r--
2025-02-20 09:05:24
lex.h
text/x-c
9.54 KB
-rw-r--r--
2025-02-20 09:05:24
lfsr.h
text/x-c
2.89 KB
-rw-r--r--
2025-02-20 09:05:24
lib.h
text/x-c
1.04 KB
-rw-r--r--
2025-02-20 09:05:24
likely.h
text/plain
818 B
-rw-r--r--
2025-02-20 09:05:24
list.h
text/x-c
5.62 KB
-rw-r--r--
2025-02-20 09:05:24
log.h
text/x-c
28.06 KB
-rw-r--r--
2025-02-20 09:05:24
magic.h
text/x-c
994 B
-rw-r--r--
2025-02-20 09:05:24
md5.h
text/x-c
2.32 KB
-rw-r--r--
2025-02-20 09:05:24
mem.h
text/x-c
20.62 KB
-rw-r--r--
2025-02-20 09:05:24
meminfo.h
text/x-c
710 B
-rw-r--r--
2025-02-20 09:05:24
msgcat.h
text/x-c
2.66 KB
-rw-r--r--
2025-02-20 09:05:24
msgs.h
text/x-c
8.22 KB
-rw-r--r--
2025-02-20 09:05:24
mutex.h
text/x-c
3.44 KB
-rw-r--r--
2025-02-20 09:05:24
mutexblock.h
text/x-c
1.34 KB
-rw-r--r--
2025-02-20 09:05:24
net.h
text/x-c
10.29 KB
-rw-r--r--
2025-02-20 09:05:24
netaddr.h
text/x-c
4.48 KB
-rw-r--r--
2025-02-20 09:05:24
netdb.h
text/x-c
863 B
-rw-r--r--
2025-02-20 09:05:24
netscope.h
text/x-c
967 B
-rw-r--r--
2025-02-20 09:05:24
offset.h
text/x-c
700 B
-rw-r--r--
2025-02-20 09:05:24
once.h
text/x-c
983 B
-rw-r--r--
2025-02-20 09:05:24
ondestroy.h
text/x-c
2.73 KB
-rw-r--r--
2025-02-20 09:05:24
os.h
text/x-c
671 B
-rw-r--r--
2025-02-20 09:05:24
parseint.h
text/x-c
1.51 KB
-rw-r--r--
2025-02-20 09:05:24
platform.h
text/x-c
9.49 KB
-rw-r--r--
2025-02-20 09:05:24
pool.h
text/x-c
3.42 KB
-rw-r--r--
2025-02-20 09:05:24
portset.h
text/x-c
3.22 KB
-rw-r--r--
2025-02-20 09:05:24
print.h
text/x-c
2.42 KB
-rw-r--r--
2025-02-20 09:05:24
queue.h
text/x-c
5.08 KB
-rw-r--r--
2025-02-20 09:05:24
quota.h
text/x-c
2.38 KB
-rw-r--r--
2025-02-20 09:05:24
radix.h
text/x-c
6.34 KB
-rw-r--r--
2025-02-20 09:05:24
random.h
text/x-c
3.5 KB
-rw-r--r--
2025-02-20 09:05:24
ratelimiter.h
text/x-c
3.42 KB
-rw-r--r--
2025-02-20 09:05:24
refcount.h
text/x-c
8 KB
-rw-r--r--
2025-02-20 09:05:24
regex.h
text/x-c
767 B
-rw-r--r--
2025-02-20 09:05:24
region.h
text/x-c
1.99 KB
-rw-r--r--
2025-02-20 09:05:24
resource.h
text/x-c
2.79 KB
-rw-r--r--
2025-02-20 09:05:24
result.h
text/x-c
4.87 KB
-rw-r--r--
2025-02-20 09:05:24
resultclass.h
text/plain
1.56 KB
-rw-r--r--
2025-02-20 09:05:24
rwlock.h
text/x-c
3.72 KB
-rw-r--r--
2025-02-20 09:05:24
safe.h
text/x-c
1.32 KB
-rw-r--r--
2025-02-20 09:05:24
serial.h
text/x-c
1.34 KB
-rw-r--r--
2025-02-20 09:05:24
sha1.h
text/x-c
1.52 KB
-rw-r--r--
2025-02-20 09:05:24
sha2.h
text/x-c
5.6 KB
-rw-r--r--
2025-02-20 09:05:24
siphash.h
text/x-c
734 B
-rw-r--r--
2025-02-20 09:05:24
sockaddr.h
text/x-c
5.9 KB
-rw-r--r--
2025-02-20 09:05:24
socket.h
text/x-c
35.8 KB
-rw-r--r--
2025-02-20 09:05:24
stat.h
text/x-c
806 B
-rw-r--r--
2025-02-20 09:05:24
stats.h
text/x-c
3.62 KB
-rw-r--r--
2025-02-20 09:05:24
stdatomic.h
text/plain
5.13 KB
-rw-r--r--
2025-02-20 09:05:24
stdio.h
text/x-c
1.75 KB
-rw-r--r--
2025-02-20 09:05:24
stdlib.h
text/x-c
704 B
-rw-r--r--
2025-02-20 09:05:24
stdtime.h
text/x-c
1.04 KB
-rw-r--r--
2025-02-20 09:05:24
strerror.h
text/x-c
777 B
-rw-r--r--
2025-02-20 09:05:24
string.h
text/x-c
5.88 KB
-rw-r--r--
2025-02-20 09:05:24
symtab.h
text/x-c
4.22 KB
-rw-r--r--
2025-02-20 09:05:24
syslog.h
text/x-c
844 B
-rw-r--r--
2025-02-20 09:05:24
task.h
text/x-c
21.04 KB
-rw-r--r--
2025-02-20 09:05:24
taskpool.h
text/x-c
3.62 KB
-rw-r--r--
2025-02-20 09:05:24
thread.h
text/x-c
1.47 KB
-rw-r--r--
2025-02-20 09:05:24
time.h
text/x-c
8.67 KB
-rw-r--r--
2025-02-20 09:05:24
timer.h
text/x-c
10.54 KB
-rw-r--r--
2025-02-20 09:05:24
tm.h
text/x-c
895 B
-rw-r--r--
2025-02-20 09:05:24
types.h
text/x-c
5.64 KB
-rw-r--r--
2025-02-20 09:05:24
utf8.h
text/x-c
928 B
-rw-r--r--
2025-02-20 09:05:24
util.h
text/x-c
10.29 KB
-rw-r--r--
2025-02-20 09:05:24
version.h
text/x-c
689 B
-rw-r--r--
2025-02-20 09:05:24
xml.h
text/x-c
1.07 KB
-rw-r--r--
2025-02-20 09:05:24
~ ACUPOFTEA - mail.ontime-ae.com