BufferQueue.cpp revision f0cf5f103cf9c54d59de4ed6f1d8ddd2302dec1b
1/* 2 * Copyright (C) 2012 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 17#define LOG_TAG "BufferQueue" 18#define ATRACE_TAG ATRACE_TAG_GRAPHICS 19//#define LOG_NDEBUG 0 20 21#define GL_GLEXT_PROTOTYPES 22#define EGL_EGLEXT_PROTOTYPES 23 24#include <EGL/egl.h> 25#include <EGL/eglext.h> 26 27#include <gui/BufferQueue.h> 28#include <gui/IConsumerListener.h> 29#include <gui/ISurfaceComposer.h> 30#include <private/gui/ComposerService.h> 31 32#include <utils/Log.h> 33#include <utils/Trace.h> 34#include <utils/CallStack.h> 35 36// Macros for including the BufferQueue name in log messages 37#define ST_LOGV(x, ...) ALOGV("[%s] "x, mConsumerName.string(), ##__VA_ARGS__) 38#define ST_LOGD(x, ...) ALOGD("[%s] "x, mConsumerName.string(), ##__VA_ARGS__) 39#define ST_LOGI(x, ...) ALOGI("[%s] "x, mConsumerName.string(), ##__VA_ARGS__) 40#define ST_LOGW(x, ...) ALOGW("[%s] "x, mConsumerName.string(), ##__VA_ARGS__) 41#define ST_LOGE(x, ...) ALOGE("[%s] "x, mConsumerName.string(), ##__VA_ARGS__) 42 43#define ATRACE_BUFFER_INDEX(index) \ 44 if (ATRACE_ENABLED()) { \ 45 char ___traceBuf[1024]; \ 46 snprintf(___traceBuf, 1024, "%s: %d", mConsumerName.string(), \ 47 (index)); \ 48 android::ScopedTrace ___bufTracer(ATRACE_TAG, ___traceBuf); \ 49 } 50 51namespace android { 52 53// Get an ID that's unique within this process. 54static int32_t createProcessUniqueId() { 55 static volatile int32_t globalCounter = 0; 56 return android_atomic_inc(&globalCounter); 57} 58 59static const char* scalingModeName(int scalingMode) { 60 switch (scalingMode) { 61 case NATIVE_WINDOW_SCALING_MODE_FREEZE: return "FREEZE"; 62 case NATIVE_WINDOW_SCALING_MODE_SCALE_TO_WINDOW: return "SCALE_TO_WINDOW"; 63 case NATIVE_WINDOW_SCALING_MODE_SCALE_CROP: return "SCALE_CROP"; 64 default: return "Unknown"; 65 } 66} 67 68BufferQueue::BufferQueue(const sp<IGraphicBufferAlloc>& allocator) : 69 mDefaultWidth(1), 70 mDefaultHeight(1), 71 mMaxAcquiredBufferCount(1), 72 mDefaultMaxBufferCount(2), 73 mOverrideMaxBufferCount(0), 74 mConsumerControlledByApp(false), 75 mDequeueBufferCannotBlock(false), 76 mUseAsyncBuffer(true), 77 mConnectedApi(NO_CONNECTED_API), 78 mAbandoned(false), 79 mFrameCounter(0), 80 mBufferHasBeenQueued(false), 81 mDefaultBufferFormat(PIXEL_FORMAT_RGBA_8888), 82 mConsumerUsageBits(0), 83 mTransformHint(0) 84{ 85 // Choose a name using the PID and a process-unique ID. 86 mConsumerName = String8::format("unnamed-%d-%d", getpid(), createProcessUniqueId()); 87 88 ST_LOGV("BufferQueue"); 89 if (allocator == NULL) { 90 sp<ISurfaceComposer> composer(ComposerService::getComposerService()); 91 mGraphicBufferAlloc = composer->createGraphicBufferAlloc(); 92 if (mGraphicBufferAlloc == 0) { 93 ST_LOGE("createGraphicBufferAlloc() failed in BufferQueue()"); 94 } 95 } else { 96 mGraphicBufferAlloc = allocator; 97 } 98} 99 100BufferQueue::~BufferQueue() { 101 ST_LOGV("~BufferQueue"); 102} 103 104status_t BufferQueue::setDefaultMaxBufferCountLocked(int count) { 105 const int minBufferCount = mUseAsyncBuffer ? 2 : 1; 106 if (count < minBufferCount || count > NUM_BUFFER_SLOTS) 107 return BAD_VALUE; 108 109 mDefaultMaxBufferCount = count; 110 mDequeueCondition.broadcast(); 111 112 return NO_ERROR; 113} 114 115void BufferQueue::setConsumerName(const String8& name) { 116 Mutex::Autolock lock(mMutex); 117 mConsumerName = name; 118} 119 120status_t BufferQueue::setDefaultBufferFormat(uint32_t defaultFormat) { 121 Mutex::Autolock lock(mMutex); 122 mDefaultBufferFormat = defaultFormat; 123 return NO_ERROR; 124} 125 126status_t BufferQueue::setConsumerUsageBits(uint32_t usage) { 127 Mutex::Autolock lock(mMutex); 128 mConsumerUsageBits = usage; 129 return NO_ERROR; 130} 131 132status_t BufferQueue::setTransformHint(uint32_t hint) { 133 ST_LOGV("setTransformHint: %02x", hint); 134 Mutex::Autolock lock(mMutex); 135 mTransformHint = hint; 136 return NO_ERROR; 137} 138 139status_t BufferQueue::setBufferCount(int bufferCount) { 140 ST_LOGV("setBufferCount: count=%d", bufferCount); 141 142 sp<IConsumerListener> listener; 143 { 144 Mutex::Autolock lock(mMutex); 145 146 if (mAbandoned) { 147 ST_LOGE("setBufferCount: BufferQueue has been abandoned!"); 148 return NO_INIT; 149 } 150 if (bufferCount > NUM_BUFFER_SLOTS) { 151 ST_LOGE("setBufferCount: bufferCount too large (max %d)", 152 NUM_BUFFER_SLOTS); 153 return BAD_VALUE; 154 } 155 156 // Error out if the user has dequeued buffers 157 for (int i=0 ; i<NUM_BUFFER_SLOTS; i++) { 158 if (mSlots[i].mBufferState == BufferSlot::DEQUEUED) { 159 ST_LOGE("setBufferCount: client owns some buffers"); 160 return -EINVAL; 161 } 162 } 163 164 if (bufferCount == 0) { 165 mOverrideMaxBufferCount = 0; 166 mDequeueCondition.broadcast(); 167 return NO_ERROR; 168 } 169 170 // fine to assume async to false before we're setting the buffer count 171 const int minBufferSlots = getMinMaxBufferCountLocked(false); 172 if (bufferCount < minBufferSlots) { 173 ST_LOGE("setBufferCount: requested buffer count (%d) is less than " 174 "minimum (%d)", bufferCount, minBufferSlots); 175 return BAD_VALUE; 176 } 177 178 // here we're guaranteed that the client doesn't have dequeued buffers 179 // and will release all of its buffer references. We don't clear the 180 // queue, however, so currently queued buffers still get displayed. 181 freeAllBuffersLocked(); 182 mOverrideMaxBufferCount = bufferCount; 183 mDequeueCondition.broadcast(); 184 listener = mConsumerListener; 185 } // scope for lock 186 187 if (listener != NULL) { 188 listener->onBuffersReleased(); 189 } 190 191 return NO_ERROR; 192} 193 194int BufferQueue::query(int what, int* outValue) 195{ 196 ATRACE_CALL(); 197 Mutex::Autolock lock(mMutex); 198 199 if (mAbandoned) { 200 ST_LOGE("query: BufferQueue has been abandoned!"); 201 return NO_INIT; 202 } 203 204 int value; 205 switch (what) { 206 case NATIVE_WINDOW_WIDTH: 207 value = mDefaultWidth; 208 break; 209 case NATIVE_WINDOW_HEIGHT: 210 value = mDefaultHeight; 211 break; 212 case NATIVE_WINDOW_FORMAT: 213 value = mDefaultBufferFormat; 214 break; 215 case NATIVE_WINDOW_MIN_UNDEQUEUED_BUFFERS: 216 value = getMinUndequeuedBufferCount(false); 217 break; 218 case NATIVE_WINDOW_CONSUMER_RUNNING_BEHIND: 219 value = (mQueue.size() >= 2); 220 break; 221 case NATIVE_WINDOW_CONSUMER_USAGE_BITS: 222 value = mConsumerUsageBits; 223 break; 224 default: 225 return BAD_VALUE; 226 } 227 outValue[0] = value; 228 return NO_ERROR; 229} 230 231status_t BufferQueue::requestBuffer(int slot, sp<GraphicBuffer>* buf) { 232 ATRACE_CALL(); 233 ST_LOGV("requestBuffer: slot=%d", slot); 234 Mutex::Autolock lock(mMutex); 235 if (mAbandoned) { 236 ST_LOGE("requestBuffer: BufferQueue has been abandoned!"); 237 return NO_INIT; 238 } 239 if (slot < 0 || slot >= NUM_BUFFER_SLOTS) { 240 ST_LOGE("requestBuffer: slot index out of range [0, %d]: %d", 241 NUM_BUFFER_SLOTS, slot); 242 return BAD_VALUE; 243 } else if (mSlots[slot].mBufferState != BufferSlot::DEQUEUED) { 244 ST_LOGE("requestBuffer: slot %d is not owned by the client (state=%d)", 245 slot, mSlots[slot].mBufferState); 246 return BAD_VALUE; 247 } 248 mSlots[slot].mRequestBufferCalled = true; 249 *buf = mSlots[slot].mGraphicBuffer; 250 return NO_ERROR; 251} 252 253status_t BufferQueue::dequeueBuffer(int *outBuf, sp<Fence>* outFence, bool async, 254 uint32_t w, uint32_t h, uint32_t format, uint32_t usage) { 255 ATRACE_CALL(); 256 ST_LOGV("dequeueBuffer: w=%d h=%d fmt=%#x usage=%#x", w, h, format, usage); 257 258 if ((w && !h) || (!w && h)) { 259 ST_LOGE("dequeueBuffer: invalid size: w=%u, h=%u", w, h); 260 return BAD_VALUE; 261 } 262 263 status_t returnFlags(OK); 264 EGLDisplay dpy = EGL_NO_DISPLAY; 265 EGLSyncKHR eglFence = EGL_NO_SYNC_KHR; 266 267 { // Scope for the lock 268 Mutex::Autolock lock(mMutex); 269 270 if (format == 0) { 271 format = mDefaultBufferFormat; 272 } 273 // turn on usage bits the consumer requested 274 usage |= mConsumerUsageBits; 275 276 int found = -1; 277 bool tryAgain = true; 278 while (tryAgain) { 279 if (mAbandoned) { 280 ST_LOGE("dequeueBuffer: BufferQueue has been abandoned!"); 281 return NO_INIT; 282 } 283 284 const int maxBufferCount = getMaxBufferCountLocked(async); 285 if (async && mOverrideMaxBufferCount) { 286 // FIXME: some drivers are manually setting the buffer-count (which they 287 // shouldn't), so we do this extra test here to handle that case. 288 // This is TEMPORARY, until we get this fixed. 289 if (mOverrideMaxBufferCount < maxBufferCount) { 290 ST_LOGE("dequeueBuffer: async mode is invalid with buffercount override"); 291 return BAD_VALUE; 292 } 293 } 294 295 // Free up any buffers that are in slots beyond the max buffer 296 // count. 297 for (int i = maxBufferCount; i < NUM_BUFFER_SLOTS; i++) { 298 assert(mSlots[i].mBufferState == BufferSlot::FREE); 299 if (mSlots[i].mGraphicBuffer != NULL) { 300 freeBufferLocked(i); 301 returnFlags |= IGraphicBufferProducer::RELEASE_ALL_BUFFERS; 302 } 303 } 304 305 // look for a free buffer to give to the client 306 found = INVALID_BUFFER_SLOT; 307 int dequeuedCount = 0; 308 int acquiredCount = 0; 309 for (int i = 0; i < maxBufferCount; i++) { 310 const int state = mSlots[i].mBufferState; 311 switch (state) { 312 case BufferSlot::DEQUEUED: 313 dequeuedCount++; 314 break; 315 case BufferSlot::ACQUIRED: 316 acquiredCount++; 317 break; 318 case BufferSlot::FREE: 319 /* We return the oldest of the free buffers to avoid 320 * stalling the producer if possible. This is because 321 * the consumer may still have pending reads of the 322 * buffers in flight. 323 */ 324 if ((found < 0) || 325 mSlots[i].mFrameNumber < mSlots[found].mFrameNumber) { 326 found = i; 327 } 328 break; 329 } 330 } 331 332 // clients are not allowed to dequeue more than one buffer 333 // if they didn't set a buffer count. 334 if (!mOverrideMaxBufferCount && dequeuedCount) { 335 ST_LOGE("dequeueBuffer: can't dequeue multiple buffers without " 336 "setting the buffer count"); 337 return -EINVAL; 338 } 339 340 // See whether a buffer has been queued since the last 341 // setBufferCount so we know whether to perform the min undequeued 342 // buffers check below. 343 if (mBufferHasBeenQueued) { 344 // make sure the client is not trying to dequeue more buffers 345 // than allowed. 346 const int newUndequeuedCount = maxBufferCount - (dequeuedCount+1); 347 const int minUndequeuedCount = getMinUndequeuedBufferCount(async); 348 if (newUndequeuedCount < minUndequeuedCount) { 349 ST_LOGE("dequeueBuffer: min undequeued buffer count (%d) " 350 "exceeded (dequeued=%d undequeudCount=%d)", 351 minUndequeuedCount, dequeuedCount, 352 newUndequeuedCount); 353 return -EBUSY; 354 } 355 } 356 357 // If no buffer is found, wait for a buffer to be released or for 358 // the max buffer count to change. 359 tryAgain = found == INVALID_BUFFER_SLOT; 360 if (tryAgain) { 361 // return an error if we're in "cannot block" mode (producer and consumer 362 // are controlled by the application) -- however, the consumer is allowed 363 // to acquire briefly an extra buffer (which could cause us to have to wait here) 364 // and that's okay because we know the wait will be brief (it happens 365 // if we dequeue a buffer while the consumer has acquired one but not released 366 // the old one yet -- for e.g.: see GLConsumer::updateTexImage()). 367 if (mDequeueBufferCannotBlock && (acquiredCount <= mMaxAcquiredBufferCount)) { 368 ST_LOGE("dequeueBuffer: would block! returning an error instead."); 369 return WOULD_BLOCK; 370 } 371 mDequeueCondition.wait(mMutex); 372 } 373 } 374 375 376 if (found == INVALID_BUFFER_SLOT) { 377 // This should not happen. 378 ST_LOGE("dequeueBuffer: no available buffer slots"); 379 return -EBUSY; 380 } 381 382 const int buf = found; 383 *outBuf = found; 384 385 ATRACE_BUFFER_INDEX(buf); 386 387 const bool useDefaultSize = !w && !h; 388 if (useDefaultSize) { 389 // use the default size 390 w = mDefaultWidth; 391 h = mDefaultHeight; 392 } 393 394 mSlots[buf].mBufferState = BufferSlot::DEQUEUED; 395 396 const sp<GraphicBuffer>& buffer(mSlots[buf].mGraphicBuffer); 397 if ((buffer == NULL) || 398 (uint32_t(buffer->width) != w) || 399 (uint32_t(buffer->height) != h) || 400 (uint32_t(buffer->format) != format) || 401 ((uint32_t(buffer->usage) & usage) != usage)) 402 { 403 mSlots[buf].mAcquireCalled = false; 404 mSlots[buf].mGraphicBuffer = NULL; 405 mSlots[buf].mRequestBufferCalled = false; 406 mSlots[buf].mEglFence = EGL_NO_SYNC_KHR; 407 mSlots[buf].mFence = Fence::NO_FENCE; 408 mSlots[buf].mEglDisplay = EGL_NO_DISPLAY; 409 410 returnFlags |= IGraphicBufferProducer::BUFFER_NEEDS_REALLOCATION; 411 } 412 413 414 if (CC_UNLIKELY(mSlots[buf].mFence == NULL)) { 415 ST_LOGE("dequeueBuffer: about to return a NULL fence from mSlot. " 416 "buf=%d, w=%d, h=%d, format=%d", 417 buf, buffer->width, buffer->height, buffer->format); 418 } 419 420 dpy = mSlots[buf].mEglDisplay; 421 eglFence = mSlots[buf].mEglFence; 422 *outFence = mSlots[buf].mFence; 423 mSlots[buf].mEglFence = EGL_NO_SYNC_KHR; 424 mSlots[buf].mFence = Fence::NO_FENCE; 425 } // end lock scope 426 427 if (returnFlags & IGraphicBufferProducer::BUFFER_NEEDS_REALLOCATION) { 428 status_t error; 429 sp<GraphicBuffer> graphicBuffer( 430 mGraphicBufferAlloc->createGraphicBuffer(w, h, format, usage, &error)); 431 if (graphicBuffer == 0) { 432 ST_LOGE("dequeueBuffer: SurfaceComposer::createGraphicBuffer failed"); 433 return error; 434 } 435 436 { // Scope for the lock 437 Mutex::Autolock lock(mMutex); 438 439 if (mAbandoned) { 440 ST_LOGE("dequeueBuffer: BufferQueue has been abandoned!"); 441 return NO_INIT; 442 } 443 444 mSlots[*outBuf].mFrameNumber = ~0; 445 mSlots[*outBuf].mGraphicBuffer = graphicBuffer; 446 } 447 } 448 449 if (eglFence != EGL_NO_SYNC_KHR) { 450 EGLint result = eglClientWaitSyncKHR(dpy, eglFence, 0, 1000000000); 451 // If something goes wrong, log the error, but return the buffer without 452 // synchronizing access to it. It's too late at this point to abort the 453 // dequeue operation. 454 if (result == EGL_FALSE) { 455 ST_LOGE("dequeueBuffer: error waiting for fence: %#x", eglGetError()); 456 } else if (result == EGL_TIMEOUT_EXPIRED_KHR) { 457 ST_LOGE("dequeueBuffer: timeout waiting for fence"); 458 } 459 eglDestroySyncKHR(dpy, eglFence); 460 } 461 462 ST_LOGV("dequeueBuffer: returning slot=%d/%llu buf=%p flags=%#x", *outBuf, 463 mSlots[*outBuf].mFrameNumber, 464 mSlots[*outBuf].mGraphicBuffer->handle, returnFlags); 465 466 return returnFlags; 467} 468 469status_t BufferQueue::queueBuffer(int buf, 470 const QueueBufferInput& input, QueueBufferOutput* output) { 471 ATRACE_CALL(); 472 ATRACE_BUFFER_INDEX(buf); 473 474 Rect crop; 475 uint32_t transform; 476 int scalingMode; 477 int64_t timestamp; 478 bool isAutoTimestamp; 479 bool async; 480 sp<Fence> fence; 481 482 input.deflate(×tamp, &isAutoTimestamp, &crop, &scalingMode, &transform, 483 &async, &fence); 484 485 if (fence == NULL) { 486 ST_LOGE("queueBuffer: fence is NULL"); 487 return BAD_VALUE; 488 } 489 490 switch (scalingMode) { 491 case NATIVE_WINDOW_SCALING_MODE_FREEZE: 492 case NATIVE_WINDOW_SCALING_MODE_SCALE_TO_WINDOW: 493 case NATIVE_WINDOW_SCALING_MODE_SCALE_CROP: 494 case NATIVE_WINDOW_SCALING_MODE_NO_SCALE_CROP: 495 break; 496 default: 497 ST_LOGE("unknown scaling mode: %d", scalingMode); 498 return -EINVAL; 499 } 500 501 sp<IConsumerListener> listener; 502 503 { // scope for the lock 504 Mutex::Autolock lock(mMutex); 505 506 if (mAbandoned) { 507 ST_LOGE("queueBuffer: BufferQueue has been abandoned!"); 508 return NO_INIT; 509 } 510 511 const int maxBufferCount = getMaxBufferCountLocked(async); 512 if (async && mOverrideMaxBufferCount) { 513 // FIXME: some drivers are manually setting the buffer-count (which they 514 // shouldn't), so we do this extra test here to handle that case. 515 // This is TEMPORARY, until we get this fixed. 516 if (mOverrideMaxBufferCount < maxBufferCount) { 517 ST_LOGE("queueBuffer: async mode is invalid with buffercount override"); 518 return BAD_VALUE; 519 } 520 } 521 if (buf < 0 || buf >= maxBufferCount) { 522 ST_LOGE("queueBuffer: slot index out of range [0, %d]: %d", 523 maxBufferCount, buf); 524 return -EINVAL; 525 } else if (mSlots[buf].mBufferState != BufferSlot::DEQUEUED) { 526 ST_LOGE("queueBuffer: slot %d is not owned by the client " 527 "(state=%d)", buf, mSlots[buf].mBufferState); 528 return -EINVAL; 529 } else if (!mSlots[buf].mRequestBufferCalled) { 530 ST_LOGE("queueBuffer: slot %d was enqueued without requesting a " 531 "buffer", buf); 532 return -EINVAL; 533 } 534 535 ST_LOGV("queueBuffer: slot=%d/%llu time=%#llx crop=[%d,%d,%d,%d] " 536 "tr=%#x scale=%s", 537 buf, mFrameCounter + 1, timestamp, 538 crop.left, crop.top, crop.right, crop.bottom, 539 transform, scalingModeName(scalingMode)); 540 541 const sp<GraphicBuffer>& graphicBuffer(mSlots[buf].mGraphicBuffer); 542 Rect bufferRect(graphicBuffer->getWidth(), graphicBuffer->getHeight()); 543 Rect croppedCrop; 544 crop.intersect(bufferRect, &croppedCrop); 545 if (croppedCrop != crop) { 546 ST_LOGE("queueBuffer: crop rect is not contained within the " 547 "buffer in slot %d", buf); 548 return -EINVAL; 549 } 550 551 mSlots[buf].mFence = fence; 552 mSlots[buf].mBufferState = BufferSlot::QUEUED; 553 mFrameCounter++; 554 mSlots[buf].mFrameNumber = mFrameCounter; 555 556 BufferItem item; 557 item.mAcquireCalled = mSlots[buf].mAcquireCalled; 558 item.mGraphicBuffer = mSlots[buf].mGraphicBuffer; 559 item.mCrop = crop; 560 item.mTransform = transform & ~NATIVE_WINDOW_TRANSFORM_INVERSE_DISPLAY; 561 item.mTransformToDisplayInverse = bool(transform & NATIVE_WINDOW_TRANSFORM_INVERSE_DISPLAY); 562 item.mScalingMode = scalingMode; 563 item.mTimestamp = timestamp; 564 item.mIsAutoTimestamp = isAutoTimestamp; 565 item.mFrameNumber = mFrameCounter; 566 item.mBuf = buf; 567 item.mFence = fence; 568 item.mIsDroppable = mDequeueBufferCannotBlock || async; 569 570 if (mQueue.empty()) { 571 // when the queue is empty, we can ignore "mDequeueBufferCannotBlock", and 572 // simply queue this buffer. 573 mQueue.push_back(item); 574 listener = mConsumerListener; 575 } else { 576 // when the queue is not empty, we need to look at the front buffer 577 // state and see if we need to replace it. 578 Fifo::iterator front(mQueue.begin()); 579 if (front->mIsDroppable) { 580 // buffer slot currently queued is marked free if still tracked 581 if (stillTracking(front)) { 582 mSlots[front->mBuf].mBufferState = BufferSlot::FREE; 583 // reset the frame number of the freed buffer so that it is the first in 584 // line to be dequeued again. 585 mSlots[front->mBuf].mFrameNumber = 0; 586 } 587 // and we record the new buffer in the queued list 588 *front = item; 589 } else { 590 mQueue.push_back(item); 591 listener = mConsumerListener; 592 } 593 } 594 595 mBufferHasBeenQueued = true; 596 mDequeueCondition.broadcast(); 597 598 output->inflate(mDefaultWidth, mDefaultHeight, mTransformHint, 599 mQueue.size()); 600 601 ATRACE_INT(mConsumerName.string(), mQueue.size()); 602 } // scope for the lock 603 604 // call back without lock held 605 if (listener != 0) { 606 listener->onFrameAvailable(); 607 } 608 return NO_ERROR; 609} 610 611void BufferQueue::cancelBuffer(int buf, const sp<Fence>& fence) { 612 ATRACE_CALL(); 613 ST_LOGV("cancelBuffer: slot=%d", buf); 614 Mutex::Autolock lock(mMutex); 615 616 if (mAbandoned) { 617 ST_LOGW("cancelBuffer: BufferQueue has been abandoned!"); 618 return; 619 } 620 621 if (buf < 0 || buf >= NUM_BUFFER_SLOTS) { 622 ST_LOGE("cancelBuffer: slot index out of range [0, %d]: %d", 623 NUM_BUFFER_SLOTS, buf); 624 return; 625 } else if (mSlots[buf].mBufferState != BufferSlot::DEQUEUED) { 626 ST_LOGE("cancelBuffer: slot %d is not owned by the client (state=%d)", 627 buf, mSlots[buf].mBufferState); 628 return; 629 } else if (fence == NULL) { 630 ST_LOGE("cancelBuffer: fence is NULL"); 631 return; 632 } 633 mSlots[buf].mBufferState = BufferSlot::FREE; 634 mSlots[buf].mFrameNumber = 0; 635 mSlots[buf].mFence = fence; 636 mDequeueCondition.broadcast(); 637} 638 639 640status_t BufferQueue::connect(const sp<IBinder>& token, 641 int api, bool producerControlledByApp, QueueBufferOutput* output) { 642 ATRACE_CALL(); 643 ST_LOGV("connect: api=%d producerControlledByApp=%s", api, 644 producerControlledByApp ? "true" : "false"); 645 Mutex::Autolock lock(mMutex); 646 647 if (mAbandoned) { 648 ST_LOGE("connect: BufferQueue has been abandoned!"); 649 return NO_INIT; 650 } 651 652 if (mConsumerListener == NULL) { 653 ST_LOGE("connect: BufferQueue has no consumer!"); 654 return NO_INIT; 655 } 656 657 int err = NO_ERROR; 658 switch (api) { 659 case NATIVE_WINDOW_API_EGL: 660 case NATIVE_WINDOW_API_CPU: 661 case NATIVE_WINDOW_API_MEDIA: 662 case NATIVE_WINDOW_API_CAMERA: 663 if (mConnectedApi != NO_CONNECTED_API) { 664 ST_LOGE("connect: already connected (cur=%d, req=%d)", 665 mConnectedApi, api); 666 err = -EINVAL; 667 } else { 668 mConnectedApi = api; 669 output->inflate(mDefaultWidth, mDefaultHeight, mTransformHint, mQueue.size()); 670 671 // set-up a death notification so that we can disconnect 672 // automatically when/if the remote producer dies. 673 if (token != NULL && token->remoteBinder() != NULL) { 674 status_t err = token->linkToDeath(static_cast<IBinder::DeathRecipient*>(this)); 675 if (err == NO_ERROR) { 676 mConnectedProducerToken = token; 677 } else { 678 ALOGE("linkToDeath failed: %s (%d)", strerror(-err), err); 679 } 680 } 681 } 682 break; 683 default: 684 err = -EINVAL; 685 break; 686 } 687 688 mBufferHasBeenQueued = false; 689 mDequeueBufferCannotBlock = mConsumerControlledByApp && producerControlledByApp; 690 691 return err; 692} 693 694void BufferQueue::binderDied(const wp<IBinder>& who) { 695 // If we're here, it means that a producer we were connected to died. 696 // We're GUARANTEED that we still are connected to it because it has no other way 697 // to get disconnected -- or -- we wouldn't be here because we're removing this 698 // callback upon disconnect. Therefore, it's okay to read mConnectedApi without 699 // synchronization here. 700 int api = mConnectedApi; 701 this->disconnect(api); 702} 703 704status_t BufferQueue::disconnect(int api) { 705 ATRACE_CALL(); 706 ST_LOGV("disconnect: api=%d", api); 707 708 int err = NO_ERROR; 709 sp<IConsumerListener> listener; 710 711 { // Scope for the lock 712 Mutex::Autolock lock(mMutex); 713 714 if (mAbandoned) { 715 // it is not really an error to disconnect after the surface 716 // has been abandoned, it should just be a no-op. 717 return NO_ERROR; 718 } 719 720 switch (api) { 721 case NATIVE_WINDOW_API_EGL: 722 case NATIVE_WINDOW_API_CPU: 723 case NATIVE_WINDOW_API_MEDIA: 724 case NATIVE_WINDOW_API_CAMERA: 725 if (mConnectedApi == api) { 726 freeAllBuffersLocked(); 727 // remove our death notification callback if we have one 728 sp<IBinder> token = mConnectedProducerToken; 729 if (token != NULL) { 730 // this can fail if we're here because of the death notification 731 // either way, we just ignore. 732 token->unlinkToDeath(static_cast<IBinder::DeathRecipient*>(this)); 733 } 734 mConnectedProducerToken = NULL; 735 mConnectedApi = NO_CONNECTED_API; 736 mDequeueCondition.broadcast(); 737 listener = mConsumerListener; 738 } else { 739 ST_LOGE("disconnect: connected to another api (cur=%d, req=%d)", 740 mConnectedApi, api); 741 err = -EINVAL; 742 } 743 break; 744 default: 745 ST_LOGE("disconnect: unknown API %d", api); 746 err = -EINVAL; 747 break; 748 } 749 } 750 751 if (listener != NULL) { 752 listener->onBuffersReleased(); 753 } 754 755 return err; 756} 757 758void BufferQueue::dump(String8& result, const char* prefix) const { 759 Mutex::Autolock _l(mMutex); 760 761 String8 fifo; 762 int fifoSize = 0; 763 Fifo::const_iterator i(mQueue.begin()); 764 while (i != mQueue.end()) { 765 fifo.appendFormat("%02d:%p crop=[%d,%d,%d,%d], " 766 "xform=0x%02x, time=%#llx, scale=%s\n", 767 i->mBuf, i->mGraphicBuffer.get(), 768 i->mCrop.left, i->mCrop.top, i->mCrop.right, 769 i->mCrop.bottom, i->mTransform, i->mTimestamp, 770 scalingModeName(i->mScalingMode) 771 ); 772 i++; 773 fifoSize++; 774 } 775 776 777 result.appendFormat( 778 "%s-BufferQueue mMaxAcquiredBufferCount=%d, mDequeueBufferCannotBlock=%d, default-size=[%dx%d], " 779 "default-format=%d, transform-hint=%02x, FIFO(%d)={%s}\n", 780 prefix, mMaxAcquiredBufferCount, mDequeueBufferCannotBlock, mDefaultWidth, 781 mDefaultHeight, mDefaultBufferFormat, mTransformHint, 782 fifoSize, fifo.string()); 783 784 struct { 785 const char * operator()(int state) const { 786 switch (state) { 787 case BufferSlot::DEQUEUED: return "DEQUEUED"; 788 case BufferSlot::QUEUED: return "QUEUED"; 789 case BufferSlot::FREE: return "FREE"; 790 case BufferSlot::ACQUIRED: return "ACQUIRED"; 791 default: return "Unknown"; 792 } 793 } 794 } stateName; 795 796 // just trim the free buffers to not spam the dump 797 int maxBufferCount = 0; 798 for (int i=NUM_BUFFER_SLOTS-1 ; i>=0 ; i--) { 799 const BufferSlot& slot(mSlots[i]); 800 if ((slot.mBufferState != BufferSlot::FREE) || (slot.mGraphicBuffer != NULL)) { 801 maxBufferCount = i+1; 802 break; 803 } 804 } 805 806 for (int i=0 ; i<maxBufferCount ; i++) { 807 const BufferSlot& slot(mSlots[i]); 808 const sp<GraphicBuffer>& buf(slot.mGraphicBuffer); 809 result.appendFormat( 810 "%s%s[%02d:%p] state=%-8s", 811 prefix, (slot.mBufferState == BufferSlot::ACQUIRED)?">":" ", i, buf.get(), 812 stateName(slot.mBufferState) 813 ); 814 815 if (buf != NULL) { 816 result.appendFormat( 817 ", %p [%4ux%4u:%4u,%3X]", 818 buf->handle, buf->width, buf->height, buf->stride, 819 buf->format); 820 } 821 result.append("\n"); 822 } 823} 824 825void BufferQueue::freeBufferLocked(int slot) { 826 ST_LOGV("freeBufferLocked: slot=%d", slot); 827 mSlots[slot].mGraphicBuffer = 0; 828 if (mSlots[slot].mBufferState == BufferSlot::ACQUIRED) { 829 mSlots[slot].mNeedsCleanupOnRelease = true; 830 } 831 mSlots[slot].mBufferState = BufferSlot::FREE; 832 mSlots[slot].mFrameNumber = 0; 833 mSlots[slot].mAcquireCalled = false; 834 835 // destroy fence as BufferQueue now takes ownership 836 if (mSlots[slot].mEglFence != EGL_NO_SYNC_KHR) { 837 eglDestroySyncKHR(mSlots[slot].mEglDisplay, mSlots[slot].mEglFence); 838 mSlots[slot].mEglFence = EGL_NO_SYNC_KHR; 839 } 840 mSlots[slot].mFence = Fence::NO_FENCE; 841} 842 843void BufferQueue::freeAllBuffersLocked() { 844 mBufferHasBeenQueued = false; 845 for (int i = 0; i < NUM_BUFFER_SLOTS; i++) { 846 freeBufferLocked(i); 847 } 848} 849 850status_t BufferQueue::acquireBuffer(BufferItem *buffer, nsecs_t expectedPresent) { 851 ATRACE_CALL(); 852 Mutex::Autolock _l(mMutex); 853 854 // Check that the consumer doesn't currently have the maximum number of 855 // buffers acquired. We allow the max buffer count to be exceeded by one 856 // buffer, so that the consumer can successfully set up the newly acquired 857 // buffer before releasing the old one. 858 int numAcquiredBuffers = 0; 859 for (int i = 0; i < NUM_BUFFER_SLOTS; i++) { 860 if (mSlots[i].mBufferState == BufferSlot::ACQUIRED) { 861 numAcquiredBuffers++; 862 } 863 } 864 if (numAcquiredBuffers >= mMaxAcquiredBufferCount+1) { 865 ST_LOGE("acquireBuffer: max acquired buffer count reached: %d (max=%d)", 866 numAcquiredBuffers, mMaxAcquiredBufferCount); 867 return INVALID_OPERATION; 868 } 869 870 // check if queue is empty 871 // In asynchronous mode the list is guaranteed to be one buffer 872 // deep, while in synchronous mode we use the oldest buffer. 873 if (mQueue.empty()) { 874 return NO_BUFFER_AVAILABLE; 875 } 876 877 Fifo::iterator front(mQueue.begin()); 878 879 // If expectedPresent is specified, we may not want to return a buffer yet. 880 // If it's specified and there's more than one buffer queued, we may 881 // want to drop a buffer. 882 if (expectedPresent != 0) { 883 const int MAX_REASONABLE_NSEC = 1000000000ULL; // 1 second 884 885 // The "expectedPresent" argument indicates when the buffer is expected 886 // to be presented on-screen. If the buffer's desired-present time 887 // is earlier (less) than expectedPresent, meaning it'll be displayed 888 // on time or possibly late if we show it ASAP, we acquire and return 889 // it. If we don't want to display it until after the expectedPresent 890 // time, we return PRESENT_LATER without acquiring it. 891 // 892 // To be safe, we don't defer acquisition if expectedPresent is 893 // more than one second in the future beyond the desired present time 894 // (i.e. we'd be holding the buffer for a long time). 895 // 896 // NOTE: code assumes monotonic time values from the system clock are 897 // positive. 898 899 // Start by checking to see if we can drop frames. We skip this check 900 // if the timestamps are being auto-generated by Surface -- if the 901 // app isn't generating timestamps explicitly, they probably don't 902 // want frames to be discarded based on them. 903 while (mQueue.size() > 1 && !mQueue[0].mIsAutoTimestamp) { 904 // If entry[1] is timely, drop entry[0] (and repeat). We apply 905 // an additional criteria here: we only drop the earlier buffer if 906 // our desiredPresent falls within +/- 1 second of the expected 907 // present. Otherwise, bogus desiredPresent times (e.g. 0 or 908 // a small relative timestamp), which normally mean "ignore the 909 // timestamp and acquire immediately", would cause us to drop 910 // frames. 911 // 912 // We may want to add an additional criteria: don't drop the 913 // earlier buffer if entry[1]'s fence hasn't signaled yet. 914 // 915 // (Vector front is [0], back is [size()-1]) 916 const BufferItem& bi(mQueue[1]); 917 nsecs_t desiredPresent = bi.mTimestamp; 918 if (desiredPresent < expectedPresent - MAX_REASONABLE_NSEC || 919 desiredPresent > expectedPresent) { 920 // This buffer is set to display in the near future, or 921 // desiredPresent is garbage. Either way we don't want to 922 // drop the previous buffer just to get this on screen sooner. 923 ST_LOGV("pts nodrop: des=%lld expect=%lld (%lld) now=%lld", 924 desiredPresent, expectedPresent, desiredPresent - expectedPresent, 925 systemTime(CLOCK_MONOTONIC)); 926 break; 927 } 928 ST_LOGV("pts drop: queue1des=%lld expect=%lld size=%d", 929 desiredPresent, expectedPresent, mQueue.size()); 930 if (stillTracking(front)) { 931 // front buffer is still in mSlots, so mark the slot as free 932 mSlots[front->mBuf].mBufferState = BufferSlot::FREE; 933 } 934 mQueue.erase(front); 935 front = mQueue.begin(); 936 } 937 938 // See if the front buffer is due. 939 nsecs_t desiredPresent = front->mTimestamp; 940 if (desiredPresent > expectedPresent && 941 desiredPresent < expectedPresent + MAX_REASONABLE_NSEC) { 942 ST_LOGV("pts defer: des=%lld expect=%lld (%lld) now=%lld", 943 desiredPresent, expectedPresent, desiredPresent - expectedPresent, 944 systemTime(CLOCK_MONOTONIC)); 945 return PRESENT_LATER; 946 } 947 948 ST_LOGV("pts accept: des=%lld expect=%lld (%lld) now=%lld", 949 desiredPresent, expectedPresent, desiredPresent - expectedPresent, 950 systemTime(CLOCK_MONOTONIC)); 951 } 952 953 int buf = front->mBuf; 954 *buffer = *front; 955 ATRACE_BUFFER_INDEX(buf); 956 957 ST_LOGV("acquireBuffer: acquiring { slot=%d/%llu, buffer=%p }", 958 front->mBuf, front->mFrameNumber, 959 front->mGraphicBuffer->handle); 960 // if front buffer still being tracked update slot state 961 if (stillTracking(front)) { 962 mSlots[buf].mAcquireCalled = true; 963 mSlots[buf].mNeedsCleanupOnRelease = false; 964 mSlots[buf].mBufferState = BufferSlot::ACQUIRED; 965 mSlots[buf].mFence = Fence::NO_FENCE; 966 } 967 968 // If the buffer has previously been acquired by the consumer, set 969 // mGraphicBuffer to NULL to avoid unnecessarily remapping this 970 // buffer on the consumer side. 971 if (buffer->mAcquireCalled) { 972 buffer->mGraphicBuffer = NULL; 973 } 974 975 mQueue.erase(front); 976 mDequeueCondition.broadcast(); 977 978 ATRACE_INT(mConsumerName.string(), mQueue.size()); 979 980 return NO_ERROR; 981} 982 983status_t BufferQueue::releaseBuffer( 984 int buf, uint64_t frameNumber, EGLDisplay display, 985 EGLSyncKHR eglFence, const sp<Fence>& fence) { 986 ATRACE_CALL(); 987 ATRACE_BUFFER_INDEX(buf); 988 989 if (buf == INVALID_BUFFER_SLOT || fence == NULL) { 990 return BAD_VALUE; 991 } 992 993 Mutex::Autolock _l(mMutex); 994 995 // If the frame number has changed because buffer has been reallocated, 996 // we can ignore this releaseBuffer for the old buffer. 997 if (frameNumber != mSlots[buf].mFrameNumber) { 998 return STALE_BUFFER_SLOT; 999 } 1000 1001 1002 // Internal state consistency checks: 1003 // Make sure this buffers hasn't been queued while we were owning it (acquired) 1004 Fifo::iterator front(mQueue.begin()); 1005 Fifo::const_iterator const end(mQueue.end()); 1006 while (front != end) { 1007 if (front->mBuf == buf) { 1008 LOG_ALWAYS_FATAL("[%s] received new buffer(#%lld) on slot #%d that has not yet been " 1009 "acquired", mConsumerName.string(), frameNumber, buf); 1010 break; // never reached 1011 } 1012 front++; 1013 } 1014 1015 // The buffer can now only be released if its in the acquired state 1016 if (mSlots[buf].mBufferState == BufferSlot::ACQUIRED) { 1017 mSlots[buf].mEglDisplay = display; 1018 mSlots[buf].mEglFence = eglFence; 1019 mSlots[buf].mFence = fence; 1020 mSlots[buf].mBufferState = BufferSlot::FREE; 1021 } else if (mSlots[buf].mNeedsCleanupOnRelease) { 1022 ST_LOGV("releasing a stale buf %d its state was %d", buf, mSlots[buf].mBufferState); 1023 mSlots[buf].mNeedsCleanupOnRelease = false; 1024 return STALE_BUFFER_SLOT; 1025 } else { 1026 ST_LOGE("attempted to release buf %d but its state was %d", buf, mSlots[buf].mBufferState); 1027 return -EINVAL; 1028 } 1029 1030 mDequeueCondition.broadcast(); 1031 return NO_ERROR; 1032} 1033 1034status_t BufferQueue::consumerConnect(const sp<IConsumerListener>& consumerListener, 1035 bool controlledByApp) { 1036 ST_LOGV("consumerConnect controlledByApp=%s", 1037 controlledByApp ? "true" : "false"); 1038 Mutex::Autolock lock(mMutex); 1039 1040 if (mAbandoned) { 1041 ST_LOGE("consumerConnect: BufferQueue has been abandoned!"); 1042 return NO_INIT; 1043 } 1044 if (consumerListener == NULL) { 1045 ST_LOGE("consumerConnect: consumerListener may not be NULL"); 1046 return BAD_VALUE; 1047 } 1048 1049 mConsumerListener = consumerListener; 1050 mConsumerControlledByApp = controlledByApp; 1051 1052 return NO_ERROR; 1053} 1054 1055status_t BufferQueue::consumerDisconnect() { 1056 ST_LOGV("consumerDisconnect"); 1057 Mutex::Autolock lock(mMutex); 1058 1059 if (mConsumerListener == NULL) { 1060 ST_LOGE("consumerDisconnect: No consumer is connected!"); 1061 return -EINVAL; 1062 } 1063 1064 mAbandoned = true; 1065 mConsumerListener = NULL; 1066 mQueue.clear(); 1067 freeAllBuffersLocked(); 1068 mDequeueCondition.broadcast(); 1069 return NO_ERROR; 1070} 1071 1072status_t BufferQueue::getReleasedBuffers(uint32_t* slotMask) { 1073 ST_LOGV("getReleasedBuffers"); 1074 Mutex::Autolock lock(mMutex); 1075 1076 if (mAbandoned) { 1077 ST_LOGE("getReleasedBuffers: BufferQueue has been abandoned!"); 1078 return NO_INIT; 1079 } 1080 1081 uint32_t mask = 0; 1082 for (int i = 0; i < NUM_BUFFER_SLOTS; i++) { 1083 if (!mSlots[i].mAcquireCalled) { 1084 mask |= 1 << i; 1085 } 1086 } 1087 1088 // Remove buffers in flight (on the queue) from the mask where acquire has 1089 // been called, as the consumer will not receive the buffer address, so 1090 // it should not free these slots. 1091 Fifo::iterator front(mQueue.begin()); 1092 while (front != mQueue.end()) { 1093 if (front->mAcquireCalled) 1094 mask &= ~(1 << front->mBuf); 1095 front++; 1096 } 1097 1098 *slotMask = mask; 1099 1100 ST_LOGV("getReleasedBuffers: returning mask %#x", mask); 1101 return NO_ERROR; 1102} 1103 1104status_t BufferQueue::setDefaultBufferSize(uint32_t w, uint32_t h) { 1105 ST_LOGV("setDefaultBufferSize: w=%d, h=%d", w, h); 1106 if (!w || !h) { 1107 ST_LOGE("setDefaultBufferSize: dimensions cannot be 0 (w=%d, h=%d)", 1108 w, h); 1109 return BAD_VALUE; 1110 } 1111 1112 Mutex::Autolock lock(mMutex); 1113 mDefaultWidth = w; 1114 mDefaultHeight = h; 1115 return NO_ERROR; 1116} 1117 1118status_t BufferQueue::setDefaultMaxBufferCount(int bufferCount) { 1119 ATRACE_CALL(); 1120 Mutex::Autolock lock(mMutex); 1121 return setDefaultMaxBufferCountLocked(bufferCount); 1122} 1123 1124status_t BufferQueue::disableAsyncBuffer() { 1125 ATRACE_CALL(); 1126 Mutex::Autolock lock(mMutex); 1127 if (mConsumerListener != NULL) { 1128 ST_LOGE("disableAsyncBuffer: consumer already connected!"); 1129 return INVALID_OPERATION; 1130 } 1131 mUseAsyncBuffer = false; 1132 return NO_ERROR; 1133} 1134 1135status_t BufferQueue::setMaxAcquiredBufferCount(int maxAcquiredBuffers) { 1136 ATRACE_CALL(); 1137 Mutex::Autolock lock(mMutex); 1138 if (maxAcquiredBuffers < 1 || maxAcquiredBuffers > MAX_MAX_ACQUIRED_BUFFERS) { 1139 ST_LOGE("setMaxAcquiredBufferCount: invalid count specified: %d", 1140 maxAcquiredBuffers); 1141 return BAD_VALUE; 1142 } 1143 if (mConnectedApi != NO_CONNECTED_API) { 1144 return INVALID_OPERATION; 1145 } 1146 mMaxAcquiredBufferCount = maxAcquiredBuffers; 1147 return NO_ERROR; 1148} 1149 1150int BufferQueue::getMinUndequeuedBufferCount(bool async) const { 1151 // if dequeueBuffer is allowed to error out, we don't have to 1152 // add an extra buffer. 1153 if (!mUseAsyncBuffer) 1154 return mMaxAcquiredBufferCount; 1155 1156 // we're in async mode, or we want to prevent the app to 1157 // deadlock itself, we throw-in an extra buffer to guarantee it. 1158 if (mDequeueBufferCannotBlock || async) 1159 return mMaxAcquiredBufferCount+1; 1160 1161 return mMaxAcquiredBufferCount; 1162} 1163 1164int BufferQueue::getMinMaxBufferCountLocked(bool async) const { 1165 return getMinUndequeuedBufferCount(async) + 1; 1166} 1167 1168int BufferQueue::getMaxBufferCountLocked(bool async) const { 1169 int minMaxBufferCount = getMinMaxBufferCountLocked(async); 1170 1171 int maxBufferCount = mDefaultMaxBufferCount; 1172 if (maxBufferCount < minMaxBufferCount) { 1173 maxBufferCount = minMaxBufferCount; 1174 } 1175 if (mOverrideMaxBufferCount != 0) { 1176 assert(mOverrideMaxBufferCount >= minMaxBufferCount); 1177 maxBufferCount = mOverrideMaxBufferCount; 1178 } 1179 1180 // Any buffers that are dequeued by the producer or sitting in the queue 1181 // waiting to be consumed need to have their slots preserved. Such 1182 // buffers will temporarily keep the max buffer count up until the slots 1183 // no longer need to be preserved. 1184 for (int i = maxBufferCount; i < NUM_BUFFER_SLOTS; i++) { 1185 BufferSlot::BufferState state = mSlots[i].mBufferState; 1186 if (state == BufferSlot::QUEUED || state == BufferSlot::DEQUEUED) { 1187 maxBufferCount = i + 1; 1188 } 1189 } 1190 1191 return maxBufferCount; 1192} 1193 1194bool BufferQueue::stillTracking(const BufferItem *item) const { 1195 const BufferSlot &slot = mSlots[item->mBuf]; 1196 1197 ST_LOGV("stillTracking?: item: { slot=%d/%llu, buffer=%p }, " 1198 "slot: { slot=%d/%llu, buffer=%p }", 1199 item->mBuf, item->mFrameNumber, 1200 (item->mGraphicBuffer.get() ? item->mGraphicBuffer->handle : 0), 1201 item->mBuf, slot.mFrameNumber, 1202 (slot.mGraphicBuffer.get() ? slot.mGraphicBuffer->handle : 0)); 1203 1204 // Compare item with its original buffer slot. We can check the slot 1205 // as the buffer would not be moved to a different slot by the producer. 1206 return (slot.mGraphicBuffer != NULL && 1207 item->mGraphicBuffer->handle == slot.mGraphicBuffer->handle); 1208} 1209 1210BufferQueue::ProxyConsumerListener::ProxyConsumerListener( 1211 const wp<ConsumerListener>& consumerListener): 1212 mConsumerListener(consumerListener) {} 1213 1214BufferQueue::ProxyConsumerListener::~ProxyConsumerListener() {} 1215 1216void BufferQueue::ProxyConsumerListener::onFrameAvailable() { 1217 sp<ConsumerListener> listener(mConsumerListener.promote()); 1218 if (listener != NULL) { 1219 listener->onFrameAvailable(); 1220 } 1221} 1222 1223void BufferQueue::ProxyConsumerListener::onBuffersReleased() { 1224 sp<ConsumerListener> listener(mConsumerListener.promote()); 1225 if (listener != NULL) { 1226 listener->onBuffersReleased(); 1227 } 1228} 1229 1230}; // namespace android 1231