2009-04-10 21:24:30 +00:00
|
|
|
/*
|
|
|
|
**
|
|
|
|
** Copyright 2009, 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.
|
|
|
|
*/
|
|
|
|
|
2010-04-15 21:57:39 +00:00
|
|
|
#define LOG_TAG "GraphicBufferAllocator"
|
2012-03-01 04:43:29 +00:00
|
|
|
#define ATRACE_TAG ATRACE_TAG_GRAPHICS
|
2010-04-15 21:57:39 +00:00
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
#include <cutils/log.h>
|
2009-04-16 01:34:24 +00:00
|
|
|
|
|
|
|
#include <utils/Singleton.h>
|
2009-04-10 21:24:30 +00:00
|
|
|
#include <utils/String8.h>
|
2012-03-01 04:43:29 +00:00
|
|
|
#include <utils/Trace.h>
|
2009-04-10 21:24:30 +00:00
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
#include <ui/GraphicBufferAllocator.h>
|
2009-04-10 21:24:30 +00:00
|
|
|
|
|
|
|
namespace android {
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
ANDROID_SINGLETON_STATIC_INSTANCE( GraphicBufferAllocator )
|
2009-04-16 01:34:24 +00:00
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
Mutex GraphicBufferAllocator::sLock;
|
2009-10-06 01:19:57 +00:00
|
|
|
KeyedVector<buffer_handle_t,
|
|
|
|
GraphicBufferAllocator::alloc_rec_t> GraphicBufferAllocator::sAllocList;
|
2009-04-10 21:24:30 +00:00
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
GraphicBufferAllocator::GraphicBufferAllocator()
|
2009-04-10 21:24:30 +00:00
|
|
|
: mAllocDev(0)
|
|
|
|
{
|
|
|
|
hw_module_t const* module;
|
|
|
|
int err = hw_get_module(GRALLOC_HARDWARE_MODULE_ID, &module);
|
2012-01-06 19:20:56 +00:00
|
|
|
ALOGE_IF(err, "FATAL: can't find the %s module", GRALLOC_HARDWARE_MODULE_ID);
|
2009-04-10 21:24:30 +00:00
|
|
|
if (err == 0) {
|
|
|
|
gralloc_open(module, &mAllocDev);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
GraphicBufferAllocator::~GraphicBufferAllocator()
|
2009-04-10 21:24:30 +00:00
|
|
|
{
|
|
|
|
gralloc_close(mAllocDev);
|
|
|
|
}
|
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
void GraphicBufferAllocator::dump(String8& result) const
|
2009-04-10 21:24:30 +00:00
|
|
|
{
|
|
|
|
Mutex::Autolock _l(sLock);
|
|
|
|
KeyedVector<buffer_handle_t, alloc_rec_t>& list(sAllocList);
|
|
|
|
size_t total = 0;
|
2010-12-02 00:38:01 +00:00
|
|
|
const size_t SIZE = 4096;
|
2009-04-10 21:24:30 +00:00
|
|
|
char buffer[SIZE];
|
|
|
|
snprintf(buffer, SIZE, "Allocated buffers:\n");
|
|
|
|
result.append(buffer);
|
|
|
|
const size_t c = list.size();
|
|
|
|
for (size_t i=0 ; i<c ; i++) {
|
|
|
|
const alloc_rec_t& rec(list.valueAt(i));
|
2011-07-29 23:35:41 +00:00
|
|
|
if (rec.size) {
|
|
|
|
snprintf(buffer, SIZE, "%10p: %7.2f KiB | %4u (%4u) x %4u | %8X | 0x%08x\n",
|
|
|
|
list.keyAt(i), rec.size/1024.0f,
|
|
|
|
rec.w, rec.s, rec.h, rec.format, rec.usage);
|
|
|
|
} else {
|
|
|
|
snprintf(buffer, SIZE, "%10p: unknown | %4u (%4u) x %4u | %8X | 0x%08x\n",
|
|
|
|
list.keyAt(i),
|
|
|
|
rec.w, rec.s, rec.h, rec.format, rec.usage);
|
|
|
|
}
|
2009-04-10 21:24:30 +00:00
|
|
|
result.append(buffer);
|
|
|
|
total += rec.size;
|
|
|
|
}
|
2011-07-29 23:35:41 +00:00
|
|
|
snprintf(buffer, SIZE, "Total allocated (estimate): %.2f KB\n", total/1024.0f);
|
2009-04-10 21:24:30 +00:00
|
|
|
result.append(buffer);
|
2010-12-02 00:38:01 +00:00
|
|
|
if (mAllocDev->common.version >= 1 && mAllocDev->dump) {
|
|
|
|
mAllocDev->dump(mAllocDev, buffer, SIZE);
|
|
|
|
result.append(buffer);
|
|
|
|
}
|
2009-04-10 21:24:30 +00:00
|
|
|
}
|
|
|
|
|
2010-12-04 01:33:09 +00:00
|
|
|
void GraphicBufferAllocator::dumpToSystemLog()
|
|
|
|
{
|
|
|
|
String8 s;
|
|
|
|
GraphicBufferAllocator::getInstance().dump(s);
|
2011-12-20 16:23:08 +00:00
|
|
|
ALOGD("%s", s.string());
|
2010-12-04 01:33:09 +00:00
|
|
|
}
|
|
|
|
|
2009-10-06 00:07:12 +00:00
|
|
|
status_t GraphicBufferAllocator::alloc(uint32_t w, uint32_t h, PixelFormat format,
|
2009-04-10 21:24:30 +00:00
|
|
|
int usage, buffer_handle_t* handle, int32_t* stride)
|
|
|
|
{
|
2012-03-01 04:43:29 +00:00
|
|
|
ATRACE_CALL();
|
2010-04-15 21:57:39 +00:00
|
|
|
// make sure to not allocate a N x 0 or 0 x N buffer, since this is
|
|
|
|
// allowed from an API stand-point allocate a 1x1 buffer instead.
|
|
|
|
if (!w || !h)
|
|
|
|
w = h = 1;
|
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
|
|
|
|
2009-04-10 21:24:30 +00:00
|
|
|
// we have a h/w allocator and h/w buffer is requested
|
2009-10-06 01:19:57 +00:00
|
|
|
status_t err;
|
|
|
|
|
2010-12-09 00:40:01 +00:00
|
|
|
err = mAllocDev->alloc(mAllocDev, w, h, format, usage, handle, stride);
|
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
|
|
|
|
2012-01-05 23:22:43 +00:00
|
|
|
ALOGW_IF(err, "alloc(%u, %u, %d, %08x, ...) failed %d (%s)",
|
2009-04-10 21:24:30 +00:00
|
|
|
w, h, format, usage, err, strerror(-err));
|
|
|
|
|
|
|
|
if (err == NO_ERROR) {
|
|
|
|
Mutex::Autolock _l(sLock);
|
|
|
|
KeyedVector<buffer_handle_t, alloc_rec_t>& list(sAllocList);
|
2011-07-29 23:35:41 +00:00
|
|
|
int bpp = bytesPerPixel(format);
|
|
|
|
if (bpp < 0) {
|
|
|
|
// probably a HAL custom format. in any case, we don't know
|
|
|
|
// what its pixel size is.
|
|
|
|
bpp = 0;
|
|
|
|
}
|
2009-04-10 21:24:30 +00:00
|
|
|
alloc_rec_t rec;
|
|
|
|
rec.w = w;
|
|
|
|
rec.h = h;
|
2010-04-15 21:57:39 +00:00
|
|
|
rec.s = *stride;
|
2009-04-10 21:24:30 +00:00
|
|
|
rec.format = format;
|
|
|
|
rec.usage = usage;
|
2011-07-29 23:35:41 +00:00
|
|
|
rec.size = h * stride[0] * bpp;
|
2009-04-10 21:24:30 +00:00
|
|
|
list.add(*handle, rec);
|
|
|
|
}
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2012-12-07 08:38:36 +00:00
|
|
|
class BufferLiberatorThread : public Thread {
|
|
|
|
public:
|
|
|
|
|
|
|
|
static void queueCaptiveBuffer(buffer_handle_t handle) {
|
|
|
|
static sp<BufferLiberatorThread> thread(new BufferLiberatorThread);
|
|
|
|
static bool running = false;
|
|
|
|
if (!running) {
|
|
|
|
thread->run("BufferLiberator");
|
|
|
|
running = true;
|
|
|
|
}
|
|
|
|
{
|
|
|
|
Mutex::Autolock lock(thread->mMutex);
|
|
|
|
thread->mQueue.push_back(handle);
|
|
|
|
thread->mCondition.signal();
|
|
|
|
}
|
|
|
|
}
|
2010-12-09 00:40:01 +00:00
|
|
|
|
2012-12-07 08:38:36 +00:00
|
|
|
private:
|
2009-10-06 01:19:57 +00:00
|
|
|
|
2012-12-07 08:38:36 +00:00
|
|
|
BufferLiberatorThread() {}
|
|
|
|
|
|
|
|
virtual bool threadLoop() {
|
|
|
|
buffer_handle_t handle;
|
|
|
|
{
|
|
|
|
Mutex::Autolock lock(mMutex);
|
|
|
|
while (mQueue.isEmpty()) {
|
|
|
|
mCondition.wait(mMutex);
|
|
|
|
}
|
|
|
|
handle = mQueue[0];
|
|
|
|
mQueue.removeAt(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
status_t err;
|
|
|
|
GraphicBufferAllocator& gba(GraphicBufferAllocator::get());
|
|
|
|
{ // Scope for tracing
|
|
|
|
ATRACE_NAME("gralloc::free");
|
|
|
|
err = gba.mAllocDev->free(gba.mAllocDev, handle);
|
|
|
|
}
|
|
|
|
ALOGW_IF(err, "free(...) failed %d (%s)", err, strerror(-err));
|
|
|
|
|
|
|
|
if (err == NO_ERROR) {
|
|
|
|
Mutex::Autolock _l(GraphicBufferAllocator::sLock);
|
|
|
|
KeyedVector<buffer_handle_t, GraphicBufferAllocator::alloc_rec_t>&
|
|
|
|
list(GraphicBufferAllocator::sAllocList);
|
|
|
|
list.removeItem(handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2009-04-10 21:24:30 +00:00
|
|
|
}
|
|
|
|
|
2012-12-07 08:38:36 +00:00
|
|
|
Vector<buffer_handle_t> mQueue;
|
|
|
|
Condition mCondition;
|
|
|
|
Mutex mMutex;
|
|
|
|
};
|
|
|
|
|
|
|
|
status_t GraphicBufferAllocator::free(buffer_handle_t handle)
|
|
|
|
{
|
|
|
|
BufferLiberatorThread::queueCaptiveBuffer(handle);
|
|
|
|
return NO_ERROR;
|
2009-04-10 21:24:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
}; // namespace android
|