| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2013 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 are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 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. | |
| 29 */ | |
| 30 | |
| 31 #include "wtf/typed_arrays/ArrayBufferBuilder.h" | |
| 32 | |
| 33 #include "testing/gtest/include/gtest/gtest.h" | |
| 34 #include "wtf/Assertions.h" | |
| 35 #include <limits.h> | |
| 36 #include <string.h> | |
| 37 | |
| 38 namespace WTF { | |
| 39 | |
| 40 TEST(ArrayBufferBuilderTest, Constructor) { | |
| 41 ArrayBufferBuilder zeroBuilder(0); | |
| 42 EXPECT_EQ(0u, zeroBuilder.byteLength()); | |
| 43 EXPECT_EQ(0u, zeroBuilder.capacity()); | |
| 44 | |
| 45 ArrayBufferBuilder smallBuilder(1024); | |
| 46 EXPECT_EQ(0u, zeroBuilder.byteLength()); | |
| 47 EXPECT_EQ(1024u, smallBuilder.capacity()); | |
| 48 | |
| 49 ArrayBufferBuilder bigBuilder(2048); | |
| 50 EXPECT_EQ(0u, zeroBuilder.byteLength()); | |
| 51 EXPECT_EQ(2048u, bigBuilder.capacity()); | |
| 52 } | |
| 53 | |
| 54 TEST(ArrayBufferBuilderTest, Append) { | |
| 55 const char data[] = "HelloWorld"; | |
| 56 size_t dataSize = sizeof(data) - 1; | |
| 57 | |
| 58 ArrayBufferBuilder builder(2 * dataSize); | |
| 59 | |
| 60 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 61 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 62 EXPECT_EQ(dataSize * 2, builder.capacity()); | |
| 63 | |
| 64 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 65 EXPECT_EQ(dataSize * 2, builder.byteLength()); | |
| 66 EXPECT_EQ(dataSize * 2, builder.capacity()); | |
| 67 | |
| 68 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 69 EXPECT_EQ(dataSize * 3, builder.byteLength()); | |
| 70 EXPECT_GE(builder.capacity(), dataSize * 3); | |
| 71 } | |
| 72 | |
| 73 TEST(ArrayBufferBuilderTest, AppendRepeatedly) { | |
| 74 const char data[] = "HelloWorld"; | |
| 75 size_t dataSize = sizeof(data) - 1; | |
| 76 | |
| 77 ArrayBufferBuilder builder(37); // Some number coprime with dataSize. | |
| 78 | |
| 79 for (size_t i = 1; i < 1000U; ++i) { | |
| 80 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 81 EXPECT_EQ(dataSize * i, builder.byteLength()); | |
| 82 EXPECT_GE(builder.capacity(), dataSize * i); | |
| 83 } | |
| 84 } | |
| 85 | |
| 86 TEST(ArrayBufferBuilderTest, DefaultConstructorAndAppendRepeatedly) { | |
| 87 const char data[] = "HelloWorld"; | |
| 88 size_t dataSize = sizeof(data) - 1; | |
| 89 | |
| 90 ArrayBufferBuilder builder; | |
| 91 | |
| 92 for (size_t i = 1; i < 4000U; ++i) { | |
| 93 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 94 EXPECT_EQ(dataSize * i, builder.byteLength()); | |
| 95 EXPECT_GE(builder.capacity(), dataSize * i); | |
| 96 } | |
| 97 } | |
| 98 | |
| 99 TEST(ArrayBufferBuilderTest, AppendFixedCapacity) { | |
| 100 const char data[] = "HelloWorld"; | |
| 101 size_t dataSize = sizeof(data) - 1; | |
| 102 | |
| 103 ArrayBufferBuilder builder(15); | |
| 104 builder.setVariableCapacity(false); | |
| 105 | |
| 106 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 107 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 108 EXPECT_EQ(15u, builder.capacity()); | |
| 109 | |
| 110 EXPECT_EQ(5u, builder.append(data, dataSize)); | |
| 111 EXPECT_EQ(15u, builder.byteLength()); | |
| 112 EXPECT_EQ(15u, builder.capacity()); | |
| 113 | |
| 114 EXPECT_EQ(0u, builder.append(data, dataSize)); | |
| 115 EXPECT_EQ(15u, builder.byteLength()); | |
| 116 EXPECT_EQ(15u, builder.capacity()); | |
| 117 } | |
| 118 | |
| 119 TEST(ArrayBufferBuilderTest, ToArrayBuffer) { | |
| 120 const char data1[] = "HelloWorld"; | |
| 121 size_t data1Size = sizeof(data1) - 1; | |
| 122 | |
| 123 const char data2[] = "GoodbyeWorld"; | |
| 124 size_t data2Size = sizeof(data2) - 1; | |
| 125 | |
| 126 ArrayBufferBuilder builder(1024); | |
| 127 builder.append(data1, data1Size); | |
| 128 builder.append(data2, data2Size); | |
| 129 | |
| 130 const char expected[] = "HelloWorldGoodbyeWorld"; | |
| 131 size_t expectedSize = sizeof(expected) - 1; | |
| 132 | |
| 133 RefPtr<ArrayBuffer> result = builder.toArrayBuffer(); | |
| 134 ASSERT_EQ(data1Size + data2Size, result->byteLength()); | |
| 135 ASSERT_EQ(expectedSize, result->byteLength()); | |
| 136 EXPECT_EQ(0, memcmp(expected, result->data(), expectedSize)); | |
| 137 } | |
| 138 | |
| 139 TEST(ArrayBufferBuilderTest, ToArrayBufferSameAddressIfExactCapacity) { | |
| 140 const char data[] = "HelloWorld"; | |
| 141 size_t dataSize = sizeof(data) - 1; | |
| 142 | |
| 143 ArrayBufferBuilder builder(dataSize); | |
| 144 builder.append(data, dataSize); | |
| 145 | |
| 146 RefPtr<ArrayBuffer> result1 = builder.toArrayBuffer(); | |
| 147 RefPtr<ArrayBuffer> result2 = builder.toArrayBuffer(); | |
| 148 EXPECT_EQ(result1.get(), result2.get()); | |
| 149 } | |
| 150 | |
| 151 TEST(ArrayBufferBuilderTest, ToString) { | |
| 152 const char data1[] = "HelloWorld"; | |
| 153 size_t data1Size = sizeof(data1) - 1; | |
| 154 | |
| 155 const char data2[] = "GoodbyeWorld"; | |
| 156 size_t data2Size = sizeof(data2) - 1; | |
| 157 | |
| 158 ArrayBufferBuilder builder(1024); | |
| 159 builder.append(data1, data1Size); | |
| 160 builder.append(data2, data2Size); | |
| 161 | |
| 162 const char expected[] = "HelloWorldGoodbyeWorld"; | |
| 163 size_t expectedSize = sizeof(expected) - 1; | |
| 164 | |
| 165 String result = builder.toString(); | |
| 166 EXPECT_EQ(expectedSize, result.length()); | |
| 167 for (unsigned i = 0; i < result.length(); ++i) | |
| 168 EXPECT_EQ(expected[i], result[i]); | |
| 169 } | |
| 170 | |
| 171 TEST(ArrayBufferBuilderTest, ShrinkToFitNoAppend) { | |
| 172 ArrayBufferBuilder builder(1024); | |
| 173 EXPECT_EQ(1024u, builder.capacity()); | |
| 174 builder.shrinkToFit(); | |
| 175 EXPECT_EQ(0u, builder.byteLength()); | |
| 176 EXPECT_EQ(0u, builder.capacity()); | |
| 177 } | |
| 178 | |
| 179 TEST(ArrayBufferBuilderTest, ShrinkToFit) { | |
| 180 const char data[] = "HelloWorld"; | |
| 181 size_t dataSize = sizeof(data) - 1; | |
| 182 | |
| 183 ArrayBufferBuilder builder(32); | |
| 184 | |
| 185 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 186 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 187 EXPECT_EQ(32u, builder.capacity()); | |
| 188 | |
| 189 builder.shrinkToFit(); | |
| 190 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 191 EXPECT_EQ(dataSize, builder.capacity()); | |
| 192 } | |
| 193 | |
| 194 TEST(ArrayBufferBuilderTest, ShrinkToFitFullyUsed) { | |
| 195 const char data[] = "HelloWorld"; | |
| 196 size_t dataSize = sizeof(data) - 1; | |
| 197 | |
| 198 ArrayBufferBuilder builder(dataSize); | |
| 199 const void* internalAddress = builder.data(); | |
| 200 | |
| 201 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 202 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 203 EXPECT_EQ(dataSize, builder.capacity()); | |
| 204 | |
| 205 builder.shrinkToFit(); | |
| 206 // Reallocation should not happen. | |
| 207 EXPECT_EQ(internalAddress, builder.data()); | |
| 208 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 209 EXPECT_EQ(dataSize, builder.capacity()); | |
| 210 } | |
| 211 | |
| 212 TEST(ArrayBufferBuilderTest, ShrinkToFitAfterGrowth) { | |
| 213 const char data[] = "HelloWorld"; | |
| 214 size_t dataSize = sizeof(data) - 1; | |
| 215 | |
| 216 ArrayBufferBuilder builder(5); | |
| 217 | |
| 218 EXPECT_EQ(dataSize, builder.append(data, dataSize)); | |
| 219 EXPECT_GE(builder.capacity(), dataSize); | |
| 220 builder.shrinkToFit(); | |
| 221 EXPECT_EQ(dataSize, builder.byteLength()); | |
| 222 EXPECT_EQ(dataSize, builder.capacity()); | |
| 223 } | |
| 224 | |
| 225 } // namespace WTF | |
| OLD | NEW |