VARCem/PDCurses
1
0
Fork 0
mirror of https://github.com/VARCem/PDCurses.git synced 2026-09-25 00:05:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

In wnoutrefresh(), leave out the actually-unchanged ends (left and

Browse Source 
right) for each line (this may come to the whole line). Alleviates the
pain of wtouchwin(). This is more noticeable the slower the back end is;
SDL really brought it out. But it should be faster in most cases, giving
most of the advantages of ncurses' curscr/newscr system (and in a
slightly neater way, IMHO). This part of the code hadn't meaningfully
changed since Pccurses 1.0.
This commit is contained in:
William McBrine
2007-06-21 02:04:06 +00:00
parent 245f4a26db
commit cdd73b4ecc
1 changed files with 30 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
pdcurses/refresh.c
View File

@@ -13,7 +13,7 @@
#include <curspriv.h>
RCSID("$Id: refresh.c,v 1.48 2007/06/14 14:11:30 wmcbrine Exp $")
RCSID("$Id: refresh.c,v 1.49 2007/06/21 02:04:06 wmcbrine Exp $")
/*man-start**************************************************************
@@ -70,8 +70,6 @@ RCSID("$Id: refresh.c,v 1.48 2007/06/14 14:11:30 wmcbrine Exp $")
int wnoutrefresh(WINDOW *win)
{
int first; /* first changed char on line */
int last; /* last changed char on line */
int begy, begx; /* window's place on screen */
int i, j;
@@ -87,26 +85,42 @@ int wnoutrefresh(WINDOW *win)
{
if (win->_firstch[i] != _NO_CHANGE)
{
first = win->_firstch[i];
last = win->_lastch[i];
chtype *src = win->_y[i];
chtype *dest = curscr->_y[j] + begx;
memcpy(&(curscr->_y[j][begx + first]),
&(win->_y[i][first]),
(last - first + 1) * sizeof(chtype));
int first = win->_firstch[i]; /* first changed */
int last = win->_lastch[i]; /* last changed */
first += begx;
last += begx;
/* ignore areas on the outside that are marked
as changed, but really aren't */
if (curscr->_firstch[j] != _NO_CHANGE)
curscr->_firstch[j] =
min(curscr->_firstch[j], first);
else
curscr->_firstch[j] = first;
while (first <= last && src[first] == dest[first])
first++;
curscr->_lastch[j] = max(curscr->_lastch[j], last);
while (last >= first && src[last] == dest[last])
last--;
/* if any have really changed... */
if (first <= last)
{
memcpy(dest + first, src + first,
(last - first + 1) * sizeof(chtype));
first += begx;
last += begx;
if (first < curscr->_firstch[j] ||
curscr->_firstch[j] == _NO_CHANGE)
curscr->_firstch[j] = first;
if (last > curscr->_lastch[j])
curscr->_lastch[j] = last;
}
win->_firstch[i] = _NO_CHANGE; /* updated now */
}
win->_lastch[i] = _NO_CHANGE; /* updated now */
}