File: asan_benchmarks_test.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 (84 lines) | stat: -rw-r--r-- 2,178 bytes parent folder | download | duplicates (26)
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
//===-- asan_benchmarks_test.cpp ---------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
//
// This file is a part of AddressSanitizer, an address sanity checker.
//
// Some benchmarks for the instrumented code.
//===----------------------------------------------------------------------===//

#include "asan_test_utils.h"

template<class T>
__attribute__((noinline))
static void ManyAccessFunc(T *x, size_t n_elements, size_t n_iter) {
  for (size_t iter = 0; iter < n_iter; iter++) {
    break_optimization(0);
    // hand unroll the loop to stress the reg alloc.
    for (size_t i = 0; i <= n_elements - 16; i += 16) {
      x[i + 0] = i;
      x[i + 1] = i;
      x[i + 2] = i;
      x[i + 3] = i;
      x[i + 4] = i;
      x[i + 5] = i;
      x[i + 6] = i;
      x[i + 7] = i;
      x[i + 8] = i;
      x[i + 9] = i;
      x[i + 10] = i;
      x[i + 11] = i;
      x[i + 12] = i;
      x[i + 13] = i;
      x[i + 14] = i;
      x[i + 15] = i;
    }
  }
}

TEST(AddressSanitizer, ManyAccessBenchmark) {
  size_t kLen = 1024;
  int *int_array = new int[kLen];
  ManyAccessFunc(int_array, kLen, 1 << 24);
  delete [] int_array;
}

// access 7 char elements in a 7 byte array (i.e. on the border).
__attribute__((noinline))
static void BorderAccessFunc(char *x, size_t n_iter) {
  for (size_t iter = 0; iter < n_iter; iter++) {
    break_optimization(x);
    x[0] = 0;
    x[1] = 0;
    x[2] = 0;
    x[3] = 0;
    x[4] = 0;
    x[5] = 0;
    x[6] = 0;
  }
}

TEST(AddressSanitizer, BorderAccessBenchmark) {
  char *char_7_array = new char[7];
  BorderAccessFunc(char_7_array, 1 << 30);
  delete [] char_7_array;
}

static void FunctionWithLargeStack() {
  int stack[1000];
  Ident(stack);
}

TEST(AddressSanitizer, FakeStackBenchmark) {
  for (int i = 0; i < 10000000; i++)
    Ident(&FunctionWithLargeStack)();
}

int main(int argc, char **argv) {
  testing::InitGoogleTest(&argc, argv);
  return RUN_ALL_TESTS();
}