Hi there! This changes the comment in sys/queue.h a little bit. I interpreted the comment to describe not what generally is possible, but rather what macros are implemented. While changing this also add that elements after an existing element can be removed (SIMPLQ_REMOVE_AFTER).
I also noticed that the XSIMPLEQ* macros are not documented in the queue.3 page. From what I gathered from the mailing list is, that these were added for in kernel use. Is there a specific reason for not mentioning them in queue.3? If no, would you be open to a diff? Best, Martin Index: queue.h =================================================================== RCS file: /cvs/src/sys/sys/queue.h,v retrieving revision 1.45 diff -u -p -r1.45 queue.h --- queue.h 12 Jul 2018 14:22:54 -0000 1.45 +++ queue.h 31 Mar 2020 10:24:16 -0000 @@ -62,9 +62,9 @@ * A simple 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 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. + * head of the list or after an existing element. New elements can be added to + * the list 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
