Commit | Line | Data |
---|---|---|
15637ed4 RG |
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, 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 | ||
37 | #ifndef lint | |
38 | static char sccsid[] = "@(#)lstFindFrom.c 5.3 (Berkeley) 6/1/90"; | |
39 | #endif /* not lint */ | |
40 | ||
41 | /*- | |
42 | * LstFindFrom.c -- | |
43 | * Find a node on a list from a given starting point. Used by Lst_Find. | |
44 | */ | |
45 | ||
46 | #include "lstInt.h" | |
47 | ||
48 | /*- | |
49 | *----------------------------------------------------------------------- | |
50 | * Lst_FindFrom -- | |
51 | * Search for a node starting and ending with the given one on the | |
52 | * given list using the passed datum and comparison function to | |
53 | * determine when it has been found. | |
54 | * | |
55 | * Results: | |
56 | * The found node or NILLNODE | |
57 | * | |
58 | * Side Effects: | |
59 | * None. | |
60 | * | |
61 | *----------------------------------------------------------------------- | |
62 | */ | |
63 | LstNode | |
64 | Lst_FindFrom (l, ln, d, cProc) | |
65 | Lst l; | |
66 | register LstNode ln; | |
67 | register ClientData d; | |
68 | register int (*cProc)(); | |
69 | { | |
70 | register ListNode tln; | |
71 | Boolean found = FALSE; | |
72 | ||
73 | if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) { | |
74 | return (NILLNODE); | |
75 | } | |
76 | ||
77 | tln = (ListNode)ln; | |
78 | ||
79 | do { | |
80 | if ((*cProc) (tln->datum, d) == 0) { | |
81 | found = TRUE; | |
82 | break; | |
83 | } else { | |
84 | tln = tln->nextPtr; | |
85 | } | |
86 | } while (tln != (ListNode)ln && tln != NilListNode); | |
87 | ||
88 | if (found) { | |
89 | return ((LstNode)tln); | |
90 | } else { | |
91 | return (NILLNODE); | |
92 | } | |
93 | } | |
94 |