Lines Matching refs:lev
98 int lev,
103 for (lev = s->ndeclevels-1; lev >= 0; lev--){
104 int lh = s->linelen[lev][0],
105 lv = s->linelen[lev][1],
106 mh = s->mod[lev][0],
107 mv = s->mod[lev][1],
173 int lev,
178 for (lev = s->ndeclevels-1; lev >= 0; lev--){
179 int lh = s->linelen[lev][0],
180 lv = s->linelen[lev][1],
181 mh = s->mod[lev][0],
182 mv = s->mod[lev][1],
249 int lev;
259 for (lev = s->ndeclevels-1; lev >= 0; lev--){
260 int lh = s->linelen[lev][0],
261 lv = s->linelen[lev][1],
262 mh = s->mod[lev][0],
263 mv = s->mod[lev][1],
327 int lev;
332 for (lev = 0; lev < s->ndeclevels; lev++) {
333 int lh = s->linelen[lev][0],
334 lv = s->linelen[lev][1],
335 mh = s->mod[lev][0],
336 mv = s->mod[lev][1],
403 int lev;
410 for (lev = 0; lev < s->ndeclevels; lev++) {
411 int lh = s->linelen[lev][0],
412 lv = s->linelen[lev][1],
413 mh = s->mod[lev][0],
414 mv = s->mod[lev][1],
480 int lev;
492 for (lev = 0; lev < s->ndeclevels; lev++) {
493 int lh = s->linelen[lev][0],
494 lv = s->linelen[lev][1],
495 mh = s->mod[lev][0],
496 mv = s->mod[lev][1],
539 int i, j, lev = decomp_levels, maxlen,
551 while (--lev >= 0)
553 s->linelen[lev][i] = b[i][1] - b[i][0];
554 s->mod[lev][i] = b[i][0] & 1;