| 1 | /* |
1 | /* |
| 2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * |
|
|
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
|
|
7 | * the terms of the Affero GNU General Public License as published by the |
|
|
8 | * Free Software Foundation, either version 3 of the License, or (at your |
|
|
9 | * option) any later version. |
|
|
10 | * |
|
|
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. |
|
|
15 | * |
|
|
16 | * You should have received a copy of the Affero GNU General Public License |
|
|
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
|
|
19 | * |
|
|
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
21 | */ |
| 3 | |
22 | |
| 4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
23 | #ifndef FACE_H__ |
| 5 | Copyright (C) 1994 Mark Wedel |
24 | #define FACE_H__ |
| 6 | Copyright (C) 1992 Frank Tore Johansen |
|
|
| 7 | |
25 | |
| 8 | This program is free software; you can redistribute it and/or modify |
26 | #include <util.h> |
| 9 | it under the terms of the GNU General Public License as published by |
27 | #include <tr1/unordered_map> |
| 10 | the Free Software Foundation; either version 2 of the License, or |
|
|
| 11 | (at your option) any later version. |
|
|
| 12 | |
28 | |
| 13 | This program is distributed in the hope that it will be useful, |
29 | #define CHKSUM_MAXLEN 15 |
| 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
30 | #define MAX_FACES 65535 // we reserve face #65535 |
| 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
| 16 | GNU General Public License for more details. |
|
|
| 17 | |
31 | |
| 18 | You should have received a copy of the GNU General Public License |
32 | extern faceidx blank_face, empty_face, magicmouth_face; |
| 19 | along with this program; if not, write to the Free Software |
|
|
| 20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
| 21 | |
33 | |
| 22 | The author can be reached via e-mail to mark@pyramid.com |
34 | struct facedata |
| 23 | */ |
35 | { |
|
|
36 | uint32_t size; |
|
|
37 | uint32_t fofs; // file offste in facedatax |
|
|
38 | uint8 chksum[CHKSUM_MAXLEN]; |
|
|
39 | uint8 chksum_len; |
|
|
40 | |
|
|
41 | facedata () |
|
|
42 | : size (0), fofs (0), chksum_len (0) |
|
|
43 | { } |
|
|
44 | }; |
| 24 | |
45 | |
| 25 | /* New face structure - this enforces the notion that data is face by |
46 | /* New face structure - this enforces the notion that data is face by |
| 26 | * face only - you can not change the color of an item - you need to instead |
47 | * face only - you can not change the color of an item - you need to instead |
| 27 | * create a new face with that color. |
48 | * create a new face with that color. |
| 28 | */ |
49 | */ |
| 29 | struct New_Face |
50 | struct faceinfo |
| 30 | { |
51 | { |
|
|
52 | faceinfo () |
|
|
53 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1), meta_hv (0) |
|
|
54 | { |
|
|
55 | } |
|
|
56 | |
|
|
57 | shstr name; |
|
|
58 | HV *meta_hv; /* note, no destructor of copy constructor, must never be freed, but can be moved aorund */ |
|
|
59 | facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
| 31 | uint16 number; /* This is the image id. It should be the */ |
60 | faceidx number; /* This is the image id. It should be the */ |
| 32 | /* same value as its position in the array */ |
61 | /* same value as its position in the array */ |
| 33 | shstr name; |
62 | faceidx smooth; /* the smooth face for this face, or 0 */ |
|
|
63 | uint8 type; // 0 normal face, otherwise other resource |
|
|
64 | uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
| 34 | uint8 visibility; |
65 | uint8 visibility; |
| 35 | uint8 magicmap; /* Color to show this in magic map */ |
66 | uint8 magicmap; /* Color to show this in magic map */ |
|
|
67 | |
|
|
68 | facedata *data (int faceset) const; |
|
|
69 | |
|
|
70 | int refcnt; // reference count - 1 |
|
|
71 | void ref () { ++refcnt; } |
|
|
72 | void unref (); |
| 36 | }; |
73 | }; |
|
|
74 | |
|
|
75 | inline void |
|
|
76 | object_freezer::put (const keyword_string k, faceinfo *v) |
|
|
77 | { |
|
|
78 | if (expect_true (v)) |
|
|
79 | put (k, v->name); |
|
|
80 | else |
|
|
81 | put (k); |
|
|
82 | } |
|
|
83 | |
|
|
84 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
|
|
85 | |
|
|
86 | extern facehash_t facehash; |
|
|
87 | extern std::vector<faceinfo> faces; |
|
|
88 | |
|
|
89 | /* This returns an the face number of face 'name'. Number is constant |
|
|
90 | * during an invocation, but not necessarily between versions (this |
|
|
91 | * is because the faces are arranged in alphabetical order, so |
|
|
92 | * if a face is removed or added, all faces after that will now |
|
|
93 | * have a different number. |
|
|
94 | * |
|
|
95 | * If a face is not found, then defidx is returned. This can be useful |
|
|
96 | * if you want some default face used, or can be set to negative so that |
|
|
97 | * it will be known that the face could not be found. |
|
|
98 | */ |
|
|
99 | faceidx face_find (const char *name, faceidx defidx = 0); |
|
|
100 | faceidx face_alloc (); |
|
|
101 | faceinfo *face_info (faceidx idx); |
|
|
102 | facedata *face_data (faceidx idx, int faceset); |
| 37 | |
103 | |
| 38 | struct MapLook |
104 | struct MapLook |
| 39 | { |
105 | { |
| 40 | New_Face *face; |
106 | faceinfo *face; |
| 41 | uint8 flags; |
107 | uint8 flags; |
| 42 | }; |
108 | }; |
| 43 | |
109 | |
|
|
110 | typedef uint16 animidx; |
|
|
111 | |
| 44 | struct Animations |
112 | struct animation |
| 45 | { |
113 | { |
|
|
114 | faceidx *faces; /* The different animations */ |
|
|
115 | int num_animations; /* How many different faces to animate */ |
|
|
116 | sint8 facings; /* How many facings (1,2,4,8) */ |
|
|
117 | animidx number; |
| 46 | shstr name; /* Name of the animation sequence */ |
118 | shstr name; /* Name of the animation sequence */ |
| 47 | uint8 num_animations; /* How many different faces to animate */ |
119 | |
| 48 | uint8 facings; /* How many facings (1,2,4,8) */ |
120 | static animation &create (const char *name, uint8 frames, uint8 facings = 1); |
| 49 | uint16 *faces; /* The different animations */ |
121 | static animation &find (const char *name); |
| 50 | uint16 num; /* Where we are in the array */ |
122 | |
|
|
123 | void resize (int new_size); |
| 51 | }; |
124 | }; |
| 52 | |
125 | |
|
|
126 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
|
|
127 | |
|
|
128 | extern std::vector<animation> animations; |
|
|
129 | |
|
|
130 | #endif |
|
|
131 | |
