NAME
insque, remque - insert/remove an item from a queue
LIBRARY
Standard C library (libc, -lc)
SYNOPSIS
#include <search.h>void insque(void *\nelem\n, void *\nprev\n);\n
\nvoid remque(void *\nelem\n);insque(), remque():
\n
_XOPEN_SOURCE >= 500
\n
|| /* glibc >= 2.19: */ _DEFAULT_SOURCE
\n
|| /* glibc <= 2.19: */ _SVID_SOURCEDESCRIPTION
The insque() and remque() functions manipulate doubly linked lists. Each element in the list is a structure of which the first two elements are a forward and a backward pointer. The linked list may be linear (i.e., NULL forward pointer at the end of the list and NULL backward pointer at the start of the list) or circular.
The insque() function inserts the element pointed to by elem immediately after the element pointed to by prev.
If the list is linear, then the call insque(elem, NULL) can be used to insert the initial list element, and the call sets the forward and backward pointers of elem to NULL.
If the list is circular, the caller should ensure that the forward and backward pointers of the first element are initialized to point to that element, and the prev argument of the insque() call should also point to the element.
The remque() function removes the element pointed to by elem from the doubly linked list.
ATTRIBUTES
For an explanation of the terms used in this section, see attributes(7).
| Interface | Attribute | Value |
| insque (), remque () | Thread safety | MT-Safe |
VERSIONS
On ancient systems, the arguments of these functions were of type struct qelem *, defined as:
struct qelem {
\n
struct qelem *q_forw;
\n
struct qelem *q_back;
\n
char q_data[1];
};This is still what you will get if _GNU_SOURCE is defined before including <search.h>.
The location of the prototypes for these functions differs among several versions of UNIX. The above is the POSIX version. Some systems place them in <string.h>.
STANDARDS
POSIX.1-2008.
HISTORY
POSIX.1-2001.
BUGS
In glibc 2.4 and earlier, it was not possible to specify prev as NULL. Consequently, to build a linear list, the caller had to build a list using an initial call that contained the first two elements of the list, with the forward and backward pointers in each element suitably initialized.
EXAMPLES
The program below demonstrates the use of insque(). Here is an example run of the program:
$ \n./a.out -c a b c\n
Traversing completed list:
\n
a
\n
b
\n
c
That was a circular listProgram source
#include <search.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
struct element {
\n
struct element *forward;
\n
struct element *backward;
\n
char *name;
};
static struct element *
new_element(void)
{
\n
struct element *e;
\n
e = malloc(sizeof(*e));
\n
if (e == NULL) {
\n
fprintf(stderr, "malloc() failed\n");
\n
exit(EXIT_FAILURE);
\n
}
\n
return e;
}
int
main(int argc, char *argv[])
{
\n
struct element *first, *elem, *prev;
\n
int circular, opt, errfnd;
\n
/* The "-c" command-line option can be used to specify that the
\n
list is circular. */
\n
errfnd = 0;
\n
circular = 0;
\n
while ((opt = getopt(argc, argv, "c")) != -1) {
\n
switch (opt) {
\n
case 'c':
\n
circular = 1;
\n
break;
\n
default:
\n
errfnd = 1;
\n
break;
\n
}
\n
}
\n
if (errfnd || optind >= argc) {
\n
fprintf(stderr, "Usage: %s [-c] string...\n", argv[0]);
\n
exit(EXIT_FAILURE);
\n
}
\n
/* Create first element and place it in the linked list. */
\n
elem = new_element();
\n
first = elem;
\n
elem->name = argv[optind];
\n
if (circular) {
\n
elem->forward = elem;
\n
elem->backward = elem;
\n
insque(elem, elem);
\n
} else {
\n
insque(elem, NULL);
\n
}
\n
/* Add remaining command-line arguments as list elements. */
\n
while (++optind < argc) {
\n
prev = elem;
\n
elem = new_element();
\n
elem->name = argv[optind];
\n
insque(elem, prev);
\n
}
\n
/* Traverse the list from the start, printing element names. */
\n
printf("Traversing completed list:\n");
\n
elem = first;
\n
do {
\n
printf(" %s\n", elem->name);
\n
elem = elem->forward;
\n
} while (elem != NULL && elem != first);
\n
if (elem == first)
\n
printf("That was a circular list\n");
\n
exit(EXIT_SUCCESS);
}SEE ALSO
queue(7)