kc3-lang/libevent/compat/sys/queue.h

• Show log

  Commit

• Hash : cb9da0bf
  Author :
  Date : 2012-02-29T15:07:32
  

  Fix all identifiers with names beginning with underscore.
  
  These are reserved in C.  We'd been erroneously using them to indicate
  internal use.
  
  Instead, we now use a trailing underscore whenever we'd been using a leading
  underscore.
  
  This is an automatic conversion.  The script that produced was made by
  running the following script over the output of
  
   git ls-tree -r --name-only HEAD | grep  '\.[ch]$' | \
     xargs ctags --c-kinds=defglmpstuvx -o - | grep '^_' | \
     cut -f 1 | sort| uniq
  
  (GNU ctags was required.)
  
  =====
  #!/usr/bin/perl -w -n
  
  use strict;
  
  BEGIN { print "#!/usr/bin/perl -w -i -p\n\n"; }
  
  chomp;
  
  next if (/^__func__/ or
  	 /^_FILE_OFFSET_BITS/ or
  	 /^_FORTIFY_SOURCE/ or
  	 /^_GNU_SOURCE/ or
  	 /^_WIN32/ or
  	 /^_DARWIN_UNLIMITED/ or
  	 /^_FILE_OFFSET_BITS/ or
  	 /^_LARGEFILE64_SOURCE/ or
  	 /^_LFS64_LARGEFILE/ or
  	 /^__cdecl/ or
  	 /^__attribute__/ or
  	 /^__func__/ or
           /^_SYS_TREE_H_/);
  
  my $ident = $_;
  
  my $better = $ident;
  $better =~ s/^_//;
  
  if ($ident !~ /EVENT_LOG_/) {
      $better = "${better}_";
  }
  
  print "s/(?<![A-Za-z0-9_])$ident(?![A-Za-z0-9_])/$better/g;\n";
  
  === And then running the script below that it generated over all
  === the .c and .h files again
  #!/usr/bin/perl -w -i -p
  
  s/(?<![A-Za-z0-9_])_ARC4_LOCK(?![A-Za-z0-9_])/ARC4_LOCK_/g;
  s/(?<![A-Za-z0-9_])_ARC4_UNLOCK(?![A-Za-z0-9_])/ARC4_UNLOCK_/g;
  s/(?<![A-Za-z0-9_])_bev_group_random_element(?![A-Za-z0-9_])/bev_group_random_element_/g;
  s/(?<![A-Za-z0-9_])_bev_group_refill_callback(?![A-Za-z0-9_])/bev_group_refill_callback_/g;
  s/(?<![A-Za-z0-9_])_bev_group_suspend_reading(?![A-Za-z0-9_])/bev_group_suspend_reading_/g;
  s/(?<![A-Za-z0-9_])_bev_group_suspend_writing(?![A-Za-z0-9_])/bev_group_suspend_writing_/g;
  s/(?<![A-Za-z0-9_])_bev_group_unsuspend_reading(?![A-Za-z0-9_])/bev_group_unsuspend_reading_/g;
  s/(?<![A-Za-z0-9_])_bev_group_unsuspend_writing(?![A-Za-z0-9_])/bev_group_unsuspend_writing_/g;
  s/(?<![A-Za-z0-9_])_bev_refill_callback(?![A-Za-z0-9_])/bev_refill_callback_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_add_event(?![A-Za-z0-9_])/bufferevent_add_event_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_cancel_all(?![A-Za-z0-9_])/bufferevent_cancel_all_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_decref_and_unlock(?![A-Za-z0-9_])/bufferevent_decref_and_unlock_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_decrement_read_buckets(?![A-Za-z0-9_])/bufferevent_decrement_read_buckets_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_decrement_write_buckets(?![A-Za-z0-9_])/bufferevent_decrement_write_buckets_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_del_generic_timeout_cbs(?![A-Za-z0-9_])/bufferevent_del_generic_timeout_cbs_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_generic_adj_timeouts(?![A-Za-z0-9_])/bufferevent_generic_adj_timeouts_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_get_read_max(?![A-Za-z0-9_])/bufferevent_get_read_max_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_get_rlim_max(?![A-Za-z0-9_])/bufferevent_get_rlim_max_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_get_write_max(?![A-Za-z0-9_])/bufferevent_get_write_max_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_incref_and_lock(?![A-Za-z0-9_])/bufferevent_incref_and_lock_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_init_generic_timeout_cbs(?![A-Za-z0-9_])/bufferevent_init_generic_timeout_cbs_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_ratelim_init(?![A-Za-z0-9_])/bufferevent_ratelim_init_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_run_eventcb(?![A-Za-z0-9_])/bufferevent_run_eventcb_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_run_readcb(?![A-Za-z0-9_])/bufferevent_run_readcb_/g;
  s/(?<![A-Za-z0-9_])_bufferevent_run_writecb(?![A-Za-z0-9_])/bufferevent_run_writecb_/g;
  s/(?<![A-Za-z0-9_])_ev(?![A-Za-z0-9_])/ev_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_chain_pin(?![A-Za-z0-9_])/evbuffer_chain_pin_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_chain_unpin(?![A-Za-z0-9_])/evbuffer_chain_unpin_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_decref_and_unlock(?![A-Za-z0-9_])/evbuffer_decref_and_unlock_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_expand_fast(?![A-Za-z0-9_])/evbuffer_expand_fast_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_incref(?![A-Za-z0-9_])/evbuffer_incref_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_incref_and_lock(?![A-Za-z0-9_])/evbuffer_incref_and_lock_/g;
  s/(?<![A-Za-z0-9_])_EVBUFFER_IOVEC_IS_NATIVE(?![A-Za-z0-9_])/EVBUFFER_IOVEC_IS_NATIVE_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_overlapped_get_fd(?![A-Za-z0-9_])/evbuffer_overlapped_get_fd_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_overlapped_set_fd(?![A-Za-z0-9_])/evbuffer_overlapped_set_fd_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_read_setup_vecs(?![A-Za-z0-9_])/evbuffer_read_setup_vecs_/g;
  s/(?<![A-Za-z0-9_])_evbuffer_validate(?![A-Za-z0-9_])/evbuffer_validate_/g;
  s/(?<![A-Za-z0-9_])_evdns_log(?![A-Za-z0-9_])/evdns_log_/g;
  s/(?<![A-Za-z0-9_])_evdns_nameserver_add_impl(?![A-Za-z0-9_])/evdns_nameserver_add_impl_/g;
  s/(?<![A-Za-z0-9_])_EVENT_CONFIG_H_(?![A-Za-z0-9_])/EVENT_CONFIG_H__/g;
  s/(?<![A-Za-z0-9_])_event_debug_assert_is_setup(?![A-Za-z0-9_])/event_debug_assert_is_setup_/g;
  s/(?<![A-Za-z0-9_])_event_debug_assert_not_added(?![A-Za-z0-9_])/event_debug_assert_not_added_/g;
  s/(?<![A-Za-z0-9_])_event_debug_get_logging_mask(?![A-Za-z0-9_])/event_debug_get_logging_mask_/g;
  s/(?<![A-Za-z0-9_])_event_debug_logging_mask(?![A-Za-z0-9_])/event_debug_logging_mask_/g;
  s/(?<![A-Za-z0-9_])_event_debug_map_lock(?![A-Za-z0-9_])/event_debug_map_lock_/g;
  s/(?<![A-Za-z0-9_])_event_debug_mode_on(?![A-Za-z0-9_])/event_debug_mode_on_/g;
  s/(?<![A-Za-z0-9_])_event_debug_note_add(?![A-Za-z0-9_])/event_debug_note_add_/g;
  s/(?<![A-Za-z0-9_])_event_debug_note_del(?![A-Za-z0-9_])/event_debug_note_del_/g;
  s/(?<![A-Za-z0-9_])_event_debug_note_setup(?![A-Za-z0-9_])/event_debug_note_setup_/g;
  s/(?<![A-Za-z0-9_])_event_debug_note_teardown(?![A-Za-z0-9_])/event_debug_note_teardown_/g;
  s/(?<![A-Za-z0-9_])_event_debugx(?![A-Za-z0-9_])/event_debugx_/g;
  s/(?<![A-Za-z0-9_])_EVENT_DEFINED_LISTENTRY(?![A-Za-z0-9_])/EVENT_DEFINED_LISTENTRY_/g;
  s/(?<![A-Za-z0-9_])_EVENT_DEFINED_TQENTRY(?![A-Za-z0-9_])/EVENT_DEFINED_TQENTRY_/g;
  s/(?<![A-Za-z0-9_])_EVENT_DEFINED_TQHEAD(?![A-Za-z0-9_])/EVENT_DEFINED_TQHEAD_/g;
  s/(?<![A-Za-z0-9_])_EVENT_DNS_USE_FTIME_FOR_ID(?![A-Za-z0-9_])/EVENT_DNS_USE_FTIME_FOR_ID_/g;
  s/(?<![A-Za-z0-9_])_EVENT_ERR_ABORT(?![A-Za-z0-9_])/EVENT_ERR_ABORT_/g;
  s/(?<![A-Za-z0-9_])_EVENT_EVCONFIG__PRIVATE_H(?![A-Za-z0-9_])/EVENT_EVCONFIG__PRIVATE_H_/g;
  s/(?<![A-Za-z0-9_])_event_iocp_port_unlock_and_free(?![A-Za-z0-9_])/event_iocp_port_unlock_and_free_/g;
  s/(?<![A-Za-z0-9_])_EVENT_LOG_DEBUG(?![A-Za-z0-9_])/EVENT_LOG_DEBUG/g;
  s/(?<![A-Za-z0-9_])_EVENT_LOG_ERR(?![A-Za-z0-9_])/EVENT_LOG_ERR/g;
  s/(?<![A-Za-z0-9_])_EVENT_LOG_MSG(?![A-Za-z0-9_])/EVENT_LOG_MSG/g;
  s/(?<![A-Za-z0-9_])_EVENT_LOG_WARN(?![A-Za-z0-9_])/EVENT_LOG_WARN/g;
  s/(?<![A-Za-z0-9_])_event_strlcpy(?![A-Za-z0-9_])/event_strlcpy_/g;
  s/(?<![A-Za-z0-9_])_EVHTTP_REQ_UNKNOWN(?![A-Za-z0-9_])/EVHTTP_REQ_UNKNOWN_/g;
  s/(?<![A-Za-z0-9_])_EVLOCK_SORTLOCKS(?![A-Za-z0-9_])/EVLOCK_SORTLOCKS_/g;
  s/(?<![A-Za-z0-9_])_evrpc_hooks(?![A-Za-z0-9_])/evrpc_hooks_/g;
  s/(?<![A-Za-z0-9_])_evsig_restore_handler(?![A-Za-z0-9_])/evsig_restore_handler_/g;
  s/(?<![A-Za-z0-9_])_evsig_set_handler(?![A-Za-z0-9_])/evsig_set_handler_/g;
  s/(?<![A-Za-z0-9_])_evthread_cond_fns(?![A-Za-z0-9_])/evthread_cond_fns_/g;
  s/(?<![A-Za-z0-9_])_evthread_debug_get_real_lock(?![A-Za-z0-9_])/evthread_debug_get_real_lock_/g;
  s/(?<![A-Za-z0-9_])_evthread_id_fn(?![A-Za-z0-9_])/evthread_id_fn_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_cond_alloc(?![A-Za-z0-9_])/evthreadimpl_cond_alloc_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_cond_free(?![A-Za-z0-9_])/evthreadimpl_cond_free_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_cond_signal(?![A-Za-z0-9_])/evthreadimpl_cond_signal_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_cond_wait(?![A-Za-z0-9_])/evthreadimpl_cond_wait_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_get_id(?![A-Za-z0-9_])/evthreadimpl_get_id_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_is_lock_debugging_enabled(?![A-Za-z0-9_])/evthreadimpl_is_lock_debugging_enabled_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_lock_alloc(?![A-Za-z0-9_])/evthreadimpl_lock_alloc_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_lock_free(?![A-Za-z0-9_])/evthreadimpl_lock_free_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_locking_enabled(?![A-Za-z0-9_])/evthreadimpl_locking_enabled_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_lock_lock(?![A-Za-z0-9_])/evthreadimpl_lock_lock_/g;
  s/(?<![A-Za-z0-9_])_evthreadimpl_lock_unlock(?![A-Za-z0-9_])/evthreadimpl_lock_unlock_/g;
  s/(?<![A-Za-z0-9_])_evthread_is_debug_lock_held(?![A-Za-z0-9_])/evthread_is_debug_lock_held_/g;
  s/(?<![A-Za-z0-9_])_evthread_lock_debugging_enabled(?![A-Za-z0-9_])/evthread_lock_debugging_enabled_/g;
  s/(?<![A-Za-z0-9_])_evthread_lock_fns(?![A-Za-z0-9_])/evthread_lock_fns_/g;
  s/(?<![A-Za-z0-9_])_EVUTIL_NIL_CONDITION(?![A-Za-z0-9_])/EVUTIL_NIL_CONDITION_/g;
  s/(?<![A-Za-z0-9_])_EVUTIL_NIL_STMT(?![A-Za-z0-9_])/EVUTIL_NIL_STMT_/g;
  s/(?<![A-Za-z0-9_])_evutil_weakrand(?![A-Za-z0-9_])/evutil_weakrand_/g;
  s/(?<![A-Za-z0-9_])_http_close_detection(?![A-Za-z0-9_])/http_close_detection_/g;
  s/(?<![A-Za-z0-9_])_http_connection_test(?![A-Za-z0-9_])/http_connection_test_/g;
  s/(?<![A-Za-z0-9_])_http_incomplete_test(?![A-Za-z0-9_])/http_incomplete_test_/g;
  s/(?<![A-Za-z0-9_])_http_stream_in_test(?![A-Za-z0-9_])/http_stream_in_test_/g;
  s/(?<![A-Za-z0-9_])_internal(?![A-Za-z0-9_])/internal_/g;
  s/(?<![A-Za-z0-9_])_mm_free_fn(?![A-Za-z0-9_])/mm_free_fn_/g;
  s/(?<![A-Za-z0-9_])_mm_malloc_fn(?![A-Za-z0-9_])/mm_malloc_fn_/g;
  s/(?<![A-Za-z0-9_])_mm_realloc_fn(?![A-Za-z0-9_])/mm_realloc_fn_/g;
  s/(?<![A-Za-z0-9_])_original_cond_fns(?![A-Za-z0-9_])/original_cond_fns_/g;
  s/(?<![A-Za-z0-9_])_original_lock_fns(?![A-Za-z0-9_])/original_lock_fns_/g;
  s/(?<![A-Za-z0-9_])_rpc_hook_ctx(?![A-Za-z0-9_])/rpc_hook_ctx_/g;
  s/(?<![A-Za-z0-9_])_SYS_QUEUE_H_(?![A-Za-z0-9_])/SYS_QUEUE_H__/g;
  s/(?<![A-Za-z0-9_])_t(?![A-Za-z0-9_])/t_/g;
  s/(?<![A-Za-z0-9_])_t32(?![A-Za-z0-9_])/t32_/g;
  s/(?<![A-Za-z0-9_])_test_ai_eq(?![A-Za-z0-9_])/test_ai_eq_/g;
  s/(?<![A-Za-z0-9_])_URI_ADD(?![A-Za-z0-9_])/URI_ADD_/g;
  s/(?<![A-Za-z0-9_])_URI_FREE_STR(?![A-Za-z0-9_])/URI_FREE_STR_/g;
  s/(?<![A-Za-z0-9_])_URI_SET_STR(?![A-Za-z0-9_])/URI_SET_STR_/g;
  s/(?<![A-Za-z0-9_])_warn_helper(?![A-Za-z0-9_])/warn_helper_/g;
  

