compiler-rt/test/memprof/TestCases/test_merge_mib.cpp

   1 // Check that merging of MIB info (min/max size and access counts specifically)
   2 // is done correctly.
   3
   4 // RUN: %clangxx_memprof -O0 %s -o %t
   5 // RUN: %env_memprof_opts=print_text=true:log_path=stderr %run %t 2>&1 | FileCheck %s
   6
   7 // This is actually:
   8 //  Memory allocation stack id = STACKID
   9 //   alloc_count 2, size (ave/min/max) 60.00 / 40 / 80
  10 // but we need to look for them in the same CHECK to get the correct STACKID.
  11 // CHECK:  Memory allocation stack id = [[STACKID:[0-9]+]]{{[[:space:]].*}}alloc_count 2, size (ave/min/max) 60.00 / 40 / 80
  12 // CHECK-NEXT:  access_count (ave/min/max): 30.00 / 20 / 40
  13 // Unfortunately there is not a reliable way to check the ave/min/max lifetime.
  14 // CHECK-NEXT:  lifetime (ave/min/max):
  15 // CHECK-NEXT:  num migrated: {{[0-1]}}, num lifetime overlaps: 0, num same alloc cpu: {{[0-1]}}, num same dealloc_cpu: {{[0-1]}}
  16 // CHECK: Stack for id [[STACKID]]:
  17 // CHECK-NEXT: #0 {{.*}} in operator new
  18 // CHECK-NEXT: #1 {{.*}} in main {{.*}}:[[@LINE+7]]
  19
  20 #include <stdio.h>
  21 #include <stdlib.h>
  22
  23 int main() {
  24   for (int j = 1; j < 3; j++) {
  25     int *p = new int[10 * j];
  26     for (int i = 0; i < 10 * j; i++)
  27       p[i] = i;
  28     int a = 0;
  29     for (int i = 0; i < 10 * j; i++)
  30       a += p[i];
  31     delete[] p;
  32   }
  33
  34   return 0;
  35 }