1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*b30d1939SAndy Fiddaman * Copyright (c) 1985-2011 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6*b30d1939SAndy Fiddaman * Eclipse Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * 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) * 12da2e3ebdSchin * * 13da2e3ebdSchin * Information and Software Systems Research * 14da2e3ebdSchin * AT&T Research * 15da2e3ebdSchin * Florham Park NJ * 16da2e3ebdSchin * * 17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> * 18da2e3ebdSchin * David Korn <dgk@research.att.com> * 19da2e3ebdSchin * Phong Vo <kpv@research.att.com> * 20da2e3ebdSchin * * 21da2e3ebdSchin ***********************************************************************/ 22da2e3ebdSchin #pragma prototyped 23da2e3ebdSchin 24da2e3ebdSchin #include "stdhdr.h" 25da2e3ebdSchin 2634f9b3eeSRoland Mainz #define MAXLOOP 3 2734f9b3eeSRoland Mainz 28da2e3ebdSchin int fcloseall(void)29da2e3ebdSchinfcloseall(void) 30da2e3ebdSchin { 3134f9b3eeSRoland Mainz Sfpool_t* p; 3234f9b3eeSRoland Mainz Sfpool_t* next; 3334f9b3eeSRoland Mainz int n; 3434f9b3eeSRoland Mainz int nclose; 3534f9b3eeSRoland Mainz int count; 3634f9b3eeSRoland Mainz int loop; 3734f9b3eeSRoland Mainz 3834f9b3eeSRoland Mainz STDIO_INT(0, "fcloseall", int, (void), ()) 3934f9b3eeSRoland Mainz 4034f9b3eeSRoland Mainz for(loop = 0; loop < MAXLOOP; ++loop) 4134f9b3eeSRoland Mainz { nclose = count = 0; 4234f9b3eeSRoland Mainz for(p = &_Sfpool; p; p = next) 4334f9b3eeSRoland Mainz { /* find the next legitimate pool */ 4434f9b3eeSRoland Mainz for(next = p->next; next; next = next->next) 4534f9b3eeSRoland Mainz if(next->n_sf > 0) 4634f9b3eeSRoland Mainz break; 4734f9b3eeSRoland Mainz for(n = 0; n < ((p == &_Sfpool) ? p->n_sf : 1); ++n) 4834f9b3eeSRoland Mainz { count += 1; 4934f9b3eeSRoland Mainz if(sfclose(p->sf[n]) >= 0) 5034f9b3eeSRoland Mainz nclose += 1; 5134f9b3eeSRoland Mainz } 5234f9b3eeSRoland Mainz } 5334f9b3eeSRoland Mainz if(nclose == count) 5434f9b3eeSRoland Mainz break; 55da2e3ebdSchin } 5634f9b3eeSRoland Mainz return 0; /* always return 0 per GNU */ 57da2e3ebdSchin } 58