projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| bb2109e7 KB |
1 | /* |
| 2 | * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. | |
| 3 | * All rights reserved. | |
| c65fedcf | 4 | * |
| bb2109e7 KB |
5 | * This code is derived from software contributed to Berkeley by |
| 6 | * Adam de Boor. | |
| c65fedcf | 7 | * |
| bb2109e7 KB |
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. | |
| c65fedcf | 19 | */ |
| bb2109e7 | 20 | |
| c65fedcf | 21 | #ifndef lint |
| bb2109e7 KB |
22 | static char sccsid[] = "@(#)lstLast.c 5.2 (Berkeley) %G%"; |
| 23 | #endif /* not lint */ | |
| 24 | ||
| 25 | /*- | |
| 26 | * LstLast.c -- | |
| 27 | * Return the last element of a list | |
| 28 | */ | |
| c65fedcf KB |
29 | |
| 30 | #include "lstInt.h" | |
| 31 | ||
| 32 | /*- | |
| 33 | *----------------------------------------------------------------------- | |
| 34 | * Lst_Last -- | |
| 35 | * Return the last node on the list l. | |
| 36 | * | |
| 37 | * Results: | |
| 38 | * The requested node or NILLNODE if the list is empty. | |
| 39 | * | |
| 40 | * Side Effects: | |
| 41 | * None. | |
| 42 | * | |
| 43 | *----------------------------------------------------------------------- | |
| 44 | */ | |
| 45 | LstNode | |
| 46 | Lst_Last (l) | |
| 47 | Lst l; | |
| 48 | { | |
| 49 | if (!LstValid(l) || LstIsEmpty (l)) { | |
| 50 | return (NILLNODE); | |
| 51 | } else { | |
| 52 | return ((LstNode)((List)l)->lastPtr); | |
| 53 | } | |
| 54 | } | |
| 55 |