mirror of
https://github.com/tomahawk-player/tomahawk.git
synced 2025-08-18 03:41:27 +02:00
* Added breakpad support for Linux.
This commit is contained in:
Christian Muehlhaeuser
196
thirdparty/breakpad/processor/address_map_unittest.cc
vendored
Normal file
196
thirdparty/breakpad/processor/address_map_unittest.cc
vendored
Normal file
@@ -0,0 +1,196 @@
|
||||
// Copyright (c) 2006, 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.
|
||||
|
||||
// address_map_unittest.cc: Unit tests for AddressMap.
|
||||
//
|
||||
// Author: Mark Mentovai
|
||||
|
||||
#include <limits.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include "processor/address_map-inl.h"
|
||||
#include "processor/linked_ptr.h"
|
||||
#include "processor/logging.h"
|
||||
|
||||
#define ASSERT_TRUE(condition) \
|
||||
if (!(condition)) { \
|
||||
fprintf(stderr, "FAIL: %s @ %s:%d\n", #condition, __FILE__, __LINE__); \
|
||||
return false; \
|
||||
}
|
||||
|
||||
#define ASSERT_FALSE(condition) ASSERT_TRUE(!(condition))
|
||||
|
||||
#define ASSERT_EQ(e1, e2) ASSERT_TRUE((e1) == (e2))
|
||||
|
||||
namespace {
|
||||
|
||||
using google_breakpad::AddressMap;
|
||||
using google_breakpad::linked_ptr;
|
||||
|
||||
// A CountedObject holds an int. A global (not thread safe!) count of
|
||||
// allocated CountedObjects is maintained to help test memory management.
|
||||
class CountedObject {
|
||||
public:
|
||||
explicit CountedObject(int id) : id_(id) { ++count_; }
|
||||
~CountedObject() { --count_; }
|
||||
|
||||
static int count() { return count_; }
|
||||
int id() const { return id_; }
|
||||
|
||||
private:
|
||||
static int count_;
|
||||
int id_;
|
||||
};
|
||||
|
||||
int CountedObject::count_;
|
||||
|
||||
typedef int AddressType;
|
||||
typedef AddressMap< AddressType, linked_ptr<CountedObject> > TestMap;
|
||||
|
||||
static bool DoAddressMapTest() {
|
||||
ASSERT_EQ(CountedObject::count(), 0);
|
||||
|
||||
TestMap test_map;
|
||||
linked_ptr<CountedObject> entry;
|
||||
AddressType address;
|
||||
|
||||
// Check that a new map is truly empty.
|
||||
ASSERT_FALSE(test_map.Retrieve(0, &entry, &address));
|
||||
ASSERT_FALSE(test_map.Retrieve(INT_MIN, &entry, &address));
|
||||
ASSERT_FALSE(test_map.Retrieve(INT_MAX, &entry, &address));
|
||||
|
||||
// Check that Clear clears the map without leaking.
|
||||
ASSERT_EQ(CountedObject::count(), 0);
|
||||
ASSERT_TRUE(test_map.Store(1,
|
||||
linked_ptr<CountedObject>(new CountedObject(0))));
|
||||
ASSERT_TRUE(test_map.Retrieve(1, &entry, &address));
|
||||
ASSERT_EQ(CountedObject::count(), 1);
|
||||
test_map.Clear();
|
||||
ASSERT_EQ(CountedObject::count(), 1); // still holding entry in this scope
|
||||
|
||||
// Check that a cleared map is truly empty.
|
||||
ASSERT_FALSE(test_map.Retrieve(0, &entry, &address));
|
||||
ASSERT_FALSE(test_map.Retrieve(INT_MIN, &entry, &address));
|
||||
ASSERT_FALSE(test_map.Retrieve(INT_MAX, &entry, &address));
|
||||
|
||||
// Check a single-element map.
|
||||
ASSERT_TRUE(test_map.Store(10,
|
||||
linked_ptr<CountedObject>(new CountedObject(1))));
|
||||
ASSERT_FALSE(test_map.Retrieve(9, &entry, &address));
|
||||
ASSERT_TRUE(test_map.Retrieve(10, &entry, &address));
|
||||
ASSERT_EQ(CountedObject::count(), 1);
|
||||
ASSERT_EQ(entry->id(), 1);
|
||||
ASSERT_EQ(address, 10);
|
||||
ASSERT_TRUE(test_map.Retrieve(11, &entry, &address));
|
||||
ASSERT_TRUE(test_map.Retrieve(11, &entry, NULL)); // NULL ok here
|
||||
|
||||
// Add some more elements.
|
||||
ASSERT_TRUE(test_map.Store(5,
|
||||
linked_ptr<CountedObject>(new CountedObject(2))));
|
||||
ASSERT_EQ(CountedObject::count(), 2);
|
||||
ASSERT_TRUE(test_map.Store(20,
|
||||
linked_ptr<CountedObject>(new CountedObject(3))));
|
||||
ASSERT_TRUE(test_map.Store(15,
|
||||
linked_ptr<CountedObject>(new CountedObject(4))));
|
||||
ASSERT_FALSE(test_map.Store(10,
|
||||
linked_ptr<CountedObject>(new CountedObject(5)))); // already in map
|
||||
ASSERT_TRUE(test_map.Store(16,
|
||||
linked_ptr<CountedObject>(new CountedObject(6))));
|
||||
ASSERT_TRUE(test_map.Store(14,
|
||||
linked_ptr<CountedObject>(new CountedObject(7))));
|
||||
|
||||
// Nothing was stored with a key under 5. Don't use ASSERT inside loops
|
||||
// because it won't show exactly which key/entry/address failed.
|
||||
for (AddressType key = 0; key < 5; ++key) {
|
||||
if (test_map.Retrieve(key, &entry, &address)) {
|
||||
fprintf(stderr,
|
||||
"FAIL: retrieve %d expected false observed true @ %s:%d\n",
|
||||
key, __FILE__, __LINE__);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
// Check everything that was stored.
|
||||
const int id_verify[] = { 0, 0, 0, 0, 0, // unused
|
||||
2, 2, 2, 2, 2, // 5 - 9
|
||||
1, 1, 1, 1, 7, // 10 - 14
|
||||
4, 6, 6, 6, 6, // 15 - 19
|
||||
3, 3, 3, 3, 3, // 20 - 24
|
||||
3, 3, 3, 3, 3 }; // 25 - 29
|
||||
const AddressType address_verify[] = { 0, 0, 0, 0, 0, // unused
|
||||
5, 5, 5, 5, 5, // 5 - 9
|
||||
10, 10, 10, 10, 14, // 10 - 14
|
||||
15, 16, 16, 16, 16, // 15 - 19
|
||||
20, 20, 20, 20, 20, // 20 - 24
|
||||
20, 20, 20, 20, 20 }; // 25 - 29
|
||||
|
||||
for (AddressType key = 5; key < 30; ++key) {
|
||||
if (!test_map.Retrieve(key, &entry, &address)) {
|
||||
fprintf(stderr,
|
||||
"FAIL: retrieve %d expected true observed false @ %s:%d\n",
|
||||
key, __FILE__, __LINE__);
|
||||
return false;
|
||||
}
|
||||
if (entry->id() != id_verify[key]) {
|
||||
fprintf(stderr,
|
||||
"FAIL: retrieve %d expected entry %d observed %d @ %s:%d\n",
|
||||
key, id_verify[key], entry->id(), __FILE__, __LINE__);
|
||||
return false;
|
||||
}
|
||||
if (address != address_verify[key]) {
|
||||
fprintf(stderr,
|
||||
"FAIL: retrieve %d expected address %d observed %d @ %s:%d\n",
|
||||
key, address_verify[key], address, __FILE__, __LINE__);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
// The stored objects should still be in the map.
|
||||
ASSERT_EQ(CountedObject::count(), 6);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
static bool RunTests() {
|
||||
if (!DoAddressMapTest())
|
||||
return false;
|
||||
|
||||
// Leak check.
|
||||
ASSERT_EQ(CountedObject::count(), 0);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
} // namespace
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
BPLOG_INIT(&argc, &argv);
|
||||
|
||||
return RunTests() ? 0 : 1;
|
||||
}
|
||||
Reference in New Issue
Block a user