1; RUN: llvm-profgen --format=text --unsymbolized-profile=%S/Inputs/fs-discriminator.raw.prof --binary=%S/Inputs/fs-discriminator.perfbin --output=%t1 2; RUN: FileCheck %s --input-file %t1 --check-prefix=CHECK 3; RUN: llvm-profgen --unsymbolized-profile=%S/Inputs/fs-discriminator.raw.prof --binary=%S/Inputs/fs-discriminator.perfbin --output=%t1 4; RUN: llvm-profdata show --sample --show-sec-info-only %t1 | FileCheck %s --check-prefix=CHECK-SECTION 5 6;CHECK-SECTION: ProfileSummarySection - Offset: [[#]], Size: [[#]], Flags: {fs-discriminator} 7 8;CHECK: partition_pivot_last:507:1 9;CHECK: 1: 4 10;CHECK: 2: 4 11;CHECK: 3: 4 12;CHECK: 3.1: 4 13;CHECK: 3.3: 4 14;CHECK: 3.3072: 5 15;CHECK: 3.7169: 4 16;CHECK: 3.7171: 4 17;CHECK: 4: 3 18;CHECK: 4.3072: 6 19;CHECK: 4.12800: 4 20;CHECK: 4.3221238272: 2 21;CHECK: 5: 2 22;CHECK: 5.5120: 2 23;CHECK: 6: 3 24;CHECK: 7: 3 25;CHECK: 5: swap:80 26;CHECK: 1: 2 27;CHECK: 1.1024: 2 28;CHECK: 1.4096: 2 29;CHECK: 2: 2 30;CHECK: 2.9216: 2 31;CHECK: 2.12288: 2 32;CHECK: 3: 2 33;CHECK: 3.512: 2 34;CHECK: 3.3584: 2 35;CHECK: 65532: 2 36;CHECK: 6: swap:51 37;CHECK: 1.14336: 3 38;CHECK: 2.7168: 3 39;CHECK: 2.11776: 3 40;CHECK: 3.13824: 3 41;CHECK: main:369:0 42;CHECK: 0: 0 43;CHECK: 3: 0 44;CHECK: 4.1: 1 45;CHECK: 4.3: 1 46;CHECK: 5.3: 4 47;CHECK: 5.1537: 4 48;CHECK: 6: 4 49;CHECK: 6.1: 3 50;CHECK: 6.3: 4 51;CHECK: 7: 1 52;CHECK: 8: 1 quick_sort:1 53;CHECK: 9: 1 54;CHECK: 11: 0 55;CHECK: 14: 0 56;CHECK: 65499: 2 57;CHECK: partition_pivot_first:298:1 58;CHECK: 0: 1 59;CHECK: 1: 1 60;CHECK: 2: 1 61;CHECK: 3: 1 62;CHECK: 3.1: 1 63;CHECK: 3.11265: 7 64;CHECK: 4: 7 65;CHECK: 4.1: 4 66;CHECK: 4.2: 2 67;CHECK: 4.3: 4 68;CHECK: 5: 1 69;CHECK: 6: 1 70;CHECK: 65516: 1 71;CHECK: 4.2: swap:24 72;CHECK: 1.7168: 2 73;CHECK: 2: 2 74;CHECK: 3.4608: 2 75;CHECK: 5: swap:17 76;CHECK: 1: 1 77;CHECK: 2.229376: 1 78;CHECK: 2.589824: 1 79;CHECK: 3: 1 80;CHECK: quick_sort:122:2 81;CHECK: 0: 2 82;CHECK: 1: 2 83;CHECK: 1.15360: 2 84;CHECK: 2: 2 partition_pivot_first:1 partition_pivot_last:1 85;CHECK: 3: 1 quick_sort:1 86;CHECK: 4: 2 87;CHECK: 6: 2 88;CHECK: 65507: 2 89 90 91; original code: 92; clang -O3 -g -mllvm --enable-fs-discriminator -fdebug-info-for-profiling qsort.c -o a.out 93#include <stdio.h> 94#include <stdlib.h> 95 96void swap(int *a, int *b) { 97 int t = *a; 98 *a = *b; 99 *b = t; 100} 101 102int partition_pivot_last(int* array, int low, int high) { 103 int pivot = array[high]; 104 int i = low - 1; 105 for (int j = low; j < high; j++) 106 if (array[j] < pivot) 107 swap(&array[++i], &array[j]); 108 swap(&array[i + 1], &array[high]); 109 return (i + 1); 110} 111 112int partition_pivot_first(int* array, int low, int high) { 113 int pivot = array[low]; 114 int i = low + 1; 115 for (int j = low + 1; j <= high; j++) 116 if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;} 117 swap(&array[i - 1], &array[low]); 118 return i - 1; 119} 120 121void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) { 122 if (low < high) { 123 int pi = (*partition_func)(array, low, high); 124 quick_sort(array, low, pi - 1, partition_func); 125 quick_sort(array, pi + 1, high, partition_func); 126 } 127} 128 129int main() { 130 const int size = 200; 131 int sum = 0; 132 int *array = malloc(size * sizeof(int)); 133 for(int i = 0; i < 100 * 1000; i++) { 134 for(int j = 0; j < size; j++) 135 array[j] = j % 10 ? rand() % size: j; 136 int (*fptr)(int *, int, int) = i % 3 ? partition_pivot_last : partition_pivot_first; 137 quick_sort(array, 0, size - 1, fptr); 138 sum += array[i % size]; 139 } 140 printf("sum=%d\n", sum); 141 142 return 0; 143} 144