* Copyright (c) 1988, 1989, 1990, 1993
* The Regents of the University of California. All rights reserved.
* This code is derived from software contributed to Berkeley by
* %sccs.include.redist.c%
static char sccsid
[] = "@(#)lstAppend.c 8.2 (Berkeley) %G%";
* Add a new node with a new datum after an existing node
*-----------------------------------------------------------------------
* Create a new node and add it to the given list after the given node.
* SUCCESS if all went well.
* A new ListNode is created and linked in to the List. The lastPtr
* field of the List will be altered if ln is the last node in the
* list. lastPtr and firstPtr will alter if the list was empty and
*-----------------------------------------------------------------------
Lst l
; /* affected list */
LstNode ln
; /* node after which to append the datum */
ClientData d
; /* said datum */
register ListNode nLNode
;
if (LstValid (l
) && (ln
== NILLNODE
&& LstIsEmpty (l
))) {
if (!LstValid (l
) || LstIsEmpty (l
) || ! LstNodeValid (ln
, l
)) {
PAlloc (nLNode
, ListNode
);
nLNode
->useCount
= nLNode
->flags
= 0;
if (lNode
== NilListNode
) {
nLNode
->nextPtr
= nLNode
->prevPtr
= nLNode
;
nLNode
->nextPtr
= nLNode
->prevPtr
= NilListNode
;
list
->firstPtr
= list
->lastPtr
= nLNode
;
nLNode
->nextPtr
= lNode
->nextPtr
;
if (nLNode
->nextPtr
!= NilListNode
) {
nLNode
->nextPtr
->prevPtr
= nLNode
;
if (lNode
== list
->lastPtr
) {