138 lines
6.8 KiB
Markdown
138 lines
6.8 KiB
Markdown
|
compilation :
|
||
|
|
gcc -g -pg -o student_rank student_rank.c heapsort.c bubblesort.c
|
||
|
|
|
||
|
|
|
||
|
|
premier test:
|
||
|
|
./student_rank 5 5 1
|
||
|
|
|
||
|
|
lancement de gprof:
|
||
|
|
'''gprof ./student_rank'''
|
||
|
|
|
||
|
|
'''
|
||
|
|
Flat profile:
|
||
|
|
|
||
|
|
Each sample counts as 0.01 seconds.
|
||
|
|
no time accumulated
|
||
|
|
|
||
|
|
% cumulative self self total
|
||
|
|
time seconds seconds calls Ts/call Ts/call name
|
||
|
|
0.00 0.00 0.00 30 0.00 0.00 bubblesort
|
||
|
|
0.00 0.00 0.00 25 0.00 0.00 find_rank_student
|
||
|
|
0.00 0.00 0.00 10 0.00 0.00 print_array
|
||
|
|
0.00 0.00 0.00 5 0.00 0.00 generate_array
|
||
|
|
0.00 0.00 0.00 2 0.00 0.00 free_array
|
||
|
|
0.00 0.00 0.00 2 0.00 0.00 print_student_array
|
||
|
|
0.00 0.00 0.00 1 0.00 0.00 generate_grades
|
||
|
|
0.00 0.00 0.00 1 0.00 0.00 generate_ranks
|
||
|
|
0.00 0.00 0.00 1 0.00 0.00 sort_students
|
||
|
|
|
||
|
|
par exemple on peut voir que la fonction bubblesort a été appelée 30 fois et que la fonction find_rank_student a été appelée 25 fois.
|
||
|
|
|
||
|
|
exemple du call graph :
|
||
|
|
Call graph (explanation follows)
|
||
|
|
|
||
|
|
|
||
|
|
granularity: each sample hit covers 2 byte(s) no time propagated
|
||
|
|
|
||
|
|
index % time self children called name
|
||
|
|
0.00 0.00 5/30 sort_students [9]
|
||
|
|
0.00 0.00 25/30 find_rank_student [2]
|
||
|
|
[1] 0.0 0.00 0.00 30 bubblesort [1]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 25/25 sort_students [9]
|
||
|
|
[2] 0.0 0.00 0.00 25 find_rank_student [2]
|
||
|
|
0.00 0.00 25/30 bubblesort [1]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 10/10 print_student_array [6]
|
||
|
|
[3] 0.0 0.00 0.00 10 print_array [3]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 5/5 generate_grades [7]
|
||
|
|
[4] 0.0 0.00 0.00 5 generate_array [4]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 2/2 main [16]
|
||
|
|
[5] 0.0 0.00 0.00 2 free_array [5]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 2/2 main [16]
|
||
|
|
[6] 0.0 0.00 0.00 2 print_student_array [6]
|
||
|
|
0.00 0.00 10/10 print_array [3]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 1/1 main [16]
|
||
|
|
[7] 0.0 0.00 0.00 1 generate_grades [7]
|
||
|
|
0.00 0.00 5/5 generate_array [4]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 1/1 main [16]
|
||
|
|
[8] 0.0 0.00 0.00 1 generate_ranks [8]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 1/1 main [16]
|
||
|
|
[9] 0.0 0.00 0.00 1 sort_students [9]
|
||
|
|
0.00 0.00 25/25 find_rank_student [2]
|
||
|
|
0.00 0.00 5/30 bubblesort [1]
|
||
|
|
-----------------------------------------------
|
||
|
|
'''
|
||
|
|
|
||
|
|
par exemple on peut voir que la fonction bubblesort a été appelée 30 fois, 5 fois par la fonction sort_students et 25 fois par la fonction find_rank_student.
|
||
|
|
la fonction find_rank_student a été appelée 25 fois par sort_students et à chaque fois elle appelle la fonction bubblesort.
|
||
|
|
|
||
|
|
on a relancé le scénario en changeant les paramètres de la commande :
|
||
|
|
./student_rank 1000 1000 0
|
||
|
|
|
||
|
|
on a relancé gprof avec la commande suivante :
|
||
|
|
gprof ./student_rank
|
||
|
|
|
||
|
|
un apperçu du résultat est donné ci-dessous :
|
||
|
|
Flat profile:
|
||
|
|
|
||
|
|
Each sample counts as 0.01 seconds.
|
||
|
|
% cumulative self self total
|
||
|
|
time seconds seconds calls s/call s/call name
|
||
|
|
83.16 5.11 5.11 1001000 0.00 0.00 bubblesort
|
||
|
|
16.30 6.11 1.00 1000000 0.00 0.00 find_rank_student
|
||
|
|
0.65 6.15 0.04 1 0.04 6.15 sort_students
|
||
|
|
0.00 6.15 0.00 1000 0.00 0.00 generate_array
|
||
|
|
0.00 6.15 0.00 2 0.00 0.00 free_array
|
||
|
|
0.00 6.15 0.00 1 0.00 0.00 generate_grades
|
||
|
|
0.00 6.15 0.00 1 0.00 0.00 generate_ranks
|
||
|
|
|
||
|
|
en comparaison avec le premier scénario, on peut voir que la fonction bubblesort a été appelée 1001000 fois et que la fonction find_rank_student a été appelée 1000000 fois.
|
||
|
|
on peut voir aussi que le programme a passé 6.15 secondes à exécuter alors que dans le premier scénario il n'a pas accumulé de temps.
|
||
|
|
|
||
|
|
exemple du call graph :
|
||
|
|
Call graph (explanation follows)
|
||
|
|
|
||
|
|
|
||
|
|
granularity: each sample hit covers 2 byte(s) for 0.16% of 6.15 seconds
|
||
|
|
|
||
|
|
index % time self children called name
|
||
|
|
0.04 6.11 1/1 main [2]
|
||
|
|
[1] 100.0 0.04 6.11 1 sort_students [1]
|
||
|
|
1.00 5.10 1000000/1000000 find_rank_student [3]
|
||
|
|
0.01 0.00 1000/1001000 bubblesort [4]
|
||
|
|
-----------------------------------------------
|
||
|
|
<spontaneous>
|
||
|
|
[2] 100.0 0.00 6.15 main [2]
|
||
|
|
0.04 6.11 1/1 sort_students [1]
|
||
|
|
0.00 0.00 2/2 free_array [6]
|
||
|
|
0.00 0.00 1/1 generate_grades [7]
|
||
|
|
0.00 0.00 1/1 generate_ranks [8]
|
||
|
|
-----------------------------------------------
|
||
|
|
1.00 5.10 1000000/1000000 sort_students [1]
|
||
|
|
[3] 99.3 1.00 5.10 1000000 find_rank_student [3]
|
||
|
|
5.10 0.00 1000000/1001000 bubblesort [4]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.01 0.00 1000/1001000 sort_students [1]
|
||
|
|
5.10 0.00 1000000/1001000 find_rank_student [3]
|
||
|
|
[4] 83.1 5.11 0.00 1001000 bubblesort [4]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 1000/1000 generate_grades [7]
|
||
|
|
[5] 0.0 0.00 0.00 1000 generate_array [5]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 2/2 main [2]
|
||
|
|
[6] 0.0 0.00 0.00 2 free_array [6]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 1/1 main [2]
|
||
|
|
[7] 0.0 0.00 0.00 1 generate_grades [7]
|
||
|
|
0.00 0.00 1000/1000 generate_array [5]
|
||
|
|
-----------------------------------------------
|
||
|
|
0.00 0.00 1/1 main [2]
|
||
|
|
[8] 0.0 0.00 0.00 1 generate_ranks [8]
|
||
|
|
-----------------------------------------------
|