usr.bin/make/lst.lib/lstAppend.c

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