2012-08-31 22:32:45 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2012 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define LOG_TAG "BufferQueue_test"
|
|
|
|
//#define LOG_NDEBUG 0
|
|
|
|
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
|
|
|
|
#include <utils/String8.h>
|
|
|
|
#include <utils/threads.h>
|
|
|
|
|
|
|
|
#include <ui/GraphicBuffer.h>
|
|
|
|
#include <ui/FramebufferNativeWindow.h>
|
|
|
|
|
|
|
|
#include <gui/BufferQueue.h>
|
|
|
|
|
|
|
|
namespace android {
|
|
|
|
|
|
|
|
class BufferQueueTest : public ::testing::Test {
|
|
|
|
protected:
|
|
|
|
|
|
|
|
BufferQueueTest() {}
|
|
|
|
|
|
|
|
virtual void SetUp() {
|
|
|
|
const ::testing::TestInfo* const testInfo =
|
|
|
|
::testing::UnitTest::GetInstance()->current_test_info();
|
|
|
|
ALOGV("Begin test: %s.%s", testInfo->test_case_name(),
|
|
|
|
testInfo->name());
|
|
|
|
|
|
|
|
mBQ = new BufferQueue();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void TearDown() {
|
|
|
|
mBQ.clear();
|
|
|
|
|
|
|
|
const ::testing::TestInfo* const testInfo =
|
|
|
|
::testing::UnitTest::GetInstance()->current_test_info();
|
|
|
|
ALOGV("End test: %s.%s", testInfo->test_case_name(),
|
|
|
|
testInfo->name());
|
|
|
|
}
|
|
|
|
|
2013-11-19 00:58:36 +00:00
|
|
|
void GetMinUndequeuedBufferCount(int* bufferCount) {
|
|
|
|
ASSERT_NE((void*)NULL, bufferCount);
|
|
|
|
ASSERT_EQ(OK, mBQ->query(NATIVE_WINDOW_MIN_UNDEQUEUED_BUFFERS, bufferCount));
|
|
|
|
ASSERT_LE(0, *bufferCount); // non-negative
|
|
|
|
}
|
|
|
|
|
2012-08-31 22:32:45 +00:00
|
|
|
sp<BufferQueue> mBQ;
|
|
|
|
};
|
|
|
|
|
2013-08-01 03:09:53 +00:00
|
|
|
struct DummyConsumer : public BnConsumerListener {
|
2012-08-31 22:32:45 +00:00
|
|
|
virtual void onFrameAvailable() {}
|
|
|
|
virtual void onBuffersReleased() {}
|
|
|
|
};
|
|
|
|
|
|
|
|
TEST_F(BufferQueueTest, AcquireBuffer_ExceedsMaxAcquireCount_Fails) {
|
|
|
|
sp<DummyConsumer> dc(new DummyConsumer);
|
2013-07-17 05:56:09 +00:00
|
|
|
mBQ->consumerConnect(dc, false);
|
2012-12-18 17:49:45 +00:00
|
|
|
IGraphicBufferProducer::QueueBufferOutput qbo;
|
2013-09-17 22:55:18 +00:00
|
|
|
mBQ->connect(NULL, NATIVE_WINDOW_API_CPU, false, &qbo);
|
2012-08-31 22:32:45 +00:00
|
|
|
mBQ->setBufferCount(4);
|
|
|
|
|
|
|
|
int slot;
|
|
|
|
sp<Fence> fence;
|
|
|
|
sp<GraphicBuffer> buf;
|
2013-08-19 15:56:07 +00:00
|
|
|
IGraphicBufferProducer::QueueBufferInput qbi(0, false, Rect(0, 0, 1, 1),
|
2013-07-19 05:10:56 +00:00
|
|
|
NATIVE_WINDOW_SCALING_MODE_FREEZE, 0, false, Fence::NO_FENCE);
|
2012-08-31 22:32:45 +00:00
|
|
|
BufferQueue::BufferItem item;
|
|
|
|
|
|
|
|
for (int i = 0; i < 2; i++) {
|
2012-12-18 17:49:45 +00:00
|
|
|
ASSERT_EQ(IGraphicBufferProducer::BUFFER_NEEDS_REALLOCATION,
|
2013-07-19 05:10:56 +00:00
|
|
|
mBQ->dequeueBuffer(&slot, &fence, false, 1, 1, 0,
|
2012-08-31 22:32:45 +00:00
|
|
|
GRALLOC_USAGE_SW_READ_OFTEN));
|
|
|
|
ASSERT_EQ(OK, mBQ->requestBuffer(slot, &buf));
|
|
|
|
ASSERT_EQ(OK, mBQ->queueBuffer(slot, qbi, &qbo));
|
2013-06-28 20:52:40 +00:00
|
|
|
ASSERT_EQ(OK, mBQ->acquireBuffer(&item, 0));
|
2012-08-31 22:32:45 +00:00
|
|
|
}
|
|
|
|
|
2012-12-18 17:49:45 +00:00
|
|
|
ASSERT_EQ(IGraphicBufferProducer::BUFFER_NEEDS_REALLOCATION,
|
2013-07-19 05:10:56 +00:00
|
|
|
mBQ->dequeueBuffer(&slot, &fence, false, 1, 1, 0,
|
2012-08-31 22:32:45 +00:00
|
|
|
GRALLOC_USAGE_SW_READ_OFTEN));
|
|
|
|
ASSERT_EQ(OK, mBQ->requestBuffer(slot, &buf));
|
|
|
|
ASSERT_EQ(OK, mBQ->queueBuffer(slot, qbi, &qbo));
|
|
|
|
|
|
|
|
// Acquire the third buffer, which should fail.
|
2013-06-28 20:52:40 +00:00
|
|
|
ASSERT_EQ(INVALID_OPERATION, mBQ->acquireBuffer(&item, 0));
|
2012-08-31 22:32:45 +00:00
|
|
|
}
|
|
|
|
|
2012-08-31 01:36:22 +00:00
|
|
|
TEST_F(BufferQueueTest, SetMaxAcquiredBufferCountWithIllegalValues_ReturnsError) {
|
|
|
|
sp<DummyConsumer> dc(new DummyConsumer);
|
2013-07-17 05:56:09 +00:00
|
|
|
mBQ->consumerConnect(dc, false);
|
2012-08-31 01:36:22 +00:00
|
|
|
|
2013-11-19 00:58:36 +00:00
|
|
|
int minBufferCount;
|
|
|
|
ASSERT_NO_FATAL_FAILURE(GetMinUndequeuedBufferCount(&minBufferCount));
|
|
|
|
EXPECT_EQ(BAD_VALUE, mBQ->setMaxAcquiredBufferCount(minBufferCount - 1));
|
|
|
|
|
|
|
|
EXPECT_EQ(BAD_VALUE, mBQ->setMaxAcquiredBufferCount(0));
|
|
|
|
EXPECT_EQ(BAD_VALUE, mBQ->setMaxAcquiredBufferCount(-3));
|
|
|
|
EXPECT_EQ(BAD_VALUE, mBQ->setMaxAcquiredBufferCount(
|
2012-08-31 01:36:22 +00:00
|
|
|
BufferQueue::MAX_MAX_ACQUIRED_BUFFERS+1));
|
2013-11-19 00:58:36 +00:00
|
|
|
EXPECT_EQ(BAD_VALUE, mBQ->setMaxAcquiredBufferCount(100));
|
2012-08-31 01:36:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(BufferQueueTest, SetMaxAcquiredBufferCountWithLegalValues_Succeeds) {
|
|
|
|
sp<DummyConsumer> dc(new DummyConsumer);
|
2013-07-17 05:56:09 +00:00
|
|
|
mBQ->consumerConnect(dc, false);
|
2012-08-31 01:36:22 +00:00
|
|
|
|
2013-11-19 00:58:36 +00:00
|
|
|
int minBufferCount;
|
|
|
|
ASSERT_NO_FATAL_FAILURE(GetMinUndequeuedBufferCount(&minBufferCount));
|
|
|
|
|
|
|
|
EXPECT_EQ(OK, mBQ->setMaxAcquiredBufferCount(1));
|
|
|
|
EXPECT_EQ(OK, mBQ->setMaxAcquiredBufferCount(2));
|
|
|
|
EXPECT_EQ(OK, mBQ->setMaxAcquiredBufferCount(minBufferCount));
|
|
|
|
EXPECT_EQ(OK, mBQ->setMaxAcquiredBufferCount(
|
2012-08-31 01:36:22 +00:00
|
|
|
BufferQueue::MAX_MAX_ACQUIRED_BUFFERS));
|
|
|
|
}
|
|
|
|
|
2012-08-31 22:32:45 +00:00
|
|
|
} // namespace android
|