Annotation of 43BSDReno/usr.bin/make/lst.lib/lstEnQueue.c, revision 1.1.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[] = "@(#)lstEnQueue.c       5.3 (Berkeley) 6/1/90";
                     25: #endif /* not lint */
                     26: 
                     27: /*-
                     28:  * LstEnQueue.c--
                     29:  *     Treat the list as a queue and place a datum at its end
                     30:  */
                     31: 
                     32: #include       "lstInt.h"
                     33: 
                     34: /*-
                     35:  *-----------------------------------------------------------------------
                     36:  * Lst_EnQueue --
                     37:  *     Add the datum to the tail of the given list.
                     38:  *
                     39:  * Results:
                     40:  *     SUCCESS or FAILURE as returned by Lst_Append.
                     41:  *
                     42:  * Side Effects:
                     43:  *     the lastPtr field is altered all the time and the firstPtr field
                     44:  *     will be altered if the list used to be empty.
                     45:  *
                     46:  *-----------------------------------------------------------------------
                     47:  */
                     48: ReturnStatus
                     49: Lst_EnQueue (l, d)
                     50:     Lst                  l;
                     51:     ClientData   d;
                     52: {
                     53:     if (LstValid (l) == FALSE) {
                     54:        return (FAILURE);
                     55:     }
                     56:     
                     57:     return (Lst_Append (l, Lst_Last(l), d));
                     58: }
                     59: 

unix.superglobalmegacorp.com

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