Circular queues are gone, so remove remaining references to them.
Index: sys/sys/queue.h
===================================================================
RCS file: /cvs/src/sys/sys/queue.h,v
retrieving revision 1.42
diff -u -p -r1.42 queue.h
--- sys/sys/queue.h 19 Nov 2015 21:03:36 -0000 1.42
+++ sys/sys/queue.h 27 Dec 2015 08:50:54 -0000
@@ -36,8 +36,8 @@
#define _SYS_QUEUE_H_
/*
- * This file defines five types of data structures: singly-linked lists,
- * lists, simple queues, tail queues, and circular queues.
+ * This file defines four types of data structures: singly-linked lists,
+ * lists, simple queues, and tail queues.
*
*
* A singly-linked list is headed by a single forward pointer. The elements
@@ -71,14 +71,6 @@
* 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.
*/
@@ -179,7 +171,7 @@ struct {
\
}
/*
- * List access methods
+ * List access methods.
*/
#define LIST_FIRST(head) ((head)->lh_first)
#define LIST_END(head) NULL
@@ -423,7 +415,7 @@ struct {
\
}
/*
- * tail queue access methods
+ * Tail queue access methods.
*/
#define TAILQ_FIRST(head) ((head)->tqh_first)
#define TAILQ_END(head) NULL
