30     int i, m, n;  in iep2_sort()  local
33     for (i = 0; i < size; ++i) {  in iep2_sort()
34         map[i] = i;  in iep2_sort()
35         dat[i] = bin[i];  in iep2_sort()
59     int i;  in iep2_is_subt_mv()  local
61     for (i = 0; i < mv_ls->idx; ++i) {  in iep2_is_subt_mv()
62         if (RKABS(mv_ls->mv[i] - (mv * 4)) < 3)  in iep2_is_subt_mv()
75     int i;  in iep2_update_gmv()  local
82     for (i = 0; i < lbin; ++i) {  in iep2_update_gmv()
83         if (bin[i] == 0)  in iep2_update_gmv()
85         iep_dbg_trace("mv(%d) %d\n", i - MVL, bin[i]);  in iep2_update_gmv()
95         for (i = 0; i < lbin; ++i) {  in iep2_update_gmv()
96             fprintf(stderr, "%d ", map[i]);  in iep2_update_gmv()
105     for (i = 0; i < 8; ++i) {  in iep2_update_gmv()
106         int8_t x = map[i] - MVL;  in iep2_update_gmv()
108         if (bin[map[i]] > r * ((rows * cols) >> 7) ||  in iep2_update_gmv()
112             ctx->params.mv_tru_list[i] = x;  in iep2_update_gmv()
113             ctx->params.mv_tru_vld[i] = 1;  in iep2_update_gmv()
115             if (i == 0) {  in iep2_update_gmv()
123     for (i = 0; i < 8; ++i)  in iep2_update_gmv()
125                       i, ctx->params.mv_tru_list[i], 0, ctx->params.mv_tru_vld[i]);  in iep2_update_gmv()