1 1.6 agc .\" $NetBSD: life.c,v 1.6 2003/08/07 16:44:28 agc Exp $ 2 1.4 perry .\" 3 1.1 cgd .\" Copyright (c) 1980, 1993 4 1.1 cgd .\" The Regents of the University of California. All rights reserved. 5 1.1 cgd .\" 6 1.1 cgd .\" Redistribution and use in source and binary forms, with or without 7 1.1 cgd .\" modification, are permitted provided that the following conditions 8 1.1 cgd .\" are met: 9 1.1 cgd .\" 1. Redistributions of source code must retain the above copyright 10 1.1 cgd .\" notice, this list of conditions and the following disclaimer. 11 1.1 cgd .\" 2. Redistributions in binary form must reproduce the above copyright 12 1.1 cgd .\" notice, this list of conditions and the following disclaimer in the 13 1.1 cgd .\" documentation and/or other materials provided with the distribution. 14 1.6 agc .\" 3. Neither the name of the University nor the names of its contributors 15 1.1 cgd .\" may be used to endorse or promote products derived from this software 16 1.1 cgd .\" without specific prior written permission. 17 1.1 cgd .\" 18 1.1 cgd .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 19 1.1 cgd .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 1.1 cgd .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 1.1 cgd .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 22 1.1 cgd .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 1.1 cgd .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 1.1 cgd .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 1.1 cgd .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 1.1 cgd .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 1.1 cgd .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 1.1 cgd .\" SUCH DAMAGE. 29 1.1 cgd .\" 30 1.3 cgd .\" @(#)life.c 8.1 (Berkeley) 6/8/93 31 1.1 cgd .\" 32 1.1 cgd # include <curses.h> 33 1.1 cgd # include <signal.h> 34 1.1 cgd 35 1.1 cgd /* 36 1.1 cgd * Run a life game. This is a demonstration program for 37 1.1 cgd * the Screen Updating section of the -lcurses cursor package. 38 1.1 cgd */ 39 1.1 cgd 40 1.1 cgd typedef struct lst_st { /* linked list element */ 41 1.1 cgd int y, x; /* (y, x) position of piece */ 42 1.1 cgd struct lst_st *next, *last; /* doubly linked */ 43 1.1 cgd } LIST; 44 1.1 cgd 45 1.1 cgd LIST *Head; /* head of linked list */ 46 1.1 cgd 47 1.1 cgd int die(); 48 1.1 cgd 49 1.1 cgd main(ac, av) 50 1.1 cgd int ac; 51 1.1 cgd char *av[]; 52 1.1 cgd { 53 1.1 cgd evalargs(ac, av); /* evaluate arguments */ 54 1.1 cgd 55 1.1 cgd initscr(); /* initialize screen package */ 56 1.1 cgd signal(SIGINT, die); /* set to restore tty stats */ 57 1.1 cgd cbreak(); /* set for char-by-char */ 58 1.1 cgd noecho(); /* input */ 59 1.1 cgd nonl(); /* for optimization */ 60 1.1 cgd 61 1.1 cgd getstart(); /* get starting position */ 62 1.1 cgd for (;;) { 63 1.1 cgd prboard(); /* print out current board */ 64 1.1 cgd update(); /* update board position */ 65 1.1 cgd } 66 1.1 cgd } 67 1.1 cgd 68 1.1 cgd /* 69 1.1 cgd * This is the routine which is called when rubout is hit. 70 1.1 cgd * It resets the tty stats to their original values. This 71 1.1 cgd * is the normal way of leaving the program. 72 1.1 cgd */ 73 1.1 cgd die() 74 1.1 cgd { 75 1.1 cgd signal(SIGINT, SIG_IGN); /* ignore rubouts */ 76 1.1 cgd mvcur(0, COLS - 1, LINES - 1, 0); /* go to bottom of screen */ 77 1.1 cgd endwin(); /* set terminal to good state */ 78 1.1 cgd exit(0); 79 1.1 cgd } 80 1.1 cgd 81 1.1 cgd /* 82 1.1 cgd * Get the starting position from the user. They keys u, i, o, j, l, 83 1.1 cgd * m, ,, and . are used for moving their relative directions from the 84 1.1 cgd * k key. Thus, u move diagonally up to the left, , moves directly down, 85 1.1 cgd * etc. x places a piece at the current position, " " takes it away. 86 1.1 cgd * The input can also be from a file. The list is built after the 87 1.1 cgd * board setup is ready. 88 1.1 cgd */ 89 1.1 cgd getstart() 90 1.1 cgd { 91 1.1 cgd reg char c; 92 1.1 cgd reg int x, y; 93 1.1 cgd auto char buf[100]; 94 1.1 cgd 95 1.1 cgd box(stdscr, '|', '_'); /* box in the screen */ 96 1.1 cgd move(1, 1); /* move to upper left corner */ 97 1.1 cgd 98 1.1 cgd for (;;) { 99 1.1 cgd refresh(); /* print current position */ 100 1.1 cgd if ((c = getch()) == 'q') 101 1.1 cgd break; 102 1.1 cgd switch (c) { 103 1.1 cgd case 'u': 104 1.1 cgd case 'i': 105 1.1 cgd case 'o': 106 1.1 cgd case 'j': 107 1.1 cgd case 'l': 108 1.1 cgd case 'm': 109 1.1 cgd case ',': 110 1.1 cgd case '.': 111 1.1 cgd adjustyx(c); 112 1.1 cgd break; 113 1.1 cgd case 'f': 114 1.1 cgd mvaddstr(0, 0, "File name: "); 115 1.1 cgd getstr(buf); 116 1.1 cgd readfile(buf); 117 1.1 cgd break; 118 1.1 cgd case 'x': 119 1.1 cgd addch('X'); 120 1.1 cgd break; 121 1.1 cgd case ' ': 122 1.1 cgd addch(' '); 123 1.1 cgd break; 124 1.1 cgd } 125 1.1 cgd } 126 1.1 cgd 127 1.1 cgd if (Head != NULL) /* start new list */ 128 1.1 cgd dellist(Head); 129 1.5 simonb Head = malloc(sizeof (LIST)); 130 1.1 cgd 131 1.1 cgd /* 132 1.1 cgd * loop through the screen looking for 'x's, and add a list 133 1.1 cgd * element for each one 134 1.1 cgd */ 135 1.1 cgd for (y = 1; y < LINES - 1; y++) 136 1.1 cgd for (x = 1; x < COLS - 1; x++) { 137 1.1 cgd move(y, x); 138 1.1 cgd if (inch() == 'x') 139 1.1 cgd addlist(y, x); 140 1.1 cgd } 141 1.1 cgd } 142 1.1 cgd 143 1.1 cgd /* 144 1.1 cgd * Print out the current board position from the linked list 145 1.1 cgd */ 146 1.1 cgd prboard() { 147 1.1 cgd 148 1.1 cgd reg LIST *hp; 149 1.1 cgd 150 1.1 cgd erase(); /* clear out last position */ 151 1.1 cgd box(stdscr, '|', '_'); /* box in the screen */ 152 1.1 cgd 153 1.1 cgd /* 154 1.1 cgd * go through the list adding each piece to the newly 155 1.1 cgd * blank board 156 1.1 cgd */ 157 1.1 cgd for (hp = Head; hp; hp = hp->next) 158 1.1 cgd mvaddch(hp->y, hp->x, 'X'); 159 1.1 cgd 160 1.1 cgd refresh(); 161 1.1 cgd } 162