Penguin
Recent Changes
Annotated edit history of remque(3) version 1, including all changes. View license author blame.
Rev Author # Line
1 perry 1 INSQUE
2 !!!INSQUE
3 NAME
4 SYNOPSIS
5 DESCRIPTION
6 CONFORMING TO
7 BUGS
8 ----
9 !!NAME
10
11
12 insque, remque - insert/remove an item from a queue
13 !!SYNOPSIS
14
15
16 __#include
17 __''elem''__, struct qelem *__''prev''__);
18 void remque(struct qelem *__''elem''__);
19 __
20 !!DESCRIPTION
21
22
23 __insque()__ and __remque()__ are functions for
24 manipulating queues made from doubly-linked lists. Each
25 element in this list is of type __struct
26 qelem__
27
28
29 The __qelem__ structure is defined as
30
31
32 struct qelem {
33 struct qelem *q_forw;
34 struct qelem *q_back;
35 char q_data[[1];
36 };
37
38
39 __insque()__ inserts the element pointed to by
40 ''elem'' immediately after the element pointed to by
41 ''prev'', which must __NOT__ be NULL.
42
43
44 __remque()__ removes the element pointed to by
45 ''elem'' from the doubly-linked list.
46 !!CONFORMING TO
47
48
49 SVR4
50 !!BUGS
51
52
53 The q_data field is sometimes defined to be type __char
54 *__, and under solaris 2.x, it doesn't appear to exist at
55 all.
56
57
58 The location of the prototypes for these functions differ
59 among several versions of UNIX. Some systems place them in
60
61
62 Some versions of UNIX (like HP-UX 10.x) do not define a
63 __struct qelem__ but rather have the arguments to
64 __insque()__ and __remque()__ be of type __void
65 *__.
66 ----
This page is a man page (or other imported legacy content). We are unable to automatically determine the license status of this page.