Return to lstInit.c CVS log

Up to [CSRG BSD Unix] / 43BSDReno / usr.bin / make / lst.lib

Annotation of 43BSDReno/usr.bin/make/lst.lib/lstInit.c, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
        !             3:  * All rights reserved.
        !             4:  *
        !             5:  * This code is derived from software contributed to Berkeley by
        !             6:  * Adam de Boor.
        !             7:  *
        !             8:  * Redistribution and use in source and binary forms are permitted
        !             9:  * provided that: (1) source distributions retain this entire copyright
        !            10:  * notice and comment, and (2) distributions including binaries display
        !            11:  * the following acknowledgement:  ``This product includes software
        !            12:  * developed by the University of California, Berkeley and its contributors''
        !            13:  * in the documentation or other materials provided with the distribution
        !            14:  * and in all advertising materials mentioning features or use of this
        !            15:  * software. Neither the name of the University nor the names of its
        !            16:  * contributors may be used to endorse or promote products derived
        !            17:  * from this software without specific prior written permission.
        !            18:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
        !            19:  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
        !            20:  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
        !            21:  */
        !            22: 
        !            23: #ifndef lint
        !            24: static char sccsid[] = "@(#)lstInit.c  5.3 (Berkeley) 6/1/90";
        !            25: #endif /* not lint */
        !            26: 
        !            27: /*-
        !            28:  * init.c --
        !            29:  *     Initialize a new linked list.
        !            30:  */
        !            31: 
        !            32: #include       "lstInt.h"
        !            33: 
        !            34: /*-
        !            35:  *-----------------------------------------------------------------------
        !            36:  * Lst_Init --
        !            37:  *     Create and initialize a new list.
        !            38:  *
        !            39:  * Results:
        !            40:  *     The created list.
        !            41:  *
        !            42:  * Side Effects:
        !            43:  *     A list is created, what else?
        !            44:  *
        !            45:  *-----------------------------------------------------------------------
        !            46:  */
        !            47: Lst
        !            48: Lst_Init(circ)
        !            49:     Boolean            circ;   /* TRUE if the list should be made circular */
        !            50: {
        !            51:     register List      nList;
        !            52:     
        !            53:     PAlloc (nList, List);
        !            54:     
        !            55:     nList->firstPtr = NilListNode;
        !            56:     nList->lastPtr = NilListNode;
        !            57:     nList->isOpen = FALSE;
        !            58:     nList->isCirc = circ;
        !            59:     nList->atEnd = Unknown;
        !            60:     
        !            61:     return ((Lst)nList);
        !            62: }
        !            63: 
        !            64: Malloc(nbytes)
        !            65: {
        !            66: #ifdef DEBUG
        !            67:     printf("malloc: %d\n", nbytes);
        !            68: #endif DEBUG
        !            69:     return(malloc(nbytes));
        !            70: }

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.