| OLD | NEW |
| (Empty) | |
| 1 /* |
| 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
| 3 * |
| 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions |
| 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the |
| 11 * documentation and/or other materials provided with the distribution. |
| 12 * |
| 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
| 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
| 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ |
| 25 |
| 26 #include "platform/graphics/ThreadSafeDataTransport.h" |
| 27 |
| 28 #include "platform/SharedBuffer.h" |
| 29 |
| 30 namespace blink { |
| 31 |
| 32 ThreadSafeDataTransport::ThreadSafeDataTransport() |
| 33 : m_readBuffer(SharedBuffer::create()) |
| 34 , m_allDataReceived(false) |
| 35 , m_readPosition(0) |
| 36 { |
| 37 } |
| 38 |
| 39 ThreadSafeDataTransport::~ThreadSafeDataTransport() |
| 40 { |
| 41 } |
| 42 |
| 43 void ThreadSafeDataTransport::setData(SharedBuffer* buffer, bool allDataReceived
) |
| 44 { |
| 45 ASSERT(buffer->size() >= m_readPosition); |
| 46 Vector<RefPtr<SharedBuffer>> newBufferQueue; |
| 47 |
| 48 const char* segment = 0; |
| 49 while (size_t length = buffer->getSomeData(segment, m_readPosition)) { |
| 50 m_readPosition += length; |
| 51 newBufferQueue.append(SharedBuffer::create(segment, length)); |
| 52 } |
| 53 |
| 54 MutexLocker locker(m_mutex); |
| 55 |
| 56 // If all data was previously received, don't append more to it. |
| 57 RELEASE_ASSERT(!(m_allDataReceived && newBufferQueue.size())); |
| 58 |
| 59 m_newBufferQueue.appendVector(newBufferQueue); |
| 60 newBufferQueue.clear(); |
| 61 m_allDataReceived = allDataReceived; |
| 62 } |
| 63 |
| 64 void ThreadSafeDataTransport::data(SharedBuffer** buffer, bool* allDataReceived) |
| 65 { |
| 66 ASSERT(buffer); |
| 67 ASSERT(allDataReceived); |
| 68 Vector<RefPtr<SharedBuffer>> newBufferQueue; |
| 69 { |
| 70 MutexLocker lock(m_mutex); |
| 71 m_newBufferQueue.swap(newBufferQueue); |
| 72 *allDataReceived = m_allDataReceived; |
| 73 } |
| 74 for (size_t i = 0; i < newBufferQueue.size(); ++i) |
| 75 m_readBuffer->append(newBufferQueue[i].get()); |
| 76 *buffer = m_readBuffer.get(); |
| 77 } |
| 78 |
| 79 bool ThreadSafeDataTransport::hasNewData() |
| 80 { |
| 81 MutexLocker lock(m_mutex); |
| 82 return !m_newBufferQueue.isEmpty(); |
| 83 } |
| 84 |
| 85 } // namespace blink |
| OLD | NEW |