Home
Search all pages
Subjects
By activity
Professions, Sciences, Humanities, Business, ...
User Interface
Text-based, GUI, Audio, Video, Keyboards, Mouse, Images,...
Text Strings
Conversions, tests, processing, manipulation,...
Math
Integer, Floating point, Matrix, Statistics, Boolean, ...
Processing
Algorithms, Memory, Process control, Debugging, ...
Stored Data
Data storage, Integrity, Encryption, Compression, ...
Communications
Networks, protocols, Interprocess, Remote, Client Server, ...
Hard World Timing, Calendar and Clock, Audio, Video, Printer, Controls...
File System
Management, Filtering, File & Directory access, Viewers, ...
|
|
|
RocketLink!--> Man page versions:
OpenBSD
FreeBSD
RedHat
Solaris
Others
INSQUE(3) OpenBSD Programmer's Manual INSQUE(3)
NAME
insque, remque - insert/remove element from a queue
SYNOPSIS
#include <search.h>
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char q_data[];
};
void
insque(struct qelem *elem, struct qelem *pred);
void
remque(struct qelem *elem);
DESCRIPTION
These interfaces are available from the compatibility library, libcompat.
insque() and remque() manipulate queues built from doubly linked lists.
Each element in the queue must begin with a "struct qelem".
DIAGNOSTICS
These functions are not atomic unless that machine architecture allows
it.
HISTORY
These are derived from the insque and remque instructions on a VAX.
OpenBSD 2.6 August 12, 1993 1
Source: OpenBSD 2.6 man pages. Copyright: Portions are copyrighted by BERKELEY SOFTWARE DESIGN, INC., The Regents of the University of California, Massachusetts Institute of Technology, Free Software Foundation, FreeBSD Inc., and others. |
(Corrections, notes, and links courtesy of RocketAware.com)
FreeBSD Sources for insque(3) functions
Up to: Head and Tail Lists
RocketLink!--> Man page versions:
OpenBSD
FreeBSD
RedHat
Solaris
Others
Rapid-Links:
Search | About | Comments | Submit Path: RocketAware > man pages >
insque.3/
RocketAware.com is a service of Mib Software Copyright 1999, Forrest J. Cavalier III. All Rights Reserved. We welcome submissions and comments
|