michael@0: // Copyright (c) 2009, Google Inc.
michael@0: // All rights reserved.
michael@0: //
michael@0: // Redistribution and use in source and binary forms, with or without
michael@0: // modification, are permitted provided that the following conditions are
michael@0: // met:
michael@0: //
michael@0: //     * Redistributions of source code must retain the above copyright
michael@0: // notice, this list of conditions and the following disclaimer.
michael@0: //     * Redistributions in binary form must reproduce the above
michael@0: // copyright notice, this list of conditions and the following disclaimer
michael@0: // in the documentation and/or other materials provided with the
michael@0: // distribution.
michael@0: //     * Neither the name of Google Inc. nor the names of its
michael@0: // contributors may be used to endorse or promote products derived from
michael@0: // this software without specific prior written permission.
michael@0: //
michael@0: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
michael@0: // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
michael@0: // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
michael@0: // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
michael@0: // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
michael@0: // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
michael@0: // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
michael@0: // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
michael@0: // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0: // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0: // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0: 
michael@0: #include "breakpad_googletest_includes.h"
michael@0: #include "common/memory.h"
michael@0: 
michael@0: using namespace google_breakpad;
michael@0: 
michael@0: namespace {
michael@0: typedef testing::Test PageAllocatorTest;
michael@0: }
michael@0: 
michael@0: TEST(PageAllocatorTest, Setup) {
michael@0:   PageAllocator allocator;
michael@0: }
michael@0: 
michael@0: TEST(PageAllocatorTest, SmallObjects) {
michael@0:   PageAllocator allocator;
michael@0: 
michael@0:   for (unsigned i = 1; i < 1024; ++i) {
michael@0:     uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i));
michael@0:     ASSERT_FALSE(p == NULL);
michael@0:     memset(p, 0, i);
michael@0:   }
michael@0: }
michael@0: 
michael@0: TEST(PageAllocatorTest, LargeObject) {
michael@0:   PageAllocator allocator;
michael@0: 
michael@0:   uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(10000));
michael@0:   ASSERT_FALSE(p == NULL);
michael@0:   for (unsigned i = 1; i < 10; ++i) {
michael@0:     uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i));
michael@0:     ASSERT_FALSE(p == NULL);
michael@0:     memset(p, 0, i);
michael@0:   }
michael@0: }
michael@0: 
michael@0: namespace {
michael@0: typedef testing::Test WastefulVectorTest;
michael@0: }
michael@0: 
michael@0: TEST(WastefulVectorTest, Setup) {
michael@0:   PageAllocator allocator_;
michael@0:   wasteful_vector<int> v(&allocator_);
michael@0:   ASSERT_TRUE(v.empty());
michael@0:   ASSERT_EQ(v.size(), 0u);
michael@0: }
michael@0: 
michael@0: TEST(WastefulVectorTest, Simple) {
michael@0:   PageAllocator allocator_;
michael@0:   wasteful_vector<unsigned> v(&allocator_);
michael@0: 
michael@0:   for (unsigned i = 0; i < 256; ++i) {
michael@0:     v.push_back(i);
michael@0:     ASSERT_EQ(i, v.back());
michael@0:     ASSERT_EQ(&v.back(), &v[i]);
michael@0:   }
michael@0:   ASSERT_FALSE(v.empty());
michael@0:   ASSERT_EQ(v.size(), 256u);
michael@0:   for (unsigned i = 0; i < 256; ++i)
michael@0:     ASSERT_EQ(v[i], i);
michael@0: }