]>
Commit | Line | Data |
---|---|---|
5b2abdfb | 1 | /*- |
e9ce8d39 A |
2 | * Copyright (c) 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 | * Chris Torek. | |
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. | |
e9ce8d39 A |
16 | * 4. Neither the name of the University nor the names of its contributors |
17 | * may be used to endorse or promote products derived from this software | |
18 | * without specific prior written permission. | |
19 | * | |
20 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
21 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
22 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
23 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
24 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
25 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
26 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
27 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
28 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
29 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
30 | * SUCH DAMAGE. | |
31 | */ | |
32 | ||
33 | #if defined(LIBC_SCCS) && !defined(lint) | |
9385eb3d | 34 | static char sccsid[] = "@(#)fwalk.c 8.1 (Berkeley) 6/4/93"; |
e9ce8d39 | 35 | #endif /* LIBC_SCCS and not lint */ |
9385eb3d | 36 | #include <sys/cdefs.h> |
1f2f436a | 37 | __FBSDID("$FreeBSD: src/lib/libc/stdio/fwalk.c,v 1.10 2007/01/09 00:28:06 imp Exp $"); |
e9ce8d39 | 38 | |
5b2abdfb | 39 | #include <sys/types.h> |
9385eb3d | 40 | #include <machine/atomic.h> |
e9ce8d39 | 41 | #include <stdio.h> |
9385eb3d A |
42 | #include "local.h" |
43 | #include "glue.h" | |
e9ce8d39 A |
44 | |
45 | int | |
9385eb3d A |
46 | _fwalk(function) |
47 | int (*function)(FILE *); | |
e9ce8d39 | 48 | { |
9385eb3d A |
49 | FILE *fp; |
50 | int n, ret; | |
51 | struct glue *g; | |
5b2abdfb | 52 | |
9385eb3d A |
53 | ret = 0; |
54 | /* | |
55 | * It should be safe to walk the list without locking it; | |
56 | * new nodes are only added to the end and none are ever | |
57 | * removed. | |
58 | * | |
59 | * Avoid locking this list while walking it or else you will | |
60 | * introduce a potential deadlock in [at least] refill.c. | |
61 | */ | |
62 | for (g = &__sglue; g != NULL; g = g->next) | |
63 | for (fp = g->iobs, n = g->niobs; --n >= 0; fp++) | |
64 | if ((fp->_flags != 0) && ((fp->_flags & __SIGN) == 0)) | |
65 | ret |= (*function)(fp); | |
66 | return (ret); | |
e9ce8d39 | 67 | } |