| 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 "platform/testing/TestingPlatformSupport.h" | |
| 34 #include "public/platform/WebDiscardableMemory.h" | |
| 35 #include "testing/gtest/include/gtest/gtest.h" | 33 #include "testing/gtest/include/gtest/gtest.h" |
| 34 #include "wtf/OwnPtr.h" |
| 35 #include "wtf/PassOwnPtr.h" |
| 36 #include "wtf/RefPtr.h" | 36 #include "wtf/RefPtr.h" |
| 37 #include "wtf/Vector.h" | 37 #include "wtf/Vector.h" |
| 38 #include <algorithm> | 38 #include <algorithm> |
| 39 #include <cstdlib> | 39 #include <cstdlib> |
| 40 | 40 |
| 41 namespace blink { | 41 namespace blink { |
| 42 | 42 |
| 43 TEST(SharedBufferTest, getAsBytes) | 43 TEST(SharedBufferTest, getAsBytes) |
| 44 { | 44 { |
| 45 char testData0[] = "Hello"; | 45 char testData0[] = "Hello"; |
| (...skipping 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 126 // directly return the full size. | 126 // directly return the full size. |
| 127 const char* data; | 127 const char* data; |
| 128 ASSERT_EQ(length, sharedBuffer->getSomeData(data, static_cast<size_t>(0u))); | 128 ASSERT_EQ(length, sharedBuffer->getSomeData(data, static_cast<size_t>(0u))); |
| 129 } | 129 } |
| 130 | 130 |
| 131 TEST(SharedBufferTest, createPurgeable) | 131 TEST(SharedBufferTest, createPurgeable) |
| 132 { | 132 { |
| 133 Vector<char> testData(30000); | 133 Vector<char> testData(30000); |
| 134 std::generate(testData.begin(), testData.end(), &std::rand); | 134 std::generate(testData.begin(), testData.end(), &std::rand); |
| 135 | 135 |
| 136 TestingPlatformSupport::Config config; | |
| 137 config.hasDiscardableMemorySupport = true; | |
| 138 TestingPlatformSupport platformWithDiscardableMemorySupport(config); | |
| 139 | |
| 140 size_t length = testData.size(); | 136 size_t length = testData.size(); |
| 141 RefPtr<SharedBuffer> sharedBuffer = SharedBuffer::createPurgeable(testData.d
ata(), length); | 137 RefPtr<SharedBuffer> sharedBuffer = SharedBuffer::createPurgeable(testData.d
ata(), length); |
| 142 ASSERT_EQ(length, sharedBuffer->size()); | 138 ASSERT_EQ(length, sharedBuffer->size()); |
| 143 // Merge the segments into a single vector. | 139 // Merge the segments into a single vector. |
| 144 const char* data = sharedBuffer->data(); | 140 const char* data = sharedBuffer->data(); |
| 145 ASSERT_EQ(0, memcmp(data, testData.data(), length)); | 141 ASSERT_EQ(0, memcmp(data, testData.data(), length)); |
| 146 | 142 |
| 147 // Do another append + merge the segments again. | 143 // Do another append + merge the segments again. |
| 148 size_t previousTestDataSize = testData.size(); | 144 size_t previousTestDataSize = testData.size(); |
| 149 testData.resize(2 * previousTestDataSize); | 145 testData.resize(2 * previousTestDataSize); |
| 150 std::generate(testData.begin() + previousTestDataSize, testData.end(), &std:
:rand); | 146 std::generate(testData.begin() + previousTestDataSize, testData.end(), &std:
:rand); |
| 151 sharedBuffer->append(testData.data() + previousTestDataSize, previousTestDat
aSize); | 147 sharedBuffer->append(testData.data() + previousTestDataSize, previousTestDat
aSize); |
| 152 ASSERT_EQ(0, memcmp(data, testData.data(), length)); | 148 ASSERT_EQ(0, memcmp(data, testData.data(), length)); |
| 153 } | 149 } |
| 154 | 150 |
| 155 } // namespace blink | 151 } // namespace blink |
| OLD | NEW |