Ingo Weinhold wrote:
On a 32 bit machine watching a node (not watched by anyone else) costs 72 bytes of kernel heap. There's a minimal CPU overhead for checking whether an event for a watched node occurred and some overhead for actually sending a node monitoring message. Watching a directory's contents is just watching a single node for a specific event. The mechanism requires a kernel resource (kernel heap), so a soft limit is in order to protect the system.
Ok, thanks. So the next question is, does a query already node monitors it's results (internally) to generate the query update events? Wouldn't adding another type of event (like B_ENTRY_MOVED) for queries make sense?
Regards, Alex