1999-08-24 01:06:48 +00:00
|
|
|
/*
|
|
|
|
* hashtest.c -- test hash mapping
|
|
|
|
*
|
|
|
|
* Generate timing statistics for vertical-motion optimization.
|
|
|
|
*
|
2002-05-21 05:30:25 +00:00
|
|
|
* $Id: hashtest.c,v 1.21 2002/03/23 22:17:24 tom Exp $
|
1999-08-24 01:06:48 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef TRACE
|
|
|
|
#define Trace(p) _tracef p
|
|
|
|
#define USE_TRACE 1
|
|
|
|
#else
|
2001-05-17 08:21:06 +00:00
|
|
|
#define Trace(p) /* nothing */
|
2000-10-11 07:31:01 +00:00
|
|
|
#define USE_TRACE 0
|
1999-08-24 01:06:48 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <ctype.h>
|
2002-05-21 05:30:25 +00:00
|
|
|
|
|
|
|
#include <test.priv.h>
|
1999-08-24 01:06:48 +00:00
|
|
|
|
|
|
|
#define LO_CHAR ' '
|
|
|
|
#define HI_CHAR '~'
|
|
|
|
|
|
|
|
static bool continuous = FALSE;
|
|
|
|
static bool reverse_loops = FALSE;
|
|
|
|
static bool single_step = FALSE;
|
|
|
|
static bool extend_corner = FALSE;
|
|
|
|
static int foot_lines = 0;
|
|
|
|
static int head_lines = 0;
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
static void
|
|
|
|
cleanup(void)
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
move(LINES - 1, 0);
|
|
|
|
clrtoeol();
|
|
|
|
refresh();
|
|
|
|
endwin();
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
static RETSIGTYPE
|
|
|
|
finish(int sig GCC_UNUSED)
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
cleanup();
|
2002-05-21 05:30:25 +00:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
static void
|
|
|
|
genlines(int base)
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
int i, j;
|
1999-08-24 01:06:48 +00:00
|
|
|
|
|
|
|
#if USE_TRACE
|
2001-05-17 08:21:06 +00:00
|
|
|
if (base == 'a')
|
|
|
|
Trace(("Resetting screen"));
|
|
|
|
else
|
|
|
|
Trace(("Painting `%c' screen", base));
|
1999-08-24 01:06:48 +00:00
|
|
|
#endif
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
/* Do this so writes to lower-right corner don't cause a spurious
|
|
|
|
* scrolling operation. This _shouldn't_ break the scrolling
|
|
|
|
* optimization, since that's computed in the refresh() call.
|
|
|
|
*/
|
|
|
|
scrollok(stdscr, FALSE);
|
|
|
|
|
|
|
|
move(0, 0);
|
|
|
|
for (i = 0; i < head_lines; i++)
|
|
|
|
for (j = 0; j < COLS; j++)
|
|
|
|
addch((j % 8 == 0) ? ('A' + j / 8) : '-');
|
|
|
|
|
|
|
|
move(head_lines, 0);
|
|
|
|
for (i = head_lines; i < LINES - foot_lines; i++) {
|
|
|
|
int c = (base - LO_CHAR + i) % (HI_CHAR - LO_CHAR + 1) + LO_CHAR;
|
|
|
|
int hi = (extend_corner || (i < LINES - 1)) ? COLS : COLS - 1;
|
|
|
|
for (j = 0; j < hi; j++)
|
|
|
|
addch(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = LINES - foot_lines; i < LINES; i++) {
|
|
|
|
move(i, 0);
|
|
|
|
for (j = 0; j < (extend_corner ? COLS : COLS - 1); j++)
|
|
|
|
addch((j % 8 == 0) ? ('A' + j / 8) : '-');
|
|
|
|
}
|
|
|
|
|
|
|
|
scrollok(stdscr, TRUE);
|
|
|
|
if (single_step) {
|
|
|
|
move(LINES - 1, 0);
|
|
|
|
getch();
|
|
|
|
} else
|
|
|
|
refresh();
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
static void
|
|
|
|
one_cycle(int ch)
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
if (continuous) {
|
|
|
|
genlines(ch);
|
|
|
|
} else if (ch != 'a') {
|
|
|
|
genlines('a');
|
|
|
|
genlines(ch);
|
|
|
|
}
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
static void
|
|
|
|
run_test(bool optimized GCC_UNUSED)
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
char ch;
|
|
|
|
int lo = continuous ? LO_CHAR : 'a' - LINES;
|
|
|
|
int hi = continuous ? HI_CHAR : 'a' + LINES;
|
1999-08-24 01:06:48 +00:00
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
if (lo < LO_CHAR)
|
|
|
|
lo = LO_CHAR;
|
|
|
|
if (hi > HI_CHAR)
|
|
|
|
hi = HI_CHAR;
|
1999-08-24 01:06:48 +00:00
|
|
|
|
|
|
|
#if defined(TRACE) || defined(NCURSES_TEST)
|
2001-05-17 08:21:06 +00:00
|
|
|
if (optimized) {
|
|
|
|
Trace(("With hash mapping"));
|
|
|
|
_nc_optimize_enable |= OPTIMIZE_HASHMAP;
|
|
|
|
} else {
|
|
|
|
Trace(("Without hash mapping"));
|
|
|
|
_nc_optimize_enable &= ~OPTIMIZE_HASHMAP;
|
|
|
|
}
|
1999-08-24 01:06:48 +00:00
|
|
|
#endif
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
if (reverse_loops)
|
|
|
|
for (ch = hi; ch >= lo; ch--)
|
|
|
|
one_cycle(ch);
|
|
|
|
else
|
|
|
|
for (ch = lo; ch <= hi; ch++)
|
|
|
|
one_cycle(ch);
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
static void
|
|
|
|
usage(void)
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
static const char *const tbl[] =
|
|
|
|
{
|
|
|
|
"Usage: hashtest [options]"
|
|
|
|
,""
|
|
|
|
,"Options:"
|
|
|
|
," -c continuous (don't reset between refresh's)"
|
|
|
|
," -f num leave 'num' lines constant for footer"
|
|
|
|
," -h num leave 'num' lines constant for header"
|
|
|
|
," -l num repeat test 'num' times"
|
|
|
|
," -n test the normal optimizer"
|
|
|
|
," -o test the hashed optimizer"
|
|
|
|
," -r reverse the loops"
|
|
|
|
," -s single-step"
|
|
|
|
," -x assume lower-right corner extension"
|
|
|
|
};
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
for (n = 0; n < SIZEOF(tbl); n++)
|
|
|
|
fprintf(stderr, "%s\n", tbl[n]);
|
2002-05-21 05:30:25 +00:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
int
|
|
|
|
main(int argc, char *argv[])
|
1999-08-24 01:06:48 +00:00
|
|
|
{
|
2001-05-17 08:21:06 +00:00
|
|
|
int c;
|
|
|
|
int test_loops = 1;
|
|
|
|
int test_normal = FALSE;
|
|
|
|
int test_optimize = FALSE;
|
|
|
|
|
|
|
|
while ((c = getopt(argc, argv, "cf:h:l:norsx")) != EOF) {
|
|
|
|
switch (c) {
|
|
|
|
case 'c':
|
|
|
|
continuous = TRUE;
|
|
|
|
break;
|
|
|
|
case 'f':
|
|
|
|
foot_lines = atoi(optarg);
|
|
|
|
break;
|
|
|
|
case 'h':
|
|
|
|
head_lines = atoi(optarg);
|
|
|
|
break;
|
|
|
|
case 'l':
|
|
|
|
test_loops = atoi(optarg);
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
test_normal = TRUE;
|
|
|
|
break;
|
|
|
|
case 'o':
|
|
|
|
test_optimize = TRUE;
|
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
reverse_loops = TRUE;
|
|
|
|
break;
|
|
|
|
case 's':
|
|
|
|
single_step = TRUE;
|
|
|
|
break;
|
|
|
|
case 'x':
|
|
|
|
extend_corner = TRUE;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
usage();
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
2001-05-17 08:21:06 +00:00
|
|
|
}
|
|
|
|
if (!test_normal && !test_optimize) {
|
|
|
|
test_normal = TRUE;
|
|
|
|
test_optimize = TRUE;
|
|
|
|
}
|
1999-08-24 01:06:48 +00:00
|
|
|
#if USE_TRACE
|
2001-05-17 08:21:06 +00:00
|
|
|
trace(TRACE_TIMES);
|
1999-08-24 01:06:48 +00:00
|
|
|
#endif
|
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
(void) signal(SIGINT, finish); /* arrange interrupts to terminate */
|
1999-08-24 01:06:48 +00:00
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
(void) initscr(); /* initialize the curses library */
|
|
|
|
keypad(stdscr, TRUE); /* enable keyboard mapping */
|
|
|
|
(void) nonl(); /* tell curses not to do NL->CR/NL on output */
|
|
|
|
(void) cbreak(); /* take input chars one at a time, no wait for \n */
|
|
|
|
(void) noecho(); /* don't echo input */
|
|
|
|
scrollok(stdscr, TRUE);
|
1999-08-24 01:06:48 +00:00
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
while (test_loops-- > 0) {
|
|
|
|
if (test_normal)
|
|
|
|
run_test(FALSE);
|
|
|
|
if (test_optimize)
|
|
|
|
run_test(TRUE);
|
|
|
|
}
|
1999-08-24 01:06:48 +00:00
|
|
|
|
2001-05-17 08:21:06 +00:00
|
|
|
cleanup(); /* we're done */
|
2002-05-21 05:30:25 +00:00
|
|
|
ExitProgram(EXIT_SUCCESS);
|
1999-08-24 01:06:48 +00:00
|
|
|
}
|
|
|
|
/* hashtest.c ends here */
|