… | |
… | |
119 | int sb_bot = sb_top + (term->nrow - 1); |
119 | int sb_bot = sb_top + (term->nrow - 1); |
120 | int sb_len = max (term->nrow - 1 - term->top_row, 1); |
120 | int sb_len = max (term->nrow - 1 - term->top_row, 1); |
121 | int sb_size = (sb_bot - sb_top) * size (); |
121 | int sb_size = (sb_bot - sb_top) * size (); |
122 | |
122 | |
123 | top = beg + (sb_top * size ()) / sb_len; |
123 | top = beg + (sb_top * size ()) / sb_len; |
124 | len = sb_size / sb_len + min_height () + (sb_size % sb_len > 0); |
124 | bot = top + sb_size / sb_len + min_height () + (sb_size % sb_len > 0); |
125 | bot = top + len; |
|
|
126 | /* no change */ |
125 | /* no change */ |
127 | if (top == last_top |
126 | if (top == last_top |
128 | && bot == last_bot |
127 | && bot == last_bot |
129 | && (state == last_state |
128 | && (state == last_state |
130 | || !(state == STATE_UP || state == STATE_DOWN))) |
129 | || !(state == STATE_UP || state == STATE_DOWN))) |