File: reached_addresses_bitset_unittest.cc

package info (click to toggle)
chromium 120.0.6099.224-1~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 6,112,112 kB
  • sloc: cpp: 32,907,025; ansic: 8,148,123; javascript: 3,679,536; python: 2,031,248; asm: 959,718; java: 804,675; xml: 617,256; sh: 111,417; objc: 100,835; perl: 88,443; cs: 53,032; makefile: 29,579; fortran: 24,137; php: 21,162; tcl: 21,147; sql: 20,809; ruby: 17,735; pascal: 12,864; yacc: 8,045; lisp: 3,388; lex: 1,323; ada: 727; awk: 329; jsp: 267; csh: 117; exp: 43; sed: 37
file content (78 lines) | stat: -rw-r--r-- 2,545 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
// Copyright 2019 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "base/android/reached_addresses_bitset.h"

#include <utility>

#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace base {
namespace android {

using testing::ElementsAre;
using testing::ElementsAreArray;

constexpr uintptr_t kStartAddress = 0x1000;
constexpr uintptr_t kEndAddress = 0x2000;
constexpr size_t kStorageSize = 512;

class ReachedAddressesBitsetTest : public testing::Test {
 public:
  ReachedAddressesBitsetTest()
      : bitset_(kStartAddress, kEndAddress, storage_, kStorageSize) {
    memset(storage_, 0, kStorageSize * sizeof(uint32_t));
    EXPECT_TRUE(bitset()->GetReachedOffsets().empty());
  }

  ReachedAddressesBitset* bitset() { return &bitset_; }

 private:
  std::atomic<uint32_t> storage_[kStorageSize];
  ReachedAddressesBitset bitset_;
};

TEST_F(ReachedAddressesBitsetTest, RecordStartAddress) {
  bitset()->RecordAddress(kStartAddress);
  EXPECT_THAT(bitset()->GetReachedOffsets(), ElementsAre(0));
}

TEST_F(ReachedAddressesBitsetTest, RecordLastAddress) {
  bitset()->RecordAddress(kEndAddress - 4);
  EXPECT_THAT(bitset()->GetReachedOffsets(),
              ElementsAre(kEndAddress - 4 - kStartAddress));
}

TEST_F(ReachedAddressesBitsetTest, RecordAddressOutsideOfRange_Small) {
  bitset()->RecordAddress(kStartAddress - 4);
  EXPECT_THAT(bitset()->GetReachedOffsets(), ElementsAre());
}

TEST_F(ReachedAddressesBitsetTest, RecordAddressOutsideOfRange_Large) {
  bitset()->RecordAddress(kEndAddress);
  EXPECT_THAT(bitset()->GetReachedOffsets(), ElementsAre());
}

TEST_F(ReachedAddressesBitsetTest, RecordUnalignedAddresses) {
  constexpr uint32_t aligned_offset = 0x100;
  bitset()->RecordAddress(kStartAddress + aligned_offset + 1);
  bitset()->RecordAddress(kStartAddress + aligned_offset + 2);
  bitset()->RecordAddress(kStartAddress + aligned_offset + 3);
  EXPECT_THAT(bitset()->GetReachedOffsets(), ElementsAre(aligned_offset));
}

TEST_F(ReachedAddressesBitsetTest, FillBitsetOneByOne) {
  std::vector<uint32_t> expected_offsets;
  for (uintptr_t address = kStartAddress; address < kEndAddress; address += 4) {
    bitset()->RecordAddress(address);
    expected_offsets.push_back(address - kStartAddress);
    ASSERT_THAT(bitset()->GetReachedOffsets(),
                ElementsAreArray(expected_offsets))
        << "Last added: " << address;
  }
}

}  // namespace android
}  // namespace base