orderfile_call_graph_instrumentation_perftest.cc 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155
  1. // Copyright 2019 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include "base/android/orderfile/orderfile_instrumentation.h"
  5. #include <thread>
  6. #include "base/android/library_loader/anchor_functions.h"
  7. #include "base/strings/stringprintf.h"
  8. #include "base/time/time.h"
  9. #include "testing/gtest/include/gtest/gtest.h"
  10. #include "testing/perf/perf_test.h"
  11. namespace base {
  12. namespace android {
  13. namespace orderfile {
  14. namespace {
  15. const size_t kStep = sizeof(int);
  16. void CallRecordAddress(int iterations, size_t addr_count) {
  17. for (int i = 0; i < iterations; i++) {
  18. for (size_t caller_addr = kStartOfTextForTesting + kStep;
  19. caller_addr < addr_count; caller_addr += kStep) {
  20. for (size_t callee_addr = caller_addr + kStep; callee_addr < addr_count;
  21. callee_addr += kStep) {
  22. RecordAddressForTesting(callee_addr, caller_addr);
  23. }
  24. }
  25. }
  26. }
  27. void RunBenchmark(size_t iterations, size_t addresses_count, int threads) {
  28. ResetForTesting();
  29. auto iterate = [iterations, addresses_count]() {
  30. CallRecordAddress(iterations, addresses_count);
  31. };
  32. if (threads != 1) {
  33. for (int i = 0; i < threads - 1; ++i)
  34. std::thread(iterate).detach();
  35. }
  36. auto tick = base::TimeTicks::Now();
  37. iterate();
  38. auto tock = base::TimeTicks::Now();
  39. double nanos = static_cast<double>((tock - tick).InNanoseconds());
  40. size_t addresses = (addresses_count - kStartOfTextForTesting - 1) / kStep;
  41. double calls_count = (addresses * (addresses - 1)) / 2;
  42. auto ns_per_call = nanos / (iterations * calls_count);
  43. auto modifier =
  44. base::StringPrintf("_%zu_%zu_%d", iterations, addresses_count, threads);
  45. perf_test::PrintResult("RecordAddressCostPerCall", modifier, "", ns_per_call,
  46. "ns", true);
  47. }
  48. void CheckValid(size_t iterations, size_t addr_count) {
  49. // |reached| is expected to be ordered by callee offset
  50. auto reached = GetOrderedOffsetsForTesting();
  51. size_t buckets_per_callee = 9; // kTotalBuckets * 2 + 1.
  52. size_t callers_per_callee = 3;
  53. size_t addresses = (addr_count - kStartOfTextForTesting - 1) / kStep;
  54. EXPECT_EQ((addresses - 1) * buckets_per_callee, reached.size());
  55. size_t expected_callee = kStartOfTextForTesting + 2 * kStep;
  56. for (size_t i = 0; i < reached.size(); i += buckets_per_callee) {
  57. EXPECT_EQ(reached[i] / 4, (expected_callee - kStartOfTextForTesting) / 4);
  58. size_t callee_index = i / buckets_per_callee;
  59. for (size_t j = 0; j < callers_per_callee; j++) {
  60. EXPECT_EQ(reached[i + j * 2 + 1],
  61. j > callee_index ? 0UL : (j + 1) * kStep);
  62. EXPECT_EQ(reached[i + j * 2 + 2], j > callee_index ? 0UL : iterations);
  63. }
  64. size_t misses = callee_index > 2 ? (callee_index - 2) * iterations : 0UL;
  65. EXPECT_EQ(reached[i + 7], 0UL);
  66. EXPECT_EQ(reached[i + 8], misses);
  67. expected_callee += kStep;
  68. }
  69. }
  70. } // namespace
  71. class OrderfileInstrumentationTest : public ::testing::Test {
  72. // Any tests need to run ResetForTesting() when they start. Because this
  73. // perftest is built with instrumentation enabled, all code including
  74. // ::testing::Test is instrumented. If ResetForTesting() is called earlier,
  75. // for example in setUp(), any test harness code between setUp() and the
  76. // actual test will change the instrumentation offset record in unpredictable
  77. // ways and make these tests unreliable.
  78. };
  79. TEST_F(OrderfileInstrumentationTest, SequentialTest_10_5000) {
  80. size_t iterations = 10;
  81. size_t addr_count = 5000;
  82. ResetForTesting();
  83. CallRecordAddress(iterations, addr_count);
  84. Disable();
  85. CheckValid(iterations, addr_count);
  86. }
  87. TEST_F(OrderfileInstrumentationTest, SequentialTest_10_10000) {
  88. size_t iterations = 10;
  89. size_t addr_count = 10000;
  90. ResetForTesting();
  91. CallRecordAddress(iterations, addr_count);
  92. Disable();
  93. CheckValid(iterations, addr_count);
  94. }
  95. TEST_F(OrderfileInstrumentationTest, OutOfBoundsCaller) {
  96. ResetForTesting();
  97. RecordAddressForTesting(1234, kStartOfTextForTesting);
  98. RecordAddressForTesting(1234, kEndOfTextForTesting + 1);
  99. Disable();
  100. auto reached = GetOrderedOffsetsForTesting();
  101. EXPECT_EQ(reached.size(), 9UL);
  102. EXPECT_EQ(reached[0] / 4, (1234 - kStartOfTextForTesting) / 4);
  103. for (size_t i = 1; i < 8; i++) {
  104. EXPECT_EQ(reached[i], 0UL);
  105. }
  106. EXPECT_EQ(reached[8], 2UL);
  107. }
  108. TEST(OrderfileInstrumentationPerfTest, RecordAddress_10_2000) {
  109. RunBenchmark(10, 2000, 1);
  110. }
  111. TEST(OrderfileInstrumentationPerfTest, RecordAddress_100_2000) {
  112. RunBenchmark(100, 2000, 1);
  113. }
  114. TEST(OrderfileInstrumentationPerfTest, RecordAddress_1000_2000_2) {
  115. RunBenchmark(100, 2000, 2);
  116. }
  117. TEST(OrderfileInstrumentationPerfTest, RecordAddress_1000_2000_3) {
  118. RunBenchmark(100, 2000, 3);
  119. }
  120. TEST(OrderfileInstrumentationPerfTest, RecordAddress_1000_2000_4) {
  121. RunBenchmark(100, 2000, 4);
  122. }
  123. TEST(OrderfileInstrumentationPerfTest, RecordAddress_1000_2000_6) {
  124. RunBenchmark(100, 2000, 6);
  125. }
  126. } // namespace orderfile
  127. } // namespace android
  128. } // namespace base
  129. // Custom runner implementation since base's one requires JNI on Android.
  130. int main(int argc, char** argv) {
  131. testing::InitGoogleTest(&argc, argv);
  132. return RUN_ALL_TESTS();
  133. }