File: current_allocated_bytes.cpp

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-20
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 1,496,436 kB
  • sloc: cpp: 5,593,990; ansic: 986,873; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,547; xml: 953; cs: 573; fortran: 567
file content (44 lines) | stat: -rw-r--r-- 1,199 bytes parent folder | download | duplicates (27)
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
// RUN: %clangxx_asan -O0 %s -pthread -o %t && %run %t
// RUN: %clangxx_asan -O2 %s -pthread -o %t && %run %t
// REQUIRES: stable-runtime

#include <assert.h>
#include <pthread.h>
#include <sanitizer/allocator_interface.h>
#include <stdio.h>
#include <stdlib.h>

const size_t kLargeAlloc = 1UL << 20;

void* allocate(void *arg) {
  volatile void *ptr = malloc(kLargeAlloc);
  free((void*)ptr);
  return 0;
}

void* check_stats(void *arg) {
  assert(__sanitizer_get_current_allocated_bytes() > 0);
  return 0;
}

int main() {
  size_t used_mem = __sanitizer_get_current_allocated_bytes();
  printf("Before: %zu\n", used_mem);
  const int kNumIterations = 1000;
  for (int iter = 0; iter < kNumIterations; iter++) {
    pthread_t thr[4];
    for (int j = 0; j < 4; j++) {
      assert(0 ==
             pthread_create(&thr[j], 0, (j < 2) ? allocate : check_stats, 0));
    }
    for (int j = 0; j < 4; j++)
      assert(0 == pthread_join(thr[j], 0));
    used_mem = __sanitizer_get_current_allocated_bytes();
    if (used_mem > kLargeAlloc) {
      printf("After iteration %d: %zu\n", iter, used_mem);
      return 1;
    }
  }
  printf("Success after %d iterations\n", kNumIterations);
  return 0;
}