1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/toolkit/crashreporter/google-breakpad/src/common/memory_unittest.cc Wed Dec 31 06:09:35 2014 +0100 1.3 @@ -0,0 +1,89 @@ 1.4 +// Copyright (c) 2009, Google Inc. 1.5 +// All rights reserved. 1.6 +// 1.7 +// Redistribution and use in source and binary forms, with or without 1.8 +// modification, are permitted provided that the following conditions are 1.9 +// met: 1.10 +// 1.11 +// * Redistributions of source code must retain the above copyright 1.12 +// notice, this list of conditions and the following disclaimer. 1.13 +// * Redistributions in binary form must reproduce the above 1.14 +// copyright notice, this list of conditions and the following disclaimer 1.15 +// in the documentation and/or other materials provided with the 1.16 +// distribution. 1.17 +// * Neither the name of Google Inc. nor the names of its 1.18 +// contributors may be used to endorse or promote products derived from 1.19 +// this software without specific prior written permission. 1.20 +// 1.21 +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1.22 +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1.23 +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 1.24 +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 1.25 +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 1.26 +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 1.27 +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 1.28 +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 1.29 +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 1.30 +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 1.31 +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 1.32 + 1.33 +#include "breakpad_googletest_includes.h" 1.34 +#include "common/memory.h" 1.35 + 1.36 +using namespace google_breakpad; 1.37 + 1.38 +namespace { 1.39 +typedef testing::Test PageAllocatorTest; 1.40 +} 1.41 + 1.42 +TEST(PageAllocatorTest, Setup) { 1.43 + PageAllocator allocator; 1.44 +} 1.45 + 1.46 +TEST(PageAllocatorTest, SmallObjects) { 1.47 + PageAllocator allocator; 1.48 + 1.49 + for (unsigned i = 1; i < 1024; ++i) { 1.50 + uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i)); 1.51 + ASSERT_FALSE(p == NULL); 1.52 + memset(p, 0, i); 1.53 + } 1.54 +} 1.55 + 1.56 +TEST(PageAllocatorTest, LargeObject) { 1.57 + PageAllocator allocator; 1.58 + 1.59 + uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(10000)); 1.60 + ASSERT_FALSE(p == NULL); 1.61 + for (unsigned i = 1; i < 10; ++i) { 1.62 + uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i)); 1.63 + ASSERT_FALSE(p == NULL); 1.64 + memset(p, 0, i); 1.65 + } 1.66 +} 1.67 + 1.68 +namespace { 1.69 +typedef testing::Test WastefulVectorTest; 1.70 +} 1.71 + 1.72 +TEST(WastefulVectorTest, Setup) { 1.73 + PageAllocator allocator_; 1.74 + wasteful_vector<int> v(&allocator_); 1.75 + ASSERT_TRUE(v.empty()); 1.76 + ASSERT_EQ(v.size(), 0u); 1.77 +} 1.78 + 1.79 +TEST(WastefulVectorTest, Simple) { 1.80 + PageAllocator allocator_; 1.81 + wasteful_vector<unsigned> v(&allocator_); 1.82 + 1.83 + for (unsigned i = 0; i < 256; ++i) { 1.84 + v.push_back(i); 1.85 + ASSERT_EQ(i, v.back()); 1.86 + ASSERT_EQ(&v.back(), &v[i]); 1.87 + } 1.88 + ASSERT_FALSE(v.empty()); 1.89 + ASSERT_EQ(v.size(), 256u); 1.90 + for (unsigned i = 0; i < 256; ++i) 1.91 + ASSERT_EQ(v[i], i); 1.92 +}