73{
74 int i;
75 int cnt=0;
76 int nummat = *nbmat;
77 int nummid = nummat/2;
78
79 float e_rho_mid;
80 float e_rho_min;
81 float e_rho_max;
82 float e_rho_tmp;
83
85
86 if (tabmat[nummid*3+2] == 0)
87 e_rho_mid = 0;
88 else
89 e_rho_mid = tabmat[nummid*3+1]/tabmat[nummid*3+2];
90
91 e_rho_min = e_rho_mid/100;
92 e_rho_max = e_rho_mid * 100;
93
94
95
96 for(i=0; i<nummat; i++)
97 {
98 if (tabmat[i*3+2] == 0)
99 e_rho_tmp = 0;
100 else
101 e_rho_tmp = tabmat[i*3+1]/tabmat[i*3+2];
102
103
104
105 if (e_rho_tmp<=e_rho_min)
106 {
111 cnt++;
112 }
113 else if (e_rho_tmp>e_rho_max)
114 {
119 cnt++;
120 }
121 }
122
125
126}
void analyse_stack_float(float r)
void analyse_stack_int(int i)
void analyse_call_check(int id)
void analyse_call_error(int type, int id, int mode)
static int compar_mat(const void *mat_1_p, const void *mat_2_p)
recursive subroutine qsort(a, idx, first, last)
1.15.0