| 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 11 matching lines...) Expand all Loading... |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 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 "config.h" | 31 #include "config.h" |
| 32 #include "weborigin/DatabaseIdentifier.h" | 32 #include "platform/weborigin/DatabaseIdentifier.h" |
| 33 | 33 |
| 34 #include "weborigin/KURL.h" | 34 #include "platform/weborigin/KURL.h" |
| 35 #include "weborigin/SecurityOrigin.h" | 35 #include "platform/weborigin/SecurityOrigin.h" |
| 36 #include "wtf/testing/WTFTestHelpers.h" | 36 #include "wtf/testing/WTFTestHelpers.h" |
| 37 | 37 |
| 38 #include <gtest/gtest.h> | 38 #include <gtest/gtest.h> |
| 39 | 39 |
| 40 using WebCore::SecurityOrigin; | 40 using WebCore::SecurityOrigin; |
| 41 using WebCore::createDatabaseIdentifierFromSecurityOrigin; | 41 using WebCore::createDatabaseIdentifierFromSecurityOrigin; |
| 42 using WebCore::createSecurityOriginFromDatabaseIdentifier; | 42 using WebCore::createSecurityOriginFromDatabaseIdentifier; |
| 43 | 43 |
| 44 namespace { | 44 namespace { |
| 45 | 45 |
| (...skipping 207 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 253 | 253 |
| 254 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(bogusIdentifiers); ++i) { | 254 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(bogusIdentifiers); ++i) { |
| 255 RefPtr<SecurityOrigin> origin = createSecurityOriginFromDatabaseIdentifi
er(bogusIdentifiers[i]); | 255 RefPtr<SecurityOrigin> origin = createSecurityOriginFromDatabaseIdentifi
er(bogusIdentifiers[i]); |
| 256 EXPECT_EQ("null", origin->toString()) << "test case " << i; | 256 EXPECT_EQ("null", origin->toString()) << "test case " << i; |
| 257 EXPECT_EQ(true, origin->isUnique()) << "test case " << i; | 257 EXPECT_EQ(true, origin->isUnique()) << "test case " << i; |
| 258 } | 258 } |
| 259 } | 259 } |
| 260 | 260 |
| 261 } // namespace | 261 } // namespace |
| 262 | 262 |
| OLD | NEW |