The old code didn't need to do it, because the events were registered
for all the fd values pointing to a single file *. That's cool -
that's exactly what anyone would expect. The point of dup2() is that
the fds are equivalent, and share state (such as seek pointer).
Now you have two strange (IMHO unclean) behaviours, that an
application programmer needs to be aware of:
1. Duplicate fds don't share registered event state.
Theoretically this could break an existing app, but I doubt if any
depend on this behaviour at present. This is not likely to confuse anyone, as long as it is documented.
2. When process A sends an fd to process B, the events will appear
in process B _iff_ the fd number in B happens to be the same
value as in process A. (Without your patch, the events will always
appear in process B).
Furthermore, when process B dups the fd or passes it elsewhere,
events will appear if the new fd happens to be the same as the
original fd number in A.
The only correct application code in this case is to use
EPOLL_CTL_DEL in A and EPOLL_CTL_ADD in B, although it is
confusing because you'll have programs which _sometimes_ work
without that.
Oh, and:
3. It's almost a memory leak. Not quite because it's cleaned up
eventually. But it looks and feels just like one.
I guess what I'm saying is that hashing on fd number is quite simply
wrong. The fundamental object is the file *, that's how its meant to be.
:)
-- Jamie
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/