2009-03-04 03:31:44 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2007 The Android Open Source Project
|
|
|
|
*
|
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
|
|
|
*
|
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef ANDROID_UI_SURFACE_H
|
|
|
|
#define ANDROID_UI_SURFACE_H
|
|
|
|
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
|
|
|
#include <utils/RefBase.h>
|
|
|
|
#include <utils/threads.h>
|
|
|
|
|
|
|
|
#include <ui/ISurface.h>
|
|
|
|
#include <ui/PixelFormat.h>
|
|
|
|
#include <ui/Region.h>
|
|
|
|
#include <ui/ISurfaceFlingerClient.h>
|
|
|
|
|
2009-05-06 01:11:11 +00:00
|
|
|
#include <ui/egl/android_natives.h>
|
2009-04-10 21:24:30 +00:00
|
|
|
|
2009-03-04 03:31:44 +00:00
|
|
|
namespace android {
|
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
|
2009-05-04 21:17:04 +00:00
|
|
|
class BufferMapper;
|
2009-08-07 19:01:29 +00:00
|
|
|
class IOMX;
|
2009-03-04 03:31:44 +00:00
|
|
|
class Rect;
|
2009-05-04 21:17:04 +00:00
|
|
|
class Surface;
|
2009-03-04 03:31:44 +00:00
|
|
|
class SurfaceComposerClient;
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
class SharedClient;
|
|
|
|
class SharedBufferClient;
|
2009-04-10 21:24:30 +00:00
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
2009-03-04 03:31:44 +00:00
|
|
|
|
2009-04-16 23:19:50 +00:00
|
|
|
class SurfaceControl : public RefBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
static bool isValid(const sp<SurfaceControl>& surface) {
|
2009-04-17 03:04:08 +00:00
|
|
|
return (surface != 0) && surface->isValid();
|
2009-04-16 23:19:50 +00:00
|
|
|
}
|
2009-04-17 03:04:08 +00:00
|
|
|
bool isValid() {
|
|
|
|
return mToken>=0 && mClient!=0;
|
|
|
|
}
|
|
|
|
static bool isSameSurface(
|
|
|
|
const sp<SurfaceControl>& lhs, const sp<SurfaceControl>& rhs);
|
2009-04-16 23:19:50 +00:00
|
|
|
|
|
|
|
SurfaceID ID() const { return mToken; }
|
|
|
|
uint32_t getFlags() const { return mFlags; }
|
|
|
|
uint32_t getIdentity() const { return mIdentity; }
|
|
|
|
|
|
|
|
// release surface data from java
|
|
|
|
void clear();
|
|
|
|
|
|
|
|
status_t setLayer(int32_t layer);
|
|
|
|
status_t setPosition(int32_t x, int32_t y);
|
|
|
|
status_t setSize(uint32_t w, uint32_t h);
|
|
|
|
status_t hide();
|
|
|
|
status_t show(int32_t layer = -1);
|
|
|
|
status_t freeze();
|
|
|
|
status_t unfreeze();
|
|
|
|
status_t setFlags(uint32_t flags, uint32_t mask);
|
|
|
|
status_t setTransparentRegionHint(const Region& transparent);
|
|
|
|
status_t setAlpha(float alpha=1.0f);
|
|
|
|
status_t setMatrix(float dsdx, float dtdx, float dsdy, float dtdy);
|
|
|
|
status_t setFreezeTint(uint32_t tint);
|
|
|
|
|
2009-04-17 03:04:08 +00:00
|
|
|
static status_t writeSurfaceToParcel(
|
|
|
|
const sp<SurfaceControl>& control, Parcel* parcel);
|
|
|
|
|
|
|
|
sp<Surface> getSurface() const;
|
|
|
|
|
2009-04-16 23:19:50 +00:00
|
|
|
private:
|
2009-04-17 03:04:08 +00:00
|
|
|
// can't be copied
|
|
|
|
SurfaceControl& operator = (SurfaceControl& rhs);
|
|
|
|
SurfaceControl(const SurfaceControl& rhs);
|
|
|
|
|
|
|
|
|
2009-04-16 23:19:50 +00:00
|
|
|
friend class SurfaceComposerClient;
|
|
|
|
|
|
|
|
// camera and camcorder need access to the ISurface binder interface for preview
|
|
|
|
friend class Camera;
|
|
|
|
friend class MediaRecorder;
|
|
|
|
// mediaplayer needs access to ISurface for display
|
|
|
|
friend class MediaPlayer;
|
2009-04-17 03:04:08 +00:00
|
|
|
// for testing
|
2009-04-16 23:19:50 +00:00
|
|
|
friend class Test;
|
|
|
|
const sp<ISurface>& getISurface() const { return mSurface; }
|
|
|
|
|
|
|
|
|
|
|
|
friend class Surface;
|
2009-04-17 03:04:08 +00:00
|
|
|
|
|
|
|
SurfaceControl(
|
|
|
|
const sp<SurfaceComposerClient>& client,
|
2009-04-16 23:19:50 +00:00
|
|
|
const sp<ISurface>& surface,
|
|
|
|
const ISurfaceFlingerClient::surface_data_t& data,
|
2009-04-17 03:30:22 +00:00
|
|
|
uint32_t w, uint32_t h, PixelFormat format, uint32_t flags);
|
2009-04-16 23:19:50 +00:00
|
|
|
|
|
|
|
~SurfaceControl();
|
2009-04-17 03:04:08 +00:00
|
|
|
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
status_t validate(SharedClient const* cblk) const;
|
2009-04-16 23:19:50 +00:00
|
|
|
void destroy();
|
|
|
|
|
|
|
|
sp<SurfaceComposerClient> mClient;
|
|
|
|
sp<ISurface> mSurface;
|
|
|
|
SurfaceID mToken;
|
|
|
|
uint32_t mIdentity;
|
2009-07-31 01:14:56 +00:00
|
|
|
uint32_t mWidth;
|
|
|
|
uint32_t mHeight;
|
2009-04-16 23:19:50 +00:00
|
|
|
PixelFormat mFormat;
|
|
|
|
uint32_t mFlags;
|
|
|
|
mutable Mutex mLock;
|
2009-04-17 03:04:08 +00:00
|
|
|
|
|
|
|
mutable sp<Surface> mSurfaceData;
|
2009-04-16 23:19:50 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
class Surface
|
|
|
|
: public EGLNativeBase<android_native_window_t, Surface, RefBase>
|
|
|
|
{
|
2009-03-04 03:31:44 +00:00
|
|
|
public:
|
|
|
|
struct SurfaceInfo {
|
|
|
|
uint32_t w;
|
|
|
|
uint32_t h;
|
2009-04-10 21:24:30 +00:00
|
|
|
uint32_t s;
|
|
|
|
uint32_t usage;
|
2009-03-04 03:31:44 +00:00
|
|
|
PixelFormat format;
|
|
|
|
void* bits;
|
|
|
|
uint32_t reserved[2];
|
|
|
|
};
|
|
|
|
|
2009-04-17 03:04:08 +00:00
|
|
|
Surface(const Parcel& data);
|
|
|
|
|
2009-04-15 01:21:47 +00:00
|
|
|
static bool isValid(const sp<Surface>& surface) {
|
2009-04-17 03:04:08 +00:00
|
|
|
return (surface != 0) && surface->isValid();
|
2009-04-15 01:21:47 +00:00
|
|
|
}
|
2009-08-15 01:52:17 +00:00
|
|
|
|
2009-04-17 03:04:08 +00:00
|
|
|
static bool isSameSurface(
|
|
|
|
const sp<Surface>& lhs, const sp<Surface>& rhs);
|
2009-03-04 03:31:44 +00:00
|
|
|
|
2009-08-15 01:52:17 +00:00
|
|
|
bool isValid();
|
|
|
|
SurfaceID ID() const { return mToken; }
|
|
|
|
uint32_t getFlags() const { return mFlags; }
|
|
|
|
uint32_t getIdentity() const { return mIdentity; }
|
2009-04-15 01:21:47 +00:00
|
|
|
|
2009-08-15 01:52:17 +00:00
|
|
|
// the lock/unlock APIs must be used from the same thread
|
2009-03-04 03:31:44 +00:00
|
|
|
status_t lock(SurfaceInfo* info, bool blocking = true);
|
|
|
|
status_t lock(SurfaceInfo* info, Region* dirty, bool blocking = true);
|
|
|
|
status_t unlockAndPost();
|
|
|
|
|
2009-05-04 21:17:04 +00:00
|
|
|
// setSwapRectangle() is intended to be used by GL ES clients
|
2009-03-04 03:31:44 +00:00
|
|
|
void setSwapRectangle(const Rect& r);
|
|
|
|
|
|
|
|
private:
|
2009-04-17 03:04:08 +00:00
|
|
|
// can't be copied
|
|
|
|
Surface& operator = (Surface& rhs);
|
|
|
|
Surface(const Surface& rhs);
|
|
|
|
|
|
|
|
Surface(const sp<SurfaceControl>& control);
|
|
|
|
void init();
|
|
|
|
~Surface();
|
|
|
|
|
2009-03-04 03:31:44 +00:00
|
|
|
friend class SurfaceComposerClient;
|
2009-04-17 03:04:08 +00:00
|
|
|
friend class SurfaceControl;
|
2009-03-04 03:31:44 +00:00
|
|
|
|
2009-08-15 01:52:17 +00:00
|
|
|
|
2009-03-04 03:31:44 +00:00
|
|
|
// camera and camcorder need access to the ISurface binder interface for preview
|
|
|
|
friend class Camera;
|
|
|
|
friend class MediaRecorder;
|
|
|
|
// mediaplayer needs access to ISurface for display
|
|
|
|
friend class MediaPlayer;
|
2009-08-07 19:01:29 +00:00
|
|
|
friend class IOMX;
|
2009-08-15 01:52:17 +00:00
|
|
|
// this is just to be able to write some unit tests
|
|
|
|
friend class Test;
|
|
|
|
|
|
|
|
sp<SurfaceComposerClient> getClient() const;
|
|
|
|
sp<ISurface> getISurface() const;
|
2009-03-04 03:31:44 +00:00
|
|
|
|
2009-08-12 05:34:02 +00:00
|
|
|
status_t getBufferLocked(int index, int usage);
|
2009-04-10 21:24:30 +00:00
|
|
|
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
status_t validate(SharedClient const* cblk) const;
|
2009-04-10 21:24:30 +00:00
|
|
|
|
2009-05-04 21:17:04 +00:00
|
|
|
inline const BufferMapper& getBufferMapper() const { return mBufferMapper; }
|
|
|
|
inline BufferMapper& getBufferMapper() { return mBufferMapper; }
|
2009-04-10 21:24:30 +00:00
|
|
|
|
|
|
|
static int setSwapInterval(android_native_window_t* window, int interval);
|
|
|
|
static int dequeueBuffer(android_native_window_t* window, android_native_buffer_t** buffer);
|
|
|
|
static int lockBuffer(android_native_window_t* window, android_native_buffer_t* buffer);
|
|
|
|
static int queueBuffer(android_native_window_t* window, android_native_buffer_t* buffer);
|
2009-07-31 01:14:56 +00:00
|
|
|
static int query(android_native_window_t* window, int what, int* value);
|
2009-08-12 05:34:02 +00:00
|
|
|
static int perform(android_native_window_t* window, int operation, ...);
|
2009-04-10 21:24:30 +00:00
|
|
|
|
|
|
|
int dequeueBuffer(android_native_buffer_t** buffer);
|
|
|
|
int lockBuffer(android_native_buffer_t* buffer);
|
|
|
|
int queueBuffer(android_native_buffer_t* buffer);
|
2009-07-31 01:14:56 +00:00
|
|
|
int query(int what, int* value);
|
2009-08-12 05:34:02 +00:00
|
|
|
int perform(int operation, va_list args);
|
2009-05-04 21:17:04 +00:00
|
|
|
|
|
|
|
status_t dequeueBuffer(sp<SurfaceBuffer>* buffer);
|
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
|
2009-08-15 01:52:17 +00:00
|
|
|
void setUsage(uint32_t reqUsage);
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
bool getUsage(uint32_t* usage);
|
2009-08-15 01:52:17 +00:00
|
|
|
|
|
|
|
// constants
|
2009-03-04 03:31:44 +00:00
|
|
|
sp<SurfaceComposerClient> mClient;
|
|
|
|
sp<ISurface> mSurface;
|
|
|
|
SurfaceID mToken;
|
|
|
|
uint32_t mIdentity;
|
|
|
|
PixelFormat mFormat;
|
|
|
|
uint32_t mFlags;
|
2009-08-15 01:52:17 +00:00
|
|
|
BufferMapper& mBufferMapper;
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
SharedBufferClient* mSharedBufferClient;
|
2009-08-15 01:52:17 +00:00
|
|
|
|
|
|
|
// protected by mSurfaceLock
|
|
|
|
Rect mSwapRectangle;
|
|
|
|
uint32_t mUsage;
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
int32_t mUsageChanged;
|
2009-08-15 01:52:17 +00:00
|
|
|
|
|
|
|
// protected by mSurfaceLock. These are also used from lock/unlock
|
|
|
|
// but in that case, they must be called form the same thread.
|
|
|
|
sp<SurfaceBuffer> mBuffers[2];
|
2009-03-04 03:31:44 +00:00
|
|
|
mutable Region mDirtyRegion;
|
2009-08-15 01:52:17 +00:00
|
|
|
|
|
|
|
// must be used from the lock/unlock thread
|
|
|
|
sp<SurfaceBuffer> mLockedBuffer;
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
sp<SurfaceBuffer> mPostedBuffer;
|
2009-08-15 01:52:17 +00:00
|
|
|
mutable Region mOldDirtyRegion;
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
bool mNeedFullUpdate;
|
2009-08-15 01:52:17 +00:00
|
|
|
|
|
|
|
// query() must be called from dequeueBuffer() thread
|
|
|
|
uint32_t mWidth;
|
|
|
|
uint32_t mHeight;
|
|
|
|
|
|
|
|
// Inherently thread-safe
|
2009-03-04 03:31:44 +00:00
|
|
|
mutable Mutex mSurfaceLock;
|
fix [2068105] implement queueBuffer/lockBuffer/dequeueBuffer properly
Rewrote SurfaceFlinger's buffer management from the ground-up.
The design now support an arbitrary number of buffers per surface, however the current implementation is limited to four. Currently only 2 buffers are used in practice.
The main new feature is to be able to dequeue all buffers at once (very important when there are only two).
A client can dequeue all buffers until there are none available, it can lock all buffers except the last one that is used for composition. The client will block then, until a new buffer is enqueued.
The current implementation requires that buffers are locked in the same order they are dequeued and enqueued in the same order they are locked. Only one buffer can be locked at a time.
eg. Allowed sequence: DQ, DQ, LOCK, Q, LOCK, Q
eg. Forbidden sequence: DQ, DQ, LOCK, LOCK, Q, Q
2009-09-07 23:32:45 +00:00
|
|
|
mutable Mutex mApiLock;
|
2009-03-04 03:31:44 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}; // namespace android
|
|
|
|
|
|
|
|
#endif // ANDROID_UI_SURFACE_H
|
|
|
|
|