Download

• compat/sys/queue.h

• /*	$OpenBSD: queue.h,v 1.16 2000/09/07 19:47:59 art Exp $	*/
  /*	$NetBSD: queue.h,v 1.11 1996/05/16 05:17:14 mycroft Exp $	*/
  
  /*
   * Copyright (c) 1991, 1993
   *	The Regents of the University of California.  All rights reserved.
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions
   * are met:
   * 1. Redistributions of source code must retain the above copyright
   *    notice, this list of conditions and the following disclaimer.
   * 2. Redistributions in binary form must reproduce the above copyright
   *    notice, this list of conditions and the following disclaimer in the
   *    documentation and/or other materials provided with the distribution.
   * 3. Neither the name of the University nor the names of its contributors
   *    may be used to endorse or promote products derived from this software
   *    without specific prior written permission.
   *
   * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   * SUCH DAMAGE.
   *
   *	@(#)queue.h	8.5 (Berkeley) 8/20/94
   */
  
  #ifndef	SYS_QUEUE_H__
  #define	SYS_QUEUE_H__
  
  /*
   * This file defines five types of data structures: singly-linked lists,
   * lists, simple queues, tail queues, and circular queues.
   *
   *
   * A singly-linked list is headed by a single forward pointer. The elements
   * are singly linked for minimum space and pointer manipulation overhead at
   * the expense of O(n) removal for arbitrary elements. New elements can be
   * added to the list after an existing element or at the head of the list.
   * Elements being removed from the head of the list should use the explicit
   * macro for this purpose for optimum efficiency. A singly-linked list may
   * only be traversed in the forward direction.  Singly-linked lists are ideal
   * for applications with large datasets and few or no removals or for
   * implementing a LIFO queue.
   *
   * A list is headed by a single forward pointer (or an array of forward
   * pointers for a hash table header). The elements are doubly linked
   * so that an arbitrary element can be removed without a need to
   * traverse the list. New elements can be added to the list before
   * or after an existing element or at the head of the list. A list
   * may only be traversed in the forward direction.
   *
   * A simple queue is headed by a pair of pointers, one the head of the
   * list and the other to the tail of the list. The elements are singly
   * linked to save space, so elements can only be removed from the
   * head of the list. New elements can be added to the list before or after
   * an existing element, at the head of the list, or at the end of the
   * list. A simple queue may only be traversed in the forward direction.
   *
   * A tail queue is headed by a pair of pointers, one to the head of the
   * list and the other to the tail of the list. The elements are doubly
   * linked so that an arbitrary element can be removed without a need to
   * traverse the list. New elements can be added to the list before or
   * after an existing element, at the head of the list, or at the end of
   * the list. A tail queue may be traversed in either direction.
   *
   * A circle queue is headed by a pair of pointers, one to the head of the
   * list and the other to the tail of the list. The elements are doubly
   * linked so that an arbitrary element can be removed without a need to
   * traverse the list. New elements can be added to the list before or after
   * an existing element, at the head of the list, or at the end of the list.
   * A circle queue may be traversed in either direction, but has a more
   * complex end of list detection.
   *
   * For details on the use of these macros, see the queue(3) manual page.
   */
  
  /*
   * Singly-linked List definitions.
   */
  #define SLIST_HEAD(name, type)						\
  struct name {								\
  	struct type *slh_first;	/* first element */			\
  }
  
  #define	SLIST_HEAD_INITIALIZER(head)					\
  	{ NULL }
  
  #ifndef _WIN32
  #define SLIST_ENTRY(type)						\
  struct {								\
  	struct type *sle_next;	/* next element */			\
  }
  #endif
  
  /*
   * Singly-linked List access methods.
   */
  #define	SLIST_FIRST(head)	((head)->slh_first)
  #define	SLIST_END(head)		NULL
  #define	SLIST_EMPTY(head)	(SLIST_FIRST(head) == SLIST_END(head))
  #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)
  
  #define	SLIST_FOREACH(var, head, field)					\
  	for((var) = SLIST_FIRST(head);					\
  	    (var) != SLIST_END(head);					\
  	    (var) = SLIST_NEXT(var, field))
  
  /*
   * Singly-linked List functions.
   */
  #define	SLIST_INIT(head) {						\
  	SLIST_FIRST(head) = SLIST_END(head);				\
  }
  
  #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\
  	(elm)->field.sle_next = (slistelm)->field.sle_next;		\
  	(slistelm)->field.sle_next = (elm);				\
  } while (0)
  
  #define	SLIST_INSERT_HEAD(head, elm, field) do {			\
  	(elm)->field.sle_next = (head)->slh_first;			\
  	(head)->slh_first = (elm);					\
  } while (0)
  
  #define	SLIST_REMOVE_HEAD(head, field) do {				\
  	(head)->slh_first = (head)->slh_first->field.sle_next;		\
  } while (0)
  
  /*
   * List definitions.
   */
  #define LIST_HEAD(name, type)						\
  struct name {								\
  	struct type *lh_first;	/* first element */			\
  }
  
  #define LIST_HEAD_INITIALIZER(head)					\
  	{ NULL }
  
  #define LIST_ENTRY(type)						\
  struct {								\
  	struct type *le_next;	/* next element */			\
  	struct type **le_prev;	/* address of previous next element */	\
  }
  
  /*
   * List access methods
   */
  #define	LIST_FIRST(head)		((head)->lh_first)
  #define	LIST_END(head)			NULL
  #define	LIST_EMPTY(head)		(LIST_FIRST(head) == LIST_END(head))
  #define	LIST_NEXT(elm, field)		((elm)->field.le_next)
  
  #define LIST_FOREACH(var, head, field)					\
  	for((var) = LIST_FIRST(head);					\
  	    (var)!= LIST_END(head);					\
  	    (var) = LIST_NEXT(var, field))
  
  /*
   * List functions.
   */
  #define	LIST_INIT(head) do {						\
  	LIST_FIRST(head) = LIST_END(head);				\
  } while (0)
  
  #define LIST_INSERT_AFTER(listelm, elm, field) do {			\
  	if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)	\
  		(listelm)->field.le_next->field.le_prev =		\
  		    &(elm)->field.le_next;				\
  	(listelm)->field.le_next = (elm);				\
  	(elm)->field.le_prev = &(listelm)->field.le_next;		\
  } while (0)
  
  #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
  	(elm)->field.le_prev = (listelm)->field.le_prev;		\
  	(elm)->field.le_next = (listelm);				\
  	*(listelm)->field.le_prev = (elm);				\
  	(listelm)->field.le_prev = &(elm)->field.le_next;		\
  } while (0)
  
  #define LIST_INSERT_HEAD(head, elm, field) do {				\
  	if (((elm)->field.le_next = (head)->lh_first) != NULL)		\
  		(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
  	(head)->lh_first = (elm);					\
  	(elm)->field.le_prev = &(head)->lh_first;			\
  } while (0)
  
  #define LIST_REMOVE(elm, field) do {					\
  	if ((elm)->field.le_next != NULL)				\
  		(elm)->field.le_next->field.le_prev =			\
  		    (elm)->field.le_prev;				\
  	*(elm)->field.le_prev = (elm)->field.le_next;			\
  } while (0)
  
  #define LIST_REPLACE(elm, elm2, field) do {				\
  	if (((elm2)->field.le_next = (elm)->field.le_next) != NULL)	\
  		(elm2)->field.le_next->field.le_prev =			\
  		    &(elm2)->field.le_next;				\
  	(elm2)->field.le_prev = (elm)->field.le_prev;			\
  	*(elm2)->field.le_prev = (elm2);				\
  } while (0)
  
  /*
   * Simple queue definitions.
   */
  #define SIMPLEQ_HEAD(name, type)					\
  struct name {								\
  	struct type *sqh_first;	/* first element */			\
  	struct type **sqh_last;	/* addr of last next element */		\
  }
  
  #define SIMPLEQ_HEAD_INITIALIZER(head)					\
  	{ NULL, &(head).sqh_first }
  
  #define SIMPLEQ_ENTRY(type)						\
  struct {								\
  	struct type *sqe_next;	/* next element */			\
  }
  
  /*
   * Simple queue access methods.
   */
  #define	SIMPLEQ_FIRST(head)	    ((head)->sqh_first)
  #define	SIMPLEQ_END(head)	    NULL
  #define	SIMPLEQ_EMPTY(head)	    (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))
  #define	SIMPLEQ_NEXT(elm, field)    ((elm)->field.sqe_next)
  
  #define SIMPLEQ_FOREACH(var, head, field)				\
  	for((var) = SIMPLEQ_FIRST(head);				\
  	    (var) != SIMPLEQ_END(head);					\
  	    (var) = SIMPLEQ_NEXT(var, field))
  
  /*
   * Simple queue functions.
   */
  #define	SIMPLEQ_INIT(head) do {						\
  	(head)->sqh_first = NULL;					\
  	(head)->sqh_last = &(head)->sqh_first;				\
  } while (0)
  
  #define SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\
  	if (((elm)->field.sqe_next = (head)->sqh_first) == NULL)	\
  		(head)->sqh_last = &(elm)->field.sqe_next;		\
  	(head)->sqh_first = (elm);					\
  } while (0)
  
  #define SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\
  	(elm)->field.sqe_next = NULL;					\
  	*(head)->sqh_last = (elm);					\
  	(head)->sqh_last = &(elm)->field.sqe_next;			\
  } while (0)
  
  #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
  	if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
  		(head)->sqh_last = &(elm)->field.sqe_next;		\
  	(listelm)->field.sqe_next = (elm);				\
  } while (0)
  
  #define SIMPLEQ_REMOVE_HEAD(head, elm, field) do {			\
  	if (((head)->sqh_first = (elm)->field.sqe_next) == NULL)	\
  		(head)->sqh_last = &(head)->sqh_first;			\
  } while (0)
  
  /*
   * Tail queue definitions.
   */
  #define TAILQ_HEAD(name, type)						\
  struct name {								\
  	struct type *tqh_first;	/* first element */			\
  	struct type **tqh_last;	/* addr of last next element */		\
  }
  
  #define TAILQ_HEAD_INITIALIZER(head)					\
  	{ NULL, &(head).tqh_first }
  
  #define TAILQ_ENTRY(type)						\
  struct {								\
  	struct type *tqe_next;	/* next element */			\
  	struct type **tqe_prev;	/* address of previous next element */	\
  }
  
  /*
   * tail queue access methods
   */
  #define	TAILQ_FIRST(head)		((head)->tqh_first)
  #define	TAILQ_END(head)			NULL
  #define	TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)
  #define TAILQ_LAST(head, headname)					\
  	(*(((struct headname *)((head)->tqh_last))->tqh_last))
  /* XXX */
  #define TAILQ_PREV(elm, headname, field)				\
  	(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
  #define	TAILQ_EMPTY(head)						\
  	(TAILQ_FIRST(head) == TAILQ_END(head))
  
  #define TAILQ_FOREACH(var, head, field)					\
  	for((var) = TAILQ_FIRST(head);					\
  	    (var) != TAILQ_END(head);					\
  	    (var) = TAILQ_NEXT(var, field))
  
  #define TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
  	for((var) = TAILQ_LAST(head, headname);				\
  	    (var) != TAILQ_END(head);					\
  	    (var) = TAILQ_PREV(var, headname, field))
  
  /*
   * Tail queue functions.
   */
  #define	TAILQ_INIT(head) do {						\
  	(head)->tqh_first = NULL;					\
  	(head)->tqh_last = &(head)->tqh_first;				\
  } while (0)
  
  #define TAILQ_INSERT_HEAD(head, elm, field) do {			\
  	if (((elm)->field.tqe_next = (head)->tqh_first) != NULL)	\
  		(head)->tqh_first->field.tqe_prev =			\
  		    &(elm)->field.tqe_next;				\
  	else								\
  		(head)->tqh_last = &(elm)->field.tqe_next;		\
  	(head)->tqh_first = (elm);					\
  	(elm)->field.tqe_prev = &(head)->tqh_first;			\
  } while (0)
  
  #define TAILQ_INSERT_TAIL(head, elm, field) do {			\
  	(elm)->field.tqe_next = NULL;					\
  	(elm)->field.tqe_prev = (head)->tqh_last;			\
  	*(head)->tqh_last = (elm);					\
  	(head)->tqh_last = &(elm)->field.tqe_next;			\
  } while (0)
  
  #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
  	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
  		(elm)->field.tqe_next->field.tqe_prev =			\
  		    &(elm)->field.tqe_next;				\
  	else								\
  		(head)->tqh_last = &(elm)->field.tqe_next;		\
  	(listelm)->field.tqe_next = (elm);				\
  	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
  } while (0)
  
  #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
  	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
  	(elm)->field.tqe_next = (listelm);				\
  	*(listelm)->field.tqe_prev = (elm);				\
  	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
  } while (0)
  
  #define TAILQ_REMOVE(head, elm, field) do {				\
  	if (((elm)->field.tqe_next) != NULL)				\
  		(elm)->field.tqe_next->field.tqe_prev =			\
  		    (elm)->field.tqe_prev;				\
  	else								\
  		(head)->tqh_last = (elm)->field.tqe_prev;		\
  	*(elm)->field.tqe_prev = (elm)->field.tqe_next;			\
  } while (0)
  
  #define TAILQ_REPLACE(head, elm, elm2, field) do {			\
  	if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL)	\
  		(elm2)->field.tqe_next->field.tqe_prev =		\
  		    &(elm2)->field.tqe_next;				\
  	else								\
  		(head)->tqh_last = &(elm2)->field.tqe_next;		\
  	(elm2)->field.tqe_prev = (elm)->field.tqe_prev;			\
  	*(elm2)->field.tqe_prev = (elm2);				\
  } while (0)
  
  /*
   * Circular queue definitions.
   */
  #define CIRCLEQ_HEAD(name, type)					\
  struct name {								\
  	struct type *cqh_first;		/* first element */		\
  	struct type *cqh_last;		/* last element */		\
  }
  
  #define CIRCLEQ_HEAD_INITIALIZER(head)					\
  	{ CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
  
  #define CIRCLEQ_ENTRY(type)						\
  struct {								\
  	struct type *cqe_next;		/* next element */		\
  	struct type *cqe_prev;		/* previous element */		\
  }
  
  /*
   * Circular queue access methods
   */
  #define	CIRCLEQ_FIRST(head)		((head)->cqh_first)
  #define	CIRCLEQ_LAST(head)		((head)->cqh_last)
  #define	CIRCLEQ_END(head)		((void *)(head))
  #define	CIRCLEQ_NEXT(elm, field)	((elm)->field.cqe_next)
  #define	CIRCLEQ_PREV(elm, field)	((elm)->field.cqe_prev)
  #define	CIRCLEQ_EMPTY(head)						\
  	(CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))
  
  #define CIRCLEQ_FOREACH(var, head, field)				\
  	for((var) = CIRCLEQ_FIRST(head);				\
  	    (var) != CIRCLEQ_END(head);					\
  	    (var) = CIRCLEQ_NEXT(var, field))
  
  #define CIRCLEQ_FOREACH_REVERSE(var, head, field)			\
  	for((var) = CIRCLEQ_LAST(head);					\
  	    (var) != CIRCLEQ_END(head);					\
  	    (var) = CIRCLEQ_PREV(var, field))
  
  /*
   * Circular queue functions.
   */
  #define	CIRCLEQ_INIT(head) do {						\
  	(head)->cqh_first = CIRCLEQ_END(head);				\
  	(head)->cqh_last = CIRCLEQ_END(head);				\
  } while (0)
  
  #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
  	(elm)->field.cqe_next = (listelm)->field.cqe_next;		\
  	(elm)->field.cqe_prev = (listelm);				\
  	if ((listelm)->field.cqe_next == CIRCLEQ_END(head))		\
  		(head)->cqh_last = (elm);				\
  	else								\
  		(listelm)->field.cqe_next->field.cqe_prev = (elm);	\
  	(listelm)->field.cqe_next = (elm);				\
  } while (0)
  
  #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
  	(elm)->field.cqe_next = (listelm);				\
  	(elm)->field.cqe_prev = (listelm)->field.cqe_prev;		\
  	if ((listelm)->field.cqe_prev == CIRCLEQ_END(head))		\
  		(head)->cqh_first = (elm);				\
  	else								\
  		(listelm)->field.cqe_prev->field.cqe_next = (elm);	\
  	(listelm)->field.cqe_prev = (elm);				\
  } while (0)
  
  #define CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\
  	(elm)->field.cqe_next = (head)->cqh_first;			\
  	(elm)->field.cqe_prev = CIRCLEQ_END(head);			\
  	if ((head)->cqh_last == CIRCLEQ_END(head))			\
  		(head)->cqh_last = (elm);				\
  	else								\
  		(head)->cqh_first->field.cqe_prev = (elm);		\
  	(head)->cqh_first = (elm);					\
  } while (0)
  
  #define CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\
  	(elm)->field.cqe_next = CIRCLEQ_END(head);			\
  	(elm)->field.cqe_prev = (head)->cqh_last;			\
  	if ((head)->cqh_first == CIRCLEQ_END(head))			\
  		(head)->cqh_first = (elm);				\
  	else								\
  		(head)->cqh_last->field.cqe_next = (elm);		\
  	(head)->cqh_last = (elm);					\
  } while (0)
  
  #define	CIRCLEQ_REMOVE(head, elm, field) do {				\
  	if ((elm)->field.cqe_next == CIRCLEQ_END(head))			\
  		(head)->cqh_last = (elm)->field.cqe_prev;		\
  	else								\
  		(elm)->field.cqe_next->field.cqe_prev =			\
  		    (elm)->field.cqe_prev;				\
  	if ((elm)->field.cqe_prev == CIRCLEQ_END(head))			\
  		(head)->cqh_first = (elm)->field.cqe_next;		\
  	else								\
  		(elm)->field.cqe_prev->field.cqe_next =			\
  		    (elm)->field.cqe_next;				\
  } while (0)
  
  #define CIRCLEQ_REPLACE(head, elm, elm2, field) do {			\
  	if (((elm2)->field.cqe_next = (elm)->field.cqe_next) ==		\
  	    CIRCLEQ_END(head))						\
  		(head).cqh_last = (elm2);				\
  	else								\
  		(elm2)->field.cqe_next->field.cqe_prev = (elm2);	\
  	if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) ==		\
  	    CIRCLEQ_END(head))						\
  		(head).cqh_first = (elm2);				\
  	else								\
  		(elm2)->field.cqe_prev->field.cqe_next = (elm2);	\
  } while (0)
  
  #endif	/* !SYS_QUEUE_H__ */
  

Download