upgraded to the latest NetBSD version

[unix-history] / usr / src / usr.bin / make / lst.lib / lstDupl.c

/*
* 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
* Adam de Boor.
*
* %sccs.include.redist.c%
*/

#ifndef lint
static char sccsid[] = "@(#)lstDupl.c   8.2 (Berkeley) %G%";
#endif /* not lint */

/*-
* listDupl.c --
*      Duplicate a list. This includes duplicating the individual
*      elements.
*/

#include    "lstInt.h"

/*-
*-----------------------------------------------------------------------
* Lst_Duplicate --
*      Duplicate an entire list. If a function to copy a ClientData is
*      given, the individual client elements will be duplicated as well.
*
* Results:
*      The new Lst structure or NILLST if failure.
*
* Side Effects:
*      A new list is created.
*-----------------------------------------------------------------------
*/
Lst
Lst_Duplicate (l, copyProc)
   Lst           l;             /* the list to duplicate */
   /* A function to duplicate each ClientData */
   ClientData    (*copyProc) __P((ClientData));
{
   register Lst        nl;
   register ListNode   ln;
   register List       list = (List)l;
   
   if (!LstValid (l)) {
       return (NILLST);
   }

   nl = Lst_Init (list->isCirc);
   if (nl == NILLST) {
       return (NILLST);
   }

   ln = list->firstPtr;
   while (ln != NilListNode) {
       if (copyProc != NOCOPY) {
           if (Lst_AtEnd (nl, (*copyProc) (ln->datum)) == FAILURE) {
               return (NILLST);
           }
       } else if (Lst_AtEnd (nl, ln->datum) == FAILURE) {
           return (NILLST);
       }

       if (list->isCirc && ln == list->lastPtr) {
           ln = NilListNode;
       } else {
           ln = ln->nextPtr;
       }
   }
       
   return (nl);
}