diff --git a/gmon.out b/gmon.out new file mode 100644 index 0000000..f9dc424 Binary files /dev/null and b/gmon.out differ diff --git a/modif/notes.md b/modif/notes.md new file mode 100644 index 0000000..f3bda01 --- /dev/null +++ b/modif/notes.md @@ -0,0 +1,138 @@ +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] +----------------------------------------------- + +[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] +----------------------------------------------- \ No newline at end of file diff --git a/student_rank.exe b/student_rank.exe new file mode 100644 index 0000000..b188286 Binary files /dev/null and b/student_rank.exe differ diff --git a/test.txt b/test.txt new file mode 100644 index 0000000..39a4405 --- /dev/null +++ b/test.txt @@ -0,0 +1,272 @@ +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls Ts/call Ts/call name + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2023 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + + +granularity: each sample hit covers 4 byte(s) no time propagated + +index % time self children called name + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2023 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name + +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls Ts/call Ts/call name + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2023 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + + +granularity: each sample hit covers 4 byte(s) no time propagated + +index % time self children called name + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2023 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name +