From: "Ben Davis" <ben AT vjpoole DOT freeserve DOT co DOT uk>
Newsgroups: comp.os.msdos.djgpp
Subject: Re: Best way to implement DELTREE
Date: Tue, 4 Apr 2000 11:47:14 +0100
Organization: Customer of Planet Online
Lines: 14
Message-ID: <8ccha3$fhl$1@news8.svr.pol.co.uk>
References: <8ccfq7$v1q$1 AT newsg1 DOT svr DOT pol DOT co DOT uk> <38E9C679 DOT 30DE0FA4 AT mtu-net DOT ru>
NNTP-Posting-Host: modem-70.americium.dialup.pol.co.uk
X-Trace: news8.svr.pol.co.uk 954845315 15925 62.136.67.70 (4 Apr 2000 10:48:35 GMT)
NNTP-Posting-Date: 4 Apr 2000 10:48:35 GMT
X-Complaints-To: abuse AT theplanet DOT net
X-Newsreader: Microsoft Outlook Express 4.72.3110.5
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Reply-To: djgpp AT delorie DOT com

Alexei A. Frounze wrote in message <38E9C679 DOT 30DE0FA4 AT mtu-net DOT ru>...
>You need a recursive traversal through all the directories.
>Here you should use findfirst() and findnext() plus two subroutines that
>save and restore searching state of findfirst() and findnext(). These 2
>additional functions simply saves and restores DTA (refer to HelpPC 2.10
>or TechHelp 6 or Ralf Brown's Int List).

I once did some low-level DTA work (this was pre-DJGPP), so I know a bit
about DTAs. But can someone confirm please, will it work simply to save
sizeof(struct ffblk) bytes?

Ben Davis