Lines Matching defs:last_non_zero
2964 int qmul, qadd, start_i, last_non_zero, i, dc;
2994 last_non_zero = 0;
3002 last_non_zero = -1;
3017 last_non_zero = i;
3022 for(i=start_i; i<=last_non_zero; i++) {
3051 if(last_non_zero < start_i){
3053 return last_non_zero;
3060 for(i=start_i; i<=last_non_zero; i++){
3154 if(last_non_zero <= 27){
3171 for(i= survivor[0]; i<=last_non_zero + 1; i++){
3187 last_non_zero= last_i - 1;
3190 if(last_non_zero < start_i)
3191 return last_non_zero;
3193 if(last_non_zero == 0 && start_i == 0){
3224 else return last_non_zero;
3230 block[ perm_scantable[last_non_zero] ]= last_level;
3237 return last_non_zero;
3275 int qmul, qadd, start_i, last_non_zero, i, dc;
3323 last_non_zero = s->block_last_index[n];
3357 for(i=start_i; i<=last_non_zero; i++){
3374 if(last_non_zero>0){
3389 analyze_gradient = last_non_zero > 2 || s->avctx->quantizer_noise_shaping >= 3;
3447 if(s->avctx->quantizer_noise_shaping < 3 && i > last_non_zero + 1)
3457 assert(run2>=0 || i >= last_non_zero );
3477 if(i < last_non_zero)
3493 if(i < last_non_zero){
3500 if(next_i < last_non_zero)
3520 if(i < last_non_zero){
3527 if(next_i < last_non_zero)
3576 if(best_coeff > last_non_zero){
3577 last_non_zero= best_coeff;
3598 for(; last_non_zero>=start_i; last_non_zero--){
3599 if(block[perm_scantable[last_non_zero]])
3611 for(i=start_i; i<=last_non_zero; i++){
3629 if(last_non_zero>0){
3635 return last_non_zero;
3642 int i, j, level, last_non_zero, q, start_i;
3668 last_non_zero = 0;
3673 last_non_zero = -1;
3684 last_non_zero = i;
3690 for(i=start_i; i<=last_non_zero; i++) {
3713 ff_block_permute(block, s->dsp.idct_permutation, scantable, last_non_zero);
3715 return last_non_zero;