1; RUN: llvm-profgen --format=text --unsymbolized-profile=%S/Inputs/cold-profile-trimming.raw.prof --binary=%S/Inputs/inline-noprobe2.perfbin --output=%t1 --use-offset=0 2; RUN: llvm-profgen --format=text --llvm-sample-profile=%t1 --binary=%S/Inputs/inline-noprobe2.perfbin --output=%t2 --trim-cold-profile=1 --profile-summary-cold-count=1000 3; RUN: FileCheck %s --input-file %t2 --check-prefix=CHECK-TRIM 4 5 6;CHECK-TRIM: partition_pivot_last:5187:7 7;CHECK-TRIM: partition_pivot_first:3010:5 8;CHECK-TRIM-NOT: quick_sort:903:25 9;CHECK-TRIM-NOT: main:820:0 10 11; original code: 12; clang -O3 -g -fno-optimize-sibling-calls -fdebug-info-for-profiling qsort.c -o a.out 13#include <stdio.h> 14#include <stdlib.h> 15 16void swap(int *a, int *b) { 17 int t = *a; 18 *a = *b; 19 *b = t; 20} 21 22int partition_pivot_last(int* array, int low, int high) { 23 int pivot = array[high]; 24 int i = low - 1; 25 for (int j = low; j < high; j++) 26 if (array[j] < pivot) 27 swap(&array[++i], &array[j]); 28 swap(&array[i + 1], &array[high]); 29 return (i + 1); 30} 31 32int partition_pivot_first(int* array, int low, int high) { 33 int pivot = array[low]; 34 int i = low + 1; 35 for (int j = low + 1; j <= high; j++) 36 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;} 37 swap(&array[i - 1], &array[low]); 38 return i - 1; 39} 40 41void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) { 42 if (low < high) { 43 int pi = (*partition_func)(array, low, high); 44 quick_sort(array, low, pi - 1, partition_func); 45 quick_sort(array, pi + 1, high, partition_func); 46 } 47} 48 49int main() { 50 const int size = 200; 51 int sum = 0; 52 int *array = malloc(size * sizeof(int)); 53 for(int i = 0; i < 100 * 1000; i++) { 54 for(int j = 0; j < size; j++) 55 array[j] = j % 10 ? rand() % size: j; 56 int (*fptr)(int *, int, int) = i % 3 ? partition_pivot_last : partition_pivot_first; 57 quick_sort(array, 0, size - 1, fptr); 58 sum += array[i % size]; 59 } 60 printf("sum=%d\n", sum); 61 62 return 0; 63} 64