Geforce File Manager

NAME	SIZE	ACTIONS
📄 aes.h	1,080 B	[ EDIT ] \| [ DEL ]
📄 app.h	10,478 B	[ EDIT ] \| [ DEL ]
📄 assertions.h	2,907 B	[ EDIT ] \| [ DEL ]
📄 atomic.h	4,168 B	[ EDIT ] \| [ DEL ]
📄 backtrace.h	3,891 B	[ EDIT ] \| [ DEL ]
📄 base32.h	4,453 B	[ EDIT ] \| [ DEL ]
📄 base64.h	2,866 B	[ EDIT ] \| [ DEL ]
📄 bind9.h	830 B	[ EDIT ] \| [ DEL ]
📄 boolean.h	594 B	[ EDIT ] \| [ DEL ]
📄 buffer.h	26,268 B	[ EDIT ] \| [ DEL ]
📄 bufferlist.h	1,452 B	[ EDIT ] \| [ DEL ]
📄 cmocka.h	1,383 B	[ EDIT ] \| [ DEL ]
📄 commandline.h	1,713 B	[ EDIT ] \| [ DEL ]
📄 condition.h	1,478 B	[ EDIT ] \| [ DEL ]
📄 counter.h	1,926 B	[ EDIT ] \| [ DEL ]
📄 crc64.h	998 B	[ EDIT ] \| [ DEL ]
📄 deprecated.h	623 B	[ EDIT ] \| [ DEL ]
📄 dir.h	1,598 B	[ EDIT ] \| [ DEL ]
📄 endian.h	4,778 B	[ EDIT ] \| [ DEL ]
📄 entropy.h	10,373 B	[ EDIT ] \| [ DEL ]
📄 errno.h	659 B	[ EDIT ] \| [ DEL ]
📄 errno2result.h	902 B	[ EDIT ] \| [ DEL ]
📄 error.h	1,430 B	[ EDIT ] \| [ DEL ]
📄 event.h	3,053 B	[ EDIT ] \| [ DEL ]
📄 eventclass.h	1,381 B	[ EDIT ] \| [ DEL ]
📄 file.h	11,667 B	[ EDIT ] \| [ DEL ]
📄 formatcheck.h	893 B	[ EDIT ] \| [ DEL ]
📄 fsaccess.h	7,442 B	[ EDIT ] \| [ DEL ]
📄 hash.h	7,662 B	[ EDIT ] \| [ DEL ]
📄 heap.h	5,264 B	[ EDIT ] \| [ DEL ]
📄 hex.h	2,806 B	[ EDIT ] \| [ DEL ]
📄 hmacmd5.h	1,787 B	[ EDIT ] \| [ DEL ]
📄 hmacsha.h	4,511 B	[ EDIT ] \| [ DEL ]
📄 ht.h	4,396 B	[ EDIT ] \| [ DEL ]
📄 httpd.h	2,318 B	[ EDIT ] \| [ DEL ]
📄 int.h	1,088 B	[ EDIT ] \| [ DEL ]
📄 interfaceiter.h	3,120 B	[ EDIT ] \| [ DEL ]
📄 iterated_hash.h	1,046 B	[ EDIT ] \| [ DEL ]
📄 json.h	1,459 B	[ EDIT ] \| [ DEL ]
📄 keyboard.h	989 B	[ EDIT ] \| [ DEL ]
📄 lang.h	637 B	[ EDIT ] \| [ DEL ]
📄 lex.h	9,771 B	[ EDIT ] \| [ DEL ]
📄 lfsr.h	2,958 B	[ EDIT ] \| [ DEL ]
📄 lib.h	1,068 B	[ EDIT ] \| [ DEL ]
📄 likely.h	818 B	[ EDIT ] \| [ DEL ]
📄 list.h	5,751 B	[ EDIT ] \| [ DEL ]
📄 log.h	28,734 B	[ EDIT ] \| [ DEL ]
📄 magic.h	994 B	[ EDIT ] \| [ DEL ]
📄 md5.h	2,380 B	[ EDIT ] \| [ DEL ]
📄 mem.h	21,110 B	[ EDIT ] \| [ DEL ]
📄 meminfo.h	710 B	[ EDIT ] \| [ DEL ]
📄 msgcat.h	2,726 B	[ EDIT ] \| [ DEL ]
📄 msgs.h	8,422 B	[ EDIT ] \| [ DEL ]
📄 mutex.h	3,524 B	[ EDIT ] \| [ DEL ]
📄 mutexblock.h	1,375 B	[ EDIT ] \| [ DEL ]
📄 net.h	10,534 B	[ EDIT ] \| [ DEL ]
📄 netaddr.h	4,590 B	[ EDIT ] \| [ DEL ]
📄 netdb.h	863 B	[ EDIT ] \| [ DEL ]
📄 netscope.h	967 B	[ EDIT ] \| [ DEL ]
📄 offset.h	700 B	[ EDIT ] \| [ DEL ]
📄 once.h	983 B	[ EDIT ] \| [ DEL ]
📄 ondestroy.h	2,799 B	[ EDIT ] \| [ DEL ]
📄 os.h	671 B	[ EDIT ] \| [ DEL ]
📄 parseint.h	1,542 B	[ EDIT ] \| [ DEL ]
📄 platform.h	9,717 B	[ EDIT ] \| [ DEL ]
📄 pool.h	3,502 B	[ EDIT ] \| [ DEL ]
📄 portset.h	3,295 B	[ EDIT ] \| [ DEL ]
📄 print.h	2,475 B	[ EDIT ] \| [ DEL ]
📄 queue.h	5,204 B	[ EDIT ] \| [ DEL ]
📄 quota.h	2,440 B	[ EDIT ] \| [ DEL ]
📄 radix.h	6,491 B	[ EDIT ] \| [ DEL ]
📄 random.h	3,582 B	[ EDIT ] \| [ DEL ]
📄 ratelimiter.h	3,497 B	[ EDIT ] \| [ DEL ]
📄 refcount.h	8,193 B	[ EDIT ] \| [ DEL ]
📄 regex.h	767 B	[ EDIT ] \| [ DEL ]
📄 region.h	2,034 B	[ EDIT ] \| [ DEL ]
📄 resource.h	2,862 B	[ EDIT ] \| [ DEL ]
📄 result.h	4,982 B	[ EDIT ] \| [ DEL ]
📄 resultclass.h	1,599 B	[ EDIT ] \| [ DEL ]
📄 rwlock.h	3,807 B	[ EDIT ] \| [ DEL ]
📄 safe.h	1,352 B	[ EDIT ] \| [ DEL ]
📄 serial.h	1,368 B	[ EDIT ] \| [ DEL ]
📄 sha1.h	1,556 B	[ EDIT ] \| [ DEL ]
📄 sha2.h	5,733 B	[ EDIT ] \| [ DEL ]
📄 siphash.h	734 B	[ EDIT ] \| [ DEL ]
📄 sockaddr.h	6,039 B	[ EDIT ] \| [ DEL ]
📄 socket.h	36,655 B	[ EDIT ] \| [ DEL ]
📄 stat.h	806 B	[ EDIT ] \| [ DEL ]
📄 stats.h	3,709 B	[ EDIT ] \| [ DEL ]
📄 stdatomic.h	5,250 B	[ EDIT ] \| [ DEL ]
📄 stdio.h	1,787 B	[ EDIT ] \| [ DEL ]
📄 stdlib.h	704 B	[ EDIT ] \| [ DEL ]
📄 stdtime.h	1,065 B	[ EDIT ] \| [ DEL ]
📄 strerror.h	777 B	[ EDIT ] \| [ DEL ]
📄 string.h	6,019 B	[ EDIT ] \| [ DEL ]
📄 symtab.h	4,326 B	[ EDIT ] \| [ DEL ]
📄 syslog.h	844 B	[ EDIT ] \| [ DEL ]
📄 task.h	21,544 B	[ EDIT ] \| [ DEL ]
📄 taskpool.h	3,709 B	[ EDIT ] \| [ DEL ]
📄 thread.h	1,506 B	[ EDIT ] \| [ DEL ]
📄 time.h	8,876 B	[ EDIT ] \| [ DEL ]
📄 timer.h	10,795 B	[ EDIT ] \| [ DEL ]
📄 tm.h	895 B	[ EDIT ] \| [ DEL ]
📄 types.h	5,780 B	[ EDIT ] \| [ DEL ]
📄 utf8.h	928 B	[ EDIT ] \| [ DEL ]
📄 util.h	10,537 B	[ EDIT ] \| [ DEL ]
📄 version.h	689 B	[ EDIT ] \| [ DEL ]
📄 xml.h	1,094 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

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