stoc.c revision 1.5 1 1.5 jsm /* $NetBSD: stoc.c,v 1.5 1999/09/08 21:17:50 jsm Exp $ */
2 1.3 cgd
3 1.1 tls /*
4 1.1 tls * Copyright (c) 1994
5 1.1 tls * The Regents of the University of California. All rights reserved.
6 1.1 tls *
7 1.1 tls * This code is derived from software contributed to Berkeley by
8 1.1 tls * Ralph Campbell.
9 1.1 tls *
10 1.1 tls * Redistribution and use in source and binary forms, with or without
11 1.1 tls * modification, are permitted provided that the following conditions
12 1.1 tls * are met:
13 1.1 tls * 1. Redistributions of source code must retain the above copyright
14 1.1 tls * notice, this list of conditions and the following disclaimer.
15 1.1 tls * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 tls * notice, this list of conditions and the following disclaimer in the
17 1.1 tls * documentation and/or other materials provided with the distribution.
18 1.1 tls * 3. All advertising materials mentioning features or use of this software
19 1.1 tls * must display the following acknowledgement:
20 1.1 tls * This product includes software developed by the University of
21 1.1 tls * California, Berkeley and its contributors.
22 1.1 tls * 4. Neither the name of the University nor the names of its contributors
23 1.1 tls * may be used to endorse or promote products derived from this software
24 1.1 tls * without specific prior written permission.
25 1.1 tls *
26 1.1 tls * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 tls * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 tls * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 tls * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 tls * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 tls * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 tls * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 tls * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 tls * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 tls * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 tls * SUCH DAMAGE.
37 1.1 tls */
38 1.1 tls
39 1.4 lukem #include <sys/cdefs.h>
40 1.1 tls #ifndef lint
41 1.2 tls #if 0
42 1.1 tls static char sccsid[] = "@(#)stoc.c 8.1 (Berkeley) 7/24/94";
43 1.2 tls #else
44 1.5 jsm __RCSID("$NetBSD: stoc.c,v 1.5 1999/09/08 21:17:50 jsm Exp $");
45 1.2 tls #endif
46 1.1 tls #endif /* not lint */
47 1.1 tls
48 1.4 lukem #include <ctype.h>
49 1.4 lukem #include <stdlib.h>
50 1.1 tls #include "gomoku.h"
51 1.1 tls
52 1.5 jsm const char *letters = "<ABCDEFGHJKLMNOPQRST>";
53 1.1 tls
54 1.1 tls struct mvstr {
55 1.1 tls int m_code;
56 1.5 jsm const char *m_text;
57 1.1 tls };
58 1.5 jsm static const struct mvstr mv[] = {
59 1.4 lukem { RESIGN, "resign" },
60 1.4 lukem { RESIGN, "quit" },
61 1.4 lukem { SAVE, "save" },
62 1.4 lukem { -1, 0 }
63 1.1 tls };
64 1.1 tls
65 1.1 tls /*
66 1.1 tls * Turn the spot number form of a move into the character form.
67 1.1 tls */
68 1.5 jsm const char *
69 1.1 tls stoc(s)
70 1.1 tls int s;
71 1.1 tls {
72 1.1 tls static char buf[32];
73 1.4 lukem int i;
74 1.1 tls
75 1.1 tls for (i = 0; mv[i].m_code >= 0; i++)
76 1.1 tls if (s == mv[i].m_code)
77 1.1 tls return(mv[i].m_text);
78 1.1 tls sprintf(buf, "%c%d", letters[s % BSZ1], s / BSZ1);
79 1.1 tls return(buf);
80 1.1 tls }
81 1.1 tls
82 1.1 tls /*
83 1.1 tls * Turn the character form of a move into the spot number form.
84 1.1 tls */
85 1.4 lukem int
86 1.1 tls ctos(mp)
87 1.5 jsm const char *mp;
88 1.1 tls {
89 1.4 lukem int i;
90 1.1 tls
91 1.1 tls for (i = 0; mv[i].m_code >= 0; i++)
92 1.1 tls if (strcmp(mp, mv[i].m_text) == 0)
93 1.1 tls return(mv[i].m_code);
94 1.1 tls if (!isalpha(mp[0]))
95 1.1 tls return(ILLEGAL);
96 1.1 tls i = atoi(&mp[1]);
97 1.1 tls if (i < 1 || i > 19)
98 1.1 tls return(ILLEGAL);
99 1.1 tls return(PT(lton(mp[0]), i));
100 1.1 tls }
101 1.1 tls
102 1.1 tls /*
103 1.1 tls * Turn a letter into a number.
104 1.1 tls */
105 1.4 lukem int
106 1.1 tls lton(c)
107 1.1 tls int c;
108 1.1 tls {
109 1.4 lukem int i;
110 1.1 tls
111 1.1 tls if (islower(c))
112 1.1 tls c = toupper(c);
113 1.1 tls for (i = 1; i <= BSZ && letters[i] != c; i++)
114 1.1 tls ;
115 1.1 tls return(i);
116 1.1 tls }
117