File: basic.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (92 lines) | stat: -rw-r--r-- 3,064 bytes parent folder | download | duplicates (23)
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
//===-- basic.cpp -----------------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

#include "gwp_asan/tests/harness.h"

TEST_F(CustomGuardedPoolAllocator, BasicAllocation) {
  InitNumSlots(1);
  void *Ptr = GPA.allocate(1);
  EXPECT_NE(nullptr, Ptr);
  EXPECT_TRUE(GPA.pointerIsMine(Ptr));
  EXPECT_EQ(1u, GPA.getSize(Ptr));
  GPA.deallocate(Ptr);
}

TEST_F(DefaultGuardedPoolAllocator, NullptrIsNotMine) {
  EXPECT_FALSE(GPA.pointerIsMine(nullptr));
}

TEST_F(CustomGuardedPoolAllocator, SizedAllocations) {
  InitNumSlots(1);

  std::size_t MaxAllocSize = GPA.getAllocatorState()->maximumAllocationSize();
  EXPECT_TRUE(MaxAllocSize > 0);

  for (unsigned AllocSize = 1; AllocSize <= MaxAllocSize; AllocSize <<= 1) {
    void *Ptr = GPA.allocate(AllocSize);
    EXPECT_NE(nullptr, Ptr);
    EXPECT_TRUE(GPA.pointerIsMine(Ptr));
    EXPECT_EQ(AllocSize, GPA.getSize(Ptr));
    GPA.deallocate(Ptr);
  }
}

TEST_F(DefaultGuardedPoolAllocator, TooLargeAllocation) {
  EXPECT_EQ(nullptr,
            GPA.allocate(GPA.getAllocatorState()->maximumAllocationSize() + 1));
  EXPECT_EQ(nullptr, GPA.allocate(SIZE_MAX, 0));
  EXPECT_EQ(nullptr, GPA.allocate(SIZE_MAX, 1));
  EXPECT_EQ(nullptr, GPA.allocate(0, SIZE_MAX / 2));
  EXPECT_EQ(nullptr, GPA.allocate(1, SIZE_MAX / 2));
  EXPECT_EQ(nullptr, GPA.allocate(SIZE_MAX, SIZE_MAX / 2));
}

TEST_F(DefaultGuardedPoolAllocator, ZeroSizeAndAlignmentAllocations) {
  void *P;
  EXPECT_NE(nullptr, (P = GPA.allocate(0, 0)));
  GPA.deallocate(P);
  EXPECT_NE(nullptr, (P = GPA.allocate(1, 0)));
  GPA.deallocate(P);
  EXPECT_NE(nullptr, (P = GPA.allocate(0, 1)));
  GPA.deallocate(P);
}

TEST_F(DefaultGuardedPoolAllocator, NonPowerOfTwoAlignment) {
  EXPECT_EQ(nullptr, GPA.allocate(0, 3));
  EXPECT_EQ(nullptr, GPA.allocate(1, 3));
  EXPECT_EQ(nullptr, GPA.allocate(0, SIZE_MAX));
  EXPECT_EQ(nullptr, GPA.allocate(1, SIZE_MAX));
}

// Added multi-page slots? You'll need to expand this test.
TEST_F(DefaultGuardedPoolAllocator, TooBigForSinglePageSlots) {
  EXPECT_EQ(nullptr, GPA.allocate(0x1001, 0));
  EXPECT_EQ(nullptr, GPA.allocate(0x1001, 1));
  EXPECT_EQ(nullptr, GPA.allocate(0x1001, 0x1000));
  EXPECT_EQ(nullptr, GPA.allocate(1, 0x2000));
  EXPECT_EQ(nullptr, GPA.allocate(0, 0x2000));
}

TEST_F(CustomGuardedPoolAllocator, AllocAllSlots) {
  constexpr unsigned kNumSlots = 128;
  InitNumSlots(kNumSlots);
  void *Ptrs[kNumSlots];
  for (unsigned i = 0; i < kNumSlots; ++i) {
    Ptrs[i] = GPA.allocate(1);
    EXPECT_NE(nullptr, Ptrs[i]);
    EXPECT_TRUE(GPA.pointerIsMine(Ptrs[i]));
  }

  // This allocation should fail as all the slots are used.
  void *Ptr = GPA.allocate(1);
  EXPECT_EQ(nullptr, Ptr);
  EXPECT_FALSE(GPA.pointerIsMine(nullptr));

  for (unsigned i = 0; i < kNumSlots; ++i)
    GPA.deallocate(Ptrs[i]);
}