Penguin

INSQUE

INSQUE

NAME SYNOPSIS DESCRIPTION CONFORMING TO BUGS


NAME

insque, remque - insert/remove an item from a queue

SYNOPSIS

#include elem, struct qelem *prev); void remque(struct qelem *elem);

DESCRIPTION

insque() and remque() are functions for manipulating queues made from doubly-linked lists. Each element in this list is of type struct qelem

The qelem structure is defined as

struct qelem { struct qelem *q_forw; struct qelem *q_back; char q_data[1?; };

insque() inserts the element pointed to by elem immediately after the element pointed to by prev, which must NOT be NULL.

remque() removes the element pointed to by elem from the doubly-linked list.

CONFORMING TO

SVR4

BUGS

The q_data field is sometimes defined to be type __char

  • __, and under solaris 2.x, it doesn't appear to exist at

all.

The location of the prototypes for these functions differ among several versions of UNIX. Some systems place them in

Some versions of UNIX (like HP-UX 10.x) do not define a struct qelem but rather have the arguments to insque() and remque() be of type __void

  • __.

This page is a man page (or other imported legacy content). We are unable to automatically determine the license status of this page.