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


   #include <search.h>

   void insque(void *elem, void *prev);

   void remque(void *elem);

   Feature Test Macro Requirements for glibc (see feature_test_macros(7)):

   insque(), remque():
       _XOPEN_SOURCE >= 500
           || /* Glibc since 2.19: */ _DEFAULT_SOURCE
           || /* Glibc versions <= 2.19: */ _SVID_SOURCE


   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.


   For  an  explanation  of  the  terms  used   in   this   section,   see

   │InterfaceAttributeValue   │
   │insque(), remque() │ Thread safety │ MT-Safe │


   POSIX.1-2001, POSIX.1-2008.


   On  ancient  systems,  the  arguments  of  these functions were of type
   struct qelem *, defined as:

       struct qelem {
           struct qelem *q_forw;
           struct qelem *q_back;
           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>.


   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


   The program below demonstrates the use of insque().  Here is an example
   run of the program:

       $ ./a.out -c a b c
       Traversing completed list:
       That was a circular list

   Program source

   #include <stdio.h>
   #include <stdlib.h>
   #include <unistd.h>
   #include <search.h>

   struct element {
       struct element *forward;
       struct element *backward;
       char *name;

   static struct element *
       struct element *e;

       e = malloc(sizeof(struct element));
       if (e == NULL) {
           fprintf(stderr, "malloc() failed\n");

       return e;

   main(int argc, char *argv[])
       struct element *first, *elem, *prev;
       int circular, opt, errfnd;

       /* The "-c" command-line option can be used to specify that the
          list is circular */

       errfnd = 0;
       circular = 0;
       while ((opt = getopt(argc, argv, "c")) != -1) {
           switch (opt) {
           case 'c':
               circular = 1;
               errfnd = 1;

       if (errfnd || optind >= argc) {
           fprintf(stderr,  "Usage: %s [-c] string...\n", argv[0]);

       /* Create first element and place it in the linked list */

       elem = new_element();
       first = elem;

       elem->name = argv[optind];

       if (circular) {
           elem->forward = elem;
           elem->backward = elem;
           insque(elem, elem);
       } else {
           insque(elem, NULL);

       /* Add remaining command-line arguments as list elements */

       while (++optind < argc) {
           prev = elem;

           elem = new_element();
           elem->name = argv[optind];
           insque(elem, prev);

       /* Traverse the list from the start, printing element names */

       printf("Traversing completed list:\n");
       elem = first;
       do {
           printf("    %s\n", elem->name);
           elem = elem->forward;
       } while (elem != NULL && elem != first);

       if (elem == first)
           printf("That was a circular list\n");



   This page is part of release 4.09 of the Linux  man-pages  project.   A
   description  of  the project, information about reporting bugs, and the
   latest    version    of    this    page,    can     be     found     at

                              2016-12-12                         INSQUE(3)


Personal Opportunity - Free software gives you access to billions of dollars of software at no cost. Use this software for your business, personal use or to develop a profitable skill. Access to source code provides access to a level of capabilities/information that companies protect though copyrights. Open source is a core component of the Internet and it is available to you. Leverage the billions of dollars in resources and capabilities to build a career, establish a business or change the world. The potential is endless for those who understand the opportunity.

Business Opportunity - Goldman Sachs, IBM and countless large corporations are leveraging open source to reduce costs, develop products and increase their bottom lines. Learn what these companies know about open source and how open source can give you the advantage.

Free Software

Free Software provides computer programs and capabilities at no cost but more importantly, it provides the freedom to run, edit, contribute to, and share the software. The importance of free software is a matter of access, not price. Software at no cost is a benefit but ownership rights to the software and source code is far more significant.

Free Office Software - The Libre Office suite provides top desktop productivity tools for free. This includes, a word processor, spreadsheet, presentation engine, drawing and flowcharting, database and math applications. Libre Office is available for Linux or Windows.

Free Books

The Free Books Library is a collection of thousands of the most popular public domain books in an online readable format. The collection includes great classical literature and more recent works where the U.S. copyright has expired. These books are yours to read and use without restrictions.

Source Code - Want to change a program or know how it works? Open Source provides the source code for its programs so that anyone can use, modify or learn how to write those programs themselves. Visit the GNU source code repositories to download the source.


Study at Harvard, Stanford or MIT - Open edX provides free online courses from Harvard, MIT, Columbia, UC Berkeley and other top Universities. Hundreds of courses for almost all major subjects and course levels. Open edx also offers some paid courses and selected certifications.

Linux Manual Pages - A man or manual page is a form of software documentation found on Linux/Unix operating systems. Topics covered include computer programs (including library and system calls), formal standards and conventions, and even abstract concepts.