blob: 37728c9dc59fa437d9b07cf373f364364f0f4b9d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2009 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.opensource.org/licenses/cpl1.0.txt *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
#include "stdhdr.h"
#define MAXLOOP 3
int
fcloseall(void)
{
Sfpool_t* p;
Sfpool_t* next;
int n;
int nclose;
int count;
int loop;
STDIO_INT(0, "fcloseall", int, (void), ())
for(loop = 0; loop < MAXLOOP; ++loop)
{ nclose = count = 0;
for(p = &_Sfpool; p; p = next)
{ /* find the next legitimate pool */
for(next = p->next; next; next = next->next)
if(next->n_sf > 0)
break;
for(n = 0; n < ((p == &_Sfpool) ? p->n_sf : 1); ++n)
{ count += 1;
if(sfclose(p->sf[n]) >= 0)
nclose += 1;
}
}
if(nclose == count)
break;
}
return 0; /* always return 0 per GNU */
}
|
