toolkit/crashreporter/google-breakpad/src/common/memory_unittest.cc@129ffea94266 (annotated)
toolkit/crashreporter/google-breakpad/src/common/memory_unittest.cc
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
| michael@0 | 1 | // Copyright (c) 2009, Google Inc. |
| michael@0 | 2 | // All rights reserved. |
| michael@0 | 3 | // |
| michael@0 | 4 | // Redistribution and use in source and binary forms, with or without |
| michael@0 | 5 | // modification, are permitted provided that the following conditions are |
| michael@0 | 6 | // met: |
| michael@0 | 7 | // |
| michael@0 | 8 | // * Redistributions of source code must retain the above copyright |
| michael@0 | 9 | // notice, this list of conditions and the following disclaimer. |
| michael@0 | 10 | // * Redistributions in binary form must reproduce the above |
| michael@0 | 11 | // copyright notice, this list of conditions and the following disclaimer |
| michael@0 | 12 | // in the documentation and/or other materials provided with the |
| michael@0 | 13 | // distribution. |
| michael@0 | 14 | // * Neither the name of Google Inc. nor the names of its |
| michael@0 | 15 | // contributors may be used to endorse or promote products derived from |
| michael@0 | 16 | // this software without specific prior written permission. |
| michael@0 | 17 | // |
| michael@0 | 18 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| michael@0 | 19 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| michael@0 | 20 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| michael@0 | 21 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| michael@0 | 22 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| michael@0 | 23 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| michael@0 | 24 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| michael@0 | 25 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| michael@0 | 26 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| michael@0 | 27 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| michael@0 | 28 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 29 | |
| michael@0 | 30 | #include "breakpad_googletest_includes.h" |
| michael@0 | 31 | #include "common/memory.h" |
| michael@0 | 32 | |
| michael@0 | 33 | using namespace google_breakpad; |
| michael@0 | 34 | |
| michael@0 | 35 | namespace { |
| michael@0 | 36 | typedef testing::Test PageAllocatorTest; |
| michael@0 | 37 | } |
| michael@0 | 38 | |
| michael@0 | 39 | TEST(PageAllocatorTest, Setup) { |
| michael@0 | 40 | PageAllocator allocator; |
| michael@0 | 41 | } |
| michael@0 | 42 | |
| michael@0 | 43 | TEST(PageAllocatorTest, SmallObjects) { |
| michael@0 | 44 | PageAllocator allocator; |
| michael@0 | 45 | |
| michael@0 | 46 | for (unsigned i = 1; i < 1024; ++i) { |
| michael@0 | 47 | uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i)); |
| michael@0 | 48 | ASSERT_FALSE(p == NULL); |
| michael@0 | 49 | memset(p, 0, i); |
| michael@0 | 50 | } |
| michael@0 | 51 | } |
| michael@0 | 52 | |
| michael@0 | 53 | TEST(PageAllocatorTest, LargeObject) { |
| michael@0 | 54 | PageAllocator allocator; |
| michael@0 | 55 | |
| michael@0 | 56 | uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(10000)); |
| michael@0 | 57 | ASSERT_FALSE(p == NULL); |
| michael@0 | 58 | for (unsigned i = 1; i < 10; ++i) { |
| michael@0 | 59 | uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i)); |
| michael@0 | 60 | ASSERT_FALSE(p == NULL); |
| michael@0 | 61 | memset(p, 0, i); |
| michael@0 | 62 | } |
| michael@0 | 63 | } |
| michael@0 | 64 | |
| michael@0 | 65 | namespace { |
| michael@0 | 66 | typedef testing::Test WastefulVectorTest; |
| michael@0 | 67 | } |
| michael@0 | 68 | |
| michael@0 | 69 | TEST(WastefulVectorTest, Setup) { |
| michael@0 | 70 | PageAllocator allocator_; |
| michael@0 | 71 | wasteful_vector<int> v(&allocator_); |
| michael@0 | 72 | ASSERT_TRUE(v.empty()); |
| michael@0 | 73 | ASSERT_EQ(v.size(), 0u); |
| michael@0 | 74 | } |
| michael@0 | 75 | |
| michael@0 | 76 | TEST(WastefulVectorTest, Simple) { |
| michael@0 | 77 | PageAllocator allocator_; |
| michael@0 | 78 | wasteful_vector<unsigned> v(&allocator_); |
| michael@0 | 79 | |
| michael@0 | 80 | for (unsigned i = 0; i < 256; ++i) { |
| michael@0 | 81 | v.push_back(i); |
| michael@0 | 82 | ASSERT_EQ(i, v.back()); |
| michael@0 | 83 | ASSERT_EQ(&v.back(), &v[i]); |
| michael@0 | 84 | } |
| michael@0 | 85 | ASSERT_FALSE(v.empty()); |
| michael@0 | 86 | ASSERT_EQ(v.size(), 256u); |
| michael@0 | 87 | for (unsigned i = 0; i < 256; ++i) |
| michael@0 | 88 | ASSERT_EQ(v[i], i); |
| michael@0 | 89 | } |
