Lines Matching refs:error
138 * offset, and then compute the resulting error. The cut errors indicate the error that results from
148 * @param[out] error Per angular step, the error.
149 * @param[out] cut_low_weight_error Per angular step, the low weight cut error.
150 * @param[out] cut_high_weight_error Per angular step, the high weight cut error.
162 float* error,
234 // The cut_(lowest/highest)_weight_error indicate the error that results from forcing
238 storea(errval * errscale, error + sp);
255 float* error,
310 // The cut_(lowest/highest)_weight_error indicate the error that results from forcing
314 storea(errval * errscale, error + sp);
350 ASTCENC_ALIGNAS float error[ANGULAR_STEPS];
356 angular_offsets, lowest_weight, weight_span, error,
359 // For each quantization level, find the best error terms. Use packed vectors so data-dependent
368 // Lane<0> = Best error
381 float error_cut_low = error[i] + cut_low_weight_error[i];
382 float error_cut_high = error[i] + cut_high_weight_error[i];
383 float error_cut_low_high = error[i] + cut_low_weight_error[i] + cut_high_weight_error[i];
385 // Check best error against record N
387 vfloat4 new_result = vfloat4(error[i], i_flt, 0.0f, 0.0f);
388 vmask4 mask = vfloat4(best_result.lane<0>()) > vfloat4(error[i]);
391 // Check best error against record N-1 with either cut low or cut high
402 // Check best error against record N-2 with both cut low and high
419 printf("INFO: Unable to find full encoding within search error limit.\n\n");