| queue.h (35957) | queue.h (37143) |
|---|---|
| 1/* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 17 unchanged lines hidden (view full) --- 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)queue.h 8.5 (Berkeley) 8/20/94 | 1/* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 17 unchanged lines hidden (view full) --- 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)queue.h 8.5 (Berkeley) 8/20/94 |
| 34 * $Id: queue.h,v 1.20 1998/02/24 17:27:23 julian Exp $ | 34 * $Id: queue.h,v 1.21 1998/05/12 03:55:25 gibbs Exp $ |
| 35 */ 36 37#ifndef _SYS_QUEUE_H_ 38#define _SYS_QUEUE_H_ 39 40/* 41 * This file defines five types of data structures: singly-linked lists, 42 * slingly-linked tail queues, lists, tail queues, and circular queues. --- 44 unchanged lines hidden (view full) --- 87 * For details on the use of these macros, see the queue(3) manual page. 88 * 89 * 90 * SLIST LIST STAILQ TAILQ CIRCLEQ 91 * _HEAD + + + + + 92 * _ENTRY + + + + + 93 * _INIT + + + + + 94 * _EMPTY + + + + + | 35 */ 36 37#ifndef _SYS_QUEUE_H_ 38#define _SYS_QUEUE_H_ 39 40/* 41 * This file defines five types of data structures: singly-linked lists, 42 * slingly-linked tail queues, lists, tail queues, and circular queues. --- 44 unchanged lines hidden (view full) --- 87 * For details on the use of these macros, see the queue(3) manual page. 88 * 89 * 90 * SLIST LIST STAILQ TAILQ CIRCLEQ 91 * _HEAD + + + + + 92 * _ENTRY + + + + + 93 * _INIT + + + + + 94 * _EMPTY + + + + + |
| 95 * _FIRST + + - + + 96 * _NEXT + + - + + | 95 * _FIRST + + + + + 96 * _NEXT + + + + + |
| 97 * _PREV - - - + + | 97 * _PREV - - - + + |
| 98 * _LAST - - - + + 99 * _FOREACH + + - + - | 98 * _LAST - - + + + 99 * _FOREACH + + - + + |
| 100 * _INSERT_HEAD + + + + + 101 * _INSERT_BEFORE - + - + + 102 * _INSERT_AFTER + + + + + 103 * _INSERT_TAIL - - + + + 104 * _REMOVE_HEAD + - + - - 105 * _REMOVE + + + + + 106 * 107 */ --- 404 unchanged lines hidden --- | 100 * _INSERT_HEAD + + + + + 101 * _INSERT_BEFORE - + - + + 102 * _INSERT_AFTER + + + + + 103 * _INSERT_TAIL - - + + + 104 * _REMOVE_HEAD + - + - - 105 * _REMOVE + + + + + 106 * 107 */ --- 404 unchanged lines hidden --- |