1 /* $OpenPackages$ */ 2 /* $OpenBSD: lstAppend.c,v 1.15 2003/06/03 02:56:12 millert Exp $ */ 3 /* $NetBSD: lstAppend.c,v 1.5 1996/11/06 17:59:31 christos Exp $ */ 4 5 /* 6 * Copyright (c) 1988, 1989, 1990, 1993 7 * The Regents of the University of California. All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * Adam de Boor. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 */ 36 37 /*- 38 * LstAppend.c -- 39 * Add a new node with a new datum after an existing node 40 */ 41 42 #include "lstInt.h" 43 #include <sys/types.h> 44 #include <stddef.h> 45 #include "memory.h" 46 47 /*- 48 *----------------------------------------------------------------------- 49 * Lst_Append -- 50 * Create a new node and add it to the given list after the given node. 51 * 52 * Side Effects: 53 * A new ListNode is created and linked in to the List. The lastPtr 54 * field of the List will be altered if ln is the last node in the 55 * list. lastPtr and firstPtr will alter if the list was empty and 56 * ln was NULL. 57 * 58 *----------------------------------------------------------------------- 59 */ 60 void 61 Lst_Append(l, ln, d) 62 Lst l; /* affected list */ 63 LstNode ln; /* node after which to append the datum */ 64 void *d; /* said datum */ 65 { 66 LstNode nLNode; 67 68 if (ln == NULL && !Lst_IsEmpty(l)) 69 return; 70 71 if (ln != NULL && Lst_IsEmpty(l)) 72 return; 73 74 PAlloc(nLNode, LstNode); 75 nLNode->datum = d; 76 77 if (ln == NULL) { 78 nLNode->nextPtr = nLNode->prevPtr = NULL; 79 l->firstPtr = l->lastPtr = nLNode; 80 } else { 81 nLNode->prevPtr = ln; 82 nLNode->nextPtr = ln->nextPtr; 83 84 ln->nextPtr = nLNode; 85 if (nLNode->nextPtr != NULL) 86 nLNode->nextPtr->prevPtr = nLNode; 87 88 if (ln == l->lastPtr) 89 l->lastPtr = nLNode; 90 } 91 } 92 93 void 94 Lst_AtEnd(l, d) 95 Lst l; 96 void *d; 97 { 98 LstNode ln; 99 100 PAlloc(ln, LstNode); 101 ln->datum = d; 102 103 ln->prevPtr = l->lastPtr; 104 ln->nextPtr = NULL; 105 if (l->lastPtr == NULL) 106 l->firstPtr = ln; 107 else 108 l->lastPtr->nextPtr = ln; 109 l->lastPtr = ln; 110 } 111