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