brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.9 KiB · ba169b3 Raw
140 lines · plain
1; RUN: llvm-profgen --unsymbolized-profile=%S/Inputs/fs-discriminator-probe.raw.prof --binary=%S/Inputs/fs-discriminator-probe.perfbin --output=%t12; RUN: llvm-profdata show --sample --show-sec-info-only %t1 | FileCheck %s --check-prefix=CHECK-SECTION3; RUN: llvm-profdata merge --sample %t1 -o %t2 --text4; RUN: FileCheck %s --input-file %t2 --check-prefix=CHECK5 6; CHECK-SECTION: ProfileSummarySection - Offset: [[#]], Size: [[#]], Flags: {fs-discriminator}7 8; CHECK:       partition_pivot_first:29661:27399; CHECK-NEXT:   1: 273910; CHECK-NEXT:   2.1: 273911; CHECK-NEXT:   2.11265: 012; CHECK-NEXT:   3: 645713; CHECK-NEXT:   4: 50814; CHECK-NEXT:   5.1: 50815; CHECK-NEXT:   6.2: 50816; CHECK-NEXT:   7.3: 278017; CHECK-NEXT:   8.4: 018; CHECK-NEXT:   9.2: 019; CHECK-NEXT:   10: 645720; CHECK-NEXT:   11: swap:50821; CHECK-NEXT:    1.7680: 50822; CHECK-NEXT:    !CFGChecksum: 429496729523; CHECK-NEXT:   12: swap:645724; CHECK-NEXT:    1.7168: 645725; CHECK-NEXT:    !CFGChecksum: 429496729526; CHECK-NEXT:   !CFGChecksum: 56315998827419927; CHECK-NEXT:  main:16724:147828; CHECK-NEXT:   1: 147829; CHECK-NEXT:   2.1: 147830; CHECK-NEXT:   2.3585: 031; CHECK-NEXT:   3: 310532; CHECK-NEXT:   5.1: 933; CHECK-NEXT:   5.1537: 034; CHECK-NEXT:   6: 035; CHECK-NEXT:   7: 285936; CHECK-NEXT:   8.1: 937; CHECK-NEXT:   10.3: 038; CHECK-NEXT:   11.2: 039; CHECK-NEXT:   12: 040; CHECK-NEXT:   13.2: 041; CHECK-NEXT:   14: 310542; CHECK-NEXT:   15: 156743; CHECK-NEXT:   16: 944; CHECK-NEXT:   17: 045; CHECK-NEXT:   18: 310546; CHECK-NEXT:   !CFGChecksum: 112617859912065847; CHECK-NEXT:  partition_pivot_last:10497:048; CHECK-NEXT:   1: 049; CHECK-NEXT:   2.1: 050; CHECK-NEXT:   2.6145: 109551; CHECK-NEXT:   2.7681: 24152; CHECK-NEXT:   2.8193: 053; CHECK-NEXT:   3: 109554; CHECK-NEXT:   4: 055; CHECK-NEXT:   4.3072: 109856; CHECK-NEXT:   4.12800: 057; CHECK-NEXT:   5: 058; CHECK-NEXT:   5.5632: 059; CHECK-NEXT:   5.6144: 105360; CHECK-NEXT:   6.1: 109561; CHECK-NEXT:   6.12801: 062; CHECK-NEXT:   6.13825: 24163; CHECK-NEXT:   7.2: 109564; CHECK-NEXT:   7.7170: 24165; CHECK-NEXT:   7.7682: 066; CHECK-NEXT:   8: 109567; CHECK-NEXT:   9: swap:105368; CHECK-NEXT:    1.1024: 105369; CHECK-NEXT:    1.4608: 070; CHECK-NEXT:    1.15360: 071; CHECK-NEXT:    !CFGChecksum: 429496729572; CHECK-NEXT:   10: swap:109573; CHECK-NEXT:    1.14848: 109574; CHECK-NEXT:    !CFGChecksum: 429496729575; CHECK-NEXT:   !CFGChecksum: 56310863928485976; CHECK-NEXT:  quick_sort:4881:251977; CHECK-NEXT:   1: 201678; CHECK-NEXT:   1.15360: 50379; CHECK-NEXT:   2: 50380; CHECK-NEXT:   3: 67881; CHECK-NEXT:   4: 50382; CHECK-NEXT:   5: 67883; CHECK-NEXT:   !CFGChecksum: 84448056620211484 85 86 87; original code:88; clang -O3 -g -mllvm --enable-fs-discriminator -fdebug-info-for-profiling -fpseudo-probe-for-profiling qsort.c -o a.out89#include <stdio.h>90#include <stdlib.h>91 92void swap(int *a, int *b) {93	int t = *a;94	*a = *b;95	*b = t;96}97 98int partition_pivot_last(int* array, int low, int high) {99	int pivot = array[high];100	int i = low - 1;101	for (int j = low; j < high; j++)102		if (array[j] < pivot)103			swap(&array[++i], &array[j]);104	swap(&array[i + 1], &array[high]);105	return (i + 1);106}107 108int partition_pivot_first(int* array, int low, int high) {109	int pivot = array[low];110	int i = low + 1;111	for (int j = low + 1; j <= high; j++)112		if (array[j] < pivot) { if (j != i) swap(&array[i], &array[j]); i++;}113	swap(&array[i - 1], &array[low]);114	return i - 1;115}116 117void quick_sort(int* array, int low, int high, int (*partition_func)(int *, int, int)) {118	if (low < high) {119		int pi = (*partition_func)(array, low, high);120		quick_sort(array, low, pi - 1, partition_func);121		quick_sort(array, pi + 1, high, partition_func);122	}123}124 125int main() {126	const int size = 200;127	int sum = 0;128	int *array = malloc(size * sizeof(int));129	for(int i = 0; i < 100 * 1000; i++) {130		for(int j = 0; j < size; j++)131			array[j] = j % 10 ? rand() % size: j;132		int (*fptr)(int *, int, int) = i % 3 ? partition_pivot_last : partition_pivot_first;133		quick_sort(array, 0, size - 1, fptr);134		sum += array[i % size];135	}136	printf("sum=%d\n", sum);137 138	return 0;139}140