🚀 go-pugleaf

In article <7187@cbmvax.UUCP> jesup@cbmvax.UUCP (Randell Jesup) writes:
<In article <25860@agate.BERKELEY.EDU> mwm@eris.berkeley.edu (Mike (I'll think of something yet) Meyer) writes:
<> [Side note: anyone feel up to writing the ftw routine
<>& tw program for the Amiga? It'd make life a lot nicer!]
<
<	ftw I know, and shouldn't be hard to do (plus it'll be useful for
<our own programs - or at least something like it).  What is tw? (I assume
<it stands for tree-walk, but my sun has no man entry for it.)

That was a slip - I meant ftwalk, not ftw. Ftwalk does the same kind
of things as ftw, except that it provides more flexibility. It's also
faster than most of the roll-your-own file tree walkers in Unix
commands.  Tw is a tool based on ftw, that gives you an awk-like
langauge for dealing with each file; looking at it's stat structure,
and those of it's parent and other files. See the June '89 Usenix
proceedings for a description of both.

<	Any recursive fs-walk in a program should have stack checking
<built in (yes, I know dir doesn't now, but it will).  As for non-directory non-
<file entries, you won't see them unless you understand links (you'll see
<what they point to).  If you understand links, you're ok.

All true - but it's just barely more acceptable for a program to
complain about being out of space & die than it is for it to GURU the
machine.

Can I assume that all utilities that walk trees will understand
links, and do the "right" thing (where "right" varies with the
utility)? And that users will be warned that creating circles in their
file tree could create problems for older programs?

	<mike
--
Round about, round about, in a fair ring-a.		Mike Meyer
Thus we dance, thus we dance, and thus we sing-a.	mwm@berkeley.edu
Trip and go, to and fro, over this green-a.		ucbvax!mwm
All about, in and out, over this green-a.		mwm@ucbjade.BITNET