X-Git-Url: http://ncurses.scripts.mit.edu/?p=ncurses.git;a=blobdiff_plain;f=test%2Ftest_sgr.c;h=509033ed777444b37c94c99c531425e5375664fd;hp=cff9d0d2d9be03c1bf42b5dc7d87fdeffaa5f799;hb=e2e9c09c48b19b24979cafb2d4864f538b5ddd1c;hpb=fd1066cc97c836a67fa2623b6cf7ffd2ece39dc7 diff --git a/test/test_sgr.c b/test/test_sgr.c index cff9d0d2..509033ed 100644 --- a/test/test_sgr.c +++ b/test/test_sgr.c @@ -1,5 +1,5 @@ /**************************************************************************** - * Copyright (c) 2015 Free Software Foundation, Inc. * + * Copyright (c) 2015,2016 Free Software Foundation, Inc. * * * * Permission is hereby granted, free of charge, to any person obtaining a * * copy of this software and associated documentation files (the * @@ -29,13 +29,14 @@ /* * Author: Thomas E. Dickey * - * $Id: test_sgr.c,v 1.4 2015/11/21 22:43:50 tom Exp $ + * $Id: test_sgr.c,v 1.8 2016/09/04 23:30:56 tom Exp $ * * A simple demo of the sgr/sgr0 terminal capabilities. */ #define USE_TINFO #include +#if !HAVE_TIGETSTR static void failed(const char *) GCC_NORETURN; static void @@ -44,6 +45,7 @@ failed(const char *msg) fprintf(stderr, "%s\n", msg); ExitProgram(EXIT_FAILURE); } +#endif #if HAVE_TIGETSTR @@ -59,8 +61,9 @@ static long total_values; static char * make_dbitem(char *p, char *q) { - char *result = malloc(strlen(e_opt) + 2 + (size_t) (p - q)); - sprintf(result, "%s=%.*s", e_opt, (int) (p - q), q); + size_t need = strlen(e_opt) + 2 + (size_t) (p - q); + char *result = malloc(need); + _nc_SPRINTF(result, _nc_SLIMIT(need) "%s=%.*s", e_opt, (int) (p - q), q); return result; } @@ -146,7 +149,7 @@ dumpit(unsigned bits, unsigned ignore, const char *sgr, const char *sgr0) printf("%4d ", bits); bits &= ~ignore; for (n = 0; n < MAXPAR; ++n) { - putchar((bits & (1 << n)) ? params[n] : '-'); + putchar((int) ((bits & (unsigned) (1 << n)) ? params[n] : '-')); } putchar(' '); putp(sgr); @@ -201,7 +204,7 @@ brute_force(const char *name) } else if (!VALID_STRING(my_sgr0)) { fprintf(stderr, "no \"sgr0\" capability found\n"); } else { - char *values[MAXSGR]; + char *values[MAXSGR + MAXPAR]; unsigned j; unsigned ignore = 0; unsigned reason = 0; @@ -236,7 +239,7 @@ brute_force(const char *name) } } for (j = 0; j < MAXPAR; ++j) { - unsigned mask = (1 << j); + unsigned mask = (unsigned) (1 << j); for (count = 0; count < MAXSGR; ++count) { if ((count & mask) != 0) continue;