Return to BSD News archive
Xref: sserve comp.unix.bsd:12882 comp.unix.internals:6453 comp.unix.programmer:12960 comp.unix.solaris:8300 comp.unix.wizards:31559 Newsgroups: comp.unix.bsd,comp.unix.internals,comp.unix.programmer,comp.unix.solaris,comp.unix.wizards Path: sserve!newshost.anu.edu.au!munnari.oz.au!spool.mu.edu!howland.reston.ans.net!europa.eng.gtefsd.com!uunet!psinntp!laidbak!mday From: mday@lachman.com (Matt Day) Subject: Looking for really fast find algorithm/program Message-ID: <1993Nov08.213209.28366@i88.isc.com> Followup-To: comp.unix.programmer Sender: usenet@i88.isc.com (Usenet News) Nntp-Posting-Host: peppy.i88.isc.com Organization: Lachman Technology, Inc., Naperville, IL Date: Mon, 08 Nov 1993 21:32:09 GMT Lines: 13 (Followups redirected to comp.unix.programmer.) I'm looking for an algorithm or program that prints the pathnames of all the files on a given file system as quickly as possible. Something similar to ff(1M) on Solaris 2.x and ncheck(8) on most UNIX systems, only even faster. This program would probably do things like read inodes straight off the disk into a table of some sort, and build the pathnames off of that. The ff(1M) and ncheck(8) utilities do this to a certain extent, but they use a slow algorithm. Any pointers would be appreciated! Thanks. Matt Day <mday@lachman.com>