1 | // Copyright (c) 2013 by István Váradi
|
---|
2 |
|
---|
3 | // This file is part of libxplcommon, a common utility library for
|
---|
4 | // development related to X-Plane
|
---|
5 |
|
---|
6 | // Redistribution and use in source and binary forms, with or without
|
---|
7 | // modification, are permitted provided that the following conditions are met:
|
---|
8 |
|
---|
9 | // 1. Redistributions of source code must retain the above copyright notice, this
|
---|
10 | // list of conditions and the following disclaimer.
|
---|
11 | // 2. Redistributions in binary form must reproduce the above copyright notice,
|
---|
12 | // this list of conditions and the following disclaimer in the documentation
|
---|
13 | // and/or other materials provided with the distribution.
|
---|
14 |
|
---|
15 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
---|
16 | // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
---|
17 | // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
---|
18 | // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
---|
19 | // ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
---|
20 | // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
---|
21 | // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
---|
22 | // ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
23 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
---|
24 | // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
25 |
|
---|
26 | // The views and conclusions contained in the software and documentation are those
|
---|
27 | // of the authors and should not be interpreted as representing official policies,
|
---|
28 | // either expressed or implied, of the FreeBSD Project.
|
---|
29 |
|
---|
30 | #ifndef XPLCOMMON_POSIX_WAITER_H
|
---|
31 | #define XPLCOMMON_POSIX_WAITER_H
|
---|
32 | //------------------------------------------------------------------------------
|
---|
33 |
|
---|
34 | #include <map>
|
---|
35 |
|
---|
36 | #include <cstdlib>
|
---|
37 |
|
---|
38 | #include <poll.h>
|
---|
39 |
|
---|
40 | //------------------------------------------------------------------------------
|
---|
41 |
|
---|
42 | namespace xplcommon { namespace posix {
|
---|
43 |
|
---|
44 | //------------------------------------------------------------------------------
|
---|
45 |
|
---|
46 | class Waitable;
|
---|
47 |
|
---|
48 | //------------------------------------------------------------------------------
|
---|
49 |
|
---|
50 | /**
|
---|
51 | * Class that can be used to register waitable objects and then wait
|
---|
52 | * for them.
|
---|
53 | */
|
---|
54 | class Waiter
|
---|
55 | {
|
---|
56 | private:
|
---|
57 | /**
|
---|
58 | * Type for the set of waitables.
|
---|
59 | */
|
---|
60 | typedef std::map<int, Waitable*> waitables_t;
|
---|
61 |
|
---|
62 | /**
|
---|
63 | * The set of waitables belonging to this waiter.
|
---|
64 | */
|
---|
65 | waitables_t waitables;
|
---|
66 |
|
---|
67 | /**
|
---|
68 | * The number of waitables.
|
---|
69 | */
|
---|
70 | size_t numWaitables;
|
---|
71 |
|
---|
72 | public:
|
---|
73 | /**
|
---|
74 | * Construct the waiter.
|
---|
75 | */
|
---|
76 | Waiter();
|
---|
77 |
|
---|
78 | /**
|
---|
79 | * Destroy the waiter. All waitables that still exists will be
|
---|
80 | * modified to point to no waiter.
|
---|
81 | */
|
---|
82 | ~Waiter();
|
---|
83 |
|
---|
84 | /**
|
---|
85 | * Wait for any if the waitables to become ready or until a
|
---|
86 | * timeout expires.
|
---|
87 | *
|
---|
88 | * If any of the waitables are ready, the function returns immediately.
|
---|
89 | *
|
---|
90 | * @return true if any of the waitables has become ready, false if
|
---|
91 | * the timeout occurs.
|
---|
92 | */
|
---|
93 | bool wait(int timeout = -1);
|
---|
94 |
|
---|
95 | protected:
|
---|
96 | /**
|
---|
97 | * Add a waitable.
|
---|
98 | */
|
---|
99 | void add(Waitable* waitable);
|
---|
100 |
|
---|
101 | /**
|
---|
102 | * Remove a waitable.
|
---|
103 | */
|
---|
104 | void remove(Waitable* waitable);
|
---|
105 |
|
---|
106 | private:
|
---|
107 | /**
|
---|
108 | * Determine if any of the waitables is ready.
|
---|
109 | */
|
---|
110 | bool hasReady() const;
|
---|
111 |
|
---|
112 | /**
|
---|
113 | * Fill the given array of poll descriptors with those file
|
---|
114 | * descriptors that wait for an event.
|
---|
115 | *
|
---|
116 | * @param pollFDs the file descriptor array to fill. It should
|
---|
117 | * contain at least as many elements as the number of waitables.
|
---|
118 | *
|
---|
119 | * @return the number of valid poll file descriptors.
|
---|
120 | */
|
---|
121 | size_t setupPollFDs(pollfd* pollFDs);
|
---|
122 |
|
---|
123 | /**
|
---|
124 | * Process the given array of poll descriptors. For each
|
---|
125 | * descriptor, if its events are not 0, the handleEvents()
|
---|
126 | * function of the corresponding waitable is called.
|
---|
127 | */
|
---|
128 | void processPollFDs(const pollfd* pollFDs, size_t size);
|
---|
129 |
|
---|
130 | friend class Waitable;
|
---|
131 | };
|
---|
132 |
|
---|
133 | //------------------------------------------------------------------------------
|
---|
134 | // Inline definitions
|
---|
135 | //------------------------------------------------------------------------------
|
---|
136 |
|
---|
137 | inline Waiter::Waiter() :
|
---|
138 | numWaitables(0)
|
---|
139 | {
|
---|
140 | }
|
---|
141 |
|
---|
142 | //------------------------------------------------------------------------------
|
---|
143 |
|
---|
144 | } /* namespace xplcommon::posix */ } /* namespace xplcommon */
|
---|
145 |
|
---|
146 | //------------------------------------------------------------------------------
|
---|
147 | #endif // XPLCOMMON_POSIX_WAITABLE_H
|
---|
148 |
|
---|
149 | // Local Variables:
|
---|
150 | // mode: C++
|
---|
151 | // c-basic-offset: 4
|
---|
152 | // indent-tabs-mode: nil
|
---|
153 | // End:
|
---|