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