144 lines · plain
1; RUN: llvm-profgen --format=text --unsymbolized-profile=%S/Inputs/fs-discriminator.raw.prof --binary=%S/Inputs/fs-discriminator.perfbin --output=%t12; RUN: FileCheck %s --input-file %t1 --check-prefix=CHECK3; RUN: llvm-profgen --unsymbolized-profile=%S/Inputs/fs-discriminator.raw.prof --binary=%S/Inputs/fs-discriminator.perfbin --output=%t14; RUN: llvm-profdata show --sample --show-sec-info-only %t1 | FileCheck %s --check-prefix=CHECK-SECTION5 6;CHECK-SECTION: ProfileSummarySection - Offset: [[#]], Size: [[#]], Flags: {fs-discriminator}7 8;CHECK: partition_pivot_last:507:19;CHECK: 1: 410;CHECK: 2: 411;CHECK: 3: 412;CHECK: 3.1: 413;CHECK: 3.3: 414;CHECK: 3.3072: 515;CHECK: 3.7169: 416;CHECK: 3.7171: 417;CHECK: 4: 318;CHECK: 4.3072: 619;CHECK: 4.12800: 420;CHECK: 4.3221238272: 221;CHECK: 5: 222;CHECK: 5.5120: 223;CHECK: 6: 324;CHECK: 7: 325;CHECK: 5: swap:8026;CHECK: 1: 227;CHECK: 1.1024: 228;CHECK: 1.4096: 229;CHECK: 2: 230;CHECK: 2.9216: 231;CHECK: 2.12288: 232;CHECK: 3: 233;CHECK: 3.512: 234;CHECK: 3.3584: 235;CHECK: 65532: 236;CHECK: 6: swap:5137;CHECK: 1.14336: 338;CHECK: 2.7168: 339;CHECK: 2.11776: 340;CHECK: 3.13824: 341;CHECK: main:369:042;CHECK: 0: 043;CHECK: 3: 044;CHECK: 4.1: 145;CHECK: 4.3: 146;CHECK: 5.3: 447;CHECK: 5.1537: 448;CHECK: 6: 449;CHECK: 6.1: 350;CHECK: 6.3: 451;CHECK: 7: 152;CHECK: 8: 1 quick_sort:153;CHECK: 9: 154;CHECK: 11: 055;CHECK: 14: 056;CHECK: 65499: 257;CHECK: partition_pivot_first:298:158;CHECK: 0: 159;CHECK: 1: 160;CHECK: 2: 161;CHECK: 3: 162;CHECK: 3.1: 163;CHECK: 3.11265: 764;CHECK: 4: 765;CHECK: 4.1: 466;CHECK: 4.2: 267;CHECK: 4.3: 468;CHECK: 5: 169;CHECK: 6: 170;CHECK: 65516: 171;CHECK: 4.2: swap:2472;CHECK: 1.7168: 273;CHECK: 2: 274;CHECK: 3.4608: 275;CHECK: 5: swap:1776;CHECK: 1: 177;CHECK: 2.229376: 178;CHECK: 2.589824: 179;CHECK: 3: 180;CHECK: quick_sort:122:281;CHECK: 0: 282;CHECK: 1: 283;CHECK: 1.15360: 284;CHECK: 2: 2 partition_pivot_first:1 partition_pivot_last:185;CHECK: 3: 1 quick_sort:186;CHECK: 4: 287;CHECK: 6: 288;CHECK: 65507: 289 90 91; original code:92; clang -O3 -g -mllvm --enable-fs-discriminator -fdebug-info-for-profiling qsort.c -o a.out93#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