xref: /openbsd-src/gnu/llvm/compiler-rt/lib/asan/tests/asan_fake_stack_test.cpp (revision 3cab2bb3f667058bece8e38b12449a63a9d73c4b)
1*3cab2bb3Spatrick //===-- asan_fake_stack_test.cpp ------------------------------------------===//
2*3cab2bb3Spatrick //
3*3cab2bb3Spatrick // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4*3cab2bb3Spatrick // See https://llvm.org/LICENSE.txt for license information.
5*3cab2bb3Spatrick // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6*3cab2bb3Spatrick //
7*3cab2bb3Spatrick //===----------------------------------------------------------------------===//
8*3cab2bb3Spatrick //
9*3cab2bb3Spatrick // This file is a part of AddressSanitizer, an address sanity checker.
10*3cab2bb3Spatrick //
11*3cab2bb3Spatrick // Tests for FakeStack.
12*3cab2bb3Spatrick // This test file should be compiled w/o asan instrumentation.
13*3cab2bb3Spatrick //===----------------------------------------------------------------------===//
14*3cab2bb3Spatrick 
15*3cab2bb3Spatrick #include "asan_fake_stack.h"
16*3cab2bb3Spatrick #include "asan_test_utils.h"
17*3cab2bb3Spatrick #include "sanitizer_common/sanitizer_common.h"
18*3cab2bb3Spatrick 
19*3cab2bb3Spatrick #include <assert.h>
20*3cab2bb3Spatrick #include <stdlib.h>
21*3cab2bb3Spatrick #include <stdio.h>
22*3cab2bb3Spatrick 
23*3cab2bb3Spatrick #include <map>
24*3cab2bb3Spatrick 
25*3cab2bb3Spatrick namespace __asan {
26*3cab2bb3Spatrick 
TEST(FakeStack,FlagsSize)27*3cab2bb3Spatrick TEST(FakeStack, FlagsSize) {
28*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::SizeRequiredForFlags(10), 1U << 5);
29*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::SizeRequiredForFlags(11), 1U << 6);
30*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::SizeRequiredForFlags(20), 1U << 15);
31*3cab2bb3Spatrick }
32*3cab2bb3Spatrick 
TEST(FakeStack,RequiredSize)33*3cab2bb3Spatrick TEST(FakeStack, RequiredSize) {
34*3cab2bb3Spatrick   // for (int i = 15; i < 20; i++) {
35*3cab2bb3Spatrick   //  uptr alloc_size = FakeStack::RequiredSize(i);
36*3cab2bb3Spatrick   //  printf("%zdK ==> %zd\n", 1 << (i - 10), alloc_size);
37*3cab2bb3Spatrick   // }
38*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::RequiredSize(15), 365568U);
39*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::RequiredSize(16), 727040U);
40*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::RequiredSize(17), 1449984U);
41*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::RequiredSize(18), 2895872U);
42*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::RequiredSize(19), 5787648U);
43*3cab2bb3Spatrick }
44*3cab2bb3Spatrick 
TEST(FakeStack,FlagsOffset)45*3cab2bb3Spatrick TEST(FakeStack, FlagsOffset) {
46*3cab2bb3Spatrick   for (uptr stack_size_log = 15; stack_size_log <= 20; stack_size_log++) {
47*3cab2bb3Spatrick     uptr stack_size = 1UL << stack_size_log;
48*3cab2bb3Spatrick     uptr offset = 0;
49*3cab2bb3Spatrick     for (uptr class_id = 0; class_id < FakeStack::kNumberOfSizeClasses;
50*3cab2bb3Spatrick          class_id++) {
51*3cab2bb3Spatrick       uptr frame_size = FakeStack::BytesInSizeClass(class_id);
52*3cab2bb3Spatrick       uptr num_flags = stack_size / frame_size;
53*3cab2bb3Spatrick       EXPECT_EQ(offset, FakeStack::FlagsOffset(stack_size_log, class_id));
54*3cab2bb3Spatrick       // printf("%zd: %zd => %zd %zd\n", stack_size_log, class_id, offset,
55*3cab2bb3Spatrick       //        FakeStack::FlagsOffset(stack_size_log, class_id));
56*3cab2bb3Spatrick       offset += num_flags;
57*3cab2bb3Spatrick     }
58*3cab2bb3Spatrick   }
59*3cab2bb3Spatrick }
60*3cab2bb3Spatrick 
61*3cab2bb3Spatrick #if !defined(_WIN32)  // FIXME: Fails due to OOM on Windows.
TEST(FakeStack,CreateDestroy)62*3cab2bb3Spatrick TEST(FakeStack, CreateDestroy) {
63*3cab2bb3Spatrick   for (int i = 0; i < 1000; i++) {
64*3cab2bb3Spatrick     for (uptr stack_size_log = 20; stack_size_log <= 22; stack_size_log++) {
65*3cab2bb3Spatrick       FakeStack *fake_stack = FakeStack::Create(stack_size_log);
66*3cab2bb3Spatrick       fake_stack->Destroy(0);
67*3cab2bb3Spatrick     }
68*3cab2bb3Spatrick   }
69*3cab2bb3Spatrick }
70*3cab2bb3Spatrick #endif
71*3cab2bb3Spatrick 
TEST(FakeStack,ModuloNumberOfFrames)72*3cab2bb3Spatrick TEST(FakeStack, ModuloNumberOfFrames) {
73*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 0, 0), 0U);
74*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 0, (1<<15)), 0U);
75*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 0, (1<<10)), 0U);
76*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 0, (1<<9)), 0U);
77*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 0, (1<<8)), 1U<<8);
78*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 0, (1<<15) + 1), 1U);
79*3cab2bb3Spatrick 
80*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 1, 0), 0U);
81*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 1, 1<<9), 0U);
82*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 1, 1<<8), 0U);
83*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 1, 1<<7), 1U<<7);
84*3cab2bb3Spatrick 
85*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 5, 0), 0U);
86*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 5, 1), 1U);
87*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 5, 15), 15U);
88*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 5, 16), 0U);
89*3cab2bb3Spatrick   EXPECT_EQ(FakeStack::ModuloNumberOfFrames(15, 5, 17), 1U);
90*3cab2bb3Spatrick }
91*3cab2bb3Spatrick 
TEST(FakeStack,GetFrame)92*3cab2bb3Spatrick TEST(FakeStack, GetFrame) {
93*3cab2bb3Spatrick   const uptr stack_size_log = 20;
94*3cab2bb3Spatrick   const uptr stack_size = 1 << stack_size_log;
95*3cab2bb3Spatrick   FakeStack *fs = FakeStack::Create(stack_size_log);
96*3cab2bb3Spatrick   u8 *base = fs->GetFrame(stack_size_log, 0, 0);
97*3cab2bb3Spatrick   EXPECT_EQ(base, reinterpret_cast<u8 *>(fs) +
98*3cab2bb3Spatrick                       fs->SizeRequiredForFlags(stack_size_log) + 4096);
99*3cab2bb3Spatrick   EXPECT_EQ(base + 0*stack_size + 64 * 7, fs->GetFrame(stack_size_log, 0, 7U));
100*3cab2bb3Spatrick   EXPECT_EQ(base + 1*stack_size + 128 * 3, fs->GetFrame(stack_size_log, 1, 3U));
101*3cab2bb3Spatrick   EXPECT_EQ(base + 2*stack_size + 256 * 5, fs->GetFrame(stack_size_log, 2, 5U));
102*3cab2bb3Spatrick   fs->Destroy(0);
103*3cab2bb3Spatrick }
104*3cab2bb3Spatrick 
TEST(FakeStack,Allocate)105*3cab2bb3Spatrick TEST(FakeStack, Allocate) {
106*3cab2bb3Spatrick   const uptr stack_size_log = 19;
107*3cab2bb3Spatrick   FakeStack *fs = FakeStack::Create(stack_size_log);
108*3cab2bb3Spatrick   std::map<FakeFrame *, uptr> s;
109*3cab2bb3Spatrick   for (int iter = 0; iter < 2; iter++) {
110*3cab2bb3Spatrick     s.clear();
111*3cab2bb3Spatrick     for (uptr cid = 0; cid < FakeStack::kNumberOfSizeClasses; cid++) {
112*3cab2bb3Spatrick       uptr n = FakeStack::NumberOfFrames(stack_size_log, cid);
113*3cab2bb3Spatrick       uptr bytes_in_class = FakeStack::BytesInSizeClass(cid);
114*3cab2bb3Spatrick       for (uptr j = 0; j < n; j++) {
115*3cab2bb3Spatrick         FakeFrame *ff = fs->Allocate(stack_size_log, cid, 0);
116*3cab2bb3Spatrick         uptr x = reinterpret_cast<uptr>(ff);
117*3cab2bb3Spatrick         EXPECT_TRUE(s.insert(std::make_pair(ff, cid)).second);
118*3cab2bb3Spatrick         EXPECT_EQ(x, fs->AddrIsInFakeStack(x));
119*3cab2bb3Spatrick         EXPECT_EQ(x, fs->AddrIsInFakeStack(x + 1));
120*3cab2bb3Spatrick         EXPECT_EQ(x, fs->AddrIsInFakeStack(x + bytes_in_class - 1));
121*3cab2bb3Spatrick         EXPECT_NE(x, fs->AddrIsInFakeStack(x + bytes_in_class));
122*3cab2bb3Spatrick       }
123*3cab2bb3Spatrick       // We are out of fake stack, so Allocate should return 0.
124*3cab2bb3Spatrick       EXPECT_EQ(0UL, fs->Allocate(stack_size_log, cid, 0));
125*3cab2bb3Spatrick     }
126*3cab2bb3Spatrick     for (std::map<FakeFrame *, uptr>::iterator it = s.begin(); it != s.end();
127*3cab2bb3Spatrick          ++it) {
128*3cab2bb3Spatrick       fs->Deallocate(reinterpret_cast<uptr>(it->first), it->second);
129*3cab2bb3Spatrick     }
130*3cab2bb3Spatrick   }
131*3cab2bb3Spatrick   fs->Destroy(0);
132*3cab2bb3Spatrick }
133*3cab2bb3Spatrick 
RecursiveFunction(FakeStack * fs,int depth)134*3cab2bb3Spatrick static void RecursiveFunction(FakeStack *fs, int depth) {
135*3cab2bb3Spatrick   uptr class_id = depth / 3;
136*3cab2bb3Spatrick   FakeFrame *ff = fs->Allocate(fs->stack_size_log(), class_id, 0);
137*3cab2bb3Spatrick   if (depth) {
138*3cab2bb3Spatrick     RecursiveFunction(fs, depth - 1);
139*3cab2bb3Spatrick     RecursiveFunction(fs, depth - 1);
140*3cab2bb3Spatrick   }
141*3cab2bb3Spatrick   fs->Deallocate(reinterpret_cast<uptr>(ff), class_id);
142*3cab2bb3Spatrick }
143*3cab2bb3Spatrick 
TEST(FakeStack,RecursiveStressTest)144*3cab2bb3Spatrick TEST(FakeStack, RecursiveStressTest) {
145*3cab2bb3Spatrick   const uptr stack_size_log = 16;
146*3cab2bb3Spatrick   FakeStack *fs = FakeStack::Create(stack_size_log);
147*3cab2bb3Spatrick   RecursiveFunction(fs, 22);  // with 26 runs for 2-3 seconds.
148*3cab2bb3Spatrick   fs->Destroy(0);
149*3cab2bb3Spatrick }
150*3cab2bb3Spatrick 
151*3cab2bb3Spatrick }  // namespace __asan
152