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