|
DataMuseum.dkPresents historical artifacts from the history of: Regnecentalen RC-900 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Regnecentalen RC-900 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 1175 (0x497)
Types: TextFile
Notes: UNIX file
Names: »que.h«
└─⟦a6ab2eb36⟧ Bits:30004042/kconfig3.imd SW95705I 386/ix Multi-user Release 1.2
└─⟦a6ab2eb36⟧ UNIX Filesystem
└─⟦this⟧ »kc/new/usr/include/sys/que.h«
/* Copyright (c) 1984 AT&T */
/* All Rights Reserved */
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF AT&T */
/* The copyright notice above does not evidence any */
/* actual or intended publication of such source code. */
#ident "@(#)que.h 1.3"
/*********************************************************************
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 */
};