www.delorie.com/djgpp/doc/libc/libc_481.html   search  
libc.a reference

[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

insque

Syntax

 
#include <search.h>

void insque(struct qelem *elem, struct qelem *pred);

Description

This function manipulates queues built from doubly linked lists. Each element in the queue must be in the form of struct qelem which is defined thus:

 
struct qelem {
  struct qelem *q_forw;
  struct qelem *q_back;
  char q_data[0];
}

This function inserts elem in a queue immediately after pred.

Return Value

None.

Portability

ANSI/ISO C No
POSIX No


  webmaster   donations   bookstore     delorie software   privacy  
  Copyright 2004   by DJ Delorie     Updated Apr 2004