1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (C) 1992 Frank Tore Johansen |
|
|
7 | * |
5 | * |
8 | * This program is free software; you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation; either version 2 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
9 | * option) any later version. |
12 | * |
10 | * |
13 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
17 | * |
15 | * |
18 | * You should have received a copy of the GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
17 | * and the GNU General Public License along with this program. If not, see |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
18 | * <http://www.gnu.org/licenses/>. |
21 | * |
19 | * |
22 | * The maintainer of this code can be reached at <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
21 | */ |
24 | |
|
|
25 | |
22 | |
26 | #include <global.h> |
23 | #include <global.h> |
27 | #include <stdio.h> |
24 | #include <stdio.h> |
28 | |
25 | |
29 | #include "face.h" |
26 | #include "face.h" |
… | |
… | |
32 | faceidx blank_face, empty_face; |
29 | faceidx blank_face, empty_face; |
33 | |
30 | |
34 | facehash_t facehash; |
31 | facehash_t facehash; |
35 | std::vector<faceinfo> faces; |
32 | std::vector<faceinfo> faces; |
36 | |
33 | |
37 | /* the only thing this table is used for now is to |
|
|
38 | * translate the colorname in the magicmap field of the |
|
|
39 | * face into a numeric index that is then sent to the |
|
|
40 | * client for magic map commands. The order of this table |
|
|
41 | * must match that of the NDI colors in include/newclient.h. |
|
|
42 | */ |
|
|
43 | static const char *const colorname[] = { |
|
|
44 | "black", /* 0 */ |
|
|
45 | "white", /* 1 */ |
|
|
46 | "blue", /* 2 */ |
|
|
47 | "red", /* 3 */ |
|
|
48 | "orange", /* 4 */ |
|
|
49 | "light_blue", /* 5 */ |
|
|
50 | "dark_orange", /* 6 */ |
|
|
51 | "green", /* 7 */ |
|
|
52 | "light_green", /* 8 */ |
|
|
53 | "grey", /* 9 */ |
|
|
54 | "brown", /* 10 */ |
|
|
55 | "yellow", /* 11 */ |
|
|
56 | "khaki" /* 12 */ |
|
|
57 | }; |
|
|
58 | |
|
|
59 | /* |
|
|
60 | * Returns the matching color in the coloralias if found, |
|
|
61 | * 0 otherwise. Note that 0 will actually be black, so there is no |
|
|
62 | * way the calling function can tell if an error occurred or not |
|
|
63 | */ |
|
|
64 | static uint8 |
|
|
65 | find_color (const char *name) |
|
|
66 | { |
|
|
67 | uint8 i; |
|
|
68 | |
|
|
69 | for (i = 0; i < sizeof (colorname) / sizeof (*colorname); i++) |
|
|
70 | if (!strcmp (name, colorname[i])) |
|
|
71 | return i; |
|
|
72 | |
|
|
73 | LOG (llevError, "Unknown color: %s\n", name); |
|
|
74 | return 0; |
|
|
75 | } |
|
|
76 | |
|
|
77 | faceidx |
34 | faceidx |
78 | face_find (const char *name, faceidx defidx) |
35 | face_find (const char *name, faceidx defidx) |
79 | { |
36 | { |
|
|
37 | if (!name) |
|
|
38 | return defidx; |
|
|
39 | |
80 | facehash_t::iterator i = facehash.find (name); |
40 | facehash_t::iterator i = facehash.find (name); |
81 | |
41 | |
82 | return i == facehash.end () |
42 | return i == facehash.end () |
83 | ? defidx : i->second; |
43 | ? defidx : i->second; |
84 | } |
44 | } |
… | |
… | |
93 | |
53 | |
94 | return &faces [idx]; |
54 | return &faces [idx]; |
95 | } |
55 | } |
96 | |
56 | |
97 | facedata * |
57 | facedata * |
|
|
58 | faceinfo::data (int faceset) const |
|
|
59 | { |
|
|
60 | return (facedata *)&(faceset && !type && data64.data.size () ? data64 : data32); |
|
|
61 | } |
|
|
62 | |
|
|
63 | facedata * |
98 | face_data (faceidx idx, int faceset) |
64 | face_data (faceidx idx, int faceset) |
99 | { |
65 | { |
100 | if (faceinfo *f = face_info (idx)) |
66 | if (faceinfo *f = face_info (idx)) |
101 | return &(faceset ? f->data32 : f->data64); |
67 | return f->data (faceset); |
102 | |
68 | |
103 | return 0; |
69 | return 0; |
104 | } |
70 | } |
105 | |
71 | |