mirror of
https://github.com/yuzu-mirror/breakpad.git
synced 2026-01-30 20:14:16 +01:00
6c8f80aa8b
This preserves full build ids in minidumps, which are useful for tracking down the right version of system libraries from Linux distributions. The default build id produced by GNU binutils' ld is a 160-bit SHA-1 hash of some parts of the binary, which is exactly 20 bytes: https://sourceware.org/binutils/docs-2.26/ld/Options.html#index-g_t_002d_002dbuild_002did-292 The bulk of the changes here are to change the signatures of the FileID methods to use a wasteful_vector instead of raw pointers, since build ids can be of arbitrary length. The previous change that added support for this in the processor code preserved the return value of `Minidump::debug_identifier()` as the current `GUID+age` treatment for backwards-compatibility, and exposed the full build id from `Minidump::code_identifier()`, which was previously stubbed out for Linux dumps. This change keeps the debug ID in the `dump_syms` output the same to match. R=mark@chromium.org, thestig@chromium.org BUG= Review URL: https://codereview.chromium.org/1688743002 .
125 lines
3.9 KiB
C++
125 lines
3.9 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 "breakpad_googletest_includes.h"
|
|
#include "common/memory.h"
|
|
|
|
using namespace google_breakpad;
|
|
|
|
namespace {
|
|
typedef testing::Test PageAllocatorTest;
|
|
}
|
|
|
|
TEST(PageAllocatorTest, Setup) {
|
|
PageAllocator allocator;
|
|
EXPECT_EQ(0, allocator.pages_allocated());
|
|
}
|
|
|
|
TEST(PageAllocatorTest, SmallObjects) {
|
|
PageAllocator allocator;
|
|
|
|
EXPECT_EQ(0, allocator.pages_allocated());
|
|
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;
|
|
|
|
EXPECT_EQ(0, allocator.pages_allocated());
|
|
uint8_t *p = reinterpret_cast<uint8_t*>(allocator.Alloc(10000));
|
|
ASSERT_FALSE(p == NULL);
|
|
EXPECT_EQ(3, allocator.pages_allocated());
|
|
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_;
|
|
EXPECT_EQ(0, allocator_.pages_allocated());
|
|
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);
|
|
EXPECT_EQ(1, allocator_.pages_allocated());
|
|
for (unsigned i = 0; i < 256; ++i)
|
|
ASSERT_EQ(v[i], i);
|
|
}
|
|
|
|
TEST(WastefulVectorTest, UsesPageAllocator) {
|
|
PageAllocator allocator_;
|
|
wasteful_vector<unsigned> v(&allocator_);
|
|
EXPECT_EQ(1, allocator_.pages_allocated());
|
|
|
|
v.push_back(1);
|
|
ASSERT_TRUE(allocator_.OwnsPointer(&v[0]));
|
|
}
|
|
|
|
TEST(WastefulVectorTest, AutoWastefulVector) {
|
|
PageAllocator allocator_;
|
|
EXPECT_EQ(0, allocator_.pages_allocated());
|
|
|
|
auto_wasteful_vector<unsigned, 4> v(&allocator_);
|
|
EXPECT_EQ(0, allocator_.pages_allocated());
|
|
|
|
v.push_back(1);
|
|
EXPECT_EQ(0, allocator_.pages_allocated());
|
|
EXPECT_FALSE(allocator_.OwnsPointer(&v[0]));
|
|
|
|
v.resize(4);
|
|
EXPECT_EQ(0, allocator_.pages_allocated());
|
|
EXPECT_FALSE(allocator_.OwnsPointer(&v[0]));
|
|
|
|
v.resize(10);
|
|
EXPECT_EQ(1, allocator_.pages_allocated());
|
|
EXPECT_TRUE(allocator_.OwnsPointer(&v[0]));
|
|
}
|