commit | 93b353d3532cc12e7e8ca05f59a2199398252df5 | [log] [download] |
---|---|---|
author | Nicholas Marriott <nicm@openbsd.org> | Sat Oct 10 09:31:39 2009 +0000 |
committer | Nicholas Marriott <nicm@openbsd.org> | Sat Oct 10 09:31:39 2009 +0000 |
tree | 950e84fa2c8eb764183c2047ae1e905cd4c33282 | |
parent | bf38a311daa8a8048974a401b88909aa56b25e19 [diff] |
Instead of passing a struct pollfd ** around through various functions, build them into a tree and then convert into a flat poll array before and after poll. This adds a little code but should reduce annoying problems with ordering when adding new things that also need to be polled.