mirror of
https://github.com/yuzu-emu/breakpad.git
synced 2025-11-12 15:54:50 +00:00
577304f02a
This patch is part of a bigger patch that helps merging the breakpad code with the modified version in Chromium OS. Specifically, this patch makes the following changes: 1. Add two convenient methods, back() and empty(), to the wasteful_vector class. 2. Refactor the LinuxDumper class such that it can later be splitted into a base class and two derived classes, one uses the current ptrace implementation and one uses a core file. 3. Refactor the MinidumpWriter class such that it can later use different derived implementations of LinuxDumper. BUG=455 TEST=Tested the following: 1. Build on 32-bit and 64-bit Linux with gcc 4.4.3 and gcc 4.6. 2. Build on Mac OS X 10.6.8 with gcc 4.2 and clang 3.0 (with latest gmock). 3. All unit tests pass. Review URL: http://breakpad.appspot.com/340001 git-svn-id: http://google-breakpad.googlecode.com/svn/trunk@902 4c0a9323-5329-0410-9bdc-e9ce6186880e
90 lines
2.8 KiB
C++
90 lines
2.8 KiB
C++
// Copyright (c) 2009, Google Inc.
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following disclaimer
|
|
// in the documentation and/or other materials provided with the
|
|
// distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived from
|
|
// this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#include "common/memory.h"
|
|
#include "testing/gtest/include/gtest/gtest.h"
|
|
|
|
using namespace google_breakpad;
|
|
|
|
namespace {
|
|
typedef testing::Test PageAllocatorTest;
|
|
}
|
|
|
|
TEST(PageAllocatorTest, Setup) {
|
|
PageAllocator allocator;
|
|
}
|
|
|
|
TEST(PageAllocatorTest, SmallObjects) {
|
|
PageAllocator allocator;
|
|
|
|
for (unsigned i = 1; i < 1024; ++i) {
|
|
uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i));
|
|
ASSERT_FALSE(p == NULL);
|
|
memset(p, 0, i);
|
|
}
|
|
}
|
|
|
|
TEST(PageAllocatorTest, LargeObject) {
|
|
PageAllocator allocator;
|
|
|
|
uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(10000));
|
|
ASSERT_FALSE(p == NULL);
|
|
for (unsigned i = 1; i < 10; ++i) {
|
|
uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(i));
|
|
ASSERT_FALSE(p == NULL);
|
|
memset(p, 0, i);
|
|
}
|
|
}
|
|
|
|
namespace {
|
|
typedef testing::Test WastefulVectorTest;
|
|
}
|
|
|
|
TEST(WastefulVectorTest, Setup) {
|
|
PageAllocator allocator_;
|
|
wasteful_vector<int> v(&allocator_);
|
|
ASSERT_TRUE(v.empty());
|
|
ASSERT_EQ(v.size(), 0u);
|
|
}
|
|
|
|
TEST(WastefulVectorTest, Simple) {
|
|
PageAllocator allocator_;
|
|
wasteful_vector<unsigned> v(&allocator_);
|
|
|
|
for (unsigned i = 0; i < 256; ++i) {
|
|
v.push_back(i);
|
|
ASSERT_EQ(i, v.back());
|
|
ASSERT_EQ(&v.back(), &v[i]);
|
|
}
|
|
ASSERT_FALSE(v.empty());
|
|
ASSERT_EQ(v.size(), 256u);
|
|
for (unsigned i = 0; i < 256; ++i)
|
|
ASSERT_EQ(v[i], i);
|
|
}
|