Lines Matching defs:bot

1557 	int	n, target, cur_period, bot, top, sc_region;
1580 	for (bot = __virtscr->maxy - 1; bot >= 0; bot--) {
1581 		if (__virtscr->alines[bot]->flags & __ISDIRTY &&
1582 		    (__virtscr->alines[bot]->hash != curscr->alines[bot]->hash ||
1583 		     !lineeq(__virtscr->alines[bot]->line,
1584 			     curscr->alines[bot]->line,
1588 			__virtscr->alines[bot]->flags &= ~__ISDIRTY;
1599 	for (i = top + 1, j = 0; i < bot; i++) {
1616 	if (bot < __virtscr->maxy - 1)
1635 	for (bsize = bot - top; bsize >= THRESH; bsize--) {
1636 		for (startw = top; startw <= bot - bsize; startw++)
1637 			for (starts = top; starts <= bot - bsize; starts++) {
1661 	    "startw=%d, curw=%d, curs=%d, top=%d, bot=%d\n",
1662 	    bsize, THRESH, starts, startw, curw, curs, top, bot);
1672 	if (bot < curs)
1673 		bot = curs - 1;
1773 	 *		      region adjacent to top and bot regions
1777 	sc_region = bot - top + 1;
1781 	for (j = top; j <= bot; j++) {
1791 		    || target > bot)
1797 			    (n < 0 && target <= bot && target > bot + n))
1851 		scrolln(starts, startw, curs, bot, top);
1859 scrolln(int starts, int startw, int curs, int bot, int top)
1894 		    top > 3 || bot + 3 < __virtscr->maxy) &&
1897 			tputs(tiparm(change_scroll_region, top, bot),
1901 			__mvcur(0, 0, bot, 0, 1);
1910 			__mvcur(bot, 0, 0, 0, 1);
1918 			__mvcur(oy, ox, bot, 0, 1);
1933 						__mvcur(oy, ox, bot, 0, 1);
1941 		__mvcur(top, 0, bot - n + 1, 0, 1);
1951 		__mvcur(bot - n + 1, 0, oy, ox, 1);
1964 		    bot + 3 < __virtscr->maxy) && scroll_reverse != NULL)))
1966 			tputs(tiparm(change_scroll_region, top, bot),
1987 		__mvcur(oy, ox, bot + n + 1, 0, 1);
1988 		if (parm_rindex != NULL && bot == __virtscr->maxy)
2001 					    bot == __virtscr->maxy)
2011 		__mvcur(bot + n + 1, 0, top, 0, 1);