66418680d4
Some years ago I made it O(n^2). Someone helpfully made it O(n^4) again. Today I'm making it O(n). If that's not good enough, I don't know what else to do. B-) Technical details: * The graph traversal in propagate() is modified to be able to start from any point in the tree. To handle certain exceptional cases, it is also modified to work in two passes, marking the tree with a special tag and then changing it to DFOUND. * The reconnect case now modifies the child/sibling pointers and calls propagate() to propagate the connection state starting with the reconnected directory. Pray that you never encounter a file system trashed enough for this to matter.