stoc.c revision 1.16 1 1.16 rillig /* $NetBSD: stoc.c,v 1.16 2022/05/15 22:56:20 rillig 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.7 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 tls * may be used to endorse or promote products derived from this software
20 1.1 tls * without specific prior written permission.
21 1.1 tls *
22 1.1 tls * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 tls * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 tls * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 tls * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 tls * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 tls * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 tls * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 tls * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 tls * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 tls * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 tls * SUCH DAMAGE.
33 1.1 tls */
34 1.1 tls
35 1.4 lukem #include <sys/cdefs.h>
36 1.1 tls #ifndef lint
37 1.2 tls #if 0
38 1.1 tls static char sccsid[] = "@(#)stoc.c 8.1 (Berkeley) 7/24/94";
39 1.2 tls #else
40 1.16 rillig __RCSID("$NetBSD: stoc.c,v 1.16 2022/05/15 22:56:20 rillig Exp $");
41 1.2 tls #endif
42 1.1 tls #endif /* not lint */
43 1.1 tls
44 1.4 lukem #include <ctype.h>
45 1.4 lukem #include <stdlib.h>
46 1.6 matt #include <string.h>
47 1.1 tls #include "gomoku.h"
48 1.1 tls
49 1.5 jsm const char *letters = "<ABCDEFGHJKLMNOPQRST>";
50 1.1 tls
51 1.1 tls struct mvstr {
52 1.1 tls int m_code;
53 1.5 jsm const char *m_text;
54 1.1 tls };
55 1.5 jsm static const struct mvstr mv[] = {
56 1.13 rillig { RESIGN, "resign" },
57 1.4 lukem { RESIGN, "quit" },
58 1.4 lukem { SAVE, "save" },
59 1.4 lukem { -1, 0 }
60 1.1 tls };
61 1.1 tls
62 1.12 dholland static int lton(int);
63 1.12 dholland
64 1.12 dholland
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.10 dholland stoc(int s)
70 1.1 tls {
71 1.1 tls static char buf[32];
72 1.4 lukem int i;
73 1.1 tls
74 1.1 tls for (i = 0; mv[i].m_code >= 0; i++)
75 1.1 tls if (s == mv[i].m_code)
76 1.15 rillig return mv[i].m_text;
77 1.16 rillig snprintf(buf, sizeof(buf), "%c%d",
78 1.16 rillig letters[s % (BSZ + 1)], s / (BSZ + 1));
79 1.15 rillig 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.10 dholland ctos(const char *mp)
87 1.1 tls {
88 1.4 lukem int i;
89 1.1 tls
90 1.1 tls for (i = 0; mv[i].m_code >= 0; i++)
91 1.1 tls if (strcmp(mp, mv[i].m_text) == 0)
92 1.15 rillig return mv[i].m_code;
93 1.8 dsl if (!isalpha((unsigned char)mp[0]))
94 1.15 rillig return ILLEGAL;
95 1.1 tls i = atoi(&mp[1]);
96 1.1 tls if (i < 1 || i > 19)
97 1.15 rillig return ILLEGAL;
98 1.15 rillig return PT(lton((unsigned char)mp[0]), i);
99 1.1 tls }
100 1.1 tls
101 1.1 tls /*
102 1.1 tls * Turn a letter into a number.
103 1.1 tls */
104 1.12 dholland static int
105 1.10 dholland lton(int c)
106 1.1 tls {
107 1.4 lukem int i;
108 1.1 tls
109 1.1 tls if (islower(c))
110 1.1 tls c = toupper(c);
111 1.1 tls for (i = 1; i <= BSZ && letters[i] != c; i++)
112 1.1 tls ;
113 1.15 rillig return i;
114 1.1 tls }
115