Nikita Danilov wrote on Tue, 31 May 2005 13:34:55 +0400: > Cycle may consists of more graph nodes than fits into memory. Cycle > detection is crucial for rename semantics, and if > cycle-just-about-to-be-formed doesn't fit into memory it's not clear how > to detect it, because tree has to be locked while checked for cycles, and > one definitely doesn't want to keep such a lock over IO.
Sometimes you'll just have to return an error code if the rename operation is too complex to be done. The user will have to then delete individual leaf files to make the situation simpler. I hope this won't happen very often. On the plus side, the detection of all the files that may be affected means you can now delete a directory directly, contents and all, if all the related inodes fit into memory. - Alex
