| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2009 Apple 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 "wtf/typed_arrays/ArrayBuffer.h" | |
| 27 | |
| 28 #include "wtf/RefPtr.h" | |
| 29 #include "wtf/typed_arrays/ArrayBufferView.h" | |
| 30 | |
| 31 namespace WTF { | |
| 32 | |
| 33 bool ArrayBuffer::transfer(ArrayBufferContents& result) { | |
| 34 DCHECK(!isShared()); | |
| 35 RefPtr<ArrayBuffer> keepAlive(this); | |
| 36 | |
| 37 if (!m_contents.data()) { | |
| 38 result.neuter(); | |
| 39 return false; | |
| 40 } | |
| 41 | |
| 42 bool allViewsAreNeuterable = true; | |
| 43 for (ArrayBufferView* i = m_firstView; i; i = i->m_nextView) { | |
| 44 if (!i->isNeuterable()) | |
| 45 allViewsAreNeuterable = false; | |
| 46 } | |
| 47 | |
| 48 if (allViewsAreNeuterable) { | |
| 49 m_contents.transfer(result); | |
| 50 } else { | |
| 51 m_contents.copyTo(result); | |
| 52 if (!result.data()) | |
| 53 return false; | |
| 54 } | |
| 55 | |
| 56 while (m_firstView) { | |
| 57 ArrayBufferView* current = m_firstView; | |
| 58 removeView(current); | |
| 59 if (allViewsAreNeuterable || current->isNeuterable()) | |
| 60 current->neuter(); | |
| 61 } | |
| 62 | |
| 63 m_isNeutered = true; | |
| 64 | |
| 65 return true; | |
| 66 } | |
| 67 | |
| 68 bool ArrayBuffer::shareContentsWith(ArrayBufferContents& result) { | |
| 69 DCHECK(isShared()); | |
| 70 RefPtr<ArrayBuffer> keepAlive(this); | |
| 71 | |
| 72 if (!m_contents.dataShared()) { | |
| 73 result.neuter(); | |
| 74 return false; | |
| 75 } | |
| 76 | |
| 77 m_contents.shareWith(result); | |
| 78 return true; | |
| 79 } | |
| 80 | |
| 81 void ArrayBuffer::addView(ArrayBufferView* view) { | |
| 82 view->m_buffer = this; | |
| 83 view->m_prevView = 0; | |
| 84 view->m_nextView = m_firstView; | |
| 85 if (m_firstView) | |
| 86 m_firstView->m_prevView = view; | |
| 87 m_firstView = view; | |
| 88 } | |
| 89 | |
| 90 void ArrayBuffer::removeView(ArrayBufferView* view) { | |
| 91 DCHECK_EQ(this, view->m_buffer.get()); | |
| 92 if (view->m_nextView) | |
| 93 view->m_nextView->m_prevView = view->m_prevView; | |
| 94 if (view->m_prevView) | |
| 95 view->m_prevView->m_nextView = view->m_nextView; | |
| 96 if (m_firstView == view) | |
| 97 m_firstView = view->m_nextView; | |
| 98 view->m_prevView = view->m_nextView = 0; | |
| 99 } | |
| 100 | |
| 101 } // namespace WTF | |
| OLD | NEW |