1; RUN: llvm-profgen --format=text --unsymbolized-profile=%S/Inputs/profile-density.raw.prof --binary=%S/Inputs/inline-noprobe2.perfbin --output=%t1 --use-offset=0 --show-density -profile-density-threshold=10 --trim-cold-profile=0 &> %t2 2; RUN: FileCheck %s --input-file %t2 --check-prefix=CHECK-DENSITY 3; RUN: llvm-profgen --format=text --unsymbolized-profile=%S/Inputs/profile-density-cs.raw.prof --binary=%S/Inputs/inline-noprobe2.perfbin --output=%t3 --show-density -profile-density-threshold=1 -profile-density-threshold=10000 &> %t4 4; RUN: FileCheck %s --input-file %t4 --check-prefix=CHECK-DENSITY-CS 5; RUN: llvm-profgen --format=text --unsymbolized-profile=%S/Inputs/profile-density-cs.raw.prof --binary=%S/Inputs/inline-noprobe2.perfbin --output=%t5 --show-density -profile-density-threshold=1 -profile-density-cutoff-hot=800000 &> %t6 6; RUN: FileCheck %s --input-file %t6 --check-prefix=CHECK-DENSITY-CS-80 7 8;CHECK-DENSITY: Sample PGO is estimated to optimize better with 2.9x more samples. Please consider increasing sampling rate or profiling for longer duration to get more samples. 9;CHECK-DENSITY: Functions with density >= 3.5 account for 99.00% total sample counts. 10 11;CHECK-DENSITY-CS: Sample PGO is estimated to optimize better with 12.5x more samples. Please consider increasing sampling rate or profiling for longer duration to get more samples. 12;CHECK-DENSITY-CS: Functions with density >= 800.1 account for 99.00% total sample counts. 13 14;CHECK-DENSITY-CS-80: Functions with density >= 1886.2 account for 80.00% total sample counts. 15 16; original code: 17; clang -O3 -g -fno-optimize-sibling-calls -fdebug-info-for-profiling qsort.c -o a.out 18#include <stdio.h> 19#include <stdlib.h> 20 21void swap(int *a, int *b) { 22 int t = *a; 23 *a = *b; 24 *b = t; 25} 26 27int partition_pivot_last(int* array, int low, int high) { 28 int pivot = array[high]; 29 int i = low - 1; 30 for (int j = low; j < high; j++) 31 if (array[j] < pivot) 32 swap(&array[++i], &array[j]); 33 swap(&array[i + 1], &array[high]); 34 return (i + 1); 35} 36 37int partition_pivot_first(int* array, int low, int high) { 38 int pivot = array[low]; 39 int i = low + 1; 40 for (int j = low + 1; j <= high; j++) 41 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;} 42 swap(&array[i - 1], &array[low]); 43 return i - 1; 44} 45 46void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) { 47 if (low < high) { 48 int pi = (*partition_func)(array, low, high); 49 quick_sort(array, low, pi - 1, partition_func); 50 quick_sort(array, pi + 1, high, partition_func); 51 } 52} 53 54int main() { 55 const int size = 200; 56 int sum = 0; 57 int *array = malloc(size * sizeof(int)); 58 for(int i = 0; i < 100 * 1000; i++) { 59 for(int j = 0; j < size; j++) 60 array[j] = j % 10 ? rand() % size: j; 61 int (*fptr)(int *, int, int) = i % 3 ? partition_pivot_last : partition_pivot_first; 62 quick_sort(array, 0, size - 1, fptr); 63 sum += array[i % size]; 64 } 65 printf("sum=%d\n", sum); 66 67 return 0; 68} 69