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[] = "@(#)lstSucc.c 5.2 (Berkeley) 03/11/90"; 23 #endif /* not lint */ 24 25 /*- 26 * LstSucc.c -- 27 * return the successor to a given node 28 */ 29 30 #include "lstInt.h" 31 32 /*- 33 *----------------------------------------------------------------------- 34 * Lst_Succ -- 35 * Return the sucessor to the given node on its list. 36 * 37 * Results: 38 * The successor of the node, if it exists (note that on a circular 39 * list, if the node is the only one in the list, it is its own 40 * successor). 41 * 42 * Side Effects: 43 * None. 44 * 45 *----------------------------------------------------------------------- 46 */ 47 LstNode 48 Lst_Succ (ln) 49 LstNode ln; 50 { 51 if (ln == NILLNODE) { 52 return (NILLNODE); 53 } else { 54 return ((LstNode) ((ListNode) ln)->nextPtr); 55 } 56 } 57 58