| 1 | /*
|
|---|
| 2 | * Copyright (c) 1988, 1989, 1990, 1993
|
|---|
| 3 | * The Regents of the University of California. 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, with or without
|
|---|
| 9 | * modification, are permitted provided that the following conditions
|
|---|
| 10 | * are met:
|
|---|
| 11 | * 1. Redistributions of source code must retain the above copyright
|
|---|
| 12 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 13 | * 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 14 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 15 | * documentation and/or other materials provided with the distribution.
|
|---|
| 16 | * 3. All advertising materials mentioning features or use of this software
|
|---|
| 17 | * must display the following acknowledgement:
|
|---|
| 18 | * This product includes software developed by the University of
|
|---|
| 19 | * California, Berkeley and its contributors.
|
|---|
| 20 | * 4. Neither the name of the University nor the names of its contributors
|
|---|
| 21 | * may be used to endorse or promote products derived from this software
|
|---|
| 22 | * without specific prior written permission.
|
|---|
| 23 | *
|
|---|
| 24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|---|
| 28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 34 | * SUCH DAMAGE.
|
|---|
| 35 | *
|
|---|
| 36 | * $FreeBSD: src/usr.bin/make/lst.lib/lstNext.c,v 1.6 1999/08/28 01:03:55 peter Exp $
|
|---|
| 37 | */
|
|---|
| 38 |
|
|---|
| 39 | #ifndef lint
|
|---|
| 40 | static char sccsid[] = "@(#)lstNext.c 8.1 (Berkeley) 6/6/93";
|
|---|
| 41 | #endif /* not lint */
|
|---|
| 42 |
|
|---|
| 43 | /*-
|
|---|
| 44 | * LstNext.c --
|
|---|
| 45 | * Return the next node for a list.
|
|---|
| 46 | * The sequential functions access the list in a slightly different way.
|
|---|
| 47 | * CurPtr points to their idea of the current node in the list and they
|
|---|
| 48 | * access the list based on it. Because the list is circular, Lst_Next
|
|---|
| 49 | * and Lst_Prev will go around the list forever. Lst_IsAtEnd must be
|
|---|
| 50 | * used to determine when to stop.
|
|---|
| 51 | */
|
|---|
| 52 |
|
|---|
| 53 | #include "lstInt.h"
|
|---|
| 54 |
|
|---|
| 55 | /*-
|
|---|
| 56 | *-----------------------------------------------------------------------
|
|---|
| 57 | * Lst_Next --
|
|---|
| 58 | * Return the next node for the given list.
|
|---|
| 59 | *
|
|---|
| 60 | * Results:
|
|---|
| 61 | * The next node or NILLNODE if the list has yet to be opened. Also
|
|---|
| 62 | * if the list is non-circular and the end has been reached, NILLNODE
|
|---|
| 63 | * is returned.
|
|---|
| 64 | *
|
|---|
| 65 | * Side Effects:
|
|---|
| 66 | * the curPtr field is updated.
|
|---|
| 67 | *
|
|---|
| 68 | *-----------------------------------------------------------------------
|
|---|
| 69 | */
|
|---|
| 70 | LstNode
|
|---|
| 71 | Lst_Next (l)
|
|---|
| 72 | Lst l;
|
|---|
| 73 | {
|
|---|
| 74 | register ListNode tln;
|
|---|
| 75 | register List list = (List)l;
|
|---|
| 76 |
|
|---|
| 77 | if ((LstValid (l) == FALSE) ||
|
|---|
| 78 | (list->isOpen == FALSE)) {
|
|---|
| 79 | return (NILLNODE);
|
|---|
| 80 | }
|
|---|
| 81 |
|
|---|
| 82 | list->prevPtr = list->curPtr;
|
|---|
| 83 |
|
|---|
| 84 | if (list->curPtr == NilListNode) {
|
|---|
| 85 | if (list->atEnd == Unknown) {
|
|---|
| 86 | /*
|
|---|
| 87 | * If we're just starting out, atEnd will be Unknown.
|
|---|
| 88 | * Then we want to start this thing off in the right
|
|---|
| 89 | * direction -- at the start with atEnd being Middle.
|
|---|
| 90 | */
|
|---|
| 91 | list->curPtr = tln = list->firstPtr;
|
|---|
| 92 | list->atEnd = Middle;
|
|---|
| 93 | } else {
|
|---|
| 94 | tln = NilListNode;
|
|---|
| 95 | list->atEnd = Tail;
|
|---|
| 96 | }
|
|---|
| 97 | } else {
|
|---|
| 98 | tln = list->curPtr->nextPtr;
|
|---|
| 99 | list->curPtr = tln;
|
|---|
| 100 |
|
|---|
| 101 | if (tln == list->firstPtr || tln == NilListNode) {
|
|---|
| 102 | /*
|
|---|
| 103 | * If back at the front, then we've hit the end...
|
|---|
| 104 | */
|
|---|
| 105 | list->atEnd = Tail;
|
|---|
| 106 | } else {
|
|---|
| 107 | /*
|
|---|
| 108 | * Reset to Middle if gone past first.
|
|---|
| 109 | */
|
|---|
| 110 | list->atEnd = Middle;
|
|---|
| 111 | }
|
|---|
| 112 | }
|
|---|
| 113 |
|
|---|
| 114 | return ((LstNode)tln);
|
|---|
| 115 | }
|
|---|
| 116 |
|
|---|
