2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)table.c 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/games/backgammon/common_source/table.c,v 1.5 1999/11/30 03:48:28 billf Exp $
35 * $DragonFly: src/games/backgammon/common_source/table.c,v 1.2 2003/06/17 04:25:22 dillon Exp $
40 const char *const help2[] = {
41 " Enter moves as <s>-<f> or <s>/<r> where <s> is the starting",
42 "position, <f> is the finishing position, and <r> is the roll.",
43 "Remember, each die roll must be moved separately.",
53 static const struct state atmata[] = {
55 'R', 1, 0, '?', 7, 0, 'Q', 0, -3, 'B', 8, 25,
56 '9', 2, 25, '8', 2, 25, '7', 2, 25, '6', 2, 25,
57 '5', 2, 25, '4', 2, 25, '3', 2, 25, '2', 2, 19,
58 '1', 2, 15, '0', 2, 25, '.', 0, 0, '9', 2, 25,
59 '8', 2, 25, '7', 2, 25, '6', 2, 25, '5', 2, 25,
61 '4', 2, 25, '3', 2, 25, '2', 2, 25, '1', 2, 25,
62 '0', 2, 25, '/', 0, 32, '-', 0, 39, '.', 0, 0,
63 '/', 5, 32, ' ', 6, 3, ',', 6, 3, '\n', 0, -1,
64 '6', 3, 28, '5', 3, 28, '4', 3, 28, '3', 3, 28,
65 '2', 3, 28, '1', 3, 28, '.', 0, 0, 'H', 9, 61,
67 '9', 4, 61, '8', 4, 61, '7', 4, 61, '6', 4, 61,
68 '5', 4, 61, '4', 4, 61, '3', 4, 61, '2', 4, 53,
69 '1', 4, 51, '0', 4, 61, '.', 0, 0, '9', 4, 61,
70 '8', 4, 61, '7', 4, 61, '6', 4, 61, '5', 4, 61,
71 '4', 4, 61, '3', 4, 61, '2', 4, 61, '1', 4, 61,
73 '0', 4, 61, ' ', 6, 3, ',', 6, 3, '-', 5, 39,
74 '\n', 0, -1, '.', 0, 0
95 for (j = 0; j < 5; j++)
105 curmove (cturn == -1? 18: 19,39);
115 if (c == tty.sg_erase && ncin > 0) {
117 curmove (curr,curc-1);
119 if (tty.sg_erase == '\010')
120 writel ("\010 \010");
122 writec (cin[ncin-1]);
136 if (c == tty.sg_kill && ncin > 0) {
142 } else if (tty.sg_erase == '\010') {
143 for (j = 0; j < ncin; j++)
144 writel ("\010 \010");
160 if ((! tflag) || c != '\n')
169 if (n == -1 && mvl >= mvlim)
171 if (n == -1 && mvl < mvlim-1)
176 if (movokay(mvl+1)) {
181 writel ("\t\tMove: ");
182 for (j = 0; j < ncin;)
185 if (movokay(mvl+1)) {
189 curmove (cturn == -1? 18:19,ncin+39);
211 while ( (a = atmata[i].ch) != '.') {
212 if (a == c || (test && a == '\n')) {
213 switch (atmata[i].fcode) {
218 curmove (cturn == -1? 18: 19,0);
229 p[mvl] = p[mvl]*10+c-'0';
238 g[mvl] = p[mvl]+cturn*(c-'0');
249 g[mvl] = g[mvl]*10+c-'0';
270 curmove (cturn == -1? 18: 19,39);
274 writel ("\t\tMove: ");
286 if (! test || a != '\n')
287 return (atmata[i].newst);
303 for (i = 0; i < 4; i++)
305 for (j = 0; j < ncin; j++)
306 n = dotable (cin[j],n);