home *** CD-ROM | disk | FTP | other *** search
- /* Copyright (c) 1990 UNIX System Laboratories, Inc. */
- /* Copyright (c) 1984, 1986, 1987, 1988, 1989, 1990 AT&T */
- /* All Rights Reserved */
-
- /* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF */
- /* UNIX System Laboratories, Inc. */
- /* The copyright notice above does not evidence any */
- /* actual or intended publication of such source code. */
-
-
- #ident "@(#)/usr/include/sys/que.h.sl 1.1 4.0 12/08/90 34946 AT&T-USL"
-
- /*********************************************************************
-
- following structures declares the data structures used for
- queue manipulation.
-
- *********************************************************************/
-
- /*****
-
- Queues consist simply of one-way list. Each queue is
- defined by a 'queue control element' made up of head
- and tail pointers. Each item held on a queue contains
- a pointer word used to link successive item together.
- The head pointer contains the address of the first
- item in the queue and the tail pointer contains the
- address of the last item.
-
- *****/
-
-
-
- /*
- * Queue Item
- */
-
- #define QITEM struct qitem_st
-
- struct qitem_st
- {
- QITEM *qi_next; /* next queue item pointer */
- char data[1]; /* data */
- };
-
-
-
- /*
- * Queue Control Element
- */
-
- #define QCTRL struct qctrl_st
-
- struct qctrl_st
- {
- QITEM *qc_head; /* head pointer */
- QITEM *qc_tail; /* tail pointer */
- };
-
-
-
-
-
-