[Gnu-arch-users] Re: [PATCH] arch speedups on big trees

[Miles Bader]

Charles Duffy <address@hidden> writes:
> Depends on where you are. On AFS, for instance, stat() calls aren't
> cached on the client, so they're potentially much slower (!) than
> read()s; for that reason, checking the inode signatures is exceedingly
> slow there, and so this optimization will be a very substantial gain.

Does AFS not special-case stats of files that are in the cache?!?

I've been using tla in NFS, btw, and one huge horrible lose there is that
computing a changeset seems to do, for every file, `diff a b > ,tmp',
where ",tmp" is _in the current tree_.  Creating a temporary file then
deleting it is ... slow.

Since in many, many cases, almost all invocations of diff result in no
output -- and little output when there is any -- I wonder if it might be
better to do something make the output of each diff a pipe read by the tla
process, which would then only create the output file when some output
actually appeared...

-Miles
-- 
((lambda (x) (list x x)) (lambda (x) (list x x)))