2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * stmtch.c: Matching operations on structures and commands
30 * Known contributors to this file:
34 * XXX These routines gamble that structures are all longword-aligned.
35 * If this is not true, they will BREAK!
43 * Find NEEDLE in array HAYSTACK[], return its index.
44 * Return M_NOTFOUND if there are no matches, M_NOTUNIQUE if there are
46 * Each array element has a pointer to its name stored at offset OFFS.
47 * Search stops when this name is a null pointer or empty. NEEDLE is
48 * compared to element names with mineq(NEEDLE, NAME).
49 * ELT_SIZE gives the size of an array element.
52 stmtch(char *needle, void *haystack, ptrdiff_t offs, size_t elt_size)
54 #define ELT_NAME(i) (*(char **)((char *)haystack + (i)*elt_size + offs))
58 for (i = 0; ELT_NAME(i) && ELT_NAME(i)[0] != 0; ++i) {
59 switch (mineq(needle, ELT_NAME(i))) {
63 if (res != M_NOTFOUND)
76 * Compare A with B, up to the first space in B.
77 * Return ME_EXACT if they are the same.
78 * Return ME_PARTIAL if A is a prefix of B.
79 * Else return ME_MISMATCH.
80 * Note: May read B beyond the first space, but not beyond a
84 mineq(char *a, char *b)
88 /* find common prefix: */
89 for (i = 0; a[i] != 0 && a[i] == b[i]; ++i) ;
91 if (a[i] != 0) return ME_MISMATCH;
92 if (b[i] == 0 || b[i] == ' ') return ME_EXACT;