penwing/kodama-st
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

Optimize tputtab.

Browse source 
Before this patch executing
	printf '\e[10000000000I'
or
	printf '\e[10000000000Z'
resulted in long delay.
This commit is contained in:
noname 2014-04-23 23:12:45 +04:00 committed by Roberto E. Vargas Caballero
parent 1b0b9759dc
commit 844c503c80
1 changed files with 12 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
st.c
View file

@ -375,7 +375,7 @@ static void tmoveto(int, int);
static void tmoveato(int, int); static void tmoveato(int, int);
static void tnew(int, int); static void tnew(int, int);
static void tnewline(int); static void tnewline(int);
static void tputtab(bool); static void tputtab(int);
static void tputc(char *, int); static void tputc(char *, int);
static void treset(void); static void treset(void);
static int tresize(int, int); static int tresize(int, int);
@ -1996,8 +1996,7 @@ csihandle(void) {
break; break;
case 'I': /* CHT -- Cursor Forward Tabulation <n> tab stops */ case 'I': /* CHT -- Cursor Forward Tabulation <n> tab stops */
DEFAULT(csiescseq.arg[0], 1); DEFAULT(csiescseq.arg[0], 1);
while(csiescseq.arg[0]--) tputtab(csiescseq.arg[0]);
tputtab(1);
break; break;
case 'J': /* ED -- Clear screen */ case 'J': /* ED -- Clear screen */
selclear(NULL); selclear(NULL);
@ -2065,8 +2064,7 @@ csihandle(void) {
break; break;
case 'Z': /* CBT -- Cursor Backward Tabulation <n> tab stops */ case 'Z': /* CBT -- Cursor Backward Tabulation <n> tab stops */
DEFAULT(csiescseq.arg[0], 1); DEFAULT(csiescseq.arg[0], 1);
while(csiescseq.arg[0]--) tputtab(-csiescseq.arg[0]);
tputtab(0);
break; break;
case 'd': /* VPA -- Move to <row> */ case 'd': /* VPA -- Move to <row> */
DEFAULT(csiescseq.arg[0], 1); DEFAULT(csiescseq.arg[0], 1);
@ -2281,17 +2279,15 @@ tdump(void) {
} }
void void
tputtab(bool forward) { tputtab(int n) {
uint x = term.c.x; uint x = term.c.x;
if(forward) { if(n > 0) {
if(x == term.col) while(x < term.col && n--)
return;
for(++x; x < term.col && !term.tabs[x]; ++x) for(++x; x < term.col && !term.tabs[x]; ++x)
/* nothing */ ; /* nothing */ ;
} else { } else if(n < 0) {
if(x == 0) while(x > 0 && n++)
return;
for(--x; x > 0 && !term.tabs[x]; --x) for(--x; x > 0 && !term.tabs[x]; --x)
/* nothing */ ; /* nothing */ ;
} }