1*3cab2bb3Spatrick //===-- asan_benchmarks_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 // Some benchmarks for the instrumented code.
12*3cab2bb3Spatrick //===----------------------------------------------------------------------===//
13*3cab2bb3Spatrick
14*3cab2bb3Spatrick #include "asan_test_utils.h"
15*3cab2bb3Spatrick
16*3cab2bb3Spatrick template<class T>
17*3cab2bb3Spatrick __attribute__((noinline))
ManyAccessFunc(T * x,size_t n_elements,size_t n_iter)18*3cab2bb3Spatrick static void ManyAccessFunc(T *x, size_t n_elements, size_t n_iter) {
19*3cab2bb3Spatrick for (size_t iter = 0; iter < n_iter; iter++) {
20*3cab2bb3Spatrick break_optimization(0);
21*3cab2bb3Spatrick // hand unroll the loop to stress the reg alloc.
22*3cab2bb3Spatrick for (size_t i = 0; i <= n_elements - 16; i += 16) {
23*3cab2bb3Spatrick x[i + 0] = i;
24*3cab2bb3Spatrick x[i + 1] = i;
25*3cab2bb3Spatrick x[i + 2] = i;
26*3cab2bb3Spatrick x[i + 3] = i;
27*3cab2bb3Spatrick x[i + 4] = i;
28*3cab2bb3Spatrick x[i + 5] = i;
29*3cab2bb3Spatrick x[i + 6] = i;
30*3cab2bb3Spatrick x[i + 7] = i;
31*3cab2bb3Spatrick x[i + 8] = i;
32*3cab2bb3Spatrick x[i + 9] = i;
33*3cab2bb3Spatrick x[i + 10] = i;
34*3cab2bb3Spatrick x[i + 11] = i;
35*3cab2bb3Spatrick x[i + 12] = i;
36*3cab2bb3Spatrick x[i + 13] = i;
37*3cab2bb3Spatrick x[i + 14] = i;
38*3cab2bb3Spatrick x[i + 15] = i;
39*3cab2bb3Spatrick }
40*3cab2bb3Spatrick }
41*3cab2bb3Spatrick }
42*3cab2bb3Spatrick
TEST(AddressSanitizer,ManyAccessBenchmark)43*3cab2bb3Spatrick TEST(AddressSanitizer, ManyAccessBenchmark) {
44*3cab2bb3Spatrick size_t kLen = 1024;
45*3cab2bb3Spatrick int *int_array = new int[kLen];
46*3cab2bb3Spatrick ManyAccessFunc(int_array, kLen, 1 << 24);
47*3cab2bb3Spatrick delete [] int_array;
48*3cab2bb3Spatrick }
49*3cab2bb3Spatrick
50*3cab2bb3Spatrick // access 7 char elements in a 7 byte array (i.e. on the border).
51*3cab2bb3Spatrick __attribute__((noinline))
BorderAccessFunc(char * x,size_t n_iter)52*3cab2bb3Spatrick static void BorderAccessFunc(char *x, size_t n_iter) {
53*3cab2bb3Spatrick for (size_t iter = 0; iter < n_iter; iter++) {
54*3cab2bb3Spatrick break_optimization(x);
55*3cab2bb3Spatrick x[0] = 0;
56*3cab2bb3Spatrick x[1] = 0;
57*3cab2bb3Spatrick x[2] = 0;
58*3cab2bb3Spatrick x[3] = 0;
59*3cab2bb3Spatrick x[4] = 0;
60*3cab2bb3Spatrick x[5] = 0;
61*3cab2bb3Spatrick x[6] = 0;
62*3cab2bb3Spatrick }
63*3cab2bb3Spatrick }
64*3cab2bb3Spatrick
TEST(AddressSanitizer,BorderAccessBenchmark)65*3cab2bb3Spatrick TEST(AddressSanitizer, BorderAccessBenchmark) {
66*3cab2bb3Spatrick char *char_7_array = new char[7];
67*3cab2bb3Spatrick BorderAccessFunc(char_7_array, 1 << 30);
68*3cab2bb3Spatrick delete [] char_7_array;
69*3cab2bb3Spatrick }
70*3cab2bb3Spatrick
FunctionWithLargeStack()71*3cab2bb3Spatrick static void FunctionWithLargeStack() {
72*3cab2bb3Spatrick int stack[1000];
73*3cab2bb3Spatrick Ident(stack);
74*3cab2bb3Spatrick }
75*3cab2bb3Spatrick
TEST(AddressSanitizer,FakeStackBenchmark)76*3cab2bb3Spatrick TEST(AddressSanitizer, FakeStackBenchmark) {
77*3cab2bb3Spatrick for (int i = 0; i < 10000000; i++)
78*3cab2bb3Spatrick Ident(&FunctionWithLargeStack)();
79*3cab2bb3Spatrick }
80*3cab2bb3Spatrick
main(int argc,char ** argv)81*3cab2bb3Spatrick int main(int argc, char **argv) {
82*3cab2bb3Spatrick testing::InitGoogleTest(&argc, argv);
83*3cab2bb3Spatrick return RUN_ALL_TESTS();
84*3cab2bb3Spatrick }
85