Lines Matching refs:i

77     int i,j,k,n,cols;  in arm_mat_solve_upper_triangular_f32()  local
94 for(i=n-1; i >= 0 ; i--) in arm_mat_solve_upper_triangular_f32()
98 vecA = vld1q_f32(&pA[i * cols + j]); in arm_mat_solve_upper_triangular_f32()
100 for(k=n-1; k > i; k--) in arm_mat_solve_upper_triangular_f32()
103 vecA = vfmsq(vecA,vdupq_n_f32(pUT[n*i + k]),vecX); in arm_mat_solve_upper_triangular_f32()
106 if (pUT[n*i + i]==0.0f) in arm_mat_solve_upper_triangular_f32()
111 invUT = 1.0f / pUT[n*i + i]; in arm_mat_solve_upper_triangular_f32()
115 vst1q(&pX[i*cols+j],vecA); in arm_mat_solve_upper_triangular_f32()
122 ut_row = &pUT[n*i]; in arm_mat_solve_upper_triangular_f32()
124 float32_t tmp=a_col[i * cols]; in arm_mat_solve_upper_triangular_f32()
126 for(k=n-1; k > i; k--) in arm_mat_solve_upper_triangular_f32()
131 if (ut_row[i]==0.0f) in arm_mat_solve_upper_triangular_f32()
135 tmp = tmp / ut_row[i]; in arm_mat_solve_upper_triangular_f32()
136 pX[i*cols+j] = tmp; in arm_mat_solve_upper_triangular_f32()
174 int i,j,k,n,cols; in arm_mat_solve_upper_triangular_f32() local
191 for(i=n-1; i >= 0 ; i--) in arm_mat_solve_upper_triangular_f32()
195 vecA = vld1q_f32(&pA[i * cols + j]); in arm_mat_solve_upper_triangular_f32()
197 for(k=n-1; k > i; k--) in arm_mat_solve_upper_triangular_f32()
200 vecA = vfmsq_f32(vecA,vdupq_n_f32(pUT[n*i + k]),vecX); in arm_mat_solve_upper_triangular_f32()
203 if (pUT[n*i + i]==0.0f) in arm_mat_solve_upper_triangular_f32()
208 invUT = 1.0f / pUT[n*i + i]; in arm_mat_solve_upper_triangular_f32()
212 vst1q_f32(&pX[i*cols+j],vecA); in arm_mat_solve_upper_triangular_f32()
219 ut_row = &pUT[n*i]; in arm_mat_solve_upper_triangular_f32()
221 float32_t tmp=a_col[i * cols]; in arm_mat_solve_upper_triangular_f32()
223 for(k=n-1; k > i; k--) in arm_mat_solve_upper_triangular_f32()
228 if (ut_row[i]==0.0f) in arm_mat_solve_upper_triangular_f32()
232 tmp = tmp / ut_row[i]; in arm_mat_solve_upper_triangular_f32()
233 pX[i*cols+j] = tmp; in arm_mat_solve_upper_triangular_f32()
270 int i,j,k,n,cols; in arm_mat_solve_upper_triangular_f32() local
286 for(i=n-1; i >= 0 ; i--) in arm_mat_solve_upper_triangular_f32()
288 float32_t tmp=a_col[i * cols]; in arm_mat_solve_upper_triangular_f32()
290 ut_row = &pUT[n*i]; in arm_mat_solve_upper_triangular_f32()
292 for(k=n-1; k > i; k--) in arm_mat_solve_upper_triangular_f32()
297 if (ut_row[i]==0.0f) in arm_mat_solve_upper_triangular_f32()
301 tmp = tmp / ut_row[i]; in arm_mat_solve_upper_triangular_f32()
302 pX[i*cols+j] = tmp; in arm_mat_solve_upper_triangular_f32()