| queue.3 (130848) | queue.3 (131754) |
|---|---|
| 1.\" Copyright (c) 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)queue.3 8.2 (Berkeley) 1/24/94 | 1.\" Copyright (c) 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)queue.3 8.2 (Berkeley) 1/24/94 |
| 33.\" $FreeBSD: head/share/man/man3/queue.3 130848 2004-06-21 14:54:43Z mpp $ | 33.\" $FreeBSD: head/share/man/man3/queue.3 131754 2004-07-07 19:57:16Z ru $ |
| 34.\" 35.Dd January 24, 1994 36.Dt QUEUE 3 37.Os 38.Sh NAME 39.Nm SLIST_EMPTY , 40.Nm SLIST_ENTRY , 41.Nm SLIST_FIRST , --- 812 unchanged lines hidden (view full) --- 854traverse the list referenced by 855.Fa head 856in the forward or reverse direction respectively, 857assigning each element in turn to 858.Fa var . 859However, unlike their unsafe counterparts, 860.Nm TAILQ_FOREACH 861and | 34.\" 35.Dd January 24, 1994 36.Dt QUEUE 3 37.Os 38.Sh NAME 39.Nm SLIST_EMPTY , 40.Nm SLIST_ENTRY , 41.Nm SLIST_FIRST , --- 812 unchanged lines hidden (view full) --- 854traverse the list referenced by 855.Fa head 856in the forward or reverse direction respectively, 857assigning each element in turn to 858.Fa var . 859However, unlike their unsafe counterparts, 860.Nm TAILQ_FOREACH 861and |
| 862.Nm TAILQ_FOREACH_REVERSE | 862.Nm TAILQ_FOREACH_REVERSE |
| 863permit to both remove 864.Fa var 865as well as free it from within the loop safely without interfering with the 866traversal. 867.Pp 868The macro 869.Nm TAILQ_INIT 870initializes the tail queue referenced by --- 108 unchanged lines hidden --- | 863permit to both remove 864.Fa var 865as well as free it from within the loop safely without interfering with the 866traversal. 867.Pp 868The macro 869.Nm TAILQ_INIT 870initializes the tail queue referenced by --- 108 unchanged lines hidden --- |