brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.9 KiB · 062290c Raw
49 lines · cpp
1// Check profile with calls to memory intrinsics.2 3// RUN: %clangxx_memprof -O0 %s -o %t && %env_memprof_opts=print_text=true:log_path=stderr %run %t 2>&1 | FileCheck %s4 5// This is actually:6//  Memory allocation stack id = STACKIDP7//   alloc_count 1, size (ave/min/max) 40.00 / 40 / 408//   access_count (ave/min/max): 11.00 / 11 / 119// but we need to look for them in the same CHECK to get the correct STACKIDP.10// CHECK-DAG:  Memory allocation stack id = [[STACKIDP:[0-9]+]]{{[[:space:]].*}} alloc_count 1, size (ave/min/max) 40.00 / 40 / 40{{[[:space:]].*}} access_count (ave/min/max): 11.00 / 11 / 1111//12// This is actually:13//  Memory allocation stack id = STACKIDQ14//   alloc_count 1, size (ave/min/max) 20.00 / 20 / 2015//   access_count (ave/min/max): 6.00 / 6 / 616// but we need to look for them in the same CHECK to get the correct STACKIDQ.17// CHECK-DAG:  Memory allocation stack id = [[STACKIDQ:[0-9]+]]{{[[:space:]].*}} alloc_count 1, size (ave/min/max) 20.00 / 20 / 20{{[[:space:]].*}} access_count (ave/min/max): 6.00 / 6 / 618 19#include <stdio.h>20#include <stdlib.h>21#include <string.h>22 23int main() {24  // This is actually:25  //  Stack for id STACKIDP:26  //    #0 {{.*}} in operator new27  //    #1 {{.*}} in main {{.*}}:@LINE+128  //  but we need to look for them in the same CHECK-DAG.29  // CHECK-DAG: Stack for id [[STACKIDP]]:{{[[:space:]].*}} #0 {{.*}} in operator new{{.*[[:space:]].*}} #1 {{.*}} in main {{.*}}:[[@LINE+1]]30  int *p = new int[10];31 32  // This is actually:33  //  Stack for id STACKIDQ:34  //    #0 {{.*}} in operator new35  //    #1 {{.*}} in main {{.*}}:@LINE+136  //  but we need to look for them in the same CHECK-DAG.37  // CHECK-DAG: Stack for id [[STACKIDQ]]:{{[[:space:]].*}} #0 {{.*}} in operator new{{.*[[:space:]].*}} #1 {{.*}} in main {{.*}}:[[@LINE+1]]38  int *q = new int[5];39 40  memset(p, 1, 10 * sizeof(int));41  memcpy(q, p, 5 * sizeof(int));42  int x = memcmp(p, q, 5 * sizeof(int));43 44  delete[] p;45  delete[] q;46 47  return x;48}49