From: Eli Zaretskii Newsgroups: comp.os.msdos.djgpp Subject: Re: See inside for more information Date: Thu, 25 Nov 1999 10:01:42 +0200 Organization: NetVision Israel Lines: 22 Message-ID: References: NNTP-Posting-Host: is.elta.co.il Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: news.netvision.net.il 943516810 5195 199.203.121.2 (25 Nov 1999 08:00:10 GMT) X-Complaints-To: abuse AT netvision DOT net DOT il NNTP-Posting-Date: 25 Nov 1999 08:00:10 GMT X-Sender: eliz AT is In-Reply-To: To: djgpp AT delorie DOT com DJ-Gateway: from newsgroup comp.os.msdos.djgpp Reply-To: djgpp AT delorie DOT com X-Mailing-List: djgpp AT delorie DOT com X-Unsubscribes-To: listserv AT delorie DOT com Precedence: bulk On Wed, 24 Nov 1999, Damian Yerrick wrote: > > Not true. DJGPP does implements all of Posix requirements from a C > > library, even though DOS sometimes makes it hard. A handful of > > functions, like `fork', always fail, but they *are* provided, and > > their number is very small. > > Which functions always fail? I want to know what to avoid > when thinking up algorithms. I'm not aware of a list that specifically names all such functions, but the library docs says that for each function individually. If you look up each function in the docs before committing to an algorithm, you are safe. Search libc.info for "to assist" and "always returns", and you will find the handful of functions involved. > (I already looked in the 200-page FAQ.) These issues shouldn't be in the FAQ, that's what library docs is for.