Subversion Repositories HelenOS

Rev

Rev 4264 | Rev 4515 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*  $OpenBSD: screen.c,v 1.13 2006/04/20 03:25:36 ray Exp $ */
  2. /*  $NetBSD: screen.c,v 1.4 1995/04/29 01:11:36 mycroft Exp $   */
  3.  
  4. /*-
  5.  * Copyright (c) 1992, 1993
  6.  *  The Regents of the University of California.  All rights reserved.
  7.  *
  8.  * This code is derived from software contributed to Berkeley by
  9.  * Chris Torek and Darren F. Provine.
  10.  *
  11.  * Redistribution and use in source and binary forms, with or without
  12.  * modification, are permitted provided that the following conditions
  13.  * are met:
  14.  * 1. Redistributions of source code must retain the above copyright
  15.  *    notice, this list of conditions and the following disclaimer.
  16.  * 2. Redistributions in binary form must reproduce the above copyright
  17.  *    notice, this list of conditions and the following disclaimer in the
  18.  *    documentation and/or other materials provided with the distribution.
  19.  * 3. Neither the name of the University nor the names of its contributors
  20.  *    may be used to endorse or promote products derived from this software
  21.  *    without specific prior written permission.
  22.  *
  23.  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24.  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25.  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26.  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27.  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28.  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29.  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30.  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31.  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32.  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33.  * SUCH DAMAGE.
  34.  *
  35.  *  @(#)screen.c    8.1 (Berkeley) 5/31/93
  36.  */
  37.  
  38. /** @addtogroup tetris
  39.  * @{
  40.  */
  41. /** @file
  42.  */
  43.  
  44. /*
  45.  * Tetris screen control.
  46.  */
  47.  
  48. #include <err.h>
  49. #include <stdio.h>
  50. #include <stdlib.h>
  51. #include <string.h>
  52. #include <unistd.h>
  53. #include <vfs/vfs.h>
  54. #include <async.h>
  55. #include "screen.h"
  56. #include "tetris.h"
  57. #include <io/console.h>
  58.  
  59. static cell curscreen[B_SIZE];  /* 1 => standout (or otherwise marked) */
  60. static int curscore;
  61. static int isset;       /* true => terminal is in game mode */
  62.  
  63.  
  64. /*
  65.  * putstr() is for unpadded strings (either as in termcap(5) or
  66.  * simply literal strings);
  67.  */
  68. static inline void putstr(char *s)
  69. {
  70.     while (*s)
  71.         putchar(*(s++));
  72. }
  73.  
  74. static void start_standout(void)
  75. {
  76.     console_set_rgb_color(fphone(stdout), 0xf0f0f0, 0);
  77. }
  78.  
  79. static void resume_normal(void)
  80. {
  81.     console_set_rgb_color(fphone(stdout), 0, 0xf0f0f0);
  82. }
  83.  
  84. void clear_screen(void)
  85. {
  86.     console_clear(fphone(stdout));
  87.     moveto(0, 0);
  88. }
  89.  
  90. /*
  91.  * Clear the screen, forgetting the current contents in the process.
  92.  */
  93. void
  94. scr_clear(void)
  95. {
  96.  
  97.     resume_normal();
  98.     console_clear(fphone(stdout));
  99.     curscore = -1;
  100.     memset((char *)curscreen, 0, sizeof(curscreen));
  101. }
  102.  
  103. /*
  104.  * Set up screen
  105.  */
  106. void
  107. scr_init(void)
  108. {
  109.     console_cursor_visibility(fphone(stdout), 0);
  110.     resume_normal();
  111.     scr_clear();
  112. }
  113.  
  114. void moveto(int r, int c)
  115. {
  116.     console_goto(fphone(stdout), c, r);
  117. }
  118.  
  119. winsize_t winsize;
  120.  
  121. static int get_display_size(winsize_t *ws)
  122. {
  123.     return console_get_size(fphone(stdout), &ws->ws_col, &ws->ws_row);
  124. }
  125.  
  126. /*
  127.  * Set up screen mode.
  128.  */
  129. void
  130. scr_set(void)
  131. {
  132.     winsize_t ws;
  133.  
  134.     Rows = 0, Cols = 0;
  135.     if (get_display_size(&ws) == 0) {
  136.         Rows = ws.ws_row;
  137.         Cols = ws.ws_col;
  138.     }
  139.     if (Rows < MINROWS || Cols < MINCOLS) {
  140.         char smallscr[55];
  141.  
  142.         snprintf(smallscr, sizeof(smallscr),
  143.             "the screen is too small (must be at least %dx%d)",
  144.             MINROWS, MINCOLS);
  145.         stop(smallscr);
  146.     }
  147.     isset = 1;
  148.  
  149.     scr_clear();
  150. }
  151.  
  152. /*
  153.  * End screen mode.
  154.  */
  155. void
  156. scr_end(void)
  157. {
  158. }
  159.  
  160. void
  161. stop(char *why)
  162. {
  163.  
  164.     if (isset)
  165.         scr_end();
  166.     errx(1, "aborting: %s", why);
  167. }
  168.  
  169.  
  170. /*
  171.  * Update the screen.
  172.  */
  173. void
  174. scr_update(void)
  175. {
  176.     cell *bp, *sp;
  177.     cell so, cur_so = 0;
  178.     int i, ccol, j;
  179.     static const struct shape *lastshape;
  180.  
  181.     /* always leave cursor after last displayed point */
  182.     curscreen[D_LAST * B_COLS - 1] = -1;
  183.  
  184.     if (score != curscore) {
  185.         moveto(0, 0);
  186.         printf("Score: %d", score);
  187.         curscore = score;
  188.     }
  189.  
  190.     /* draw preview of next pattern */
  191.     if (showpreview && (nextshape != lastshape)) {
  192.         int i;
  193.         static int r=5, c=2;
  194.         int tr, tc, t;
  195.  
  196.         lastshape = nextshape;
  197.  
  198.         /* clean */
  199.         resume_normal();
  200.         moveto(r-1, c-1); putstr("          ");
  201.         moveto(r,   c-1); putstr("          ");
  202.         moveto(r+1, c-1); putstr("          ");
  203.         moveto(r+2, c-1); putstr("          ");
  204.  
  205.         moveto(r-3, c-2);
  206.         putstr("Next shape:");
  207.  
  208.         /* draw */
  209.         start_standout();
  210.         moveto(r, 2 * c);
  211.         putstr("  ");
  212.         for (i = 0; i < 3; i++) {
  213.             t = c + r * B_COLS;
  214.             t += nextshape->off[i];
  215.  
  216.             tr = t / B_COLS;
  217.             tc = t % B_COLS;
  218.  
  219.             moveto(tr, 2*tc);
  220.             putstr("  ");
  221.         }
  222.         resume_normal();
  223.     }
  224.  
  225.     bp = &board[D_FIRST * B_COLS];
  226.     sp = &curscreen[D_FIRST * B_COLS];
  227.     for (j = D_FIRST; j < D_LAST; j++) {
  228.         ccol = -1;
  229.         for (i = 0; i < B_COLS; bp++, sp++, i++) {
  230.             if (*sp == (so = *bp))
  231.                 continue;
  232.             *sp = so;
  233.             if (i != ccol) {
  234.                 if (cur_so) {
  235.                     resume_normal();
  236.                     cur_so = 0;
  237.                 }
  238.                 moveto(RTOD(j), CTOD(i));
  239.             }
  240.             if (so != cur_so) {
  241.                 if (so)
  242.                     start_standout();
  243.                 else
  244.                     resume_normal();
  245.                 cur_so = so;
  246.             }
  247.             putstr("  ");
  248.  
  249.             ccol = i + 1;
  250.             /*
  251.              * Look ahead a bit, to avoid extra motion if
  252.              * we will be redrawing the cell after the next.
  253.              * Motion probably takes four or more characters,
  254.              * so we save even if we rewrite two cells
  255.              * `unnecessarily'.  Skip it all, though, if
  256.              * the next cell is a different color.
  257.              */
  258. #define STOP (B_COLS - 3)
  259.             if (i > STOP || sp[1] != bp[1] || so != bp[1])
  260.                 continue;
  261.             if (sp[2] != bp[2])
  262.                 sp[1] = -1;
  263.             else if (i < STOP && so == bp[2] && sp[3] != bp[3]) {
  264.                 sp[2] = -1;
  265.                 sp[1] = -1;
  266.             }
  267.         }
  268.     }
  269.     if (cur_so)
  270.         resume_normal();
  271.     fflush(stdout);
  272. }
  273.  
  274. /*
  275.  * Write a message (set!=0), or clear the same message (set==0).
  276.  * (We need its length in case we have to overwrite with blanks.)
  277.  */
  278. void
  279. scr_msg(char *s, int set)
  280. {
  281.    
  282.     int l = str_size(s);
  283.    
  284.     moveto(Rows - 2, ((Cols - l) >> 1) - 1);
  285.     if (set)
  286.         putstr(s);
  287.     else
  288.         while (--l >= 0)
  289.             (void) putchar(' ');
  290. }
  291.  
  292. /** @}
  293.  */
  294.  
  295.