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 the above copyright notice and this paragraph are 10 * duplicated in all such forms and that any documentation, 11 * advertising materials, and other materials related to such 12 * distribution and use acknowledge that the software was developed 13 * by the University of California, Berkeley. The name of the 14 * University may not be used to endorse or promote products derived 15 * from this software without specific prior written permission. 16 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR 17 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED 18 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. 19 */ 20 21 #ifndef lint 22 static char sccsid[] = "@(#)lstEnQueue.c 5.2 (Berkeley) 03/11/90"; 23 #endif /* not lint */ 24 25 /*- 26 * LstEnQueue.c-- 27 * Treat the list as a queue and place a datum at its end 28 */ 29 30 #include "lstInt.h" 31 32 /*- 33 *----------------------------------------------------------------------- 34 * Lst_EnQueue -- 35 * Add the datum to the tail of the given list. 36 * 37 * Results: 38 * SUCCESS or FAILURE as returned by Lst_Append. 39 * 40 * Side Effects: 41 * the lastPtr field is altered all the time and the firstPtr field 42 * will be altered if the list used to be empty. 43 * 44 *----------------------------------------------------------------------- 45 */ 46 ReturnStatus 47 Lst_EnQueue (l, d) 48 Lst l; 49 ClientData d; 50 { 51 if (LstValid (l) == FALSE) { 52 return (FAILURE); 53 } 54 55 return (Lst_Append (l, Lst_Last(l), d)); 56 } 57 58