| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "platform/SharedBuffer.h" | 31 #include "platform/SharedBuffer.h" |
| 32 | 32 |
| 33 #include <algorithm> |
| 34 #include <cstdlib> |
| 35 #include <memory> |
| 33 #include "testing/gtest/include/gtest/gtest.h" | 36 #include "testing/gtest/include/gtest/gtest.h" |
| 34 #include "wtf/PtrUtil.h" | 37 #include "wtf/PtrUtil.h" |
| 35 #include "wtf/RefPtr.h" | 38 #include "wtf/RefPtr.h" |
| 36 #include "wtf/Vector.h" | 39 #include "wtf/Vector.h" |
| 37 #include <algorithm> | |
| 38 #include <cstdlib> | |
| 39 #include <memory> | |
| 40 | 40 |
| 41 namespace blink { | 41 namespace blink { |
| 42 | 42 |
| 43 TEST(SharedBufferTest, getAsBytes) { | 43 TEST(SharedBufferTest, getAsBytes) { |
| 44 char testData0[] = "Hello"; | 44 char testData0[] = "Hello"; |
| 45 char testData1[] = "World"; | 45 char testData1[] = "World"; |
| 46 char testData2[] = "Goodbye"; | 46 char testData2[] = "Goodbye"; |
| 47 | 47 |
| 48 RefPtr<SharedBuffer> sharedBuffer = | 48 RefPtr<SharedBuffer> sharedBuffer = |
| 49 SharedBuffer::create(testData0, strlen(testData0)); | 49 SharedBuffer::create(testData0, strlen(testData0)); |
| (...skipping 97 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 147 RefPtr<SharedBuffer> sharedBuffer = SharedBuffer::create(length); | 147 RefPtr<SharedBuffer> sharedBuffer = SharedBuffer::create(length); |
| 148 ASSERT_EQ(length, sharedBuffer->size()); | 148 ASSERT_EQ(length, sharedBuffer->size()); |
| 149 | 149 |
| 150 // The internal flat buffer should have been resized to |length| therefore | 150 // The internal flat buffer should have been resized to |length| therefore |
| 151 // getSomeData() should directly return the full size. | 151 // getSomeData() should directly return the full size. |
| 152 const char* data; | 152 const char* data; |
| 153 ASSERT_EQ(length, sharedBuffer->getSomeData(data, static_cast<size_t>(0u))); | 153 ASSERT_EQ(length, sharedBuffer->getSomeData(data, static_cast<size_t>(0u))); |
| 154 } | 154 } |
| 155 | 155 |
| 156 } // namespace blink | 156 } // namespace blink |
| OLD | NEW |