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_LAYER_BITMAP_H
|
|
|
|
#define ANDROID_LAYER_BITMAP_H
|
|
|
|
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
|
|
|
#include <ui/PixelFormat.h>
|
|
|
|
#include <ui/Rect.h>
|
|
|
|
#include <pixelflinger/pixelflinger.h>
|
2009-05-06 01:11:11 +00:00
|
|
|
#include <private/ui/SurfaceBuffer.h>
|
2009-04-10 21:24:30 +00:00
|
|
|
|
|
|
|
struct android_native_buffer_t;
|
2009-03-04 03:31:44 +00:00
|
|
|
|
|
|
|
namespace android {
|
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
// ===========================================================================
|
|
|
|
// Buffer
|
|
|
|
// ===========================================================================
|
2009-03-04 03:31:44 +00:00
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
class Buffer : public SurfaceBuffer
|
2009-03-04 03:31:44 +00:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
enum {
|
2009-04-10 21:24:30 +00:00
|
|
|
DONT_CLEAR = 0x00000001,
|
|
|
|
SECURE = 0x00000004
|
2009-03-04 03:31:44 +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
|
|
|
Buffer();
|
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
// creates w * h buffer
|
2009-08-12 05:34:02 +00:00
|
|
|
Buffer(uint32_t w, uint32_t h, PixelFormat format,
|
|
|
|
uint32_t reqUsage, uint32_t flags = 0);
|
2009-04-10 21:24:30 +00:00
|
|
|
|
|
|
|
// return status
|
|
|
|
status_t initCheck() const;
|
|
|
|
|
|
|
|
uint32_t getWidth() const { return width; }
|
|
|
|
uint32_t getHeight() const { return height; }
|
|
|
|
uint32_t getStride() const { return stride; }
|
|
|
|
uint32_t getUsage() const { return usage; }
|
|
|
|
PixelFormat getPixelFormat() const { return format; }
|
|
|
|
Rect getBounds() const { return Rect(width, height); }
|
|
|
|
|
2009-05-04 21:17:04 +00:00
|
|
|
status_t lock(GGLSurface* surface, uint32_t usage);
|
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
android_native_buffer_t* getNativeBuffer() const;
|
|
|
|
|
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 reallocate(uint32_t w, uint32_t h, PixelFormat f,
|
|
|
|
uint32_t reqUsage, uint32_t flags);
|
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
private:
|
|
|
|
friend class LightRefBase<Buffer>;
|
|
|
|
Buffer(const Buffer& rhs);
|
2009-04-11 03:34:46 +00:00
|
|
|
virtual ~Buffer();
|
2009-04-10 21:24:30 +00:00
|
|
|
Buffer& operator = (const Buffer& rhs);
|
|
|
|
const Buffer& operator = (const Buffer& rhs) const;
|
|
|
|
|
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 initSize(uint32_t w, uint32_t h, PixelFormat format,
|
|
|
|
uint32_t reqUsage, uint32_t flags);
|
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
|
|
|
ssize_t mInitCheck;
|
|
|
|
uint32_t mVStride;
|
2009-03-04 03:31:44 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}; // namespace android
|
|
|
|
|
|
|
|
#endif // ANDROID_LAYER_BITMAP_H
|