1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 1994,2007 Mark Wedel |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
5 | * |
8 | * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
20 | * |
19 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
21 | */ |
23 | |
22 | |
24 | #ifndef FACE_H__ |
23 | #ifndef FACE_H__ |
25 | #define FACE_H__ |
24 | #define FACE_H__ |
26 | |
25 | |
27 | #include <string> |
26 | #include <util.h> |
28 | #include <tr1/unordered_map> |
27 | #include <tr1/unordered_map> |
29 | |
28 | |
30 | #define CHKSUM_SIZE 6 |
29 | #define CHKSUM_MAXLEN 15 |
31 | #define MAX_FACES 10000 // stupid gcfclient artificially limits |
30 | #define MAX_FACES 10000 // stupid gcfclient artificially limits |
32 | |
31 | |
33 | typedef uint16 faceidx; |
32 | typedef uint16 faceidx; |
34 | |
33 | |
35 | extern faceidx blank_face, empty_face; |
34 | extern faceidx blank_face, empty_face, magicmouth_face; |
36 | |
35 | |
37 | struct facedata |
36 | struct facedata |
38 | { |
37 | { |
39 | std::string data; |
38 | refcnt_buf data; // no need to be refcounted actually |
40 | uint8 chksum[CHKSUM_SIZE]; |
39 | uint8 chksum[CHKSUM_MAXLEN]; |
|
|
40 | uint8 chksum_len; |
|
|
41 | |
|
|
42 | facedata () |
|
|
43 | : chksum_len (0) |
|
|
44 | { } |
41 | }; |
45 | }; |
42 | |
46 | |
43 | /* New face structure - this enforces the notion that data is face by |
47 | /* 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 |
48 | * face only - you can not change the color of an item - you need to instead |
45 | * create a new face with that color. |
49 | * create a new face with that color. |
46 | */ |
50 | */ |
47 | struct faceinfo |
51 | struct faceinfo |
48 | { |
52 | { |
|
|
53 | faceinfo () |
|
|
54 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1) |
|
|
55 | { |
|
|
56 | } |
|
|
57 | |
49 | shstr name; |
58 | shstr name; |
50 | std::string meta; |
59 | std::string meta; |
51 | facedata data32, data64; // either 32/64 face or data32 == generic resource |
60 | facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
52 | faceidx number; /* This is the image id. It should be the */ |
61 | faceidx number; /* This is the image id. It should be the */ |
53 | /* same value as its position in the array */ |
62 | /* same value as its position in the array */ |
54 | faceidx smooth; /* the smooth face for this face, or 0 */ |
63 | faceidx smooth; /* the smooth face for this face, or 0 */ |
55 | uint8 type; // 0 normal face, otherwise other resource |
64 | uint8 type; // 0 normal face, otherwise other resource |
56 | uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
65 | uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
57 | uint8 visibility; |
66 | uint8 visibility; |
58 | uint8 magicmap; /* Color to show this in magic map */ |
67 | uint8 magicmap; /* Color to show this in magic map */ |
59 | |
68 | |
60 | faceinfo () |
69 | facedata *data (int faceset) const; |
61 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0) |
|
|
62 | { } |
|
|
63 | |
70 | |
64 | facedata *data (int faceset) const; |
71 | int refcnt; // reference count - 1 |
|
|
72 | void ref () { ++refcnt; } |
|
|
73 | void unref (); |
65 | }; |
74 | }; |
66 | |
75 | |
67 | inline void |
76 | inline void |
68 | object_freezer::put (keyword k, faceinfo *v) |
77 | object_freezer::put (const keyword_string k, faceinfo *v) |
69 | { |
78 | { |
70 | put (k, v ? &v->name : (const char *)0); |
79 | if (expect_true (v)) |
|
|
80 | put (k, v->name); |
|
|
81 | else |
|
|
82 | put (k); |
71 | } |
83 | } |
72 | |
84 | |
73 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t; |
85 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
74 | |
86 | |
75 | extern facehash_t facehash; |
87 | extern facehash_t facehash; |
76 | extern std::vector<faceinfo> faces; |
88 | extern std::vector<faceinfo> faces; |
77 | |
89 | |
78 | /* This returns an the face number of face 'name'. Number is constant |
90 | /* This returns an the face number of face 'name'. Number is constant |
… | |
… | |
84 | * If a face is not found, then defidx is returned. This can be useful |
96 | * If a face is not found, then defidx is returned. This can be useful |
85 | * if you want some default face used, or can be set to negative so that |
97 | * if you want some default face used, or can be set to negative so that |
86 | * it will be known that the face could not be found. |
98 | * it will be known that the face could not be found. |
87 | */ |
99 | */ |
88 | faceidx face_find (const char *name, faceidx defidx = 0); |
100 | faceidx face_find (const char *name, faceidx defidx = 0); |
|
|
101 | faceidx face_alloc (); |
89 | faceinfo *face_info (faceidx idx); |
102 | faceinfo *face_info (faceidx idx); |
90 | facedata *face_data (faceidx idx, int faceset); |
103 | facedata *face_data (faceidx idx, int faceset); |
91 | |
104 | |
92 | struct MapLook |
105 | struct MapLook |
93 | { |
106 | { |
… | |
… | |
109 | static animation &find (const char *name); |
122 | static animation &find (const char *name); |
110 | |
123 | |
111 | void resize (int new_size); |
124 | void resize (int new_size); |
112 | }; |
125 | }; |
113 | |
126 | |
114 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> animhash_t; |
127 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
115 | |
128 | |
116 | extern animhash_t animhash; |
|
|
117 | extern std::vector<animation> animations; |
129 | extern std::vector<animation> animations; |
118 | |
130 | |
119 | #endif |
131 | #endif |
120 | |
132 | |