File Manager

X7ROOT File Manager

Current Path: /usr/include/bind9/isc

📁 ..
📄 aes.h(1.05 KB)
📄 app.h(10.23 KB)
📄 assertions.h(2.84 KB)
📄 atomic.h(4.07 KB)
📄 backtrace.h(3.8 KB)
📄 base32.h(4.35 KB)
📄 base64.h(2.8 KB)
📄 bind9.h(830 B)
📄 boolean.h(594 B)
📄 buffer.h(25.65 KB)
📄 bufferlist.h(1.42 KB)
📄 cmocka.h(1.35 KB)
📄 commandline.h(1.67 KB)
📄 condition.h(1.44 KB)
📄 counter.h(1.88 KB)
📄 crc64.h(998 B)
📄 deprecated.h(623 B)
📄 dir.h(1.56 KB)
📄 endian.h(4.67 KB)
📄 entropy.h(10.13 KB)
📄 errno.h(659 B)
📄 errno2result.h(902 B)
📄 error.h(1.4 KB)
📄 event.h(2.98 KB)
📄 eventclass.h(1.35 KB)
📄 file.h(11.39 KB)
📄 formatcheck.h(893 B)
📄 fsaccess.h(7.27 KB)
📄 hash.h(7.48 KB)
📄 heap.h(5.14 KB)
📄 hex.h(2.74 KB)
📄 hmacmd5.h(1.75 KB)
📄 hmacsha.h(4.41 KB)
📄 ht.h(4.29 KB)
📄 httpd.h(2.26 KB)
📄 int.h(1.06 KB)
📄 interfaceiter.h(3.05 KB)
📄 iterated_hash.h(1.02 KB)
📄 json.h(1.42 KB)
📄 keyboard.h(989 B)
📄 lang.h(637 B)
📄 lex.h(9.54 KB)
📄 lfsr.h(2.89 KB)
📄 lib.h(1.04 KB)
📄 likely.h(818 B)
📄 list.h(5.62 KB)
📄 log.h(28.06 KB)
📄 magic.h(994 B)
📄 md5.h(2.32 KB)
📄 mem.h(20.62 KB)
📄 meminfo.h(710 B)
📄 msgcat.h(2.66 KB)
📄 msgs.h(8.22 KB)
📄 mutex.h(3.44 KB)
📄 mutexblock.h(1.34 KB)
📄 net.h(10.29 KB)
📄 netaddr.h(4.48 KB)
📄 netdb.h(863 B)
📄 netscope.h(967 B)
📄 offset.h(700 B)
📄 once.h(983 B)
📄 ondestroy.h(2.73 KB)
📄 os.h(671 B)
📄 parseint.h(1.51 KB)
📄 platform.h(9.49 KB)
📄 pool.h(3.42 KB)
📄 portset.h(3.22 KB)
📄 print.h(2.42 KB)
📄 queue.h(5.08 KB)
📄 quota.h(2.38 KB)
📄 radix.h(6.34 KB)
📄 random.h(3.5 KB)
📄 ratelimiter.h(3.42 KB)
📄 refcount.h(8 KB)
📄 regex.h(767 B)
📄 region.h(1.99 KB)
📄 resource.h(2.79 KB)
📄 result.h(4.87 KB)
📄 resultclass.h(1.56 KB)
📄 rwlock.h(3.72 KB)
📄 safe.h(1.32 KB)
📄 serial.h(1.34 KB)
📄 sha1.h(1.52 KB)
📄 sha2.h(5.6 KB)
📄 siphash.h(734 B)
📄 sockaddr.h(5.9 KB)
📄 socket.h(35.8 KB)
📄 stat.h(806 B)
📄 stats.h(3.62 KB)
📄 stdatomic.h(5.13 KB)
📄 stdio.h(1.75 KB)
📄 stdlib.h(704 B)
📄 stdtime.h(1.04 KB)
📄 strerror.h(777 B)
📄 string.h(5.88 KB)
📄 symtab.h(4.22 KB)
📄 syslog.h(844 B)
📄 task.h(21.04 KB)
📄 taskpool.h(3.62 KB)
📄 thread.h(1.47 KB)
📄 time.h(8.67 KB)
📄 timer.h(10.54 KB)
📄 tm.h(895 B)
📄 types.h(5.64 KB)
📄 utf8.h(928 B)
📄 util.h(10.29 KB)
📄 version.h(689 B)
📄 xml.h(1.07 KB)

Editing: 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 */

X7ROOT File Manager

Editing: queue.h

Upload File

Create Folder