blob: 6ace5bc98e531f621779dbe096ededbff83c65e2 [file] [log] [blame]
Mathias Agopian81e2a522009-09-07 16:32:45 -07001/*
2 * Copyright (C) 2007 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Mathias Agopian3cf61352010-02-09 17:46:37 -080017#ifndef ANDROID_SF_SHARED_BUFFER_STACK_H
18#define ANDROID_SF_SHARED_BUFFER_STACK_H
Mathias Agopian81e2a522009-09-07 16:32:45 -070019
20#include <stdint.h>
21#include <sys/types.h>
22
23#include <cutils/compiler.h>
24
25#include <utils/Debug.h>
26#include <utils/threads.h>
27#include <utils/String8.h>
28
29#include <ui/Rect.h>
30
31namespace android {
32// ---------------------------------------------------------------------------
33
34/*
35 * These classes manage a stack of buffers in shared memory.
36 *
37 * SharedClient: represents a client with several stacks
38 * SharedBufferStack: represents a stack of buffers
39 * SharedBufferClient: manipulates the SharedBufferStack from the client side
40 * SharedBufferServer: manipulates the SharedBufferStack from the server side
41 *
42 * Buffers can be dequeued until there are none available, they can be locked
43 * unless they are in use by the server, which is only the case for the last
44 * dequeue-able buffer. When these various conditions are not met, the caller
45 * waits until the condition is met.
46 *
47 *
48 * CAVEATS:
49 *
50 * In the current implementation there are several limitations:
51 * - buffers must be locked in the same order they've been dequeued
52 * - buffers must be enqueued in the same order they've been locked
53 * - dequeue() is not reentrant
54 * - no error checks are done on the condition above
55 *
56 */
57
58// When changing these values, the COMPILE_TIME_ASSERT at the end of this
59// file need to be updated.
60const unsigned int NUM_LAYERS_MAX = 31;
Mathias Agopiancdaaf322010-04-05 16:21:53 -070061const unsigned int NUM_BUFFER_MAX = 16;
Mathias Agopian81e2a522009-09-07 16:32:45 -070062const unsigned int NUM_DISPLAY_MAX = 4;
63
64// ----------------------------------------------------------------------------
65
66class Region;
67class SharedBufferStack;
68class SharedClient;
69
70// ----------------------------------------------------------------------------
71
Mathias Agopiancdaaf322010-04-05 16:21:53 -070072// 4 * (11 + 7 + (1 + 2*NUM_RECT_MAX) * NUM_BUFFER_MAX) * NUM_LAYERS_MAX
Mathias Agopiane9e4d542010-04-15 18:48:26 -070073// 4 * (11 + 7 + (1 + 2*7)*16) * 31
74// 1032 * 31
75// = ~27 KiB (31992)
Mathias Agopiancdaaf322010-04-05 16:21:53 -070076
Mathias Agopian81e2a522009-09-07 16:32:45 -070077class SharedBufferStack
78{
79 friend class SharedClient;
80 friend class SharedBufferBase;
81 friend class SharedBufferClient;
82 friend class SharedBufferServer;
83
84public:
Mathias Agopian9e3ebf82009-09-17 01:35:28 -070085 struct Statistics { // 4 longs
86 typedef int32_t usecs_t;
87 usecs_t totalTime;
88 usecs_t reserved[3];
89 };
Mathias Agopiane9e4d542010-04-15 18:48:26 -070090
91 struct SmallRect {
92 uint16_t l, t, r, b;
93 };
94
95 struct FlatRegion { // 52 bytes = 4 * (1 + 2*N)
96 static const unsigned int NUM_RECT_MAX = 6;
97 uint32_t count;
98 SmallRect rects[NUM_RECT_MAX];
99 };
100
101 struct BufferData {
102 FlatRegion dirtyRegion;
103 SmallRect crop;
104 };
Mathias Agopian9e3ebf82009-09-17 01:35:28 -0700105
Mathias Agopian81e2a522009-09-07 16:32:45 -0700106 SharedBufferStack();
Mathias Agopian4fc61bf2009-09-10 19:41:18 -0700107 void init(int32_t identity);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700108 status_t setDirtyRegion(int buffer, const Region& reg);
Mathias Agopiane9e4d542010-04-15 18:48:26 -0700109 status_t setCrop(int buffer, const Rect& reg);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700110 Region getDirtyRegion(int buffer) const;
111
112 // these attributes are part of the conditions/updates
113 volatile int32_t head; // server's current front buffer
114 volatile int32_t available; // number of dequeue-able buffers
115 volatile int32_t queued; // number of buffers waiting for post
116 volatile int32_t inUse; // buffer currently in use by SF
Mathias Agopian3dbf98c2009-09-10 16:55:13 -0700117 volatile status_t status; // surface's status code
Mathias Agopian81e2a522009-09-07 16:32:45 -0700118
119 // not part of the conditions
120 volatile int32_t reallocMask;
121
122 int32_t identity; // surface's identity (const)
Mathias Agopiancdaaf322010-04-05 16:21:53 -0700123 int32_t reserved32[6];
Mathias Agopian9e3ebf82009-09-17 01:35:28 -0700124 Statistics stats;
Mathias Agopiancdaaf322010-04-05 16:21:53 -0700125 int32_t reserved;
Mathias Agopiane9e4d542010-04-15 18:48:26 -0700126 BufferData buffers[NUM_BUFFER_MAX]; // 960 bytes
Mathias Agopian81e2a522009-09-07 16:32:45 -0700127};
128
129// ----------------------------------------------------------------------------
130
131// 4 KB max
132class SharedClient
133{
134public:
135 SharedClient();
136 ~SharedClient();
137
138 status_t validate(size_t token) const;
139 uint32_t getIdentity(size_t token) const;
Mathias Agopian81e2a522009-09-07 16:32:45 -0700140
141private:
142 friend class SharedBufferBase;
143 friend class SharedBufferClient;
144 friend class SharedBufferServer;
145
146 // FIXME: this should be replaced by a lock-less primitive
147 Mutex lock;
148 Condition cv;
149 SharedBufferStack surfaces[ NUM_LAYERS_MAX ];
150};
151
152// ============================================================================
153
154class SharedBufferBase
155{
156public:
Mathias Agopiand46758b2009-10-06 19:00:57 -0700157 SharedBufferBase(SharedClient* sharedClient, int surface, int num,
158 int32_t identity);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700159 ~SharedBufferBase();
160 uint32_t getIdentity();
Mathias Agopiandefd1bd2009-10-02 18:12:30 -0700161 status_t getStatus() const;
Mathias Agopian81e2a522009-09-07 16:32:45 -0700162 size_t getFrontBuffer() const;
163 String8 dump(char const* prefix) const;
164
165protected:
166 SharedClient* const mSharedClient;
167 SharedBufferStack* const mSharedStack;
168 const int mNumBuffers;
Mathias Agopiand46758b2009-10-06 19:00:57 -0700169 const int mIdentity;
Mathias Agopian81e2a522009-09-07 16:32:45 -0700170
171 friend struct Update;
172 friend struct QueueUpdate;
173
174 struct ConditionBase {
175 SharedBufferStack& stack;
176 inline ConditionBase(SharedBufferBase* sbc)
177 : stack(*sbc->mSharedStack) { }
178 };
179
180 struct UpdateBase {
181 SharedBufferStack& stack;
182 inline UpdateBase(SharedBufferBase* sbb)
183 : stack(*sbb->mSharedStack) { }
184 };
185
186 template <typename T>
187 status_t waitForCondition(T condition);
188
189 template <typename T>
190 status_t updateCondition(T update);
191};
192
193template <typename T>
194status_t SharedBufferBase::waitForCondition(T condition)
195{
Mathias Agopian3dbf98c2009-09-10 16:55:13 -0700196 const SharedBufferStack& stack( *mSharedStack );
Mathias Agopian81e2a522009-09-07 16:32:45 -0700197 SharedClient& client( *mSharedClient );
Mathias Agopiandefd1bd2009-10-02 18:12:30 -0700198 const nsecs_t TIMEOUT = s2ns(1);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700199 Mutex::Autolock _l(client.lock);
Mathias Agopiand46758b2009-10-06 19:00:57 -0700200 while ((condition()==false) &&
201 (stack.identity == mIdentity) &&
202 (stack.status == NO_ERROR))
203 {
Mathias Agopian81e2a522009-09-07 16:32:45 -0700204 status_t err = client.cv.waitRelative(client.lock, TIMEOUT);
205
206 // handle errors and timeouts
207 if (CC_UNLIKELY(err != NO_ERROR)) {
208 if (err == TIMED_OUT) {
209 if (condition()) {
210 LOGE("waitForCondition(%s) timed out (identity=%d), "
Mathias Agopiandefd1bd2009-10-02 18:12:30 -0700211 "but condition is true! We recovered but it "
212 "shouldn't happen." , T::name(),
Mathias Agopiand46758b2009-10-06 19:00:57 -0700213 stack.identity);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700214 break;
215 } else {
Mathias Agopiandefd1bd2009-10-02 18:12:30 -0700216 LOGW("waitForCondition(%s) timed out "
217 "(identity=%d, status=%d). "
218 "CPU may be pegged. trying again.", T::name(),
Mathias Agopiand46758b2009-10-06 19:00:57 -0700219 stack.identity, stack.status);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700220 }
221 } else {
222 LOGE("waitForCondition(%s) error (%s) ",
223 T::name(), strerror(-err));
224 return err;
225 }
226 }
227 }
Mathias Agopiand46758b2009-10-06 19:00:57 -0700228 return (stack.identity != mIdentity) ? status_t(BAD_INDEX) : stack.status;
Mathias Agopian81e2a522009-09-07 16:32:45 -0700229}
230
231
232template <typename T>
233status_t SharedBufferBase::updateCondition(T update) {
234 SharedClient& client( *mSharedClient );
235 Mutex::Autolock _l(client.lock);
236 ssize_t result = update();
237 client.cv.broadcast();
238 return result;
239}
240
241// ----------------------------------------------------------------------------
242
243class SharedBufferClient : public SharedBufferBase
244{
245public:
Mathias Agopiand46758b2009-10-06 19:00:57 -0700246 SharedBufferClient(SharedClient* sharedClient, int surface, int num,
247 int32_t identity);
248
Mathias Agopian81e2a522009-09-07 16:32:45 -0700249 ssize_t dequeue();
250 status_t undoDequeue(int buf);
251
252 status_t lock(int buf);
253 status_t queue(int buf);
254 bool needNewBuffer(int buffer) const;
255 status_t setDirtyRegion(int buffer, const Region& reg);
Mathias Agopiane9e4d542010-04-15 18:48:26 -0700256 status_t setCrop(int buffer, const Rect& reg);
Mathias Agopian9e3ebf82009-09-17 01:35:28 -0700257
Mathias Agopian81e2a522009-09-07 16:32:45 -0700258private:
259 friend struct Condition;
260 friend struct DequeueCondition;
261 friend struct LockCondition;
Mathias Agopian5a37cc52009-09-14 15:48:42 -0700262
263 int32_t computeTail() const;
Mathias Agopian81e2a522009-09-07 16:32:45 -0700264
265 struct QueueUpdate : public UpdateBase {
266 inline QueueUpdate(SharedBufferBase* sbb);
267 inline ssize_t operator()();
268 };
269
270 struct UndoDequeueUpdate : public UpdateBase {
271 inline UndoDequeueUpdate(SharedBufferBase* sbb);
272 inline ssize_t operator()();
273 };
274
275 // --
276
277 struct DequeueCondition : public ConditionBase {
278 inline DequeueCondition(SharedBufferClient* sbc);
279 inline bool operator()();
280 static inline const char* name() { return "DequeueCondition"; }
281 };
282
283 struct LockCondition : public ConditionBase {
284 int buf;
285 inline LockCondition(SharedBufferClient* sbc, int buf);
286 inline bool operator()();
287 static inline const char* name() { return "LockCondition"; }
288 };
289
290 int32_t tail;
Mathias Agopian9e3ebf82009-09-17 01:35:28 -0700291 // statistics...
292 nsecs_t mDequeueTime[NUM_BUFFER_MAX];
Mathias Agopian81e2a522009-09-07 16:32:45 -0700293};
294
295// ----------------------------------------------------------------------------
296
297class SharedBufferServer : public SharedBufferBase
298{
299public:
Mathias Agopian4fc61bf2009-09-10 19:41:18 -0700300 SharedBufferServer(SharedClient* sharedClient, int surface, int num,
301 int32_t identity);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700302
303 ssize_t retireAndLock();
304 status_t unlock(int buffer);
Mathias Agopian3dbf98c2009-09-10 16:55:13 -0700305 void setStatus(status_t status);
Mathias Agopian81e2a522009-09-07 16:32:45 -0700306 status_t reallocate();
307 status_t assertReallocate(int buffer);
Mathias Agopian68174b12009-10-07 16:44:10 -0700308 int32_t getQueuedCount() const;
Mathias Agopian3dbf98c2009-09-10 16:55:13 -0700309
Mathias Agopian81e2a522009-09-07 16:32:45 -0700310 Region getDirtyRegion(int buffer) const;
311
Mathias Agopian9e3ebf82009-09-17 01:35:28 -0700312 SharedBufferStack::Statistics getStats() const;
313
314
Mathias Agopian81e2a522009-09-07 16:32:45 -0700315private:
316 struct UnlockUpdate : public UpdateBase {
317 const int lockedBuffer;
318 inline UnlockUpdate(SharedBufferBase* sbb, int lockedBuffer);
319 inline ssize_t operator()();
320 };
321
322 struct RetireUpdate : public UpdateBase {
323 const int numBuffers;
324 inline RetireUpdate(SharedBufferBase* sbb, int numBuffers);
325 inline ssize_t operator()();
326 };
327
Mathias Agopian3dbf98c2009-09-10 16:55:13 -0700328 struct StatusUpdate : public UpdateBase {
329 const status_t status;
330 inline StatusUpdate(SharedBufferBase* sbb, status_t status);
331 inline ssize_t operator()();
332 };
333
Mathias Agopian81e2a522009-09-07 16:32:45 -0700334 struct ReallocateCondition : public ConditionBase {
335 int buf;
336 inline ReallocateCondition(SharedBufferBase* sbb, int buf);
337 inline bool operator()();
338 static inline const char* name() { return "ReallocateCondition"; }
339 };
340};
341
342// ===========================================================================
343
344struct display_cblk_t
345{
346 uint16_t w;
347 uint16_t h;
348 uint8_t format;
349 uint8_t orientation;
350 uint8_t reserved[2];
351 float fps;
352 float density;
353 float xdpi;
354 float ydpi;
355 uint32_t pad[2];
356};
357
358struct surface_flinger_cblk_t // 4KB max
359{
360 uint8_t connected;
361 uint8_t reserved[3];
362 uint32_t pad[7];
363 display_cblk_t displays[NUM_DISPLAY_MAX];
364};
365
366// ---------------------------------------------------------------------------
367
Mathias Agopiancdaaf322010-04-05 16:21:53 -0700368COMPILE_TIME_ASSERT(sizeof(SharedClient) <= 32768)
Mathias Agopian81e2a522009-09-07 16:32:45 -0700369COMPILE_TIME_ASSERT(sizeof(surface_flinger_cblk_t) <= 4096)
370
371// ---------------------------------------------------------------------------
372}; // namespace android
373
Mathias Agopian3cf61352010-02-09 17:46:37 -0800374#endif /* ANDROID_SF_SHARED_BUFFER_STACK_H */