1236769Sobrien/* $NetBSD: lstAppend.c,v 1.14 2009/01/23 21:26:30 dsl Exp $ */ 2236769Sobrien 3236769Sobrien/* 4236769Sobrien * Copyright (c) 1988, 1989, 1990, 1993 5236769Sobrien * The Regents of the University of California. All rights reserved. 6236769Sobrien * 7236769Sobrien * This code is derived from software contributed to Berkeley by 8236769Sobrien * Adam de Boor. 9236769Sobrien * 10236769Sobrien * Redistribution and use in source and binary forms, with or without 11236769Sobrien * modification, are permitted provided that the following conditions 12236769Sobrien * are met: 13236769Sobrien * 1. Redistributions of source code must retain the above copyright 14236769Sobrien * notice, this list of conditions and the following disclaimer. 15236769Sobrien * 2. Redistributions in binary form must reproduce the above copyright 16236769Sobrien * notice, this list of conditions and the following disclaimer in the 17236769Sobrien * documentation and/or other materials provided with the distribution. 18236769Sobrien * 3. Neither the name of the University nor the names of its contributors 19236769Sobrien * may be used to endorse or promote products derived from this software 20236769Sobrien * without specific prior written permission. 21236769Sobrien * 22236769Sobrien * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23236769Sobrien * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24236769Sobrien * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25236769Sobrien * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26236769Sobrien * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27236769Sobrien * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28236769Sobrien * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29236769Sobrien * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30236769Sobrien * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31236769Sobrien * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32236769Sobrien * SUCH DAMAGE. 33236769Sobrien */ 34236769Sobrien 35236769Sobrien#ifndef MAKE_NATIVE 36236769Sobrienstatic char rcsid[] = "$NetBSD: lstAppend.c,v 1.14 2009/01/23 21:26:30 dsl Exp $"; 37236769Sobrien#else 38236769Sobrien#include <sys/cdefs.h> 39236769Sobrien#ifndef lint 40236769Sobrien#if 0 41236769Sobrienstatic char sccsid[] = "@(#)lstAppend.c 8.1 (Berkeley) 6/6/93"; 42236769Sobrien#else 43236769Sobrien__RCSID("$NetBSD: lstAppend.c,v 1.14 2009/01/23 21:26:30 dsl Exp $"); 44236769Sobrien#endif 45236769Sobrien#endif /* not lint */ 46236769Sobrien#endif 47236769Sobrien 48236769Sobrien/*- 49236769Sobrien * LstAppend.c -- 50236769Sobrien * Add a new node with a new datum after an existing node 51236769Sobrien */ 52236769Sobrien 53236769Sobrien#include "lstInt.h" 54236769Sobrien 55236769Sobrien/*- 56236769Sobrien *----------------------------------------------------------------------- 57236769Sobrien * Lst_InsertAfter -- 58236769Sobrien * Create a new node and add it to the given list after the given node. 59236769Sobrien * 60236769Sobrien * Input: 61236769Sobrien * l affected list 62236769Sobrien * ln node after which to append the datum 63236769Sobrien * d said datum 64236769Sobrien * 65236769Sobrien * Results: 66236769Sobrien * SUCCESS if all went well. 67236769Sobrien * 68236769Sobrien * Side Effects: 69236769Sobrien * A new ListNode is created and linked in to the List. The lastPtr 70236769Sobrien * field of the List will be altered if ln is the last node in the 71236769Sobrien * list. lastPtr and firstPtr will alter if the list was empty and 72236769Sobrien * ln was NULL. 73236769Sobrien * 74236769Sobrien *----------------------------------------------------------------------- 75236769Sobrien */ 76236769SobrienReturnStatus 77236769SobrienLst_InsertAfter(Lst l, LstNode ln, void *d) 78236769Sobrien{ 79236769Sobrien List list; 80236769Sobrien ListNode lNode; 81236769Sobrien ListNode nLNode; 82236769Sobrien 83236769Sobrien if (LstValid (l) && (ln == NULL && LstIsEmpty (l))) { 84236769Sobrien goto ok; 85236769Sobrien } 86236769Sobrien 87236769Sobrien if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) { 88236769Sobrien return (FAILURE); 89236769Sobrien } 90236769Sobrien ok: 91236769Sobrien 92236769Sobrien list = l; 93236769Sobrien lNode = ln; 94236769Sobrien 95236769Sobrien PAlloc (nLNode, ListNode); 96236769Sobrien nLNode->datum = d; 97236769Sobrien nLNode->useCount = nLNode->flags = 0; 98236769Sobrien 99236769Sobrien if (lNode == NULL) { 100236769Sobrien if (list->isCirc) { 101236769Sobrien nLNode->nextPtr = nLNode->prevPtr = nLNode; 102236769Sobrien } else { 103236769Sobrien nLNode->nextPtr = nLNode->prevPtr = NULL; 104236769Sobrien } 105236769Sobrien list->firstPtr = list->lastPtr = nLNode; 106236769Sobrien } else { 107236769Sobrien nLNode->prevPtr = lNode; 108236769Sobrien nLNode->nextPtr = lNode->nextPtr; 109236769Sobrien 110236769Sobrien lNode->nextPtr = nLNode; 111236769Sobrien if (nLNode->nextPtr != NULL) { 112236769Sobrien nLNode->nextPtr->prevPtr = nLNode; 113236769Sobrien } 114236769Sobrien 115236769Sobrien if (lNode == list->lastPtr) { 116236769Sobrien list->lastPtr = nLNode; 117236769Sobrien } 118236769Sobrien } 119236769Sobrien 120236769Sobrien return (SUCCESS); 121236769Sobrien} 122236769Sobrien 123