stoc.c revision 1.10 1 1.10 dholland /* $NetBSD: stoc.c,v 1.10 2009/06/04 05:27:04 dholland 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.10 dholland __RCSID("$NetBSD: stoc.c,v 1.10 2009/06/04 05:27:04 dholland 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.4 lukem { 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.1 tls /*
63 1.1 tls * Turn the spot number form of a move into the character form.
64 1.1 tls */
65 1.5 jsm const char *
66 1.10 dholland stoc(int s)
67 1.1 tls {
68 1.1 tls static char buf[32];
69 1.4 lukem int i;
70 1.1 tls
71 1.1 tls for (i = 0; mv[i].m_code >= 0; i++)
72 1.1 tls if (s == mv[i].m_code)
73 1.1 tls return(mv[i].m_text);
74 1.1 tls sprintf(buf, "%c%d", letters[s % BSZ1], s / BSZ1);
75 1.1 tls return(buf);
76 1.1 tls }
77 1.1 tls
78 1.1 tls /*
79 1.1 tls * Turn the character form of a move into the spot number form.
80 1.1 tls */
81 1.4 lukem int
82 1.10 dholland ctos(const char *mp)
83 1.1 tls {
84 1.4 lukem int i;
85 1.1 tls
86 1.1 tls for (i = 0; mv[i].m_code >= 0; i++)
87 1.1 tls if (strcmp(mp, mv[i].m_text) == 0)
88 1.1 tls return(mv[i].m_code);
89 1.8 dsl if (!isalpha((unsigned char)mp[0]))
90 1.1 tls return(ILLEGAL);
91 1.1 tls i = atoi(&mp[1]);
92 1.1 tls if (i < 1 || i > 19)
93 1.1 tls return(ILLEGAL);
94 1.9 rillig return(PT(lton((unsigned char)mp[0]), i));
95 1.1 tls }
96 1.1 tls
97 1.1 tls /*
98 1.1 tls * Turn a letter into a number.
99 1.1 tls */
100 1.4 lukem int
101 1.10 dholland lton(int c)
102 1.1 tls {
103 1.4 lukem int i;
104 1.1 tls
105 1.1 tls if (islower(c))
106 1.1 tls c = toupper(c);
107 1.1 tls for (i = 1; i <= BSZ && letters[i] != c; i++)
108 1.1 tls ;
109 1.1 tls return(i);
110 1.1 tls }
111