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[] = "@(#)lstLength.c 5.2 (Berkeley) 03/11/90"; 23 #endif /* not lint */ 24 25 /*- 26 * lstLength.c -- 27 * Find the length of a lst 28 */ 29 30 #include "lstInt.h" 31 32 int 33 Lst_Length(l) 34 Lst l; /* List whose length is desired */ 35 { 36 register ListNode node; 37 register List list = (List)l; 38 register int len; 39 40 if (!LstValid(l)) { 41 return -1; 42 } 43 44 for (len = 0, node = list->firstPtr; 45 node != NilListNode; 46 len++, node = node->nextPtr) { 47 if (node == list->firstPtr && len != 0) { 48 break; 49 } 50 } 51 return len; 52 } 53