forked from KolibriOS/kolibrios
87 lines
2.8 KiB
C
87 lines
2.8 KiB
C
|
/*
|
||
|
|
* Copyright (c) 1990 The Regents of the University of California.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms are permitted
|
||
|
|
* provided that the above copyright notice and this paragraph are
|
||
|
|
* duplicated in all such forms and that any documentation,
|
||
|
|
* advertising materials, and other materials related to such
|
||
|
|
* distribution and use acknowledge that the software was developed
|
||
|
|
* by the University of California, Berkeley. The name of the
|
||
|
|
* University may not be used to endorse or promote products derived
|
||
|
|
* from this software without specific prior written permission.
|
||
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
|
||
|
|
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
|
||
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
||
|
|
*/
|
||
|
|
/* No user fns here. Pesch 15apr92. */
|
||
|
|
|
||
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
||
|
|
static char sccsid[] = "%W% (Berkeley) %G%";
|
||
|
|
#endif /* LIBC_SCCS and not lint */
|
||
|
|
|
||
|
|
#include <_ansi.h>
|
||
|
|
#include <reent.h>
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <errno.h>
|
||
|
|
#include "local.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
_DEFUN(_fwalk, (ptr, function),
|
||
|
|
struct _reent *ptr _AND
|
||
|
|
register int (*function) (FILE *))
|
||
|
|
{
|
||
|
|
register FILE *fp;
|
||
|
|
register int n, ret = 0;
|
||
|
|
register struct _glue *g;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* It should be safe to walk the list without locking it;
|
||
|
|
* new nodes are only added to the end and none are ever
|
||
|
|
* removed.
|
||
|
|
*
|
||
|
|
* Avoid locking this list while walking it or else you will
|
||
|
|
* introduce a potential deadlock in [at least] refill.c.
|
||
|
|
*/
|
||
|
|
for (g = &ptr->__sglue; g != NULL; g = g->_next)
|
||
|
|
for (fp = g->_iobs, n = g->_niobs; --n >= 0; fp++)
|
||
|
|
if (fp->_flags != 0)
|
||
|
|
{
|
||
|
|
if (fp->_flags != 0 && fp->_flags != 1 && fp->_file != -1)
|
||
|
|
ret |= (*function) (fp);
|
||
|
|
}
|
||
|
|
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Special version of __fwalk where the function pointer is a reentrant
|
||
|
|
I/O function (e.g. _fclose_r). */
|
||
|
|
int
|
||
|
|
_DEFUN(_fwalk_reent, (ptr, reent_function),
|
||
|
|
struct _reent *ptr _AND
|
||
|
|
register int (*reent_function) (struct _reent *, FILE *))
|
||
|
|
{
|
||
|
|
register FILE *fp;
|
||
|
|
register int n, ret = 0;
|
||
|
|
register struct _glue *g;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* It should be safe to walk the list without locking it;
|
||
|
|
* new nodes are only added to the end and none are ever
|
||
|
|
* removed.
|
||
|
|
*
|
||
|
|
* Avoid locking this list while walking it or else you will
|
||
|
|
* introduce a potential deadlock in [at least] refill.c.
|
||
|
|
*/
|
||
|
|
for (g = &ptr->__sglue; g != NULL; g = g->_next)
|
||
|
|
for (fp = g->_iobs, n = g->_niobs; --n >= 0; fp++)
|
||
|
|
if (fp->_flags != 0)
|
||
|
|
{
|
||
|
|
if (fp->_flags != 0 && fp->_flags != 1 && fp->_file != -1)
|
||
|
|
ret |= (*reent_function) (ptr, fp);
|
||
|
|
}
|
||
|
|
|
||
|
|
return ret;
|
||
|
|
}
|