insque(9r)insque(9r)NAME
insque, remque - General: Add or remove an element from the queue
SYNOPSIS
struct generic_qheader {
struct generic_qheader *q_forw;
struct generic_qheader *q_back;
};
int insque(
struct generic_qheader *elem,
struct generic_qheader *pred ); int remque(
struct generic_qheader *elem );
ARGUMENTS
Specifies the address of the queue header that contains the element to be manipulated. Specifies the address of the queue header that con-
tains the element to precede the one specified by elem in the queue.
DESCRIPTION
The insque routine adds the element that the elem argument specifies to the queue. The routine inserts elem in the next position after pred
in the queue.
The remque routine removes the element that the elem argument specifies from the queue it is currently in.
Queues are built from doubly linked lists. Each element is linked into the queue through a queue header. All queue headers are of the
generic form struct generic_qheader. A given element may have multiple queue headers. This allows each element to be simultaneously linked
onto multiple queues.
Any driver routine that manipulates these queues must call an appropriate spl routine to ensure that the spl level is high enough to block
out any interrupts for other kernel modules that may access these queues.
RETURN VALUES
None
SEE ALSO
Routines: spl(9r)insque(9r)
Check Out this Related Man Page
insque(3C) Standard C Library Functions insque(3C)NAME
insque, remque - insert/remove element from a queue
SYNOPSIS
include <search.h>
void insque(struct qelem *elem, struct qelem *pred);
void remque(struct qelem *elem);
DESCRIPTION
The insque() and remque() functions manipulate queues built from doubly linked lists. Each element in the queue must be in the following
form:
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char q_data[];
};
The insque() function inserts elem in a queue immediately after pred. The remque() function removes an entry elem from a queue.
ATTRIBUTES
See attributes(5) for descriptions of the following attributes:
+-----------------------------+-----------------------------+
| ATTRIBUTE TYPE | ATTRIBUTE VALUE |
+-----------------------------+-----------------------------+
|Interface Stability |Standard |
+-----------------------------+-----------------------------+
|MT-Level |Unsafe |
+-----------------------------+-----------------------------+
SEE ALSO attributes(5), standards(5)SunOS 5.10 24 Jul 2002 insque(3C)
Hi All,
Can anyone tell me how to clear list of queues in a file?
My file FILE1 has 3 queues
FILE1
FirstQueue
SecondQueue
ThirdQueue
I want to clear all these queues which belong to the same Qmanager from another script...
Can anyone help me for this..
Thanks in... (0 Replies)
Suppose to have:
struct Tstudent
{
string name, surname;
int matriculation_num;
};
struct Tnode
{
Tstudent* student;
Tnodo* next;
} L;I want to deference that "student" pointer. For example, I tried with:
*(L->student).matriculation_numbut it not worked, as terminal... (4 Replies)
Given an in-between(any node not at the start and end of the linked list) node within a singly linear linked list, how to delete that node, when head pointer of list is not given? (13 Replies)
Hi, I have implement queue but it take last element instead of fist element
#!/usr/bin/perl -w
print "Enter page Access";
chomp ($item = <STDIN>);
my @queue = split /\s+/, $item;
print "Enter a page frame";
$frame = <STDIN>;
if ( $frame >= 3 )
{
$fifo = pop @queue;
print... (1 Reply)
Hi,
I have catenated multiple output files (from a monte carlo run) into one big output file. Each individual file has it's own two line header. So when I catenate, there are multiple two line headers (of the same wording) within the big file. How do I use the sed command to search for the... (1 Reply)
Hi Gurus,
I have a xml in which I have to remove unused element nodes. Here are the requirements
1. Remove StoreAddresses & Contacts complex element directly
2. Remove StoreItemCharacteristic element based on CharacteristicName="Organic"
Here is the sample xml
<?xml version="1.0"... (0 Replies)