aboutsummaryrefslogtreecommitdiff
path: root/src/processor/contained_range_map_unittest.cc
diff options
context:
space:
mode:
authormmentovai <mmentovai@4c0a9323-5329-0410-9bdc-e9ce6186880e>2006-09-20 16:20:15 +0000
committermmentovai <mmentovai@4c0a9323-5329-0410-9bdc-e9ce6186880e>2006-09-20 16:20:15 +0000
commit8c2a4def4ecfbf6293b27eff4359a274e9774b4e (patch)
treee9027ac626e3dcb71d8eb2cae4629ba492d8320b /src/processor/contained_range_map_unittest.cc
parentAdd ppc types to minidump_format.h (#25). r=waylonis (diff)
downloadbreakpad-8c2a4def4ecfbf6293b27eff4359a274e9774b4e.tar.xz
Handle frame pointer omission (#21), part 1: ContainedRangeMap. r=bryner.
- ContainedRangeMap is the data structure that will be used to store and look up debugging information for frames by instruction address. The debugging information includes a way to locate the calling frame in the absence of a saved frame pointer. - Restructure RangeMap into an -inl file to match ContainedRangeMap. http://groups.google.com/group/airbag-dev/browse_thread/thread/c5823bfc1828ed42 git-svn-id: http://google-breakpad.googlecode.com/svn/trunk@29 4c0a9323-5329-0410-9bdc-e9ce6186880e
Diffstat (limited to 'src/processor/contained_range_map_unittest.cc')
-rw-r--r--src/processor/contained_range_map_unittest.cc238
1 files changed, 238 insertions, 0 deletions
diff --git a/src/processor/contained_range_map_unittest.cc b/src/processor/contained_range_map_unittest.cc
new file mode 100644
index 00000000..ad918499
--- /dev/null
+++ b/src/processor/contained_range_map_unittest.cc
@@ -0,0 +1,238 @@
+// Copyright (C) 2006 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+// http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+// contained_range_map_unittest.cc: Unit tests for ContainedRangeMap
+//
+// Author: Mark Mentovai
+
+#include <cstdio>
+
+#include "processor/contained_range_map-inl.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))
+
+
+using google_airbag::ContainedRangeMap;
+
+
+static bool RunTests() {
+ ContainedRangeMap<unsigned int, int> crm;
+
+ // First, do the StoreRange tests. This validates the containment
+ // rules.
+ ASSERT_TRUE (crm.StoreRange(10, 10, 1));
+ ASSERT_FALSE(crm.StoreRange(10, 10, 2)); // exactly equal to 1
+ ASSERT_FALSE(crm.StoreRange(11, 10, 3)); // begins inside 1 and extends up
+ ASSERT_FALSE(crm.StoreRange( 9, 10, 4)); // begins below 1 and ends inside
+ ASSERT_TRUE (crm.StoreRange(11, 9, 5)); // contained by existing
+ ASSERT_TRUE (crm.StoreRange(12, 7, 6));
+ ASSERT_TRUE (crm.StoreRange( 9, 12, 7)); // contains existing
+ ASSERT_TRUE (crm.StoreRange( 9, 13, 8));
+ ASSERT_TRUE (crm.StoreRange( 8, 14, 9));
+ ASSERT_TRUE (crm.StoreRange(30, 3, 10));
+ ASSERT_TRUE (crm.StoreRange(33, 3, 11));
+ ASSERT_TRUE (crm.StoreRange(30, 6, 12)); // storable but totally masked
+ ASSERT_TRUE (crm.StoreRange(40, 8, 13)); // will be totally masked
+ ASSERT_TRUE (crm.StoreRange(40, 4, 14));
+ ASSERT_TRUE (crm.StoreRange(44, 4, 15));
+ ASSERT_FALSE(crm.StoreRange(32, 10, 16)); // begins in #10, ends in #14
+ ASSERT_FALSE(crm.StoreRange(50, 0, 17)); // zero length
+ ASSERT_TRUE (crm.StoreRange(50, 10, 18));
+ ASSERT_TRUE (crm.StoreRange(50, 1, 19));
+ ASSERT_TRUE (crm.StoreRange(59, 1, 20));
+ ASSERT_TRUE (crm.StoreRange(60, 1, 21));
+ ASSERT_TRUE (crm.StoreRange(69, 1, 22));
+ ASSERT_TRUE (crm.StoreRange(60, 10, 23));
+ ASSERT_TRUE (crm.StoreRange(68, 1, 24));
+ ASSERT_TRUE (crm.StoreRange(61, 1, 25));
+ ASSERT_TRUE (crm.StoreRange(61, 8, 26));
+ ASSERT_FALSE(crm.StoreRange(59, 9, 27));
+ ASSERT_FALSE(crm.StoreRange(59, 10, 28));
+ ASSERT_FALSE(crm.StoreRange(59, 11, 29));
+ ASSERT_TRUE (crm.StoreRange(70, 10, 30));
+ ASSERT_TRUE (crm.StoreRange(74, 2, 31));
+ ASSERT_TRUE (crm.StoreRange(77, 2, 32));
+ ASSERT_FALSE(crm.StoreRange(72, 6, 33));
+ ASSERT_TRUE (crm.StoreRange(80, 3, 34));
+ ASSERT_TRUE (crm.StoreRange(81, 1, 35));
+ ASSERT_TRUE (crm.StoreRange(82, 1, 36));
+ ASSERT_TRUE (crm.StoreRange(83, 3, 37));
+ ASSERT_TRUE (crm.StoreRange(84, 1, 38));
+ ASSERT_TRUE (crm.StoreRange(83, 1, 39));
+ ASSERT_TRUE (crm.StoreRange(86, 5, 40));
+ ASSERT_TRUE (crm.StoreRange(88, 1, 41));
+ ASSERT_TRUE (crm.StoreRange(90, 1, 42));
+ ASSERT_TRUE (crm.StoreRange(86, 1, 43));
+ ASSERT_TRUE (crm.StoreRange(87, 1, 44));
+ ASSERT_TRUE (crm.StoreRange(89, 1, 45));
+ ASSERT_TRUE (crm.StoreRange(87, 4, 46));
+ ASSERT_TRUE (crm.StoreRange(87, 3, 47));
+ ASSERT_FALSE(crm.StoreRange(86, 2, 48));
+
+ // Each element in test_data contains the expected result when calling
+ // RetrieveRange on an address.
+ const int test_data[] = {
+ 0, // 0
+ 0, // 1
+ 0, // 2
+ 0, // 3
+ 0, // 4
+ 0, // 5
+ 0, // 6
+ 0, // 7
+ 9, // 8
+ 7, // 9
+ 1, // 10
+ 5, // 11
+ 6, // 12
+ 6, // 13
+ 6, // 14
+ 6, // 15
+ 6, // 16
+ 6, // 17
+ 6, // 18
+ 5, // 19
+ 7, // 20
+ 8, // 21
+ 0, // 22
+ 0, // 23
+ 0, // 24
+ 0, // 25
+ 0, // 26
+ 0, // 27
+ 0, // 28
+ 0, // 29
+ 10, // 30
+ 10, // 31
+ 10, // 32
+ 11, // 33
+ 11, // 34
+ 11, // 35
+ 0, // 36
+ 0, // 37
+ 0, // 38
+ 0, // 39
+ 14, // 40
+ 14, // 41
+ 14, // 42
+ 14, // 43
+ 15, // 44
+ 15, // 45
+ 15, // 46
+ 15, // 47
+ 0, // 48
+ 0, // 49
+ 19, // 50
+ 18, // 51
+ 18, // 52
+ 18, // 53
+ 18, // 54
+ 18, // 55
+ 18, // 56
+ 18, // 57
+ 18, // 58
+ 20, // 59
+ 21, // 60
+ 25, // 61
+ 26, // 62
+ 26, // 63
+ 26, // 64
+ 26, // 65
+ 26, // 66
+ 26, // 67
+ 24, // 68
+ 22, // 69
+ 30, // 70
+ 30, // 71
+ 30, // 72
+ 30, // 73
+ 31, // 74
+ 31, // 75
+ 30, // 76
+ 32, // 77
+ 32, // 78
+ 30, // 79
+ 34, // 80
+ 35, // 81
+ 36, // 82
+ 39, // 83
+ 38, // 84
+ 37, // 85
+ 43, // 86
+ 44, // 87
+ 41, // 88
+ 45, // 89
+ 42, // 90
+ 0, // 91
+ 0, // 92
+ 0, // 93
+ 0, // 94
+ 0, // 95
+ 0, // 96
+ 0, // 97
+ 0, // 98
+ 0 // 99
+ };
+ unsigned int test_high = sizeof(test_data) / sizeof(int);
+
+ // Now, do the RetrieveRange tests. This further validates that the
+ // objects were stored properly and that retrieval returns the correct
+ // object.
+ // If GENERATE_TEST_DATA is defined, instead of the retrieval tests, a
+ // new test_data array will be printed. Exercise caution when doing this.
+ // Be sure to verify the results manually!
+#ifdef GENERATE_TEST_DATA
+ printf(" const int test_data[] = {\n");
+#endif // GENERATE_TEST_DATA
+
+ for (unsigned int address = 0; address < test_high; ++address) {
+ int value;
+ if (!crm.RetrieveRange(address, &value))
+ value = 0;
+
+#ifndef GENERATE_TEST_DATA
+ // Don't use ASSERT inside the loop because it won't show the failed
+ // |address|, and the line number will always be the same. That makes
+ // it difficult to figure out which test failed.
+ if (value != test_data[address]) {
+ fprintf(stderr, "FAIL: retrieve %d expected %d observed %d @ %s:%d\n",
+ address, test_data[address], value, __FILE__, __LINE__);
+ return false;
+ }
+#else // !GENERATE_TEST_DATA
+ printf(" %d%c%s // %d\n", value,
+ address == test_high - 1 ? ' ' : ',',
+ value < 10 ? " " : "",
+ address);
+#endif // !GENERATE_TEST_DATA
+ }
+
+#ifdef GENERATE_TEST_DATA
+ printf(" };\n");
+#endif // GENERATE_TEST_DATA
+
+ return true;
+}
+
+
+int main(int argc, char **argv) {
+ return RunTests() ? 0 : 1;
+}