cmd_list.c revision 822fb41d6f36e90a1ec836b32f869e1235e7da40
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2004 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Embedded Linked Lists
*
* Simple doubly-linked list implementation. This implementation assumes that
* each list element contains an embedded cmd_list_t (previous and next
* pointers), which is typically the first member of the element struct.
* An additional cmd_list_t is used to store the head (l_next) and tail
* (l_prev) pointers. The current head and tail list elements have their
* previous and next pointers set to NULL, respectively.
*/
#include <cmd_list.h>
#include <cmd.h>
void
{
q->l_prev = p;
if (p != NULL)
p->l_next = q;
else
}
void
{
p->l_next = q;
if (q != NULL)
q->l_prev = p;
else
}
void
{
cmd_list_t *p = before_me;
cmd_list_t *q = new;
return;
}
q->l_next = p;
p->l_prev = q;
}
void
{
cmd_list_t *p = after_me;
cmd_list_t *q = new;
return;
}
q->l_prev = p;
p->l_next = q;
}
void
{
cmd_list_t *p = existing;
else
else
}