Unix "find" expressions compiled to bytecode

<- Back

Comments (13)

drob518
From the article:> I was later surprised all the real world find implementations I examined use tree-walk interpreters instead.I’m not sure why this would be surprising. The find utility is totally dominated by disk IOPS. The interpretation performance of find conditions is totally swamped by reading stuff from disk. So, keep it simple and just use a tree-walk interpreter.
tasty_freeze
That is a fun exercise, but I imagine the time to evaluate the conditional expression is a tiny fraction, just a percent or less, than the time it takes to make the file system calls.